7,665 research outputs found

    DELPHES 3, A modular framework for fast simulation of a generic collider experiment

    Get PDF
    The version 3.0 of the DELPHES fast-simulation is presented. The goal of DELPHES is to allow the simulation of a multipurpose detector for phenomenological studies. The simulation includes a track propagation system embedded in a magnetic field, electromagnetic and hadron calorimeters, and a muon identification system. Physics objects that can be used for data analysis are then reconstructed from the simulated detector response. These include tracks and calorimeter deposits and high level objects such as isolated electrons, jets, taus, and missing energy. The new modular approach allows for greater flexibility in the design of the simulation and reconstruction sequence. New features such as the particle-flow reconstruction approach, crucial in the first years of the LHC, and pile-up simulation and mitigation, which is needed for the simulation of the LHC detectors in the near future, have also been implemented. The DELPHES framework is not meant to be used for advanced detector studies, for which more accurate tools are needed. Although some aspects of DELPHES are hadron collider specific, it is flexible enough to be adapted to the needs of electron-positron collider experiments.Comment: JHEP 1402 (2014

    Genetic Characterization of the Tick-Borne Orbiviruses

    Get PDF
    The International Committee for Taxonomy of Viruses (ICTV) recognizes four species of tick-borne orbiviruses (TBOs): Chenuda virus, Chobar Gorge virus, Wad Medani virus and Great Island virus (genus Orbivirus, family Reoviridae). Nucleotide (nt) and amino acid (aa) sequence comparisons provide a basis for orbivirus detection and classification, however full genome sequence data were only available for the Great Island virus species. We report representative genome-sequences for the three other TBO species (virus isolates: Chenuda virus (CNUV); Chobar Gorge virus (CGV) and Wad Medani virus (WMV)). Phylogenetic comparisons show that TBOs cluster separately from insect-borne orbiviruses (IBOs). CNUV, CGV, WMV and GIV share low level aa/nt identities with other orbiviruses, in 'conserved' Pol, T2 and T13 proteins/genes, identifying them as four distinct virus-species. The TBO genome segment encoding cell attachment, outer capsid protein 1 (OC1), is approximately half the size of the equivalent segment from insect-borne orbiviruses, helping to explain why tick-borne orbiviruses have a ~1 kb smaller genome

    Outsourcing of the New Wave Form Acquisition, Surveillance and Diagnostic System for the LEP Injection Kickers

    Get PDF
    In 1996, a project has been launched to improve the acquisition, surveillance and diagnostic system of the LEP injection kickers. The technical solution is formed by a VXI acquisition hardware and a Windows NT / LabVIEW software environment. The realisation has been entirely outsourced to industry. This paper discusses the different phases of the project, from market survey over technical specification to acceptance tests, explains the technical choices and evaluates the results, presents the point of view of both parties on the collaboration and concludes with the experiences learned from this project

    Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random Satisfiability problem, and its application to stop-and-restart resolutions

    Full text link
    A large deviation analysis of the solving complexity of random 3-Satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. This exponentially small probability of easy resolutions is analytically calculated, and the corresponding exponent shown to be smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some theoretical basis to heuristic stop-and-restart solving procedures, and suggests a natural cut-off (the size of the instance) for the restart.Comment: Revtex file, 4 figure

    Switching between different vortex states in 2-dimensional easy-plane magnets due to an ac magnetic field

    Full text link
    Using a discrete model of 2-dimensional easy-plane classical ferromagnets, we propose that a rotating magnetic field in the easy plane can switch a vortex from one polarization to the opposite one if the amplitude exceeds a threshold value, but the backward process does not occur. Such switches are indeed observed in computer simulations.Comment: 4 pages, 4 figures, submitted to Phys. Rev. Let

    Noise-induced switching between vortex states with different polarization in classical two-dimensional easy-plane magnets

    Full text link
    In the 2-dimensional anisotropic Heisenberg model with XY-symmetry there are non-planar vortices which exhibit a localized structure of the z-components of the spins around the vortex center. We study how thermal noise induces a transition of this structure from one polarization to the opposite one. We describe the vortex core by a discrete Hamiltonian and consider a stationary solution of the Fokker-Planck equation. We find a bimodal distribution function and calculate the transition rate using Langer's instanton theory (1969). The result is compared with Langevin dynamics simulations for the full many-spin model.Comment: 15 pages, 4 figures, Phys. Rev. B., in pres

    Simplifying Random Satisfiability Problem by Removing Frustrating Interactions

    Full text link
    How can we remove some interactions in a constraint satisfaction problem (CSP) such that it still remains satisfiable? In this paper we study a modified survey propagation algorithm that enables us to address this question for a prototypical CSP, i.e. random K-satisfiability problem. The average number of removed interactions is controlled by a tuning parameter in the algorithm. If the original problem is satisfiable then we are able to construct satisfiable subproblems ranging from the original one to a minimal one with minimum possible number of interactions. The minimal satisfiable subproblems will provide directly the solutions of the original problem.Comment: 21 pages, 16 figure
    • …
    corecore