Related papers: Further Investigations on Nonlinear Complexity of …

We study Nielsen's circuit complexity in a periodic harmonic oscillator chain, under single and multiple quenches. In a multiple quench scenario, it is shown that the complexity shows remarkably different behaviour compared to the other…

This paper reports on the application to field measurements of time series methods developed on the basis of the theory of deterministic chaos. The major difficulties are pointed out that arise when the data cannot be assumed to be purely…

We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.

Nonlinear perturbation of Fuchsian systems are studied in a region including two singularities. It is proved that such systems are generally not analytically equivalent to their linear part (they are not linearizable) and the obstructions…

Synthetic biology is a recent area of biological engineering, whose aim is to provide cells with novel functionalities. A number of important results regarding the development of control circuits in synthetic biology have been achieved…

A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

The absence of time-reversal symmetry is a fundamental property of many nonlinear time series. Here, we propose a new set of statistical tests for time series irreversibility based on standard and horizontal visibility graphs. Specifically,…

In many applications, accurate class probability estimates are required, but many types of models produce poor quality probability estimates despite achieving acceptable classification accuracy. Even though probability calibration has been…

On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we…

If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…

This paper shows how to compute, for probabilistic hybrid systems, the clock approximation and linear phase-portrait approximation that have been proposed for non probabilistic processes by Henzinger et al. The techniques permit to define a…

The current algorithms are based on linear model, for example, Precision Time Protocol (PTP) which requires frequent synchronization in order to handle the effects of clock frequency drift. This paper introduces a nonlinear approach to…

Quantization of the nonlinear supersymmetry faces a problem of a quantum anomaly. For some classes of superpotentials, the integrals of motion admit the corrections guaranteeing the preservation of the nonlinear supersymmetry at the quantum…

We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…

The paper investigates the properties of a nonlinear recursive sequence which includes several ones studied formerly in the literature.

This article addresses the following problems: 1) First, a nonlinearity analysis is made looking for the presence of nonlinearities in an early phase of the identification process. The level and the nature of the nonlinearities should be…

We define a metric on $\mathbb{F}_q^n$ using the linear complexity of finite sequences. We will then develop a coding theory for this metric. We will give a Singleton-like bound and we will give constructions of subspaces of…

In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…

Rapid development in numerical modelling of materials and the complexity of new models increases quickly together with their computational demands. Despite the growing performance of modern computers and clusters, calibration of such models…