Acute effects of endurance exercise on jumping and kicking performance in top-class young soccer players

The aim of this study was to examine the acute effects of endurance exercise on jumping and kicking performance in young soccer players. Twenty-one top-class young soccer players (16.1±0.2 years) performed a countermovement jump test and a maximal instep soccer kick test before and after running for 20 min on a treadmill at 80% of their individual maximum heart rate. Two force platforms were used to obtain the following parameters during the countermovement jump: jump height, maximum power, maximum power relative to body mass, maximum vertical ground reaction force, maximum vertical ground reaction force relative to body mass, and maximum vertical ground reaction force applied to each leg. Maximum vertical ground reaction force and maximum vertical ground reaction force relative to body mass applied to the support leg during the kicks were also calculated with a force platform. The kicking motion was recorded using a three-dimensional motion-capture system. Maximum velocity of the ball, maximum linear velocity of the toe, ankle, knee and hip, and linear velocity of the toe at ball contact during the kicks were calculated. Non-significant differences were found in the parameters measured during the countermovement jump and the maximal instep soccer kick test before and after running, suggesting that the jumping and kicking performances of top-class young soccer players were not significantly affected after 20 min treadmill running at 80% of their individual maximum heart rate.

Efficient top-down set-sharing analysis using cliques

Abstract. We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a top-down framework. In particular, we define the new abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. We use cliques both as an alternative representation and as widening, defining several widening operators. Our experimental evaluation supports the conclusión that, for inferring set-sharing, as it was the case for inferring pair-sharing, precisión losses are limited, while useful efficieney gains are obtained. We also derive useful conclusions regarding the interactions between thresholds, precisión, efficieney and cost of widening. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.

Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs

Bruynooghe described a framework for the top-down abstract interpretation of logic programs. In this framework, abstract interpretation is carried out by constructing an abstract and-or tree in a top-down fashion for a given query and program. Such an abstract interpreter requires fixpoint computation for programs which contain recursive predicates. This paper presents in detail a fixpoint algorithm that has been developed for this purpose and the motivation behind it. We start off by describing a simple-minded algorithm. After pointing out its shortcomings, we present a series of refinements to this algorithm, until we reach the final version. The aim is to give an intuitive grasp and provide justification for the relative complexity of the final algorithm. We also present an informal proof of correctness of the algorithm and some results obtained from an implementation.