Iterative algorithm of steered minimum variance and its application in weak targets detection

The steered covariance matrix (STCM) and its inverse matrix should be calculated in each beam for steered minimum variance (STMV). The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix, an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors, and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target’s azimuth even when the source powers differ in large scales or their bearings are very approximate.     

Outlier mining based abnormal machine detection in intelligent maintenance

Assessing machine’s performance through comparing the same or similar machines is important to implement intelligent maintenance for swarm machine. In this paper, an outlier mining based abnormal machine detection algorithm is proposed for this purpose. Firstly, the outlier mining based on clustering is introduced and the definition of cluster-based global outlier factor (CBGOF) is presented. Then the modified swarm intelligence clustering(MSIC) algorithm is suggested and the outlier mining algorithm based on MSIC is proposed. The algorithm can not only cluster machines according to their performance but also detect possible abnormal machines. Finally, a comparison of mobile soccer robots’ performance proves the algorithm is feasible and effective.     

基于云变换和特性关系下粗糙集的决策树构造

为了从不完备信息系统中挖掘分类知识,提出了一种基于云变换和特性关系下粗糙集的决策树构造算法(DTCCRSCR).其核心思想是,利用云变换离散化连续型数据,选择特性关系下加权平均粗糙度最小的属性作为当前的分裂节点.实验表明,由DTCCRSCR构造的决策树不仅结构简单,分类准确率较高,而且分类规则也容易理解.     

Implementation of dynamic matrix control on field programmable gate array

High performance computer is often required by model predictive control (MPC) systems due to the heavy online computation burden. To extend MPC to more application cases with low-cost computation facilities, the implementation of MPC controller on field programmable gate array (FPGA) system is studied. For the dynamic matrix control (DMC) algorithm, the main design idea and the implemental strategy of DMC controller are introduced based on a FPGA’s embedded system. The performance tests show that both the computation efficiency and the accuracy of the proposed controller can be satisfied due to the parallel computing capability of FPGA.     

Feasibility study for the application of air inflated membrane structure in China National Stadium

China National Stadium, also known as “Bird’s Nest”, is the main stadium of the 29th Olympic Games in Beijing in 2008, which has successfully held not only the Opening and the Closing ceremonies but also the track and field events. A new problem of rain preventing is brought out to improve the utilization of the Bird’s Nest after the Olympic Games. The scheme of installing an air inflated membrane at the opening of the steel structure is proposed in this paper to solve the rainproof problem of the Bird’s Nest. The form-finding and mechanical analyses of the air inflated membrane are carried out. Comparison between the mechanical performance and dynamical character before and after installing the air inflated membrane structure is given. To verify the analysis results, based on the practical structure of the Bird’s Nest, a test of a 1:20 model membrane is worked out.     

Color image segmentation by edge linking and region grouping

A novel method toward color image segmentation is proposed based on edge linking and region grouping. Firstly, the edges extracted by the Canny detector are linked to form regions. Each of the end points of edges is connected by a direct line to the nearest pixel on another edge segment within a sub-window. A new distance is defined based on the feature that the edge tends to preserve its original direction. By sampling the lines to the image, the image is over-segmented to labeled regions. Secondly, the labeled regions are grouped both locally and globally. A decision tree is constructed to decide the importance of properties that affect the merging procedure. Finally, the result is refined by user’s selection of regions that compose the desired object. Experiments show that the method can effectively segment the object and is much faster than the state-of-the-art color image segmentation methods.     

Location and design decisions of facilities in a distribution system with elastic customer demand

This paper describes a bi-level programming model that seeks to simultaneously optimize location and design decisions of facilities in a distribution system in order to realize company’s maximal total profit subject to the constraints on the facility capacity and the investment budget. In the upper-level problem, two-echelon integrated competitive/uncompetitive capacitated facility location model, which involves facility location and design, is presented. In the lower-level problem, customer is assumed to patronize store based on facility utility which is expressed by service time cost in the store and its travel cost to customer. Customer’s facility choice behavior is presented by a stochastic user equilibrium assignment model with elastic demand. Since such a distribution system design problem belongs to a class of NP-hard problem, a genetic algorithm (GA)-based heuristic procedure is presented. Finally, a numerical example is used to illustrate the application of the proposed model and some parameter sensitivity analyses are presented.     

基于随机森林算法的电力系统暂态稳定性评估

利用随机森林算法,通过组合多棵基于随机向量的决策树对电力系统的暂态稳定性分类,提出了一种暂态稳定评估模型.在IEEE 16机和IEEE 50机测试系统进行的仿真验证了该模型对暂态稳定评估的有效性,其评估性能较经典决策树算法、人工神经网络、支持向量机和K最近邻方法均有提高.     

Discretization Algorithm Based on Particle Swarm Optimization and Its Application in Attributes Reduction for Fault Data

In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matrix-based reduction method depends on whether the numerical attributes can be properly discretized or not. So a discretization algorithm based on particle swarm optimization (PSO) is proposed. Moreover, hybrid weights are adopted in the process of particles evolution. Comparative calculations for certain equipment are completed to demonstrate the effectiveness of the proposed algorithm. The results indicate that the proposed algorithm has better performance than other popular algorithms such as class-attribute interdependence maximization (CAIM) discretization method and entropy-based discretization method.     

A probability approach to anomaly detection with twin support vector machines

AbstractClassification of intrusion attacks and normal network flow is a critical and challenging issue in network security study. Many intelligent intrusion detection models are proposed, but their performances and efficiencies are not satisfied to real computer networks. This paper presents a novel effective intrusion detection system based on statistic reference model and twin support vector machines (TWSVMs). Moreover, a network flow feature selection procedure has been studied and implemented with TWSVMs. The performances of proposed system are evaluated through using the fifth international conference on knowledge discovery and data mining in 1999 (KDD’99) data set collected at MIT’s Lincoln Labs and the results indicate that the proposed system is more efficient and effective than conventional support vector machines (SVMs) and TWSVMs.     

回收物流设施多层选址模型及其算法

针对废弃物品的收集、预处理和再制造问题，建立了回收物流设施选址混合整数规划（MILP）模型，用分枝定界法求解，为提高分枝定界法的收敛速度、减少运算量，先用遗传算法为MILP找到较好的可行解，以其对应的目标函数值为分枝界定法上界，从而可以在分枝界定法的搜索中剪去大量分枝．用算例证明了算法的有效性和可行性．     

基于公交IC 卡数据的上车站点推算研究

为了分析城市公交乘客的出行特征,本文利用公交IC 卡及GPS数据对公交IC 卡乘客上车站点推算进行研究.针对安装车载GPS设备的车辆,运用GPS数据与IC 卡数据融合算法进行推算;对于无车载GPS设备的情况,为适应一票制IC 卡数据挖掘,对贝叶斯决策树算法进行改进,允许节点跳跃,推算上车站点,并且利用Markov 链特性降低算法的运算复杂度.同时,本文以北京公交数据为例,对提出的两种方法进行验证.结果表明,利用本文提出的方法推算上车站点,3 站之内误差的准确率达到90%以上,算法在兼顾算法精度的同时合理地控制了运算复杂度,可以实际运用于城市公交系统.     

Security analysis of application layer protocols on wireless local area networks

This paper aims at analyzing the security issues that lie in the application layer (AL) protocols when users connect to the Internet via a wireless local area network (WLAN) through an access point. When adversaries launch deauthentication flood attacks cutting users’ connection, the connection managers will automatically research the last access point’s extended service set identifier (ESSID) and then re-establish connection. However, such re-connection can lead the users to a fake access point with the same ESSID set by attackers. As the attackers hide behind users’ access points, they can pass AL’s authentication and security schemes, e.g. secure socket layer (SSL). We have proved that they can even spy on users’ account details, passwords, data and privacy.     

一种基于激光与视频信息时空数据融合的行人检测方法

针对城市交通行人安全问题,本文提出了一种基于激光与视频数据融合的行人检测方法.通过激光与视频数据空间和时间上的融合,将激光数据映射到图像坐标;在激光聚类过程中,采用K-means 聚类算法对激光云点进行聚类分析,然后运用行人宽度模型提取候选行人区域;在基于图像的行人检测过程中,选取头肩、躯干以及腿部人体特征部位,采用Haar-like 特征集和Boosting 算法进行训练,得到部位检测器;最后,基于贝叶斯决策的组合策略对候选行人区域进行有效判定.实验结果表明,本文所述算法有较好的检测精度和实时性能.     

WDM全光网络中的多播路由与波长分配算法

研究了全光网络中的多播路由和波长分配问题，结合波长图模型，提出了一种波长可变WDM全光网络的多播路由和波长分配算法，算法将路由和波长分配统一进行，通过动态调整节点与当前树的代价值构造时延受限低代价多播树，避免了同类算法的较高复杂性。     

基于定长帧的组播QoS路由技术

为高效利用网络资源且平衡负载,结合物理帧时槽交换技术,提出了基于定长帧的组播机制和QoS路由算法MRBP.该算法在满足带宽和时延要求的基础上,最小化时延和平衡节点负载,达到组播树总体时延较小并优化利用网络资源的目的.仿真结果表明,基于该算法建立的组播树具有较好的网络负载平衡性,并能够对服务质量提供较好的保证.     

The factors analysis and algorithm implementation of single-pattern matching

By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are: sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It’s proven by the experiment that the efficiency of new algorithm is the best of all algorithms. Foundation item: the National Natural Science Foundation of China (Nos. 60502032 and 60672068)     

一种有效的水声信道盲均衡算法

针对超指数迭代判决反馈盲均衡（SEIDFE）算法在水声通信系统中表现出的收敛性差的问题,提出了一种稳健性好、收敛快的双模式超指数迭代判决反馈盲均衡算法.该算法对均衡器输出的实部和虚部分别进行非线性变换以修正误差控制信号,从而纠正载波相位旋转;在此基础上,将一种新的自适应变步长算法应用到前馈滤波器前向权值的迭代步长中,提高算法收敛速度;并采取判决误差切换准则,将上述改进算法与判决导引算法有机结合起来,提高算法稳健性和收敛性能.仿真结果证明了该算法的有效性.     

震后恢复期物资配送中的多周期选址-联运问题

震后恢复期的物资配送是一项复杂的系统工程,针对震后恢复期两级救援物资 配送系统中的多品种物资、多运输方式、多周期决策等特征,提出了一个以系统总费用最 小为目标的混合整数线性规划模型,用以解决震后恢复期救援物流系统中的选址-联运 问题.针对该模型的特点,设计了一种结合启发式规则的分周期、分阶段解码的混合遗传 算法. 以“5.12”汶川大地震恢复期救援物资保障过程构建算例,对该模型和算法进行了实 例验证. 结果表明,该算法具有较好的性能,可以有效解决震后恢复期物资配送中的多周 期选址-联运问题.     

Algorithm for Extracting All Relative-Attribute Reducts in Decision System of Large-Scale Records

A new algorithm based on rough core was proposed to extract all relative-attribute reducts in decision information systems of large-scale records. In the algorithm, the rough core of the decision-making information system is first calculated. Then, an approach based on a top-down strategy is adopted to select the non-core condition attributes and generate candidate relative-attribute reducts. Finally, the set of all relative-attribute reducts is obtained by pruning the candidate relative-attribute reducts. Experimental results show that the proposed algorithm is superior to the other methods such as the algorithm without computing core, the exhaustive method and the discernibility matrix method in extracting all relative-attribute reducts for large-scale data sets.