Expressive Completeness of Existential Rule Languages for Ontology-based Query Answering

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA). Our expressive completeness result does not rely on any built-in linear order on the database. To establish the expressive completeness, we introduce a novel semantic definition for OCQA ontologies. We also show that neither the class of disjunctive tuple-generating dependencies nor the class of embedded dependencies is expressively complete for recursively enumerable OCQA ontologies.Comment: 10 pages; the full version of a paper to appear in IJCAI 2016. Changes (regarding to v1): a new reference has been added, and some typos have been correcte

Solving Signal Control Problems with Second-Order Sensitivity Information of Equilibrium Network Flows

The equilibrium network signal control problem is represented as a Stackelberg game. Due to the characteristics of a Stackelberg game, solving the upper-level problem and lower-level problem iteratively cannot be expected to converge to the solution. The reaction function of the lower-level problem is the key information to solve a Stackelberg game. Usually, the reaction function is approximated by the network sensitivity information. This paper firstly presents the general form of the second-order sensitivity formula for equilibrium network flows. The second-order sensitivity information can be applied to the second-order reaction function to solve the network signal control problem efficiently. Finally, this paper also demonstrates two numerical examples that show the computation of second-order sensitivity and the speed of convergence of the nonlinear approximation algorithm

Controlling the Intrinsic Josephson Junction Number in a Bi2Sr2CaCu2O8+δ\mathbf{Bi_2Sr_2CaCu_2O_{8+\delta}} Mesa

In fabricating $\mathrm{Bi_2Sr_2CaCu_2O_{8+\delta}}$ intrinsic Josephson junctions in 4-terminal mesa structures, we modify the conventional fabrication process by markedly reducing the etching rates of argon ion milling. As a result, the junction number in a stack can be controlled quite satisfactorily as long as we carefully adjust those factors such as the etching time and the thickness of the evaporated layers. The error in the junction number is within $\pm 1$. By additional ion etching if necessary, we can controllably decrease the junction number to a rather small value, and even a single intrinsic Josephson junction can be produced.Comment: to bu published in Jpn. J. Appl. Phys., 43(7A) 200

Existential Rule Languages with Finite Chase: Complexity and Expressiveness

Finite chase, or alternatively chase termination, is an important condition to ensure the decidability of existential rule languages. In the past few years, a number of rule languages with finite chase have been studied. In this work, we propose a novel approach for classifying the rule languages with finite chase. Using this approach, a family of decidable rule languages, which extend the existing languages with the finite chase property, are naturally defined. We then study the complexity of these languages. Although all of them are tractable for data complexity, we show that their combined complexity can be arbitrarily high. Furthermore, we prove that all the rule languages with finite chase that extend the weakly acyclic language are of the same expressiveness as the weakly acyclic one, while rule languages with higher combined complexity are in general more succinct than those with lower combined complexity.Comment: Extended version of a paper to appear on AAAI 201

Evaluation of Fluvial Geomorphic Responses to the Removal of Dams with the Consideration of Hydrological Uncertainty: a Case Study in Shihgang Dam

Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchive

“EN-GAWA SERVICE” Concept for Long-Term Care Service Institution, Tainan YMCA

In the face of the changes in the structure of the elderly and low birth rate, the continuous expansion of social security expenses, and the constant update of the burden ratio of long-term care services, new service models are needed in the future to meet the demands of extended life in the community. If the long-term care service institution implements a communication space called “EN-GAWA in Japanese” concept that connects with the community regularly and provides various informal care services to promote cross-generational communication in the community, community residents can have more networks and support. Keywords: long-term care service; EN-GAWA service (“Neighborhood” in Japanese); Inter-generational interaction eISSN: 2398-4287 © 2023. The Authors. Published for AMER ABRA cE-Bs by e-International Publishing House, Ltd., UK. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). Peer–review under responsibility of AMER (Association of Malaysian Environment-Behaviour Researchers), ABRA (Association of Behavioural Researchers on Asians/Africans/Arabians) and cE-Bs (Centre for Environment-Behaviour Studies), Faculty of Architecture, Planning & Surveying, Universiti Teknologi MARA, Malaysia. DOI: https://doi.org/10.21834/ebpj.v8i23.434