An Ontology Formalization of Relation Type Hierarchy in Conceptual Structure Theory

This paper presents an enhancement to ontology formalization, combining previous work in Conceptual Structure Theory and Order-Sorted Logic. In particular, the relation type hierarchy of the former theory is a subset of the predicate hierarchy of the latter. Most existing ontology formalisms place greater importance on concept types, but this paper focuses more on relation types, which are in essence predicates on concept types. New notions are introduced and new properties identified with the aim of completing missing arguments in relation types. The end result is a new ontology, that we call the closure of the original ontology, on which automated inference could be more easily produced (e.g., a query-answering system for legal knowledge)

Possible Superconductivity at 37 K in Graphite-Sulfur Composite

Sulfur intercalated graphite composites with diamagnetic transitions at 6.7 K and 37 K are prepared. The magnetization hysteresis loops (MHL), Xray diffraction patterns, and resistance were measured. From the MHL, a slight superconducting like penetration process is observed at 15 K in low field region. The XRD shows no big difference from the mixture of graphite and sulfur indicating that the volume of the superconducting phase (if any) is very small. The temperature dependence of resistance shows a typical semiconducting behavior with a saturation in low temperature region. This saturation is either induced by the de-localization of conducting electrons or by possible superconductivity in this system.Comment: CHIN. PHYS.LETT v18 1648 (2001

Computing top intersections in the tautological ring of MgM_g

We derive effective recursion formulae of top intersections in the tautological ring $R^*(M_g)$ of the moduli space of curves of genus $g\geq 2$. As an application, we prove a convolution-type tautological relation in $R^{g-2}(M_g)$.Comment: 18 page

Annual output estimation of concentrator photovoltaic systems using high-efficiency InGaP/InGaAs/Ge triple-junction solar cells based on experimental solar cell's characteristics and field-test meteorological data

The temperature dependences of the electrical characteristics of InGaP/InGaAs/Ge triple-junction solar cells under concentration were evaluated. For these solar cells, conversion efficiency (η) decreased with increasing temperature, and increased with increasing concentration ratio owing to an increase in open-circuit voltage. The decrease in ηwith increasing temperature decreases with increasing concentration ratio. Moreover, the annual output of a concentrator system with a high-efficiency triple-junction cell is estimated utilizing the experimental solar cell’s characteristics obtained in this study and field-test meteorological data collected for one year at the Nara Institute of Science and Technology, and compared with that of a nonconcentration flat-plate system

Evaluation of InGaP/InGaAs/Ge triple-junction solar cell and optimization of solar cell's structure focusing on series resistance for high-efficiency concentrator photovoltaic systems

The series resistance of an InGaP/InGaAs/Ge triple-junction solar cell was evaluated in detail. Series resistance components such as electrode resistance, tunnel junction resistance and lateral resistance between electrodes were estimated separately. The characteristics of the triple-junction solar cell under concentrated light were evaluated by equivalent circuit calculation with a simulation program with integrated circuit emphasis (SPICE). By equivalent circuit calculation, the optimization of cell designs was performed, focusing on series resistance and cell current in order to realize high-efficiency concentrator cells

Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring

Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they conceptually yield a hierarchy similar to the hierarchies of sorts and predicates. By extending the order-sorted Horn-clause calculus, we develop a query-answering system that can answer queries such as atoms and meta-atoms generalized by containing predicate variables. We show that the expressive query-answering system computes every generalized query in single exponential time, i.e., the complexity of our query system is equal to that of DATALOG.

Full Satisfiability of UML Class Diagrams

UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expressed by UCDs one can exploit automated reasoning tools to detect relevant properties, such as schema and class satisfiability and subsumption between classes. Among the reasoning tasks of interest, the basic one is detecting full satisfiability of a diagram, i.e., whether there exists an instantiation of the diagram where all classes and associations of the diagram are non-empty and all the constraints of the diagram are respected. In this paper we establish tight complexity results for full satisfiability for various fragments of UML class diagrams. This investigation shows that the full satisfiability problem is ExpTime-complete in the full scenario, NP-complete if we drop isa between relationships, and NLogSpace-complete if we further drop covering over classes