When constructing the algorithm model of sports training action classification, accuracy classification has an important impact on model. How to improve needs further research. Based BP neural network algorithm, this paper carries out modeling signal and construction network, deduces in detail. Firstly, applies genetic initial parameter selection avoid local optimization problem. carrying chrom...

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common divisor of two integers by simulating a slightly modified version of the binary algorithm. The structure of our algorithm is very close to the one of the well-known Knuth-Schönhage fast gcd algorithm; although it does n...

We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and prove that its bit-time complexity is still O(n) for two n-bit integers. However, our preliminar experiments show that it is very fast for small integers. A parallel version of this algorithm matches the best presently known time complexity, na...

The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorit...

In this article, we propose the Mapping-based Pseudo Binary Differential Evolution (MPBDE) algorithm for solving discrete optimization problems. Based on the framework of the standard DE, a new boundary constraint-handling operator ensures that the results of the mutation operator meet the boundary conditions. Then the real values of the genotypes mapped into the discrete ones in the phenotypes...

Form the view of the biological viewpoint; each ant of social insects is regarded as neuron. They compose a neural network by stochastic and loose connections with each other; Similar to the artificial neural network simulating the ant colony, the Ant colony algorithm of binary network is presented. As the binary coding is adapted, lower aptitude behave of single ant is requested, less storage ...

This note attempts to give a quick analysis of the results of the BPrologCSP solver in the second international solver competition. The constraint propagators used in the solver are implemented in AR (action rules), a language available in B-Prolog, and the search part is implemented using labeling mix, a built-in in B-Prolog, that allows for the use of mixed strategies and time limits in label...

Every insect is considered, from the viewpoint of biological evolution, to be a neural cell that constitutes a neural network in a casual and loose way of joint. Through simulating the ant swarm intelligence on the basis of human neural network, this paper advances a linear binary network. The binary code expects a low intelligence of each ant, and each path corresponds to a comparatively small...