Effects of Lift Velocity on Muscle Activation During Leg Extension

It is not known if manipulating velocity within a prescribed resistance training mode will improve muscle activation. Muscle activations of the Rectus Femoris (RF), Vastus Lateralis (VL), Vastus Medialis (VM) and Bicep Femoris (BF) were examined during a leg extension exercise at 3 different velocities on 15 subjects (10men, 5 female, Age = 21.5 ± 1.8 yrs, Height = 171.2 ± 12.5 cm, Mass = 75.5 ± 16.3 kg). Trials of 1 set of 10 repetitions at 60% of 1RM, were performed at 15, 30 and 60º/s. Bipolar surface electrodes were placed over the BF, RF, VL, and VM. Micro-switches were utilized to identify the concentric (CON) and eccentric (ECC) phases of the lift. Data were sampled at 1024 Hz, filtered, rectified and the mean, integrated EMG calculated. One 2 x 4 x 3 (action x muscle x velocity) ANOVA with bonferonni adjustment was run and significance was followed by Tukey HSD post hoc analysis. Results indicated significantly greater activation of the VL, RF and VM for ECC extension at 60º/s compared to 15º/s. While 60º/s was also greater than 30º/s for the VL and VM during ECC. While comparing muscle action, CON VL, VM and RF were greater than ECC at 30º/sec, meanwhile VM CON was also greater at 15º/sec. No differences in muscle activation at any velocity or muscle action for BF were identified. We conclude that muscle recruitment while training with a 60% 1RM load is maximized at a velocity of 60º/s during ECC activity and 15 or 30º/sec during CON

Encoding CSP into CCS

We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Following the work of Parrow and Sj\"odin, the first encoding uses a centralised coordinator and establishes a variant of weak bisimilarity between source terms and their translations. The second encoding is decentralised, and thus more efficient, but ensures only a form of coupled similarity between source terms and their translations.Comment: In Proceedings EXPRESS/SOS 2015, arXiv:1508.0634

Nivel de cumplimiento en la aplicación del protocolo en el abordaje de embarazo ectópico en mujeres atendidas en el servicio de complicaciones I del Hospital Bertha Calderón Roque, en el periodo comprendido del 1 de Julio al 31 de Diciembre del 2015

El embarazo ectópico, del griego, ectos (fuera) y topos (lugar), fue descrito por primera vez por Albulcasis en 1863.Mauriceau en el siglo XVII lo incluyó en su texto como complicación obstétrica y, en 1883, Lauson Tait practicó la primera salpingectomía por embarazo ectópico con supervivencia de la madre. (Msc. Carlos Moya Toneut, 2013) El embarazo ectópico es la implantación del producto de la concepción fuera de la cavidad endometrial. Un embarazo es eutópico o intrauterino cuando el huevo anida y se desarrolla en su lugar habitual, el endometrio de revestimiento de la cavidad uterina. La anidación en cualquier otro lugar es un embarazo ectópico

Dualities in graphs and digraphs

In this thesis we describe dualities in directed as well as undirected graphs based on tools such as width-parameters, obstructions and substructures. We mainly focus on directed graphs and their structure. In the context of a long open conjecture that bounds the monotonicity costs of a version of the directed cops and robber game, we introduce new width-measures based on directed separations that are closely related to DAG-width. We identify a tangle-like obstruction for which we prove a duality theorem. Johnson, Reed, Robertson, Seymour and Thomas introduced the width measure directed treewidth as a generalisation of treewidth for directed graphs. We introduce a new width measure, the cyclewidth, which is parametrically equivalent to directed treewidth. Making use of the connection between directed graphs and bipartite graphs with perfect matchings we characterise the digraphs of low cyclewidth. Generalising the seminal work by Robertson and Seymour resulting in a global structure theorem for undirected graphs, there is the goal of obtaining a structure theorem, based on directed treewidth, describing the structure of the directed graphs excluding a fixed butterfly minor. Working in this direction we present a new flat wall theorem for directed graphs which we believe to provide a better base for a directed structure theorem than the existing ones. On undirected graphs we present several results on induced subgraphs in the graphs themselves or the square graph of their linegraph. These results range from general statements about all graphs to the consideration of specific graph classes such as the one with exactly two moplexes

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width would contain a large grid as a matching minor, similar to the result on treewidth by Robertson and Seymour. In this paper we obtain the first results on perfect matching width since its introduction. For the restricted case of bipartite graphs, we show that perfect matching width is equivalent to directed treewidth and thus the Directed Grid Theorem by Kawarabayashi and Kreutzer for directed \treewidth implies Norine's conjecture.Comment: Manuscrip