Applied Mechanics and Materials Vols. 380-384

Abstract: In order to realize real-time synchronization of nodes and reduce space overhead by log maintenance in an unstable network, this paper adopts a method that combines the operation transfer-based method and the state transfer-based method. Based on file system synchronization, we design a new synchronous algorithm consisting of the state transform and events merge. the new algorithm can merge file system changes in the millisecond level and realize fast update response. Besides, the new algorithm can accurately identify file update semantics, which can effectively decrease the number of updates operations.

Abstract: This paper introduces an ontology-based CRM for the commercial use, which specifically is for commercial bank customers. By using the ontology modeling method, which includes competency questions, intuitions, axioms and specific model, this ontology can share the information between the commercial banks and their customers. Ontology for the commercial banks domain is being developed as relationships and facts of the architecture. The steps of developing such an ontology model and a mapping mechanism between the commercial bank's customers and ability of consuming are discussed.

Abstract: Which the distortion elements appear in the optimization process and the result may be a partial optimum solution are two disadvantages when using the ESO method to optimize 2-D model. In this paper, two algorithms are proposed for solving these disadvantages. One is filtering and deleting algorithm based on the traits of distortion elements. Using this algorithm, only one parameter is needed to control filtering and deleting, and the parameter is determined by the number of elements linked around distortion elements. The other is interval approximation algorithm. Minimum initial rejection ratio RR_0min which fulfills removal criterion was ascertained by using this algorithm and it was used as starting value. Thus other initial erasure rate RR₀ were obtained by setting a certain increment. Two algorithms mentioned above were implanted into the existing ESO method. Then optimizing respectively with different initial removal rates which were obtained before and the available structures from the results were filtered out in terms of performance parameters. The results of optimization for 2-D structures indicate that the improved ESO method has better suitability and stability than the existing one, and it avoids shortcoming that the results may be a partial optimum solution when using the existing ESO method.

Abstract: This paper presents an evolutionary way for the robot to plan path. The way is based on the Evolutionary Artificial Potential Field approach. APF is an efficient way for a robot to plan its path, and the evolutionary APF can help the robot to jump out of the local minimum point. A matrix is integrated in the new algorithm. The matrix can modify the direction of a robot when the robot is trapped in a local minimum point. The force which has been changed will prompt the robot to escape from the local minimum point. Simulation result shows that the optimized algorithm is an effective way to solve the local minimum problem.

Abstract: In order to protect user privacy information on the platform, this paper proposes a two factors authentication algorithm for medical registration platform. This algorithm make up gap that there is no authentication process during user log on the platform. This method is safer than traditional single factor user authentication methods, e.g., inputting password, or biometric authentication. For the proposed scheme, we figure out two different solutions, including SMS-OTP solution and biometrics based solution. Through comparisons at a different angle among these two solutions, a reasonable solution is chosen as the formal one to the platform.

Abstract: RNA secondary structure prediction algorithms tend to have higher time and space complexity. Some swarm intelligence algorithms can be applied to RNA secondary structure prediction on the basis of stem regions combinatorial optimization. This paper presents a parallel discrete shuffled frog leaping algorithm (parallel-DSFLA), which can run on a distributed cluster using the MPI programming mode. The experimental results show that the parallel-DSFLA got better speed-up ratio, can improve the RNA secondary structure prediction efficiency and save time.

Abstract: AC algorithm is a multi-pattern matching algorithm. And AC algorithm is often used in the snort system for feature detection. However, as the amount of data increases and the real-time requirements, AC algorithm needs to improve the efficiency of the algorithm. In this paper, we designed a parallelized AC algorithm. It uses the pipelining method to improve the efficiency of AC algorithm. This method is very effective in multicore environments. At the end of this paper, through experiments, we compared the running time and the speedup between classical AC algorithm and parallel AC algorithm.

Abstract: Artificial bee colony algorithm is a smart optimization algorithm based on the bees acquisition model. A long time for the search of the artificial bee colony algorithm, in this paper we propose a parallel algorithm of artificial bee colony algorithm (MPI-ABC), with an application of a parallel programming environment MPI, using the programming mode of message passing rewriting the serial algorithm in parallel. Finally, this paper compare both serial and parallel algorithm with testing on complex function optimization problems. The experimental results show that the algorithm is effective to improve the search performance, especially for high-dimensional complex optimization problem.

Abstract: In this paper, the nonlinear matrix equation is investigated. Based on the fixed-point theory, the boundary and the existence of the solution with the case are discussed. An algorithm that avoids matrix inversion with the case is proposed.

Abstract: In this paper, an iterative method is proposed to obtain the mixed-restriction solutions of . By the iterative method, the solvability of the matrix equation can be determined automatically. And if the matrix equation is consistent, then, for any initial value, the sequence generated by the iterative method, converges to the true solution within finite iteration steps in the absence of round off errors. Also, for the special initial value, the minimum norm solution can be obtained. Finally, two numerical examples are presented to demonstrate the efficiency of the iterative method.