In [1], it is shown that the Rabinovich-Fabrikant (RF) system admits self-excited and hidden chaotic attractors. In this paper, we further show that the RF system also admits a pair of symmetric transient hidden chaotic attractors. We reveal more extremely rich dynamics of this system, such as a new kind of “virtual saddles”.

This paper generalizes the classical spline using a new construction of spline coalescence hidden variable fractal interpolation function (CHFIF). The derivative of a spline CHFIF is a typical fractal function that is self-affine or non-self-affine depending on the parameters of a nondiagonal iterated function system. Our construction generalizes the construction of Barnsley and Harrington (198...

We introduce a symmetric local hidden state $(slhs)$ model in scenario, where two spacially separated parties receive quantum states from an unknown source. derive inequality based on the model. A completely new form of nonlocality emerges resource theoretic point view. The singles out larger set correlated higher dimensional scenarios $(d> 2 $ X $2)$ than what is predicted by existing $lhs$ mo...

We present new methods for determining the pose of a known 3-D object in a single 2-D image, extending our previous work ((7]) which focused on the case of planar models. In our method we represent the parts of objects directly as volumes, and make use of correspondences between these volumes and regions in the image, without requiring knowledge of the correspondence between speciic points in t...

In this paper we consider a discrete scale invariant Markov process {X(t), t ∈ R} with scale l > 1. We consider to have some fix number of observations in every scale, say T , and to get our samples at discrete points α, k ∈ W, where α is obtained by the equality l = α and W = {0, 1, . . .}. So we provide a discrete time scale invariant Markov (DT-SIM) process X(·) with parameter space {α, k ∈ ...

To keep an online game interesting to its users, it is important to know them. In this paper, in order to characterize user characteristics, we discuss clustering of online-game users based on their trails using Self Organization Map (SOM). As inputs to SOM, we introduce transition probabilities between landmarks in the targeted game map. An experiment is conducted confirming the effectiveness ...