Chaos-based underwater communication with arbitrary transducers and bandwidth

Acknowledgments: This research is supported in part by National Natural Science Foundation of China (61172070), Innovative Research Team of Shaanxi Province (2013KCT-04), The Key Basic Research Fund of Shaanxi Province (2016ZDJC-01), EPSRC (EP/I032606/1), Chao Bai was supported by Excellent Ph.D. research fund (310-252071603) at XAUT.Peer reviewedPublisher PD

Discovering Regularity in Point Clouds of Urban Scenes

Despite the apparent chaos of the urban environment, cities are actually replete with regularity. From the grid of streets laid out over the earth, to the lattice of windows thrown up into the sky, periodic regularity abounds in the urban scene. Just as salient, though less uniform, are the self-similar branching patterns of trees and vegetation that line streets and fill parks. We propose novel methods for discovering these regularities in 3D range scans acquired by a time-of-flight laser sensor. The applications of this regularity information are broad, and we present two original algorithms. The first exploits the efficiency of the Fourier transform for the real-time detection of periodicity in building facades. Periodic regularity is discovered online by doing a plane sweep across the scene and analyzing the frequency space of each column in the sweep. The simplicity and online nature of this algorithm allow it to be embedded in scanner hardware, making periodicity detection a built-in feature of future 3D cameras. We demonstrate the usefulness of periodicity in view registration, compression, segmentation, and facade reconstruction. The second algorithm leverages the hierarchical decomposition and locality in space of the wavelet transform to find stochastic parameters for procedural models that succinctly describe vegetation. These procedural models facilitate the generation of virtual worlds for architecture, gaming, and augmented reality. The self-similarity of vegetation can be inferred using multi-resolution analysis to discover the underlying branching patterns. We present a unified framework of these tools, enabling the modeling, transmission, and compression of high-resolution, accurate, and immersive 3D images

Use of wavelet-packet transforms to develop an engineering model for multifractal characterization of mutation dynamics in pathological and nonpathological gene sequences

This study uses dynamical analysis to examine in a quantitative fashion the information coding mechanism in DNA sequences. This exceeds the simple dichotomy of either modeling the mechanism by comparing DNA sequence walks as Fractal Brownian Motion (fbm) processes. The 2-D mappings of the DNA sequences for this research are from Iterated Function System (IFS) (Also known as the Chaos Game Representation (CGR)) mappings of the DNA sequences. This technique converts a 1-D sequence into a 2-D representation that preserves subsequence structure and provides a visual representation. The second step of this analysis involves the application of Wavelet Packet Transforms, a recently developed technique from the field of signal processing. A multi-fractal model is built by using wavelet transforms to estimate the Hurst exponent, H. The Hurst exponent is a non-parametric measurement of the dynamism of a system. This procedure is used to evaluate gene-coding events in the DNA sequence of cystic fibrosis mutations. The H exponent is calculated for various mutation sites in this gene. The results of this study indicate the presence of anti-persistent, random walks and persistent sub-periods in the sequence. This indicates the hypothesis of a multi-fractal model of DNA information encoding warrants further consideration.;This work examines the model\u27s behavior in both pathological (mutations) and non-pathological (healthy) base pair sequences of the cystic fibrosis gene. These mutations both natural and synthetic were introduced by computer manipulation of the original base pair text files. The results show that disease severity and system information dynamics correlate. These results have implications for genetic engineering as well as in mathematical biology. They suggest that there is scope for more multi-fractal models to be developed

Recurrence network analysis of EEG signals: A Geometric Approach

Understanding the neuronal dynamics of dynamical diseases like epilepsy is of fundamental importance. For instance, establishing the presence of deterministic chaos can open up possibilities that can lead to potential medical applications, including timely prevention of seizures. Additionally, understanding the dynamics of interictal activity can greatly aid the localization of epileptic foci without the need for recording seizures. Recurrences, a fundamental property of dynamical systems, are useful for characterizing nonlinear systems. Recurrence networks, which are obtained by reinterpreting the recurrence matrix as an adjacency matrix of a complex network, are useful in characterizing the structural or geometric properties of the underlying system. Recurrence network analysis has established itself as a versatile tool in the field of nonlinear time series analysis and its applicability in investigating neural dynamics remains unexplored. Certain recurrence network measures are particularly sensitive to the presence of unstable periodic orbits (UPOs), which are important for detecting determinism and are the backbone of chaotic attractors.In this thesis, we introduce recurrence network analysis as a tool for nonlinear time series analysis of epileptic electroencephalographic (EEG) signals. We present novel results based on the application of recurrence network analysis combined with surrogate testing to intracranial and extracranial epileptic EEG signals. In addition, using paradigmatic examples of dynamical systems, we present theoretical results exploring the effect of increasing noise levels on recurrence network measures.Using paradigmatic model systems, we first demonstrate that recurrence network measures can distinguish between deterministic (chaos) and stochastic processes, even at short data lengths (≈ 200 samples). In particular, our results from theoretical simulations show that recurrence network measures, particularly transitivity, local clustering coefficient, assortativity, and betweenness centrality can successfully distinguish between deterministic chaotic and stochastic processes (after additional embedding) due to their sensitivity to the presence of UPOs. Our results also show that recurrence network measures like transitivity and average path length are robust against noise and perform better than the Complexity-Entropy plane method at short data lengths. Furthermore, our results show that the effect of noise on the recurrence network measures can be minimized by increasing the recurrence rate.For the analysis of real-world data such as EEG signals, we combined the recurrence network approach with surrogate data to test for the structural complexity in healthy and epileptic EEG signals. Here our results point to an increasing complexity of EEG recordings when moving from healthy to epileptic conditions. Furthermore, we used both univariate network measure and bivariate cross-network measure to distinguish between the structural properties of interictal EEG signals recorded from epileptic and nonepileptic brain areas. Here, our results clearly demonstrated that interictal EEG signals recorded from epileptic areas are more deterministic and interdependent compared to interictal activity recorded from nonepileptic areas. Finally, we show that recurrence network analysis can be applied to uncover the dynamical transitions in neural signals using short segments of data (≈ 150 to 500 samples). To demonstrate this, we used two kinds of neural data - epileptic EEG data and local field potential (LFP) signals recorded during a visuomotor task. We observed that the temporal fluctuations observed in the recurrence network measures are consistent with the dynamical transitions underlying the epileptic and task-based LFP signals.To conclude, recurrence network analysis analysis can capture the complexity in the organization of EEG data in different dynamical states in a more elaborated fashion compared to other approaches such as nonlinear prediction error or correlation dimension. By means of the recurrence network measures, this difference can be assessed not only qualitatively (as when using as tests for nonlinearity), but also quantitatively. Thus, coupled with its ability to operate on short-window sizes and robustness to noise, recurrence network analysis can be a powerful tool to analyze the dynamics of multi-scale neural signals

Metamodern Strategy: A System Of Multi-Ontological Sense Making

Multi-ontological sense making in irreducible social systems requires the use of different worldviews to generate contextually appropriate understandings and insights for action in different systems states. While models exist for describing complex dynamics in social systems, no frameworks or aids exist to explain the system of worldviews. This dissertation developed a conceptual scheme that will aid in multi-ontological sense making in social systems. This conceptual scheme has both theoretical and practical implications for visualizing, understanding, and responding to social systems and ultimately to complexity. To develop this new conceptual scheme, a qualitative meta-synthesis approach was adopted to develop theory and to develop a framework for classifying management approaches, tools and techniques to corresponding worldviews for use in dynamic and complicated social systems. The research design was sequential, with four phases. In phase one a content analysis of 16 worldviews was conducted to develop a classification framework for worldviews. In phase two the worldview classification framework was then applied to 35 strategy consulting approaches to categorize the approaches to differing underlying worldviews and to understand the ontological mapping of the differing approaches. Phase three was analyzing the data, the results of which showed that strategy consulting engagements cast sense making in social systems primarily into three simplified quadrants: the simple, complex, and complicated. The results further showed that only the process consulting approaches adopted a multi-dimensional, worldview-driven approach to social systems, an approach that moved beyond the simplified states of the expert, doctor-patient, and emergent approaches to strategy consulting. In phase four a new theory of sense making was developed: the aspectus system. The aspectus system stresses the importance of segregating sense making activities in social systems into two distinct worldview-driven categories: (a) simplified sense making which informs and is followed by (b) metamodern sense making. In doing so, the Aspectus system separates worldview-driven sense making in social systems into a separate domain, emphasizing that social systems must be considered as both complex and complicated and also as distinct from other types of systems. The aspectus system application in shared sense making was then tested in a thought experiment to demonstrate how it should be applied in practice. The results indicate that a worldview-driven, metamodern approach to multi- ontological sense making in irreducible complex and complicated social systems generates contextually appropriate models for understanding, insights, and actions

A chaos theory and nonlinear dynamics approach to the analysis of financial series : a comparative study of Athens and London stock markets

This dissertation presents an effort to implement nonlinear dynamic tools adapted from chaos theory in financial applications. Chaos theory might be useful in explaining the dynamics of financial markets, since chaotic models are capable of exhibiting behaviour similar to that observed in empirical financial data. In this context, the scope of this research is to provide an insight into the role that nonlinearities and, in particular, chaos theory may play in explaining the dynamics of financial markets. From a theoretical point of view, the basic features of chaos theory, as well as, the rationales for bringing chaos theory to the attention of financial researchers are discussed. Empirically, the fundamental issue of determining whether chaos can be observed in financial time series is addressed. Regarding the latter, empirical literature has been controversial. A quite exhaustive analysis of the existing literature is provided, revealing the inadequacies in terms of methodology and the testing framework adopted, so far. A new "multiple testing" methodology is developed combining methods and techniques from the fields of both Natural Sciences and the Economics, most of which have not been applied to financial data before. A serious effort has been made to fill, as much as possible, the gap which results from the lack of a proper statistical framework for the chaotic methods. To achieve this the bootstrap methodology is adopted. The empirical part of this work focuses on the comparison of two markets with different levels of maturity; the Athens Stock Exchange (ASE), an emerging market, and London Stock Exchange (LSE). Our aim is to determine whether structural differences exist in these markets in terms of chaotic dynamics. In the empirical level we find nonlinearities in both markets by the use of the BDS test. R/S analysis reveals fractality and long term memory for the ASE series only. Chaotic methods, such as the correlation dimension (and related methods and techniques) and the largest Lyapunov exponent estimation, cannot rule out a chaotic explanation for the ASE market, but no such indication could be found for the LSE market. Noise filtering by the SVD method does not alter these findings. Alternative techniques based on nonlinear nearest neighbour forecasting methods, such as the "piecewise polynomial approximation" and the "simplex" methods, support our aforementioned conclusion concerning the ASE series. In all, our results suggest that, although nonlinearities are present, chaos is not a widespread phenomenon in financial markets and it is more likely to exist in less developed markets such as the ASE. Even then, chaos is strongly mixed with noise and the existence of low-dimensional chaos is highly unlikely. Finally, short-term forecasts trying to exploit the dependencies found in both markets seem to be of no economic importance after accounting for transaction costs, a result which supports further our conclusions about the limited scope and practical implications of chaos in Finance

Recurrent neural networks: methods and applications to non-linear predictions

This thesis deals with recurrent neural networks, a particular class of artificial neural networks which can learn a generative model of input sequences. The input is mapped, through a feedback loop and a non-linear activation function, into a hidden state, which is then projected into the output space, obtaining either a probability distribution or the new input for the next time-step. This work consists mainly of two parts: a theoretical study for helping the understanding of recurrent neural networks framework, which is not yet deeply investigated, and their application to non-linear prediction problems, since recurrent neural networks are really powerful models suitable for solving several practical tasks in different fields. For what concerns the theoretical part, we analyse the weaknesses of state-of-the-art models and tackle them in order to improve the performance of a recurrent neural network. Firstly, we contribute in the understanding of the dynamical properties of a recurrent neural network, highlighting the close relation between the definition of stable limit cycles and the echo state property of an echo state network. We provide sufficient conditions for the convergence of the hidden state to a trajectory, which is uniquely determined by the input signal, independently of the initial states. This may help extend the memory of the network and increase the design options for the network. Moreover, we develop a novel approach to address the main problem in training recurrent neural networks, the so-called vanishing gradient problem. Our new method allows us to train a very simple recurrent neural network, making the gradient not to vanish even after many time-steps. Exploiting the singular value decomposition of the vanishing factors in the gradient and random matrices theory, we find that the singular values have to be confined in a narrow interval and derive conditions about their root mean square value. Then, we also improve the efficiency of the training of a recurrent neural network, defining a new method for speeding up this process. Thanks to a least square regularization, we can initialize the parameters of the network, in order to set them closer to the minimum and running fewer epochs of classical training algorithms. Moreover, it is also possible to completely train the network with our initialization method, running more iterations of it without losing in performance with respect to classical training algorithms. Finally, it is also possible to use it as a real-time learning algorithm, adjusting the parameters to the new data through one iteration of our initialization. In the last part of this thesis, we apply recurrent neural networks to non-linear prediction problems. We consider prediction of numerical sequences, estimating the following input choosing it from a probability distribution. We study an automatic text generation problem, where we need to predict the following character in order to compose words and sentences, and a path prediction of walking mobile users in the central area of a city, as a sequence of crossroads. Then, we analyse the prediction of video frames, discovering a wide range of applications related to the prediction of movements. We study the collision problem of bouncing balls, taking into account only the sequence of video frames without any knowledge about the physical characteristics of the problem, and the distribution over days of mobile user in a city and in a whole region. Finally, we address the state-of-the-art problem of missing data imputation, analysing the incomplete spectrogram of audio signals. We restore audio signals with missing time-frequency data, demonstrating via numerical experiments that a performance improvement can be achieved involving recurrent neural networks

Acoustic sequences in non-human animals: a tutorial review and prospectus.

Animal acoustic communication often takes the form of complex sequences, made up of multiple distinct acoustic units. Apart from the well-known example of birdsong, other animals such as insects, amphibians, and mammals (including bats, rodents, primates, and cetaceans) also generate complex acoustic sequences. Occasionally, such as with birdsong, the adaptive role of these sequences seems clear (e.g. mate attraction and territorial defence). More often however, researchers have only begun to characterise - let alone understand - the significance and meaning of acoustic sequences. Hypotheses abound, but there is little agreement as to how sequences should be defined and analysed. Our review aims to outline suitable methods for testing these hypotheses, and to describe the major limitations to our current and near-future knowledge on questions of acoustic sequences. This review and prospectus is the result of a collaborative effort between 43 scientists from the fields of animal behaviour, ecology and evolution, signal processing, machine learning, quantitative linguistics, and information theory, who gathered for a 2013 workshop entitled, 'Analysing vocal sequences in animals'. Our goal is to present not just a review of the state of the art, but to propose a methodological framework that summarises what we suggest are the best practices for research in this field, across taxa and across disciplines. We also provide a tutorial-style introduction to some of the most promising algorithmic approaches for analysing sequences. We divide our review into three sections: identifying the distinct units of an acoustic sequence, describing the different ways that information can be contained within a sequence, and analysing the structure of that sequence. Each of these sections is further subdivided to address the key questions and approaches in that area. We propose a uniform, systematic, and comprehensive approach to studying sequences, with the goal of clarifying research terms used in different fields, and facilitating collaboration and comparative studies. Allowing greater interdisciplinary collaboration will facilitate the investigation of many important questions in the evolution of communication and sociality.This review was developed at an investigative workshop, “Analyzing Animal Vocal Communication Sequences” that took place on October 21–23 2013 in Knoxville, Tennessee, sponsored by the National Institute for Mathematical and Biological Synthesis (NIMBioS). NIMBioS is an Institute sponsored by the National Science Foundation, the U.S. Department of Homeland Security, and the U.S. Department of Agriculture through NSF Awards #EF-0832858 and #DBI-1300426, with additional support from The University of Tennessee, Knoxville. In addition to the authors, Vincent Janik participated in the workshop. D.T.B.’s research is currently supported by NSF DEB-1119660. M.A.B.’s research is currently supported by NSF IOS-0842759 and NIH R01DC009582. M.A.R.’s research is supported by ONR N0001411IP20086 and NOPP (ONR/BOEM) N00014-11-1-0697. S.L.DeR.’s research is supported by the U.S. Office of Naval Research. R.F.-i-C.’s research was supported by the grant BASMATI (TIN2011-27479-C04-03) from the Spanish Ministry of Science and Innovation. E.C.G.’s research is currently supported by a National Research Council postdoctoral fellowship. E.E.V.’s research is supported by CONACYT, Mexico, award number I010/214/2012.This is the accepted manuscript. The final version is available at http://dx.doi.org/10.1111/brv.1216