Papers by Keyword: Algorithm Design

Abstract: Features of large text data mining methods method is avoided semantic analysis from the lexical, syntactic, but by means of statistical analysis and processing large text data, thus maximizing literally ignored similar semantic differences, adapt to network language characteristics. The results of our paper show that data mining algorithms may extract the information in this article can portray the characteristics of vocabulary specific user characteristics and make recommendations based on the characteristics of the user vocabulary.

Abstract: In classical harmony search algorithm, only one harmony vector is obtained in each of iteration, which affects its search ability. We propose an improve harmony search algorithm in this paper. In our approach, the number of harmony vectors obtained in each of iteration is equivalent to the population size, and all newly generated harmony vectors are put into the harmony memory array. Then, all harmony vectors are sorted by descending order of the fitness, and the first half individuals are served as the next generation of populations. Experimental results show that our approach is obviously superior to the classical one under the same iteration steps and the same running time, which reveals that our approach can effectively generate the excellent individuals approximating the global optimal solution and enhance the optimization ability of classical harmony search algorithm.

Abstract: Some drawbacks of existing binary search algorithm has been improved to reduce the number of paging through improved reader in this paper to reduce the number of bytes for each tag and reader communication transmission, thereby reducing the improved algorithm of recognition time. At the same time, an improved binary anti-collision algorithm, and by Matlab simulation results show the advantages of the improved algorithm compared to other improved binary search algorithm.

Abstract: In this paper, a fast multiplication computing method utilizing the complement representation method and canonical recoding technique is proposed. By performing complements and canonical recoding technique, the number of partial products can be reduced. Based on these techniques, we propose algorithm provides an efficient multiplication method. On average, our proposed algorithm to reduce the number of k-bit additions from (0.25k+logk/k+2.5) to (k/6 +logk/k+2.5), where k is the bit-length of the multiplicand A and multiplier B. We can therefore efficiently speed up the overall performance of the multiplication. Moreover, if we use the new proposes to compute common-multiplicand multiplication, the computational complexity can be reduced from (0.5 k+2 logk/k+5) to (k/3+2 logk/k+5) k-bit additions.

Abstract: Based on the similar structure theory, we conduct rigorous mathematical derivation and proof for the boundary value problem of a class of differential equation . We put forward a new algorithm------Similar Structure Algorithm to solve such boundary value problems. The similar structure algorithm only includes arithmetic and logical operation, hence it can be oriented towards computer. According to the similar structure algorithm, an example is given to conduct a simulation experiment by the application of computer software at the end of the paper. And we also observe and analysis the variational laws of the laboratory result by changing the coefficient of the boundary condition.

Abstract: This paper introduced parallel computing techniques to improve random walk algorithm. The random walk problem was firstly explained by a formal model. And then, the parallel features of random walk algorithm were discussed in detail. A parallel random walk algorithm was proposed and applied to analyze the VLSI power grid. The time complexity and the main factors impacting on the execution time of algorithm were analyzed carefully. The experimental results proved that the parallel computing techniques could improve random walk algorithm effectively.

Abstract: Tracking control is to select a control strategy, so that the actual output of the system to be able to track the desired output trajectory, and makes minimal prescribed performance index function. Actually adjustment problem is also a special tracking problem, namely zero output trajectory tracking problem. Adaptive dynamic programming for solving delay systems tracking control aspects of the article is very small. The proposed delay systems tracking control features include two aspects: First, the research object containing the delay nonlinear discrete affine system, the second is the research method is adaptive dynamic programming iterative algorithm.

Abstract: To enhance the approximation ability of process neural networks, a novel training algorithm is proposed by employing an improved quantum genetic algorithm. The proposed approach is applied to the training of process neural networks. The number of genes in a single chromosome is equal to the number of weight parameters. Taking each qubit in the current optimal chromosome as the goal, all individuals are updated by quantum rotation gate. In this method, each chromosome has three chains of genes, which can accelerate convergence. Taking the pattern classification of trigonometric functions as an example, the experimental results show that the proposed method is obviously superior to the common process neural networks.

Abstract: To solve prediction of sunspot number, a parallel process neural networks model is proposed in this paper, Firstly, by dividing the whole time-varying process into several small time intervals, the process neural networks are constructed in these small time intervals, which may disperse the load of networks. Then, employing the orthogonal basis expansion in functional space, the learning algorithm of the above-mentioned model is designed. The experimental results of time series predication of sunspots show that the proposed method has great potential for complicated nonlinear time series prediction.

Abstract: According to the traditional application of the artificial projection method to escape wheel detection, this paper proposes a new method based on digital template, after the introduction of the working principle and advantage, emphatically discuss the algorithm design. The experimental results demonstrate the proposed algorithm has high real-time ability, good reliability and more suitable for practical engineering application.