4 resultados para Nero, Emperor of Rome, 37-68
em Brock University, Canada
Resumo:
United States. 18th Congress, 1st session, 1823-1824. House. Doc. no. 30.
Resumo:
ABSTRACT The myosm regulatory light chain (RLC) of type II fibres is phosphorylated by Ca2+ -calmodulin dependent myosin light chain kinase (skMLCK) during muscular activation. The purpose of this study was to explore the effect of skMLCK gene ablation on the fatigability of mouse skeletal muscles during repetitive stimulation. The absence of myosin RLC phosphorylation in skMLCK knockout muscles attenuated contractile performance without a significant metabolic cost. Twitch force was potentiated to a greater extent in wildtype muscles until peak force had diminished to ~60% of baseline (37.2 ± 0.05% vs. 14.3 ± 0.02%). Despite no difference in peak force (Po) and shortening velocity (Vo), rate of force development (+dP/dt) and shortening-induced deactivation (SID) were almost two-fold greater in WT muscles. The present results demonstrate that myosin RLC phosphorylation may improve contractile performance during fatigue; providing a contractile advantage to working muscles and protecting against progressive fatigue.
Resumo:
Full Title: Message from the President of the United States, transmitting copies of a convention concluded at St. Petersburg, the 12th day of July, 1822, under the mediation of the Emperor of all the Russias, between the United States of America and His Britannic Majesty. United States. 18th Congress, 1st session, 1823-1824. House. Doc. no. 30. January 25, 1823. Read and referred to the Committee on Ways and Means. Printed by Gales and Seaton
Resumo:
The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.