Coledam DHC, Paludo AC, Oliveira AR, Dos-Santos JW. Dynamic exercise versus tag game warm up: the acute effect on agility and vertical jump in children. J. Hum. Sport Exerc. Vol. 7, No. 1, pp. 243-253, 2012. Although dynamic and stretching exercises have been widely investigated, there is little information about warm up performed by tag games. Thus, the purpose of the present study was to veri...

A recent study identified genetic variations within the miRNA response elements of miRNA target genes (miRSNP) that can affect the base paring between miRNAs and their targets, and hence alter miRNA-target interactions. The authors also undertook functional validation studies and were able to demonstrate that overexpression of miR-3162-5p resulted in a 20% decrease in expression of the KLK3 rs1...

We extend the quasilocal (metric-based) Hamiltonian formulation of general relativity so that it may be used to study regions of spacetime with null boundaries. In particular we use this generalized Brown-York formalism to study the physics of isolated horizons. We show that the first law of isolated horizon mechanics follows directly from the first variation of the Hamiltonian. This variation ...

We present a fast two-stage algorithm for computing the PageRank vector [16]. The algorithm exploits the following observation: the homogeneous discrete-time Markov chain associated with PageRank is lumpable, with the lumpable subset of nodes being the dangling nodes [13]. Time to convergence is only a fraction of what’s required for the standard algorithm employed by Google [16]. On data of 45...

A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic law (measure) μ. After observing each outcome, it is required to give the conditional probabilities of the next observation. The realizable case is when the measure μ belongs to an arbitrary but known class C of process measures. The non-realizable case is when μ is completely a...

The compact genetic algorithm is an Estimation of Distribution Algorithm for binary optimisation problems. Unlike the standard Genetic Algorithm, no cross-over or mutation is involved. Instead, the compact Genetic Algorithm uses a virtual population represented as a probability distribution over the set of binary strings. At each optimisation iteration, exactly two individuals are generated by ...

We describe two variations on the DeutschSchorr-Waite (henceforth, simply D S W ) algorithm for marking finite, rooted, binary, directed graphs (henceforth simply referred to as graphs) which dispense with the tag bit while retaining the same overall structure. The first variation handles all graphs, just as D S W , but trades average O(log n) (worst case O(n)) workspace and O(n) time for O(1) ...

In this paper, we study harmonic maps relative to α-connections, but not necessarily standard harmonic maps. A standard harmonic map is defined by the first variation of the energy functional of a map. A harmonic map relative to an α-connection is defined by an equation similar to a first variational equation, though it is not induced by the first variation of the standard energy functional. In...