3,613 research outputs found

    Search for the Standard Model Higgs->ZZ(*)->4leptons in ATLAS

    Get PDF
    The sensitivity of the ATLAS experiment to possible discovery channels has been recently re-evaluated using complete - ``as built'' - detector simulation, latest theoretical cross-section calculations, optimized selection criteria and appropriate statistical treatment. In this contribution, the sensitivity to H->ZZ(*)->4l, which covers the Standard Model Higgs discovery in the mass range from ~120 GeV to ~700 GeV, is presented. The four lepton signature makes this channel very promising, even for the detector start-up phase, while it poses stringent requirements in terms of lepton identification and measurement capabilities

    Route to Direct Multiphoton Multiple Ionization

    Full text link
    We address the concept of direct multiphoton multiple ionization in atoms exposed to intense, short wavelength radiation and explore the conditions under which such processes dominate over the sequential. Their contribution is shown to be quite robust, even under intensity fluctuations and interaction volume integration, and reasonable agreement with experimental data is also found.Comment: Close to the version to be published in Phys. Rev. A. Additional supplementary material can be found ther

    Search for light dark matter with NEWS-G

    Get PDF
    The NEWS-G collaboration is searching for light dark matter candidates using a spherical proportional counter. Light gases, such as hydrogen, helium, and neon, are used as targets, providing access in the 0.1-10 GeV mass range. First results obtained with SEDINE, a 60 cm in diameter detector, in the Underground Laboratory of Modane yielded a 90% confidence level upper limit of 4.4x 10^{37} cm^2 on the nucleon-dark matter interaction cross-section for a candidate with 0.5 GeV mass. Recent developments in several aspects of the detector instrumentation are presented, along with the construction of a new, 140 cm in diameter, detector with new compact shielding.Comment: 10 pages, 10 figures, 15th Topical Seminar on Innovative Particle and Radiation Detectors, 14-17 October 2019, Siena, Ital

    Effective forecasting for supply-chain planning: an empirical evaluation and strategies for improvement

    Get PDF
    Demand forecasting is a crucial aspect of the planning process in supply-chain companies. The most common approach to forecasting demand in these companies involves the use of a simple univariate statistical method to produce a forecast and the subsequent judgmental adjustment of this by the company's demand planners to take into account market intelligence relating to any exceptional circumstances expected over the planning horizon. Based on four company case studies, which included collecting more than 12,000 forecasts and outcomes, this paper examines: i) the extent to which the judgmental adjustments led to improvements in accuracy, ii) the extent to which the adjustments were biased and inefficient, iii) the circumstances where adjustments were detrimental or beneficial, and iv) methods that could lead to greater levels of accuracy. It was found that the judgmentally adjusted forecasts were both biased and inefficient. In particular, market intelligence that was expected to have a positive impact on demand was used far less effectively than intelligence suggesting a negative impact. The paper goes on to propose a set of improvements that could be applied to the forecasting processes in the companies and to the forecasting software that is used in these processes

    The longest path problem is polynomial on interval graphs.

    Get PDF
    The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, as it is a generalization of the Hamiltonian path problem. Motivated by the work of Uehara and Uno in [20], where they left the longest path problem open for the class of interval graphs, in this paper we show that the problem can be solved in polynomial time on interval graphs. The proposed algorithm runs in O(n 4) time, where n is the number of vertices of the input graph, and bases on a dynamic programming approach

    Particle dance: particle physics in the dance studio

    Get PDF
    A workshop using dance to introduce particle physics concepts to young children is presented. The workshop is realised in the dance studio, the children assume complete ownership of the activity and dance becomes the means to express ideas. The embodiment of the physics concepts facilitates knowledge assimilation, while empowering the students with respect to science. Beyond the scientific and artistic benefits of this workshop, this approach aspires to overcome the barriers between art and science; and open new interdisciplinary horizons for the students.Comment: 8 pages, 4 figure
    • …