University of Warsaw

About: University of Warsaw is a education organization based out in Warsaw, Poland. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 20832 authors who have published 56617 publications receiving 1185084 citations. The organization is also known as: Uniwersytet Warszawski & Warsaw University.

Dispersion energy from density-functional theory description of monomers.

Abstract: A method is proposed for calculations of dispersion energy at finite intermonomer separations. It uses a generalized Casimir-Polder formula evaluated with dynamic density susceptibilities provided by time-dependent density-functional theory. The method recovers the dispersion energies of He, Ne, and H2O dimers to within 3% or better. Since the computational effort of the new algorithm scales approximately as the third power of system size, the method is much more efficient than standard wave-function methods capable of predicting the dispersion energy at a similarly high level of accuracy.

Mitochondrial double-stranded RNA triggers antiviral signalling in humans

Abstract: Mitochondria are descendants of endosymbiotic bacteria and retain essential prokaryotic features such as a compact circular genome. Consequently, in mammals, mitochondrial DNA is subjected to bidirectional transcription that generates overlapping transcripts, which are capable of forming long double-stranded RNA structures1,2. However, to our knowledge, mitochondrial double-stranded RNA has not been previously characterized in vivo. Here we describe the presence of a highly unstable native mitochondrial double-stranded RNA species at single-cell level and identify key roles for the degradosome components mitochondrial RNA helicase SUV3 and polynucleotide phosphorylase PNPase in restricting the levels of mitochondrial double-stranded RNA. Loss of either enzyme results in massive accumulation of mitochondrial double-stranded RNA that escapes into the cytoplasm in a PNPase-dependent manner. This process engages an MDA5-driven antiviral signalling pathway that triggers a type I interferon response. Consistent with these data, patients carrying hypomorphic mutations in the gene PNPT1, which encodes PNPase, display mitochondrial double-stranded RNA accumulation coupled with upregulation of interferon-stimulated genes and other markers of immune activation. The localization of PNPase to the mitochondrial inter-membrane space and matrix suggests that it has a dual role in preventing the formation and release of mitochondrial double-stranded RNA into the cytoplasm. This in turn prevents the activation of potent innate immune defence mechanisms that have evolved to protect vertebrates against microbial and viral attack.

Search for neutral heavy leptons produced in Z decays

Abstract: Weak isosinglet Neutral Heavy Leptons (m) have been searched for using data collected by the DELPHI detector corresponding to 3:3 106 hadronic Z0 decays at LEP1. Four separate searches have been performed, for short-lived m production giving monojet or acollinear jet topologies, and for long-lived m giving detectable secondary vertices or calorimeter clusters. No indication of the existence of these particles has been found, leading to an upper limit for the branching ratio BR(Z0 ! m) of about 1:310−6 at 95% confidence level for m masses between 3.5 and 50 GeV/c2. Outside this range the limit weakens rapidly with the m mass. The results are also interpreted in terms of limits for the single production of excited neutrinos.

Maximum matchings via Gaussian elimination

Abstract: We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time O(n/sup w/), where w is the exponent of the best known matrix multiplication algorithm. Since w < 2.38, these algorithms break through the O(n/sup 2.5/) barrier for the matching problem. They both have a very simple implementation in time O(n/sup 3/) and the only non-trivial element of the O(n/sup w/) bipartite matching algorithm is the fast matrix multiplication algorithm. Our results resolve a long-standing open question of whether Lovasz's randomized technique of testing graphs for perfect matching in time O(n/sup w/) can be extended to an algorithm that actually constructs a perfect matching.