The goals of the study were to compare data of vertical ground reaction force (GRF) parameters during level walking, stair ascent and descent on three different stair inclinations and three different age groups. Twenty healthy subjects of three age groups (young 33.7 years; middle 63.6 years; old 76.5 years) were tested during the seven test conditions with 8-10 repetitions. Vertical forces wer...

Push-ups are a common and practical exercise that is used to enhance fitness, including upper body strength or endurance. The kinetic characteristics of push-ups and its variations are yet to be quantified. Kinetic quantification is necessary to accurately evaluate the training load, and thus the nature of the training stimulus, for these exercise variations. This study assessed the peak vertic...

This study was undertaken to evaluate the biological potency of two synthetic human growth hormone-releasing factors, hGRF (1-44)NH2 and hGRF (1-29)NH2, on growth hormone (GH) release in young dairy heifers (n = 10) and pigs (n = 10). In each species, the GH response to an iv injection (0, .067, .2, .6 and 1.8 nmol.kg-1 body weight) of each peptide was evaluated in a double 5 X 5 Latin square d...

We prove that if G and H are primitive strongly regular graphs with the same parameters and φ is a homomorphism from G to H, then φ is either an isomorphism or a coloring (homomorphism to a complete subgraph). Moreover, any such coloring is optimal for G and its image is a maximum clique of H. Therefore, the only endomorphisms of a primitive strongly regular graph are automorphisms or colorings...

A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Hoffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to certain imprimitive three-class association schemes. These correspondences lead to conditions for existence. Most examples come from spreads and fans in (part...

We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...