No description available.

The work presented here is part of an ongoing effort to develop a highly accurate and numerically efficient turbulence simulation technique. The paper consists of four main parts, viz., the general discussion of the procedure known as Additive Turbulent Decomposition, the derivation of the "synthetic velocity" subgrid-scale model of the high wavenumber turbulent fluctuations necessary for its implementation, the numerical investigation of this model and a priori tests of said models physical validity. Through these investigations we have demonstrated that this procedure, coupled with the use of the "Poor Mans Navier-Stokes" equation subgrid-scale model, has the potential to be a faster, more accurate replacement of currently popular turbulence simulation techniques since: 1. The procedure is consistent with the direct solution of the Navier-Stokes equations if the subgrid-scale model is valid, i.e, the equations to be solved are never filtered, only solutions. 2. Model parameter values are "set" by their relationships to N.S. physics found from their derivation from the N.S. equation and can be calculated "on the fly" with the use of a local high-pass filtering of grid-scale results. 3. Preliminary studies of the PMNS equation model herein have shown it to be a computationally inexpensive and a priori valid model in its ability to reproduce high wavenumber fluctuations seen in an experimental turbulent flow.

In this research,we study iterations of non-pleasantly ramified polynomials over fields of positive characteristic and subsequently, their lower ramification numbers. Of particular interest for this thesis are polynomials for which both the multiplicity and  the degree of its iterates grow exponentially. Specifically we consider the family  of polynomials such that given a positive integer k the family is given by P(z) = z(1 + z (3^k-1)/2 + z3^k-1). The cubic polynomial z + z2 + z3 is a special case of this family and is particularly interesting.

On s’intéresse à la dynamique dans un voisinage d’un point fixe d’une fonction antiholomorphe d’une variable. Dans un premier temps, on cherche à décrire et à comprendre l’espace des orbites dans un voisinage d’un point fixe multiple, appelé point parabolique, et à explorer les propriétés géométriques préservées par les changements de coordonnée. En particulier, on résout le problème de classification analytique des points paraboliques. Résoudre ce problème consiste à définir un module de classification complet qui permet de déterminer si deux germes de difféomorphismes antiholomorphes sont analytiquement conjugués dans un voisinage de leur point fixe parabolique. On examine également les applications du module à différents problèmes : i) extraction d’une racine n-ième antiholomorphe, ii) existence d’une courbe analytique invariante sous la dynamique d’un germe antiholomorphe parabolique et iii) centralisateur d’un germe antiholomorphe parabolique. Dans un second temps, on étudie les déploiements génériques d’un point fixe double, soit un point parabolique de codimension 1. Les questions sont de nature similaire, à savoir comprendre l’espace des orbites et les propriétés géométriques des déploiements. Afin de classifier les déploiements génériques, on déploie le module de classification pour les points paraboliques, ce qui permet d’obtenir des conditions nécessaires et suffisantes pour déterminer lorsque deux déploiements génériques sont équivalents. / We are interested in the dynamics in a neighbourhood of a fixed point of an antiholomorphic function of one variable. First, we want to describe and understand the space of orbits in a neighbourhood of a multiple fixed point, called a parabolic point, and to explore the geometric properties preserved by changes of coordinate. In particular, we solve the problem of analytical classification of parabolic fixed points. To solve this problem, we define a complete modulus of classification that allows to determine whether two germs of antiholomorphic diffeomorphisms are analytically conjugate in a neighbourhood of their parabolic fixed point. We also consider the applications of the modulus to different problems: i) extraction of an n-th antiholomorphic root, ii) existence of an invariant real analytical curve under the dynamics of a parabolic antiholomorphic germ, and iii) centraliser of a parabolic antiholomorphic germ. In the second part, we study generic unfoldings of a double fixed point, i.e. a parabolic point of codimension 1. The questions are similar in nature, namely to understand the space of orbits and the geometric properties of unfoldings. In order to classify generic unfoldings, the modulus of classification of the parabolic point is unfolded, thus providing the necessary and sufficient conditions to determine when two generic unfoldings are equivalent.

La sécurité et la cryptographie sont des éléments clés pour les dispositifs soumis à des contraintes comme l’IOT, Carte à Puce, Systèm Embarqué, etc. Leur implémentation matérielle constitue un défi en termes de limitation en ressources physiques, vitesse de fonctionnement, capacité de mémoire, etc. Dans ce contexte, comme la plupart des protocoles s’appuient sur la sécurité d’un bon générateur de nombres aléatoires, considéré comme un élément indispensable dans le noyau de sécurité. Par conséquent, le présent travail propose des nouveaux générateurs pseudo-aléatoires basés sur des itérations chaotiques, et conçus pour être déployés sur des supports matériels, à savoir sur du FPGA ou du ASIC. Ces implémentations matérielles peuvent être décrites comme des post-traitements sur des générateurs existants. Elles transforment donc une suite de nombres non-uniformes en une autre suite de nombres uniformes. La dépendance entre l’entrée et la sortie a été prouvée chaotique selon les définitions mathématiques du chaos fournies notamment par Devaney et Li-Yorke. Suite à cela, nous effectuant tout d’abord un état de l’art complet sur les mises en œuvre matérielles et physiques des générateurs de nombres pseudo-aléatoires (PRNG, pour pseudorandom number generators). Nous proposons ensuite de nouveaux générateurs à base d’itérations chaotiques (IC) qui seront testés sur notre plate-forme matérielle. L’idée de départ était de partir du n-cube (ou, de manière équivalente, de la négation vectorielle dans les IC), puis d’enlever un cycle Hamiltonien suffisamment équilibré pour produire de nouvelles fonctions à itérer, à laquelle s’ajoute une permutation en sortie. Les méthodes préconisées pour trouver de bonnes fonctions serons détaillées, et le tout sera implanté sur notre plate-forme FPGA. Les générateurs obtenus disposent généralement d’un meilleur profil statistique que leur entrée, tout en fonctionnant à une grande vitesse. Finalement, nous les implémenterons sur de nombreux supports matériels (65-nm ASIC circuit and Zynq FPGA platform). / Security and cryptography are key elements in constrained devices such as IoT, smart card, embedded system, etc. Their hardware implementations represent a challenge in terms of limitations in physical resources, operating speed, memory capacity, etc. In this context, as most protocols rely on the security of a good random number generator, considered an indispensable element in lightweight security core. Therefore, this work proposes new pseudo-random generators based on chaotic iterations, and designed to be deployed on hardware support, namely FPGA or ASIC. These hardware implementations can be described as post-processing on existing generators. They transform a sequence of numbers not uniform into another sequence of numbers uniform. The dependency between input and output has been proven chaotic, according notably to the mathematical definitions of chaos provided by Devaney and Li-Yorke. Following that, we firstly elaborate or develop out a complete state of the art of the material and physical implementations of pseudo-random number generators (PRNG, for pseudorandom number generators). We then propose new generators based on chaotic iterations (IC) which will be tested on our hardware platform. The initial idea was to start from the n-cube (or, in an equivalent way, the vectorial negation in CIs), then remove a Hamiltonian cycle balanced enough to produce new functions to be iterated, for which is added permutation on output . The methods recommended to find good functions, will be detailed, and the whole will be implemented on our FPGA platform. The resulting generators generally have a better statistical profiles than its inputs, while operating at a high speed. Finally, we will implement them on many hardware support (65-nm ASIC circuit and Zynq FPGA platform).

Made available in DSpace on 2016-03-15T19:37:42Z (GMT). No. of bitstreams: 1 Eurico Luiz Prospero Ruivo.pdf: 15234351 bytes, checksum: 5a581041d50f5cbd30ccc684b8112487 (MD5) Previous issue date: 2012-12-11 / Universidade Presbiteriana Mackenzie / The Fourier spectra of cellular automata rules give a characterisation of the limit configurations generated by them at the end of their time evolution. In the present work, the Fourier spectra of each rule of the elementary cellular automata rule space are computed, under periodic and non-periodic boundary conditions, and the space is then partitioned according to the similarity among these computed spectra, what gives the notion of spectral classes in such space. For the partition obtained under periodic boundary condition, each spectral class is analysed in terms of the behaviour of each of its rules and how this behaviour affects the correspondent spectrum. Finally, the spectral classes are related in terms of the similarity among them, for both boundary conditions, what results in graphs depicting the proximity among the spectral classes. / Os espectros de Fourier de regras de autômatos celulares fornecem uma caracterização da configuração limite gerada por elas ao fim de suas evoluções temporais. Neste trabalho, são calculados os espectros de Fourier de todas as regras do espaço dos autômatos celulares elementares, sob condições de contorno periódica e não-periódicas, e o espaço é então particionado de acordo com a similaridade entre os espectros calculados, dando origem à noção de classes espectrais no espaço em questão. Para a participação gerada sob condição de contorno periódica, cada classe espectral é analisada de acordo com o comportamento de cada regra e a implicação deste no espectro obtido. A seguir é analisada a relação de similaridade entre as classes espectrais geradas em cada tipo de condição de contorno, o que d´a origem a grafos representando a proximidade entre as classes espectrais.

Este trabalho é em parte baseado no livro The Stability and Control of Discrete Processes de Joseph P. LaSalle. Nós estudamos equações como x(n+1) = T(x(n)), onde T : \' R POT. m\' \' SETA\' \'R POT. m\' é uma aplicação contínua, com o sistema dinâmico associado \'PI\' (n,x) := \' T POT. n\' (x). Nós fornecemos condições suficientes para a estabilidade de equilíbrios usando o método direto de Liapunov. Também consideramos sistemas discretos da forma x(n+1)=T(n, x(n),\'lâmbda\' ) dependendo de uma parâmetro \' lâmbda\' e apresentamos resultados obtendo estimativas de atratores. Finalmente, nós apresentamos algumas simulações de sistemas acoplados como uma aplicação em sistemas de comunicação / This work is in part based on the book The Stability and Control of Discrete Processes of Joseph P. LaSalle. We studing equations as x(n+1) = T(x(n)), where T : \' R POT.m\' \' ARROW\' \' \' R POT.m\' is continuous transformation, with the associated dynamic system \'PI\' (n,x) := \' T POT.n\' (x). We provide suddicient conditions for stability of equilibria, using Liapunov direct method. We also consider nonautonomous discrete systems of the form x(n + 1) = T(n, x(n), \' lâmbda\') depending on the parameter \'lâmbda\' and present results obtaining uniform estimatives of attractors. We finally we present some simulations on synchronization of coupled systems as an application on communication systems

Este trabalho é em parte baseado no livro The Stability and Control of Discrete Processes de Joseph P. LaSalle. Nós estudamos equações como x(n+1) = T(x(n)), onde T : \' R POT. m\' \' SETA\' \'R POT. m\' é uma aplicação contínua, com o sistema dinâmico associado \'PI\' (n,x) := \' T POT. n\' (x). Nós fornecemos condições suficientes para a estabilidade de equilíbrios usando o método direto de Liapunov. Também consideramos sistemas discretos da forma x(n+1)=T(n, x(n),\'lâmbda\' ) dependendo de uma parâmetro \' lâmbda\' e apresentamos resultados obtendo estimativas de atratores. Finalmente, nós apresentamos algumas simulações de sistemas acoplados como uma aplicação em sistemas de comunicação / This work is in part based on the book The Stability and Control of Discrete Processes of Joseph P. LaSalle. We studing equations as x(n+1) = T(x(n)), where T : \' R POT.m\' \' ARROW\' \' \' R POT.m\' is continuous transformation, with the associated dynamic system \'PI\' (n,x) := \' T POT.n\' (x). We provide suddicient conditions for stability of equilibria, using Liapunov direct method. We also consider nonautonomous discrete systems of the form x(n + 1) = T(n, x(n), \' lâmbda\') depending on the parameter \'lâmbda\' and present results obtaining uniform estimatives of attractors. We finally we present some simulations on synchronization of coupled systems as an application on communication systems