Wolfgang Wagner

Bio: Wolfgang Wagner is an academic researcher from Vienna University of Technology. The author has contributed to research in topics: Large Hadron Collider & Top quark. The author has an hindex of 156, co-authored 2342 publications receiving 123391 citations. Previous affiliations of Wolfgang Wagner include University of Pennsylvania & University of Amsterdam.

Search for Magnetic Monopoles and Stable High-Electric-Charge Objects in 13 Tev Proton-Proton Collisions with the ATLAS Detector

Abstract: A search for magnetic monopoles and high-electric-charge objects is presented using 34.4 fb^{-1} of 13 TeV pp collision data collected by the ATLAS detector at the LHC during 2015 and 2016. The considered signature is based upon high ionization in the transition radiation tracker of the inner detector associated with a pencil-shape energy deposit in the electromagnetic calorimeter. The data were collected by a dedicated trigger based on the tracker high-threshold hit capability. The results are interpreted in models of Drell-Yan pair production of stable particles with two spin hypotheses (0 and 1/2) and masses ranging from 200 to 4000 GeV. The search improves by approximately a factor of 5 the constraints on the direct production of magnetic monopoles carrying one or two Dirac magnetic charges and stable objects with electric charge in the range 20≤|z|≤60 and extends the charge range to 60<|z|≤100.

Production of ψ(2S) mesons in pp̄ collisions at 1.96 TeV

Abstract: We have measured the differential cross section for the inclusive production of $\ensuremath{\psi}(2\mathrm{S})$ mesons decaying to ${\ensuremath{\mu}}^{+}{\ensuremath{\mu}}^{\ensuremath{-}}$ that were produced in prompt or $B$-decay processes from $p\overline{p}$ collisions at 1.96 TeV. These measurements have been made using a data set from an integrated luminosity of $1.1\text{ }\text{ }{\mathrm{fb}}^{\ensuremath{-}1}$ collected by the CDF II detector at Fermilab. For events with transverse momentum ${p}_{T}(\ensuremath{\psi}(2\mathrm{S}))g2\text{ }\text{ }\mathrm{GeV}/c$ and rapidity $|y(\ensuremath{\psi}(2\mathrm{S}))|l0.6$ we measure the integrated inclusive cross section $\ensuremath{\sigma}(p\overline{p}\ensuremath{\rightarrow}\ensuremath{\psi}(2\mathrm{S})X)\ifmmode\cdot\else\textperiodcentered\fi{}\mathrm{Br}(\ensuremath{\psi}(2\mathrm{S})\ensuremath{\rightarrow}{\ensuremath{\mu}}^{+}{\ensuremath{\mu}}^{\ensuremath{-}})$ to be $3.29\ifmmode\pm\else\textpm\fi{}0.04(\mathrm{stat})\ifmmode\pm\else\textpm\fi{}0.32(\mathrm{syst})\text{ }\text{ }\mathrm{nb}$.

Search for flavor-changing neutral currents in top quark decays t→Hc and t→Hu in multilepton final states in proton-proton collisions at √s=13 TeV with the ATLAS detector

Abstract: Flavor-changing neutral currents are not present in the Standard Model at tree level and are suppressed in loop processes by the unitarity of the Cabibbo-Kobayashi-Maskawa matrix; the corresponding ...

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。