1,985 research outputs found

    Calibration of the TWIST high-precision drift chambers

    Full text link
    A method for the precise measurement of drift times for the high-precision drift chambers used in the TWIST detector is described. It is based on the iterative correction of the space-time relationships by the time residuals of the track fit, resulting in a measurement of the effective drift times. The corrected drift time maps are parametrised individually for each chamber using spline functions. Biases introduced by the reconstruction itself are taken into account as well, making it necessary to apply the procedure to both data and simulation. The described calibration is shown to improve the reconstruction performance and to extend significantly the physics reach of the experiment.Comment: 8 pages, 5 figure

    A MATHEMATICAL PROGRAMMING MODEL FOR VEGETABLE ROTATIONS

    Get PDF
    Rotations have historically been used to alleviate pest problems in crop production. This paper considers methods of modeling rotations in linear programming models for Southeastern vegetable production. In such models, entering each possible crop rotation as a separate activity can be burdensome because of the large numbers of possible rotational alternatives. Conventional methodology for double crop rotations reduces the number of activities but must be adapted to accommodate triple crop rotational requirements in vegetable production. This paper demonstrates these methods both for a simple example and an empirical problem with numerous rotation alternatives. While the methods presented in this paper may have computational disadvantages compared to entering each rotation as a separate activity, they do have advantages in model design and data management.Crop Production/Industries,

    QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average

    Full text link
    In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X satisfies certain natural conditions. With QuickWeakHeapsort and QuickMergesort we present two examples for the QuickXsort-construction. Both are efficient algorithms that incur approximately n log n - 1.26n +o(n) comparisons on the average. A worst case of n log n + O(n) comparisons can be achieved without significantly affecting the average case. Furthermore, we describe an implementation of MergeInsertion for small n. Taking MergeInsertion as a base case for QuickMergesort, we establish a worst-case efficient sorting algorithm calling for n log n - 1.3999n + o(n) comparisons on average. QuickMergesort with constant size base cases shows the best performance on practical inputs: when sorting integers it is slower by only 15% to STL-Introsort

    New Measurement of the Cosmic-Ray Positron Fraction from 5 to 15 GeV

    Get PDF
    We present a new measurement of the cosmic-ray positron fraction at energies between 5 and 15 GeV with the balloon-borne HEAT-pbar instrument in the spring of 2000. The data presented here are compatible with our previous measurements, obtained with a different instrument. The combined data from the three HEAT flights indicate a small positron flux of non-standard origin above 5 GeV. We compare the new measurement with earlier data obtained with the HEAT-e+- instrument, during the opposite epoch of the solar cycle, and conclude that our measurements do not support predictions of charge sign dependent solar modulation of the positron abundance at 5 GeV.Comment: accepted for publication in PR

    Time Domain Explorations With Digital Sky Surveys

    Get PDF
    One of the new frontiers of astronomical research is the exploration of time variability on the sky at different wavelengths and flux levels. We have carried out a pilot project using DPOSS data to study strong variables and transients, and are now extending it to the new Palomar-QUEST synoptic sky survey. We report on our early findings and outline the methodology to be implemented in preparation for a real-time transient detection pipeline. In addition to large numbers of known types of highly variable sources (e.g., SNe, CVs, OVV QSOs, etc.), we expect to find numerous transients whose nature may be established by a rapid follow-up. Whereas we will make all detected variables publicly available through the web, we anticipate that email alerts would be issued in the real time for a subset of events deemed to be the most interesting. This real-time process entails many challenges, in an effort to maintain a high completeness while keeping the contamination low. We will utilize distributed Grid services developed by the GRIST project, and implement a variety of advanced statistical and machine learning techniques.Comment: 5 pages, 2 postscript figures, uses adassconf.sty. To be published in: "ADASS XIV (2004)", Eds. Patrick Shopbell, Matthew Britton and Rick Ebert, ASP Conference Serie
    • 

    corecore