0000000000540147
AUTHOR
Pedro V. Silva
showing 5 related works from this author
Sports teams as complex adaptive systems: manipulating player numbers shapes behaviours during football small-sided games
2016
Small-sided and conditioned games (SSCGs) in sport have been modelled as complex adaptive systems. Research has shown that the relative space per player (RSP) formulated in SSCGs can impact on emergent tactical behaviours. In this study we adopted a systems orientation to analyse how different RSP values, obtained through manipulations of player numbers, influenced four measures of interpersonal coordination observed during performance in SSCGs. For this purpose we calculated positional data (GPS 15 Hz) from ten U-15 football players performing in three SSCGs varying in player numbers (3v3, 4v4 and 5v5). Key measures of SSCG system behaviours included values of (1) players’ dispersion, (2) …
Numerical relations and skill level constrain co-adaptive behaviors of agents in sports teams.
2014
Similar to other complex systems in nature (e.g., a hunting pack, flocks of birds), sports teams have been modeled as social neurobiological systems in which interpersonal coordination tendencies of agents underpin team swarming behaviors. Swarming is seen as the result of agent co-adaptation to ecological constraints of performance environments by collectively perceiving specific possibilities for action (affordances for self and shared affordances). A major principle of invasion team sports assumed to promote effective performance is to outnumber the opposition (creation of numerical overloads) during different performance phases (attack and defense) in spatial regions adjacent to the bal…
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.
On Fine and Wilf's theorem for bidimensional words
2003
AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.
Periodicity vectors for labelled trees
2003
AbstractThe concept of a periodicity vector is introduced in the context of labelled trees, and some new periodicity theorems are obtained. These results constitute generalizations of the classical periodicity theorem of Fine and Wilf for words. The concept of a tree congruence is also generalized and the isomorphism between the lattice of tree congruences and the lattice of unlabelled trees (prefix codes) is established.