The purpose of this investigation was to determine the relationship between relative net vertical impulse and jump height in a countermovement jump and static jump performed to varying squat depths. Ten college-aged males with 2 years of jumping experience participated in this investigation (age: 23.3 ± 1.5 years; height: 176.7 ± 4.5 cm; body mass: 84.4 ± 10.1 kg). Subjects performed a series o...

We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of the instruction to jump to is the content of some memory cell. We consider several kinds of indirect jump instructions. For each kind, we define the meaning of programs with indirect jump instructions...

Anderson and Csima [1] defined a jump operator, the bounded jump, with respect to bounded Turing (or weak truth table) reducibility. They showed that the bounded jump is closely related to the Ershov hierarchy and that it satisfies an analogue of Shoenfield jump inversion. We show that there are high bounded low sets and low bounded high sets. Thus, the information coded in the bounded jump is ...

We develop a tractable incomplete-markets model with an earnings process Y subject to permanent shocks and borrowing constraints. Financial frictions cause the marginal (certainty equivalent) value of wealth W to be greater than unity and decrease with liquidity w = W/Y . Additionally, financial frictions cause consumption to decrease with this endogenously determined marginal value of liquidit...

objectives: skeletal-muscular disorders affect the biomechanics of the human body, especially the lower extremity, with a negative effect on the biomechanics of exercise. the main aim of this study was to evaluate the effect of fatigue on the kinematic variables of knee joints during countermovement jumps in female students of physical education with valgus knee deformity.  methods: fifteen sub...

The problem of space-optimal jump encoding in the x86 instruction set, also known as branch displacement optimization, is described, and a linear-time algorithm is given that uses no complicated data structures, no recursion, and no randomization. The only assumption is that there are no array declarations whose size depends on the negative of the size of a section of code (Hyde 2006), which is...