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.
In this research, I surveyed existing methods of characterizing Epilepsy from Electroencephalogram (EEG) data, including the Random Forest algorithm, which was claimed by many researchers to be the most effective at detecting epileptic seizures [7]. I observed that although many papers claimed a detection of >99% using Random Forest, it was not specified “when” the detection was declared within the 23.6 second interval of the seizure event. In this research, I created a time-series procedure to detect the seizure as early as possible within the 23.6 second epileptic seizure window and found that the detection is effective (> 92%) as early as the first few seconds of the epileptic episode. I intend to use this research as a stepping stone towards my upcoming Masters thesis research where I plan to expand the time-series detection mechanism to the pre-ictal stage, which will require a different dataset.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
For tree networks, the maximum a posterior (MAP) estimator of the information source is derived under the independent cascades (IC) model with a complete snapshot and a Short-Fat Tree (SFT) algorithm is proposed for general networks based on the MAP estimator. Furthermore, the following possibility and impossibility results are established on the Erdos-Renyi (ER) random graph: $(i)$ when the infection duration $<\frac{2}{3}t_u,$ SFT identifies the source with probability one asymptotically, where $t_u=\left\lceil\frac{\log n}{\log \mu}\right\rceil+2$ and $\mu$ is the average node degree, $(ii)$ when the infection duration $>t_u,$ the probability of identifying the source approaches zero asymptotically under any algorithm; and $(iii)$ when infection duration $
In practice, other than the nodes' states, side information like partial timestamps may also be available. Such information provides important insights of the diffusion process. To utilize the partial timestamps, the information source detection problem is formulated as a ranking problem on graphs and two ranking algorithms, cost-based ranking (CR) and tree-based ranking (TR), are proposed. Extensive experimental evaluations of synthetic data of different diffusion models and real world data demonstrate the effectiveness and robustness of CR and TR compared with existing algorithms.
Another interesting problem in quantum transport is the effect of disorder or random impurities since it is inevitable in real experiments. At first, for a twodimensional Dirac ring, as the disorder density is systematically increased, the persistent current decreases slowly initially and then plateaus at a finite nonzero value, indicating remarkable robustness of the persistent currents, which cannot be discovered in normal metal and semiconductor rings. In addition, in a Floquet system with a ribbon structure, the conductance can be remarkably enhanced by onsite disorder.
Recent years have witnessed significant interest in nanoscale physical systems, such as semiconductor supperlattices and optomechanical systems, which can exhibit distinct collective dynamical behaviors. Firstly, a system of two optically coupled optomechanical cavities is considered and the phenomenon of synchronization transition associated with quantum entanglement transition is discovered. Another useful issue is nonlinear dynamics in semiconductor superlattices caused by its key potential application lies in generating radiation sources, amplifiers and detectors in the spectral range of terahertz. In such a system, transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt.
First, in existing linear controllability frameworks, the ability to steer a network from any initiate state toward any desired state is measured by the minimum number of driver nodes. However, the associated optimal control energy can become unbearably large, preventing actual control from being realized. Here I develop a physical controllability framework and propose strategies to turn physically uncontrollable networks into physically controllable ones. I also discover that although full control can be guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control energy to achieve actual control, and my work provides a framework to address this issue.
Second, in spite of recent progresses in linear controllability, controlling nonlinear dynamical networks remains an outstanding problem. Here I develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another. I introduce the concept of attractor network and formulate a quantifiable framework: a network is more controllable if the attractor network is more strongly connected. I test the control framework using examples from various models and demonstrate the beneficial role of noise in facilitating control.
Third, I analyze large data sets from a diverse online social networking (OSN) systems and find that the growth dynamics of meme popularity exhibit characteristically different behaviors: linear, “S”-shape and exponential growths. Inspired by cell population growth model in microbial ecology, I construct a base growth model for meme popularity in OSNs. Then I incorporate human interest dynamics into the base model and propose a hybrid model which contains a small number of free parameters. The model successfully predicts the various distinct meme growth dynamics.
At last, I propose a nonlinear dynamics model to characterize the controlling of WNT signaling pathway in the differentiation of neural progenitor cells. The model is able to predict experiment results and shed light on the understanding of WNT regulation mechanisms.