Chaos From Switched-Capacitor Circuits: Discrete Maps

A special-purpose analog computer made of switched-capacitor circuits is presented for analyzing chaos and bifurcation phenomena in nonlinear discrete dynamical systems modeled by discrete maps *n + t = fan)-Experimental results are given for four switched-capacitor circuits described by well-known discrete maps; namely, the logistic map, the piecewise-linear unimodal (one-hump) map, the H é non map, and the Lozi map

Global bifurcations to subcritical magnetorotational dynamo action in Keplerian shear flow

Magnetorotational dynamo action in Keplerian shear flow is a three-dimensional, non-linear magnetohydrodynamic process whose study is relevant to the understanding of accretion processes and magnetic field generation in astrophysics. Transition to this form of dynamo action is subcritical and shares many characteristics of transition to turbulence in non-rotating hydrodynamic shear flows. This suggests that these different fluid systems become active through similar generic bifurcation mechanisms, which in both cases have eluded detailed understanding so far. In this paper, we build on recent work on the two problems to investigate numerically the bifurcation mechanisms at work in the incompressible Keplerian magnetorotational dynamo problem in the shearing box framework. Using numerical techniques imported from dynamical systems research, we show that the onset of chaotic dynamo action at magnetic Prandtl numbers larger than unity is primarily associated with global homoclinic and heteroclinic bifurcations of nonlinear magnetorotational dynamo cycles. These global bifurcations are found to be supplemented by local bifurcations of cycles marking the beginning of period-doubling cascades. The results suggest that nonlinear magnetorotational dynamo cycles provide the pathway to turbulent injection of both kinetic and magnetic energy in incompressible magnetohydrodynamic Keplerian shear flow in the absence of an externally imposed magnetic field. Studying the nonlinear physics and bifurcations of these cycles in different regimes and configurations may subsequently help to better understand the physical conditions of excitation of magnetohydrodynamic turbulence and instability-driven dynamos in a variety of astrophysical systems and laboratory experiments. The detailed characterization of global bifurcations provided for this three-dimensional subcritical fluid dynamics problem may also prove useful for the problem of transition to turbulence in hydrodynamic shear flows

Wavelet Trees Meet Suffix Trees

We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size $\sigma\leq n$, our method builds the wavelet tree in $O(n \log \sigma/ \sqrt{\log{n}})$ time, improving upon the state-of-the-art algorithm by a factor of $\sqrt{\log n}$. As a consequence, given an array of n integers we can construct in $O(n \sqrt{\log n})$ time a data structure consisting of $O(n)$ machine words and capable of answering rank/select queries for the subranges of the array in $O(\log n / \log \log n)$ time. This is a $\log \log n$-factor improvement in query time compared to Chan and P\u{a}tra\c{s}cu and a $\sqrt{\log n}$-factor improvement in construction time compared to Brodal et al. Next, we switch to stringological context and propose a novel notion of wavelet suffix trees. For a string w of length n, this data structure occupies $O(n)$ words, takes $O(n \sqrt{\log n})$ time to construct, and simultaneously captures the combinatorial structure of substrings of w while enabling efficient top-down traversal and binary search. In particular, with a wavelet suffix tree we are able to answer in $O(\log |x|)$ time the following two natural analogues of rank/select queries for suffixes of substrings: for substrings x and y of w count the number of suffixes of x that are lexicographically smaller than y, and for a substring x of w and an integer k, find the k-th lexicographically smallest suffix of x. We further show that wavelet suffix trees allow to compute a run-length-encoded Burrows-Wheeler transform of a substring x of w in $O(s \log |x|)$ time, where s denotes the length of the resulting run-length encoding. This answers a question by Cormode and Muthukrishnan, who considered an analogous problem for Lempel-Ziv compression.Comment: 33 pages, 5 figures; preliminary version published at SODA 201

Directed transport and localization in phase-modulated driven lattices

We explore the dynamics of non-interacting particles loaded into a phase-modulated one-dimensional lattice formed by laterally oscillating square barriers. Tuning the parameters of the driven unit cell of the lattice selected parts of the classical phase space can be manipulated in a controllable manner. We find superdiffusion in position space for all parameters regimes. A directed current of an ensemble of particles can be created through locally breaking the spatiotemporal symmetries of the time-driven potential. Magnitude and direction of the current are tunable. Several mechanisms for transient localization and trapping of particles in different wells of the driven unit cell are presented and analyzed

Multivariate and 2D Extensions of Singular Spectrum Analysis with the Rssa Package

Implementation of multivariate and 2D extensions of singular spectrum analysis (SSA) by means of the R package Rssa is considered. The extensions include MSSA for simultaneous analysis and forecasting of several time series and 2D-SSA for analysis of digital images. A new extension of 2D-SSA analysis called shaped 2D-SSA is introduced for analysis of images of arbitrary shape, not necessary rectangular. It is shown that implementation of shaped 2D-SSA can serve as a basis for implementation of MSSA and other generalizations. Efficient implementation of operations with Hankel and Hankel-block-Hankel matrices through the fast Fourier transform is suggested. Examples with code fragments in R, which explain the methodology and demonstrate the proper use of Rssa, are presented

Multiple mechanisms of spiral wave breakup in a model of cardiac electrical activity

It has become widely accepted that the most dangerous cardiac arrhythmias are due to re- entrant waves, i.e., electrical wave(s) that re-circulate repeatedly throughout the tissue at a higher frequency than the waves produced by the heart's natural pacemaker (sinoatrial node). However, the complicated structure of cardiac tissue, as well as the complex ionic currents in the cell, has made it extremely difficult to pinpoint the detailed mechanisms of these life-threatening reentrant arrhythmias. A simplified ionic model of the cardiac action potential (AP), which can be fitted to a wide variety of experimentally and numerically obtained mesoscopic characteristics of cardiac tissue such as AP shape and restitution of AP duration and conduction velocity, is used to explain many different mechanisms of spiral wave breakup which in principle can occur in cardiac tissue. Some, but not all, of these mechanisms have been observed before using other models; therefore, the purpose of this paper is to demonstrate them using just one framework model and to explain the different parameter regimes or physiological properties necessary for each mechanism (such as high or low excitability, corresponding to normal or ischemic tissue, spiral tip trajectory types, and tissue structures such as rotational anisotropy and periodic boundary conditions). Each mechanism is compared with data from other ionic models or experiments to illustrate that they are not model-specific phenomena. The fact that many different breakup mechanisms exist has important implications for antiarrhythmic drug design and for comparisons of fibrillation experiments using different species, electromechanical uncoupling drugs, and initiation protocols.Comment: 128 pages, 42 figures (29 color, 13 b&w

Multi-agent persistent monitoring of a finite set of targets

The general problem of multi-agent persistent monitoring finds applications in a variety of domains ranging from meter to kilometer-scale systems, such as surveillance or environmental monitoring, down to nano-scale systems such as tracking biological macromolecules for studying basic biology and disease. The problem can be cast as moving the agents between targets, acquiring information from or in some fashion controlling the states of the targets. Under this formulation, at least two questions need to be addressed. The first is the design of motion trajectories for the agents as they move among the spatially distributed targets and jointly optimize a given cost function that describes some desired application. The second is the design of the controller that an agent will use at a target to steer the target's state as desired. The first question can be viewed in at least two ways: first, as an optimal control problem with the domain of the targets described as a continuous space, and second as a discrete scheduling task. In this work we focus on the second approach, which formulates the target dynamics as a hybrid automaton, and the geometry of the targets as a graph. We show how to find solutions by translating the scheduling problem into a search for the optimal route. With a route specifying the visiting sequence in place, we derive the optimal time the agent spends at each target analytically. The second question, namely that of steering the target's state, can be formulated from the perspective of the target, rather than the agent. The mobile nature of the agents leads to intermittencontrol, such that the controller is assumed to be disconnected when no agent is at the target. The design of the visiting schedule of agents to one target can affect the reachability (controllability) of this target's control system and the design of any specific controller. Existing test techniques for reachability are combined with the idea of lifting to provide conditions on systems such that reachability is maintained in the presence of periodic disconnections from the controller. While considering an intermittently connected control with constraints on the control authority and in the presence of a disturbance, the concept of 'degree of controllability' is introduced. The degree is measured by a region of states that can be brought back to the origin in a given finite time. The size of this region is estimated to evaluate the performance of a given sequence