1,354 research outputs found

    Computerized polar plots by a cathode ray tube/grid overlay method

    Get PDF
    Overlay is aligned with four calibration dots so it is not affected by CRT drift or changes in vertical or horizontal gain when producing Nyquist /frequency-response phase/amplitude/ plots. Method produces over 50 plots per hour

    Real Property

    Get PDF

    Algorithms for zero-dimensional ideals using linear recurrent sequences

    Get PDF
    Inspired by Faug\`ere and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such sequences.Comment: LNCS, Computer Algebra in Scientific Computing CASC 201

    Racial Preferences, Racial Awareness, and Racial Identification of Native American Children

    Get PDF
    Psycholog

    Improving Corn Production in Southeast Kansas

    Get PDF
    Corn performance and yield varies as a function of the growing environment and soil properties. Components contributing to yield in corn were examined through on-farm measurements of soil properties in southeast Kansas. Environmental variability between the 2013, 2014, and 2015 growing seasons contributed to changes in yield. Management can also impact the amount of harvested yield

    Signing on a Postcard

    Get PDF
    We investigate the problem of signing short messages using a scheme that minimizes the total length of the original message and the appended signature. This line of research was motivated by several postal services interested by stamping machines capable of producing digital signatures. Although several message recovery schemes exist, their security is questionable. This paper proposes variants of DSA and ECDSA allowing partial recovery: the signature is appended to a truncated message and the discarded bytes are recovered by the verification algorithm

    On sets of irreducible polynomials closed by composition

    Full text link
    Let S\mathcal S be a set of monic degree 22 polynomials over a finite field and let CC be the compositional semigroup generated by S\mathcal S. In this paper we establish a necessary and sufficient condition for CC to be consisting entirely of irreducible polynomials. The condition we deduce depends on the finite data encoded in a certain graph uniquely determined by the generating set S\mathcal S. Using this machinery we are able both to show examples of semigroups of irreducible polynomials generated by two degree 22 polynomials and to give some non-existence results for some of these sets in infinitely many prime fields satisfying certain arithmetic conditions

    Cover Crop System to Control Charcoal Rot in Soybeans

    Get PDF
    This research compares methods of controlling charcoal rot in soybean cultivars from three maturity groups commonly grown in southeast Kansas. The results indicate that a mustard plant that produces high levels of glucosinolates can be used as a cover crop to reduce the charcoal rot disease in soybeans

    Cover Crop System to Control Charcoal Rot in Soybeans

    Get PDF
    This research compares methods of controlling charcoal rot in soybean cultivars from three maturity groups commonly grown in southeast Kansas. The results indicate that a mustard plant that produces high levels of glucosinolates can be used as a cover crop to reduce the charcoal rot disease in soybeans
    corecore