Matching Items (119)
Description
In this thesis I introduce a new direction to computing using nonlinear chaotic dynamics. The main idea is rich dynamics of a chaotic system enables us to (1) build better computers that have a flexible instruction set, and (2) carry out computation that conventional computers are not good at it. Here I start from the theory, explaining how one can build a computing logic block using a chaotic system, and then I introduce a new theoretical analysis for chaos computing. Specifically, I demonstrate how unstable periodic orbits and a model based on them explains and predicts how and how well a chaotic system can do computation. Furthermore, since unstable periodic orbits and their stability measures in terms of eigenvalues are extractable from experimental times series, I develop a time series technique for modeling and predicting chaos computing from a given time series of a chaotic system. After building a theoretical framework for chaos computing I proceed to architecture of these chaos-computing blocks to build a sophisticated computing system out of them. I describe how one can arrange and organize these chaos-based blocks to build a computer. I propose a brand new computer architecture using chaos computing, which shifts the limits of conventional computers by introducing flexible instruction set. Our new chaos based computer has a flexible instruction set, meaning that the user can load its desired instruction set to the computer to reconfigure the computer to be an implementation for the desired instruction set. Apart from direct application of chaos theory in generic computation, the application of chaos theory to speech processing is explained and a novel application for chaos theory in speech coding and synthesizing is introduced. More specifically it is demonstrated how a chaotic system can model the natural turbulent flow of the air in the human speech production system and how chaotic orbits can be used to excite a vocal tract model. Also as another approach to build computing system based on nonlinear system, the idea of Logical Stochastic Resonance is studied and adapted to an autoregulatory gene network in the bacteriophage λ.
ContributorsKia, Behnam (Author) / Ditto, William (Thesis advisor) / Huang, Liang (Committee member) / Lai, Ying-Cheng (Committee member) / Helms Tillery, Stephen (Committee member) / Arizona State University (Publisher)
Created2011
Description
Complex dynamical systems consisting interacting dynamical units are ubiquitous in nature and society. Predicting and reconstructing nonlinear dynamics of units and the complex interacting networks among them serves the base for the understanding of a variety of collective dynamical phenomena. I present a general method to address the two outstanding problems as a whole based solely on time-series measurements. The method is implemented by incorporating compressive sensing approach that enables an accurate reconstruction of complex dynamical systems in terms of both nodal equations that determines the self-dynamics of units and detailed coupling patterns among units. The representative advantages of the approach are (i) the sparse data requirement which allows for a successful reconstruction from limited measurements, and (ii) general applicability to identical and nonidentical nodal dynamics, and to networks with arbitrary interacting structure, strength and sizes. Another two challenging problem of significant interest in nonlinear dynamics: (i) predicting catastrophes in nonlinear dynamical systems in advance of their occurrences and (ii) predicting the future state for time-varying nonlinear dynamical systems, can be formulated and solved in the framework of compressive sensing using only limited measurements. Once the network structure can be inferred, the dynamics behavior on them can be investigated, for example optimize information spreading dynamics, suppress cascading dynamics and traffic congestion, enhance synchronization, game dynamics, etc. The results can yield insights to control strategies design in the real-world social and natural systems. Since 2004, there has been a tremendous amount of interest in graphene. The most amazing feature of graphene is that there exists linear energy-momentum relationship when energy is low. The quasi-particles inside the system can be treated as chiral, massless Dirac fermions obeying relativistic quantum mechanics. Therefore, the graphene provides one perfect test bed to investigate relativistic quantum phenomena, such as relativistic quantum chaotic scattering and abnormal electron paths induced by klein tunneling. This phenomenon has profound implications to the development of graphene based devices that require stable electronic properties.
ContributorsYang, Rui (Author) / Lai, Ying-Cheng (Thesis advisor) / Duman, Tolga M. (Committee member) / Akis, Richard (Committee member) / Huang, Liang (Committee member) / Arizona State University (Publisher)
Created2012
Description
Salmonella enterica is a gastrointestinal (GI) pathogen that can cause systemic diseases. It invades the host through the GI tract and can induce powerful immune responses in addition to disease. Thus, it is considered as a promising candidate to use as oral live vaccine vectors. Scientists have been making great efforts to get a properly attenuated Salmonella vaccine strain for a long time, but could not achieve a balance between attenuation and immunogenicity. So the regulated delayed attenuation/lysis Salmonella vaccine vectors were proposed as a design to seek this balance. The research work is progressing steadily, but more improvements need to be made. As one of the possible improvements, the cyclic adenosine monophosphate (cAMP) -independent cAMP receptor protein (Crp*) is expected to protect the Crp-dependent crucial regulator, araC PBAD, in these vaccine designs from interference by glucose, which decreases synthesis of cAMP, and enhance the colonizing ability by and immunogenicity of the vaccine strains. In this study, the cAMP-independent crp gene mutation, crp-70, with or without araC PBAD promoter cassette, was introduced into existing Salmonella vaccine strains. Then the plasmid stability, growth rate, resistance to catabolite repression, colonizing ability, immunogenicity and protection to challenge of these new strains were compared with wild-type crp or araC PBAD crp strains using western blots, enzyme-linked immunosorbent assays (ELISA) and animal studies, so as to evaluate the effects of the crp-70 mutation on the vaccine strains. The performances of the crp-70 strains in some aspects were closed to or even exceeded the crp+ strains, but generally they did not exhibit the expected advantages compared to their wild-type parents. Crp-70 rescued the expression of araC PBAD fur from catabolite repression. The strain harboring araC PBAD crp-70 was severely affected by its slow growth, and its colonizing ability and immunogenicity was much weaker than the other strains. The Pcrp crp-70 strain showed relatively good ability in colonization and immune stimulation. Both the araC PBAD crp-70 and the Pcrp crp-70 strains could provide certain levels of protection against the challenge with virulent pneumococci, which were a little lower than for the crp+ strains.
ContributorsShao, Shihuan (Author) / Curtiss, Roy (Thesis advisor) / Arizona State University (Publisher)
Created2012
Description
What can classical chaos do to quantum systems is a fundamental issue highly relevant to a number of branches in physics. The field of quantum chaos has been active for three decades, where the focus was on non-relativistic quantumsystems described by the Schr¨odinger equation. By developing an efficient method to solve the Dirac equation in the setting where relativistic particles can tunnel between two symmetric cavities through a potential barrier, chaotic cavities are found to suppress the spread in the tunneling rate. Tunneling rate for any given energy assumes a wide range that increases with the energy for integrable classical dynamics. However, for chaotic underlying dynamics, the spread is greatly reduced. A remarkable feature, which is a consequence of Klein tunneling, arise only in relativistc quantum systems that substantial tunneling exists even for particle energy approaching zero. Similar results are found in graphene tunneling devices, implying high relevance of relativistic quantum chaos to the development of such devices. Wave propagation through random media occurs in many physical systems, where interesting phenomena such as branched, fracal-like wave patterns can arise. The generic origin of these wave structures is currently a matter of active debate. It is of fundamental interest to develop a minimal, paradigmaticmodel that can generate robust branched wave structures. In so doing, a general observation in all situations where branched structures emerge is non-Gaussian statistics of wave intensity with an algebraic tail in the probability density function. Thus, a universal algebraic wave-intensity distribution becomes the criterion for the validity of any minimal model of branched wave patterns. Coexistence of competing species in spatially extended ecosystems is key to biodiversity in nature. Understanding the dynamical mechanisms of coexistence is a fundamental problem of continuous interest not only in evolutionary biology but also in nonlinear science. A continuous model is proposed for cyclically competing species and the effect of the interplay between the interaction range and mobility on coexistence is investigated. A transition from coexistence to extinction is uncovered with a non-monotonic behavior in the coexistence probability and switches between spiral and plane-wave patterns arise. Strong mobility can either promote or hamper coexistence, while absent in lattice-based models, can be explained in terms of nonlinear partial differential equations.
ContributorsNi, Xuan (Author) / Lai, Ying-Cheng (Thesis advisor) / Huang, Liang (Committee member) / Yu, Hongbin (Committee member) / Akis, Richard (Committee member) / Arizona State University (Publisher)
Created2012
DescriptionA novel and unconventional approach for delivering a eukaryotic apoptosis factor, TNF-related apoptosis-inducing ligand (TRAIL), to cancer cells within and around necrotizing tumors by utilizing a S. Typhimurium purine requiring auxotroph as a biological vector to develop two anticancer therapies with multiple modality and broad economic feasibility.
ContributorsKoons, Andrew (Author) / Curtiss, Roy (Thesis director) / Lake, Douglas (Committee member) / Janthakahalli, Nagaraj Vinay (Committee member) / Barrett, The Honors College (Contributor)
Created2013-12
Description
Complex human controls is a topic of much interest in the fields of robotics, manufacturing, space exploration and many others. Even simple tasks that humans perform with ease can be extremely complicated when observed from a controls and complex systems perspective. One such simple task is that of a human carrying and moving a coffee cup. Though this may be a mundane task for humans, when this task is modelled and analyzed, the system may be quite chaotic in nature. Understanding such systems is key to the development robots and autonomous systems that can perform these tasks themselves.
The coffee cup system can be simplified and modeled by a cart-and-pendulum system. Bazzi et al. and Maurice et al. present two different cart-and-pendulum systems to represent the coffee cup system [1],[2]. The purpose of this project was to build upon these systems and to gain a better understanding of the coffee cup system and to determine where chaos existed within the system. The honors thesis team first worked with their senior design group to develop a mathematical model for the cart-and-pendulum system based on the Bazzi and Maurice papers [1],[2]. This system was analyzed and then built upon by the honors thesis team to build a cart-and-two-pendulum model to represent the coffee cup system more accurately.
Analysis of the single pendulum model showed that there exists a low frequency region where the pendulum and the cart remain in phase with each other and a high frequency region where the cart and pendulum have a π phase difference between them. The transition point of the low and high frequency region is determined by the resonant frequency of the pendulum. The analysis of the two-pendulum system also confirmed this result and revealed that differences in length between the pendulum cause the pendulums to transition to the high frequency regions at separate frequency. The pendulums have different resonance frequencies and transition into the high frequency region based on their own resonant frequency. This causes a range of frequencies where the pendulums are out of phase from each other. After both pendulums have transitioned, they remain in phase with each other and out of phase from the cart.
However, if the length of the pendulum is decreased too much, the system starts to exhibit chaotic behavior. The short pendulum starts to act in a chaotic manner and the phase relationship between the pendulums and the carts is no longer maintained. Since the pendulum length represents the distance between the particle of coffee and the top of the cup, this implies that coffee near the top of the cup would cause the system to act chaotically. Further analysis would be needed to determine the reason why the length affects the system in this way.
The coffee cup system can be simplified and modeled by a cart-and-pendulum system. Bazzi et al. and Maurice et al. present two different cart-and-pendulum systems to represent the coffee cup system [1],[2]. The purpose of this project was to build upon these systems and to gain a better understanding of the coffee cup system and to determine where chaos existed within the system. The honors thesis team first worked with their senior design group to develop a mathematical model for the cart-and-pendulum system based on the Bazzi and Maurice papers [1],[2]. This system was analyzed and then built upon by the honors thesis team to build a cart-and-two-pendulum model to represent the coffee cup system more accurately.
Analysis of the single pendulum model showed that there exists a low frequency region where the pendulum and the cart remain in phase with each other and a high frequency region where the cart and pendulum have a π phase difference between them. The transition point of the low and high frequency region is determined by the resonant frequency of the pendulum. The analysis of the two-pendulum system also confirmed this result and revealed that differences in length between the pendulum cause the pendulums to transition to the high frequency regions at separate frequency. The pendulums have different resonance frequencies and transition into the high frequency region based on their own resonant frequency. This causes a range of frequencies where the pendulums are out of phase from each other. After both pendulums have transitioned, they remain in phase with each other and out of phase from the cart.
However, if the length of the pendulum is decreased too much, the system starts to exhibit chaotic behavior. The short pendulum starts to act in a chaotic manner and the phase relationship between the pendulums and the carts is no longer maintained. Since the pendulum length represents the distance between the particle of coffee and the top of the cup, this implies that coffee near the top of the cup would cause the system to act chaotically. Further analysis would be needed to determine the reason why the length affects the system in this way.
ContributorsZindani, Abdul Rahman (Co-author) / Crane, Kari (Co-author) / Lai, Ying-Cheng (Thesis director) / Jiang, Junjie (Committee member) / Electrical Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2019-12
Description
Modern physical systems are experiencing tremendous evolutions with growing size, more and more complex structures, and the incorporation of new devices. This calls for better planning, monitoring, and control. However, achieving these goals is challenging since the system knowledge (e.g., system structures and edge parameters) may be unavailable for a normal system, let alone some dynamic changes like maintenance, reconfigurations, and events, etc. Therefore, extracting system knowledge becomes a central topic. Luckily, advanced metering techniques bring numerous data, leading to the emergence of Machine Learning (ML) methods with efficient learning and fast inference. This work tries to propose a systematic framework of ML-based methods to learn system knowledge under three what-if scenarios: (i) What if the system is normally operated? (ii) What if the system suffers dynamic interventions? (iii) What if the system is new with limited data? For each case, this thesis proposes principled solutions with extensive experiments. Chapter 2 tackles scenario (i) and the golden rule is to learn an ML model that maintains physical consistency, bringing high extrapolation capacity for changing operational conditions. The key finding is that physical consistency can be linked to convexity, a central concept in optimization. Therefore, convexified ML designs are proposed and the global optimality implies faithfulness to the underlying physics. Chapter 3 handles scenario (ii) and the goal is to identify the event time, type, and locations. The problem is formalized as multi-class classification with special attention to accuracy and speed. Subsequently, Chapter 3 builds an ensemble learning framework to aggregate different ML models for better prediction. Next, to tackle high-volume data quickly, a tensor as the multi-dimensional array is used to store and process data, yielding compact and informative vectors for fast inference. Finally, if no labels exist, Chapter 3 uses physical properties to generate labels for learning. Chapter 4 deals with scenario (iii) and a doable process is to transfer knowledge from similar systems, under the framework of Transfer Learning (TL). Chapter 4 proposes cutting-edge system-level TL by considering the network structure, complex spatial-temporal correlations, and different physical information.
ContributorsLi, Haoran (Author) / Weng, Yang (Thesis advisor) / Tong, Hanghang (Committee member) / Dasarathy, Gautam (Committee member) / Sankar, Lalitha (Committee member) / Arizona State University (Publisher)
Created2022
Description
With the proliferation of mobile computing and Internet-of-Things (IoT), billions of mobile and IoT devices are connected to the Internet, generating zillions of Bytes of data at the network edge. Driving by this trend, there is an urgent need to push the artificial intelligence (AI) frontiers to the network edge to unleash the potential of the edge big data fully. This dissertation aims to comprehensively study collaborative learning and optimization algorithms to build a foundation of edge intelligence. Under this common theme, this dissertation is broadly organized into three parts. The first part of this study focuses on model learning with limited data and limited computing capability at the network edge. A global model initialization is first obtained by running federated learning (FL) across many edge devices, based on which a semi-supervised algorithm is devised for an edge device to carry out quick adaptation, aiming to address the insufficiency of labeled data and to learn a personalized model efficiently. In the second part of this study, collaborative learning between the edge and the cloud is studied to achieve real-time edge intelligence. More specifically, a distributionally robust optimization (DRO) approach is proposed to enable the synergy between local data processing and cloud knowledge transfer. Two attractive uncertainty models are investigated corresponding to the cloud knowledge transfer: the distribution uncertainty set based on the cloud data distribution and the prior distribution of the edge model conditioned on the cloud model. Collaborative learning algorithms are developed along this line. The final part focuses on developing an offline model-based safe Inverse Reinforcement Learning (IRL) algorithm for connected Autonomous Vehicles (AVs). A reward penalty is introduced to penalize unsafe states, and a risk-measure-based approach is proposed to mitigate the model uncertainty introduced by offline training. The experimental results demonstrate the improvement of the proposed algorithm over the existing baselines in terms of cumulative rewards.
ContributorsZhang, Zhaofeng (Author) / Zhang, Junshan (Thesis advisor) / Zhang, Yanchao (Thesis advisor) / Dasarathy, Gautam (Committee member) / Fan, Deliang (Committee member) / Arizona State University (Publisher)
Created2023
Description
In this work, the author analyzes quantitative and structural aspects of Bayesian inference using Markov kernels, Wasserstein metrics, and Kantorovich monads. In particular, the author shows the following main results: first, that Markov kernels can be viewed as Borel measurable maps with values in a Wasserstein space; second, that the Disintegration Theorem can be interpreted as a literal equality of integrals using an original theory of integration for Markov kernels; third, that the Kantorovich monad can be defined for Wasserstein metrics of any order; and finally, that, under certain assumptions, a generalized Bayes’s Law for Markov kernels provably leads to convergence of the expected posterior distribution in the Wasserstein metric. These contributions provide a basis for studying further convergence, approximation, and stability properties of Bayesian inverse maps and inference processes using a unified theoretical framework that bridges between statistical inference, machine learning, and probabilistic programming semantics.
ContributorsEikenberry, Keenan (Author) / Cochran, Douglas (Thesis advisor) / Lan, Shiwei (Thesis advisor) / Dasarathy, Gautam (Committee member) / Kotschwar, Brett (Committee member) / Shahbaba, Babak (Committee member) / Arizona State University (Publisher)
Created2023
Description
Event identification is increasingly recognized as crucial for enhancing the reliability, security, and stability of the electric power system. With the growing deployment of Phasor Measurement Units (PMUs) and advancements in data science, there are promising opportunities to explore data-driven event identification via machine learning classification techniques. This dissertation explores the potential of data-driven event identification through machine learning classification techniques. In the first part of this dissertation, using measurements from multiple PMUs, I propose to identify events by extracting features based on modal dynamics. I combine such traditional physics-based feature extraction methods with machine learning to distinguish different event types.Using the obtained set of features, I investigate the performance of two well-known classification models, namely, logistic regression (LR) and support vector machines (SVM) to identify generation loss and line trip events in two datasets. The first dataset is obtained from simulated events in the Texas 2000-bus synthetic grid. The second is a proprietary dataset with labeled events obtained from a large utility in the USA.
My results indicate that the proposed framework is promising for identifying the two types of events in the supervised setting. In the second part of the dissertation, I use semi-supervised learning techniques, which make use of both labeled and unlabeled samples.I evaluate three categories of classical semi-supervised approaches: (i) self-training, (ii) transductive support vector machines (TSVM), and (iii) graph-based label spreading (LS) method. In particular, I focus on the identification of four event classes i.e., load loss, generation loss, line trip, and bus fault. I have developed and publicly shared a comprehensive Event Identification package which consists of three aspects: data generation, feature extraction, and event identification with limited labels using semi-supervised methodologies. Using this package, I generate eventful PMU data for the South Carolina 500-Bus synthetic network. My evaluation confirms that the integration of additional unlabeled samples and the utilization of LS for pseudo labeling surpasses the outcomes achieved by the self-training and TSVM approaches. Moreover, the LS algorithm consistently enhances the performance of all classifiers more robustly.
ContributorsTaghipourbazargani, Nima (Author) / Kosut, Oliver (Thesis advisor) / Sankar, Lalitha (Committee member) / Pal, Anamitra (Committee member) / Dasarathy, Gautam (Committee member) / Arizona State University (Publisher)
Created2023