20473212
Towards a formal theory of defeasible deontic conditionals
The paper outlines the approach to the analysis of deontic conditionals taken in earlier work of Jones and Pörn, comparing it briefly with two main trends within dyadic deontic logic, and discussing problems associated with the augmentation principle and the factual detachment principle. A modification of the Jones and Pörn system is then presented, using a classical but not normal (in the sense of Chellas) deontic modality, to provide the basis for an alternative analysis of deontic conditionals. This new analysis validates neither the factual detachment nor the augmentation principles. However, influenced by the approach of Delgrande to default reasoning, it is shown how a restricted form of factual detachment might be accommodated within the revised system.
206840293
Formal Specification of Security Requirements using the Theory of Normative Positions
We use a number of the examples presented in [Ting 1990] to illustrate how the formal theory of normative positions may serve as a tool for clarifying, and making precise, the specification of security requirements, particularly in regard to access control. We describe the basic features of the theory of normative positions (which has its roots in the analytical theory of law), and of the modal logics (deontic and action logics) involved in its formulation. We then indicate three levels of software we have under development, which aim to turn the analytical procedures into a practical tool. Our concluding remarks relate our discussion of Ting's examples to some particular issues in the formal specification of computer systems.
207571365
An APL Approach to Presentation Graphics
Producing data in pictorial form is a type of computer graphics application known as presentation graphics. One approach that has been used for this type of graphics is a graphic support package using APL as the command language. Here discussed is the evolution of this approach up to its currently available forms.
4157117
Data Access and Integration in the ISPIDER Proteomics Grid
Grid computing has great potential for supporting the integration of complex, fast changing biological data repositories to enable distributed data analysis. One scenario where Grid computing has such potential is provided by proteomics resources which are rapidly being developed with the emergence of affordable, reliable methods to study the proteome. The protein identifications arising from these methods derive from multiple repositories which need to be integrated to enable uniform access to them. A number of technologies exist which enable these resources to be accessed in a Grid environment, but the independent development of these resources means that significant data integration challenges, such as heterogeneity and schema evolution, have to be met. This paper presents an architecture which supports the combined use of Grid data access (OGSA-DAI), Grid distributed querying (OGSA-DQP) and data integration (AutoMed) software tools to support distributed data analysis. We discuss the application of this architecture for the integration of several autonomous proteomics data resources.
16685816
An object model and database for functional genomics
MOTIVATION
Large-scale functional genomics analysis is now feasible and presents significant challenges in data analysis, storage and querying. Data standards are required to enable the development of public data repositories and to improve data sharing. There is an established data format for microarrays (microarray gene expression markup language, MAGE-ML) and a draft standard for proteomics (PEDRo). We believe that all types of functional genomics experiments should be annotated in a consistent manner, and we hope to open up new ways of comparing multiple datasets used in functional genomics.


RESULTS
We have created a functional genomics experiment object model (FGE-OM), developed from the microarray model, MAGE-OM and two models for proteomics, PEDRo and our own model (Gla-PSI-Glasgow Proposal for the Proteomics Standards Initiative). FGE-OM comprises three namespaces representing (i) the parts of the model common to all functional genomics experiments; (ii) microarray-specific components; and (iii) proteomics-specific components. We believe that FGE-OM should initiate discussion about the contents and structure of the next version of MAGE and the future of proteomics standards. A prototype database called RNA And Protein Abundance Database (RAPAD), based on FGE-OM, has been implemented and populated with data from microbial pathogenesis.


AVAILABILITY
FGE-OM and the RAPAD schema are available from http://www.gusdb.org/fge.html, along with a set of more detailed diagrams. RAPAD can be accessed by registration at the site.
6839309
Five 1951 BBC broadcasts on automatic calculating machines
In May and June 1951, five leading figures of British computing - Douglas Hartree, Max Newman, Alan Turing, Frederic ("Freddie") Williams, and Maurice Wilkes - spoke about their work on BBC radio. We examine surviving texts of their broadcasts, and the speakers' principal points are summarized through quotations and commentary. The broadcasts are placed in the context of contemporary developments in computing and the particular BBC service on which they were broadcast.
47276
A multi-processing software infrastructure for robotic systems
Robotic systems and their software design are based on the same principles found in other computer applications. However, while many computer systems to date are deeply rooted in concepts such as multi-processing, multi-threads, modularity, etc., robotic systems are still limited by mono-processing, centralized designs. The paper addresses these limitations by proposing a new philosophy for robotic system software design - software infrastructure $that allows for the design of an efficient, modular, fault-tolerant, and distributed software architecture. Two examples of this infrastructure applied to mobile robot navigation are also discussed.