867 resultados para Mathematical transformations
Resumo:
New results on the theory of constrained systems are applied to characterize the generators of Noethers symmetry transformations. As a byproduct, an algorithm to construct gauge transformations in Hamiltonian formalism is derived. This is illustrated with two relevant examples.
Resumo:
The relationship between the Poincar and Galilei groups allows us to write the Poincar wave equations for arbitrary spin as a Fourier transform of the Galilean ones. The relation between the Lagrangian formulation for both cases is also studied.
Resumo:
We generalize the analogous of Lee Hwa Chungs theorem to the case of presymplectic manifolds. As an application, we study the canonical transformations of a canonical system (M, S, O). The role of Dirac brackets as a test of canonicity is clarified.
Resumo:
We generalize the analogous of Lee Hwa Chungs theorem to the case of presymplectic manifolds. As an application, we study the canonical transformations of a canonical system (M, S, O). The role of Dirac brackets as a test of canonicity is clarified.
Resumo:
Dans le développement logiciel en industrie, les documents de spécification jouent un rôle important pour la communication entre les analystes et les développeurs. Cependant, avec le temps, les changements de personel et les échéances toujours plus courtes, ces documents sont souvent obsolètes ou incohérents avec l'état effectif du système, i.e., son code source. Pourtant, il est nécessaire que les composants du système logiciel soient conservés à jour et cohérents avec leurs documents de spécifications pour faciliter leur développement et maintenance et, ainsi, pour en réduire les coûts. Maintenir la cohérence entre spécification et code source nécessite de pouvoir représenter les changements sur les uns et les autres et de pouvoir appliquer ces changements de manière cohérente et automatique. Nous proposons une solution permettant de décrire une représentation d'un logiciel ainsi qu'un formalisme mathématique permettant de décrire et de manipuler l'évolution des composants de ces représentations. Le formalisme est basé sur les triplets de Hoare pour représenter les transformations et sur la théorie des groupes et des homomorphismes de groupes pour manipuler ces transformations et permettrent leur application sur les différentes représentations du système. Nous illustrons notre formalisme sur deux représentations d'un système logiciel : PADL, une représentation architecturale de haut niveau (semblable à UML), et JCT, un arbre de syntaxe abstrait basé sur Java. Nous définissons également des transformations représentant l'évolution de ces représentations et la transposition permettant de reporter les transformations d'une représentation sur l'autre. Enfin, nous avons développé et décrivons brièvement une implémentation de notre illustration, un plugiciel pour l'IDE Eclipse détectant les transformations effectuées sur le code par les développeurs et un générateur de code pour l'intégration de nouvelles représentations dans l'implémentation.
Resumo:
In a seminal paper, Aitchison and Lauder (1985) introduced classical kernel density estimation techniques in the context of compositional data analysis. Indeed, they gave two options for the choice of the kernel to be used in the kernel estimator. One of these kernels is based on the use the alr transformation on the simplex SD jointly with the normal distribution on RD-1. However, these authors themselves recognized that this method has some deficiencies. A method for overcoming these dificulties based on recent developments for compositional data analysis and multivariate kernel estimation theory, combining the ilr transformation with the use of the normal density with a full bandwidth matrix, was recently proposed in Martín-Fernández, Chacón and Mateu- Figueras (2006). Here we present an extensive simulation study that compares both methods in practice, thus exploring the finite-sample behaviour of both estimators
Resumo:
This article describes an intervention process undertaken in a training program for preschool and first grade teachers from public schools in Cali, Colombia. The objective of this process is to provide a space for teachers to reflect on pedagogical practices which allow them to generate educational processes that foster children’s understanding of mathematical knowledge in the classroom. A set of support strategies was presented for helping teachers in the design, analysis and implementation of learning environments as meaningful educational spaces. Furthermore, participants engaged in an analysis of their own intervention modalities to identify which modalities facilitate the development of mathematical abilities in children. In order to ascertain the transformations in the teachers’ learning environments, the mathematical competences and cognitive processes underlying the activities proposed in the classroom, as well as teacher intervention modalities and the types of student participation in classroom activities were examined both before and after the intervention process. Transformations in the teachers’ conceptions about the children’s abilities and their own practices in teaching mathematics in the classroom were evidenced.
Resumo:
A simple numerical model which calculates the kinetics of crystallization involving randomly distributed nucleation and isotropic growth is presented. The model can be applied to different thermal histories and no restrictions are imposed on the time and the temperature dependences of the nucleation and growth rates. We also develop an algorithm which evaluates the corresponding emerging grain-size distribution. The algorithm is easy to implement and particularly flexible, making it possible to simulate several experimental conditions. Its simplicity and minimal computer requirements allow high accuracy for two- and three-dimensional growth simulations. The algorithm is applied to explore the grain morphology development during isothermal treatments for several nucleation regimes. In particular, thermal nucleation, preexisting nuclei, and the combination of both nucleation mechanisms are analyzed. For the first two cases, the universal grain-size distribution is obtained. The high accuracy of the model is stated from its comparison to analytical predictions. Finally, the validity of the Kolmogorov-Johnson-Mehl-Avrami model SSSR, is verified for all the cases studied
Resumo:
We study the existence of transit we exchange transformations with flips defined on the unit circle S(1). We provide a complete answer to the question of whether there exists a transitive exchange transformation of S(1) defined on a subintervals and having f flips.
Resumo:
The permutability of two Backlund transformations is employed to construct a nonlinear superposition formula and to generate a class of solutions for the N=2 super sine-Gordon model. We present explicitly the one and two soliton solutions.
SZEGO and PARA-ORTHOGONAL POLYNOMIALS on THE REAL LINE: ZEROS and CANONICAL SPECTRAL TRANSFORMATIONS
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The solutions of a large class of hierarchies of zero-curvature equations that includes Toda- and KdV-type hierarchies are investigated. All these hierarchies are constructed from affine (twisted or untwisted) Kac-Moody algebras g. Their common feature is that they have some special vacuum solutions corresponding to Lax operators lying in some Abelian (up to the central term) subalgebra of g; in some interesting cases such subalgebras are of the Heisenberg type. Using the dressing transformation method, the solutions in the orbit of those vacuum solutions are constructed in a uniform way. Then, the generalized tau-functions for those hierarchies are defined as an alternative set of variables corresponding to certain matrix elements evaluated in the integrable highest-weight representations of g. Such definition of tau-functions applies for any level of the representation, and it is independent of its realization (vertex operator or not). The particular important cases of generalized mKdV and KdV hierarchies as well as the Abelian and non-Abelian affine Toda theories are discussed in detail. © 1997 American Institute of Physics.
Resumo:
We study polynomials which satisfy the same recurrence relation as the Szego{double acute} polynomials, however, with the restriction that the (reflection) coefficients in the recurrence are larger than one in modulus. Para-orthogonal polynomials that follow from these Szego{double acute} polynomials are also considered. With positive values for the reflection coefficients, zeros of the Szego{double acute} polynomials, para-orthogonal polynomials and associated quadrature rules are also studied. Finally, again with positive values for the reflection coefficients, interlacing properties of the Szego{double acute} polynomials and polynomials arising from canonical spectral transformations are obtained. © 2012 American Mathematical Society.