290 research outputs found

    Muscle activation patterns in paralympic and novices hand cycling during incremental test

    Get PDF
    The few studies on muscle timing in hand cycling are difficult to classify in the motor skill acquirement due to their variety of methods and content. This study aims to replicate two existing studies and thus to extend and connect the current state of research concerning the muscle timing during synchronous pedalling. The activity on- and offset of biceps brachii, triceps brachii, posterior deltoid, anterior deltoid, upper trapezius, and pectoralis major were identified during an incremental test of an elite and three novice athletes. The results showed differences in inter-muscular coordination between the elite and novice hand cyclists. Although the distinction between active and inactive phases was already evident in novice data, the activation pattern of the elite athlete showed an even more precise differentiation between these two phases. These time windows remained stable even with increasing load accompanied only by changes in all signal amplitude, except for deltoid activity, which showed a later onset and offset with increasing load. Thus, in training of hand cyclist novices, the muscle timing concerning the duration and the crank position should be considered. In future studies, the effect of handicap severity and crank frequency must be studied in greater detail

    Extending Partial Representations of Circle Graphs in Near-Linear Time

    Get PDF
    The partial representation extension problem generalizes the recognition problem for geometric intersection graphs. The input consists of a graph G, a subgraph HGH ⊆ G and a representation R\mathcal{R}′ of H . The question is whether G admits a representation R\mathcal{R} whose restriction to H is R\mathcal{R}′. We study this question for circle graphs, which are intersection graphs of chords of a circle. Their representations are called chord diagrams. We show that for a graph with n vertices and m edges the partial representation extension problem can be solved in O((n+m)α(n+m))O((n + m)α(n + m)) time, thereby improving over an O(n3)O(n^3)-time algorithm by Chaplick et al. (J Graph Theory 91(4), 365–394, 2019). The main technical contributions are a canonical way of orienting chord diagrams and a novel compact representation of the set of all canonically oriented chord diagrams that represent a given circle graph G, which is of independent interest

    Level-Planarity: Transitivity vs. Even Crossings

    Get PDF
    The strong Hanani-Tutte theorem states that a graph is planar if and only if it can be drawn such that any two edges that do not share an end cross an even number of times. Fulek et al. (2013, 2016, 2017) have presented Hanani-Tutte results for (radial) level-planarity where the yy-coordinates (distances to the origin) of the vertices are prescribed. We show that the 2-SAT formulation of level-planarity testing due to Randerath et al. (2001) is equivalent to the strong Hanani-Tutte theorem for level-planarity (2013). By elevating this relationship to radial level planarity, we obtain a novel polynomial-time algorithm for testing radial level-planarity in the spirit of Randerath et al

    Extending Partial Representations of Circle Graphs in Near-Linear Time

    Get PDF
    The partial representation extension problem generalizes the recognition problem for geometric intersection graphs. The input consists of a graph G, a subgraph H ⊆ G and a representation H of H. The question is whether G admits a representation G whose restriction to H is H. We study this question for circle graphs, which are intersection graphs of chords of a circle. Their representations are called chord diagrams. We show that for a graph with n vertices and m edges the partial representation extension problem can be solved in O((n+m)α(n+m)) time, where α is the inverse Ackermann function. This improves over an O(n3^{3})-time algorithm by Chaplick, Fulek and Klavík [2019]. The main technical contributions are a canonical way of orienting chord diagrams and a novel compact representation of the set of all canonically oriented chord diagrams that represent a given circle graph G, which is of independent interest

    Danmarks udenrigspolitiske udfordringer

    Get PDF
    Udfordringen for dansk udenrigstjeneste er en flytning fra den atlantiske til den globale og den europæiske søjle. Det er et spørgsmål om rettidig omhu og om at udnytte de muligheder, som EU’s fælles udenrigspolitik giver.&nbsp
    corecore