Scalable SD Erlang Computation Model

The technical report presents implementation of s groups and semi-explicit placement of the Scalable Distributed (SD) Erlang. The implementation is done on the basis of Erlang/OTP 17.4. The source code can be found in https://github.com/release-project/otp/tree/17.4-rebased. We start with a discussion of differences between distributed Erlang global groups and SD Erlang s groups (Chapter 1). Then we discuss the implementation of s groups and the features of sixteen functions that were modified and introduced in global and s group modules (Chapter 2). After that we discuss semi-explicit placement, node attributes and choose node/1 function (Chapter 3). These functions were unit tested (Chapter 4). Finally, we discuss future work (Chapter 5)

Data fragmentation for parallel transitive closure strategies

Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on the disconnection set approach. To better understand this design problem, the authors focus on transportation networks. These are characterized by loosely interconnected clusters of nodes with a high internal connectivity rate. Three requirements that have to be fulfilled by a fragmentation are formulated, and three different fragmentation strategies are presented, each emphasizing one of these requirements. Some test results are presented to show the performance of the various fragmentation strategie

An Intuitive Graphical Query Interface for Protégé Knowledge Bases

Emily is a graphical query engine for Protégé knowledge bases that was developed by the Structural Informatics Group (SIG) at the University of Washington. Currently this application is adapted for a specific knowledge model, the Foundational Model of Anatomy (FMA) [1], but it could readily be generalized for use with other Protégé knowledge bases. In developing the Emily query interface, our intent was to provide a tool that was simple and intuitive to use, like the Queries tab provided with Protégé, but with improved information retrieval capabilities. Although some more advanced query mechanisms exist, currently they are too complicated for non-expert end users. The Algernon tab [2], for example, provides extensive Protégé query capabilities but requires users to learn a query scripting language. We sought to develop a query interface that was intuitive enough for end users to operate, with only minor instruction, yet was powerful enough to gather interesting information from a knowledge base that was not easily attained by browsing alone

On the existence of block-transitive combinatorial designs

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and cryptography. The main result of the paper settles an important open question: There exist no non-trivial examples with $t=7$ (or larger). The proof is based on the classification of the finite 3-homogeneous permutation groups, itself relying on the finite simple group classification.Comment: 9 pages; to appear in "Discrete Mathematics and Theoretical Computer Science (DMTCS)