Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-05T16:47:02Z No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-09-06T10:49:22Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) / Made available in DSpace on 2017-09-06T10:49:22Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) Previous issue date: 2016-08-17 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The process of teaching and learning of mathematics is closely related to the resolution of theoretical and practical problems, which often involve situations of everyday life in our society. This work aims to present the Inclusion and Exclusion Principle as a tool for solving many problems involving counting elements, especially those that appear double, triple counting, among others. It also seeks to relate it with the determination of prime numbers of a number and the Sieve of Eratosthenes, use it to systematize the Formula of the function Fi ( Phi) Euler, as well as for determining the number of permutations Chaotic and number of Sobrejetoras functions. / O processo de ensino aprendizagem da Matemática está intimamente relacionado com a resolução de problemas teóricos e práticos, os quais geralmente envolvem situações do cotidiano de nossa sociedade. Esse trabalho tem como objetivo apresentar o Princípio da Inclusão e Exclusão como ferramenta para resolução de vá- rios modelos de problemas que envolvem a contagem de elementos, principalmente aquelas que aparecem contagem duplas, triplas, dentre outras. Além disso, busca relacioná-lo com a determinação de números primos de um número e com o Crivo de Eratóstenes, utilizá-lo para sistematizar a Fórmula da Função Fi ( ) de Euler, bem como para a determinação do Número de Permutações Caóticas e do Número de Funções Sobrejetoras.

Submitted by Alisson de Carvalho Reinol null (alissoncarv@gmail.com) on 2017-07-18T15:03:51Z No. of bitstreams: 1 tese_alisson_final.pdf: 6086108 bytes, checksum: 610534618b19a1d27cfff678d44f1a4a (MD5) / Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-07-19T14:22:46Z (GMT) No. of bitstreams: 1 reinol_ac_dr_sjrp.pdf: 6086108 bytes, checksum: 610534618b19a1d27cfff678d44f1a4a (MD5) / Made available in DSpace on 2017-07-19T14:22:46Z (GMT). No. of bitstreams: 1 reinol_ac_dr_sjrp.pdf: 6086108 bytes, checksum: 610534618b19a1d27cfff678d44f1a4a (MD5) Previous issue date: 2017-07-05 / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / Neste trabalho, consideramos aspectos algébricos e dinâmicos de alguns problemas envolvendo superfícies algébricas invariantes em sistemas diferenciais polinomiais definidos em R³. Determinamos o número máximo de planos invariantes que um sistema diferencial quadrático pode ter e estudamos a realização e integrabilidade de tais sistemas. Fornecemos a forma normal para sistemas diferenciais com quádricas invariantes e estudamos de forma mais detalhada a dinâmica e integrabilidade de sistemas diferenciais quadráticos com um paraboloide elíptico como superfície algébrica invariante. Por fim, estudamos as consequências dinâmicas ao se perturbar um sistema diferencial, cujo espaço de fase é folheado por superfícies algébricas invariantes. Para tal, consideramos o sistema diferencial quadrático conhecido como sistema Sprott A, que depende de um parâmetro real a e apresenta comportamento caótico mesmo sem ter pontos de equilíbrio, tendo, assim, um hidden attractor para valores adequados do parâmetro a. Provamos que, para a=0, o espaço de fase desse sistema é folheado por esferas concêntricas invariantes. Utilizando a Teoria do Averaging e o Teorema KAM (Kolmogorov-Arnold-Moser), provamos que, para a>0 suficientemente pequeno, uma órbita periódica orbitalmente estável emerge de um equilíbrio do tipo zero-Hopf não isolado localizado na origem e que formam-se toros invariantes em torno desta órbita periódica. Concluímos que a ocorrência de tais fatos tem um papel importante na formação do hidden attractor. / In this work, we consider algebraic and dynamical aspects of some problems involving invariant algebraic surfaces in polynomial differential systems defined in R³. We determine the maximum number of invariant planes that a quadratic differential system can have and we study the realization and integrability of such systems. We provide the normal form for differential systems having an invariant quadric and we study in more detail the dynamics and integrability of quadratic differential systems having an elliptic paraboloid as invariant algebraic surface. Finally, we study the dynamic consequences of perturbing differential system whose phase space is foliated by invariant algebraic surfaces. For this we consider the quadratic differential system known as Sprott A system, which depends on one real parameter a and presents chaotic behavior even without having any equilibrium point, thus having a hidden attractor for suitable values of parameter a. We prove that, for a=0, the phase space of this system is foliated by invariant concentric spheres. By using the Averaging Theory and the KAM (Kolmogorov-Arnold-Moser) Theorem, we prove that, for a>0 sufficiently small, an orbitally stable periodic orbit emerges from a zero-Hopf nonisolated equilibrium point located at the origin and that invariant tori are formed around this periodic orbit. We conclude that the occurrence of these facts has an important role in the formation of the hidden attractor. / FAPESP: 2013/26602-7

Este trabalho apresenta uma metodologia, baseada no método de Galerkin, para quantificar a incerteza no problema de flexão estocástica da viga de Euler-Bernoulli repousando em fundação de Pasternak. A incerteza nos coeficientes de rigidez da viga e da fundação é representada por meio de processos estocásticos parametrizados. A limitação em probabilidade dos parâmetros randômicos e a escolha adequada do espaço de soluções aproximadas, necessárias à posterior demonstração de unicidade e existência do problema, são consideradas por meio de hipóteses teóricas. O espaço de soluções aproximadas de dimensão finita é construído pelo produto tensorial entre espaços (determinístico e randômico), obtendo-se um espaço denso no espaço das soluções teóricas. O esquema de Wiener-Askey dos polinômios do caos generalizados é utilizado na representação do processo estocástico de deslocamento da viga. O método dos elementos finitos estocásticos é apresentado e empregado na solução numérica de exemplos selecionados. Os resultados, em termos de momentos estatísticos, são comparados aos obtidos por meio de simulações de Monte Carlo. / This study presents a methodology, based on the Galerkin method, to quantify the uncertainty in the stochastic bending problem of an Euler-Bernoulli beam resting on a Pasternak foundation. The uncertainty in the stiffness coefficients of the beam and foundation is represented by parametrized stochastic processes. The probability limitation on the random parameters and the choice of an appropriated approximate solution space, necessary for the subsequent demonstration of uniqueness and existence of the problem, are considered by means of theoretical hypothesis. The finite dimensional space of approximate solutions is built by tensor product between spaces (deterministic and randomic), obtaining a dense space in the theoretical solution space. The Wiener-Askey scheme of generalizes chaos polynomials is used to represent the stochastic process of the beam deflection. The stochastic finite element method is presented and employed in the numerical solution of selected examples. The results, in terms of statistical moments, are compared to results obtained through Monte Carlo simulations.

Un code correcteur d'erreur ajoute de la redondance à un message afin de pouvoir corriger celui-ci lorsque des erreurs se sont introduites pendant la transmission. Les codes convolutifs sont des codes performants, et par conséquent, souvent utilisés. Le principe d'un code convolutif consiste à se fixer une fonction de transfert définie sur le groupe des entiers relatifs et à effectuer la convolution d'un message avec cette fonction de transfert. Ces codes ne protègent pas le message d'une interception par une tierce personne. C'est pourquoi nous proposons dans cette thèse, des codes convolutifs avec des propriétés cryptographiques, définis sur des groupes non-commutatifs. Nous avons tout d'abord étudié les codes définis sur le groupe diédral infini, qui, malgré de bonnes performances, n'ont pas les propriétés cryptographiques recherchées. Nous avons donc étudié ensuite des codes convolutifs en bloc sur des groupes finis, avec un encodage variable dans le temps. Nous avons encodé chaque message sur un sous-ensemble du groupe différent à chaque encodage. Ces sous-ensembles sont générés de façon chaotique à partir d'un état initial, qui est la clé du cryptosystème symétrique induit par le code. Nous avons étudié plusieurs groupes et plusieurs méthodes pour définir ces sous-ensembles chaotiques. Nous avons étudié la distance minimale des codes que nous avons conçus et montré qu'elle est légèrement plus petite que la distance minimale des codes en blocs linéaires. Cependant, nous avons, en plus, un cryptosystème symétrique associé à ces codes. Ces codes convolutifs non-commutatifs sont donc un compromis entre correction d'erreur et sécurité. / An error correcting code adds redundancy to a message in order to correct it when errors occur during transmission.Convolutional codes are powerful ones, and therefore, often used. The principle of a convolutional code is to perform a convolution product between a message and a transfer function, both defined over the group of integers. These codes do not protect the message if it is intercepted by a third party. That is why we propose in this thesis, convolutional codes with cryptographic properties defined over non-commutative groups. We first studied codes over the infinite dihedral group, which despite good performance, do not have the desired cryptographic properties. Consequently, we studied convolutional block codes over finite groups with a time-varying encoding. Every time a message needs to be encoded, the process uses a different subset of the group. These subsets are chaotically generated from an initial state. This initial state is considered as the symmetric key of the code-induced cryptosystem. We studied many groups and many methods to define these chaotic subsets. We examined the minimum distance of the codes we conceived and we showed that it is slightly smaller than the minimum distance of the linear block codes. Nevertheless, our codes have, in addition, cryptographic properties that the others do not have. These non-commutative convolutional codes are then a compromise between error correction and security.

Les travaux présentés dans cette thèse concernent la dynamique d'opérateurs pour des sous-espaces. Nous étudions principalement deux notions de dynamique pour des sous-espaces qui sont la n-supercyclicité et la forte n-supercyclicité. Dans une première partie, nous étudions l'existence de tels opérateurs dans le cadre des espaces de dimension finie et nous exhibons les indices de supercyclicité admissibles pour des espaces réels de dimension finie. Dans une deuxième partie, nous étudions en détail les opérateurs fortement n-supercycliques en exhibant leurs propriétés spectrales et en donnant des caractérisations pour certaines classes d'opérateurs. Nous détaillons ensuite une nouvelle notion de dynamique pour des sous-espaces de codimension finie et nous étudions les propriétés de tels opérateurs, en particulier le lien "dual" avec les opérateurs fortement n-supercycliques. Enfin, nous terminons avec une caractérisation des opérateurs chaotiques sur certains types d'espaces de suites sans base inconditionnelle, un critère de supercyclicité pour des opérateurs non-bornés et une condition suffisante pour obtenir un opérateur multiple mélangeant de tout degré. / This dissertation deals with some recent notions of linear dynamics of subspaces. In the first part, we provide a detailed study of n-supercyclicity and strong n-supercyclicicty in the finite dimensional setting. In particular we give a characterisation of the indices for which there exist n-supercyclic operators. We focus then on spectral properties of strongly n-supercyclic operators and on general properties as well. We also provide examples of operators whose supercyclic and strongly n-supercyclic behaviour are different. We introduce a new class of operators dealing with orbits of subspaces of finite codimension and we exhibit a \dual\ link with strong n-supercyclicity. Independently of these results, we give a characterisation of chaotic weighted shifts on a class of sequence spaces not necessarily admitting an unconditional basis. We conclude with a study of supercyclicity for unbounded operators and a sufficient condition to obtain multiple mixing operators.

L’objectif de cette thèse était de développer une méthode de synthèse de commande par retour d’état puis par observateurs offrant des conditions de synthèse non contraignantes dans le cas de systèmes non linéaires à temps discret. Dans cette méthode, est mise en exergue l’importance du choix de la description des systèmes sur l’étendue des résultats pouvant être obtenus lorsque la méthode d’étude de la stabilité est fixée. Ainsi l’utilisation des normes vectorielles comme fonction d’agrégation et du critère pratique de Borne et Gentina pour l’étude de la stabilité, associée à la description des systèmes par des matrices caractéristiques de forme en flèche de Benrejeb, a conduit à l’élaboration de nouvelles conditions suffisantes de stabilisation de systèmes dynamiques discrets non linéaires, formulées en théorèmes et corollaires. Ces résultats obtenus, sont ensuite exploités, avec succès, pour la formulation de nouvelles conditions suffisantes de vérification des propriétés de synchronisation pour les systèmes hyperchaotiques à temps discrets. Ensuite, le cas de synthèse d’observateur est validé dans deux types de transmission chaotique / The objective of this thesis was to develop a method for synthesizing control state feedback and observers by offering soft synthesis conditions in the case of nonlinear discrete-time systems. In this method, is highlighting the importance of choosing the systems description of the scope of what can be achieved when the stability study method is fixed. The use of of vector norms as an aggregation function and the practical Borne-Gentina criterion for stability study, associated to arrow form matrix of Benrejeb for system discription, lead to the development of new sufficient conditions for stabilization of nonlinear discrete dynamical systems, formulated as theorems and corollaries. These results are then used, with success, for the formulation of new sufficient conditions for checking properties of hyperchaotiques synchronization for discrete-time systems. Then, the synthesis of observer is validated in two types of chaotic transmission

La protection de l’image médicale numérique comporte au moins deux aspects principaux: la sécurité et l’authenticité. Afin d’assurer la sécurité, l’information doit être protégée vis-à-vis des utilisateurs non autorisés. L’authenticité permet quant à elle de s’assurer que la donnée reçue n’est pas modifiée, n’est pas altérée, et qu’elle est bien envoyée par l’expéditeur supposé. La « technique » cryptographique garantit la sécurité en faisant l’hypothèse que l’expéditeur et le destinataire ont des clés permettant respectivement de crypter et de décrypter le message. De cette manière, seule la personne possédant la bonne clé peut décrypter le message et accéder au contenu de la donnée médicale. Dans cette thèse, nous avons apporté plusieurs contributions. La principale contribution est la proposition de solutions de tatouage d'images médicales robustes et réversibles dans le domaine spatial basées respectivement sur l’analyse de concepts formels (FCA) et le diagramme de décision binaire par suppression des zéros (ZBDD). La seconde est une approche de tatouage d’image médicale semi-aveugle pour la détection de modifications malveillantes. Une autre contribution est la proposition d'un système de chiffrement symétrique sécurisé basé sur les N-grams. La dernière contribution est un système hybride de tatouage et de cryptographie d’image médicale qui s’appuie sur une nouvelle forme de carte chaotique (chaotic map) pour générer des clés ayant des propriétés spécifiques, et qui permet d'obtenir une meilleure efficacité, une grande robustesse et une faible complexité par rapport aux approches existantes. / The protection of digital medical image comprises at least two main aspects: security and authentication. In order to ensure the security, the information has to be protected from the unauthorized users while the authentication confirms that the received data is not affected or modified and is sent by the intended sender (watermarking). The cryptography technique proves the security issues by assuming the intended sender and intended receiver have some security aspects called keys. So, after encryption of the digital material from the sender side, the person who has the key (receiver) can decrypt and access the content of the digital material. In this thesis, we have brought several contributions. The main one is the provision of robust and reversible medical image watermarking solutions in the spatial domain based respectively on FCA and ZBDD. The second one is a semi-blind medical image watermarking approach for the tamper detection. Another contribution is the proposal of a secure symmetric encryption system based on N-gram. The last contribution is a hybrid watermarking and cryptography medical image system which focuses on a new form of chaotic map to generate keys with specific properties, and achieves better efficiency, high robustness and low complexity than the existing approaches.

In this thesis we study a variety of problems in superfluid turbulence, princi-pally in two dimensions. A summary of the main results of our studies is given below; we indicate the Chapters in which we present these. In Chapter 1, we provide an overview of several problems in superfluid turbulence with special emphasis on background material for the problems we study in this thesis. In particular, we give: (a) a brief introduction of fluid turbulence; (b) an overview of superfluidity and the phenomenological two-fluid model; (c) a brief overview of experiments on superfluid turbulence; (d) an introductory accounts of the phenomenological models used in the study of superfluid turbulence. We end with a summary of the problems we study in subsequent Chapters of this thesis. In Chapter 2, we present a systematic, direct numerical simulation of the two-dimensional, Fourier-truncated, Gross-Pitaevskii equation to study the turbulent evolutions of its solutions for a variety of initial conditions and a wide range of parameters. We find that the time evolution of this system can be classified into four regimes with qualitatively different statistical properties. First, there are transients that depend on the initial conditions. In the second regime, power- law scaling regions, in the energy and the occupation-number spectra, appear and start to develop; the exponents of these power laws and the extents of the scaling regions change with time and depend on the initial condition. In the third regime, the spectra drop rapidly for modes with wave numbers k > kc and partial thermalization takes place for modes with k < kc ; the self-truncation wave number kc(t) depends on the initial conditions and it grows either as a power of t or as log t. Finally, in the fourth regime, complete thermalization is achieved and, if we account for finite-size effects carefully, correlation functions and spectra are consistent with their nontrivial Berezinskii-Kosterlitz-Thouless forms. Our work is a natural generalization of recent studies of thermalization in the Euler and other hydrodynamical equations; it combines ideas from fluid dynamics and turbulence, on the one hand, and equilibrium and nonequilibrium statistical mechanics on the other. In Chapter 3, we present the first calculation of the mutual-friction coefficients α and α (which are parameters in the Hall-Vinen-Bekharevich-Khalatnikov two-fluid model that we study in chapter 5) as a function of temperature in a homogeneous Bose gas in two-dimensions by using the Galerkin-truncated Gross-Pitaevskii equation, with very special initial conditions, which we obtain by using the advective, real, Ginzburg-Landau equation (ARGLE) and an equilibration procedure that uses a stochastic Ginzburg-Landau equation (SGLE). We also calculate the normal-fluid density as a function of temperature. In Chapter 4, we elucidate the interplay of particles and fields in superfluids, in both simple and turbulent flows. We carry out extensive direct numerical simulations (DNSs) of this interplay for the two-dimensional (2D) Gross-Pitaevskii (GP) equation. We obtain the following results: (1) the motion of a particle can be chaotic even if the superfluid shows no sign of turbulence; (2) vortex motion depends sensitively on particle charateristics; (3) there is an effective, superfluid-mediated, attractive interaction between particles; (4) we introduce a short-range repulsion between particles, with range rSR, and study two- and many-particle collisions; in the case of two-particle, head-on collisions, we find that, at low values of rSR, the particle collisions are inelastic with coefficient of restitution e = 0; and, as we in-crease rSR, e becomes nonzero at a critical point, and finally attains values close to 1; (5) assemblies of particles and vortices show rich, turbulent, spatio-temporal evolution. In Chapter 5, we present results from our direct numerical simulations (DNSs) of the Hall-Vinen-Bekharevich-Khalatnikov (HVBK) two-fluid model in two dimensions. We have designed these DNSs to study the statistical properties of inverse and forward cascades in the HVBK model. We obtain several interesting results that have not been anticipated hitherto: (1) Both normal-fluid and superfluid energy spectra, En(k) and Es(k), respectively, show inverse- and forward-cascade regimes; the former is characterized by a power law Es(k) En(k) kα whose exponent is consistent with α 5/3. (2) The forward-cascade power law depends on (a) the friction coefficient, as in 2D fluid turbulence, and, in addition, on (b) the coefficient B of mutual friction, which couples normal and superfluid compo-nents. (3) As B increases, the normal and superfluid velocities, un and us, re-spectively, get locked to each other, and, therefore, Es(k) En(k), especially in the inverse-cascade regime. (4) We quantify this locking tendency by calculating the probability distribution functions (PDFs) P(cos(θ)) and P(γ), where the angle θ ≡ (un • us)/( |un||us|) and the amplitude ratio γ = |un|/|us |; the former has a peak at cos(θ) = 1; and the latter exhibits a peak at γ = 1 and power-law tails on both sides of this peak. (4) This locking increases as we increase B, but the power-law exponents for the tails of P(γ) are universal, in so far as they do not depend on B, ρn/ρ, and the details of the energy-injection method. (5) We characterize the energy and enstrophy cascades by computing the energy and enstrophy fluxes and the mutual-friction transfer functions for all wave-number scales k. In Chapter 6, we examine the multiscaling of structure functions in three-dimensional superfluid turbulence by using a shell-model for the three-dimensional HVBK equations. Our HVBK shell model is based on the GOY shell model. In particular, we examine the dependence of multiscaling on the normal-fluid fraction and the mutual-friction coefficients. We hope our in silico studies of 2D and 3D superfluid turbulence will stimulate new experimental, numerical, and theoretical studies.

This thesis is divided into three parts. In the first part we study mixed norm estimates for Riesz transforms associated with various differential operators. First we prove the mixed norm estimates for the Riesz transforms associated with Dunkl harmonic oscillator by means of vector valued inequalities for sequences of operators defined in terms of Laguerre function expansions. In certain cases, the result can be deduced from the corresponding result for Hermite Riesz transforms, for which we give a simple and an independent proof. The mixed norm estimates for Riesz transforms associated with other operators, namely the sub-Laplacian on Heisenberg group, special Hermite operator on C^d and Laplace-Beltrami operator on the group SU(2) are obtained using their L^pestimates and by making use of a lemma of Herz and Riviere along with an idea of Rubio de Francia. Applying these results to functions expanded in terms of spherical harmonics, we deduce certain vector valued inequalities for sequences of operators defined in terms of radial parts of the corresponding operators. In the second part, we study the chaotic behavior of the heat semigroup generated by the Dunkl-Laplacian ∆_κ on weighted L^P-spaces. In the general case, for the chaotic behavior of the Dunkl-heat semigroup on weighted L^p-spaces, we only have partial results, but in the case of the heat semigroup generated by the standard Laplacian, a complete picture of the chaotic behavior is obtained on the spaces L^p ( R^d,〖 (φ_iρ (x ))〗^2 dx) where φ_iρ the Euclidean spherical function is. The behavior is very similar to the case of the Laplace-Beltrami operator on non-compact Riemannian symmetric spaces studied by Pramanik and Sarkar. In the last part, we study mixed norm estimates for the Cesáro means associated with Dunkl-Hermite expansions on〖 R〗^d. These expansions arise when one considers the Dunkl-Hermite operator (or Dunkl harmonic oscillator)〖 H〗_κ:=-Δ_κ+|x|^2. It is shown that the desired mixed norm estimates are equivalent to vector-valued inequalities for a sequence of Cesáro means for Laguerre expansions with shifted parameter. In order to obtain the latter, we develop an argument to extend these operators for complex values of the parameters involved and apply a version of Three Lines Lemma.

This thesis focuses on possibility of chaotic (specially economic) time-series prediction. Chaotic time-series are unpredictable in long-term due to their high sensitivity on initial conditions. Nevertheless, their behavior should be more or less predictable in short-term. Goal of this thesis is to show, how much and if any prediction, is possible by non-linear prediction method, and try to reveal or to reject presence of chaotic behavior in them. Work is split into three chapters. Chapter One briefly introduces chosen important concepts and methods from this area. In addition, to describe some prediction methods, there are outlined which indicators and methods are possible to use in order to find possibilities and boundaries of this prediction. Chapter Two is focused on modifications of FracLab software, which is used for create this prediction. Last chapter is experimental. Besides the description of examined time-series and methods, it includes discussion of results.