Advanced Materials Research Vols. 756-759

Abstract: There are some disadvantages for fault detection and diagnosis with traditional Principal Component Analysis (PCA) method because of its shortcomings. It is, in this paper, presented a novel fault diagnosis method based on conventional PCA enhanced by wavelet denoising. The proposed method employs wavelet denoising to deal with the signals, which can reserve enough information of original data, and then establishes PCA model. Based on SPE and T² statistics, abnormal situation can be detected. And the location of the fault can be recognized via contribution plots. At last, the simulation studies with Matlab are carried out to verify the correctness and effectiveness of the proposed method, the advantages of the proposed method over the conventional PCA also are shown in the simulation.

Abstract: Motion estimation is the most important step in video compression. By using high precision motion vector in the H.264 encoder, the calculation is rapidly increased, but in the whole process of coding, motion estimation occupies about 80%. Although many motion estimation algorithms have been proposed to reduce the computational complexity of motion estimation, it still cannot meet the strict real-time demand. In this paper, based on the analysis of UMHexagonS algorithm, dynamic searching window is chosen in the UMHexagonS algorithm, then according to the motion activity, it uses different template to reduce the motion estimation time and improve video coding efficiency. Proved by the experiments on various test sequences, compared with the UMHexagonS algorithm, the motion estimation time of the proposed algorithm average saves 17.7525% in the case of the quality of the reconstructed image and rate close. It not only reduces the complexity of the algorithm, but also improves the real-time performance of the encoder.

Abstract: in order to calibrate the critical work parameters and structure parameters impacting the broken rate in the working of sugarcane harvester cutter, we establish the kinematics model of the cutter. analyse the matching conditions of running speed and cutter speed, the mechanism of the structural parameters in working . We use cubic regression analysis to establish the mathematical model associating the broken rate and the parameters and we discover the running speed play a dominant role. For the model ,we use the PSO (Particle Swarm Optimization) to obtain the optimal value of the parameters and research how the working parameters impact the broken rate under the optimal structural parameters. Finally, the field test of the prototype proves that the broken rate can be reduced to 2.12% under the optimal parameters.

Abstract: The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.

Abstract: Nowadays, people pay great attention to the privacy protection, therefore the technology of anonymization has been widely used. However, most of current methods strictly depend on the predefined ordering relation on the generalization layer or attribute domain, making the anonymous result is a high degree of information loss, thereby reducing the availability of data. In order to solve the problem, we propose a K-Members Clustering Algorithm to reduce the information loss, and improve the performance of k-anonymity in privacy protection.

Abstract: Particle swarm optimization (PSO) guides its search direction by a linear learning strategy in which each particle updates its velocity through a linear combination among its present status, historical best experience and the swarm best experience. Such a velocity update strategy is easy to achieve, but it is experimentally inefficient when searching in a complex space. The reason is that the current velocity direction of each particle definitely has a great potential on optimal value, however, traditional velocity accumulation search strategy has a great restriction on such a velocity potentiality. Therefore, a new searching mechanism based on One-dimensional Search (OdS) technology is presented in this paper, and a novel PSO variant (OPSO) is also proposed so as to let the swarm effectively search along the first several principal velocity directions by OdS strategy. OPSO can inherit most of the velocity information of all the particles to guide them to the most promising direction, which has a great difference in learning mechanism with usual PSOs. Experimental results indicate that OPSO has competitive performance when comparing with the well-known CMA-ES and CLPSO.

Abstract: Cloud Computing, as an emerging, virtual, large-scale distributed computing model, has gained increasing attention these years. Meanwhile it also faces many secure challenges, one of which is authentication. Amlan Jyoti Choudhury et al proposed a user authentication framework to ensure user legitimacy before entering into the cloud. However, the scheme is found to suffer from some attacks through our analysis. In this paper, we firstly analyze few attacks and the make an improvement on the user authentication framework. Our new protocol ensures that only legitimate users can access the cloud service based on smartcard. Security analysis shows our proposed scheme is secure under standard cryptographic.

Abstract: In order to solve the path selection problem in the transport of equipment and materials, while improving the quality of solutions, this paper uses ant colony algorithm based on optimization parameters to achieve. Through genetic algorithm to solve the parameters of ant colony algorithm, resulting in a better performance parameters. The experimental results show that ant colony algorithm based on optimization parameters has been improved on path length and computation time than the traditional ant colony algorithm.

Abstract: When using international popular algorithms deal with RMB paper currency, there exist three main aspects. First, the size of RMB paper currency is different with other countries. Second, the color of RMB paper currency is different from other countries, and the different face values have different major color, pattern and texture. Third, the location of face value in paper currency of our country is different from other countries. For RMB paper currency image, using edge detection is to separate the paper currency from the image according to boundary. In other words, the background is removed and only paper currency is left. This paper firstly introduces the principles of removing background by gradient operator, LOG algorithm and Canny algorithm. Then it analyzes the edge image results obtained by these three kind algorithms. At last, these three algorithms are evaluated. Results show that the Canny algorithm can satisfy the requirement of removing background and can improve a good foundation for the subsequent of paper currency extraction.

Abstract: in the RFID system, the conflict caused by the multi-label has been affecting system performance. This paper proposed a grouping dynamic framed slotted ALOHA algorithm based on the analysis of ALOHA algorithm. According to the conflict situation, to make real-time estimates the number of tags on the dynamic framed slotted ALOHA algorithm from the mathematical point of view, Dynamically change the frame length or the labels are grouped to reduce the label probability of collisions, thereby improving the efficiency of the recognition.