Elucidation of the Burkholderia cenocepacia hopanoid biosynthesis pathway uncovers functions for conserved proteins in hopanoid-producing bacteria

Hopanoids are bacterial surrogates of eukaryotic membrane sterols and among earth's most abundant natural products. Their molecular fossils remain in sediments spanning more than a billion years. However, hopanoid metabolism and function are not fully understood. Burkholderia species are environmental opportunistic pathogens that produce hopanoids and also occupy diverse ecological niches. We investigated hopanoids biosynthesis in Burkholderia cenocepacia by deletion mutagenesis and structural characterization of the hopanoids produced by the mutants. The enzymes encoded by hpnH and hpnG were essential for production of all C35 extended hopanoids, including bacteriohopanetetrol (BHT), BHT glucosamine and BHT cyclitol ether. Deletion of hpnI resulted in BHT production, while ΔhpnJ produced only BHT glucosamine. Thus, HpnI is required for BHT glucosamine production while HpnJ is responsible for its conversion to the cyclitol ether. The ΔhpnH and ΔhpnG mutants could not grow under any stress condition tested, whereas ΔhpnI, ΔhpnJ and ΔhpnK displayed wild-type growth rates when exposed to detergent, but varying levels of sensitivity to low pH and polymyxin B. This study not only elucidates the biosynthetic pathway of hopanoids in B. cenocepacia, but also uncovers a biosynthetic role for the conserved proteins HpnI, HpnJ and HpnK in other hopanoid-producing bacteria.whereas ΔhpnI, ΔhpnJ and ΔhpnK displayed wild-type growth rates when exposed to detergent, but varying levels of sensitivity to low pH and polymyxin B. This study not only elucidates the biosynthetic pathway of hopanoids in B. cenocepacia, but also uncovers a biosynthetic role for the conserved proteins HpnI, HpnJ and HpnK in other hopanoid-producing bacteria.

Finite domination and Novikov rings: Laurent polynomial rings in two variables

Let C be a bounded cochain complex of finitely generatedfree modules over the Laurent polynomial ring L = R[x, x−1, y, y−1].The complex C is called R-finitely dominated if it is homotopy equivalentover R to a bounded complex of finitely generated projective Rmodules.Our main result characterises R-finitely dominated complexesin terms of Novikov cohomology: C is R-finitely dominated if andonly if eight complexes derived from C are acyclic; these complexes areC ⊗L R[[x, y]][(xy)−1] and C ⊗L R[x, x−1][[y]][y−1], and their variants obtainedby swapping x and y, and replacing either indeterminate by its inverse.

Efficient predictive demand response using laguerre functions

Predictive Demand Response (DR) algorithms allow schedulable loads in power systems to be shifted to off-peak times. However, the size of the optimisation problems associated with predictive DR can grow very large and so efficient implementations of algorithms are desirable. In this paper Laguerre functions are used to significantly reduce the size of the optimisation needed to implement predictive DR, thus significantly increasing the efficiency of the implementation. © 2013 IEEE.

Is there an educational penalty for being suspended from school?

Suspension from school is a commonly used, yet controversial, school disciplinary measure. This paper uses unique survey data to estimate the impact of suspension on the educational outcomes of those suspended. It finds that while suspension is strongly associated with educational outcomes, the relationship is unlikely to be causal, but rather likely stems from differences in the characteristics of those suspended compared to those not suspended. Moreover, there is no evidence that suspension is associated with larger educational penalties for young people from disadvantaged family backgrounds compared to those from more advantaged family backgrounds. These results hold regardless of whether self-reported suspension or mother-reported suspension is considered. The absence of a clear negative causal impact of suspension on educational outcomes suggests that suspension may continue to play a role in school discipline without harming the educational prospects of those sanctioned.

Updating Credal Networks is Approximable in Polynomial Time

Credal networks relax the precise probability requirement of Bayesian networks, enabling a richer representation of uncertainty in the form of closed convex sets of probability measures. The increase in expressiveness comes at the expense of higher computational costs. In this paper, we present a new variable elimination algorithm for exactly computing posterior inferences in extensively specified credal networks, which is empirically shown to outperform a state-of-the-art algorithm. The algorithm is then turned into a provably good approximation scheme, that is, a procedure that for any input is guaranteed to return a solution not worse than the optimum by a given factor. Remarkably, we show that when the networks have bounded treewidth and bounded number of states per variable the approximation algorithm runs in time polynomial in the input size and in the inverse of the error factor, thus being the first known fully polynomial-time approximation scheme for inference in credal networks.

Solar phase functions of cometary nuclei

Relatively few measurements of the solar phase function of cometary nuclei exist, despite the importance of this parameter in determining accurate sizes and its use in modeling surface properties. We make use of robotic telescopes and servicemode observing to monitor cometary nuclei over months at a time, combining intensive observations at a single epoch with regular short light-curve segments to efficiently account for brightness changes due to both nucleus rotation and changing solar phase angle. We present our latest results on comets 8P/Tuttle, 14P/Wolf, 67P/Churyumov- Gerasimenko and 110P/Hartley 3.

A First Step Towards Cost Functions for Quantum-dot Cellular Automata Designs

Quantum-dot cellular automata (QCA) is potentially a very attractive alternative to CMOS for future digital designs. Circuit designs in QCA have been extensively studied. However, how to properly evaluate the QCA circuits has not been carefully considered. To date, metrics and area-delay cost functions directly mapped from CMOS technology have been used to compare QCA designs, which is inappropriate due to the differences between these two technologies. In this paper, several cost metrics specifically aimed at QCA circuits are studied. It is found that delay, the number of QCA logic gates, and the number and type of crossovers, are important metrics that should be considered when comparing QCA designs. A family of new cost functions for QCA circuits is proposed. As fundamental components in QCA computing arithmetic, QCA adders are reviewed and evaluated with the proposed cost functions. By taking the new cost metrics into account, previous best adders become unattractive and it has been shown that different optimization goals lead to different “best” adders.