2,382 research outputs found

    Engineered single- and multi-cell chemotaxis pathways in E. coli

    Get PDF
    We have engineered the chemotaxis system of Escherichia coli to respond to molecules that are not attractants for wild-type cells. The system depends on an artificially introduced enzymatic activity that converts the target molecule into a ligand for an E. coli chemoreceptor, thereby enabling the cells to respond to the new attractant. Two systems were designed, and both showed robust chemotactic responses in semisolid and liquid media. The first incorporates an asparaginase enzyme and the native E. coli aspartate receptor to produce a response to asparagine; the second uses penicillin acylase and an engineered chemoreceptor for phenylacetic acid to produce a response to phenylacetyl glycine. In addition, by taking advantage of a ‘hitchhiker' effect in which cells producing the ligand can induce chemotaxis of neighboring cells lacking enzymatic activity, we were able to design a more complex system that functions as a simple microbial consortium. The result effectively introduces a logical ‘AND' into the system so that the population only swims towards the combined gradients of two attractants

    Accurate computation of quaternions from rotation matrices

    Get PDF
    The final publication is available at link.springer.comThe main non-singular alternative to 3×3 proper orthogonal matrices, for representing rotations in R3, is quaternions. Thus, it is important to have reliable methods to pass from one representation to the other. While passing from a quaternion to the corresponding rotation matrix is given by Euler-Rodrigues formula, the other way round can be performed in many different ways. Although all of them are algebraically equivalent, their numerical behavior can be quite different. In 1978, Shepperd proposed a method for computing the quaternion corresponding to a rotation matrix which is considered the most reliable method to date. Shepperd’s method, thanks to a voting scheme between four possible solutions, always works far from formulation singularities. In this paper, we propose a new method which outperforms Shepperd’s method without increasing the computational cost.Peer ReviewedPostprint (author's final draft

    Hip joint replacement surgery for idiopathic osteoarthritis aggregates in families

    Get PDF
    In order to determine whether there is a genetic component to hip or knee joint failure due to idiopathic osteoarthritis (OA), we invited patients (probands) undergoing hip or knee arthroplasty for management of idiopathic OA to provide detailed family histories regarding the prevalence of idiopathic OA requiring joint replacement in their siblings. We also invited their spouses to provide detailed family histories about their siblings to serve as a control group. In the probands, we confirmed the diagnosis of idiopathic OA using American College of Rheumatology criteria. The cohorts included the siblings of 635 probands undergoing total hip replacement, the siblings of 486 probands undergoing total knee replacement, and the siblings of 787 spouses. We compared the prevalence of arthroplasty for idiopathic OA among the siblings of the probands with that among the siblings of the spouses, and we used logistic regression to identify independent risk factors for hip and knee arthroplasty in the siblings. Familial aggregation for hip arthroplasty, but not for knee arthroplasty, was observed after controlling for age and sex, suggesting a genetic contribution to end-stage hip OA but not to end-stage knee OA. We conclude that attempts to identify genes that predispose to idiopathic OA resulting in joint failure are more likely to be successful in patients with hip OA than in those with knee OA

    Identifying component modules

    Get PDF
    A computer-based system for modelling component dependencies and identifying component modules is presented. A variation of the Dependency Structure Matrix (DSM) representation was used to model component dependencies. The system utilises a two-stage approach towards facilitating the identification of a hierarchical modular structure. The first stage calculates a value for a clustering criterion that may be used to group component dependencies together. A Genetic Algorithm is described to optimise the order of the components within the DSM with the focus of minimising the value of the clustering criterion to identify the most significant component groupings (modules) within the product structure. The second stage utilises a 'Module Strength Indicator' (MSI) function to determine a value representative of the degree of modularity of the component groupings. The application of this function to the DSM produces a 'Module Structure Matrix' (MSM) depicting the relative modularity of available component groupings within it. The approach enabled the identification of hierarchical modularity in the product structure without the requirement for any additional domain specific knowledge within the system. The system supports design by providing mechanisms to explicitly represent and utilise component and dependency knowledge to facilitate the nontrivial task of determining near-optimal component modules and representing product modularity

    On Tackling the Limits of Resolution in SAT Solving

    Full text link
    The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas. This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas. The paper also establishes the same polynomial bound in the case of modern core-guided MaxSAT solvers. Experimental results, obtained on CNF formulas known to be hard for CDCL SAT solvers, show that these can be efficiently solved with modern MaxSAT solvers

    Testing Yukawa-unified SUSY during year 1 of LHC: the role of multiple b-jets, dileptons and missing E_T

    Get PDF
    We examine the prospects for testing SO(10) Yukawa-unified supersymmetric models during the first year of LHC running at \sqrt{s}= 7 TeV, assuming integrated luminosity values of 0.1 to 1 fb^-1. We consider two cases: the Higgs splitting (HS) and the D-term splitting (DR3) models. Each generically predicts light gluinos and heavy squarks, with an inverted scalar mass hierarchy. We hence expect large rates for gluino pair production followed by decays to final states with large b-jet multiplicity. For 0.2 fb^-1 of integrated luminosity, we find a 5 sigma discovery reach of m(gluino) ~ 400 GeV even if missing transverse energy, E_T^miss, is not a viable cut variable, by examining the multi-b-jet final state. A corroborating signal should stand out in the opposite-sign (OS) dimuon channel in the case of the HS model; the DR3 model will require higher integrated luminosity to yield a signal in the OS dimuon channel. This region may also be probed by the Tevatron with 5-10 fb^-1 of data, if a corresponding search in the multi-b+ E_T^miss channel is performed. With higher integrated luminosities of ~1 fb^-1, using E_T^miss plus a large multiplicity of b-jets, LHC should be able to discover Yukawa-unified SUSY with m(gluino) up to about 630 GeV. Thus, the year 1 LHC reach for Yukawa-unified SUSY should be enough to either claim a discovery of the gluino, or to very nearly rule out this class of models, since higher values of m(gluino) lead to rather poor Yukawa unification.Comment: 32 pages including 31 EPS figure
    corecore