A new nonlinear prediction technique is proposed by feedforward neural network, the learning algorithm for network is a chaotic one. A time-delay embedding is used to reconstruct the underlying attractor, the predicti...A new nonlinear prediction technique is proposed by feedforward neural network, the learning algorithm for network is a chaotic one. A time-delay embedding is used to reconstruct the underlying attractor, the prediction model is based on the time evolution of the topological neighboring in the phase space, the spatial neighbors are chosen by the rate of exponential divergence of close trajectory. The model is tested for the Mackey–Glass delay equation and Lorentz equations, good results are obtained for the prediction.展开更多
This paper presents an estimator of location vector based on one dimensional projection of high dimensional data.The properties of the new estimator including consistency,asymptotic normality and robustness are discus...This paper presents an estimator of location vector based on one dimensional projection of high dimensional data.The properties of the new estimator including consistency,asymptotic normality and robustness are discussed.It is proved that the estimator is not only strongly consistent and asymptotically normal but also with a breakdown point 1/2 and a bounded influence function.展开更多
Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove tha...Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least $n+{{3k - 9} \over 2}$, then G is k-ordered Hamiltonian for k=3,4,...,￠${n \over {19}}$?. We also show that the degree sum bound can be reduced to n+ 2 ￠ ${k \over {2}}$ m 2 if $\kappa(G)\ge {{3k - 1} \over 2}$ or '(G) S 5k m 4. Several known results are generalized.展开更多
In measuring the trade process in a double auction (DA) market, there is not any observable criterion that is able to describe the matching pairs and their transaction order dynamically. In this paper, we propose a ne...In measuring the trade process in a double auction (DA) market, there is not any observable criterion that is able to describe the matching pairs and their transaction order dynamically. In this paper, we propose a new observable criterion called Marshallian deviation. It can be used to measure the distance of a transaction path deviating from the Marshallian path mathematically, and to answer the question why buyers with high values will trade with sellers with low costs in advance in some types of DA but not in others. Furthermore, three factors influencing the Marshallian deviations both in the CDA and in the PDA are also studied. They are respectively the strategic algorithm, the transaction duration and the number of traders. A few interesting findings are presented.展开更多
文摘A new nonlinear prediction technique is proposed by feedforward neural network, the learning algorithm for network is a chaotic one. A time-delay embedding is used to reconstruct the underlying attractor, the prediction model is based on the time evolution of the topological neighboring in the phase space, the spatial neighbors are chosen by the rate of exponential divergence of close trajectory. The model is tested for the Mackey–Glass delay equation and Lorentz equations, good results are obtained for the prediction.
文摘This paper presents an estimator of location vector based on one dimensional projection of high dimensional data.The properties of the new estimator including consistency,asymptotic normality and robustness are discussed.It is proved that the estimator is not only strongly consistent and asymptotically normal but also with a breakdown point 1/2 and a bounded influence function.
基金Partially supported by the National Natural Sciences Foundation of China (No.19831080).
文摘Abstract A graph g is k-ordered Hamiltonian, 2 h k h n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least $n+{{3k - 9} \over 2}$, then G is k-ordered Hamiltonian for k=3,4,...,￠${n \over {19}}$?. We also show that the degree sum bound can be reduced to n+ 2 ￠ ${k \over {2}}$ m 2 if $\kappa(G)\ge {{3k - 1} \over 2}$ or '(G) S 5k m 4. Several known results are generalized.
基金This research is supported by the National Natural Science Foundation of China, CAS, MADIS and RGC of Hong Kong.
文摘In measuring the trade process in a double auction (DA) market, there is not any observable criterion that is able to describe the matching pairs and their transaction order dynamically. In this paper, we propose a new observable criterion called Marshallian deviation. It can be used to measure the distance of a transaction path deviating from the Marshallian path mathematically, and to answer the question why buyers with high values will trade with sellers with low costs in advance in some types of DA but not in others. Furthermore, three factors influencing the Marshallian deviations both in the CDA and in the PDA are also studied. They are respectively the strategic algorithm, the transaction duration and the number of traders. A few interesting findings are presented.
