Journal ArticleDOI
On the Complexity of Finite Sequences
A. Lempel,Jacob Ziv +1 more
Reads0
Chats0
TLDR
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented, related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated.Abstract:
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented. The proposed complexity measure is related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated. It is further related to the number of distinct substrings and the rate of their occurrence along the sequence. The derived properties of the proposed measure are discussed and motivated in conjunction with other well-established complexity criteria.read more
Citations
More filters
Book ChapterDOI
Automatic Evaluation of FHR Recordings from CTU-UHB CTG Database
Jiří Spilka,George Georgoulas,Petros Karvelis,Vangelis P. Oikonomou,Vaclav Chudacek,Chrysostomos D. Stylios,Lenka Lhotska,Petr Janků +7 more
TL;DR: For this paper, new CTU-UHB CTG database was used to compute more than 50 features, ranging from classical morphological features based on FIGO guidelines to frequency-domain and non-linear features.
Journal ArticleDOI
Therapeutic effects of aerobic exercise on EEG parameters and higher cognitive functions in mild cognitive impairment patients
Imran Amjad,Imran Amjad,Hamza Toor,Imran Khan Niazi,Hina Afzal,Mads Jochumsen,Muhammad Shafique,Kathryn Allen,Heidi Haavik,Touqeer Ahmed +9 more
TL;DR: Aerobic exercise showed improvement in cognition after short and long-term treatment in MCI subjects and can be used as potential therapeutic candidate.
Journal ArticleDOI
Computing regularities in strings
TL;DR: The aim of this survey is to provide insight into the sequential algorithms that have been proposed to compute exact "regularities" in strings; that is, covers, seeds, repetitions, runs, and repeats.
Posted Content
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Shiteng Chen,Elad Verbin,Wei Yu +2 more
TL;DR: This paper investigates the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s, and shows a data structure investigated by Bille et al.
Journal ArticleDOI
The measures of sequence complexity for EEG studies
Xu Jinghua,Liu Zengrong,Liu Ren +2 more
TL;DR: Using two measures to characterize the dynamic behaviour of a system, the logistic map with numerical computation was studied and this measure may be a reasonable definition of complexity.
References
More filters
Journal ArticleDOI
Three approaches to the quantitative definition of information
TL;DR: In this article, three approaches to the quantitative definition of information are presented: information-based, information-aware and information-neutral approaches to quantifying information in the context of information retrieval.
Journal ArticleDOI
The definition of random sequences
TL;DR: It is shown that the random elements as defined by Kolmogorov possess all conceivable statistical properties of randomness and can equivalently be considered as the elements which withstand a certain universal stochasticity test.
Journal ArticleDOI
Process complexity and effective random tests
TL;DR: A variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences and some concepts of effective tests which are proved to be equivalent are established.
Journal ArticleDOI
Information-Theoretic Limitations of Formal Systems
TL;DR: An attempt is made to apply information-theoretic computational complexity to meta-mathematics by measuring the difficulty of proving a given set of theorems, in terms of the number of bits of axioms that are assumed, and the size of the proofs needed to deduce the theoremic proofs.