Applied Mechanics and Materials Vols. 263-266

Abstract: by deeply analyzing the impact factor of the support degree, the calculation formula of the support degree be extended to make the formula more reasonable. Taking into account the life of the old and new spare parts and the impact of scheduling for spare parts support, the spare parts scheduling support model has been established. According to the characteristics of the model, the introduction of the classic scheduling algorithm for optimization of spare parts, can effectively improve the efficiency of support.

Abstract: This paper first presents the method for finding a generalized augmenting path according to the idea of Dijkstra's algorithm. Then the combinatorial algorithm for solving the generalized maximum flow is given in lossy network. The algorithm runs in strongly polynomial times by finding the generalized f-augmenting path in a generalized residual network.

Abstract: Based on the group explicit strategies, a new alternating group explicit algorithm for solving 2D diffusion equation was presented. The four new difference schemes which were constructed to implement the algorithm in parallel, can be converted to explicit computation. The stability and truncation error analyses were provided. Finally, numerical experiment was performed to examine that the the presented algorithm is efficient and accurate.

Abstract: The performance of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file and NB-tree suffers greatly in high-dimensional space. So the reduction of the dimensionality is the key to the spatial range query in high-dimensional space. The paper uses the parallel technique to present a spatial range query parallel algorithm in high-dimensional space. The algorithm transforms d-dimensional spatial range query to the linear space on d slave node processors. The d slave node processors run parallel. The master node processor only need calculate the union of d results which d slave node processors return. The experimental results indicate that its performance is better than that of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file, NB-tree.

Abstract: Based on the research of the author when he was a Ph.D. student, he deeply studied the proposition of μ-Calculus, and used solving the partial ordering relation in formula μ-Calculus to solve formula μ-Calculus quickly. This paper improves and perfects the algorithm in reference [11]. The time complexity of the algorithm in this paper is O((2n+1)^(d/2+1)), its space complexity is O(dn), where n is the number of states in the transition system and d is the nesting depth of fixpoint operators in the formula of proposition μ-Calculus.

Abstract: Based on interest point detection, a feature preserving mesh simplification algorithm is proposed. The Harris operator values of all vertices in the mesh were computed firstly. On the base of Garland’s simplification algorithm, we combine the Harris operator value with quadric error metric and change the order of edge collapsing in the simplification. The experimental results show that the proposed algorithm is effective and feature preserving.

Abstract: Starting with high availability of Websites, by executing load balancing strategies, the author designs and implements an optimization algorithm of network resources and paths based on ant colony. Firstly, defining resource allocation process and objective function; secondly, discussing improvements to integrated load parameters; then, focusing on analysis of principles of ants moving, updates of pheromone concentration, ants’ data structures, and algorithm flow; Finally, simulating test by MATLAB. The solutions above can provide higher reliability and availability for Web services by balancing traffic and load.

Abstract: Due to reduce the amount of DTW algorithm and improve the recognition rate. Through using the traditional DTW algorithm for analysis and research, putting forward a kind of local path constraints and regional restrictions combined with improved DTW algorithm. Through the experiment, using the improved DTW algorithm can reduce the calculate operations and improve the recognition rate.

Abstract: This paper presents a Differential Evolution algorithm based on Self-Adapting Mountain-climbing operator (LCDE) to overcome the problem of low convergence speed and bad local searching ability in the evolution period. The algorithm dynamically adjusts the value of climb radius during using the information of the individual search efficiency in the search process. The experiment results demonstrate that the new differential evolution algorithm has fast convergence speed and high computation precision.

Abstract: This paper analyzes the convergence deviation of surrogate assisted (1+1)EA. A model of surrogate assisted (1+1)EA can be built by the finite markov chain, then we got the transition matrix of this algorithm. The deviation of surrogate model can be expressed by the perturbation of transition matrix. So we can estimate the convergence deviation with the method of matrix perturbation analysis. Analyzing of the convergence changes brought by surrogate model’s deviations can help us to have a better select of the surrogate model.