Advanced Materials Research Vols. 756-759

Abstract: Membrane computing (P system) is a new computing model; it comes from the research of the basic function and structure of creatures cell membrane. It has complex structure and multi-level. It converges quickly and has high quality of the optimal results. In this article, discussed the basic theory of the membrane computing and the steps of the algorithm. Apply Membrane computing principle to the differential evolution algorithm, constructed a hybrid differential evolution algorithm on the basis of the membrane structure. Finally, utilized the Objective Functions to test the new algorithm performance, compared with related algorithms to analyze the advantages and disadvantages of the new algorithm.

Abstract: In order to improve the poor reality and bad flexibility of the mapping relationship which matched entities with aim locations in traditional approximation method, the formation vector shortest path-planning method was presented in this paper. By analyzing the lack of aim path-planning in the approximation method, shortest path-planning was discussed and was improved by introducing the formation vector and the idea of pheromone. Furthermore, the improved algorithm was applied in a CGF simulation system. The experimental results showed that the mapping relationship had better reality and rationality and the possibility of collision was significantly reduced than the traditional formation change process.

Abstract: The paper discusses the time-domain blind seperation applied to communication signals, using an ICA algorithm EFICA together with a wavelet de-noising processing method. In the Blind source separation system, regardless of the mixed signals and separated signals, noise pollution occurs frequently, it increases the complexity of BSS and the difficulty of dealing with the aftermath. So an automatic method of and wavelet de-noising processing is proposed finally. It yields good results in the experiment and improves the performance of BSS system.

Abstract: On basis of summarizing the existing isogram filling algorithm, this paper puts forwards a direct filling algorithm of isogram in complex boundary. Compared with the point-by-point scanning method and algorithm of area filling, this new algorithm has no necessity not only in point-by-point calculation of interpolation, but also in tracing inclusion relation between equivalent areas and determination areas, which makes filling speed faster. It is proved with practice that the new method can fill isopleth map in milliseconds.

Abstract: In order to obtain high precision results of urban air quality forecast, we propose a short-term predictive model of air quality in this paper, which is on the basis of the ambient air quality monitoring data and relevant meteorological data of a monitoring site in Licang district of Qingdao city in recent three years. The predictive model is based on BP neural network and used to predict the ambient air quality in the next some day or within a certain period of hours. In the design of the predictive model, we apply LM algorithm, Simulated Annealing algorithm and Early Stopping algorithm into BP network, and use a reasonable method to extract the historical data of two years as the training samples, which are the main reasons why the prediction results are better both in speed and in accuracy. And when predicting within a certain period of hours, we also adopt an average and equivalent idea to reduce the error accuracy, which brings us good results.

Abstract: Dynamic Terrain is becoming more and more important in ground-based simulation systems. In military simulation systems, craters and ruts can improve the reality. In this paper, a dynamic terrain visualization method based on quadtree and multi-resolution voxel is presented in order to realize the real-time rendering for realistic craters in battlefield. Quadtree is selected as our basic data structure and mix-subdivided according to the size of the terrain. Scene tree is recursive subdivided according to both the distance between the node and camera and error criterion. Vertex is removed to solve the cracks and linear interpolation to solve popping in the algorithm. We also implement the visualization of craters through combining our algorithm with the physical model of craters based on multi-resolution voxel. The implementation results prove that the method are feasible and efficient.

Abstract: The parameter bw is a distance bandwidth between 0 and 1 in harmony search algorithm, which helps the algorithm in finding globally and locally improved solution. In this paper, a new harmony search algorithm is proposed in order to improve the convergence speed and the global search algorithm of the harmony search algorithm. The parameter bw is adjusted based on cloud theory in this new algorithm. The new algorithm is tested on some benchmark functions and the results are compared with the result of the traditional harmony search. Experimental results indicate that the new harmony search algorithm has a good performance in the global search ability and convergent speed.

Abstract: The hidden markov model is a kind of important probability model of series data processing and statistical learning and it has been successfully applied in many engineering tasks. This paper introduces the basic principle of hidden markov model firstly, and then discusses the limitations of hidden markov model, as well as the improved hidden markov model which is put forward to solve these problems.

Abstract: Aiming at knowledge reasoning ability of fuzzy petri net depending on the parameter and the parameters usually obtained by specialist, an algorism based on artificial immune algorism for obtaining the optimum parameters was proposed. Firstly, the fuzzy petri net and generating rules were defined and described, and then the coding method of antibody, Affinity evaluation function and Simulated Annealing immune selection operator are designed to improve the classic artificial immune algorism. The specific algorism based on this improved artificial algorism was defined. The simulation experiment shows the method in this paper can accurately realize the parameters optimizing and has the litter square error, compared with the other methods, our method has the quick global convergence rate, optimizing ability and strong Versatility.

Abstract: RFID is one of the most important technologies in the Internet of Things (IoT), which has been widely used in all kinds of fields. However, a key problem is the tag collision when multiple tags reflect simultaneously to a reader. In traditional algorithm, slot location is always ignored. We present an anti-collision algorithm based on tag estimation and slot location in this paper. The key technique can be divided into two parts: precisely tag estimation and slot location. Simulation and test results show that the proposed anti-collision algorithm performs better than the traditional algorithm despite its simplicity.