入侵检测的CPN改进算法的研究

结合神经网络方法,对入侵检测技术的聚类分析方法进行了研究和分析,探讨了在传统的对偶传播神经网络（Counter Propagation Networks,CPN）的基础上,引入基因表达式编程（Gene Expression Programming,GEP）对聚类进行优化,提出一种应用于入侵检测的CPN改进算法,该方法融...     

混合蛙跳算法神经网络及其在语音情感识别中的应用

该文将混合蛙跳算法(SELA)优化方法应用于人工神经网络训练中,对6种语音情感进行了语音情感特征的分析与识别。研究了谐波噪声比特征随情感类别的变化特性。利用混合蛙跳算法训练随机产生的初始数据优化神经网络的连接权值,快速实现了网络收敛。实验比较了BP神经网络、RBF神经网络和SFLA神经网络的语音情感识别性能。结果表明,SFLA神经网络的平均识别率分别高于BP神经网络和RBF神经网络4.7%和4.3%。     

A KNN-based two-step fuzzy clustering weighted algorithm for WLAN indoor positioning

Although k-nearest neighbors (KNN) is a popular fingerprint match algorithm for its simplicity and accuracy,because it is sensitive to the circumstances,a fuzzy c-means (FCM) clustering algorithm is applied to improve it.Thus,a KNN-based two-step FCM weighted (KTFW) algorithm for indoor positioning in wireless local area networks (WLAN) is presented in this paper.In KTFW algorithm,k reference points (RPs) chosen by KNN are clustered through FCM based on received signal strength (RSS) and location coordinates.The right clusters are chosen according to rules,so three sets of RPs are formed including the set of k RPs chosen by KNN and are given different weights.RPs supposed to have better contribution to positioning accuracy are given larger weights to improve the positioning accuracy.Simulation results indicate that KTFW generally outperforms KNN and its complexity is greatly reduced through providing initial clustering centers for FCM.     

非线性Hammerstein-Wiener模型辨识预测控制

为解决工业过程控制领域中非线性系统的模型辨识与预测控制问题,提出一种基于BP神经网络模型的预测控制策略,采用一种分段最小二乘支持向量机辨识Hammerstein-Wiener模型系数的方法建立非线性预测控制器.利用BP神经网络训练预测控制输入序列和拟牛顿算法求解非线性预测控制律,从而实现了一种基于支持向量机Hammerstein-Wiener辨识模型的非线性预测控制算法.仿真实验验证了该算法的有效性和可行性.     

Reliable and Energy Efficient Target Coverage for Wireless Sensor Networks

A critical aspect of applications with Wireless Sensor Networks (WSNs) is network lifetime.Power-constrained WSNs are usable as long as they can communicate sense data to a processing node.Poor communication links and hazardous environments make the WSNs unreliable.Existing schemes assume that the state of a sensor covering targets is binary:success (covers the targets) or failure (cannot cover the targets).However,in real WSNs,a sensor covers targets with a certain probability.To improve WSNs’ reliability,we should consider that a sensor covers targets with users’ satisfied probability.To solve this problem,this paper first introduces a failure probability into the target coverage problem to improve and control the system reliability.Furthermore,we model the solution as the α-Reliable Maximum Sensor Covers (α-RMSC) problem and design a heuristic greedy algorithm that efficiently computes the maximal number of α-Reliable sensor covers.To efficiently extend the WSNs lifetime with users’ pre-defined failure probability requirements,only the sensors from the current active sensor cover are responsible for monitoring all targets,while all other sensors are in a low-energy sleep mode.Simulation results validate the performance of this algorithm,in which users can precisely control the system reliability without sacrificing much energy consumption.     

Multi-Axis Projection Based Giant Component Formation in Random Unit-Disk Graphs

This paper proposes a multi-axis projection (MAP) based giant component formation strategy via the Maximal Independent Set (MIS) in a random unit-disk graph.We focus on the problem of virtual back-bone construction in wireless ad hoc and sensor networks,where the coverage areas of the nodes are disks with identical radii.In the simulation,we show that the MAP-based giant component has the ability to connect most nodes and serves as a backbone in the network.The algorithm is localized and may play an important role in efficiently constructing a virtual backbone for ad hoc and sensor networks.     

A novel approach of hybrid genetic optimization with elite ant colony: Application in the modulation recognition

A novel approach (HGO-EAC) for hybrid genetic op-timization (GO) with elite ant colony (EAC) is proposed for the automatic modulation recognition of communication signals,through which we improve the basic ant colony algorithms by referencing elite strategy and present a new fusion strategy for genetic optimization and elite ant colony. This approach is used to train the neural networks as the classifier for modulation. Simula-tion results indicate good performance on an additive white Gaus-sian noise (AWGN) channel,with recognition rate reaching to 70% especially for CW even at signal-to-noise ratios as low as 5 dB. This approach can achieve a high recognition rate for the typical modulations such as CW,4ASK,4FSK,BPSK,and QAM16. Test result shows that it has better performance than BP algorithm and basic ant colony algorithms by achieving faster training and stronger robustness.     

基于复杂网络的上海证券交易所富人俱乐部特性研究

利用2009年在上海证券交易所股票数据建立股票之间的关联网络,分析表明该网络属于典型的稀疏型无标度网络,网络中存在较多的连接甚为紧密的Hub节点,它们影响着网络的传播动力学行为.然后采用分段线性拟合的方式找到了上海证券交易所的富人俱乐部,分析了Hub点集以及富人俱乐部对整体股市的影响,并且发现采用网络的观点可以诊断出股...     

应用邻接多重表存储结构的配电网可靠性评估算法

结合复杂配电网的特点,提出基于邻接多重表的复杂配电网可靠性评估分块算法。首先给出适合于配电网数据存储的邻接多重表构造方法及存储结构,解决了网络搜索的空间、时间复杂度问题。基于此提出配电网前推回代潮流计算方法及配电网可靠性评估的分块形成算法。该算法可使配电网潮流计算与可靠性评估分块算法采用同种存储结构,简化了配电网可靠性计算程序的编制,并可节省计算时间。应用该算法对RBTS-BUS6及实际工程系统进行了可靠性评估,算例表明该算法可有效减少计算时间,具有较高的工程实用价值。     

用逻辑方法验证移动Ad Hoc网络协议

针对移动Ad Hoc网络节点移动和无线广播通信特征,引入移动算子和广播算子,扩展形式逻辑LS2,提出了建模和分析移动Ad Hoc网络安全系统的逻辑ELS2.ELS2把网络模型化为不同位置上执行程序的线程复合,把攻击者模型化为与协议参与方并发运行的线程.ELS2中提出网络迹概念,描述网络节点内部计算和外部交互,以及节点移...