Applied Mechanics and Materials Vols. 513-517

Abstract: Recently,WTN chess is just emerging as a computer game of Artificial Intelligence Competition in China which lacks of algorithm research. This article attempts to research how to get rid of randomness in the game of WTN chess and lets the program make the right choice to analysis and return a relatively best solution.This article also achieves a greedy algorithm based on enumeration and offensive strategies, and provides an algorithm of situation assessment.It is demonstrated that the algorithm is effective.

Abstract: With the rapid development of network technology and the emergence of a variety of applications,network security issues became the top priority of the network applications. This article first explains the concept of buffer overflow,and then from the programming language itself flawed,not robust perspective on the emergence,to the emergence of buffer overflow attacks and principle are analyzed in detail,described hackers using buffer overflow attacks the general process,and according to the type of buffer overflow attacks,software development and program runs from two aspects of proposed buffer overflow attack prevention strategy.

Abstract: BATAMAN (Better Approach to Mobile Ad-hoc Networking) is a new wireless Mesh network protocol. The algorithm of BATMAN protocol was analyzed, the BATMAN protocol was designed based the embedded Linux and realized on the self-developed wireless Mesh node mounting multiple Wi-Fi modules. The pragmatic performance was test in the multi-hop Mesh prototype network. The result shows that: the characteristics of throughput and latency of BATMAN protocol which is lightweight, rapid convergence and efficient can meet the real-time and broadband transmission requirement of wireless Mesh network.

Abstract: Wireless sensor networks (WSNs) are attracting great interest in a number of application domains concerned with monitoring and control of physical phenomena, as they enable dense and boundless deployments at low-cost and with excellent flexibility. Extensive usage of WSN is the reason of development of any routing protocols. The main contribution of this article is an extensive survey and classification of the routing protocols in WSN. Routing protocols are classified under seven categories (Location-Based, Data Centric, Hierarchical-Based, Mobility-Based, Multipath-Based, Heterogeneity based and Quality of Service (QoS)-Based.). Each protocol is described and discussed with advantage and disadvantages. The challenges faced by WSN are also mentioned in this paper and finally to set the milestone for future work. For researchers, this paper serves as a starting point into research in designing routing protocols for WSNs effectively and efficiently. Any reader who is interested in improving their knowledge of the technical concepts will find a list of references and recent publications at the end of this paper.

Abstract: An IMMRPF class-conditioned joint tracking and classification (IMMRPF-CCJTC) algorithm is proposed in this paper. This IMMRPF-CCJTC algorithm is integrated by Bayesian classifier and class-conditioned Bayesian multiple model filter that is implemented by IMMRPF. It relies on the low-resolution radar and electronic support equipment (ESM) as its kinematic sensor and attribute sensor, respectively, and has good modular structure and less computational load. Simulations verify the effectiveness of the IMMRPF-CCJTC algorithm.

Abstract: In the paper applying the OWL extend the uncertaintys express of ontology to the knowledge domain, realize the uncertainty reasoning of the ontology domain knowledge based Bayesian Network, the experiment tell us that combine the Bayesian Network and ontology can display the abilities full on the knowledge description to the ontology and reasoning abilities to the Bayesian Network, realizing being based on partial information description of probability to obtain knowledge and guide the practice.

Abstract: Principal Component Pursuit (PCP) recovers low-dimensional structures from a small set of linear measurements, such as low rank matrix and sparse matrix. Pervious works mainly focus on exact recovery without additional noise. However, in many applications the observed measurements are corrupted by an additional white Gaussian noise (AWGN). In this paper, we model the recovered matrix the sum a low-rank matrix, a sparse matrix and an AWGN. We propose a weighted PCP for the recovery matrix, which is solved by alternating direction method. Numerical results show that the reconstructions performance of weighted PCP outperforms the classical PCP in term of accuracy.

Abstract: In this paper, we propose a kind of pseudorandom bit generator based on varying time delayed logistic map. The variation of delay time is chaotic. The experiments show that the generated binary sequences have good cryptographic properties, and can pass all the well known statistical tests.

Abstract: In the process of memory pre-copy, aiming at the characteristic which the dirty pages may be re-transmitted, dirty pages based on the probability prediction pre-copy mechanism is proposed, which aims to reduce the data transmission and total migration time. The mechanism uses temporal locality principle, on the pages before transmission, probability prediction for memory page, give priority to transmission of dirty pages prediction probability low memory pages, avoiding high dirty pages resend. Simulation results show that: the mechanism can reduce the amount of data transmission, reducing downtime and total migration time.

Abstract: This paper firstly describes the basic principle of turbo rate matching.on the basic .the paper introduces a rate de-matching program of the available DSP implementation.compared to the conventional algorithm .the program reduces the processing time and the need to handle the amount of data and improves the processing efficiency.it has been implemented in TMS320C6455and the application running in CCS3.3, MATLAB verifies that this scheme is feasible and effective.