Search results for "complex"
showing 10 items of 5889 documents
Slow Magnetic Relaxation in a Co (II)–Y (III) Single‐Ion Magnet with Positive Axial Zero‐Field Splitting
2013
This work was supported by the MINECO (Spain) (Project CTQ2011-24478), the Junta de Andalucía (FQM-195 and Project of excellence P08-FQM-03705), and the University of Granada. E.R. and E.Cr. thank MINECO grant No. CTQ2011-23862-C02-01 and Generalitat de Catalunya grant No. 2009SGR-1459, for financial support. We would like to thank Prof. Liviu Chibotaru for providing us the SINGLE_ANISO program and Dr. Andrew Ozarowski for the EPR simulation software. E.K.B. thanks the EPSRC and Leverhulme Trust for financial support. The NHMFL is funded by the NSF, DoE, and the state of Florida. J.C. acknowledges financial support by the Spanish Ministerio de Ciencia e Innovación through projects CTQ2010-1…
A spontaneous mitonuclear epistasis converging on Rieske Fe-S protein exacerbates complex III deficiency in mice
2020
We previously observed an unexpected fivefold (35 vs. 200 days) difference in the survival of respiratory chain complex III (CIII) deficient Bcs1lp.S78G mice between two congenic backgrounds. Here, we identify a spontaneous homoplasmic mtDNA variant (m.G14904A, mt-Cybp.D254N), affecting the CIII subunit cytochrome b (MT-CYB), in the background with short survival. We utilize maternal inheritance of mtDNA to confirm this as the causative variant and show that it further decreases the low CIII activity in Bcs1lp.S78G tissues to below survival threshold by 35 days of age. Molecular dynamics simulations predict D254N to restrict the flexibility of MT-CYB ef loop, potentially affecting RISP dyna…
FO^2 with one transitive relation is decidable
2013
We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.
New results for finding common neighborhoods in massive graphs in the data stream model
2008
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]
Genomic determinants of speciation and spread of the Mycobacterium tuberculosis complex
2019
14 páginas, 6 figuras
CD95 death-inducing signaling complex formation and internalization occur in lipid rafts of type I and type II cells
2004
We investigated the membrane localization of CD95 in type I and type II cells, which differ in their ability to recruit and activate caspase-8. We found that CD95 was preferentially located in lipid rafts of type I cells, while it was present both in raft and non-raft plasma membrane sub-domains of type II cells. After stimulation, CD95 located in phospholipid-rich plasma membrane was recruited to lipid rafts in both types of cells. Similarly, CD95 cross-linking resulted in caspase-independent translocation of FADD/MORT1 and caspase-8 to the lipid rafts, which was prevented by a death domain-defective receptor. CD95 internalization was then rapid in type I and delayed in type II cells and s…
Verbal ordinal classification with multicriteria decision aiding
2008
Abstract Professionals in neuropsychology usually perform diagnoses of patients’ behaviour in a verbal rather than in a numerical form. This fact generates interest in decision support systems that process verbal data. It also motivates us to develop methods for the classification of such data. In this paper, we describe ways of aiding classification of a discrete set of objects, evaluated on set of criteria that may have verbal estimations, into ordered decision classes. In some situations, there is no explicit additional information available, while in others it is possible to order the criteria lexicographically. We consider both of these cases. The proposed Dichotomic Classification (DC…
A Fuzzy Inference Expert System to Support the Decision of Deploying a Military Naval Unit to a Mission
2009
Naval military units are complex systems required to operate in fixed time frames in offshore tasks where maintenance operations are drastically limited. A failure during a mission is a critical event that can drastically influence the mission success. The decision of switching a unit to a mission hence requires complex judgments involving information about the health status of machineries and the environmental conditions. The present procedure aims to support the decision about switching a unit to a mission considering the vagueness and uncertainty of information by means of fuzzy theory and emulates the decision process of a human expert by means of a rule-based inference engine. A numeri…
A knowledge-based decision support system in bioinformatics: An application to protein complex extraction
2013
Abstract Background We introduce a Knowledge-based Decision Support System (KDSS) in order to face the Protein Complex Extraction issue. Using a Knowledge Base (KB) coding the expertise about the proposed scenario, our KDSS is able to suggest both strategies and tools, according to the features of input dataset. Our system provides a navigable workflow for the current experiment and furthermore it offers support in the configuration and running of every processing component of that workflow. This last feature makes our system a crossover between classical DSS and Workflow Management Systems. Results We briefly present the KDSS' architecture and basic concepts used in the design of the knowl…
A recurrent deep neural network model to measure sentence complexity for the Italian Language
2019
Text simplification (TS) is a natural language processing task devoted to the modification of a text in such a way that the grammar and structure of the phrases is greatly simplified, preserving the underlying meaning and information contents. In this paper we give a contribution to the TS field presenting a deep neural network model able to detect the complexity of italian sentences. In particular, the system gives a score to an input text that identifies the confidence level during the decision making process and that could be interpreted as a measure of the sentence complexity. Experiments have been carried out on one public corpus of Italian texts created specifically for the task of TS…