A single scalar time series was reconstructed into a high-dimension phase space by the phase space reconstruction, then the chaotic characteristics of the high-dimension phase space was further researched.

Combining the Maximal Margin Principle and the Kernel Function Theory, it has effectively solved the difficult problems which have perplexed the machine learning researchers for a long time, such as small-sample, high-dimension, nonlinear, over-fitting, local optimal solution, etc.

The machine conceptually implements the following idea: input vectors are non-linearly mapped to a very high-dimension feature space.

The machine conceptually implements the following idea: input vectors are non-linearly mapped to a very high-dimension feature space.

Low-and high-dimension limits of a phase separation model

The Belinsky-Zakharov inverse scatteringmethod is extended to a double high-dimension form.

Algorithms of determining maximum (in modulus) complex-conjugate eigenvalues are considered as applied to finding eigenvalues of high-dimension matrices according to the Khilenko method.

With the increasingly rapid growth of processor speed, the interconnection network for networked parallel computing (NPC) has become an essential factor influencing on the efficiency of NPC. TH GBNet in this paper is a high speed scaleable, dynamic crossbar based interconnection network. TH GBNet not only has better scalability, but also can achieve high bandwidth and low latency data transmission and provides the powerful support for the network communication of NPC. As a basic unit of TH GBNet, TH Switch...

With the increasingly rapid growth of processor speed, the interconnection network for networked parallel computing (NPC) has become an essential factor influencing on the efficiency of NPC. TH GBNet in this paper is a high speed scaleable, dynamic crossbar based interconnection network. TH GBNet not only has better scalability, but also can achieve high bandwidth and low latency data transmission and provides the powerful support for the network communication of NPC. As a basic unit of TH GBNet, TH Switch has eight full duplex ports and the unidirectional bandwidth of the port can reach 1.056 Gbps, the transmission latency is only 30ns in transmitting 32 bits data. This paper illustrates the structure of TH Switch and the design of routing algorithm for k ary n cube interconnection network in TH Switch. For reducing the heavy load of the high dimension channel in Idle routing algorithm for message passing, an improved idle algorithm with introducing a pseudo random variable is described. In resolving the contention of the outport of the TH Switch, the arbitration unit with token cyclic test mode is designed. Finally, the analysis based on the simulation of improved idle routing algorithm shows that it is not only very simple and easy to implement using hardware, but also has high efficiency.

The security of the NTRU Public Key Cryptosystem is based on the hard problem of finding a very short vector in a lattice of very high dimension.Encryption and decryption with NTRU algorithms is extremely fast,and key creation is fast and easy.Because of their security and efficiency,the NTRU will be used widely in the future.This pa-per introduces the standard NTRU lattice and the reaction attack which against several public key cryptosystems based on lattice problems.It also discusses some countermeasures...

The security of the NTRU Public Key Cryptosystem is based on the hard problem of finding a very short vector in a lattice of very high dimension.Encryption and decryption with NTRU algorithms is extremely fast,and key creation is fast and easy.Because of their security and efficiency,the NTRU will be used widely in the future.This pa-per introduces the standard NTRU lattice and the reaction attack which against several public key cryptosystems based on lattice problems.It also discusses some countermeasures of protecting NTRU against chosen ciphertext and reaction attack and so on.

This paper introduces a new public key cryptosystem which is called NTRU algorithms. The security of the NTRU is based on the hard mathematical problem that of finding very short vectors in lattices of very high dimension. Encryption and decryption with NTRU is extremely fast and key creation is fast and easy. Because of their security and efficiency, the NTRU will be used widely in the future.