The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.

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.

Ethics in neuroscience graduate training programs:Views and models from Canada

Consideration of the ethical, social, and policy implications of research has become increasingly important to scientists and scholars whose work focuses on brain and mind, but limited empirical data exist on the education in ethics available to them. We examined the current landscape of ethics training in neuroscience programs, beginning with the Canadian context specifically, to elucidate the perceived needs of mentors and trainees and offer recommendations for resource development to meet those needs. We surveyed neuroscientists at all training levels and interviewed directors of neuroscience programs and training grants. A total of 88% of survey respondents reported general interest in ethics, and 96% indicated a desire for more ethics content as it applies to brain research and clinical translation. Expert interviews revealed formal ethics education in over half of programs and in 90% of grants-based programs. Lack of time, resources, and expertise, however, are major barriers to expanding ethics content in neuroscience education. We conclude with an initial set of recommendations to address these barriers which includes the development of flexible, tailored ethics education tools, increased financial support for ethics training, and strategies for fostering collaboration between ethics experts, neuroscience program directors, and funding agencies. © 2010 the Authors. Journal Compilation © 2010 International Mind, Brain, and Education Society and Blackwell Publishing, Inc.

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.

Evaluation of the contribution of theatre attendance to medical undergraduate neuroscience teaching - a pilot study.

Introduction: Medical students often attend the neurosurgical theatre during their clinical neurosciences attachment. However, few studies have been performed to objectively assess the value of this theatre-based learning experience. The main aim of this study was to explore student perceptions on the contribution of neurosurgical theatre attendance to clinical neuroscience teaching.

Materials and Methods: Third-year medical students undergoing their 2-week clinical neurosciences rotation at the Royal Hospitals Belfast were invited to participate in this study. A multi-method strategy was employed using a survey questionnaire comprising of closed and open-ended questions followed by semi-structured interviews to gain a greater 'in-depth' analysis of the potential contribution of neurosurgical theatre attendance to neuroscience teaching.

Results: Based on the completed survey responses of 22 students, the overall experience of neurosurgical theatre-based learning was a positive one. 'In-depth' analysis from semi-structured interviews indicated that students felt that some aspects of their neurosurgical theatre attendance could be improved. Better preparation such as reading up on the case in hand and an introduction to simple theatre etiquette to put the student at ease (in particular, for students who had never attended theatre previously), would improve the learning experience. In addition, having an expectation of what students are expected to learn in theatre making it more learning outcomes-based would probably make it feel a more positive experience by the student.

Conclusions: The vast majority of students acknowledged the positive learning outcomes of neurosurgical theatre attendance and felt that it should be made a mandatory component of the curriculum.

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.