Search

Writing a history of a scientific theory is always difficult because it requires to focus on some key contributors and to "reconstruct" some supposed influences. In the 1970s, a new way of performing science under the name "chaos" emerged, combining the mathematics from the nonlinear dynamical systems theory and numerical simulations. To provide a direct testimony of how contributors can be influenced by other scientists or works, we here collected some writings about the early times of a few contributors to chaos theory. The purpose is to exhibit the diversity in the paths and to bring some elements—which were never published—illustrating the atmosphere of this period. Some peculiarities of chaos theory are also discussed. [ABSTRACT FROM AUTHOR]

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]

Highlights • Permutation instead of raw vector is adopted to simplify time irreversibility analysis. • Considering the forbidden permutation, a subtraction-based parameter, Y S , is proposed. • Chaotic and reversible processes and their surrogate data validate Y S. • Healthy and diseased brain activities manifest time irreversibility. • Epilepsy leads loss of time irreversibility of EEG during seizure-free intervals. Abstract To simplify the quantification of time irreversibility, we employ order patterns instead of the raw multi-dimension vectors in time series, and considering the existence of forbidden permutation, we propose a subtraction-based parameter, Y S , to measure the probabilistic differences between symmetric permutations for time irreversibility. Two chaotic models, the logistic and Henon systems, and reversible Gaussian process and their surrogate data are used to validate the time-irreversible measure, and time irreversibility of epileptic EEGs from Nanjing General Hospital is detected by the parameter. Test results prove that it is promising to quantify time irreversibility by measuring the subtraction-based probabilistic differences between symmetric order patterns, and our findings highlight the manifestation of nonlinearity of whether healthy or diseased EEGs and suggest that the epilepsy leads to a decline in the nonlinearity of brain electrical activities during seize-free intervals. [ABSTRACT FROM AUTHOR]

We consider billiards with a single cusp where the walls meeting at the vertex of the cusp have zero one-sided curvature, thus forming a flat point at the vertex. For Hölder continuous observables, we show that properly normalized Birkhoff sums, with respect to the billiard map, converge in law to a totally skewed α-stable law. [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]

The aim was to assess the effect of fatigue on linear and nonlinear parameters in swimming. Twenty-four fitness-oriented swimmers performed a maximal bout of 100 m at front-crawl to elicit fatigue. Before (pre-) and immediately after (post-test) the bout, participants swam an all-out 25 m to derive the speed fluctuation (dv), approximate entropy (ApEn) and fractal dimension (FD) from the speed-time series collected by a speedo-meter. Swim speed was 10.85% slower in the post-test than in the pre-test (p < .001, η2 = 0.72). There was an effect of the fatigue on the dv with a moderate effect size. The dv increased shifting the 95CI band from 0.116-0.134 to 0.140-0.161. The ApEn showed non-significant variations between the pre- and post-test having the 95CI of pre- and post-test overlapped (pre: 0.659-0.700; post: 0.641-0.682). The FD showed as well a significant variation (the 95CI moved from 1.954-1.965 to 1.933-1.951). It can be concluded that in swimming there are changes in classical and nonlinear parameters under fatigue. [ABSTRACT FROM AUTHOR]

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method. [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]

Stroke survivors are more prone to developing cognitive impairment and dementia. Dementia detection is a challenge for supporting personalized healthcare. This study analyzes the electroencephalogram (EEG) background activity of 5 vascular dementia (VaD) patients, 15 stroke-related patients with mild cognitive impairment (MCI), and 15 control healthy subjects during a working memory (WM) task. The objective of this study is twofold. First, it aims to enhance the discrimination of VaD, stroke-related MCI patients, and control subjects using fuzzy neighborhood preserving analysis with QR-decomposition (FNPAQR); second, it aims to extract and investigate the spectral features that characterize the post-stroke dementia patients compared to the control subjects. Nineteen channels were recorded and analyzed using the independent component analysis and wavelet analysis (ICA-WT) denoising technique. Using ANOVA, linear spectral power including relative powers (RP) and power ratio were calculated to test whether the EEG dominant frequencies were slowed down in VaD and stroke-related MCI patients. Non-linear features including permutation entropy (PerEn) and fractal dimension (FD) were used to test the degree of irregularity and complexity, which was significantly lower in patients with VaD and stroke-related MCI than that in control subjects (ANOVA; p ˂ 0.05). This study is the first to use fuzzy neighborhood preserving analysis with QR-decomposition (FNPAQR) dimensionality reduction technique with EEG background activity of dementia patients. The impairment of post-stroke patients was detected using support vector machine (SVM) and k-nearest neighbors (kNN) classifiers. A comparative study has been performed to check the effectiveness of using FNPAQR dimensionality reduction technique with the SVM and kNN classifiers. FNPAQR with SVM and kNN obtained 91.48 and 89.63% accuracy, respectively, whereas without using the FNPAQR exhibited 70 and 67.78% accuracy for SVM and kNN, respectively, in classifying VaD, stroke-related MCI, and control patients, respectively. Therefore, EEG could be a reliable index for inspecting concise markers that are sensitive to VaD and stroke-related MCI patients compared to control healthy subjects. [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]

Perpetual points represent a new interesting topic in the literature of nonlinear dynamics. This paper introduces some chaotic flows with four different structural features from the viewpoint of fixed points and perpetual points. [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]

An appropriate nonlinear blood flow model under the influence of periodic body acceleration through a multiple stenosed artery is investigated with the help of finite difference method. The arterial segment is simulated by a cylindrical tube filled with a viscous incompressible Newtonian fluid described by the Navier-Stokes equation. The nonlinear equation is solved numerically with the proper boundary conditions and pressure gradient that arise from the normal functioning of the heart. Results are discussed in comparison with the existing models. [ABSTRACT FROM AUTHOR]

We present a framework for dynamic textures (DTs) recognition and localization by using a model developed in the text analysis literature: probabilistic latent semantic analysis (pLSA). The novelty is revealed in three aspects. First, chaotic feature vector is introduced and characterizes each pixel intensity series. Next, the pLSA model is employed to discover the topics by using the bag of words representation. Finally, the spatial layout of DTs can be found. Experimental results are conducted on the well-known DTs datasets. The results show that the proposed method can successfully build DTs models and achieve higher accuracies in DTs recognition and effectively localize DTs. [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]

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]

We examine critically the claims made by Fredrickson and Losada (2005) concerning the construct known as the "positivity ratio." We find no theoretical or empirical justification for the use of differential equations drawn from fluid dynamics, a subfield of physics, to describe changes in human emotions over time; furthermore, we demonstrate that the purported application of these equations contains numerous fundamental conceptual and mathematical errors. The lack of relevance of these equa-tions and their incorrect application lead us to conclude that Fredrickson and Losada 's claim to have demonstrated the existence of a critical minimum positivity ratio of 2.9013 is entirely unfounded. More generally, we urge future researchers to exercise caution in the use of advanced mathematical tools, such as nonlinear dynamics, and in particular to verify that the elementary conditions for their valid application have been met. [ABSTRACT FROM AUTHOR]

What is information? What role does information entropy play in this information exploding age, especially in understanding emergent behaviors of complex systems? To answer these questions, we discuss the origin of information entropy, the difference between information entropy and thermodynamic entropy, the role of information entropy in complexity theories, including chaos theory and fractal theory, and speculate new fields in which information entropy may play important roles. [ABSTRACT FROM AUTHOR]

The notion of order as a universal and fundamental conceptual category is discussed as being based on sets of similar differences and different similarities. A discussion of relationships between order and disorder is followed by a proposal for a mathematical theory based on non-ordinality which could also have relevance for indistinguishables in physics. [ABSTRACT FROM AUTHOR]

This paper presents a method for synchronizing the unified chaotic systems via a sliding mode controller (SMC). The unified chaotic system and problem formulation are described. Two identical unified chaotic systems can be synchronized using the SMC technique. The switching surface and its controller design are developed in detail. Simulation results show the feasibility of a chaotic secure communication system based on the synchronization of the Lorenz circuits via the proposed SMC. [ABSTRACT FROM AUTHOR]

We follow a functional analytic approach to study the problem of chaotic behaviour in time-perturbed discontinuous systems whose unperturbed part has a piecewise C homoclinic solution that crosses transversally the discontinuity manifold. We show that if a certain Melnikov function has a simple zero at some point, then the system has solutions that behave chaotically. Application of this result to quasi periodic systems are also given. [ABSTRACT FROM AUTHOR]

Abstract: This paper investigates the problem of chaos and hyper-chaos control, and proposes a simple adaptive feedback control method for chaos control under a reasonable assumption. In comparison with previous methods, the present control technique is simple both in the form of the controller and its application. Several illustrative examples with numerical simulations are studied by using the results obtained in this paper. Study of examples shows that our control method works very well in chaos control. [Copyright &y& Elsevier]

A method for estimating a period of unstable periodic solutions is suggested in continuous dissipative chaotic dynamical systems. The measurement of a minimum distance between a reference state and an image of transformation of it exhibits a characteristic structure of the system, and the local minima of the structure give candidates of period and state of corresponding symmetric solutions. Appropriate periods and initial states for the Newton method are chosen efficiently by setting a threshold to the range of the minimum distance and the period. [ABSTRACT FROM AUTHOR]

This paper addresses the cryptanalysis of a secure communication scheme proposed by Wu (2006), where the information signal is modulated into a system parameter of a unified chaotic system. It is demonstrated that a parameter observer can be designed to identify the parameter determined by the transmitted information and then the transmitted information can be obtained. Compared with the existing analysis using adaptive observer, the cryptanalysis based on parameter observer is much simpler and needs less structure information of the transmitter system. With numerical simulations, it is shown that the parameter observer has stronger practicality and robustness. Furthermore, it is still possible to obtain the transmitted information, even if the derivative of the transmitted signal is unknown. [ABSTRACT FROM AUTHOR]

Abstract: The main aim of the present paper is to describe some relations between specification property and ω-chaos. In particular, we study how properties of factor maps can be used to transfer this kind of chaos by a semiconjugacy with a shift space. [Copyright &y& Elsevier]

Abstract: In this paper, a new strategy by using GYC partial region stability theory is proposed to achieve chaos control. Using the GYC partial region stability theory, the new Lyapunov function used is a simple linear homogeneous function of error states and the lower order controllers are much more simple and introduce less simulation error. Numerical simulations are given for new Mathieu–Van der Pol system and new Mathieu–Duffing system to show the effectiveness of this strategy. [Copyright &y& Elsevier]

Abstract: This paper investigates the chaos suppression problem for a class of unified chaotic systems subject to uncertainties and control input with dead-zone nonlinearity. Using the variable structure control technique, a robust adaptive control law is established to suppress chaos in a class of unified chaotic systems even with unknown uncertainties and dead-zone nonlinearity in input. In particular, a switching surface is newly proposed to simplify the task of ensuring the stability of the closed-loop system in the sliding mode. Numerical results validate the effectiveness of the proposed adaptive control scheme. [Copyright &y& Elsevier]

We investigate the existence of cantori for a dissipative version of the sawtooth map. Making use of an explicit parametric representation of the solution, we prove that cantori exist for any irrational value of the frequency. We also perform a numerical study aimed to determine some dynamical properties of the dissipative sawtooth map. [ABSTRACT FROM AUTHOR]

This Letter analyzes the hyperchaotic dynamics of the fractional-order Rössler system from a time-domain point of view. The approach exploits the Adomian decomposition method (ADM), which generates series solution of the fractional differential equations. A remarkable finding of the Letter is that hyperchaos occurs in the fractional Rössler system with order as low as 3.12. This represents the lowest order reported in literature for any hyperchaotic system studied so far. [ABSTRACT FROM AUTHOR]

It is proved that the infimum of the topological entropy of continuous topologically exact interval (circle) maps is strictly smaller than the infimum of the topological entropy of continuous interval (circle) maps, which are topologically mixing, but not exact. Interpreting this result in terms of popular notions of chaos, one may say that on the interval (circle) lower entropy implies stronger Devaney chaos. Moreover, the infimum of the entropy of mixing circle maps is computed. These theorems may be considered as a completion of some results of Alsedà, Kolyada, Llibre, and Snoha (1999). [ABSTRACT FROM AUTHOR]

Abstract: In this paper, a new type of anticipating synchronization, called time-varying anticipating synchronization, is defined firstly. Then novel adaptive schemes for time-varying anticipating synchronization of certain or uncertain chaotic dynamical systems are designed based on the Lyapunov function and invariance principle. The update gain of coupling strength can be automatically adapted to a suitable strength depending on the initial values and can be properly chosen to adjust the speed of achieving synchronization, so these schemes are analytical and simple to implement in practice. A classical chaotic dynamical system is used to demonstrate the effectiveness of the proposed adaptive schemes with or without parameter uncertainties. [Copyright &y& Elsevier]