融合图嵌入的光滑主成分分析网络图像识别算法

主成分分析网络(principal component analysis network, PCANet)是一种简单的深度学习算法,在图像识别领域具有优秀的性能。将图嵌入思想融入PCANet,提出一种新的图像识别算法光滑主成分分析网络(Smooth-PCANet)。为了验证Smooth-PCANet算法的有效性,在人脸、手写体字符以及图片等不同数据集上构建实验,并将Smooth-PCANet与多种基于深度学习的图像识别算法作了对比。实验结果证明,Smooth-PCANet算法比PCANet获得了更高的识别性能,并且更有效地避免了过拟合,在小样本训练时具有显著优势。     

动态拓扑图的卫星网络可视化方法

针对高度动态变化的卫星网络,提出一种基于动态拓扑图的可视化方法。动态拓扑图可视化的难点在于如何保持动态可视化过程中的稳定性,从而使用户容易地感知到网络中所发生的拓扑变化。根据卫星网络的动态变化特点,构建连续的动态拓扑图模型;设计一种保持布局稳定性的策略,并基于力引导思想提出一种动态拓扑图布局算法;以Iridium系统为典型实例,验证本文的可视化方法的合理性和可行性。实验表明,该方法能够以清晰的可视化图像支持用户对卫星网络动态拓扑的感知和理解。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种新闻事件演化建模方法

为了准确地发现话题中事件间的潜在关系,提出一种新闻事件演化建模方法。该方法利用事件的时间关系、内容相似性、命名实体关联信息构建新的演化关系模型,并通过定义事件的五种演化模式,识别出演化过程中的开始、中间、结束事件,最后根据新演化模型及演化模式建立事件演化的有向无环图模型,揭示事件发展的潜在脉络结构。实验结果表明,本文方法能够有效检测事件演化,提升系统性能。     

一种基于多目标微粒群优化的虚拟网络映射方法

针对多个虚拟网络同时映射时资源统一优化分配的问题,提出了一种基于多目标微粒群优化的虚拟网络映射方法(MSC-VNE),提高底层网络资源利用率及全局负载均衡性能。建立了虚拟网络映射的多目标优化模型,将单个虚拟网络映射作为一个子群,并采用多子群协作优化的方法在子群映射时通过相互信息交换进行协同进化,最终达到全局资源的优化分配。仿真结果表明,与典型成果相比,提出的方法有效地提高了底层网络资源利用率和虚拟网络构建成功率。     

一种新的导弹发射技术辅助决策系统架构

导弹武器系统特有的作战特点,以及专家知识的不完备性,使得传统的辅助决策系统难以在短时间内作出准确、有效的决策。因此,提出一种新的导弹发射技术辅助决策系统的总体结构及实现相应功能的模型,即采用BP神经网络-遗传算法(GA)实现辅助决策,基于有向图实现故障诊断,通过决策融合生成图形决策方案,缩短了决策时间,提高了决策的有效性。     

二部图的(g,f)匹配

本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。     

具有正交(g,f)-因子分解的子图

设G是一个图 ,g (x)和f (x)是定义在V (G)上的整数值函数 ,且对任意的x∈V (G) ,设g (x)≤f (x) ,H是G的一个子图 ,F ={F1,F2 ,… ,Ft}是G的一个因子分解 ,如果对任意的 1≤i≤t,|E (H)∩E (Fi) |=1 ,则称F与H正交。闫桂英和潘教峰在文 [3]中提出如下猜想 :设G是一个 (mg+k,mf-k) -图 ,1≤k相似文献   

多载波码分多址在低密度二分图上的建模与分析

多载波码分多址是移动通信重要的多址技术之一,传统方法将扩频序列的构造和多用户检测单独考虑,未能做到发射机和接收机的一体化设计。受到低密度奇偶校验码的启发,基于图论建立多载波码分多址收发机模型,采用二分图定义码片和数据符号间的扩频关系。在此基础上,利用适合低密度二分图的消息传递算法完成多用户迭代检测,推导并分析洪水消息传递和串行消息传递两种检测机制。仿真结果表明,当传统的多载波码分多址系统陷入严重过载而不能正常通信的情况下,基于低密度二分图的多载波码分多址系统依然能够达到理想的传输性能,为下一代移动通信系统的设计提供了有益的参考。