34,927 research outputs found

    Waterfowl Harvest and Hunter Use at Carlyle Lake During the 1972 Season

    Get PDF
    Division of Wildlife Resources Migratory Bird Section, Periodic Report No. 1Report issued on: March 26, 197

    Making the small oblique parameters large

    Full text link
    We compute the oblique parameters, including the three new parameters V V , W W and X X introduced recently by the Montreal group, for the case of one scalar multiplet of arbitrary weak isospin J J and weak hypercharge Y Y . We show that, when the masses of the heaviest and lightest components of the multiplet remain constant, but J J increases, the oblique parameter U U and the three new oblique parameters increase like J3 J^3 , while T T only increases like J J . For large multiplets with masses not much higher than mZ m_Z , the oblique parameters U U and V V may become much larger than T T and S S .Comment: 9 pages, standard LATEX, 3 figures available from the authors, report CMU-HEP93-17 and DOE-ER/40682-4

    Waterfowl Harvest and Hunter Use at Carlyle Lake During the 1973 Season

    Get PDF
    Division of Wildlife Resources Migratory Bird Section, Periodic Report No. 7Report issued on: April 15, 197

    Characteristics of Waterfowl Harvest at Horseshoe Lake, Madison County, Illinois

    Get PDF
    Division of Wildlife Resources Migratory Bird Section, Periodic Report No. 13Report issued on: April 21, 197

    Constraining the orbits of sub-stellar companions imaged over short orbital arcs

    Full text link
    Imaging a star's companion at multiple epochs over a short orbital arc provides only four of the six coordinates required for a unique orbital solution. Probability distributions of possible solutions are commonly generated by Monte Carlo (MCMC) analysis, but these are biased by priors and may not probe the full parameter space. We suggest alternative methods to characterise possible orbits, which compliment the MCMC technique. Firstly the allowed ranges of orbital elements are prior-independent, and we provide means to calculate these ranges without numerical analyses. Hence several interesting constraints (including whether a companion even can be bound, its minimum possible semi-major axis and its minimum eccentricity) may be quickly computed using our relations as soon as orbital motion is detected. We also suggest an alternative to posterior probability distributions as a means to present possible orbital elements, namely contour plots of elements as functions of line of sight coordinates. These plots are prior-independent, readily show degeneracies between elements and allow readers to extract orbital solutions themselves. This approach is particularly useful when there are other constraints on the geometry, for example if a companion's orbit is assumed to be aligned with a disc. As examples we apply our methods to several imaged sub-stellar companions including Fomalhaut b, and for the latter object we show how different origin hypotheses affect its possible orbital solutions. We also examine visual companions of A- and G-type main sequence stars in the Washington Double Star Catalogue, and show that ≳50\gtrsim50 per cent must be unbound.Comment: Accepted for publication in MNRA

    Bending vibrational data accuracy study

    Get PDF
    Computer program for predicting structural bending vibrational dat

    Computing the Loewner driving process of random curves in the half plane

    Full text link
    We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE) and models for which it is not. We study several tests of whether the driving process is Brownian motion. We find that just testing the normality of the process at a fixed time is not effective at determining if the process is Brownian motion. Tests that involve the independence of the increments of Brownian motion are much more effective. We also study the zipper algorithm for numerically computing the driving function of a simple curve. We give an implementation of this algorithm which runs in a time O(N^1.35) rather than the usual O(N^2), where N is the number of points on the curve.Comment: 20 pages, 4 figures. Changes to second version: added new paragraph to conclusion section; improved figures cosmeticall

    Arkansas Cotton Variety Test 2012

    Get PDF
    The primary goal of the Arkansas Cotton Variety Test is to provide unbiased data regarding the agronomic performance of cotton varieties and advanced breeding lines in the major cotton-growing areas of Arkansas. This information helps seed companies establish marketing strategies and assists producers in choosing varieties to plant
    • …
    corecore