877 research outputs found

    On Quality of Implementation of Fortran 2008 Complex Intrinsic Functions on Branch Cuts

    Get PDF

    HST/ACS Photometry of Old Stars in NGC 1569: The Star Formation History of a Nearby Starburst

    Full text link
    (abridged) We used HST/ACS to obtain deep V- and I-band images of NGC 1569, one of the closest and strongest starburst galaxies in the Universe. These data allowed us to study the underlying old stellar population, aimed at understanding NGC 1569's evolution over a full Hubble time. We focus on the less-crowded outer region of the galaxy, for which the color-magnitude diagram (CMD) shows predominantly a red giant branch (RGB) that reaches down to the red clump/horizontal branch feature (RC/HB). A simple stellar population analysis gives clear evidence for a more complicated star formation history (SFH) in the outer region. We derive the full SFH using a newly developed code, SFHMATRIX, which fits the CMD Hess diagram by solving a non-negative least squares problem. Our analysis shows that the relative brightnesses of the RGB tip and RC/HB, along with the curvature and color of the RGB, provide enough information to ameliorate the age-metallicity-extinction degeneracy. The distance/reddening combination that best fits the data is E(B-V) = 0.58 +/- 0.03 and D = 3.06 +/- 0.18 Mpc. Star formation began ~ 13 Gyr ago, and this accounts for the majority of the mass in the outer region. However, the initial burst was followed by a relatively low, but constant, rate of star formation until ~ 0.5-0.7 Gyr ago when there may have been a short, low intensity burst of star formation.Comment: 50 pages, including 17 figures. Accepted for publication in A

    Event generation with SHERPA 1.1

    Full text link
    In this paper the current release of the Monte Carlo event generator Sherpa, version 1.1, is presented. Sherpa is a general-purpose tool for the simulation of particle collisions at high-energy colliders. It contains a very flexible tree-level matrix-element generator for the calculation of hard scattering processes within the Standard Model and various new physics models. The emission of additional QCD partons off the initial and final states is described through a parton-shower model. To consistently combine multi-parton matrix elements with the QCD parton cascades the approach of Catani, Krauss, Kuhn and Webber is employed. A simple model of multiple interactions is used to account for underlying events in hadron--hadron collisions. The fragmentation of partons into primary hadrons is described using a phenomenological cluster-hadronisation model. A comprehensive library for simulating tau-lepton and hadron decays is provided. Where available form-factor models and matrix elements are used, allowing for the inclusion of spin correlations; effects of virtual and real QED corrections are included using the approach of Yennie, Frautschi and Suura.Comment: 47 pages, 21 figure

    Survey on Combinatorial Register Allocation and Instruction Scheduling

    Full text link
    Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation time. This paper provides an exhaustive literature review and a classification of combinatorial optimization approaches to register allocation and instruction scheduling, with a focus on the techniques that are most applied in this context: integer programming, constraint programming, partitioned Boolean quadratic programming, and enumeration. Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential benefit of applying combinatorial optimization

    A tool box for implementing supersymmetric models

    Full text link
    We present a framework for performing a comprehensive analysis of a large class of supersymmetric models, including spectrum calculation, dark matter studies and collider phenomenology. To this end, the respective model is defined in an easy and straightforward way using the \Mathematica package SARAH. SARAH then generates model files for CalcHep which can be used with MicrOmegas as well as model files for WHIZARD and OMEGA. In addition, Fortran source code for SPheno is created which facilitates the determination of the particle spectrum using two-loop renormalization group equations and one-loop corrections to the masses. As an additional feature, the generated SPheno code can write out input files suitable for use with HiggsBounds to apply bounds coming from the Higgs searches to the model. Combining all program provides a closed chain from model building to phenomenology.Comment: 68 pages, 7 figure
    • …
    corecore