Spelling suggestions: "subject:"chaotic lemsystems"" "subject:"chaotic atemsystems""
1 |
Boundary conditions for torus maps and spectral statisticsMezzadri, Francesco January 1999 (has links)
No description available.
|
2 |
Ray stretching statistics, hot spot formation, and universalities in weak random disorderJanuary 2018 (has links)
acase@tulane.edu / I review my three papers on ray stretching statistics, hot spot formation, and universality in motion through weak random media.
In the first paper, we study the connection between stretching exponents and ray densities in weak ray scattering through a random medium. The stretching exponent is a quantitative measure that describes the degree of exponential convergence or divergence among nearby ray trajectories. In the context of non-relativistic particle motion through a correlated random potential, we show how particle densities are strongly related to the stretching exponents, where the `hot spots' in the intensity profile correspond to minima in the stretching exponents. This strong connection is expected to be valid for different random potential distributions, and is also expected to apply to other physical contexts, such as deep ocean waves. The surprising minimum in the average stretching exponent is of great interest due to the associated appearance of the first generation of hot spots, and a detailed discussion will be found in the third paper.
In the second paper, we study the stretching statistics of weak ray scattering in various physical contexts and for different types of correlated disorder. The stretching exponent is mathematically linked to the monodromy matrix that evolves the phase space vector over time. From this point of view, we demonstrate analytically and numerically that the stretching statistics along the forward direction follow universal scaling relationships for different dispersion relations and in disorders of differing correlation structures. Predictions about the location of first caustics can be made using the universal evolution pattern of stretching exponents. Furthermore, we observe that the distribution of stretching exponents in 2D ray dynamics with small angular spread is equivalent to the same distribution in a simple 1D kicked model, which allows us to further explore the relation between stretching statistics and the form of the disorder.
Finally, the third paper focuses on the 1D kicked model with stretching statistics that resemble 2D small-angle ray scattering. While the long time behavior of the stretching exponent displays a simple linear growth, the behavior on the scale of the Lyapunov time is mathematically nontrivial. From an analysis of the evolving monodromy matrices, we demonstrate how the stretching exponent depends on the statistics of the second derivative of the random disorder, especially the mean and standard deviation. Furthermore, the maximal Lyapunov exponent or the Lyapunov length can be expressed as nontrivial functions of the mean and standard deviation of the kicks. Lastly, we show that the higher moments of the second derivative of the disorder have small or negligible effect on the evolution of the stretching exponents or the maximal Lyapunov exponents. / 1 / SicongChen
|
3 |
Forecasting Global Temperature Variations by Neural NetworksMiyano, Takaya, Girosi, Federico 01 August 1994 (has links)
Global temperature variations between 1861 and 1984 are forecast usingsregularization networks, multilayer perceptrons and linearsautoregression. The regularization network, optimized by stochasticsgradient descent associated with colored noise, gives the bestsforecasts. For all the models, prediction errors noticeably increasesafter 1965. These results are consistent with the hypothesis that thesclimate dynamics is characterized by low-dimensional chaos and thatsthe it may have changed at some point after 1965, which is alsosconsistent with the recent idea of climate change.s
|
4 |
Eigenfunction construction by classical periodic orbitsJan, Ing-Chieh 11 February 2015 (has links)
In this dissertation, we devise a quantization scheme to construct eigenfunctions by classical periodic orbits in both regular systems as well as chaotic systems. Our method is based on the principle that eigenfunctions can be resolved from a time-dependent wavefunction. This is different from the classical (or EBK) quantization scheme that constructs eigenfunction in the energy-domain. The advantage of our method is that it can be applied to more varieties of systems, including some chaotic systems. Three systems, the simple harmonic oscillator, the x⁴-potential oscillator, and the x²y² quartic-oscillator, are used as examples for our eigenfunction construction. The key to the constructions is a family (or families) of periodic orbits with a newly defined quantization rule, the resolving quantization rule. The eigenspectrum for the x⁴-potential oscillator is also computed. Furthermore, the classical Green's function is used to explain the relation between the resolving quantization rule and the classical quantization rule. This dissertation begins with an introduction in Chapter 1. The semiclassical theory for the eigenfunction construction by periodic orbits is developed in Chapter 2. In Chapter 3 and Chapter 4, eigenfunctions are constructed for the simple harmonic oscillator, the x⁴-potential oscillator, and the x²y² quartic-oscillator. The eigenspectrum for the x⁴-potential oscillator is computed in Chapter 5. Chapter 6 is devoted to discussions including the interpretation of the resolving quantization rule from the classical Green's function, the interpretation of the photoabsorption spectrum for a Rydberg atom in a magnetic field, and the comparison of our method with the EBK quantization scheme. Conclusions are made in Chapter 7. / text
|
5 |
Ανάλυση και πρόβλεψη χαοτικών χρονοσειρών με μεθόδους της μη γραμμικής δυναμικήςΠαπαϊωάννου, Γεώργιος 11 September 2009 (has links)
- / -
|
6 |
Κανονική και χαοτική δυναμική χαμιλτονιανών συστημάτων πολλών βαθμών ελευθερίαςΜάνος, Αθανάσιος Ε. 26 August 2010 (has links)
- / -
|
7 |
Deep Multi-Resolution Operator Networks (DMON): Exploring Novel Data-Driven Strategies for Chaotic Inverse ProblemsDonald, Sam Alexander Knowles 11 January 2024 (has links)
Inverse problems, foundational in applied sciences, involve deducing system inputs from specific output observations. These problems find applications in diverse domains such as aerospace engineering, weather prediction, and oceanography. However, their solution often requires complex numerical simulations and substantial computational resources. Modern machine learning based approaches have emerged as an alternative and flexible methodology for solving these types of problems, however their generalization power often comes at the cost of working with large descriptive datasets, a requirement that many applications cannot afford. This thesis proposes and explores the novel Deep Multi-resolution Operator Network (DMON), inspired by the recently developed DeepONet architecture. The DMON model is designed to solve inverse problems related to chaotic non-linear systems with low-resolution data through intelligently utilizing high-resolution data from a similar system. Performance of the DMON model and the proposed selection mechanisms are evaluated on two chaotic systems, a double pendulum and turbulent flow around a cylinder, with improvements observed under idealized scenarios whereby high and low-resolution inputs are manually paired, along with minor improvements when this pairing is conducted through the proposed the latent space comparison selection mechanism. / Master of Science / In everyday life, we often encounter the challenge of determining the cause behind something we observe. For instance, meteorologists infer weather patterns based on limited atmospheric data, while doctors use X-rays and CT scans to reconstruct images representing the insides of our bodies. Solving these so called ``inverse problems'' can be difficult, particularly when the process is chaotic such as the weather, whereby small changes result in much larger ones over time. In this thesis, we propose a novel method using artificial intelligence and high-resolution simulation data to aid in solving these types of problems. Our proposed method is designed to work well even when we only have access to a small amount of information, or the information available isn't very detailed. Because of this there are potential applications of the proposed method across a wide range of fields, particularly those where acquiring detailed information is difficult, expensive, or impossible.
|
8 |
High-security image encryption based on a novel simple fractional-order memristive chaotic system with a single unstable equilibrium pointRahman, Z.S.A., Jasim, B.H., Al-Yasir, Yasir I.A., Abd-Alhameed, Raed 14 January 2022 (has links)
Yes / Fractional-order chaotic systems have more complex dynamics than integer-order chaotic systems. Thus, investigating fractional chaotic systems for the creation of image cryptosystems has been popular recently. In this article, a fractional-order memristor has been developed, tested, numerically analyzed, electronically realized, and digitally implemented. Consequently, a novel simple three-dimensional (3D) fractional-order memristive chaotic system with a single unstable equilibrium point is proposed based on this memristor. This fractional-order memristor is connected in parallel with a parallel capacitor and inductor for constructing the novel fractional-order memristive chaotic system. The system’s nonlinear dynamic characteristics have been studied both analytically and numerically. To demonstrate the chaos behavior in this new system, various methods such as equilibrium points, phase portraits of chaotic attractor, bifurcation diagrams, and Lyapunov exponent are investigated. Furthermore, the proposed fractional-order memristive chaotic system was implemented using a microcontroller (Arduino Due) to demonstrate its digital applicability in real-world applications. Then, in the application field of these systems, based on the chaotic behavior of the memristive model, an encryption approach is applied for grayscale original image encryption. To increase the encryption algorithm pirate anti-attack robustness, every pixel value is included in the secret key. The state variable’s initial conditions, the parameters, and the fractional-order derivative values of the memristive chaotic system are used for contracting the keyspace of that applied cryptosystem. In order to prove the security strength of the employed encryption approach, the cryptanalysis metric tests are shown in detail through histogram analysis, keyspace analysis, key sensitivity, correlation coefficients, entropy analysis, time efficiency analysis, and comparisons with the same fieldwork. Finally, images with different sizes have been encrypted and decrypted, in order to verify the capability of the employed encryption approach for encrypting different sizes of images. The common cryptanalysis metrics values are obtained as keyspace = 2648, NPCR = 0.99866, UACI = 0.49963, H(s) = 7.9993, and time efficiency = 0.3 s. The obtained numerical simulation results and the security metrics investigations demonstrate the accuracy, high-level security, and time efficiency of the used cryptosystem which exhibits high robustness against different types of pirate attacks.
|
9 |
A new fractional-order chaotic system with its analysis, synchronization, and circuit realization for secure communication applicationsRahman, Z.S.A., Jasim, B.H., Al-Yasir, Yasir I.A., Hu, Yim Fun, Abd-Alhameed, Raed, Alhasnawi, B.N. 12 November 2021 (has links)
Yes / This article presents a novel four-dimensional autonomous fractional-order chaotic system (FOCS) with multi-nonlinearity terms. Several dynamics, such as the chaotic attractors, equilibrium points, fractal dimension, Lyapunov exponent, and bifurcation diagrams of this new FOCS, are studied analytically and numerically. Adaptive control laws are derived based on Lyapunov theory to achieve chaos synchronization between two identical new FOCSs with an uncertain parameter. For these two identical FOCSs, one represents the master and the other is the slave. The uncertain parameter in the slave side was estimated corresponding to the equivalent master parameter. Next, this FOCS and its synchronization were realized by a feasible electronic circuit and tested using Multisim software. In addition, a microcontroller (Arduino Due) was used to implement the sug-gested system and the developed synchronization technique to demonstrate its digital applicability in real-world applications. Furthermore, based on the developed synchronization mechanism, a secure communication scheme was constructed. Finally, the security analysis metric tests were investigated through histograms and spectrograms analysis to confirm the security strength of the employed communication system. Numerical simulations demonstrate the validity and possibility of using this new FOCS in high-level security communication systems. Furthermore, the secure communication system is highly resistant to pirate attacks. A good agreement between simulation and experimental results is obtained, showing that the new FOCS can be used in real-world applications.
|
10 |
Méthodes de chiffrement/déchiffrement utilisant des systèmes chaotiques : Analyse basée sur des méthodes statistiques et sur la théorie du contrôle des systèmes. / Encryption/decryption methods using chaotic systems. : Analysis based on statistical methods and control system theory.Datcu, Octaviana 17 October 2012 (has links)
Cette thèse traite du domaine de la cryptographie basée sur des dynamiques chaotiques hybrides.Afin de robustifier la transmission sécurisée de données à l'égard de l'attaque à texte-claire connue, ce travail a été particulièrement axée sur deux directions, l'approche statistique, et l'approche automatique.Les principales contributions de ce travail sont organisées dans ces deux directions.Le choix de la variable mesurée et son influence sur l'émetteur d'un message secret et la possibilité de récupérer la dynamique à la réception.Ceci a été étudié dans le contexte des systèmes chaotiques discrets et continus.L'indépendance statistique des variables d'état des systèmes chaotiques est étudié en relation avec la non-corrélation spatiale de ces états.Ainsi une méthode pour cacher le message secret en fonction de l'évolution de l'émetteur chaotique, et ceci avant son inclusion dans cette dynamique, est proposée.La faisabilité d'un système retardée hybride qui est utilisée pour la transmission sécurisée des données est analysée dans une mise en œuvre analogique.Des simulations et les analyses des résultats obtenus sont faits, afin de prouver l'efficacité des études et des méthodes proposées.La thèse est organisée comme suit: le Chapitre I reprend les notions théoriques et les algorithmes utilisés pour atteindre l'objectif de ce travail.Le chapitre II est consacré à l'étude des exposants de Lyapunov.Les systèmes chaotiques utilisés dans le présent document sont ensuite décrits.Le chapitre III présente une étude de certaines propriétés structurales des systèmes du chapitre II.L'étude se concentre sur le calcul des indices d'observabilité et la détermination des hypersurfaces de la singularité d'observabilité.Le chapitre IV analyse l'indépendance statistique dans le contexte des systèmes chaotiques considérés:la taille de la distance d'échantillonnage (combien d'itérations ou de manière équivalente, combien de temps) pour assurer l'indépendance statistique entre les variables extraites des systèmes chaotiques.Un test original pour l'indépendance statistique (le test Badea-Vlad) a été utilisée; la procédure est applicable à tous les types de variables aléatoires continues, même reparties selon une loi de probabilité inconnue au besoin ici.Le chapitre V illustre le point de vue physique. Le temps transitoire correspond au temps passé par le système chaotique dans le bassin d'attraction avant de rejoindre l'attracteur étrange.De même il est important de savoir après combien de temps les points localisés dans une certaine région de l'attracteur étrange devient non-corrélés.Dans le chapitre VI, sachant l'identifiabilité des paramètres des systèmes chaotiques décrits par des équations polynomiales, une amélioration des inclusions du message dans ce type de cryptographie, est proposé.Le message clair est chiffré en utilisant une substitution classique avec boîtes de transposition, avant son inclusion dans l'émetteur chaotique.Les résultats de l'algorithme proposé sont évalués sur le texte et sur l'image.Le chapitre VII pose quelques questions, et essaie de trouver quelques-unes des réponses à ces questions, dans le cadre du schéma hybride.Comme par exemple, est-il possible de récupérer le message secret en utilisant un observateur, lorsque la dynamique qui lui inclut est retardée?La réponse est positive, et cela est montrée dans le cas d'une transmission intégrale de la sortie du système.Il est important de mentionner que ce travail est pluridisciplinaire, allant de la théorie du contrôle aux statistiques en passant par les domaines de l'électronique, de la mathématique et de l'informatique. / This Thesis deals with the domain of cryptography based on hybrid chaotic dynamics.In order to increase the robustness of the security in data transmission with respect to known text attack, this work was particularly focused on two directions: the statistical approach and the automation control.The main contributions of this work are organized in the mentioned two directions.The choice of the measured variable and its influence on the transmitter of plain messages, alongside the possibility to recover the dynamics at the reception.These are studied in the context of discrete and continuous-time chaotic systems.Statistical independence of the state variables of chaotic systems is investigated in relation with the spatial non-correlation of the states.A method of hiding the secret message, depending on the evolution of the chaotic transmitter and prior to its inclusion in this dynamics is proposed.The feasibility of a delayed time hybrid scheme that is used for secure data transmission is shown in an analog implementation.Simulations and analysis of the obtained results are done in order to prove the efficiency of the proposed studies and methods.The Thesis is organized as follows: Chapter I resumes theoretical notions and algorithms used to achieve the goal of this work.Chapter II is dedicated to the study of the Lyapunov exponents. The chaotic systems used in this report are described.Chapter III presents a study of some structural properties of the chaotic systems from Chapter II.The investigation is focused on the calculation of the observability indexes and the determination of the manifolds of observability singularity.Chapter IV analyses the statistical independence in the context of the considered chaotic systems:how large should be the sampling distance (how many iterations or, equivalently, time) to ensure statical independence between variables extracted from the chaotic systems.An original test for statistical independence (the Badea-Vlad test) was used; the procedure is applicable to all kind of continuous random variables, even of unknown probability law as needed here.Chapter V illustrates the physical point of view.The transient time corresponds to the time spent by the chaotic system in the basin of attraction before rejoining the strange attractor.It is also important to know after how long the points localized in a certain region of the strange attractor become uncorrelated.In Chapter VI, knowing the identifiability of the parameters of chaotic systems described by polynomial equations, an improvement of the inclusion of messages in this type of enciphering is proposed.The plain-message is enciphered using classical substitution and transposition boxes, prior to its inclusion in the chaotic transmitter.The results of the proposed algorithm are evaluated on text and image.Chapter VII rises some questions, and tries to find some answers to these questions, in the context of hybrid dynamical schemes.As for example if it is possible to recover the secret message by using an observer, when the dynamics that includes it is time-delayed.The answer is positive and this is shown in the case of a full transmission of the output of the system.It is important to mention that this work is multidisciplinary, starting from control theory and going to the statistical methods through the fields of electronics, mathematics and computing.
|
Page generated in 0.3959 seconds