A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained...A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.展开更多
In this article, we extend the definition of uniformly starlike functions and uni- formly convex functions on the unit disk to the unit ball in C^n, give the discriminant criterions for them, and get some inequalities...In this article, we extend the definition of uniformly starlike functions and uni- formly convex functions on the unit disk to the unit ball in C^n, give the discriminant criterions for them, and get some inequalities for them.展开更多
In convex metric spaces, the sufficient and necessary conditions for Ishikawa iterative sequences of uniformly quasi-Lipschitzian mapping T with mixed errors to converge to a fixed point ate proved, and as a special c...In convex metric spaces, the sufficient and necessary conditions for Ishikawa iterative sequences of uniformly quasi-Lipschitzian mapping T with mixed errors to converge to a fixed point ate proved, and as a special case, in which T need not be continuous. The results of this paper improve and extend some recent results.展开更多
For a subset K of a metric space （X,d） and x ∈ X,Px（x）={y ∈ K ： d（x,y） = d（x,K）≡ inf{d（x,k） ： k ∈ K}}is called the set of best K-approximant to x. An element go E K is said to be a best simulta- neous ...For a subset K of a metric space （X,d） and x ∈ X,Px（x）={y ∈ K ： d（x,y） = d（x,K）≡ inf{d（x,k） ： k ∈ K}}is called the set of best K-approximant to x. An element go E K is said to be a best simulta- neous approximation of the pair y1,y2 E ∈ if max{d（y1,go）,d（y2,go）}=inf g∈K max {d（y1,g）,d（y2,g）}.In this paper, some results on the existence of common fixed points for Banach operator pairs in the framework of convex metric spaces have been proved. For self mappings T and S on K, results are proved on both T- and S- invariant points for a set of best simultaneous approximation. Some results on best K-approximant are also deduced. The results proved generalize and extend some results of I. Beg and M. Abbas^[1], S. Chandok and T.D. Narang^[2], T.D. Narang and S. Chandok^[11], S.A. Sahab, M.S. Khan and S. Sessa^[14], P. Vijayaraju^[20] and P. Vijayaraju and M. Marudai^[21].展开更多
基金supported by the National Natural Science Foundation of China (Grant No.10871168)
文摘A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.
基金supported by the NNSF of China(11001074,11061015,11101124)the Foundation for University Young Key Teacher of Henan Province
文摘In this article, we extend the definition of uniformly starlike functions and uni- formly convex functions on the unit disk to the unit ball in C^n, give the discriminant criterions for them, and get some inequalities for them.
文摘In convex metric spaces, the sufficient and necessary conditions for Ishikawa iterative sequences of uniformly quasi-Lipschitzian mapping T with mixed errors to converge to a fixed point ate proved, and as a special case, in which T need not be continuous. The results of this paper improve and extend some recent results.
文摘For a subset K of a metric space （X,d） and x ∈ X,Px（x）={y ∈ K ： d（x,y） = d（x,K）≡ inf{d（x,k） ： k ∈ K}}is called the set of best K-approximant to x. An element go E K is said to be a best simulta- neous approximation of the pair y1,y2 E ∈ if max{d（y1,go）,d（y2,go）}=inf g∈K max {d（y1,g）,d（y2,g）}.In this paper, some results on the existence of common fixed points for Banach operator pairs in the framework of convex metric spaces have been proved. For self mappings T and S on K, results are proved on both T- and S- invariant points for a set of best simultaneous approximation. Some results on best K-approximant are also deduced. The results proved generalize and extend some results of I. Beg and M. Abbas^[1], S. Chandok and T.D. Narang^[2], T.D. Narang and S. Chandok^[11], S.A. Sahab, M.S. Khan and S. Sessa^[14], P. Vijayaraju^[20] and P. Vijayaraju and M. Marudai^[21].
