27,293 research outputs found

    Strategy for Cost-Effective Reduction of the Sum of Health Risk Estimates for Exposures to Mixtures of Toxic Substances

    Get PDF
    The authors argue that a minimization approach can provide guidance for effective use of funds to reduce the sum of estimated risks or the upper limit of the sum of risk estimates for mixtures of chemicals

    Automatic document classification of biological literature

    Get PDF
    Background: Document classification is a wide-spread problem with many applications, from organizing search engine snippets to spam filtering. We previously described Textpresso, a text-mining system for biological literature, which marks up full text according to a shallow ontology that includes terms of biological interest. This project investigates document classification in the context of biological literature, making use of the Textpresso markup of a corpus of Caenorhabditis elegans literature. Results: We present a two-step text categorization algorithm to classify a corpus of C. elegans papers. Our classification method first uses a support vector machine-trained classifier, followed by a novel, phrase-based clustering algorithm. This clustering step autonomously creates cluster labels that are descriptive and understandable by humans. This clustering engine performed better on a standard test-set (Reuters 21578) compared to previously published results (F-value of 0.55 vs. 0.49), while producing cluster descriptions that appear more useful. A web interface allows researchers to quickly navigate through the hierarchy and look for documents that belong to a specific concept. Conclusions: We have demonstrated a simple method to classify biological documents that embodies an improvement over current methods. While the classification results are currently optimized for Caenorhabditis elegans papers by human-created rules, the classification engine can be adapted to different types of documents. We have demonstrated this by presenting a web interface that allows researchers to quickly navigate through the hierarchy and look for documents that belong to a specific concept

    Minimum Entangling Power is Close to Its Maximum

    Full text link
    Given a quantum gate UU acting on a bipartite quantum system, its maximum (average, minimum) entangling power is the maximum (average, minimum) entanglement generation with respect to certain entanglement measure when the inputs are restricted to be product states. In this paper, we mainly focus on the 'weakest' one, i.e., the minimum entangling power, among all these entangling powers. We show that, by choosing von Neumann entropy of reduced density operator or Schmidt rank as entanglement measure, even the 'weakest' entangling power is generically very close to its maximal possible entanglement generation. In other words, maximum, average and minimum entangling powers are generically close. We then study minimum entangling power with respect to other Lipschitiz-continuous entanglement measures and generalize our results to multipartite quantum systems. As a straightforward application, a random quantum gate will almost surely be an intrinsically fault-tolerant entangling device that will always transform every low-entangled state to near-maximally entangled state.Comment: 26 pages, subsection III.A.2 revised, authors list updated, comments are welcom

    Equation-free Dynamic Renormalization of a KPZ-type Equation

    Full text link
    In the context of equation-free computation, we devise and implement a procedure for using short-time direct simulations of a KPZ type equation to calculate the self-similar solution for its ensemble averaged correlation function. The method involves "lifting" from candidate pair-correlation functions to consistent realization ensembles, short bursts of KPZ-type evolution, and appropriate rescaling of the resulting averaged pair correlation functions. Both the self-similar shapes and their similarity exponents are obtained at a computational cost significantly reduced to that required to reach saturation in such systems

    Computational Identification of Four Spliceosomal snRNAs from the Deep-Branching Eukaryote Giardia intestinalis

    Get PDF
    Funding: Marsden Fund New Zealand Allan Wilson Centre The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.RNAs processing other RNAs is very general in eukaryotes, but is not clear to what extent it is ancestral to eukaryotes. Here we focus on pre-mRNA splicing, one of the most important RNA-processing mechanisms in eukaryotes. In most eukaryotes splicing is predominantly catalysed by the major spliceosome complex, which consists of five uridine-rich small nuclear RNAs (U-snRNAs) and over 200 proteins in humans. Three major spliceosomal introns have been found experimentally in Giardia; one Giardia U-snRNA (U5) and a number of spliceosomal proteins have also been identified. However, because of the low sequence similarity between the Giardia ncRNAs and those of other eukaryotes, the other U-snRNAs of Giardia had not been found. Using two computational methods, candidates for Giardia U1, U2, U4 and U6 snRNAs were identified in this study and shown by RT-PCR to be expressed. We found that identifying a U2 candidate helped identify U6 and U4 based on interactions between them. Secondary structural modelling of the Giardia U-snRNA candidates revealed typical features of eukaryotic U-snRNAs. We demonstrate a successful approach to combine computational and experimental methods to identify expected ncRNAs in a highly divergent protist genome. Our findings reinforce the conclusion that spliceosomal small-nuclear RNAs existed in the last common ancestor of eukaryotes

    Ion radial diffusion in an electrostatic impulse model for stormtime ring current formation

    Get PDF
    Guiding-center simulations of stormtime transport of ring-current and radiation-belt ions having first adiabatic invariants mu is approximately greater than 15 MeV/G (E is approximately greater than 165 keV at L is approximately 3) are surprisingly well described (typically within a factor of approximately less than 4) by the quasilinear theory of radial diffusion. This holds even for the case of an individual model storm characterized by substorm-associated impulses in the convection electric field, provided that the actual spectrum of the electric field is incorporated in the quasilinear theory. Correction of the quasilinear diffusion coefficient D(sub LL)(sup ql) for drift-resonance broadening (so as to define D(sub LL)(sup ql)) reduced the typical discrepancy with the diffusion coefficients D(sub LL)(sup sim) deduced from guiding-center simulations of representative-particle trajectories to a factor of approximately 3. The typical discrepancy was reduced to a factor of approximately 1.4 by averaging D(sub LL)(sup sim), D(sub LL)(sup ql), and D(sub LL)(sup rb) over an ensemble of model storms characterized by different (but statistically equivalent) sets of substorm-onset times
    • …
    corecore