Scalable Parallel Numerical Constraint Solver Using Global Load Balancing

We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load balancing (GLB) method. The parallel solver is implemented with X10 that provides an implementation of GLB as a library. In experiments, several NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer.Comment: To be presented at X10'15 Worksho

Synthesis of substituted benzooxaborinin-1-ols via palladium-catalysed cyclisation of alkenyl- and alkynyl-boronic acids

Two new palladium-catalysed reactions have been developed for the synthesis of stable 4-substituted benzooxaborinin-1-ols. A palladium-catalysed cyclisation of ortho-alkenylbenzene boronic acids can be used to access 4-chlorobenzooxaborinin-1-ols via a Wacker-type oxidation and chlorination. Alternatively, ortho-alkynylbenzene boronic acids undergo a palladium-catalysed oxyallylation reaction to provide 4-allylbenzooxaborinin-1-ols

Characterisation of four hotdog-fold thioesterases for their implementation in a novel organic acid production system

With increasing interest in the diverse properties of organic acids and their application in synthetic pathways, developing biological tools for producing known and novel organic acids would be very valuable. In such a system, organic acids may be activated as coenzyme A (CoA) esters, then modified by CoA-dependent enzymes, followed by CoA liberation by a broad-acting thioesterase. This study has focused on the identification of suitable thioesterases (TE) for utilisation in such a pathway. Four recombinant hotdog-fold TEs were screened with a range of CoA esters in order to identify a highly active, broad spectrum TE. The TesB-like TE, RpaL, from Rhodopseudomonas palustris was found to be able to use aromatic, alicyclic and both long and short aliphatic CoA esters. Size exclusion chromatography, revealed RpaL to be a monomer of fused hotdog domains, in contrast to the complex quaternary structures found with similar TesB-like TEs. Nonetheless, sequence alignments showed a conserved catalytic triad despite the variation in quaternary arrangement. Kinetic analysis revealed a preference towards short-branched chain CoA esters with the highest specificity towards DL-β-hydroxybutyryl CoA (1.6 × 104 M-1 s-1), which was found to decrease as the acyl chain became longer and more functionalised. Substrate inhibition was observed with the fatty acyl n-heptadecanoyl CoA at concentrations exceeding 0.3 mM; however, this was attributed to its micellar aggregation properties. As a result of the broad activity observed with RpaL, it is a strong candidate for implementation in CoA ester pathways to generate modified or novel organic acids

Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data

Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by data uncertainty. Existing CP approaches that accommodate uncertainty are less suited to uncertainty arising due to incomplete and erroneous data, because they do not build reliable models and solutions guaranteed to address the user's genuine problem as she perceives it. Other fields such as reliable computation offer combinations of models and associated methods to handle these types of uncertain data, but lack an expressive framework characterising the resolution methodology independently of the model. We present a unifying framework that extends the CP formalism in both model and solutions, to tackle ill-defined combinatorial problems with incomplete or erroneous data. The certainty closure framework brings together modelling and solving methodologies from different fields into the CP paradigm to provide reliable and efficient approches for uncertain constraint problems. We demonstrate the applicability of the framework on a case study in network diagnosis. We define resolution forms that give generic templates, and their associated operational semantics, to derive practical solution methods for reliable solutions.Comment: Revised versio

Long-term treatment of postmenopausal osteoporotic women with strontium ranelate : results at 10 years

Peer reviewe

Metagenomic ene-reductases for the bioreduction of sterically challenging enones

Ene-reductases (ERs) of the Old Yellow Enzyme family catalyse asymmetric reduction of activated alkenes providing chiral products. They have become an important method in the synthetic chemists' toolbox offering a sustainable alternative to metal-catalysed asymmetric reduction. Development of new biocatalytic alkene reduction routes, however needs easy access to novel biocatalysts. A sequence-based functional metagenomic approach was used to identify novel ERs from a drain metagenome. From the ten putative ER enzymes initially identified, eight exhibited activities towards widely accepted mono-cyclic substrates with several of the ERs giving high reaction yields and stereoselectivities. Two highly performing enzymes that displayed excellent co-solvent tolerance were used for the stereoselective reduction of sterically challenging bicyclic enones where the reactions proceeded in high yields, which is unprecedented to date with wild-type ERs. On a preparative enzymatic scale, reductions of Hajos–Parish, Wieland–Miescher derivatives and a tricyclic ketone proceeded with good to excellent yields

Inappropriate trusting behaviour in dementia

BACKGROUND: Inappropriate trusting behaviour may have significant social, financial and other consequences for people living with dementia. However, its clinical associations and predictors have not been clarified. Here we addressed this issue in canonical syndromes of frontotemporal dementia (FTD) and Alzheimer’s disease (AD). METHODS: In 34 patients with AD and 73 with FTD (27 behavioural variant (bv)FTD, 22 semantic variant primary progressive aphasia (svPPA), 24 nonfluent/agrammatic variant (nfv)PPA) we recorded inappropriate trusting and other abnormal socio-emotional behaviours using a semi-structured caregiver survey. Patients were comprehensively characterised using a general cognitive assessment and the Revised Self-Monitoring Scale (RSMS; an informant index of socioemotional awareness). RESULTS: Inappropriate trusting was more frequent in svPPA (55%) and bvFTD (44%) than nfvPPA (17%) or AD (24%). After adjusting for age, sex, education and Mini-Mental State Examination (MMSE) score, inappropriate trusting was significantly more likely in svPPA (odds ratio 3.61; 95% confidence interval 1.41–8.75) and bvFTD (3.01, 1.23–6.65) than AD. Significant predictors of inappropriate trusting comprised apathy in svPPA, disinhibition and altered pain responsiveness in bvFTD, and lower MMSE and RSMS (self-presentation) scores in AD. CONCLUSION: Dementia syndromes vary in prevalence and predictors of abnormal trusting behaviour, with implications for clinical counselling and safeguarding

Adaptive Lévy processes and area-restricted search in human foraging

A considerable amount of research has claimed that animals’ foraging behaviors display movement lengths with power-law distributed tails, characteristic of Lévy flights and Lévy walks. Though these claims have recently come into question, the proposal that many animals forage using Lévy processes nonetheless remains. A Lévy process does not consider when or where resources are encountered, and samples movement lengths independently of past experience. However, Lévy processes too have come into question based on the observation that in patchy resource environments resource-sensitive foraging strategies, like area-restricted search, perform better than Lévy flights yet can still generate heavy-tailed distributions of movement lengths. To investigate these questions further, we tracked humans as they searched for hidden resources in an open-field virtual environment, with either patchy or dispersed resource distributions. Supporting previous research, for both conditions logarithmic binning methods were consistent with Lévy flights and rank-frequency methods–comparing alternative distributions using maximum likelihood methods–showed the strongest support for bounded power-law distributions (truncated Lévy flights). However, goodness-of-fit tests found that even bounded power-law distributions only accurately characterized movement behavior for 4 (out of 32) participants. Moreover, paths in the patchy environment (but not the dispersed environment) showed a transition to intensive search following resource encounters, characteristic of area-restricted search. Transferring paths between environments revealed that paths generated in the patchy environment were adapted to that environment. Our results suggest that though power-law distributions do not accurately reflect human search, Lévy processes may still describe movement in dispersed environments, but not in patchy environments–where search was area-restricted. Furthermore, our results indicate that search strategies cannot be inferred without knowing how organisms respond to resources–as both patched and dispersed conditions led to similar Lévy-like movement distributions