Abstract. This paper presents a symbolic algorithm for computing the ODE systems which describe the evolution of the moments associated to a chemical reaction system, considered from a stochastic point of view. The algorithm, which is formulated in the Weyl algebra, seems more efficient than the corresponding method, based on partial derivatives. In particular, an efficient method for handling conservation laws is presented. The output of the algorithm can be used for a further investigation of the system behaviour, by numerical methods. Relevant examples are carried out.
RESUMOObjetivo: comparar as alterações psicomotoras por meio das aulas de Educação Física, em crianças de 8 a 9 anos de uma escola municipal de Anápolis-Go. Método: a amostra foi composta por 31 alunos de uma escola municipal de Anápolis-GO. Incluiu a realização da bateria psicomotora de Oliveira, que avaliou coordenação motora, equilíbrio, esquema corporal, lateralidade, estruturação espaço-temporal. Houve uma intervenção de 06 meses, e duas avaliações pré e pós. A amostra foi submetida a duas aulas de Educação Física por semana, com duração de 50 minutos, envolvendo atividades lúdico-recreativas, com base nas necessidades encontradas no primeiro teste, finalizando com a reavaliação psicomotora a fim de constatar as alterações ocorridas durante a intervenção. Foi realizado o test "t de Mann--Whitney para comparar o pré e pós avaliação por meio do software SPSS 21.0, com nível de significância de p≤0,05. Resultados: constatou-se que as crianças analisadas se encontravam dentro da faixa de aprendizagem. Melhoras significativas na coordenação motora e equilíbrio, no esquema corporal e na estrutura espacial foram observadas a partir da intervenção psicomotora de seis meses.
a b s t r a c tA trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of edges incident to the same vertex. A rooted trivalent diagram is a trivalent diagram with a distinguished edge, its root. We shall describe and analyze an algorithm giving an exhaustive list of rooted trivalent diagrams of a given size (number of edges), the list being non-redundant in that no two diagrams of the list are isomorphic. The algorithm will be shown to have optimal performance in that the time necessary to generate a diagram will be seen to be bounded in the amortized sense, the bound being independent of the size of the diagrams. We call this the CAT property. One objective of the paper is to provide a reusable theoretical framework for algorithms generating exhaustive lists of complex combinatorial structures with attention paid to the case of unlabeled structures and to those generators having the CAT property.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.