Matching Items (98)
Filtering by
- Genre: Doctoral Dissertation
- Creators: Papandreou-Suppappola, Antonia
Description
Complex dynamical systems are the kind of systems with many interacting components that usually have nonlinear dynamics. Those systems exist in a wide range of disciplines, such as physical, biological, and social fields. Those systems, due to a large amount of interacting components, tend to possess very high dimensionality. Additionally, due to the intrinsic nonlinear dynamics, they have tremendous rich system behavior, such as bifurcation, synchronization, chaos, solitons. To develop methods to predict and control those systems has always been a challenge and an active research area.
My research mainly concentrates on predicting and controlling tipping points (saddle-node bifurcation) in complex ecological systems, comparing linear and nonlinear control methods in complex dynamical systems. Moreover, I use advanced artificial neural networks to predict chaotic spatiotemporal dynamical systems. Complex networked systems can exhibit a tipping point (a “point of no return”) at which a total collapse occurs. Using complex mutualistic networks in ecology as a prototype class of systems, I carry out a dimension reduction process to arrive at an effective two-dimensional (2D) system with the two dynamical variables corresponding to the average pollinator and plant abundances, respectively. I demonstrate that, using 59 empirical mutualistic networks extracted from real data, our 2D model can accurately predict the occurrence of a tipping point even in the presence of stochastic disturbances. I also develop an ecologically feasible strategy to manage/control the tipping point by maintaining the abundance of a particular pollinator species at a constant level, which essentially removes the hysteresis associated with tipping points.
Besides, I also find that the nodal importance ranking for nonlinear and linear control exhibits opposite trends: for the former, large degree nodes are more important but for the latter, the importance scale is tilted towards the small-degree nodes, suggesting strongly irrelevance of linear controllability to these systems. Focusing on a class of recurrent neural networks - reservoir computing systems that have recently been exploited for model-free prediction of nonlinear dynamical systems, I uncover a surprising phenomenon: the emergence of an interval in the spectral radius of the neural network in which the prediction error is minimized.
My research mainly concentrates on predicting and controlling tipping points (saddle-node bifurcation) in complex ecological systems, comparing linear and nonlinear control methods in complex dynamical systems. Moreover, I use advanced artificial neural networks to predict chaotic spatiotemporal dynamical systems. Complex networked systems can exhibit a tipping point (a “point of no return”) at which a total collapse occurs. Using complex mutualistic networks in ecology as a prototype class of systems, I carry out a dimension reduction process to arrive at an effective two-dimensional (2D) system with the two dynamical variables corresponding to the average pollinator and plant abundances, respectively. I demonstrate that, using 59 empirical mutualistic networks extracted from real data, our 2D model can accurately predict the occurrence of a tipping point even in the presence of stochastic disturbances. I also develop an ecologically feasible strategy to manage/control the tipping point by maintaining the abundance of a particular pollinator species at a constant level, which essentially removes the hysteresis associated with tipping points.
Besides, I also find that the nodal importance ranking for nonlinear and linear control exhibits opposite trends: for the former, large degree nodes are more important but for the latter, the importance scale is tilted towards the small-degree nodes, suggesting strongly irrelevance of linear controllability to these systems. Focusing on a class of recurrent neural networks - reservoir computing systems that have recently been exploited for model-free prediction of nonlinear dynamical systems, I uncover a surprising phenomenon: the emergence of an interval in the spectral radius of the neural network in which the prediction error is minimized.
ContributorsJiang, Junjie (Author) / Lai, Ying-Cheng (Thesis advisor) / Papandreou-Suppappola, Antonia (Committee member) / Wang, Xiao (Committee member) / Zhang, Yanchao (Committee member) / Arizona State University (Publisher)
Created2020
Description
The problem of multiple object tracking seeks to jointly estimate the time-varying cardinality and trajectory of each object. There are numerous challenges that are encountered in tracking multiple objects including a time-varying number of measurements, under varying constraints, and environmental conditions. In this thesis, the proposed statistical methods integrate the use of physical-based models with Bayesian nonparametric methods to address the main challenges in a tracking problem. In particular, Bayesian nonparametric methods are exploited to efficiently and robustly infer object identity and learn time-dependent cardinality; together with Bayesian inference methods, they are also used to associate measurements to objects and estimate the trajectory of objects. These methods differ from the current methods to the core as the existing methods are mainly based on random finite set theory.
The first contribution proposes dependent nonparametric models such as the dependent Dirichlet process and the dependent Pitman-Yor process to capture the inherent time-dependency in the problem at hand. These processes are used as priors for object state distributions to learn dependent information between previous and current time steps. Markov chain Monte Carlo sampling methods exploit the learned information to sample from posterior distributions and update the estimated object parameters.
The second contribution proposes a novel, robust, and fast nonparametric approach based on a diffusion process over infinite random trees to infer information on object cardinality and trajectory. This method follows the hierarchy induced by objects entering and leaving a scene and the time-dependency between unknown object parameters. Markov chain Monte Carlo sampling methods integrate the prior distributions over the infinite random trees with time-dependent diffusion processes to update object states.
The third contribution develops the use of hierarchical models to form a prior for statistically dependent measurements in a single object tracking setup. Dependency among the sensor measurements provides extra information which is incorporated to achieve the optimal tracking performance. The hierarchical Dirichlet process as a prior provides the required flexibility to do inference. Bayesian tracker is integrated with the hierarchical Dirichlet process prior to accurately estimate the object trajectory.
The fourth contribution proposes an approach to model both the multiple dependent objects and multiple dependent measurements. This approach integrates the dependent Dirichlet process modeling over the dependent object with the hierarchical Dirichlet process modeling of the measurements to fully capture the dependency among both object and measurements. Bayesian nonparametric models can successfully associate each measurement to the corresponding object and exploit dependency among them to more accurately infer the trajectory of objects. Markov chain Monte Carlo methods amalgamate the dependent Dirichlet process with the hierarchical Dirichlet process to infer the object identity and object cardinality.
Simulations are exploited to demonstrate the improvement in multiple object tracking performance when compared to approaches that are developed based on random finite set theory.
The first contribution proposes dependent nonparametric models such as the dependent Dirichlet process and the dependent Pitman-Yor process to capture the inherent time-dependency in the problem at hand. These processes are used as priors for object state distributions to learn dependent information between previous and current time steps. Markov chain Monte Carlo sampling methods exploit the learned information to sample from posterior distributions and update the estimated object parameters.
The second contribution proposes a novel, robust, and fast nonparametric approach based on a diffusion process over infinite random trees to infer information on object cardinality and trajectory. This method follows the hierarchy induced by objects entering and leaving a scene and the time-dependency between unknown object parameters. Markov chain Monte Carlo sampling methods integrate the prior distributions over the infinite random trees with time-dependent diffusion processes to update object states.
The third contribution develops the use of hierarchical models to form a prior for statistically dependent measurements in a single object tracking setup. Dependency among the sensor measurements provides extra information which is incorporated to achieve the optimal tracking performance. The hierarchical Dirichlet process as a prior provides the required flexibility to do inference. Bayesian tracker is integrated with the hierarchical Dirichlet process prior to accurately estimate the object trajectory.
The fourth contribution proposes an approach to model both the multiple dependent objects and multiple dependent measurements. This approach integrates the dependent Dirichlet process modeling over the dependent object with the hierarchical Dirichlet process modeling of the measurements to fully capture the dependency among both object and measurements. Bayesian nonparametric models can successfully associate each measurement to the corresponding object and exploit dependency among them to more accurately infer the trajectory of objects. Markov chain Monte Carlo methods amalgamate the dependent Dirichlet process with the hierarchical Dirichlet process to infer the object identity and object cardinality.
Simulations are exploited to demonstrate the improvement in multiple object tracking performance when compared to approaches that are developed based on random finite set theory.
ContributorsMoraffah, Bahman (Author) / Papandreou-Suppappola, Antonia (Thesis advisor) / Bliss, Daniel W. (Committee member) / Richmond, Christ D. (Committee member) / Dasarathy, Gautam (Committee member) / Arizona State University (Publisher)
Created2019
Description
This research presents advances in time-synchronized phasor (i.e.,synchrophasor) estimation and imaging with very-low-frequency electric fields.
Phasor measurement units measure and track dynamic systems, often power
systems, using synchrophasor estimation algorithms. Two improvements to
subspace-based synchrophasor estimation algorithms are shown. The first
improvement is a dynamic thresholding method for accurately determining the
signal subspace when using the estimation of signal parameters via rotational
invariance techniques (ESPRIT) algorithm. This improvement facilitates
accurate ESPRIT-based frequency estimates of both the nominal system frequency
and the frequencies of interfering signals such as harmonics or out-of-band
interference signals. Proper frequency estimation of all signals present in
measurement data allows for accurate least squares estimates of synchrophasors
for the nominal system frequency. By including the effects of clutter signals
in the synchrophasor estimate, interference from clutter signals can be
excluded. The result is near-flat estimation error during nominal system
frequency changes, the presence of harmonic distortion, and out-of-band
interference. The second improvement reduces the computational burden of the
ESPRIT frequency estimation step by showing that an optimized Eigenvalue
decomposition of the measurement data can be used instead of a singular value
decomposition. This research also explores a deep-learning-based inversion
method for imaging objects with a uniform electric field and a 2D planar D-dot
array. Using electric fields as an illumination source has seen multiple
applications ranging from medical imaging to mineral deposit detection. It is
shown that a planar D-dot array and deep neural network can reconstruct the
electrical properties of randomized objects. A 16000-sample dataset of objects
comprised of a three-by-three grid of randomized dielectric constants was
generated to train a deep neural network for predicting these dielectric
constants from measured field distortions. Increasingly complex imaging
environments are simulated, ranging from objects in free space to objects
placed in a physical cage designed to produce uniform electric fields.
Finally, this research relaxes the uniform electric field constraint, showing
that the volume of an opaque container can be imaged with a copper tube antenna
and a 1x4 array of D-dot sensors. Real world experimental results
show that it is possible to image buckets of water (targets) within a plastic
shed These experiments explore the detectability of targets as a function of
target placement within the shed.
ContributorsDrummond, Zachary (Author) / Allee, David R (Thesis advisor) / Claytor, Kevin E (Committee member) / Papandreou-Suppappola, Antonia (Committee member) / Aberle, James (Committee member) / Arizona State University (Publisher)
Created2021
Description
Existing radio access networks (RANs) allow only for very limited sharing of thecommunication and computation resources among wireless operators and heterogeneous
wireless technologies. The introduced LayBack architecture facilitates communication
and computation resource sharing among different wireless operators and technologies.
LayBack organizes the RAN communication and multiaccess edge computing (MEC)
resources into layers, including a devices layer, a radio node (enhanced Node B and
access point) layer, and a gateway layer. The layback optimization study addresses
the problem of how a central SDN orchestrator can flexibly share the total backhaul
capacity of the various wireless operators among their gateways and radio nodes
(e.g., LTE enhanced Node Bs or Wi-Fi access points). In order to facilitate
flexible network service virtualization and migration, network functions (NFs) are increasingly
executed by software modules as so-called "softwarized NFs" on General-Purpose
Computing (GPC) platforms and infrastructures. GPC platforms are not specifically
designed to efficiently execute NFs with their typically intense Input/Output (I/O)
demands. Recently, numerous hardware-based accelerations have been developed to
augment GPC platforms and infrastructures, e.g., the central processing unit (CPU)
and memory, to efficiently execute NFs. The computing capabilities of client devices
are continuously increasing; at the same time, demands for ultra-low latency (ULL)
services are increasing. These ULL services can be provided by migrating some
micro-service container computations from the cloud and multi-access edge computing
(MEC) to the client devices.
ContributorsShantharama, Prateek (Author) / Reisslein, Martin (Thesis advisor) / McGarry, Michael (Committee member) / Thyagaturu, Akhilesh (Committee member) / Zhang, Yanchao (Committee member) / Arizona State University (Publisher)
Created2022
Description
The continuous time-tagging of photon arrival times for high count rate sources isnecessary for applications such as optical communications, quantum key encryption,
and astronomical measurements. Detection of Hanbury-Brown and Twiss (HBT) single
photon correlations from thermal sources, such as stars, requires a combination of high
dynamic range, long integration times, and low systematics in the photon detection
and time tagging system. The continuous nature of the measurements and the need
for highly accurate timing resolution requires a customized time-to-digital converter
(TDC). A custom built, two-channel, field programmable gate array (FPGA)-based
TDC capable of continuously time tagging single photons with sub clock cycle timing
resolution was characterized. Auto-correlation and cross-correlation measurements
were used to constrain spurious systematic effects in the pulse count data as a function
of system variables. These variables included, but were not limited to, incident
photon count rate, incoming signal attenuation, and measurements of fixed signals.
Additionally, a generalized likelihood ratio test using maximum likelihood estimators
(MLEs) was derived as a means to detect and estimate correlated photon signal
parameters. The derived GLRT was capable of detecting correlated photon signals in
a laboratory setting with a high degree of statistical confidence. A proof is presented
in which the MLE for the amplitude of the correlated photon signal is shown to be the
minimum variance unbiased estimator (MVUE). The fully characterized TDC was used
in preliminary measurements of astronomical sources using ground based telescopes.
Finally, preliminary theoretical groundwork is established for the deep space optical
communications system of the proposed Breakthrough Starshot project, in which
low-mass craft will travel to the Alpha Centauri system to collect scientific data from
Proxima B. This theoretical groundwork utilizes recent and upcoming space based
optical communication systems as starting points for the Starshot communication
system.
ContributorsHodges, Todd Michael William (Author) / Mauskopf, Philip (Thesis advisor) / Trichopoulos, George (Thesis advisor) / Papandreou-Suppappola, Antonia (Committee member) / Bliss, Daniel (Committee member) / Arizona State University (Publisher)
Created2022
Description
Ethernet based technologies are emerging as the ubiquitous de facto form of communication due to their interoperability, capacity, cost, and reliability. Traditional Ethernet is designed with the goal of delivering best effort services. However, several real time and control applications require more precise deterministic requirements and Ultra Low Latency (ULL), that Ethernet cannot be used for. Current Industrial Automation and Control Systems (IACS) applications use semi-proprietary technologies that provide deterministic communication behavior for sporadic and periodic traffic, but can lead to closed systems that do not interoperate effectively. The convergence between the informational and operational technologies in modern industrial control networks cannot be achieved using traditional Ethernet. Time Sensitive Networking (TSN) is a suite of IEEE standards designed by augmenting traditional Ethernet with real time deterministic properties ideal for Digital Signal Processing (DSP) applications. Similarly, Deterministic Networking (DetNet) is a Internet Engineering Task Force (IETF) standardization that enhances the network layer with the required deterministic properties needed for IACS applications. This dissertation provides an in-depth survey and literature review on both standards/research and 5G related material on ULL. Recognizing the limitations of several features of the standards, this dissertation provides an empirical evaluation of these approaches and presents novel enhancements to the shapers and schedulers involved in TSN. More specifically, this dissertation investigates Time Aware Shaper (TAS), Asynchronous Traffic Shaper (ATS), and Cyclic Queuing and Forwarding (CQF) schedulers. Moreover, the IEEE 802.1Qcc, centralized management and control, and the IEEE 802.1Qbv can be used to manage and control scheduled traffic streams with periodic properties along with best-effort traffic on the same network infrastructure. Both the centralized network/distributed user model (hybrid model) and the fully-distributed (decentralized) IEEE 802.1Qcc model are examined on a typical industrial control network with the goal of maximizing scheduled traffic streams. Finally, since industrial applications and cyber-physical systems require timely delivery, any channel or node faults can cause severe disruption to the operational continuity of the application. Therefore, the IEEE 802.1CB, Frame Replication and Elimination for Reliability (FRER), is examined and tested using machine learning models to predict faulty scenarios and issue remedies seamlessly.
ContributorsNasrallah, Ahmed (Author) / Reisslein, Martin (Thesis advisor) / Syrotiuk, Violet R. (Committee member) / LiKamWa, Robert (Committee member) / Thyagaturu, Akhilesh (Committee member) / Arizona State University (Publisher)
Created2022
Description
The propagation of waves in solids, especially when characterized by dispersion, remains a topic of profound interest in the field of signal processing. Dispersion represents a phenomenon where wave speed becomes a function of frequency and results in multiple oscillatory modes. Such signals find application in structural healthmonitoring for identifying potential damage sensitive features in complex materials.
Consequently, it becomes important to find matched time-frequency representations
for characterizing the properties of the multiple frequency-dependent modes of propagation in dispersive material. Various time-frequency representations have been
used for dispersive signal analysis. However, some of them suffered from poor timefrequency localization or were designed to match only specific dispersion modes with
known characteristics, or could not reconstruct individual dispersive modes. This
thesis proposes a new time-frequency representation, the nonlinear synchrosqueezing
transform (NSST) that is designed to offer high localization to signals with nonlinear time-frequency group delay signatures. The NSST follows the technique used
by reassignment and synchrosqueezing methods to reassign time-frequency points of
the short-time Fourier transform and wavelet transform to specific localized regions
in the time-frequency plane. As the NSST is designed to match signals with third
order polynomial phase functions in the frequency domain, we derive matched group
delay estimators for the time-frequency point reassignment. This leads to a highly localized representation for nonlinear time-frequency characteristics that also allow for
the reconstruction of individual dispersive modes from multicomponent signals. For
the reconstruction process, we propose a novel unsupervised learning approach that
does not require prior information on the variation or number of modes in the signal.
We also propose a Bayesian group delay mode merging approach for reconstructing
modes that overlap in time and frequency. In addition to using simulated signals, we demonstrate the performance of the new NSST, together with mode extraction, using
real experimental data of ultrasonic guided waves propagating through a composite
plate.
ContributorsIkram, Javaid (Author) / Papandreou-Suppappola, Antonia (Thesis advisor) / Chattopadhyay, Aditi (Thesis advisor) / Bertoni, Mariana (Committee member) / Sinha, Kanu (Committee member) / Arizona State University (Publisher)
Created2023
Description
This dissertation centers on the development of Bayesian methods for learning differ- ent types of variation in switching nonlinear gene regulatory networks (GRNs). A new nonlinear and dynamic multivariate GRN model is introduced to account for different sources of variability in GRNs. The new model is aimed at more precisely capturing the complexity of GRN interactions through the introduction of time-varying kinetic order parameters, while allowing for variability in multiple model parameters. This model is used as the drift function in the development of several stochastic GRN mod- els based on Langevin dynamics. Six models are introduced which capture intrinsic and extrinsic noise in GRNs, thereby providing a full characterization of a stochastic regulatory system. A Bayesian hierarchical approach is developed for learning the Langevin model which best describes the noise dynamics at each time step. The trajectory of the state, which are the gene expression values, as well as the indicator corresponding to the correct noise model are estimated via sequential Monte Carlo (SMC) with a high degree of accuracy. To address the problem of time-varying regulatory interactions, a Bayesian hierarchical model is introduced for learning variation in switching GRN architectures with unknown measurement noise covariance. The trajectory of the state and the indicator corresponding to the network configuration at each time point are estimated using SMC. This work is extended to a fully Bayesian hierarchical model to account for uncertainty in the process noise covariance associated with each network architecture. An SMC algorithm with local Gibbs sampling is developed to estimate the trajectory of the state and the indicator correspond- ing to the network configuration at each time point with a high degree of accuracy. The results demonstrate the efficacy of Bayesian methods for learning information in switching nonlinear GRNs.
ContributorsVélez-Cruz, Nayely (Author) / Papandreou-Suppappola, Antonia (Thesis advisor) / Moraffah, Bahman (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Berisha, Visar (Committee member) / Arizona State University (Publisher)
Created2023