Search

Research investigating the dynamics of coupled physical systems has demonstrated that small feedback delays can allow a dynamic response system to anticipate chaotic behavior. This counterintuitive phenomenon, termed anticipatory synchronization, has been observed in coupled electrical circuits, laser semi-conductors, and artificial neurons. Recent research indicates that the same process might also support the ability of humans to anticipate the occurrence of chaotic behavior in other individuals. Motivated by this latter work, the current study examined whether the process of feedback delay induced anticipatory synchronization could be employed to develop an interactive artificial agent capable of anticipating chaotic human movement. Results revealed that incorporating such delays within the movement-control dynamics of an artificial agent not only enhances an artificial agent’s ability to anticipate chaotic human behavior, but to synchronize with such behavior in a manner similar to natural human-human anticipatory synchronization. The implication of these findings for the development of human-machine interaction systems is discussed. [ABSTRACT FROM AUTHOR]

Code modulated Visual Evoked Potentials (c-VEP) based BCI studies usually employ m-sequences as a modulating codes for their broadband spectrum and correlation property. However, subjective fatigue of the presented codes has been a problem. In this study, we introduce chaotic codes containing broadband spectrum and similar correlation property. We examined whether the introduced chaotic codes could be decoded from EEG signals and also compared the subjective fatigue level with m-sequence codes in normal subjects. We generated chaotic code from one-dimensional logistic map and used it with conventional 31-bit m-sequence code. In a c-VEP based study in normal subjects (n = 44, 21 females) we presented these codes visually and recorded EEG signals from the corresponding codes for their four lagged versions. Canonical correlation analysis (CCA) and spatiotemporal beamforming (STB) methods were used for target identification and comparison of responses. Additionally, we compared the subjective self-declared fatigue using VAS caused by presented m-sequence and chaotic codes. The introduced chaotic code was decoded from EEG responses with CCA and STB methods. The maximum total accuracy values of 93.6 ± 11.9% and 94 ± 14.4% were achieved with STB method for chaotic and m-sequence codes for all subjects respectively. The achieved accuracies in all subjects were not significantly different in m-sequence and chaotic codes. There was significant reduction in subjective fatigue caused by chaotic codes compared to the m-sequence codes. Both m-sequence and chaotic codes were similar in their accuracies as evaluated by CCA and STB methods. The chaotic codes significantly reduced subjective fatigue compared to the m-sequence codes. [ABSTRACT FROM AUTHOR]

Recently, Lu et al. claimed that Xie et al.’s three-party password-authenticated key agreement protocol (3PAKA) using chaotic maps has three security vulnerabilities; in particular, it cannot resist offline password guessing attack, Bergamo et al.’s attack and impersonation attack, and then they proposed an improved protocol. However, we demonstrate that Lu et al.’s attacks on Xie et al.’s scheme are unworkable, and their improved protocol is insecure against stolen-verifier attack and off-line password guessing attack. Furthermore, we propose a novel scheme with enhanced security and efficiency. We use formal verification tool ProVerif, which is based on pi calculus, to prove security and authentication of our scheme. The efficiency of the proposed scheme is higher than other related schemes. [ABSTRACT FROM AUTHOR]

In this paper, a new four-variable dynamical system is proposed to set chaotic circuit composed of memristor and Josephson junction, and the dependence of chaotic behaviors on nonlinearity is investigated. A magnetic flux-controlled memristor is used to couple with the RCL-shunted junction circuit, and the dynamical behaviors can be modulated by changing the coupling intensity between the memristor and the RCL-shunted junction. Bifurcation diagram and Lyapunov exponent are calculated to confirm the emergence of chaos in the improved dynamical system. The outputs and dynamical behaviors can be controlled by the initial setting and external stimulus as well. As a result, chaos can be suppressed and spiking occurs in the sampled outputs under negative feedback, while applying positive feedback type via memristor can be effective to trigger chaos. Furthermore, it is found that the number of multi-attractors in the Jerk circuit can be modulated when memristor coupling is applied on the circuit. These results indicate that memristor coupling can be effective to control chaotic circuits and it is also useful to reproduce dynamical behaviors for neuronal activities. [ABSTRACT FROM AUTHOR]

In this paper, we study a network of Izhikevich neurons to explore what it means for a brain to be at the edge of chaos. To do so, we first constructed the phase diagram of a single Izhikevich excitatory neuron, and identified a small region of the parameter space where we find a large number of phase boundaries to serve as our edge of chaos. We then couple the outputs of these neurons directly to the parameters of other neurons, so that the neuron dynamics can drive transitions from one phase to another on an artificial energy landscape. Finally, we measure the statistical complexity of the parameter time series, while the network is tuned from a regular network to a random network using the Watts-Strogatz rewiring algorithm. We find that the statistical complexity of the parameter dynamics is maximized when the neuron network is most small-world-like. Our results suggest that the small-world architecture of neuron connections in brains is not accidental, but may be related to the information processing that they do. [ABSTRACT FROM AUTHOR]

Small-angle scattering (SAS) technique is applied to study the nano and microstructural properties of spatial patterns generated from chaos game representation (CGR). Using a simplified version of Debye formula, we calculate and analyze in momentum space, the monodisperse scattering structure factor from a system of randomly oriented and non-interacting 2D Sierpinski gaskets (SG). We show that within CGR approach, the main geometrical and fractal properties, such as the overall size, scaling factor, minimal distance between scattering units, fractal dimension and the number of units composing the SG, can be recovered. We confirm the numerical results, by developing a theoretical model which describes analytically the structure factor of SG. We apply our findings to scattering from single scale mass fractals, and respectively to a multiscale fractal representing DNA sequences, and for which an analytic description of the structure factor is not known a priori. [ABSTRACT FROM AUTHOR]

Scientific analysis often relies on the ability to make accurate predictions of a system’s dynamics. Mechanistic models, parameterized by a number of unknown parameters, are often used for this purpose. Accurate estimation of the model state and parameters prior to prediction is necessary, but may be complicated by issues such as noisy data and uncertainty in parameters and initial conditions. At the other end of the spectrum exist nonparametric methods, which rely solely on data to build their predictions. While these nonparametric methods do not require a model of the system, their performance is strongly influenced by the amount and noisiness of the data. In this article, we consider a hybrid approach to modeling and prediction which merges recent advancements in nonparametric analysis with standard parametric methods. The general idea is to replace a subset of a mechanistic model’s equations with their corresponding nonparametric representations, resulting in a hybrid modeling and prediction scheme. Overall, we find that this hybrid approach allows for more robust parameter estimation and improved short-term prediction in situations where there is a large uncertainty in model parameters. We demonstrate these advantages in the classical Lorenz-63 chaotic system and in networks of Hindmarsh-Rose neurons before application to experimentally collected structured population data. [ABSTRACT FROM AUTHOR]

Predicting extrema of chaotic systems in high-dimensional phase space remains a challenge. Methods, which give extrema that are valid in the long term, have thus far been restricted to models of only a few variables. Here, a method is presented which treats extrema of chaotic systems as belonging to discretised manifolds of low dimension (low-D) embedded in high-dimensional (high-D) phase space. As a central feature, the method exploits that strange attractor dimension is generally much smaller than parent system phase space dimension. This is important, since the computational cost associated with discretised manifolds depends exponentially on their dimension. Thus, systems that would otherwise be associated with tremendous computational challenges, can be tackled on a laptop. As a test, bounding manifolds are calculated for high-D modifications of the canonical Duffing system. Parameters can be set such that the bounding manifold displays harmonic behaviour even if the underlying system is chaotic. Thus, solving for one post-transient forcing cycle of the bounding manifold predicts the extrema of the underlying chaotic problem indefinitely. [ABSTRACT FROM AUTHOR]

It has been proposed that neural noise in the cortex arises from chaotic dynamics in the balanced state: in this model of cortical dynamics, the excitatory and inhibitory inputs to each neuron approximately cancel, and activity is driven by fluctuations of the synaptic inputs around their mean. It remains unclear whether neural networks in the balanced state can perform tasks that are highly sensitive to noise, such as storage of continuous parameters in working memory, while also accounting for the irregular behavior of single neurons. Here we show that continuous parameter working memory can be maintained in the balanced state, in a neural circuit with a simple network architecture. We show analytically that in the limit of an infinite network, the dynamics generated by this architecture are characterized by a continuous set of steady balanced states, allowing for the indefinite storage of a continuous parameter. In finite networks, we show that the chaotic noise drives diffusive motion along the approximate attractor, which gradually degrades the stored memory. We analyze the dynamics and show that the slow diffusive motion induces slowly decaying temporal cross correlations in the activity, which differ substantially from those previously described in the balanced state. We calculate the diffusivity, and show that it is inversely proportional to the system size. For large enough (but realistic) neural population sizes, and with suitable tuning of the network connections, the proposed balanced network can sustain continuous parameter values in memory over time scales larger by several orders of magnitude than the single neuron time scale. [ABSTRACT FROM AUTHOR]

Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression. [ABSTRACT FROM AUTHOR]

Highly connected recurrent neural networks often produce chaotic dynamics, meaning their precise activity is sensitive to small perturbations. What are the consequences of chaos for how such networks encode streams of temporal stimuli? On the one hand, chaos is a strong source of randomness, suggesting that small changes in stimuli will be obscured by intrinsically generated variability. On the other hand, recent work shows that the type of chaos that occurs in spiking networks can have a surprisingly low-dimensional structure, suggesting that there may be room for fine stimulus features to be precisely resolved. Here we show that strongly chaotic networks produce patterned spikes that reliably encode time-dependent stimuli: using a decoder sensitive to spike times on timescales of 10’s of ms, one can easily distinguish responses to very similar inputs. Moreover, recurrence serves to distribute signals throughout chaotic networks so that small groups of cells can encode substantial information about signals arriving elsewhere. A conclusion is that the presence of strong chaos in recurrent networks need not exclude precise encoding of temporal stimuli via spike patterns. [ABSTRACT FROM AUTHOR]

Complex nonlinear phenomena are investigated in a basic power system model of the single-machine-infinite-bus (SMIB) with a synchronous generator modeled by a classical third-order differential equation including both angle dynamics and voltage dynamics, the so-called flux decay equation. In contrast, for the second-order differential equation considering the angle dynamics only, it is the classical swing equation. Similarities and differences of the dynamics generated between the third-order model and the second-order one are studied. We mainly find that, for positive damping, these two models show quite similar behavior, namely, stable fixed point, stable limit cycle, and their coexistence for different parameters. However, for negative damping, the second-order system can only collapse, whereas for the third-order model, more complicated behavior may happen, such as stable fixed point, limit cycle, quasi-periodicity, and chaos. Interesting partial collapse phenomena for angle instability only and not for voltage instability are also found here, including collapse from quasi-periodicity and from chaos etc. These findings not only provide a basic physical picture for power system dynamics in the third-order model incorporating voltage dynamics, but also enable us a deeper understanding of the complex dynamical behavior and even leading to a design of oscillation damping in electric power systems. [ABSTRACT FROM AUTHOR]

Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, control of uncertain fractional-order financial chaotic system with input saturation and external disturbance is investigated. The unknown part of the input saturation as well as the system’s unknown nonlinear function is approximated by a fuzzy logic system. To handle the fuzzy approximation error and the estimation error of the unknown upper bound of the external disturbance, fractional-order adaptation laws are constructed. Based on fractional Lyapunov stability theorem, an adaptive fuzzy controller is designed, and the asymptotical stability can be guaranteed. Finally, simulation studies are given to indicate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Due to a set of constant initial values, the performance of conventional TCP drops significantly encountering heterogeneous network, showing low throughput and unfairness. This paper firstly demonstrates the chaotic character of TCP congestion control in heterogeneous network, especially the sensitivity to initial value. Inspired by merit of nature-inspired algorithm, a novel structure of TCP congestion control (IPPM, Internet Prey-Predator Model) is proposed. Parameters such as available link capacity(C), congestion window (W) and queue length (Q) are collected by IPPM, which calculates the max value of C according to the interacting relationship existing in C, W and Q, and IPPM initiates the TCP ssthresh with the calculated value. Plenty of simulation results show that the modified TCP can effectively avoid network congestion and packet loss. Besides, it holds high resource utilization, convergence speeds, fairness and stability. [ABSTRACT FROM AUTHOR]

We present preliminary results from a method for estimating the optimal effective permittivity for reconstructing microwave-radar images. Using knowledge of how microwave-radar images are formed, we identify characteristics that are typical of good images, and define a fitness function to measure the relative image quality. We build a polynomial interpolant of the fitness function in order to identify the most likely permittivity values of the tissue. To make the estimation process more efficient, the polynomial interpolant is constructed using a locally and dimensionally adaptive sampling method that is a novel combination of stochastic collocation and polynomial chaos. Examples, using a series of simulated, experimental and patient data collected using the Tissue Sensing Adaptive Radar system, which is under development at the University of Calgary, are presented. These examples show how, using our method, accurate images can be reconstructed starting with only a broad estimate of the permittivity range. [ABSTRACT FROM AUTHOR]

Exploration and exploitation are two essential components for any optimization algorithm. Much exploration leads to oscillation and premature convergence while too much exploitation slows down the optimization algorithm and the optimizer may be stuck in local minima. Therefore, balancing the rates of exploration and exploitation at the optimization lifetime is a challenge. This study evaluates the impact of using chaos-based control of exploration/exploitation rates against using the systematic native control. Three modern algorithms were used in the study namely grey wolf optimizer (GWO), antlion optimizer (ALO) and moth-flame optimizer (MFO) in the domain of machine learning for feature selection. Results on a set of standard machine learning data using a set of assessment indicators prove advance in optimization algorithm performance when using variational repeated periods of declined exploration rates over using systematically decreased exploration rates. [ABSTRACT FROM AUTHOR]

User anonymity is one of the key security features of an authenticated key agreement especially for communicating messages via an insecure network. Owing to the better properties and higher performance of chaotic theory, the chaotic maps have been introduced into the security schemes, and hence numerous key agreement schemes have been put forward under chaotic-maps. Recently, Xie et al. released an enhanced scheme under Farash et al.’s scheme and claimed their improvements could withstand the security loopholes pointed out in the scheme of Farash et al., i.e., resistance to the off-line password guessing and user impersonation attacks. Nevertheless, through our careful analysis, the improvements were released by Xie et al. still could not solve the problems troubled in Farash et al‥ Besides, Xie et al.’s improvements failed to achieve the user anonymity and the session key security. With the purpose of eliminating the security risks of the scheme of Xie et al., we design an anonymous password-based three-party authenticated key agreement under chaotic maps. Both the formal analysis and the formal security verification using AVISPA are presented. Also, BAN logic is used to show the correctness of the enhancements. Furthermore, we also demonstrate that the design thwarts most of the common attacks. We also make a comparison between the recent chaotic-maps based schemes and our enhancements in terms of performance. [ABSTRACT FROM AUTHOR]

Background: Selecting a subset of relevant properties from a large set of features that describe a dataset is a challenging machine learning task. In biology, for instance, the advances in the available technologies enable the generation of a very large number of biomarkers that describe the data. Choosing the more informative markers along with performing a high-accuracy classification over the data can be a daunting task, particularly if the data are high dimensional. An often adopted approach is to formulate the feature selection problem as a biobjective optimization problem, with the aim of maximizing the performance of the data analysis model (the quality of the data training fitting) while minimizing the number of features used. Results: We propose an optimization approach for the feature selection problem that considers a “chaotic” version of the antlion optimizer method, a nature-inspired algorithm that mimics the hunting mechanism of antlions in nature. The balance between exploration of the search space and exploitation of the best solutions is a challenge in multi-objective optimization. The exploration/exploitation rate is controlled by the parameter I that limits the random walk range of the ants/prey. This variable is increased iteratively in a quasi-linear manner to decrease the exploration rate as the optimization progresses. The quasi-linear decrease in the variable I may lead to immature convergence in some cases and trapping in local minima in other cases. The chaotic system proposed here attempts to improve the tradeoff between exploration and exploitation. The methodology is evaluated using different chaotic maps on a number of feature selection datasets. To ensure generality, we used ten biological datasets, but we also used other types of data from various sources. The results are compared with the particle swarm optimizer and with genetic algorithm variants for feature selection using a set of quality metrics. [ABSTRACT FROM AUTHOR]

We sought to uncover the impact of the social environment on the spatial behavior of rats. Food-deprived rats were trained in a spatial task of collecting food items from 16 equispaced objects. Following training, they were tested, first alone and then with a similarly-trained cage-mate. It was found that the presence of another rat substantially altered the rats' spatial behavior. Lone rats collected the food items faster while traveling a shorter distance, reflecting a higher efficiency of task completion. When accompanied by a partner, however, the rats traveled together, visiting the same set of objects in each trip with one of them leading. Whether alone or with a partner, rats continued to revisit the same objects; however, more such revisits occurred with a partner. We argue that revisiting objects is not necessarily an error, since returning to past places is an important aspect of rats’ natural behavior. Revisiting an object following food depletion implies that searching for food was not the main driving force in the rats' spatial behavior. Specifically, despite food deprivation, rats were more attentive to one another than to the food. This could be adaptive, since foraging and feeding in groups is a way of poison avoidance in wild rats. Finally, the addition of a social component added complexity to the environment since the rats organized their spatial behavior in reference to one another in addition to their organization in the physical surrounding. Consequently, when tested with a partner, spatial behavior was less structured, less predictable and more chaotic. [ABSTRACT FROM AUTHOR]

In stochastic resonance (SR), the presence of noise helps a nonlinear system amplify a weak (sub-threshold) signal. Chaotic resonance (CR) is a phenomenon similar to SR but without stochastic noise, which has been observed in neural systems. However, no study to date has investigated and compared the characteristics and performance of the signal responses of a spiking neural system in some chaotic states in CR. In this paper, we focus on the Izhikevich neuron model, which can reproduce major spike patterns that have been experimentally observed. We examine and classify the chaotic characteristics of this model by using Lyapunov exponents with a saltation matrix and Poincaré section methods in order to address the measurement challenge posed by the state-dependent jump in the resetting process. We found the existence of two distinctive states, a chaotic state involving primarily turbulent movement and an intermittent chaotic state. In order to assess the signal responses of CR in these classified states, we introduced an extended Izhikevich neuron model by considering weak periodic signals, and defined the cycle histogram of neuron spikes as well as the corresponding mutual correlation and information. Through computer simulations, we confirmed that both chaotic states in CR can sensitively respond to weak signals. Moreover, we found that the intermittent chaotic state exhibited a prompter response than the chaotic state with primarily turbulent movement. [ABSTRACT FROM AUTHOR]

This study offers a new perspective on the evolutionary patterns of cities or urban agglomerations. Such developments can range from chaotic to fully ordered. We demonstrate that in a dynamic space of interactive human behaviour cities produce a wealth of gravitational attractors whose size and shape depend on the resistance of space emerging inter alia from transport friction costs. This finding offers original insights into the complex evolution of spatial systems and appears to be consistent with the principles of central place theory known from the spatial sciences and geography. Our approach is dynamic in nature and forms a generalisation of hierarchical principles in geographic space. [ABSTRACT FROM AUTHOR]

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks. [ABSTRACT FROM AUTHOR]

Parameter estimation for fractional-order chaotic systems is an important issue in fractional-order chaotic control and synchronization and could be essentially formulated as a multidimensional optimization problem. A novel algorithm called quantum parallel particle swarm optimization (QPPSO) is proposed to solve the parameter estimation for fractional-order chaotic systems. The parallel characteristic of quantum computing is used in QPPSO. This characteristic increases the calculation of each generation exponentially. The behavior of particles in quantum space is restrained by the quantum evolution equation, which consists of the current rotation angle, individual optimal quantum rotation angle, and global optimal quantum rotation angle. Numerical simulation based on several typical fractional-order systems and comparisons with some typical existing algorithms show the effectiveness and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Recently, great concerns have been raised regarding the issue of medical image protection due to the increasing demand for telemedicine services, especially the teleradiology service. To meet this challenge, a novel chaos-based approach is suggested in this paper. To address the security and efficiency problems encountered by many existing permutation-diffusion type image ciphers, the new scheme utilizes a single 3D chaotic system, Chen's chaotic system, for both permutation and diffusion. In the permutation stage, we introduce a novel shuffling mechanism, which shuffles each pixel in the plain image by swapping it with another pixel chosen by two of the three state variables of Chen's chaotic system. The remaining variable is used for quantification of pseudorandom keystream for diffusion. Moreover, the selection of state variables is controlled by plain pixel, which enhances the security against known/chosen-plaintext attack. Thorough experimental tests are carried out and the results indicate that the proposed scheme provides an effective and efficient way for real-time secure medical image transmission over public networks. [ABSTRACT FROM AUTHOR]

Visually-induced illusions of self-motion (vection) can be compelling for some people, but they are subject to large individual variations in strength. Do these variations depend, at least in part, on the extent to which people rely on vision to maintain their postural stability? We investigated by comparing physical posture measures to subjective vection ratings. Using a Bertec balance plate in a brightly-lit room, we measured 13 participants' excursions of the centre of foot pressure (CoP) over a 60-second period with eyes open and with eyes closed during quiet stance. Subsequently, we collected vection strength ratings for large optic flow displays while seated, using both verbal ratings and online throttle measures. We also collected measures of postural sway (changes in anterior-posterior CoP) in response to the same visual motion stimuli while standing on the plate. The magnitude of standing sway in response to expanding optic flow (in comparison to blank fixation periods) was predictive of both verbal and throttle measures for seated vection. In addition, the ratio between eyes-open and eyes-closed CoP excursions during quiet stance (using the area of postural sway) significantly predicted seated vection for both measures. Interestingly, these relationships were weaker for contracting optic flow displays, though these produced both stronger vection and more sway. Next we used a non-linear analysis (recurrence quantification analysis, RQA) of the fluctuations in anterior-posterior position during quiet stance (both with eyes closed and eyes open); this was a much stronger predictor of seated vection for both expanding and contracting stimuli. Given the complex multisensory integration involved in postural control, our study adds to the growing evidence that non-linear measures drawn from complexity theory may provide a more informative measure of postural sway than the conventional linear measures. [ABSTRACT FROM AUTHOR]

A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque et al., Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa et al., Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the distinction between deterministic and stochastic components in time series [L. Lacasa and R. Toral, Phys. Rev. E., 82, 036120 (2010)]. Specifically, the authors propose that the node degree distribution of these processes follows an exponential functional of the form , in which is the node degree and is a positive parameter able to distinguish between deterministic (chaotic) and stochastic (uncorrelated and correlated) dynamics. In this work, we investigate the characteristics of the node degree distributions constructed by using HVG, for time series corresponding to chaotic maps, 2 chaotic flows and different stochastic processes. We thoroughly study the methodology proposed by Lacasa and Toral finding several cases for which their hypothesis is not valid. We propose a methodology that uses the HVG together with Information Theory quantifiers. An extensive and careful analysis of the node degree distributions obtained by applying HVG allow us to conclude that the Fisher-Shannon information plane is a remarkable tool able to graphically represent the different nature, deterministic or stochastic, of the systems under study. [ABSTRACT FROM AUTHOR]

Patients with chronic heart failure (CHF) exhibit a morning surge in ventricular arrhythmias, but the underlying cause remains unknown. The aim of this study was to determine if heart rate dynamics, autonomic input (assessed by heart rate variability (HRV)) and nonlinear dynamics as well as their abnormal time-of-day-dependent oscillations in a newly developed arrhythmogenic canine heart failure model are associated with a morning surge in ventricular arrhythmias. CHF was induced in dogs by aortic insufficiency & aortic constriction, and assessed by echocardiography. Holter monitoring was performed to study time-of-day-dependent variation in ventricular arrhythmias (PVCs, VT), traditional HRV measures, and nonlinear dynamics (including detrended fluctuations analysis α1 and α2 (DFAα1 & DFAα2), correlation dimension (CD), and Shannon entropy (SE)) at baseline, as well as 240 days (240d) and 720 days (720d) following CHF induction. LV fractional shortening was decreased at both 240d and 720d. Both PVCs and VT increased with CHF duration and showed a morning rise (2.5-fold & 1.8-fold increase at 6 AM-noon vs midnight-6 AM) during CHF. The morning rise in HR at baseline was significantly attenuated by 52% with development of CHF (at both 240d & 720d). Morning rise in the ratio of low frequency to high frequency (LF/HF) HRV at baseline was markedly attenuated with CHF. DFAα1, DFAα2, CD and SE all decreased with CHF by 31, 17, 34 and 7%, respectively. Time-of-day-dependent variations in LF/HF, CD, DFA α1 and SE, observed at baseline, were lost during CHF. Thus in this new arrhythmogenic canine CHF model, attenuated morning HR rise, blunted autonomic oscillation, decreased cardiac chaos and complexity of heart rate, as well as aberrant time-of-day-dependent variations in many of these parameters were associated with a morning surge of ventricular arrhythmias. [ABSTRACT FROM AUTHOR]

In this study we present evidence that anthropogenic stressors can reduce the resilience of age-structured populations. Enhancement of disturbance in a model-based Daphnia population lead to a repression of chaotic population dynamics at the same time increasing the degree of synchrony between the population's age classes. Based on the theory of chaos-mediated survival an increased risk of extinction was revealed for this population exposed to high concentrations of a chemical stressor. The Lyapunov coefficient was supposed to be a useful indicator to detect disturbance thresholds leading to alterations in population dynamics. One possible explanation could be a discrete change in attractor orientation due to external disturbance. The statistical analysis of Lyapunov coefficient distribution is proposed as a methodology to test for significant non-linear effects of general disturbance on populations. Although many new questions arose, this study forms a theoretical basis for a dynamical definition of population recovery. [ABSTRACT FROM AUTHOR]

Stride intervals of normal human walking exhibit long-range temporal correlations. Similar to the fractal-like behaviors observed in brain and heart activity, long-range correlations in walking have commonly been interpreted to result from chaotic dynamics and be a signature of health. Several mathematical models have reproduced this behavior by assuming a dominant role of neural central pattern generators (CPGs) and/or nonlinear biomechanics to evoke chaos. In this study, we show that a simple walking model without a CPG or biomechanics capable of chaos can reproduce long-range correlations. Stride intervals of the model revealed long-range correlations observed in human walking when the model had moderate orbital stability, which enabled the current stride to affect a future stride even after many steps. This provides a clear counterexample to the common hypothesis that a CPG and/or chaotic dynamics is required to explain the long-range correlations in healthy human walking. Instead, our results suggest that the long-range correlation may result from a combination of noise that is ubiquitous in biological systems and orbital stability that is essential in general rhythmic movements. [ABSTRACT FROM AUTHOR]

The chaotic nature of the atmospheric dynamics has stimulated the applications of methods and ideas derived from statistical dynamics. For instance, ensemble systems are used to make weather predictions recently extensive, which are designed to sample the phase space around the initial condition. Such an approach has been shown to improve substantially the usefulness of the forecasts since it allows forecasters to issue probabilistic forecasts. These works have modified the dominant paradigm of the interpretation of the evolution of atmospheric flows (and oceanic motions to some extent) attributing more importance to the probability distribution of the variables of interest rather than to a single representation. The ensemble experiments can be considered as crude attempts to estimate the evolution of the probability distribution of the climate variables, which turn out to be the only physical quantity relevant to practice. However, little work has been done on a direct modeling of the probability evolution itself. In this paper it is shown that it is possible to write the evolution of the probability distribution as a functional integral of the same kind introduced by Feynman in quantum mechanics, using some of the methods and results developed in statistical physics. The approach allows obtaining a formal solution to the Fokker-Planck equation corresponding to the Langevin-like equation of motion with noise. The method is very general and provides a framework generalizable to red noise, as well as to delaying differential equations, and even field equations, i.e., partial differential equations with noise, for example, general circulation models with noise. These concepts will be applied to an example taken from a simple ENSO model. [ABSTRACT FROM AUTHOR]

Empirical mode decomposition (EMD) is an adaptive method for nonlinear, non-stationary signal analysis. However, the upper and lower envelopes fitted by cubic spline interpolation (CSI) may often occur overshoots. In this paper, a new envelope fitting method based on the flattest constrained interpolation is proposed. The proposed method effectively integrates the difference between extremes into the cost function, and applies a chaos particle swarm optimization method to optimize the derivatives of the interpolation nodes. The proposed method was tested on three different types of data: ascertain signal, random signals and real electrocardiogram signals. The experimental results show that: (1) The proposed flattest envelope effectively solves the overshoots caused by CSI method and the artificial bends caused by piecewise parabola interpolation (PPI) method. (2) The index of orthogonality of the intrinsic mode functions (IMFs) based on the proposed method is 0.04054, 0.02222±0.01468 and 0.04013±0.03953 for the ascertain signal, random signals and electrocardiogram signals, respectively, which is lower than the CSI method and the PPI method, and means the IMFs are more orthogonal. (3) The index of energy conversation of the IMFs based on the proposed method is 0.96193, 0.93501±0.03290 and 0.93041±0.00429 for the ascertain signal, random signals and electrocardiogram signals, respectively, which is closer to 1 than the other two methods and indicates the total energy deviation amongst the components is smaller. (4) The comparisons of the Hilbert spectrums show that the proposed method overcomes the mode mixing problems very well, and make the instantaneous frequency more physically meaningful. [ABSTRACT FROM AUTHOR]