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 Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard`s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. (C) 2007 Elsevier Ltd. All rights reserved.

Reducing mean flow time in permutation flow shop

This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling problem solution. The proposed heuristic is compared with the best one considered in the literature. Experimental results show that the new heuristic provides better solutions regarding both the solution quality and computational effort.

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.

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.

A Graphical Representation Model for Telemedicine and Telehealth Center Sustainability

This study shows the creation of a graphical representation after the application of a questionnaire to evaluate the indicative factors of a sustainable telemedicine and telehealth center in Sao Paulo, Brazil. We categorized the factors into seven domain areas: institutional, functional, economic-financial, renewal, academic-scientific, partnerships, and social welfare, which were plotted into a graphical representation. The developed graph was shown to be useful when used in the same institution over a long period and complemented with secondary information from publications, archives, and administrative documents to support the numerical indicators. Its use may contribute toward monitoring the factors that define telemedicine and telehealth center sustainability. When systematically applied, it may also be useful for identifying the specific characteristics of the telemedicine and telehealth center, to support its organizational development.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L Lovasz, V.T. Sos, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC`06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703-1727.] stating that every hereditary graph property is testable. (C) 2011 Elsevier B.V. All rights reserved.

Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Representation type of Jordan algebras

The problem of classification of Jordan bit-nodules over (non-semisimple) finite dimensional Jordan algebras with respect to their representation type is considered. The notions of diagram of a Jordan algebra and of Jordan tensor algebra of a bimodule are introduced and a mapping Qui is constructed which associates to the diagram of a Jordan algebra J the quiver of its universal associative enveloping algebra S(J). The main results are concerned with Jordan algebras of semi-matrix type, that is, algebras whose semi-simple component is a direct sum of Jordan matrix algebras. In this case, criterion of finiteness and tameness for one-sided representations are obtained, in terms of diagram and mapping Qui, for Jordan tensor algebras and for algebras with radical square equals to 0. (c) 2010 Elsevier Inc. All rights reserved.

Alterações dimensionais do côndilo mandibular em indivíduos de 3 a 20 anos de idade usando tomografia computadorizada de feixe cônico: um estudo preliminar

INTRODUÇÃO: o exame de tomografia computadorizada de feixe cônico (TCFC) oferece excelente representação dos tecidos duros da articulação temporomandibular (ATM). OBJETIVO: investigar as alterações morfológicas do côndilo mandibular, da infância à idade adulta, utilizando a TCFC. MÉTODOS: um estudo transversal foi conduzido envolvendo 36 côndilos de 18 indivíduos com idades variando entre 3 e 20 anos. As imagens dos côndilos foram obtidas por meio do sistema i-CAT e medidas com uma ferramenta do programa específica para ATM, que permite cortes perpendiculares à cabeça do côndilo, com correção individual em função das diferenças angulares de cada um. As maiores distâncias nas vistas lateral e frontal foram consideradas tanto para os côndilos do lado direto como para os do lado esquerdo. RESULTADOS: a dimensão lateral do côndilo mandibular parece ser estabelecida de maneira precoce, sofrendo poucas alterações com o passar dos anos, enquanto a dimensão frontal tende a aumentar. Assimetrias entre o côndilo esquerdo e o direito foram comumente observadas; no entanto, tais diferenças não apresentaram significância estatística para as vistas lateral (P=0,815) e frontal (P=0,374). CONCLUSÕES: os côndilos apresentaram simetria com relação ao tamanho, sendo observado crescimento apenas na dimensão frontal Os resultados sugerem que a TCFC constitui-se numa ferramenta útil na mensuração e avaliação das dimensões condilares.

Multimodos e múltiplas Representações, aprendizagem significativa e subjetividade: três referenciais conciliáveis da educação científica

A linha de pesquisa em multimodos e múltiplas representações vem atualmente sendo inspiradora de ações instrucionais na educação científica. Partindo dos fundamentos que justificam um encaminhamento didático à luz dessas referências, este trabalho procura mostrar que há compatibilidade dos seus fundamentos com a teoria da aprendizagem significativa de Ausubel e com as questões levantadas pelas pesquisas que indicam a necessidade de se considerar a subjetividade dos alunos presentes numa sala de aula. Essencialmente, procuramos argumentar que a promoção de um ensino por meio de multimodos e múltiplas representações é consistente com o ambiente plural das subjetividades existentes numa sala de aula e com uma aprendizagem significativa.