Modeling contaminant intrusion in water distribution networks: A new similarity-based DST method

Contaminant intrusion in a water distribution network is a complex but a commonly observed phenomenon, which depends on three elements – a pathway, a driving force and a contamination source. However, the data on these elements are generally incomplete, non-specific and uncertain. In an earlier work, Sadiq, Kleiner, and Rajani (2006) have successfully applied traditional Dempster–Shafer theory (DST) to estimate the “risk” of contaminant intrusion in a water distribution network based on limited uncertain information. However, the method used for generating basic probability assignment (BPA) was not very flexible, and did not handle and process uncertain information effectively. In this paper, a more pragmatic method is proposed that utilizes “soft” computing flexibility to generate BPAs from uncertain information. This paper compares these two methods through numerical examples, and demonstrates the efficiency and effectiveness of modified method.     

无线传感器网络节点自身定位算法研究

无线传感器网络中节点自身位置信息是实现其应用的最重要因素之一.针对节点自身定位的研究很多,但很大一部分都集中在算法的改进和新算法的开发上,很少给出纵向直观的仿真效果比较.研究选取无需测距算法中4种典型的算法,给出它们在不同参数下的仿真定位效果图,对于工程人员根据实际选取最优算法有很好的借鉴作用.在此基础上,利用曲线拟合...     

Least squares twin support vector machines for pattern classification

In this paper we formulate a least squares version of the recently proposed twin support vector machine (TSVM) for binary classification. This formulation leads to extremely simple and fast algorithm for generating binary classifiers based on two non-parallel hyperplanes. Here we attempt to solve two modified primal problems of TSVM, instead of two dual problems usually solved. We show that the solution of the two modified primal problems reduces to solving just two systems of linear equations as opposed to solving two quadratic programming problems along with two systems of linear equations in TSVM. Classification using nonlinear kernel also leads to systems of linear equations. Our experiments on publicly available datasets indicate that the proposed least squares TSVM has comparable classification accuracy to that of TSVM but with considerably lesser computational time. Since linear least squares TSVM can easily handle large datasets, we further went on to investigate its efficiency for text categorization applications. Computational results demonstrate the effectiveness of the proposed method over linear proximal SVM on all the text corpuses considered.     

通用稀疏多核学习

针对L1范数多核学习方法产生核权重的稀疏解时可能会导致有用信息的丢失和泛化性能退化,Lp范数多核学习方法产生核权重的非稀疏解时会产生很多冗余信息并对噪声敏感,提出了一种通用稀疏多核学习方法。该算法是基于L1范数和Lp范数(p>1) 混合的网状正则化多核学习方法,不仅能灵活的调整稀疏性,而且鼓励核权重的组效应,L1范数和Lp范数多核学习方法可以认为是该方法的特例。该方法引进的混合约束为非线性约束,故对此约束采用二阶泰勒展开式近似,并使用半无限规划来求解该优化问题。实验结果表明,改进后的方法在动态调整稀疏性的前提下能获得较好的分类性能,同时也支持组效应,从而验证了改进后的方法是有效可行的。     

认知无线电网络信道选择机制

认知无线电网络通过动态频谱接入来提高无线频谱资源利用率,而节点目标信道选择的优劣直接决定了频谱接入性能的好坏. 本文首先综合考虑信道增益和空闲时间两种因素,设计以实现最大化系统容量的目标信道选择机制,然后引入信道热度概念,提出一种多属性决策信道选择机制. 仿真结果表明,多属性决策信道选择机制在系统吞吐量和频谱利用率性能上都有明显的提高.     

基于词包和特征融合的目标识别算法

针对现有词包模型对目标识别性能的不足,对特征提取、图像表示等方面进行改进以提高目标识别的准确率。首先,以密集提取关键点的方式取代SIFT关键点提取,减少了计算时间并最大程度地描述了图像底层信息。然后采用尺度不变特征变换(Scale-invariant feature transform, SIFT)描述符和统一模式的局部二值模式(Local binary pattern,LBP)描述符描述关键点周围的形状特征和纹理特征,引入K-Means聚类算法分别生成视觉词典,然后将局部描述符进行近似局部约束线性编码,并进行最大值特征汇聚。分别采用空间金字塔匹配生成具有空间信息的直方图,最后将金字塔直方图相串联,形成特征的图像级融合,并送入SVM进行分类识别。在公共数据库中进行实验,实验结果表明,本文所提方法能取得较高的目标识别准确率。     

基于非下采样轮廓波变换和多核学习的盲图像质量评价

非下采样轮廓波(Contourlet)变换具有多尺度、多方向特性,能够对图像纹理和结构信息进行精确提取,可以很好地模拟人类视觉系统的多分辨率特性,基于此提出一种基于非下采样Contourlet变换的通用型盲(无参考)图像质量评价算法。首先在空间域上对图像进行非下采样Contourlet变换;然后在各方向带中分别提取能有效反映人类视觉失真程度的特征:高频幅值、平均梯度、信息熵作为图像的特征;最后将其输入到高效的分层多核学习机中学习,预测图像的质量得分。在混合失真型数据库和3个单失真型数据库上的交叉实验结果表明,该算法性能优越,能很好地预测失真图像质量,具有很好的主客观一致性。     

基于差分蜂群算法的电力系统经济负荷分配

针对电力系统经济负荷分配问题,提出一种有效的差分蜂群算法．受差分进化算法的启发,该算法基于差分进化操作改进了雇佣蜂的搜索方式,提高了探索能力和收敛速度．此外,提出一种有效的修复机制以保证新个体的可行性．该算法在带有阀点效应和多燃料特征的典型电力系统经济负荷分配问题上进行了测试．仿真结果验证了所提算法的有效性．     

t分布下基于核函数的最大后验概率分类方法

针对多元正态分布不能适应样本数据严重拖尾现象的问题,提出t分布下的多分类识别方法。利用核技术将样本数据扩展到高维特征空间中,采用贝叶斯分类器得到最大后验概率,进而得到分类结果。由于可以调整t分布中的自由度参数v,因此更容易满足数据样本的不同拖尾情况,具有较好的稳健性。在5个国际标准UCI数据集和3个人脸数据集上进行了大量实验,实验结果表明,该方法有较好的分类效果,具有可行性。     

Stochastic Bounded Consensus Tracking of Second-Order Multi-Agent Systems with Measurement Noises and Sampled-Data

This paper investigates the stochastic bounded consensus tracking problems of second-order multi-agent systems, where the control input of an agent can only use the information measured at the sampling instants from its neighbors or the virtual leader with a time-varying reference state, and the measurements are corrupted by random noises. The probability limit theory, the algebra graph theory, and some other techniques are employed to derive the necessary and sufficient condition guaranteeing the mean square bounded consensus tracking. It turns out that the maximum allowable sampling period depends on not only the network topology but also the constant feedback gains. Furthermore, the effects of the sampling period on tracking performance, including the tracking speed and the static tracking error, are also analyzed. The results show that reducing the sampling period can accelerate the tracking speed and decrease the static tracking error. Simulations are provided to demonstrate the effectiveness of the theoretical results.