6,767 research outputs found

    Future neutrino oscillation facilities

    Get PDF
    The recent discovery that neutrinos have masses opens a wide new field of experimentation. Accelerator-made neutrinos are essential in this program. Ideas for future facilities include high intensity muon neutrino beams from pion decay (`SuperBeam'), electron neutrino beams from nuclei decays (`Beta Beam'), or muon and electron neutrino beams from muon decay (`Neutrino Factory'), each associated with one or several options for detector systems. Each option offers synergetic possibilities, e.g. some of the detectors can be used for proton decay searches, while the Neutrino Factory is a first step towards muon colliders. A summary of the perceived virtues and shortcomings of the various options, and a number of open questions are presented.Comment: Originally written for the CERN Strategy Grou

    From circular paths to elliptic orbits: A geometric approach to Kepler's motion

    Get PDF
    The hodograph, i.e. the path traced by a body in velocity space, was introduced by Hamilton in 1846 as an alternative for studying certain dynamical problems. The hodograph of the Kepler problem was then investigated and shown to be a circle, it was next used to investigate some other properties of the motion. We here propose a new method for tracing the hodograph and the corresponding configuration space orbit in Kepler's problem starting from the initial conditions given and trying to use no more than the methods of synthetic geometry in a sort of Newtonian approach. All of our geometric constructions require straight edge and compass only.Comment: 9 pages, 4 figure

    Detectors for leptonic CP violation at the neutrino factory

    Get PDF
    Studies carried out in the framework of the International Design Study for the Neutrino Factory (the IDS-NF) show that the sensitivity to the CP violating phase and the last unknown mixing angle θ13 is maximised when two far detectors optimized to detect the sub-leading νe to νμ oscillation are combined. Several technologies are being discussed for these detectors: magnetised iron calorimeters; giant liquid argon TPCs; and totally active scintillating detectors. The IDS-NF baseline option, a compromise between feasibility, cost, and performance, is documented in the Interim Design Report (IDR) that has recently been completed. It consists of two magnetised iron sampling calorimeters, similar to the existing MINOS detector, but with 10-20 times more mass and improved performance. A detector of mass 100 kton is assumed at the intermediate baseline (between 2500 km and 5000 km) and a 50 kton detector at the long baseline (between 7000 km and 8000 km). The other far-detector options, which have better granularity, may be able to detect additional oscillation channels, thus improving the overall performance of the facility. However, these options are likely to be more expensive and require significant R&D

    Modelling concurrent systems specified in a temporal concurrent constraint language -I

    Get PDF
    In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language. This work is the first step to the framework construction. We present a formalism to transform a specification into a tcc Structure. This structure is a graph representation of the program behavior. Our basic tool is the Timed Concurrent Constraint Programming (tcc) framework defined by Saraswat et al. to describe reactive systems. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of time is built into the semantics of the programming language. In fact, on this ground it becomes reasonable to introduce the idea of applying the technique of Model Checking to a finite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be finite and hence Model Checking algorithms to be applicable. The graph construction is a completely automatic process that takes as input the tcc specification
    • …
    corecore