Polynomial conjunctive query rewriting under unary inclusion dependencies

Ontology-based data access (OBDA) is widely accepted as an important ingredient of the new generation of information systems. In the OBDA paradigm, potentially incomplete relational data is enriched by means of ontologies, representing intensional knowledge of the application domain. We consider the problem of conjunctive query answering in OBDA. Certain ontology languages have been identified as FO-rewritable (e.g., DL-Lite and sticky-join sets of TGDs), which means that the ontology can be incorporated into the user's query, thus reducing OBDA to standard relational query evaluation. However, all known query rewriting techniques produce queries that are exponentially large in the size of the user's query, which can be a serious issue for standard relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms

Development and commissioning of the ALICE pixel detector control system

The Silicon Pixel Detector (SPD) is the innermost detector of the ALICE Inner Tracking System and the closest one to the interaction point. In order to operate the detector in a safe way, a control system was developed in the framework of PVSS which allows to monitor and control a large number of parameters such as temperatures, currents, voltages, etc. The control system of the SPD implements interlock features to protect the detector against overheating and prevents operating it in case of malfunctions. The nearly 50,000 parameters required to fully configure the detector are stored in a database which employs automatic configuration versions after a new calibration run has been carried out. Several user interface panels were developed to allow experts and non-expert shifters to operate the detector in an easy and safe way. This contribution provides an overview of the SPD control system

Telenoid android robot as an embodied perceptual social regulation medium engaging natural human–humanoid interaction

The present paper aims to validate our research on human–humanoid interaction (HHI) using the minimalist humanoid robot Telenoid. We conducted the human–robot interaction test with 142 young people who had no prior interaction experience with this robot. The main goal is the analysis of the two social dimensions (‘‘Perception’’ and ‘‘Believability’’) useful for increasing the natural behaviour between users and Telenoid.Weadministered our custom questionnaire to human subjects in association with a well defined experimental setting (‘‘ordinary and goal-guided task’’). A thorough analysis of the questionnaires has been carried out and reliability and internal consistency in correlation between the multiple items has been calculated. Our experimental results show that the perceptual behaviour and believability, as implicit social competences, could improve the meaningfulness and the natural-like sense of human–humanoid interaction in everyday life task-driven activities. Telenoid is perceived as an autonomous cooperative agent for a shared environment by human beings

Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules

International audienceThe complete picture of the complexity of answering (unions of) conjunctive queries under the main guarded-based classes of disjunc- tive existential rules has been recently settled. It has been shown that the problem is very hard, namely 2ExpTime-complete, even for fixed sets of rules expressed in lightweight formalisms. This gives rise to the question whether its complexity can be reduced by restricting the query language. Several subclasses of conjunctive queries have been proposed with the aim of reducing the complexity of classical database problems such as query evaluation and query containment. Three of the most prominent subclasses of this kind are queries of bounded hypertree-width, queries of bounded treewidth and acyclic queries. The central objective of the present paper is to understand whether the above query languages have a positive impact on the complexity of query answering under the main guarded-based classes of disjunctive existential rules. We show that (unions of) conjunctive queries of bounded hypertree- width and of bounded treewidth do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive existential rules. Regarding acyclic queries, although our problem remains 2ExpTime-complete in general, in some relevant set- tings the complexity reduces to ExpTime-complete; in fact, this requires to bound the arity of the predicates, and for some expressive guarded- based formalisms, to fix the set of rules

Ontology-based data access with databases: a short course

Ontology-based data access (OBDA) is regarded as a key ingredient of the new generation of information systems. In the OBDA paradigm, an ontology defines a high-level global schema of (already existing) data sources and provides a vocabulary for user queries. An OBDA system rewrites such queries and ontologies into the vocabulary of the data sources and then delegates the actual query evaluation to a suitable query answering system such as a relational database management system or a datalog engine. In this chapter, we mainly focus on OBDA with the ontology language OWL 2QL, one of the three profiles of the W3C standard Web Ontology Language OWL 2, and relational databases, although other possible languages will also be discussed. We consider different types of conjunctive query rewriting and their succinctness, different architectures of OBDA systems, and give an overview of the OBDA system Ontop

Structural Assessment of Cultural Heritage Buildings Using HBIM and Vibration-Based System Identification

The paper exemplifies the application of the methodology involving historic and architectural research complemented by HBIM and operational modal testing in the structural modelling of a heritage palace, the Galleria degli Antichi in the historic town of Sabbioneta (Italy), included in the UNESCO World Heritage list since 2008. This monumental building was built in the 16th century. Full details on the history of the building and the information obtained in the non destructive survey are given in the paper. The good knowledge of the structural geometry, along with the complete inspection carried out and the large number of identified vibration modes, allowed to establish a numerical model of the monumental building for a first quantitative assessment of its structural condition

A Rule-Based Approach to Analyzing Database Schema Objects with Datalog

Database schema elements such as tables, views, triggers and functions are typically defined with many interrelationships. In order to support database users in understanding a given schema, a rule-based approach for analyzing the respective dependencies is proposed using Datalog expressions. We show that many interesting properties of schema elements can be systematically determined this way. The expressiveness of the proposed analysis is exemplarily shown with the problem of computing induced functional dependencies for derived relations. The propagation of functional dependencies plays an important role in data integration and query optimization but represents an undecidable problem in general. And yet, our rule-based analysis covers all relational operators as well as linear recursive expressions in a systematic way showing the depth of analysis possible by our proposal. The analysis of functional dependencies is well-integrated in a uniform approach to analyzing dependencies between schema elements in general.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Devolatilization of organo-sulfur compounds in coal gasification

Coal gasification is a thermo-chemical process aiming at the production of high heating value syngas. The coal charges present, typically, a low quantity of sulfur compounds for prevent the formation of a large amount of sulfuric acid (H2S), that is a pollutant and a poison for catalysts, in syngas stream. However, in the world there are a lot of coals that cannot be used for gasification because of their high sulfur content (e.g. Sulcis Italian coal or Inner Mongolia Chinese coal). The interest on these types of coal is increasing due to a novel technology that allows to convert H2S and CO2into syngas (AG2S\u2122). The aim of this work is to propose a predictive kinetic model of the release of sulfur compounds (e.g H2S) from coal. This kinetic scheme is implement into GASDS, a package that includes a gasifier mathematical model, which accurately describes the inter-phase mass and heat transfer. The first complexity relies in the characterization of the coal, in particular the relative amount of the different forms of sulfur components (e.g. inorganic such as pyritic and sulfates, and organic sulfur such as aliphatic, aromatic and thiophenic) and their pyrolysis and devolatilization process. The kinetic model, with the related rate parameters, is validated through comparison with experimental data from the literature and obtained during several experimental campaigns at the Sotacarbo S.p.A. pilot platform. Finally, different operating conditions of gasification are analyzed in order to obtain the best yield in the downstream process, with special reference to the novel Acid Gas to Syngas (AG2STM) process