A Data Transformation System for Biological Data Sources

Scientific data of importance to biologists in the Human Genome Project resides not only in conventional databases, but in structured files maintained in a number of different formats (e.g. ASN.1 and ACE) as well a.s sequence analysis packages (e.g. BLAST and FASTA). These formats and packages contain a number of data types not found in conventional databases, such as lists and variants, and may be deeply nested. We present in this paper techniques for querying and transforming such data, and illustrate their use in a prototype system developed in conjunction with the Human Genome Center for Chromosome 22. We also describe optimizations performed by the system, a crucial issue for bulk data

A theorem prover-based analysis tool for object-oriented databases

We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (such as transaction safety, compensation, and commutativity) to support the advanced transaction models used in workflow and cooperative work. We give an example of method safety analysis for the generic structure editing operations of a cooperative authoring system

Architecture and Design of National Digital Identity Platforms

The importance of ‘National Digital Identity’ to provision public services to the citizens of a country and inclusive growth is fairly established. It is recognized as part of the UN sustainable digital goals (SDG) and various researchers have looked into the impact and relevance of such systems. Despite that not more than 5% of the countries globally are having comprehensive digital identity systems. Several such projects are facing major difficulties and implementation hurdles globally. There are cases where such projects have been abandoned. Countries such as India have implemented their national digital identity project as a platform with almost complete population coverage and most public services linked to it. This research analyses the architecture and design of such a digital identity platform through the lens of architectural leverage and generativity using the design science and General Morphological Analysis (GMA) approach. The learning’s are relevant for policy makers and technology designers to incorporate in their national digital identity initiatives

The relationship between IR and multimedia databases

Modern extensible database systems support multimedia data through ADTs. However, because of the problems with multimedia query formulation, this support is not sufficient.\ud \ud Multimedia querying requires an iterative search process involving many different representations of the objects in the database. The support that is needed is very similar to the processes in information retrieval.\ud \ud Based on this observation, we develop the miRRor architecture for multimedia query processing. We design a layered framework based on information retrieval techniques, to provide a usable query interface to the multimedia database.\ud \ud First, we introduce a concept layer to enable reasoning over low-level concepts in the database.\ud \ud Second, we add an evidential reasoning layer as an intermediate between the user and the concept layer.\ud \ud Third, we add the functionality to process the users' relevance feedback.\ud \ud We then adapt the inference network model from text retrieval to an evidential reasoning model for multimedia query processing.\ud \ud We conclude with an outline for implementation of miRRor on top of the Monet extensible database system

Supporting public decision making in policy deliberations: An ontological approach

This is the post-print version of the Paper. The official published version can be accessed from the link below - Copyright @ 2011 SpringerSupporting public decision making in policy deliberations has been a key objective of eParticipation which is an emerging area of eGovernment. EParticipation aims to enhance citizen involvement in public governance activities through the use of information and communication technologies. An innovative approach towards this objective is exploiting the potentials of semantic web technologies centred on conceptual knowledge models in the form of ontologies. Ontologies are generally defined as explicit human and computer shared views on the world of particular domains. In this paper, the potentials and benefits of using ontologies for policy deliberation processes are discussed. Previous work is then extended and synthesised to develop a deliberation ontology. The ontology aims to define the necessary semantics in order to structure and interrelate the stages and various activities of deliberation processes with legal information, participant stakeholders and their associated arguments. The practical implications of the proposed framework are illustrated.This work is funded by the European Commission under the 2006/1 eParticipation call

Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

Univers: The construction of an internet-wide descriptive naming system

Descriptive naming systems allow clients to identify a set of objects by description. Described here is the construction of a descriptive naming system, called Univers, based on a model in which clients provide both an object description and some meta-information. The meta-information describes beliefs about the query and the naming system. Specifically, it is an ordering on a set of perfect world approximations, and it describes the preferred methods for accommodating imperfect information. The description is then resolved in a way that respects the preferred approximations

Taking I/O seriously: resolution reconsidered for disk

Journal ArticleModern compilation techniques can give Prolog programs, in the best cases, a speed comparable to C. However, Prolog has proven to be unacceptable for data-oriented queries for two major reasons: its poor termination and complexity properties for Datalog, and its tuple-at-a-time strategy. A number of tabling frameworks and systems have addressed the first problem, including the XSB system which has achieved Prolog speeds for tabled programs. Yet tabling systems such as XSB continue to use the tuple-at-a-time paradigm. As a result, these systems are not amenable to a tight interconnection with disk-resident data. However, in a tabling framework the difference between tuple-at-a-time behavior and set-at-a-time can be viewed as one of scheduling. Accordingly, we define a breadth-first set-at-a-time tabling strategy and prove it iteration equivalent to a form of semi-naive magic evaluation. That is, we extend the well-known asymptotic results of Seki [10] by proving that each iteration of the tabling strategy produces the same information as semi-naive magic. Further, this set-at-a-time scheduling is amenable to implementation in an engine that uses Prolog compilation. We describe both the engine and its performance, which is comparable with the tuple-at-a-time strategy even for in-memory Datalog queries. Because of its performance and its fine level of integration of Prolog with a database-style search, the set-at-a-time engine appears as an important key to linking logic programming and deductive databases