Related papers: Synthesizing the L\"{u} attractor by parameter-swi…
This survey is a presentation of the arguments in the proof that Henon-like maps f_a(x,y)=(1-a x^2,0) + R(a,x,y) with |R(a,x,y)|< b have a "strange attractor", with positive Lebesgue probability in the parameter "a", if the perturbation…
Parameter selection is one of the most important parts for nearly all the control strategies. Traditionally, controller parameters are chosen by utilizing trial and error, which is always tedious and time consuming. Moreover, such method is…
The method of reconstruction of an attractor from a set of short time series ({\it clusters}) is proposed and discussed. This method is most useful for correlation dimension estimation of experimental data.
This paper details a method for optimising the size of Boolean automata networks in order to compute their attractors under the parallel update schedule. This method relies on the formalism of modules introduced recently that allows for…
This paper presents a novel method for the automated synthesis of probabilistic programs. The starting point is a program sketch representing a finite family of finite-state Markov chains with related but distinct topologies, and a PCTL…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
A new method based on the phenomenon of synchronization and the properties of chaos is proposed to reduce interference in the transferred chaotic signals of synchronized systems. In this paper, the interference is considered as a series of…
We propose a simple technique for verifying probabilistic models whose transition probabilities are parametric. The key is to replace parametric transitions by nondeterministic choices of extremal values. Analysing the resulting…
In this paper, we propose a model reduction technique for linear parameter varying (LPV) systems based on available tools for fixed-structure controller synthesis. We start by transforming a model reduction problem into an equivalent…
This letter suggests a new way to investigate 3-D chaos in spatial and frequency domains simultaneously. After spatially decomposing the Lorenz attractor into two separate scrolls with peaked spectra and a 1-D discrete-time zero-crossing…
The main objective of this paper is to investigate exponential attractors for a nonlocal delayed reaction-diffusion equation on an unbounded domain. We first obtain the existence of a globally attractive absorbing set for the dynamical…
The extraction of hadron-hadron scattering parameters from lattice data by using the L\"uscher approach becomes increasingly complicated in the presence of inelastic channels. We propose a method for the direct extraction of the complex…
Motivated by recent progress in data assimilation, we develop an algorithm to dynamically learn the parameters of a chaotic system from partial observations. Under reasonable assumptions, we rigorously establish the convergence of this…
The paper presents a novel approach to synthesize robust controllers for nonlinear systems along perturbed trajectories. The approach linearizes the system with respect to a reference trajectory. In contrast to existing methods rooted in…
Different ways of extracting parameters of interest from combined data sets of separate experiments are investigated accounting for the systematic errors. It is shown, that the frequentist approach may yield larger $\chi^2$ values when…
The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's Cube problem, we develop a machine learning…
We present a novel approach to the automatic synthesis of recursive programs from mixed-quantifier first-order logic properties. Our approach uses Skolemization to reduce the mixed-quantifier synthesis problem to a $\forall^*$-synthesis…
We present an approach to automatically synthesize synchronized models from lightweight formal specifications. Our approach takes as input a specification of a distributed system along with a global linear time constraint, which must be…
We advance here an algorithm of a synthesis of an electric circuit based on prescribed quadratic Lagrangian. That is the circuit evolution equations are equivalent to the relevant Euler-Lagrange equations. The proposed synthesis is a…
This work is devoted to further consideration of the Henon map with negative values of the shrinking parameter and the study of transient oscillations, multistability, and possible existence of hidden attractors. The computation of the…