905 research outputs found

    Statistical Analysis of a Posteriori Channel and Noise Distribution Based on HARQ Feedback

    Full text link
    In response to a comment on one of our manuscript, this work studies the posterior channel and noise distributions conditioned on the NACKs and ACKs of all previous transmissions in HARQ system with statistical approaches. Our main result is that, unless the coherence interval (time or frequency) is large as in block-fading assumption, the posterior distribution of the channel and noise either remains almost identical to the prior distribution, or it mostly follows the same class of distribution as the prior one. In the latter case, the difference between the posterior and prior distribution can be modeled as some parameter mismatch, which has little impact on certain type of applications.Comment: 15 pages, 2 figures, 4 table

    High accuracy semidefinite programming bounds for kissing numbers

    Get PDF
    The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This paper is a report on high accuracy calculations of these upper bounds for n <= 24. The bound for n = 16 implies a conjecture of Conway and Sloane: There is no 16-dimensional periodic point set with average theta series 1 + 7680q^3 + 4320q^4 + 276480q^5 + 61440q^6 + ...Comment: 7 pages (v3) new numerical result in Section 4, to appear in Experiment. Mat

    ¿Una imagen dualista en el De Anima de Aristóteles?

    Get PDF
    This paper deals with a seeming contradiction that may seriously impair Aristotle’s definition of the soul in his De Anima. While this definiens has been widely regarded as providing a non-dualistic account of life-functions, grounded in a hylomorphic approach to living beings, Aristotle sticks to an instrumental language vis-à-vis the body, which he consistently refers to as a tool of the soul. It is argued that this philosophical way of talking should be taken at face value, without dismiss- ing it as a stylistic feature or a theoretical hangover from Aristotle’s Platonic days. By paying close attention to the Peripatetic and Neoplatonic reception of the “soul – boatman analogy”, the paper concludes that organic bodies may be considered as instrumental in nature, without this entailing commitment to further individual souls conceived as “users”

    Semidefinite code bounds based on quadruple distances

    Full text link
    Let A(n,d)A(n,d) be the maximum number of 0,10,1 words of length nn, any two having Hamming distance at least dd. We prove A(20,8)=256A(20,8)=256, which implies that the quadruply shortened Golay code is optimal. Moreover, we show A(18,6)673A(18,6)\leq 673, A(19,6)1237A(19,6)\leq 1237, A(20,6)2279A(20,6)\leq 2279, A(23,6)13674A(23,6)\leq 13674, A(19,8)135A(19,8)\leq 135, A(25,8)5421A(25,8)\leq 5421, A(26,8)9275A(26,8)\leq 9275, A(21,10)47A(21,10)\leq 47, A(22,10)84A(22,10)\leq 84, A(24,10)268A(24,10)\leq 268, A(25,10)466A(25,10)\leq 466, A(26,10)836A(26,10)\leq 836, A(27,10)1585A(27,10)\leq 1585, A(25,12)55A(25,12)\leq 55, and A(26,12)96A(26,12)\leq 96. The method is based on the positive semidefiniteness of matrices derived from quadruples of words. This can be put as constraint in a semidefinite program, whose optimum value is an upper bound for A(n,d)A(n,d). The order of the matrices involved is huge. However, the semidefinite program is highly symmetric, by which its feasible region can be restricted to the algebra of matrices invariant under this symmetry. By block diagonalizing this algebra, the order of the matrices will be reduced so as to make the program solvable with semidefinite programming software in the above range of values of nn and dd.Comment: 15 page

    Upper bounds for packings of spheres of several radii

    Full text link
    We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for packings of spherical caps of two different sizes and for binary sphere packings. We also slightly improve bounds for the classical problem of packing identical spheres.Comment: 31 page

    Avaliação da reação de resistência à ferrugem da folha e do colmo à campo no germoplasma de azevém da Embrapa, safra 2006.

    Get PDF
    bitstream/CNPGL/12932/1/comunicado_167.pd

    Avaliação da cultivar de azevém BRS Ponteio na região da campanha do Rio Grande do Sul.

    Get PDF
    Importância e situação atual do cultivo de azevém no Rio Grande do Sul; Características da cultivar BRS Ponteio; Comportamento produtivo na região da campanha do Rio Grande do Sul.bitstream/item/63856/1/CO68.pd

    BRS Resteveiro: nova cultivar de inverno para solos hidromórficos.

    Get PDF
    bitstream/item/79241/1/Comunicado-291.pd
    corecore