混合均衡问题和不动点问题的公共元的迭代算法

在Hilbert空间中,利用超梯度算法,用以逼近混合均衡问题的解集与半压缩映像不动点集的公共元,并且证明了该算法的收敛性。使用新的分析技巧证明了一个强收敛定理。     

基于依赖矩阵的Web服务组合故障诊断

为了保证指挥信息系统在动态环境下能够提供持续可靠的组合服务,提出一种利用依赖矩阵对Web服务组合故障原因进行诊断的模型,对依赖矩阵的建立进行了详细说明。然后,基于构造的依赖矩阵,提出改进的贪心算法对失效情况进行探测,并设计了基于二分查找的故障定位算法。实验模拟表明,提出的模型能够利用少量探测就能监测整个服务组合流程的运行情况,并定位找到错误源。     

音波法气体管道泄漏定位影响因素分析及算法改进

为提高音波法气体管道泄漏定位的精度,对影响该方法泄漏定位的主要因素以及定位算法进行了研究。通过假设计算,分析了绝热指数和压缩因子对定位精度的影响。结果表明,压力较大时绝热指数和压缩因子变化较大,在定位计算中不能忽略。在此基础上,考虑管内沿线气体的流速、温度和压力分布等因素,对音速公式、气体流速公式以及定位公式进行修正,从而得到可以较为精确求解泄漏位置的计算公式,并通过牛顿-科茨公式改进算法。研究结果对进一步完善音波法管道气体泄漏检测技术具有一定的设计和理论指导意义。     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

高动态GPS抗干扰算法仿真研究

对于高动态条件下GPS(global positioning system)接收机的抗干扰问题,研究等距线阵接收信号模型和基于协方差矩阵扩张的基本原理,并仿真分析了2种基于协方差矩阵扩张的经典抗干扰算法：Mailloux算法和Zatman算法在高动态环境下的作用效果。经过Matlab仿真,结果表明,相比与常规方法,Mailloux方法和Zatman方法在阵元是等距线阵时,都能有效地加宽从干扰方向上形成的零陷,能够提高在高动态环境下的抗干扰效果,使接收机能够捕获卫星信号。     

A novel facial emotion recognition scheme based on graph mining

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.     

基于遗传算法的虚拟物流联合库存控制研究

针对随机需求条件下的虚拟物流库存控制问题进行了深入研究,提出了一种新的联合库存控制策略——（T,S,s）策略,建立了相应的库存成本模型,并构造遗传算法对模型进行求解。结果分析表明,所提出的（T,S,S）联合库存控制策略是有效的。     

基于k短路径的兵力机动路线优化方法

由于传统Dijkstra算法只能求解最优路径,结合兵力机动路线选择的需要,将求解k短路径的实用算法引入到兵力机动路线优化问题中,给出了算法的数据结构和步骤。在道路权重的确定上,提出将路程、通行能力和安全性三项指标相结合的思想,并给出了综合权重的计算方法。仿真实验表明所提方法具有较强的实用性。     

基于非均匀线阵和修正MUSIC算法的DOA估计

研究了基于非均匀线阵的DOA估计问题。提出了利用修正MUSIC算法进行DOA估计,并设计了对称布阵方式。仿真结果表明在对称布阵非均匀线阵中使用修正MUSIC算法,空间谱分辨率高、栅瓣小,且分辨率要高于均匀线阵。本算法获得了较高的空间谱分辨率,提高了DOA估计性能。     

基于蜂群算法的战时毁伤装备维修任务调度研究

现代战争中,装备的战损率大大提高,装备维修任务十分繁重,如何在最短的时间内将损坏的装备修复好,是装备维修决策的重要内容之一[1]。鉴于蜂群算法在任务调度特别是动态随机任务调度中的优势,将蜂群算法引入装备维修任务调度研究,并进行了仿真实验,通过测试案例的仿真结果表明,蜂群算法对于动态随机任务调度具有很强的优势。最后对蜂群算法中的各参数对于仿真结果的影响进行了分析。