On the possibility for constraining cosmic topology from the celestial distribution of astronomical objects

We present a method to constrain cosmic topology from the distribution of astronomical objects projected on the celestial sphere. This is an extension of the 3D method introduced in Fujii & Yoshii (2011) that is to search for a pair of pairs of observed objects (quadruplet) linked by a holonomy, i.e., the method we present here is to search for a pair of celestial sphere $n$-tuplets for $n \geq 3$. We find, however, that this method is impractical to apply in realistic situations due to the small signal to noise ratio. We conclude therefore that it is unrealistic to constrain the topology of the Universe from the celestial distribution, and the 3D catalogs are necessary for the purpose.Comment: 4 pages, 1 figure, accepted for publication in A&A (2011

Abstract Data Types in Event-B - An Application of Generic Instantiation

Integrating formal methods into industrial practice is a challenging task. Often, different kinds of expertise are required within the same development. On the one hand, there are domain engineers who have specific knowledge of the system under development. On the other hand, there are formal methods experts who have experience in rigorously specifying and reasoning about formal systems. Coordination between these groups is important for taking advantage of their expertise. In this paper, we describe our approach of using generic instantiation to facilitate this coordination. In particular, generic instantiation enables a separation of concerns between the different parties involved in developing formal systems.Comment: In Proceedings of DS-Event-B 2012: Workshop on the experience of and advances in developing dependable systems in Event-B, in conjunction with ICFEM 2012 - Kyoto, Japan, November 13, 201

A Survey of Languages for Specifying Dynamics: A Knowledge Engineering Perspective

A number of formal specification languages for knowledge-based systems has been developed. Characteristics for knowledge-based systems are a complex knowledge base and an inference engine which uses this knowledge to solve a given problem. Specification languages for knowledge-based systems have to cover both aspects. They have to provide the means to specify a complex and large amount of knowledge and they have to provide the means to specify the dynamic reasoning behavior of a knowledge-based system. We focus on the second aspect. For this purpose, we survey existing approaches for specifying dynamic behavior in related areas of research. In fact, we have taken approaches for the specification of information systems (Language for Conceptual Modeling and TROLL), approaches for the specification of database updates and logic programming (Transaction Logic and Dynamic Database Logic) and the generic specification framework of abstract state machine

Ontological Foundations for Geographic Information Science

We propose as a UCGIS research priority the topic of “Ontological Foundations for Geographic Information.” Under this umbrella we unify several interrelated research subfields, each of which deals with different perspectives on geospatial ontologies and their roles in geographic information science. While each of these subfields could be addressed separately, we believe it is important to address ontological research in a unitary, systematic fashion, embracing conceptual issues concerning what would be required to establish an exhaustive ontology of the geospatial domain, issues relating to the choice of appropriate methods for formalizing ontologies, and considerations regarding the design of ontology-driven information systems. This integrated approach is necessary, because there is a strong dependency between the methods used to specify an ontology, and the conceptual richness, robustness and tractability of the ontology itself. Likewise, information system implementations are needed as testbeds of the usefulness of every aspect of an exhaustive ontology of the geospatial domain. None of the current UCGIS research priorities provides such an integrative perspective, and therefore the topic of “Ontological Foundations for Geographic Information Science” is unique

Low passband sensitivity digital filters: A generalized viewpoint and synthesis procedures

The concepts of losslessness and maximum available power are basic to the low-sensitivity properties of doubly terminated lossless networks of the continuous-time domain. Based on similar concepts, we develop a new theory for low-sensitivity discrete-time filter structures. The mathematical setup for the development is the bounded-real property of transfer functions and matrices. Starting from this property, we derive procedures for the synthesis of any stable digital filter transfer function by means of a low-sensitivity structure. Most of the structures generated by this approach are interconnections of a basic building block called digital "two-pair," and each two-pair is characterized by a lossless bounded-real (LBR) transfer matrix. The theory and synthesis procedures also cover special cases such as wave digital filters, which are derived from continuous-time networks, and digital lattice structures, which are closely related to unit elements of distributed network theory

The effect of multiple knowledge sources on learning and teaching

Current paradigms for machine-based learning and teaching tend to perform their task in isolation from a rich context of existing knowledge. In contrast, the research project presented here takes the view that bringing multiple sources of knowledge to bear is of central importance to learning in complex domains. As a consequence teaching must both take advantage of and beware of interactions between new and existing knowledge. The central process which connects learning to its context is reasoning by analogy, a primary concern of this research. In teaching, the connection is provided by the explicit use of a learning model to reason about the choice of teaching actions. In this learning paradigm, new concepts are incrementally refined and integrated into a body of expertise, rather than being evaluated against a static notion of correctness. The domain chosen for this experimentation is that of learning to solve "algebra story problems." A model of acquiring problem solving skills in this domain is described, including: representational structures for background knowledge, a problem solving architecture, learning mechanisms, and the role of analogies in applying existing problem solving abilities to novel problems. Examples of learning are given for representative instances of algebra story problems. After relating our views to the psychological literature, we outline the design of a teaching system. Finally, we insist on the interdependence of learning and teaching and on the synergistic effects of conducting both research efforts in parallel

Non-Hermitian Hamiltonians of Lie algebraic type

We analyse a class of non-Hermitian Hamiltonians, which can be expressed bilinearly in terms of generators of a sl(2,R)-Lie algebra or their isomorphic su(1,1)-counterparts. The Hamlitonians are prototypes for solvable models of Lie algebraic type. Demanding a real spectrum and the existence of a well defined metric, we systematically investigate the constraints these requirements impose on the coupling constants of the model and the parameters in the metric operator. We compute isospectral Hermitian counterparts for some of the original non-Hermitian Hamiltonian. Alternatively we employ a generalized Bogoliubov transformation, which allows to compute explicitly real energy eigenvalue spectra for these type of Hamiltonians, together with their eigenstates. We compare the two approaches.Comment: 27 page