Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

Representation and analysis of soccer players' actions using principal components

This paper proposes the use of the Principal Components Analysis (PCA) method to represent and to analyse soccer players' actions distribution in the pitch. The seven games of the Brazilian National Team during the 2002 World Cup were analysed. The player's position actions were measured from videotapes in a computer interface. The results were: a) the graphical representation, given by two orthogonal segments in the two directions of maximal variability and centred at the mean of each player's actions position; b) the eccentricity measurement, given by the variability ratio and c) the actions zone area, given by variability product. The results showed that the individual characteristics of acting were well represented by the PCA, allowing comparisons among games and providing insights related to the tactical organisation of the team.

Representação da área de responsabilidade de jogadores de futebol através do Diagrama de Voronoi

Universidade Estadual de Campinas . Faculdade de Educação Física

Methods of imagetic information representation

The aim of this paper is to highlight some of the methods of imagetic information representation, reviewing the literature of the area and proposing a model of methodology adapted to Brazilian museums. An elaboration of a methodology of imagetic information representation is developed based on Brazilian characteristics of information treatment in order to adapt it to museums. Finally, spreadsheets that show this methodology are presented.

The game inside the school: a representation of 5(th) graders physical education classes

Since the beginning of Physical Education entrance in the brazilin public schools, the game has been frequently used as content, and in the course of time that practice seems to be intensified. In spite of many approaches of different purposes to justify its pedagogic usefulness, the game has been used as an indiscriminate way due to the fascination that it provides to the students. The present study searches for a description and analysis of children`s (10-12 years old) attitudes behaviors in games, on Physical Education classes, inside a public school. The study was accomplished with the researcher also attending as a teacher (action research). For the accomplishment of the study 55 children were filmed in four different games, of different kinds (exposed, transformed, and spontaneous). The classes` description and analysis were focused in the attitude axis and it was defined four topics for the discussion: Conflicts, Respect of rules, Expressiveness, and Competitiveness. The relationship between the individual with the game and its culture were pointed as the main characteristics in the configuration of the ludicrous activity atmosphere. It was also possible to observe specific situations of this relationship, once the games were limited to the social games (Piaget category), in a school atmosphere where children have students roles. Due to the obtained results, the study proposes a reflexive practice in which the students notice their own attitudes and try to adapt the game to their needs and not he other way around. In this perspective, the teacher has an important mediator roll, once he will be responsible to point out the students` difficulties and promote discussions in favor to provide teamwork.

Experimental results on the nonlinear H(infinity) control via quasi-LPV representation and game theory for wheeled mobile robots

In this paper, nonlinear dynamic equations of a wheeled mobile robot are described in the state-space form where the parameters are part of the state (angular velocities of the wheels). This representation, known as quasi-linear parameter varying, is useful for control designs based on nonlinear H(infinity) approaches. Two nonlinear H(infinity) controllers that guarantee induced L(2)-norm, between input (disturbances) and output signals, bounded by an attenuation level gamma, are used to control a wheeled mobile robot. These controllers are solved via linear matrix inequalities and algebraic Riccati equation. Experimental results are presented, with a comparative study among these robust control strategies and the standard computed torque, plus proportional-derivative, controller.

A novel continuous time representation for the scheduling of pipeline systems with pumping yield rate constraints

Pipeline systems play a key role in the petroleum business. These operational systems provide connection between ports and/or oil fields and refineries (upstream), as well as between these and consumer markets (downstream). The purpose of this work is to propose a novel MINLP formulation based on a continuous time representation for the scheduling of multiproduct pipeline systems that must supply multiple consumer markets. Moreover, it also considers that the pipeline operates intermittently and that the pumping costs depend on the booster stations yield rates, which in turn may generate different flow rates. The proposed continuous time representation is compared with a previously developed discrete time representation [Rejowski, R., Jr., & Pinto, J. M. (2004). Efficient MILP formulations and valid cuts for multiproduct pipeline scheduling. Computers and Chemical Engineering, 28, 1511] in terms of solution quality and computational performance. The influence of the number of time intervals that represents the transfer operation is studied and several configurations for the booster stations are tested. Finally, the proposed formulation is applied to a larger case, in which several booster configurations with different numbers of stages are tested. (C) 2007 Elsevier Ltd. All rights reserved.

MODELING THE UNVOICED COMPONENT IN THE CANONICAL REPRESENTATION OF SPEECH

The canonical representation of speech constitutes a perfect reconstruction (PR) analysis-synthesis system. Its parameters are the autoregressive (AR) model coefficients, the pitch period and the voiced and unvoiced components of the excitation represented as transform coefficients. Each set of parameters may be operated on independently. A time-frequency unvoiced excitation (TFUNEX) model is proposed that has high time resolution and selective frequency resolution. Improved time-frequency fit is obtained by using for antialiasing cancellation the clustering of pitch-synchronous transform tracks defined in the modulation transform domain. The TFUNEX model delivers high-quality speech while compressing the unvoiced excitation representation about 13 times over its raw transform coefficient representation for wideband speech.

Optimized harvest scheduling in eucalyptus plantations under operational, spatial and climatic constraints

The representation of sustainability concerns in industrial forests management plans, in relation to environmental, social and economic aspects, involve a great amount of details when analyzing and understanding the interaction among these aspects to reduce possible future impacts. At the tactical and operational planning levels, methods based on generic assumptions usually provide non-realistic solutions, impairing the decision making process. This study is aimed at improving current operational harvesting planning techniques, through the development of a mixed integer goal programming model. This allows the evaluation of different scenarios, subject to environmental and supply constraints, increase of operational capacity, and the spatial consequences of dispatching harvest crews to certain distances over the evaluation period. As a result, a set of performance indicators was selected to evaluate all optimal solutions provided to different possible scenarios and combinations of these scenarios, and to compare these outcomes with the real results observed by the mill in the study case area. Results showed that it is possible to elaborate a linear programming model that adequately represents harvesting limitations, production aspects and environmental and supply constraints. The comparison involving the evaluated scenarios and the real observed results showed the advantage of using more holistic approaches and that it is possible to improve the quality of the planning recommendations using linear programming techniques.

Distinct conformational properties determined by implicit and explicit representation of protein-solvent interactions. An analytical and computer simulation study

In the protein folding problem, solvent-mediated forces are commonly represented by intra-chain pairwise contact energy. Although this approximation has proven to be useful in several circumstances, it is limited in some other aspects of the problem. Here we show that it is possible to achieve two models to represent the chain-solvent system. one of them with implicit and other with explicit solvent, such that both reproduce the same thermodynamic results. Firstly, lattice models treated by analytical methods, were used to show that the implicit and explicitly representation of solvent effects can be energetically equivalent only if local solvent properties are time and spatially invariant. Following, applying the same reasoning Used for the lattice models, two inter-consistent Monte Carlo off-lattice models for implicit and explicit solvent are constructed, being that now in the latter the solvent properties are allowed to fluctuate. Then, it is shown that the chain configurational evolution as well as the globule equilibrium conformation are significantly distinct for implicit and explicit solvent systems. Actually, strongly contrasting with the implicit solvent version, the explicit solvent model predicts: (i) a malleable globule, in agreement with the estimated large protein-volume fluctuations; (ii) thermal conformational stability, resembling the conformational hear resistance of globular proteins, in which radii of gyration are practically insensitive to thermal effects over a relatively wide range of temperatures; and (iii) smaller radii of gyration at higher temperatures, indicating that the chain conformational entropy in the unfolded state is significantly smaller than that estimated from random coil configurations. Finally, we comment on the meaning of these results with respect to the understanding of the folding process. (C) 2009 Elsevier B.V. All rights reserved.

EOPAS, the EthnoER online representation of interlinear text

One of the goals of the ARC funded Eresearch project called Sharing access and analytical tools for ethnographic digital media using high speed networks, or simply EthnoER is to take outputs of normal linguistic analytical processes and present them online in a system we have called the EthnoER online presentation and annotation system, or EOPAS.

Level-one highest weight representation of U-q[sl((N)over-cap vertical bar 1)] and Bosonization of the multicomponent Super t-J model

We study the level-one irreducible highest weight representations of the quantum affine superalgebra U-q[sl((N) over cap\1)], and calculate their characters and supercharacters. We obtain bosonized q-vertex operators acting on the irreducible U-q[sl((N) over cap\1)] modules and derive the exchange relations satisfied by the vertex operators. We give the bosonization of the multicomponent super t-J model by using the bosonized vertex operators. (C) 2000 American Institute of Physics. [S0022- 2488(00)00508-9].

Credit assignment: The memory representation of dynamic task events

The experiment examined the influence of memory for prior instances on aircraft conflict detection. Participants saw pairs of similar aircraft repeatedly conflict with each other. Performance improvements suggest that participants credited the conflict status of familiar aircraft pairs to repeated static features such as speed, and dynamic features such as aircraft relative position. Participants missed conflicts when a conflict pair resembled a pair that had repeatedly passed safely. Participants either did not attend to, or interpret, the bearing of aircraft correctly as a result of false memory-based expectations. Implications for instance models and situational awareness in dynamic systems are discussed.

The formal representation of process system modelling assumptions and their implications

In order to analyse the effect of modelling assumptions in a formal, rigorous way, a syntax of modelling assumptions has been defined. The syntax of modelling assumptions enables us to represent modelling assumptions as transformations acting on the set of model equations. The notion of syntactical correctness and semantical consistency of sets of modelling assumptions is defined and methods for checking them are described. It is shown on a simple example how different modelling assumptions act on the model equations and their effect on the differential index of the resulted model is also indicated.