Rate of torque and electromyographic development during anticipated eccentric contraction is lower in previously strained hamstrings

Background: Hamstring strain injuries are prevalent in sport and re-injury rates have been high for many years. Whilst much focus has centred on the impact of previous hamstring strain injury on maximal eccentric strength, high rates of torque development is also of interest, given the important role of the hamstrings during the terminal swing phase of running. The impact of prior strain injury on myoelectrical activity of the hamstrings during tasks requiring high rates of torque development has received little attention. Purpose: To determine if recreational athletes with a history of unilateral hamstring strain injury, who have returned to training and competition, will exhibit lower levels of myoelectrical activity during eccentric contraction, rate of torque development and impulse 30, 50 and 100ms after the onset of myoelectrical activity or torque development in the previously injured limb compared to the uninjured limb. Study design: Case-control study Methods: Twenty-six recreational athletes were recruited. Of these, 13 athletes had a history of unilateral hamstring strain injury (all confined to biceps femoris long head) and 13 had no history of hamstring strain injury. Following familiarisation, all athletes undertook isokinetic dynamometry testing and surface electromyography assessment of the biceps femoris long head and medial hamstrings during eccentric contractions at -60 and -1800.s-1. Results: In the injured limb of the injured group, compared to the contralateral uninjured limb rate of torque development and impulse was lower during -600.s-1 eccentric contractions at 50 (RTD, injured limb = 312.27 ± 191.78Nm.s-1 vs. uninjured limb = 518.54 ± 172.81Nm.s-1, p=0.008; IMP, injured limb = 0.73 ± 0.30 Nm.s vs. uninjured limb = 0.97 ± 0.23 Nm.s, p=0.005) and 100ms (RTD, injured limb = 280.03 ± 131.42Nm.s-1 vs. uninjured limb = 460.54.54 ± 152.94Nm.s-1,p=0.001; IMP, injured limb = 2.15 ± 0.89 Nm.s vs. uninjured limb = 3.07 ± 0.63 Nm.s, p<0.001) after the onset of contraction. Biceps femoris long head muscle activation was lower at 100ms at both contraction speeds (-600.s-1, normalised iEMG activity (x1000), injured limb = 26.25 ± 10.11 vs. uninjured limb 33.57 ± 8.29, p=0.009; -1800.s-1, normalised iEMG activity (x1000), injured limb = 31.16 ± 10.01 vs. uninjured limb 39.64 ± 8.36, p=0.009). Medial hamstring activation did not differ between limbs in the injured group. Comparisons in the uninjured group showed no significant between limbs difference for any variables. Conclusion: Previously injured hamstrings displayed lower rate of torque development and impulse during slow maximal eccentric contraction compared to the contralateral uninjured limb. Lower myoelectrical activity was confined to the biceps femoris long head. Regardless of whether these deficits are the cause of or the result of injury, these findings could have important implications for hamstring strain injury and re-injury. Particularly, given the importance of high levels of muscle activity to bring about specific muscular adaptations, lower levels of myoelectrical activity may limit the adaptive response to rehabilitation interventions and suggest greater attention be given to neural function of the knee flexors following hamstring strain injury.

Impact of previous hamstring strain injury on rate of torque and EMG development during eccentric contraction.

Background: Hamstring strain injuries (HSIs) are prevalent in sport and re-injury rates have been high for many years. Whilst much focus has centred on the impact of previous hamstring strain injury on maximal eccentric strength, high rates of torque development is also of interest, given the important role of the hamstrings during the terminal swing phase of gait. The impact of prior strain injury on neuromuscular function of the hamstrings during tasks requiring high rates of torque development has received little attention. The purpose of this study is to determine if recreational athletes with a history of unilateral hamstring strain injury, who have returned to training and competition, will exhibit lower levels of eccentric muscle activation, rate of torque development and impulse 30, 50 and 100ms after the onset of electromyographical or torque development in the previously injured limb compared to the uninjured limb. Methods: Twenty-six recreational athletes were recruited. Of these, 13 athletes had a history of unilateral hamstring strain injury (all confined to biceps femoris long head) and 13 had no history of hamstring strain injury. Following familiarisation, all athletes undertook isokinetic dynamometry testing and surface electromyography assessment of the biceps femoris long head and medial hamstrings during eccentric contractions at -60 and -1800.s-1. Results: In the injured limb of the injured group, compared to the contralateral uninjured limb rate of torque development and impulse was lower during -600.s-1 eccentric contractions at 50 (RTD, p=0.008; IMP, p=0.005) and 100ms (RTD, p=0.001; IMP p<0.001) after the onset of contraction. There was also a non-significant trend for rate of torque development during -1800.s-1 to be lower 100ms after onset of contraction (p=0.064). Biceps femoris long head muscle activation was lower at 100ms at both contraction speeds (-600.s-1, p=0.009; -1800.s-1, p=0.009). Medial hamstring activation did not differ between limbs in the injured group. Comparisons in the uninjured group showed no significant between limbs difference for any variables. Conclusion: Previously injured hamstrings displayed lower rate of torque development and impulse during eccentric contraction. Lower muscle activation was confined to the biceps femoris long head. Regardless of whether these deficits are the cause of or the result of injury, these findings have important implications for hamstring strain injury and re-injury and suggest greater attention be given to neural function of the knee flexors.

An accurate numerical scheme for the contraction of a bubble in a Hele-Shaw cell

We report on an accurate numerical scheme for the evolution of an inviscid bubble in radial Hele-Shaw flow, where the nonlinear boundary effects of surface tension and kinetic undercooling are included on the bubble-fluid interface. As well as demonstrating the onset of the Saffman-Taylor instability for growing bubbles, the numerical method is used to show the effect of the boundary conditions on the separation (pinch-off) of a contracting bubble into multiple bubbles, and the existence of multiple possible asymptotic bubble shapes in the extinction limit. The numerical scheme also allows for the accurate computation of bubbles which pinch off very close to the theoretical extinction time, raising the possibility of computing solutions for the evolution of bubbles with non-generic extinction behaviour.

Lattice-free models of cell invasion : discrete simulations and travelling waves

Invasion waves of cells play an important role in development, disease and repair. Standard discrete models of such processes typically involve simulating cell motility, cell proliferation and cell-to-cell crowding effects in a lattice-based framework. The continuum-limit description is often given by a reaction–diffusion equation that is related to the Fisher–Kolmogorov equation. One of the limitations of a standard lattice-based approach is that real cells move and proliferate in continuous space and are not restricted to a predefined lattice structure. We present a lattice-free model of cell motility and proliferation, with cell-to-cell crowding effects, and we use the model to replicate invasion wave-type behaviour. The continuum-limit description of the discrete model is a reaction–diffusion equation with a proliferation term that is different from lattice-based models. Comparing lattice based and lattice-free simulations indicates that both models lead to invasion fronts that are similar at the leading edge, where the cell density is low. Conversely, the two models make different predictions in the high density region of the domain, well behind the leading edge. We analyse the continuum-limit description of the lattice based and lattice-free models to show that both give rise to invasion wave type solutions that move with the same speed but have very different shapes. We explore the significance of these differences by calibrating the parameters in the standard Fisher–Kolmogorov equation using data from the lattice-free model. We conclude that estimating parameters using this kind of standard procedure can produce misleading results.

Contraction-induced changes in TNFα and Akt-mediated signalling are associated with increased myofibrillar protein in rat skeletal muscle

Resistance training results in skeletal muscle hypertrophy, but the molecular signalling mechanisms responsible for this altered phenotype are incompletely understood. We used a resistance training (RT) protocol consisting of three sessions [day 1 (d1), day 3 (d3), day 5 (d5)] separated by 48 h recovery (squat exercise, 4 sets × 10 repetitions, 3 min recovery) to determine early signalling responses to RT in rodent skeletal muscle. Six animals per group were killed 3 h after each resistance training session and 24 and 48 h after the last training session (d5). There was a robust increase in TNF? protein expression, and IKKSer180/181 and p38MAPK Thr180/Tyr182 phosphorylation on d1 (P < 0.05), which abated with subsequent RT, returning to control levels by d5 for TNF? and IKK Ser180/181. There was a trend for a decrease in MuRF-1 protein expression, 48 h following d5 of training (P = 0.08). Notably, muscle myofibrillar protein concentration was elevated compared to control 24 and 48 h following RT (P < 0.05). AktSer473 and mTORSer2448 phosphorylation were unchanged throughout RT. Phosphorylation of p70S6k Thr389 increased 3 h post-exercise on d1, d3 and d5 (P < 0.05), whilst phosphorylation of S6Ser235/236 increased on d1 and d3 (P < 0.05). Our results show a rapid attenuation of inflammatory signalling with repeated bouts of resistance exercise, concomitant with summation in translation initiation signalling in skeletal muscle. Indeed, the cumulative effect of these signalling events was associated with myofibrillar protein accretion, which likely contributes to the early adaptations in response to resistance training overload in the skeletal muscle.

Lattice-free descriptions of collective motion with crowding and adhesion

Cell-to-cell adhesion is an important aspect of malignant spreading that is often observed in images from the experimental cell biology literature. Since cell-to-cell adhesion plays an important role in controlling the movement of individual malignant cells, it is likely that cell-to-cell adhesion also influences the spatial spreading of populations of such cells. Therefore, it is important for us to develop biologically realistic simulation tools that can mimic the key features of such collective spreading processes to improve our understanding of how cell-to-cell adhesion influences the spreading of cell populations. Previous models of collective cell spreading with adhesion have used lattice-based random walk frameworks which may lead to unrealistic results, since the agents in the random walk simulations always move across an artificial underlying lattice structure. This is particularly problematic in high-density regions where it is clear that agents in the random walk align along the underlying lattice, whereas no such regular alignment is ever observed experimentally. To address these limitations, we present a lattice-free model of collective cell migration that explicitly incorporates crowding and adhesion. We derive a partial differential equation description of the discrete process and show that averaged simulation results compare very well with numerical solutions of the partial differential equation.

Rapid yet accurate speech indexing using dynamic match lattice spotting

The support for typically out-of-vocabulary query terms such as names, acronyms, and foreign words is an important requirement of many speech indexing applications. However, to date many unrestricted vocabulary indexing systems have struggled to provide a balance between good detection rate and fast query speeds. This paper presents a fast and accurate unrestricted vocabulary speech indexing technique named Dynamic Match Lattice Spotting (DMLS). The proposed method augments the conventional lattice spotting technique with dynamic sequence matching, together with a number of other novel algorithmic enhancements, to obtain a system that is capable of searching hours of speech in seconds while maintaining excellent detection performance

Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE

We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two new hierarchical identity-based encryption (HIBE) schemes, with and without random oracles. The resulting systems are very different from earlier lattice-based HIBEs and in some cases result in shorter ciphertexts and private keys. We prove security from classic lattice hardness assumptions.

Efficient lattice (H)IBE in the standard model

We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor enables the real system to generate short vectors in all lattices in the family. The other trapdoor enables the simulator to generate short vectors for all lattices in the family except for one. We extend this basic technique to an adaptively-secure IBE and a Hierarchical IBE.

Lattice mixing and vanishing trapdoors : a framework for fully secure short signatures and more

We propose a framework for adaptive security from hard random lattices in the standard model. Our approach borrows from the recent Agrawal-Boneh-Boyen families of lattices, which can admit reliable and punctured trapdoors, respectively used in reality and in simulation. We extend this idea to make the simulation trapdoors cancel not for a specific forgery but on a non-negligible subset of the possible challenges. Conceptually, we build a compactly representable, large family of input-dependent “mixture” lattices, set up with trapdoors that “vanish” for a secret subset which we hope the forger will target. Technically, we tweak the lattice structure to achieve “naturally nice” distributions for arbitrary choices of subset size. The framework is very general. Here we obtain fully secure signatures, and also IBE, that are compact, simple, and elegant.

Lattice-based certificateless public-key encryption in the standard model

The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.

Lattice-based completely non-malleable public-key encryption in the standard model

An encryption scheme is non-malleable if giving an encryption of a message to an adversary does not increase its chances of producing an encryption of a related message (under a given public key). Fischlin introduced a stronger notion, known as complete non-malleability, which requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti later proposed a comparison-based definition of this security notion, which is more in line with the well-studied definitions proposed by Bellare et al. The authors also provide additional feasibility results by proposing two constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Therefore, the only previously known completely non-malleable (and non-interactive) scheme in the standard model, is quite inefficient as it relies on generic NIZK approach. They left the existence of efficient schemes in the common reference string model as an open problem. Recently, two efficient public-key encryption schemes have been proposed by Libert and Yung, and Barbosa and Farshim, both of them are based on pairing identity-based encryption. At ACISP 2011, Sepahi et al. proposed a method to achieve completely non-malleable encryption in the public-key setting using lattices but there is no security proof for the proposed scheme. In this paper we review the mentioned scheme and provide its security proof in the standard model. Our study shows that Sepahi’s scheme will remain secure even for post-quantum world since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best known classical (i.e., non-quantum) algorithms.

Lattice-based threshold changeability for standard shamir sectret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (geometry of numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Expressive cryptography : lattice perspectives

The invention of asymmetric encryption back in the seventies was a conceptual leap that vastly increased the expressive power of encryption of the times. For the first time, it allowed the sender of a message to designate the intended recipient in an cryptographic way, expressed as a “public key” that was related to but distinct from the “private key” that, alone, embodied the ability to decrypt. This made large-scale encryption a practical and scalable endeavour, and more than anything else—save the internet itself—led to the advent of electronic commerce as we know and practice it today.

Lattice-based completely non-malleable PKE in the standard model

This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.