اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymbolic relative entropy in quantifying nonlinear dynamics of equalities-involved heartbeats
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Symbolic relative entropy, an efficient nonlinear complexity parameter measuring probabilistic divergences of symbolic sequences, is proposed in our nonlinear dynamics analysis of heart rates considering equal states. Equalities are not rare in discrete heartbeats because of the limits of resolution of signals collection, and more importantly equal states contain underlying important cardiac regulation information which is neglected by some chaotic deterministic parameters and temporal asymmetric measurements. The relative entropy of symbolization associated with equal states has satisfied nonlinear dynamics complexity detections in heartbeats and shows advantages to some nonlinear dynamics parameters without considering equalities. Researches on cardiac activities suggest the highest probabilistic divergence of the healthy young heart rates and highlight the facts that heart diseases and aging reduce the nonlinear dynamical complexity of heart rates.
قيم البحث
اقرأ أيضاً
We characterise the evolution of a dynamical system by combining two well-known complex systems tools, namely, symbolic ordinal analysis and networks. From the ordinal representation of a time-series we construct a network in which every node weights
represents the probability of an ordinal patterns (OPs) to appear in the symbolic sequence and each edges weight represents the probability of transitions between two consecutive OPs. Several network-based diagnostics are then proposed to characterize the dynamics of different systems: logistic, tent and circle maps. We show that these diagnostics are able to capture changes produced in the dynamics as a control parameter is varied. We also apply our new measures to empirical data from semiconductor lasers and show that they are able to anticipate the polarization switchings, thus providing early warning signals of abrupt transitions.
Let $G$ be the group $mathbb{Z}^d$ or the monoid $mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the topological entropy o
f $X$ is equal to the Hausdorff dimension of $X$ and has a sharp characterization in terms of the Kolmogorov complexity of finite pieces of the orbits of $X$. In the version of this paper that has been published in Theory of Computing Systems, the proof of Lemma 4.3 contains a confusing typographical error. This version of the paper corrects that error.
Symbolic sequences with long-range correlations are expected to result in a slow regression to a steady state of entropy increase. However, we prove that also in this case a fast transition to a constant rate of entropy increase can be obtained, prov
ided that the extensive entropy of Tsallis with entropic index q is adopted, thereby resulting in a new form of entropy that we shall refer to as Kolmogorov-Sinai-Tsallis (KST) entropy. We assume that the same symbols, either 1 or -1, are repeated in strings of length l, with the probability distribution p(l) proportional to 1/(l^mu). The numerical evaluation of the KST entropy suggests that at the value mu = 2 a sort of abrupt transition might occur. For the values of mu in the range 1<mu<2 the entropic index q is expected to vanish, as a consequence of the fact that in this case the average length <l> diverges, thereby breaking the balance between determinism and randomness in favor of determinism. In the region mu > 2 the entropic index q seems to depend on mu through the power law expression q = (mu-2)^(alpha) with alpha approximately 0.13 (q = 1 with mu > 3). It is argued that this phase-transition like property signals the onset of the thermodynamical regime at mu = 2.
We present a simple method to efficiently compute a lower limit of the topological entropy and its spatial distribution for two-dimensional mappings. These mappings could represent either two-dimensional time-periodic fluid flows or three-dimensional
magnetic fields, which are periodic in one direction. This method is based on measuring the length of a material line in the flow. Depending on the nature of the flow, the fluid can be mixed very efficiently which causes the line to stretch. Here we study a method that adaptively increases the resolution at locations along the line where folds lead to high curvature. This reduces the computational cost greatly which allows us to study unprecedented parameter regimes. We demonstrate how this efficient implementation allows the computation of the variation of the finite-time topological entropy in the mapping. This measure quantifies spatial variations of the braiding efficiency, important in many practical applications.
Harnessing chaos or intrinsic nonlinear behaviours from dynamical systems is a promising avenue for the development of unconventional information processing technologies. However, the exploitation of such features in spintronic devices has not been a
ttempted despite the many theoretical and experimental evidence of nonlinear behaviour of the magnetization dynamics in nanomagnetic systems. Here, we propose a first step in that direction by unveiling and characterizing the patterns and symbolic dynamics originating from the nonlinear chaotic time-resolved electrical signals generated experimentally by a nanocontact vortex oscillator (NCVO). We use advanced filtering methods to dissociate nonlinear deterministic patterns from thermal fluctuations and show that the emergence of chaos results in the unpredictable alternation of simple oscillatory patterns controlled by the NCVOs core-polarity switching. With phase-space reconstruction techniques, we perform a symbolic analysis of the time series to assess the level of complexity and entropy generated in the chaotic regime. We find that at the centre of its incommensurate region, it can exhibit maximal entropy and complexity. This suggests that NCVOs are promising nonlinear nanoscale source of entropy that could be harnessed for information processing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
