A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.     

3D Semantic Scene Completion: A Survey

International Journal of Computer Vision - Semantic scene completion (SSC) aims to jointly estimate the complete geometry and semantics of a scene, assuming partial sparse input. In the last years...     

Combination of surface characterization techniques for investigating optical thin-film components

To meet the requirements of comprehensively characterizing the morphology of thin films and substrates, a suitable combination of different measuring techniques should be chosen, i.e., a nonoptical surface profile measurement should be used together with optical analysis. It is demonstrated on selected examples of fluoride and oxide films that the use of atomic force microscopy and light scattering fulfills the demand of appropriate quantitative characterization over a sufficiently large range of bandwidths.     

Differential evolution solution to the SLAM problem

A new solution to the Simultaneous Localization and Modelling problem is presented in this paper. The algorithm is based on the stochastic search for solutions in the state space to the global localization problem by means of a differential evolution algorithm. This non linear evolutive filter, called Evolutive Localization Filter (ELF), searches stochastically along the state space for the best robot pose estimate. The set of pose solutions (the population) focuses on the most likely areas according to the perception and up to date motion information. The population evolves using the log-likelihood of each candidate pose according to the observation and the motion errors derived from the comparison between observed and predicted data obtained from the probabilistic perception and motion model.The proposed SLAM algorithm operates in two steps: in the first step the ELF filter is used at local level to re-localize the robot based on the robot odometry, the laser scan at a given position and a local map where only a low number of the last scans have been integrated. In the second step, the aligned laser measures and the corrected robot poses are used to detect whether the robot is revisiting a previously crossed area (i.e., a cycle in the robot trajectory exists). Once a cycle is detected, the Evolutive Localization Filter is used again to estimate the accumulated residual drift in the detected loop and then to re-estimate the robot poses in order to integrate the sensor measures in the global map of the environment.The algorithm has been tested in different environments to demonstrate the effectiveness, robustness and computational efficiency of the proposed approach.     

Sentinel-1-based flood mapping: a fully automated processing chain

This article presents an automated Sentinel-1-based processing chain designed for flood detection and monitoring in near-real-time (NRT). Since no user intervention is required at any stage of the flood mapping procedure, the processing chain allows deriving time-critical disaster information in less than 45 min after a new data set is available on the Sentinel Data Hub of the European Space Agency (ESA). Due to the systematic acquisition strategy and high repetition rate of Sentinel-1, the processing chain can be set up as a web-based service that regularly informs users about the current flood conditions in a given area of interest. The thematic accuracy of the thematic processor has been assessed for two test sites of a flood situation at the border between Greece and Turkey with encouraging overall accuracies between 94.0% and 96.1% and Cohen’s kappa coefficients (κ) ranging from 0.879 to 0.910. The accuracy assessment, which was performed separately for the standard polarizations (VV/VH) of the interferometric wide swath (IW) mode of Sentinel-1, further indicates that under calm wind conditions, slightly higher thematic accuracies can be achieved by using VV instead of VH polarization data.     

Local closed world reasoning with description logics under the well-founded semantics

An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language.     

A Faà di Bruno Hopf algebra for a group of Fliess operators with applications to feedback

A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback.