949 resultados para Half-bound
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
"Originally published in the New-York National Advocate."
Resumo:
Includes advertisements and blank pages for additional recipes.
Resumo:
Argues that Shakers, as a charitable organization, ought not to be subject to income tax.
Resumo:
Attributed to Robert Ruffin Collier. Cf. Shoemaker. Wrongly attributed to Francis Walker Gilmer by Halkett & Laing.
Resumo:
Author's autograph presentation inscription.
Resumo:
Half bound.
Resumo:
"This copy is one of an edition of three hundred copies printed from type by the De Vinne press."--T.p. verso.
Resumo:
Gait repertoires of the northern brown bandicoot, Isoodon macrourus, were studied over a wide range of locomotor speeds. At low relative speeds, bandicoots used symmetrical gaits that included pacing, trotting, and lateral sequence strides. Forefoot contact duration was generally shorter than hind foot contact duration at all speeds. At moderate relative speeds bandicoots used half-bounding gaits with either no period of suspension or with a short gathered suspension. At high speeds the predominant gait had both a short extended and a short gathered suspension, although some strides comprised only an extended suspension. Increases in speed were accompanied by increases in spinal extension, presumably leading to the extended suspensions. On a stationary treadmill individuals occasionally used a bipedal gait. Maximum half-bounding speeds appear to be relatively low in this species.
Resumo:
Mode of access: Internet.
Resumo:
Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.