To distinguish the randomness and chaos characteristics of physiological signals and to keep its performance independent of the signal length and parameters are the key judgement of performance of a complexity algorithm.We proposed an encoding Lempel-Ziv(LZ)complexity algorithm to try to explicitly discern between the randomness and chaos characteristics of signals.Our study also compared the effects of length of time series,the sensitivity to dynamical properties change of time series and quantifying the complexity between gauss noise and 1/f pink noise ELZ with those from classic LZ(CLZ),multi-state LZ(MLZ),sample entropy(SampEn)and permutation entropy(PE).The experimental results showed ELZ could not only distinguish the randomness and chaos characteristics of time series on all time length(i.e.100,500,5 000),but also reflected exactly that the complexity of gauss noise was lower than that of pink noise,and responded change of dynamic characteristics of time series in time.The congestive heart failure(CHF)RR Interval database and the normal sinus rhythm(NSR)RR Interval database created by Massachusetts Institute of Technology(MIT)and Boston Beth Israel Hospital(BIH)were used as real data in our study.The results revealed that the ELZ could show the complexity of congestive heart failure which was lower than that of normal sinus rhythm during all lengths of time series(P<0.01),and the ELZ algorithm had better generalization ability and was independent of length of time series.
Download full-text PDF |
Source |
|---|
Publication Analysis
Top Keywords
Similar Publications
Modeling shock propagation and resilience in financial temporal networks.
Chaos
January 2025
Classe di Scienze, Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy.
Modeling how a shock propagates in a temporal network and how the system relaxes back to equilibrium is challenging but important in many applications, such as financial systemic risk. Most studies, so far, have focused on shocks hitting a link of the network, while often it is the node and its propensity to be connected that are affected by a shock. Using the configuration model-a specific exponential random graph model-as a starting point, we propose a vector autoregressive (VAR) framework to analytically compute the Impulse Response Function (IRF) of a network metric conditional to a shock on a node.
View Article and Find Full Text PDFResearch on vehicle scheduling for forest fires in the northern Greater Khingan Mountains.
Sci Rep
January 2025
College of Energy and Transportation Engineering, Inner Mongolia Agricultural University, Hohhot, 010010, China.
In the face of forest fire emergencies, fast and efficient dispatching of rescue vehicles is an important means of mitigating the damage caused by forest fires, and is an effective method of avoiding secondary damage caused by forest fires, minimizing the damage caused by forest fires to the ecosystem, and mitigating the losses caused by economic development. this paper takes the actual problem as the starting point, constructs a reasonable mathematical model of the problem, for the special characteristics of the emergency rescue vehicle scheduling problem of forest fires, taking into account the actual road conditions in the northern pristine forest area, through the analysis of the cost of paths between the forest area and the highway, to obtain the least obstructed rescue paths, to narrow the gap between the theoretical model and the problem of the actual. Improvement of ordinary genetic algorithm, design of double population strategy selection operation, the introduction of chaotic search initialization population, to improve the algorithm's solution efficiency and accuracy, through the northern pristine forest area of Daxing'anling real forest fire cases and generation of large-scale random fire point simulation experimental test to verify the effectiveness of the algorithm, to ensure that the effectiveness and reasonableness of the solution to the problem of forest fire emergency rescue vehicle scheduling program.
View Article and Find Full Text PDFRandom walks on scale-free flowers with stochastic resetting.
Chaos
January 2025
School of Mathematical Science, Jiangsu University, Zhenjiang, Jiangsu 212013, China.
This study explores the impact of stochastic resetting on the random walk dynamics within scale-free (u,v)-flowers. Utilizing the generating function technique, we develop a recursive relationship for the generating function of the first passage time and establish a connection between the mean first passage time with and without resetting. Our investigation spans multiple scenarios, with the random walker starting from various positions and aiming to reach different target nodes, allowing us to identify the optimal resetting probability that minimizes the mean first passage time for each case.
View Article and Find Full Text PDFA Cordial Introduction to Double Scaled SYK.
Rep Prog Phys
January 2025
SISSA, via Bonomea 265, 34136 Trieste, Trieste, 34136, ITALY.
We review recent progress regarding the double scaled Sachdev-Ye-Kitaev model and other p-local quantum mechanical random Hamiltonians. These models exhibit an expansion using chord diagrams, which can be solved by combinatorial methods. We describe exact results in these models, including their spectrum, correlation functions, and Lyapunov exponent.
View Article and Find Full Text PDFRandom walks with stochastic resetting in complex networks: A discrete-time approach.
Chaos
January 2025
Departamento de Física, Universidad Nacional de Colombia, Bogotá, Colombia.
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes of the network are target nodes, and we focus on the statistics of first hitting of these nodes.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!