414 research outputs found

    A Genetic Algorithm for Chromaticity Correction in Diffraction Limited Storage Rings

    Full text link
    A multi-objective genetic algorithm is developed for optimizing nonlinearities in diffraction limited storage rings. This algorithm determines sextupole and octupole strengths for chromaticity correction that deliver optimized dynamic aperture and beam lifetime. The algorithm makes use of dominance constraints to breed desirable properties into the early generations. The momentum aperture is optimized indirectly by constraining the chromatic tune footprint and optimizing the off-energy dynamic aperture. The result is an effective and computationally efficient technique for correcting chromaticity in a storage ring while maintaining optimal dynamic aperture and beam lifetime. This framework was developed for the Swiss Light Source (SLS) upgrade project.Comment: 12 pages, 14 figure

    Helping children think: Gaze aversion and teaching

    Get PDF
    Looking away from an interlocutor's face during demanding cognitive activity can help adults answer challenging arithmetic and verbal-reasoning questions (Glenberg, Schroeder, & Robertson, 1998). However, such `gaze aversion' (GA) is poorly applied by 5-year-old school children (Doherty-Sneddon, Bruce, Bonner, Longbotham, & Doyle, 2002). In Experiment 1 we trained ten 5-year-old children to use GA while thinking about answers to questions. This trained group performed significantly better on challenging questions compared with 10 controls given no GA training. In Experiment 2 we found significant and monotonic age-related increments in spontaneous use of GA across three cohorts of ten 5-year-old school children (mean ages: 5;02, 5;06 and 5;08). Teaching and encouraging GA during challenging cognitive activity promises to be invaluable in promoting learning, particularly during early primary years

    Automated verification of shape, size and bag properties.

    Get PDF
    In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates. To improve expressivity, we have proposed a prover that can automatically handle user-defined predicates. These shape predicates allow programmers to describe a wide range of data structures with their associated size properties. In the current work, we shall enhance this prover by providing support for a new type of constraints, namely bag (multi-set) constraints. With this extension, we can capture the reachable nodes (or values) inside a heap predicate as a bag constraint. Consequently, we are able to prove properties about the actual values stored inside a data structure

    Measurement and Compensation of Horizontal Crabbing at the Cornell Electron Storage Ring Test Accelerator

    Full text link
    In storage rings, horizontal dispersion in the rf cavities introduces horizontal-longitudinal (xz) coupling, contributing to beam tilt in the xz plane. This coupling can be characterized by a "crabbing" dispersion term {\zeta}a that appears in the normal mode decomposition of the 1-turn transfer matrix. {\zeta}a is proportional to the rf cavity voltage and the horizontal dispersion in the cavity. We report experiments at the Cornell Electron Storage Ring Test Accelerator (CesrTA) where xz coupling was explored using three lattices with distinct crabbing properties. We characterize the xz coupling for each case by measuring the horizontal projection of the beam with a beam size monitor. The three lattice configurations correspond to a) 16 mrad xz tilt at the beam size monitor source point, b) compensation of the {\zeta}a introduced by one of two pairs of RF cavities with the second, and c) zero dispersion in RF cavities, eliminating {\zeta}a entirely. Additionally, intrabeam scattering (IBS) is evident in our measurements of beam size vs. rf voltage.Comment: 5 figures, 10 page
    corecore