Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

ASYMPTOTIC NORMALITY OF KERNEL ESTIMATES OF A DENSITY FUNCTION UNDER ASSOCIATION DEPENDENCE

Let {X_n, n≥1} be a strictly stationary sequence of random variables, whichare either associated or negatively associated, f(·) be their common density. In this paper,the author shows a central limit theorem for a kernel estimate of f(·) under certain regularconditions.     

Anti-BZ-Structure in Effect Algebras

The definitions of sharply approximating effect algebras, anti-BZ-effect algebras, central approximating effect algebras, and S-anti-BZ-effect algebras are given, the relationships between sharply approximating effect algebras and anti-BZ-effect algebras, between central approximating effect algebras and anti-BZ-effect algebras are established, and the set of anti-BZ-sharp elements in S-anti-BZ-effect algebras is proved to be an orthomodular lattice.     

Orbitals that minimize the variance

A MCSCF-method for minimization of the variance yielding an optimal basisset of variance minimizing orbitals in analogy to Löwdin's natural orbitals for minimal energy is developed.     

Space time-index plots for probing dynamical nonstationarity

We propose a simple method to efficiently probe dynamical nonstationarity in observed time series. In a space time-index plot, the density distributions as a function of normalized time-index are V-shaped due to nonstationarity. We show that this method is workable for short data sets and typical examples are illustrated.     

Concerning the multiplicators of Fourier series in the trigonometric system

In this paper we prove theorems on multiplicators of Fourier series inL _p, where the conditions depend on a parameterp. An example illustrating the importance of these conditions is constructed. Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 235–247, February, 1998.     

Infinite-dimensional linear groups with restrictions on subgroups that are not soluble <Emphasis Type="Italic">A</Emphasis><Subscript>3</Subscript>-groups

We are concerned with infinite-dimensional locally soluble linear groups of infinite central dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite central dimension. The structure of groups in this class is described. The case of infinite-dimensional locally nilpotent linear groups satisfying the specified conditions is treated separately. A similar problem is solved for infinite-dimensional locally soluble linear groups of infinite fundamental dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite fundamental dimension. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 548–559, September–October, 2007.     

平面上随机级数的性质

研究了平面上系数{Xn,n≥0}为(?)-混合序列在满足,(q>1)等条件下的随机级数的增长性及值分布,得到了比较好的结果．     

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.