Alteration in neuromuscular function after a 5 km running time trial.

The aim of this study was to characterize the effect of a 5 km running time trial on the neuromuscular properties of the plantar flexors. Eleven well-trained triathletes performed a series of neuromuscular tests before and immediately after the run on a 200 m indoor track. Muscle activation (twitch interpolation) and normalized EMG activity were assessed during maximal voluntary contraction (MVC) of plantar flexors. Maximal soleus H-reflexes and M-waves were evoked at rest (i.e. H (MAX) and M (MAX), respectively) and during MVC (i.e. H (SUP) and M (SUP), respectively). MVC significantly declined (-27%; P < 0.001) after the run, due to decrease in muscle activation (-8%; P < 0.05) and M (MAX)-normalized EMG activity (-13%; P < 0.05). Significant reductions in M-wave amplitudes (M (MAX): -13% and M (SUP): -16%; P < 0.05) as well as H (MAX)/M (MAX) (-37%; P < 0.01) and H (SUP)/M (SUP) (-25%; P < 0.05) ratios occurred with fatigue. Following exercise, the single twitch was characterized by lower peak torque (-16%; P < 0.001) as well as shorter contraction (-19%; P < 0.001) and half-relaxation (-24%; P < 0.001) times. In conclusion, the reduction in plantar flexors strength induced by a 5 km running time trial is caused by peripheral adjustments, which are attributable to a failure of the neuromuscular transmission and excitation-contraction coupling. Fatigue also decreased the magnitude of efferent motor outflow from spinal motor neurons to the plantar flexors and part of this suboptimal neural drive is the result of an inhibition of soleus motoneuron pool reflex excitability.

Alteration in neuromuscular function after a 5 km running time trial

The aim of this study was to characterize the effect of a 5 km running time trial on the neuromuscular properties of the plantar flexors. Eleven well-trained triathletes performed a series of neuromuscular tests before and immediately after the run on a 200 m indoor track. Muscle activation (twitch interpolation) and normalized EMG activity were assessed during maximal voluntary contraction (MVC) of plantar flexors. Maximal soleus H-reflexes and M-waves were evoked at rest (i.e. H (MAX) and M (MAX), respectively) and during MVC (i.e. H (SUP) and M (SUP), respectively). MVC significantly declined (-27%; P < 0.001) after the run, due to decrease in muscle activation (-8%; P < 0.05) and M (MAX)-normalized EMG activity (-13%; P < 0.05). Significant reductions in M-wave amplitudes (M (MAX): -13% and M (SUP): -16%; P < 0.05) as well as H (MAX)/M (MAX) (-37%; P < 0.01) and H (SUP)/M (SUP) (-25%; P < 0.05) ratios occurred with fatigue. Following exercise, the single twitch was characterized by lower peak torque (-16%; P < 0.001) as well as shorter contraction (-19%; P < 0.001) and half-relaxation (-24%; P < 0.001) times. In conclusion, the reduction in plantar flexors strength induced by a 5 km running time trial is caused by peripheral adjustments, which are attributable to a failure of the neuromuscular transmission and excitation-contraction coupling. Fatigue also decreased the magnitude of efferent motor outflow from spinal motor neurons to the plantar flexors and part of this suboptimal neural drive is the result of an inhibition of soleus motoneuron pool reflex excitability.

Minimum mean running time function generation using read only memory /

Vita.

Changes in Running Mechanics and Spring-Mass Behaviour during a 5-km Time Trial

Research into the biomechanical manifestation of fatigue during exhaustive runs is increasingly popular but additional understanding of the adaptation of the spring-mass behaviour during the course of strenuous, self-paced exercises continues to be a challenge in order to develop optimized training and injury prevention programs. This study investigated continuous changes in running mechanics and spring-mass behaviour during a 5-km run. 12 competitive triathletes performed a 5-km running time trial (mean performance: 17 min 30 s) on a 200 m indoor track. Vertical and anterior-posterior ground reaction forces were measured every 200 m by a 5-m long force platform system, and used to determine spring-mass model characteristics. After a fast start, running velocity progressively decreased (- 11.6%; P<0.001) in the middle part of the race before an end spurt in the final 400-600 m. Stride length (- 7.4%; P<0.001) and frequency (- 4.1%; P=0.001) decreased over the 25 laps, while contact time (+ 8.9%; P<0.001) and total stride duration (+ 4.1%; P<0.001) progressively lengthened. Peak vertical forces (- 2.0%; P<0.01) and leg compression (- 4.3%; P<0.05), but not centre of mass vertical displacement (+ 3.2%; P>0.05), decreased with time. As a result, vertical stiffness decreased (- 6.0%; P<0.001) during the run, whereas leg stiffness changes were not significant (+ 1.3%; P>0.05). Spring-mass behaviour progressively changes during a 5-km time trial towards deteriorated vertical stiffness, which alters impact and force production characteristics.

Changes in running mechanics and spring-mass behaviour during a 5-km time trial.

Research into the biomechanical manifestation of fatigue during exhaustive runs is increasingly popular but additional understanding of the adaptation of the spring-mass behaviour during the course of strenuous, self-paced exercises continues to be a challenge in order to develop optimized training and injury prevention programs. This study investigated continuous changes in running mechanics and spring-mass behaviour during a 5-km run. 12 competitive triathletes performed a 5-km running time trial (mean performance: ̴17 min 30 s) on a 200 m indoor track. Vertical and anterior-posterior ground reaction forces were measured every 200 m by a 5-m long force platform system, and used to determine spring-mass model characteristics. After a fast start, running velocity progressively decreased (- 11.6%; P<0.001) in the middle part of the race before an end spurt in the final 400-600 m. Stride length (- 7.4%; P<0.001) and frequency (- 4.1%; P=0.001) decreased over the 25 laps, while contact time (+ 8.9%; P<0.001) and total stride duration (+ 4.1%; P<0.001) progressively lengthened. Peak vertical forces (- 2.0%; P<0.01) and leg compression (- 4.3%; P<0.05), but not centre of mass vertical displacement (+ 3.2%; P>0.05), decreased with time. As a result, vertical stiffness decreased (- 6.0%; P<0.001) during the run, whereas leg stiffness changes were not significant (+ 1.3%; P>0.05). Spring-mass behaviour progressively changes during a 5-km time trial towards deteriorated vertical stiffness, which alters impact and force production characteristics.

Reliability concepts applied to cutting tool change time

This paper presents a reliability-based analysis for calculating critical tool life in machining processes. It is possible to determine the running time for each tool involved in the process by obtaining the operations sequence for the machining procedure. Usually, the reliability of an operation depends on three independent factors: operator, machine-tool and cutting tool. The reliability of a part manufacturing process is mainly determined by the cutting time for each job and by the sequence of operations, defined by the series configuration. An algorithm is presented to define when the cutting tool must be changed. The proposed algorithm is used to evaluate the reliability of a manufacturing process composed of turning and drilling operations. The reliability of the turning operation is modeled based on data presented in the literature, and from experimental results, a statistical distribution of drilling tool wear was defined, and the reliability of the drilling process was modeled. (C) 2010 Elsevier Ltd. All rights reserved.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.

Structured running program for health and performance promotion in hospital employees.

Introduction Our institution (University hospital) is encouraging physical activities for health through various popular sporting events in the city of Lausanne, the biggest of which is a road race of 2, 4, 10 and 20km. Objective To create an efficient and sustainable training program in preparation of the race for a group of motivated hospital employees without any prior experience with structured training and to identifying the benefits and limitations encountered.. Methods Subjects of various fitness levels were recruited by add and agreed to undergo lab and field testing before a 12-week 3 times/week running program, based on maximal aerobic speed (MAS-30/30 sec intervals), running technique exercises and endurance training. The interval session was the only one supervised. Their goal was the 10km (11 subjects) and the 20km (6 subjects). Results A group of 17 subjects (7 male and 10 female), mean age 36.6±7.3 years, VO2max 44.0±5.5 ml/kg/min, filed test interval MAS 15.1±2.4 km/h started the program. 2 were lost because of injury (while skiing). Adherence to interval sessions was excellent, although 3 weekly training sessions proved to be difficult for most of the subjects. Performance in the race was satisfying for all of them, 6/7 subjects having improved their running time from the previous year, the others participated for the first time and 7/8 completed the race satisfyingly, one DNF-ed because of sinusitis. Repeat MAS field test was available for 6 subjects, who improved by 5.9% (p<0.01). Subjectively, all of the participants were very satisfied with improvement, interaction with colleagues from various professions, and with self achievement and confidence. Conclusions Implementation of a structured training program for recreational or non-athletes can be very successful in creating a better self-confidence, a better working environment inside a hospital facility and obviously in improvement of physical fitness and athletic performance. Above all, it can only encourage health institutions to promote the health of their own employees through physical activity, which can allow people to connect through sports. As a result, subjects in this study tend to encourage other employees to be more active and are hungry for more advice and continued offers for physical activities benefiting both them and the institution through better efficiency at work and less absenteeism common to more active people.

Energy system contribution in a maximal incremental test: correlations with pacing and overall performance in a 10-km running trial

This study aimed to verify the association between the contribution of energy systems during an incremental exercise test (IET), pacing, and performance during a 10-km running time trial. Thirteen male recreational runners completed an incremental exercise test on a treadmill to determine the respiratory compensation point (RCP), maximal oxygen uptake (V˙O2max), peak treadmill speed (PTS), and energy systems contribution; and a 10-km running time trial (T10-km) to determine endurance performance. The fractions of the aerobic (WAER) and glycolytic (WGLYCOL) contributions were calculated for each stage based on the oxygen uptake and the oxygen energy equivalents derived by blood lactate accumulation, respectively. Total metabolic demand (WTOTAL) was the sum of these two energy systems. Endurance performance during the T10-km was moderately correlated with RCP, V˙O2maxand PTS (P<@0.05), and moderate-to-highly correlated with WAER, WGLYCOL, and WTOTAL (P<0.05). In addition, WAER, WGLYCOL, and WTOTAL were also significantly correlated with running speed in the middle (P<0.01) and final (P<0.01) sections of the T10-km. These findings suggest that the assessment of energy contribution during IET is potentially useful as an alternative variable in the evaluation of endurance runners, especially because of its relationship with specific parts of a long-distance race.

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Using state-space techniques to represent frequency dependent single-phase lines directly in time domain

This paper proposes to use a state-space technique to represent a frequency dependent line for simulating electromagnetic transients directly in time domain. The distributed nature of the line is represented by a multiple 1t section network made up of the lumped parameters and the frequency dependence of the per unit longitudinal parameters is matched by using a rational function. The rational function is represented by its equivalent circuit with passive elements. This passive circuit is then inserted in each 1t circuit of the cascade that represents the line. Because the system is very sparse, it is possible to use a sparsity technique to store only nonzero elements of this matrix for saving space and running time. The model was used to simulate the energization process of a 10 km length single-phase line. ©2008 IEEE.

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.