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...

This paper provides a study of integer linear programming formulations for the diameter con-strained spanning tree problem (DMSTP) in the natural space of edge design variables. Afterpresenting a straightforward model based on the well known jump inequalities a new stronger familyof circular-jump inequalities is introduced. These inequalities are further generalized in two ways:...

In this paper, we present an unbiased Monte Carlo estimator for lookback options in jumpdiffusion models. Lookback options are difficult to price in jump-diffusion models, as their pay-off depends on the maximum of the share price over a particular time interval. In general, closed form solutions for prices of lookback options are not available but even simulating the pay-off of such an option ...

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 ...

The problems of scheduling jobs on a single machine subject to precedence constraints can often be modelled as the jump number problem for posets, where a linear extension of a given partial order is to be found which minimizes the number of noncomparabilities. In this paper, we are investigating a restricted class of posets, called interval orders, admitting approximation algorithms for the ju...

A graph H is obtained from a graph G by an edge rotation if G contains three distinct vertices u, v, and w such that uv ∈ E(G), uw 6∈ E(G), and H = G − uv + uw. A graph H is obtained from a graph G by an edge jump if G contains four distinct vertices u, v, w, and x such that uv ∈ E(G), wx 6∈ E(G), and H = G − uv + wx. If a graph H is obtained from a graph G by a sequence of edge jumps, then G i...

Background. Regardless of the age, elite athletes exhibit various motor capabilities (e.g., speed; endurance; strength) that are specific to that particular sport. Objectives. The purpose of this study was to compare different aspects of physical fitness (agility, strength, endurance) in thirty, 9 year old elite soccer and hockey players. Methods. Participants completed a 90 minute familiariz...