BACKGROUND Attention-deficit/hyperactivity disorder (ADHD) is defined as the most common neurobehavioral disorder of childhood, but an objective diagnostic test is not available yet to date. Neurophychological, neuroimaging, and neurophysiological research offer ample evidence of brain and behavioral dysfunctions in ADHD, but these findings have not been useful as a diagnostic test. METHODS W...

BACKGROUND Saccades are rapid eye movements used to gather information about a scene which requires both action and perception. These are usually studied separately, so that how perception influences action is not well understood. In a dual task, where the subject looks at a target and reports a decision, subtle changes in the saccades might be caused by action-perception interactions. Studying...

This study focuses on the qualitative and quantitative characterization of chaotic systems with use a symbolic description. We consider two famous systems, Lorenz Rössler models their iconic attractors, demonstrate that adequately chosen partition, three measures complexity, such as Shannon source entropy, Lempel–Ziv Markov transition matrix, work remarkably well for characterizing degree chaot...

Conventional video coding paradigms are usually built on the assumption that a video stream will be encoded only once but decoded several times. Over the years, this has lead to the development of encoders, which use complex motion-estimation algorithms to reduce the size of the video bitstream. However in applications like distributed sensor networks, cell-phones etc. the encoder has a limited...

We define the complexity of DNA sequences as the information content per nucleotide, calculated by means of some Lempel-Ziv data compression algorithm. It is possible to use the statistics of the complexity values of the functional regions of different complete genomes to distinguish among genomes of different domains of life (Archaea, Bacteria and Eukarya). We shall focus on the distribution f...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...

A Lempel-Ziv complexity measure is introduced into the theory of a Minority Game (MG) in order to capture some features that volatility, one of the central quantities in this model of interacting agents, is not able to. Extracted solely from the binary string of outcomes of the game complexity offers new and valuable information on collective behavior of players. Also, we show that an expressio...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...

One of the most famous and investigated lossless data-compression schemes is the one introduced by Lempel and Ziv about 30 years ago [37]. This compression scheme is known as “dictionary-based compressor” and consists of squeezing an input string by replacing some of its substrings with (shorter) codewords which are actually pointers to a dictionary of phrases built as the string is processed. ...