Refine
Has Fulltext
- no (39) (remove)
Year of publication
Document Type
- Article (36)
- Monograph/Edited Volume (3)
Is part of the Bibliography
- yes (39)
Institute
- Interdisziplinäres Zentrum für Dynamik komplexer Systeme (39) (remove)
In one of the data mining techniques, change-point detection is of importance in evaluating time series measured in real world. For decades this technique has been developed as a nonlinear dynamics. We apply the method for detecting the change points, Singular Spectrum Transformation (SST), to the climate time series. To know where the structures of climate data sets change can reveal a climate background. In this paper we discuss the structures of precipitation data in Kenya and Wrangel Island (Arctic land) by using the SST.
During the last glacial period, climate records from the North Atlantic region exhibit a pronounced spectral component corresponding to a period of about 1470 years, which has attracted much attention. This spectral peak is closely related to the recurrence pattern of Dansgaard-Oeschger (DO) events. In previous studies a red noise random process, more precisely a first-order autoregressive (AR1) process, was used to evaluate the statistical significance of this peak, with a reported significance of more than 99%. Here we use a simple mechanistic two-state model of DO events, which itself was derived from a much more sophisticated ocean-atmosphere model of intermediate complexity, to numerically evaluate the spectral properties of random (i.e., solely noise-driven) events. This way we find that the power spectral density of random DO events differs fundamentally from a simple red noise random process. These results question the applicability of linear spectral analysis for estimating the statistical significance of highly non-linear processes such as DO events. More precisely, to enhance our scientific understanding about the trigger of DO events, we must not consider simple "straw men" as, for example, the AR1 random process, but rather test against realistic alternative descriptions.
Objectives: Scoring sleep visually based on polysomnography is an important but time-consuming element of sleep medicine. Where-as computer software assists human experts in the assignment of sleep stages to polysomnogram epochs, their performance is usually insufficient. This study evaluates the possibility to fully automatize sleep staging considering the reliability of the sleep stages available from human expert sleep scorers. Methods: We obtain features from EEG, ECG and respiratory signals of polysomnograms from ten healthy subjects. Using the sleep stages provided by three human experts, we evaluate the performance of linear discriminant analysis on the entire polysomnogram and:only on epochs where the three experts agree in their-sleep stage scoring. Results: We show that in polysomnogram intervals, to which all three scorers assign the same sleep stage, our algorithm achieves 90% accuracy. This high rate of agreement with the human experts is accomplished with only a small set of three frequency features from the EEG. We increase-the performance to 93% by including ECG and respiration features. In contrast, on intervals of ambiguous sleep stage, the sleep stage classification obtained from our algorithm, agrees with the human consensus scorer in approximately 61%. Conclusions: These findings suggest that machine classification is highly consistent with human sleep staging and that error in the algorithm's assignments is rather a problem of lack of well-defined criteria for human experts to judge certain polysomnogram epochs than an insufficiency of computational procedures
The response of scale-free networks with community structure to external stimuli is studied. By disturbing some nodes with different strategies, it is shown that the robustness of this kind of network can be enhanced due to the existence of communities in the networks. Some of the response patterns are found to coincide with topological communities. We show that such phenomena also occur in the cat brain network which is an example of a scale-free like network with community structure. Our results provide insights into the relationship between network topology and the functional organization in complex networks from another viewpoint.
Experimental evidences point Out the participation of nonsynaptic mechanisms (e.g., fluctuations in extracellular tons) in epileptiform bursting and spreading depression (SD). During these abnormal oscillatory patterns, it is observed an increase of extracellular potassium concentration [K+](o) and a decrease of extracellular calcium concentration [Ca2+](o) which raises the neuronal excitability. However, whether the high [K+](o) triggers and propagates these abnormal neuronal activities or plays a secondary role into this process is unclear. To better understand the influence of extracellular potassium dynamics in these oscillatory patterns, the experimental conditions of high [K+](o) and zero [Ca2+](o) were replicated in an extended Golomb model where we added important regulatory mechanisms of ion concentration as Na+-K+ pump, ion diffusion and glial buffering. Within these Conditions, simulations of the cell model exhibit seizure-like discharges (ictal bursting). The SD was elicited by the interruption of the Na+- K+ pump activity, mimicking the effect of cellular hypoxia (an experimental protocol to elicit SD, the hypoxia-induced SD). We used the bifurcation theory and the fast-slow method to analyze the interference of K+ dynamics in the cellular excitability. This analysis indicates that the system loses its stability at a high [K+](o), transiting to an elevated state of neuronal excitability. Effects of high [K+](o), are observed in different stages of ictal bursting and SD. In the initial stage, the increase of [K+](o) creates favorable conditions to trigger both oscillatory patterns. During the neuronal activity, a continuous growth of [K+](o) by outward K+ flow depresses K+ Currents in a positive feedback way. At the last stage, due to the depression of K+ currents, the Na+-K+ pump is the main mechanism in the end of neuronal activity. Thus, this work suggests that [K+](o) dynamics may play a fundamental role in these abnormal oscillatory patterns.
We employ a spectral decomposition method to analyze synchronization of a non-identical oscillator network. We study the case that a small parameter mismatch of oscillators is characterized by one parameter and phase synchronization is observed. We derive a linearized equation for each eigenmode of the coupling matrix. The parameter mismatch is reflected on inhomogeneous term in the linearized equation. We find that the oscillation of each mode is essentially characterized only by the eigenvalue of the coupling matrix with a suitable normalization. We refer to this property as spectral universality, because it is observed irrespective of network topology. Numerical results in various network topologies show good agreement with those based on linearized equation. This universality is also observed in a system driven by additive independent Gaussian noise.
Aims. Sunspot distribution in the northern and southern solar hemispheres exibit striking synchronous behaviour on the scale of a Schwabe cycle. However, sometimes the bilateral symmetry of the Butterfly diagram relative to the solar equatorial plane breaks down. The investigation of this phenomenon is important to explaining the almost-periodic behaviour of solar cycles. Methods. We use cross-recurrence plots for the study of the time-varying phase asymmetry of the northern and southern hemisphere and compare our results with the latitudinal distribution of the sunspots. Results. We observe a long-term persistence of phase leading in one of the hemispheres, which lasts almost 4 solar cycles and probably corresponds to the Gleissberg cycle. Long-term variations in the hemispheric-leading do not demonstrate clear periodicity but are strongly anti-correlated with the long-term variations in the magnetic equator.
Sensory information entering the nervous system follows independent paths of processing such that specific features are individually detected. However, sensory perception, awareness, and cognition emerge from the combination of information. Here we have analyzed the corticocortical network of the cat, looking for the anatomical substrate which permits the simultaneous segregation and integration of information in the brain. We find that cortical communications are mainly governed by three topological factors of the underlying network: (i) a large density of connections, (ii) segregation of cortical areas into clusters, and (iii) the presence of highly connected hubs aiding the multisensory processing and integration. Statistical analysis of the shortest paths reveals that, while information is highly accessible to all cortical areas, the complexity of cortical information processing may arise from the rich and intricate alternative paths in which areas can influence each other.
In the recent article "Stochastic analysis of recurrence plots with applications to the detection of deterministic signals" (Physica D 237 (2008) 619-629), Rohde et al. stated that the performance of RQA in order to detect deterministic signals would be below traditional and well-known detectors. However, we have concerns about such a general statement. Based on our own studies we cannot confirm their conclusions. Our findings suggest that the measures of complexity provided by RQA are useful detectors outperforming well-known traditional detectors, in particular for the detection of signals of complex systems, with phase differences or signals modified due to the measurement process.
In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confidence bounds of measured data. In the present Letter we suggest a method for estimating the confidence bounds of recurrence-based complexity measures. We study the applicability of the suggested method with model and real- life data.