In this paper, a natural extension of the Lempel–Ziv complexity for several finite-time sequences, defined on finite size alphabets is proposed. Some results on the defined joint Lempel–Ziv complexity are given, as well as properties in connection with the Lempel–Ziv complexity of the...

In der Dissertation wird ein Spezifikationsrahmen dargestellt, mit dem sich die Au?ensicht von (Software-) Komponenten in einer normierten und vollst?ndigen Weise beschreiben l?sst. Dazu werden verschiedene methodische Vorgaben geschaffen, mit denen sich die f?r die betriebliche...

Information measures have been used in the context of nonlinear systems presenting abrupt complexity changes and related to nonlinear time series analysis. In this study, complexity measures such as Shannon entropy, q-entropy and their associated divergences have been added to a robust speech...

Estimation of complexity is of great interest in nonlinear signal and system analysis. Several complexity measures have been proposed: Lyapunov exponents, Lempel and Ziv, approximate entropy. In the present study, complexity measures derived from Shannon entropy,...

Considerable advances in automatic speech recognition have been made in the last decades, thanks specially to the use of hidden Markov models. In the field of speech signal analysis, different techniques have been developed. However, deterioration in the performance of the speech recognizers has...

The Dirac-delta-like quantum-mechanical potentials are frequently used to describe and interpret numerous phenomena in many scientific fields including atomic and molecular physics, condensed matter and quantum computation. The entropy and complexity properties of potentials with one and two...

Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world data is lacking, generated data sets provide a substantive methodological tool for experiments. Focused research questions need to base...