Based on the definition of derivative,the both algorithm on Numerical value derivative are investigated,general program to calculate derivative of aleatoric function is designed,and point out that precision can be raised if along exponent curve approaching zero.

The experiments on simulated data show that the GA-EM algorithm maintains the monotonic convergence property of the EM algorithm, taking on a good robustness to initial values of parameters: 1) we have obtained a better MDL score while using exactly the same termination condition for both algorithm.

Among the fifteen candidates of AES Conference Round II, MARS, RC6? Rijn-dael,Serpent and TwoFish won the NIST's praise by their excellent characteristics in both algorithm and implement.

Another issue that is shared by both algorithm types is thefunctional relation between the BER and the SIR.

Parallelism has been exploited on both algorithm and architecture levels.

Both algorithm and subroutine are general in their capabilities and can be used, for example, to determine the area of a spherical polygon containing one or more holes.

With MPEG4 Codec implementation as the example, we have deployed design techniques from both algorithm level and architecture level optimizations.

The ratings distribution of items and users also may affect both algorithm and evaluation metric choice.

Recently Lu Sheng-xun has shown how a modified Wang Product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previously reported. In this paper, Lu' s algorithm is generalized to nonplanar graphs and named the cycle-algorithm. The dual one called the cut-algorithm is also proposed. It can be used in arbitrary graphs, too. Either of the algorithms is explained in detail by way of an example. Two theorems are derived in which these...

Recently Lu Sheng-xun has shown how a modified Wang Product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previously reported. In this paper, Lu' s algorithm is generalized to nonplanar graphs and named the cycle-algorithm. The dual one called the cut-algorithm is also proposed. It can be used in arbitrary graphs, too. Either of the algorithms is explained in detail by way of an example. Two theorems are derived in which these algorithms have been proved. Both algorithms can be used for finding all of Hamiltonian paths contained in arbitrary graphs. The cut-algorithm has been carried out on the computer Type 719. According to the results from the computer' s calculation, the number of all Hamiltonian cycles in a certain maximum planar graph with nine vertices should be 112, instead of 96 or 110 given by other authors previously.

In sorting methods both algorithms of list sorting are discribed in this paper i. e. list insertion algorithm, list merge algorithm and thief programs. According to the three principles of evaluating sorting algorithm, they are analysed and compared with between. In the paper the methods of computation are abstracted and some tables are given so as to evaluate thier sorting effect intuitively.

One of the fundamental problems in linear time-invariant multivariable system theory is to obtain minimum realization from a given transfer matrix. In this paper, Rosenbrock's algorithm for minimum realization is improved to reduce the order of the matrix polynomials of the transfer function matrix and to reduce the computing time. As the minimum realization so obtained is not in canonical form, the authors attempt to develop another algorithm to transform the first one into Luenberger's canonical...

One of the fundamental problems in linear time-invariant multivariable system theory is to obtain minimum realization from a given transfer matrix. In this paper, Rosenbrock's algorithm for minimum realization is improved to reduce the order of the matrix polynomials of the transfer function matrix and to reduce the computing time. As the minimum realization so obtained is not in canonical form, the authors attempt to develop another algorithm to transform the first one into Luenberger's canonical form. Both algorithms are tested on DJS-130 computer.