Matching Items (134)
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
The cyber-physical systems (CPS) are emerging as the underpinning technology for major industries in the 21-th century. This dissertation is focused on two fundamental issues in cyber-physical systems: network interdependence and information dynamics. It consists of the following two main thrusts. The first thrust is targeted at understanding the impact of network interdependence. It is shown that a cyber-physical system built upon multiple interdependent networks are more vulnerable to attacks since node failures in one network may result in failures in the other network, causing a cascade of failures that would potentially lead to the collapse of the entire infrastructure. There is thus a need to develop a new network science for modeling and quantifying cascading failures in multiple interdependent networks, and to develop network management algorithms that improve network robustness and ensure overall network reliability against cascading failures. To enhance the system robustness, a "regular" allocation strategy is proposed that yields better resistance against cascading failures compared to all possible existing strategies. Furthermore, in view of the load redistribution feature in many physical infrastructure networks, e.g., power grids, a CPS model is developed where the threshold model and the giant connected component model are used to capture the node failures in the physical infrastructure network and the cyber network, respectively. The second thrust is centered around the information dynamics in the CPS. One speculation is that the interconnections over multiple networks can facilitate information diffusion since information propagation in one network can trigger further spread in the other network. With this insight, a theoretical framework is developed to analyze information epidemic across multiple interconnecting networks. It is shown that the conjoining among networks can dramatically speed up message diffusion. Along a different avenue, many cyber-physical systems rely on wireless networks which offer platforms for information exchanges. To optimize the QoS of wireless networks, there is a need to develop a high-throughput and low-complexity scheduling algorithm to control link dynamics. To that end, distributed link scheduling algorithms are explored for multi-hop MIMO networks and two CSMA algorithms under the continuous-time model and the discrete-time model are devised, respectively.
ContributorsQian, Dajun (Author) / Zhang, Junshan (Thesis advisor) / Ying, Lei (Committee member) / Zhang, Yanchao (Committee member) / Cochran, Douglas (Committee member) / Arizona State University (Publisher)
Created2012
Description
Woody plant encroachment is a worldwide phenomenon linked to water availability in semiarid systems. Nevertheless, the implications of woody plant encroachment on the hydrologic cycle are poorly understood, especially at the catchment scale. This study takes place in a pair of small semiarid rangeland undergoing the encroachment of Prosopis velutina Woot., or velvet mesquite tree. The similarly-sized basins are in close proximity, leading to equivalent meteorological and soil conditions. One basin was treated for mesquite in 1974, while the other represents the encroachment process. A sensor network was installed to measure ecohydrological states and fluxes, including precipitation, runoff, soil moisture and evapotranspiration. Observations from June 1, 2011 through September 30, 2012 are presented to describe the seasonality and spatial variability of ecohydrological conditions during the North American Monsoon (NAM). Runoff observations are linked to historical changes in runoff production in each watershed. Observations indicate that the mesquite-treated basin generates more runoff pulses and greater runoff volume for small rainfall events, while the mesquite-encroached basin generates more runoff volume for large rainfall events. A distributed hydrologic model is applied to both basins to investigate the runoff threshold processes experienced during the NAM. Vegetation in the two basins is classified into grass, mesquite, or bare soil using high-resolution imagery. Model predictions are used to investigate the vegetation controls on soil moisture, evapotranspiration, and runoff generation. The distributed model shows that grass and mesquite sites retain the highest levels of soil moisture. The model also captures the runoff generation differences between the two watersheds that have been observed over the past decade. Generally, grass sites in the mesquite-treated basin have less plant interception and evapotranspiration, leading to higher soil moisture that supports greater runoff for small rainfall events. For large rainfall events, the mesquite-encroached basin produces greater runoff due to its higher fraction of bare soil. The results of this study show that a distributed hydrologic model can be used to explain runoff threshold processes linked to woody plant encroachment at the catchment-scale and provides useful interpretations for rangeland management in semiarid areas.
ContributorsPierini, Nicole A (Author) / Vivoni, Enrique R (Thesis advisor) / Wang, Zhi-Hua (Committee member) / Mays, Larry W. (Committee member) / Arizona State University (Publisher)
Created2013
Description
A principal goal of this dissertation is to study stochastic optimization and real-time scheduling in cyber-physical systems (CPSs) ranging from real-time wireless systems to energy systems to distributed control systems. Under this common theme, this dissertation can be broadly organized into three parts based on the system environments. The first part investigates stochastic optimization in real-time wireless systems, with the focus on the deadline-aware scheduling for real-time traffic. The optimal solution to such scheduling problems requires to explicitly taking into account the coupling in the deadline-aware transmissions and stochastic characteristics of the traffic, which involves a dynamic program that is traditionally known to be intractable or computationally expensive to implement. First, real-time scheduling with adaptive network coding over memoryless channels is studied, and a polynomial-time complexity algorithm is developed to characterize the optimal real-time scheduling. Then, real-time scheduling over Markovian channels is investigated, where channel conditions are time-varying and online channel learning is necessary, and the optimal scheduling policies in different traffic regimes are studied. The second part focuses on the stochastic optimization and real-time scheduling involved in energy systems. First, risk-aware scheduling and dispatch for plug-in electric vehicles (EVs) are studied, aiming to jointly optimize the EV charging cost and the risk of the load mismatch between the forecasted and the actual EV loads, due to the random driving activities of EVs. Then, the integration of wind generation at high penetration levels into bulk power grids is considered. Joint optimization of economic dispatch and interruptible load management is investigated using short-term wind farm generation forecast. The third part studies stochastic optimization in distributed control systems under different network environments. First, distributed spectrum access in cognitive radio networks is investigated by using pricing approach, where primary users (PUs) sell the temporarily unused spectrum and secondary users compete via random access for such spectrum opportunities. The optimal pricing strategy for PUs and the corresponding distributed implementation of spectrum access control are developed to maximize the PU's revenue. Then, a systematic study of the nonconvex utility-based power control problem is presented under the physical interference model in ad-hoc networks. Distributed power control schemes are devised to maximize the system utility, by leveraging the extended duality theory and simulated annealing.
ContributorsYang, Lei (Author) / Zhang, Junshan (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Xue, Guoliang (Committee member) / Ying, Lei (Committee member) / Arizona State University (Publisher)
Created2012
Description
The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different control algorithms. The focus of this thesis is to design scheduling and power control algorithms in wireless networks, and analyze their performances. In this thesis, we first study the multicast capacity of wireless ad hoc networks. Gupta and Kumar studied the scaling law of the unicast capacity of wireless ad hoc networks. They derived the order of the unicast throughput, as the number of nodes in the network goes to infinity. In our work, we characterize the scaling of the multicast capacity of large-scale MANETs under a delay constraint D. We first derive an upper bound on the multicast throughput, and then propose a lower bound on the multicast capacity by proposing a joint coding-scheduling algorithm that achieves a throughput within logarithmic factor of the upper bound. We then study the power control problem in ad-hoc wireless networks. We propose a distributed power control algorithm based on the Gibbs sampler, and prove that the algorithm is throughput optimal. Finally, we consider the scheduling algorithm in collocated wireless networks with flow-level dynamics. Specifically, we study the delay performance of workload-based scheduling algorithm with SRPT as a tie-breaking rule. We demonstrate the superior flow-level delay performance of the proposed algorithm using simulations.
ContributorsZhou, Shan (Author) / Ying, Lei (Thesis advisor) / Zhang, Yanchao (Committee member) / Zhang, Junshan (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2013
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
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
Description
Cancer remains one of the leading killers throughout the world. Death and disability due to lung cancer in particular accounts for one of the largest global economic burdens a disease presents. The burden on third-world countries is especially large due to the unusually large financial stress that comes from late tumor detection and expensive treatment options. Early detection using inexpensive techniques may relieve much of the burden throughout the world, not just in more developed countries. I examined the immune responses of lung cancer patients using immunosignatures – patterns of reactivity between host serum antibodies and random peptides. Immunosignatures reveal disease-specific patterns that are very reproducible. Immunosignaturing is a chip-based method that has the ability to display the antibody diversity from individual sera sample with low cost. Immunosignaturing is a medical diagnostic test that has many applications in current medical research and in diagnosis. From a previous clinical study, patients diagnosed for lung cancer were tested for their immunosignature vs. healthy non-cancer volunteers. The pattern of reactivity against the random peptides (the ‘immunosignature’) revealed common signals in cancer patients, absent from healthy controls. My study involved the search for common amino acid motifs in the cancer-specific peptides. My search through the hundreds of ‘hits’ revealed certain motifs that were repeated more times than expected by random chance. The amino acids that were the most conserved in each set include tryptophan, aspartic acid, glutamic acid, proline, alanine, serine, and lysine. The most overall conserved amino acid observed between each set was D - aspartic acid. The motifs were short (no more than 5-6 amino acids in a row), but the total number of motifs I identified was large enough to assure significance. I utilized Excel to organize the large peptide sequence libraries, then CLUSTALW to cluster similar-sequence peptides, then GLAM2 to find common themes in groups of peptides. In so doing, I found sequences that were also present in translated cancer expression libraries (RNA) that matched my motifs, suggesting that immunosignatures can find cancer-specific antigens that can be both diagnostic and potentially therapeutic.
ContributorsShiehzadegan, Shima (Author) / Johnston, Stephen (Thesis director) / Stafford, Phillip (Committee member) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2015-12
Description
The influenza virus, also known as "the flu", is an infectious disease that has constantly affected the health of humanity. There is currently no known cure for Influenza. The Center for Innovations in Medicine at the Biodesign Institute located on campus at Arizona State University has been developing synbodies as a possible Influenza therapeutic. Specifically, at CIM, we have attempted to design these initial synbodies to target the entire Influenza virus and preliminary data leads us to believe that these synbodies target Nucleoprotein (NP). Given that the synbody targets NP, the penetration of cells via synbody should also occur. Then by Western Blot analysis we evaluated for the diminution of NP level in treated cells versus untreated cells. The focus of my honors thesis is to explore how synthetic antibodies can potentially inhibit replication of the Influenza (H1N1) A/Puerto Rico/8/34 strain so that a therapeutic can be developed. A high affinity synbody for Influenza can be utilized to test for inhibition of Influenza as shown by preliminary data. The 5-5-3819 synthetic antibody's internalization in live cells was visualized with Madin-Darby Kidney Cells under a Confocal Microscope. Then by Western Blot analysis we evaluated for the diminution of NP level in treated cells versus untreated cells. Expression of NP over 8 hours time was analyzed via Western Blot Analysis, which showed NP accumulation was retarded in synbody treated cells. The data obtained from my honors thesis and preliminary data provided suggest that the synthetic antibody penetrates live cells and targets NP. The results of my thesis presents valuable information that can be utilized by other researchers so that future experiments can be performed, eventually leading to the creation of a more effective therapeutic for influenza.
ContributorsHayden, Joel James (Author) / Diehnelt, Chris (Thesis director) / Johnston, Stephen (Committee member) / Legutki, Bart (Committee member) / Barrett, The Honors College (Contributor) / Department of Psychology (Contributor) / Department of Chemistry and Biochemistry (Contributor)
Created2014-05
Description
Engineered pavements cover a large fraction of cities and offer significant potential for urban heat island mitigation. Though rapidly increasing research efforts have been devoted to the study of pavement materials, thermal interactions between buildings and the ambient environment are mostly neglected. In this study, numerical models featuring a realistic representation of building-environment thermal interactions, were applied to quantify the effect of pavements on the urban thermal environment at multiple scales. It was found that performance of pavements inside the canyon was largely determined by the canyon geometry. In a high-density residential area, modifying pavements had insignificant effect on the wall temperature and building energy consumption. At a regional scale, various pavement types were also found to have a limited cooling effect on land surface temperature and 2-m air temperature for metropolitan Phoenix. In the context of global climate change, the effect of pavement was evaluated in terms of the equivalent CO2 emission. Equivalent CO2 emission offset by reflective pavements in urban canyons was only about 13.9e46.6% of that without building canopies, depending on the canyon geometry. This study revealed the importance of building-environment thermal interactions in determining thermal conditions inside the urban canopy.
ContributorsYang, Jiachuan (Author) / Wang, Zhi-Hua (Author) / Kaloush, Kamil (Author) / Dylla, Heather (Author)
Created2016-08-22