RFID系统优化模型与智能算法研究

射频识别技术（Radio Frequency Identification, RFID）作为采集与处理信息的高新技术和信息化标准的基础，被列为本世纪十大重要技术之一。但是，RFID技术的大规模实际应用仍处于探索阶段，RFID系统的应用基础技术还存在着大量尚未解决的关键问题，其中RFID系统优化是RFID技术研究和应用的重要课题。由于RFID系统本身的动态性和不确定性， RFID系统优化面对的一般是非线性、多目标、大规模的复杂优化问题，传统的数学优化算法在处理这些问题时，存在困难。为此，研究新的优化算法成为RFID技术实际应用和理论研究中必须解决的课题。 智能计算方法是求解复杂RFID系统优化问题的一种可供选择的算法。智能计算作为一个新兴领域，其发展已引起了多个学科领域研究人员的关注，目前已经成为人工智能、经济、社会、生物等交叉学科的研究热点和前沿领域。智能计算的各类算法已在传统NP问题求解及诸多实际应用领域中展现出其优异的性能和巨大的发展潜力。 本文旨在对RFID系统的各种优化问题进行深入研究和探讨，面向RFID技术的实际应用需求构建其优化模型，并基于智能计算思想设计能够有效求解这些复杂模型的新型智能优化算法。具体研究内容包括： 首先，进行了RFID读写器网络的调度问题研究。在深入分析RFID网络中读写器冲突类型和成因的基础上，考虑RFID网络中的读写器冲突约束，以最小化系统中的频道数量、时隙分配以及总处理时间建立了RFID读写器网络调度的数学优化模型。从生物学的角度出发提出基于生态捕食模型的改进PSO算法（Particle Swarm Optimizer based on Predator-prey Coevolution, PSOPC），在一定程度上解决了PSO算法在迭代后期随着多样性丧失而陷入局部最优的缺点。应用PSOPC设计了求解RFID读写器网络调度模型的智能求解算法，分别给出算法的求解框架、关键步骤的实现机制。通过在不同规模的RFID读写器网络上进行实例仿真，验证了算法的有效性和模型的正确性。 其次，进行了基于菌群自适应觅食算法RFID网络规划问题的研究。考虑RFID系统在不同应用环境下的系统需求，建立了RFID网络规化的数学模型，其目标函数分别为：RFID网络标签覆盖率的最大化目标函数、RFID读写器冲突的最小化目标函数、RFID网络运行的经济效益最大化目标函数、RFID网络运行的负载平衡目标函数以及同时考虑全局目标的混合目标函数。将自然界生物觅食所采用的自适应搜索策略与细菌的趋化行为和群体感应机制相集成，提出了适合求解复杂RFID网络规划问题的菌群自适应觅食算法（Adaptive Bacterial Foraging Optimization, ABFO）。通过仿真实验基于ABFO算法分别对RFID网络规划模型中的五个目标函数进行了实例求解和分析，测试结果与标准PSO算法和遗传算法进行了比较分析。 再次，进行了基于系统智能方法的RFID网络规划分布式决策模型研究。采用分布式决策的思想建立了RFID网络规划的层次模型，在一定程度上缓解、分散了RFID网络规划问题的复杂性，以解决具有混合变量（包括离散变量和连续变量）的多目标RFID网络规划问题。针对层次模型求解的复杂性，以复杂适应系统理论为指导思想设计了一种新型系统智能优化算法对RFID网络规划的层次模型进行求解。系统智能算法将群体智能中的单层群体系统概念扩展为多层涌现系统，仿真实验表明新提出的算法显著提高了智能计算方法的寻优能力，以及算法的适应性、鲁棒性和平衡性等性能。 最后，进行了RFID网络目标跟踪系统中的数据融合研究。以基于RFID技术的目标定位与跟踪系统为应用背景，提出了基于模糊聚类方法的多RFID读写器数据融合模型框架。通过深入分析蜜蜂采蜜的基本生物学规律，对蜜蜂的个体行为及群体行为进行模拟，提出了一类新型群体智能优化算法-蜂群优化算法（Bee Swarm Optimization, BSO），并将BSO算法嵌入RFID目标定位跟踪系统，作为其模糊聚类的基本算法。仿真研究表明，提出的融合模型能够有效的过滤读写器对跟踪目标的错误监测数据，显著提高目标定位与跟踪的精度。

Path Planner for Intelligent Laser Surface Modification

An optimal algorithm of manufacturing path planner for intelligent laser surface modification is presented. Elements included in the optimal objective have been analyzed. A 6-D manufacture trace that satisfies the requirements of special craft and 5-axis laser processing robot system has been generated from the path planner by method of parallel section in which combinations of modification spots size with curvature of processing surfaces and modification craft parameters are considered. Related experiments have been successfully carried out with the computer integrated multifunctional laser manufacturing system.

The Relationship between Decision Trees and the Scale of Train Data Set

Decision Trees need train samples in the train data set to get classification rules. If the number of train data was too small, the important information might be missed and thus the model could not explain the classification rules of data. While it is not affirmative that large scale of train data set can get well model. This Paper analysis the relationship between decision trees and the train data scale. We use nine decision tree algorithms to experiment the accuracy, complexity and robustness of decision tree algorithms. Some results are demonstrated.

The Intelligent Measuring Sub-System in the Computer Integrated and Flexible Laser Processing System

Based on the computer integrated and flexible laser processing system, develop the intelligent measuring sub-system. A novel model has been built to compensate the deviations of the main frame, a new-developed 3-D laser tracker system is applied to adjust the accuracy of the system. Analyzing the characteristic of all kinds of automobile dies, which is the main processing object of the laser processing system, classify the types of the surface and border needed to be measured and be processed. According to different types of surface and border, develop 2-D adaptive measuring method based on B?zier curve and 3-D adaptive measuring method based on spline curve. During the data processing, a new 3-D probe compensation method has been described in details. Some measuring experiments and laser processing experiments are carried out to testify the methods. All the methods have been applied in the computer integrated and flexible laser processing system invented by the Institute of Mechanics, CAS.

New Numerical Algorithms in SUPER CE/SE and Their Applications in Explosion Mechanics

The new numerical algorithms in SUPER/CESE and their applications in explosion mechanics are studied. The researched algorithms and models include an improved CE/SE (space-time Conservation Element and Solution Element) method, a local hybrid particle level set method, three chemical reaction models and a two-fluid model. Problems of shock wave reflection over wedges, explosive welding, cellular structure of gaseous detonations and two-phase detonations in the gas-droplet system are simulated by using the above-mentioned algorithms and models. The numerical results reveal that the adopted algorithms have many advantages such as high numerical accuracy, wide application field and good compatibility. The numerical algorithms presented in this paper may be applied to the numerical research of explosion mechanics.

Optimization of positions and currents of tokamak poloidal field coils using genetic algorithms

Plasma equilibrium geometry has a great influence on the confinement and magnetohydrodynamic stability in tokamaks. The poloidal field (PF) system of a tokamak should be optimized to support the prescribed plasma equilibrium geometry. In this paper, a genetic algorithm-based method is applied to solve the optimization of the positions and currents of tokamak PF coils. To achieve this goal, we first describe the free-boundary code EQT Based on the EQT code, a genetic algorithm-based method is introduced to the optimization. We apply this new method to the PF system design of the fusion-driven subcritical system and plasma equilibrium geometry optimization of the Experimental Advanced Superconducting Tokamak (EAST). The results indicate that the optimization of the plasma equilibrium geometry can be improved by using this method.

Phase unwrapping algorithms, respectively, based on path-following and discrete cosine transform

This paper describes a path-following phase unwrapping algorithm and a phase unwrapping algorithm based on discrete cosine transform (DCT) which accelerates the Computation and suppresses the propagation of noise. Through analysis of fringe pattern with serious noises simulated in mathematic model, we make a contrast between path-following algorithm and DCT algorithm. The advantages and disadvantages or analytical fringe pattern are also given through comparison of two algorithms. Three-dimensional experimental results have been given to prove the validity of these algorithms. Despite DCT phase unwrapping technique robustness and speed in some cases, it cannot be unwrapping inconsistencies phase. The path-following algorithm can be used in automation analysis of fringe patterns with little influence of noise. (c) 2007 Elsevier GmbH. All rights reserved.

Design of triangular lattice photonic crystals using genetic algorithms

Genetic Algorithms (GAs) were used to design triangular lattice photonic crystals with large absolute band-gap. Considering fabricating issues, the algorithms represented the unit cell with large pixels and took the largest absolute band-gap under the fifth band as the objective function. By integrating Fourier transform data storage mechanism, the algorithms ran efficiently and effectively and optimized a triangular lattice photonic crystal with scatters in the shape of 'dielectric-air rod'. It had a large absolute band gap with relative width (ratio of gap width to midgap) 23.8%.

New algorithms of the TSM and TOM methods for calibrating microwave test fixtures

Based on the conventional through-short-match (TSM) method, an improved TSM method has been proposed in this Letter. This method gives an analytical solution and has almost all the advantages of conventional TSM methods. For example, it has no phase uncertainty and no bandwidth limitation. The experimental results show that the accuracy can be significantly improved with this method. The proposed theory can be applied to the through-open-match (TOM) method. (C) 2002 Wiley Periodicals. Inc.

Structure approximate based on double weighted neural network

Double weighted neural network; is a kind of new general used neural network, which, compared with BP and RBF network, may approximate the training samples with a move complicated geometric figure and possesses a even greater approximation. capability. we study structure approximate based on double weighted neural network and prove its rationality.