Computational techniques for a simple theory of conditional preferences

A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences.

Communicating open systems

Just as conventional institutions are organisational structures for coordinating the activities of multiple interacting individuals, electronic institutions provide a computational analogue for coordinating the activities of multiple interacting software agents. In this paper, we argue that open multi-agent systems can be effectively designed and implemented as electronic institutions, for which we provide a comprehensive computational model. More specifically, the paper provides an operational semantics for electronic institutions, specifying the essential data structures, the state representation and the key operations necessary to implement them. We specify the agent workflow structure that is the core component of such electronic institutions and particular instantiations of knowledge representation languages that support the institutional model. In so doing, we provide the first formal account of the electronic institution concept in a rigorous and unambiguous way.

From Negation to Agreement: Revisiting the Problem of Sources for Socio-Historical Linguistics

In this article we review recent work on the history of French negation in relation to three key issues in socio-historical linguistics: identifying appropriate sources, interpreting scant or anomalous data, and interpreting generational differences in historical data. We then turn to a new case study, that of verbal agreement with la plupart, to see whether this can shed fresh light on these issues. We argue that organising data according to the author’s date of birth is methodologically sounder than according to date of publication. We explore the extent to which different genres and text types reflect changing patterns of usage and suggest that additional, different case-studies are required in order to make more secure generalisations about the reliability of different sources.

A computational study of the mechanism of CO oxidation by a ceria supported surface rhodium oxide layer

A mechanism of CO oxidation by a thin surface oxide of Rh supported on ceria is proposed: CO is oxidized by the Rh-oxide film, which is subsequently reoxidized by a ceria surface O atom. The proposed mechanism is supported by in situ Raman spectroscopic investigations.

Deployment on GPUs of an application in computational atomic physics

This paper describes the deployment on GPUs of PROP, a program of the 2DRMP suite which models electron collisions with H-like atoms and ions. Because performance on GPUs is better in single precision than in double precision, the numerical stability of the PROP program in single precision has been studied. The numerical quality of PROP results computed in single precision and their impact on the next program of the 2DRMP suite has been analyzed. Successive versions of the PROP program on GPUs have been developed in order to improve its performance. Particular attention has been paid to the optimization of data transfers and of linear algebra operations. Performance obtained on several architectures (including NVIDIA Fermi) are presented.

Comparison of dynamics of wildtype and V94M human UDP-galactose 4-epimerase-A computational perspective on severe epimerase-deficiency galactosemia

UDP-galactose 4'-epimerase (GALE) catalyzes the interconversion of UDP-galactose and UDP-glucose, an important step in galactose catabolism. Type III galactosemia, an inherited metabolic disease, is associated with mutations in human GALE. The V94M mutation has been associated with a very severe form of type III galactosemia. While a variety of structural and biochemical studies have been reported that elucidate differences between the wildtype and this mutant form of human GALE, little is known about the dynamics of the protein and how mutations influence structure and function. We performed molecular dynamics simulations on the wildtype and V94M enzyme in different states of substrate and cofactor binding. In the mutant, the average distance between the substrate and both a key catalytic residue (Tyr157) and the enzyme-bound NAD(+) cofactor and the active site dynamics are altered making substrate binding slightly less stable. However, overall stability or dynamics of the protein is not altered. This is consistent with experimental findings that the impact is largely on the turnover number (kcat), with less substantial effects on Km. Active site fluctuations were found to be correlated in enzyme with substrate bound to just one of the subunits in the homodimer suggesting inter-subunit communication. Greater active site loop mobility in human GALE compared to the equivalent loop in Escherichia coli GALE explains why the former can catalyze the interconversion of UDP-N-acetylgalactosamine and UDP-N-acetylglucosamine while the bacterial enzyme cannot. This work illuminates molecular mechanisms of disease and may inform the design of small molecule therapies for type III galactosemia.

Experimental and Computational Approach Investigating Burst Fracture Augmentation Using PMMA and Calcium Phosphate Cements

The aim of the study was to use a computational and experimental approach to evaluate, compare and predict the ability of calcium phosphate (CaP) and poly (methyl methacrylate) (PMMA) augmentation cements to restore mechanical stability to traumatically fractured vertebrae, following a vertebroplasty procedure. Traumatic fractures (n = 17) were generated in a series of porcine vertebrae using a drop-weight method. The fractured vertebrae were imaged using μCT and tested under axial compression. Twelve of the fractured vertebrae were randomly selected to undergo a vertebroplasty procedure using either a PMMA (n = 6) or a CaP cement variation (n = 6). The specimens were imaged using μCT and re-tested. Finite element models of the fractured and augmented vertebrae were generated from the μCT data and used to compare the effect of fracture void fill with augmented specimen stiffness. Significant increases (p <0.05) in failure load were found for both of the augmented specimen groups compared to the fractured group. The experimental and computational results indicated that neither the CaP cement nor PMMA cement could completely restore the vertebral mechanical behavior to the intact level. The effectiveness of the procedure appeared to be more influenced by the volume of fracture filled rather than by the mechanical properties of the cement itself.

Dry computational approaches for wet medical problems

This is a report on the 4th international conference in 'Quantitative Biology and Bioinformatics in Modern Medicine' held in Belfast (UK), 19-20 September 2013. The aim of the conference was to bring together leading experts from a variety of different areas that are key for Systems Medicine to exchange novel findings and promote interdisciplinary ideas and collaborations.

A computational intelligent approach to multi-factor analysis of violent crime information systems

Various scientific studies have explored the causes of violent behaviour from different perspectives, with psychological tests, in particular, applied to the analysis of crime factors. The relationship between bi-factors has also been extensively studied including the link between age and crime. In reality, many factors interact to contribute to criminal behaviour and as such there is a need to have a greater level of insight into its complex nature. In this article we analyse violent crime information systems containing data on psychological, environmental and genetic factors. Our approach combines elements of rough set theory with fuzzy logic and particle swarm optimisation to yield an algorithm and methodology that can effectively extract multi-knowledge from information systems. The experimental results show that our approach outperforms alternative genetic algorithm and dynamic reduct-based techniques for reduct identification and has the added advantage of identifying multiple reducts and hence multi-knowledge (rules). Identified rules are consistent with classical statistical analysis of violent crime data and also reveal new insights into the interaction between several factors. As such, the results are helpful in improving our understanding of the factors contributing to violent crime and in highlighting the existence of hidden and intangible relationships between crime factors.

Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases

There is extensive theoretical work on measures of inconsistency for arbitrary formulae in knowledge bases. Many of these are defined in terms of the set of minimal inconsistent subsets (MISes) of the base. However, few have been implemented or experimentally evaluated to support their viability, since computing all MISes is intractable in the worst case. Fortunately, recent work on a related problem of minimal unsatisfiable sets of clauses (MUSes) offers a viable solution in many cases. In this paper, we begin by drawing connections between MISes and MUSes through algorithms based on a MUS generalization approach and a new optimized MUS transformation approach to finding MISes. We implement these algorithms, along with a selection of existing measures for flat and stratified knowledge bases, in a tool called mimus. We then carry out an extensive experimental evaluation of mimus using randomly generated arbitrary knowledge bases. We conclude that these measures are viable for many large and complex random instances. Moreover, they represent a practical and intuitive tool for inconsistency handling.