The Banzhaf value and communication situations

Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

WEB系统中统计图绘制研究

简要介绍了GDI+,提出了在Web系统中利用GDI+实现统计图绘制的思路,并结合Visual C#.NET与Oracle数据库,举例阐述了统计图实现的关键技术和具体步骤,该技术在军队油库信息可视化研究与应用项目中得到很好应用。     

A strategic model for state compliance verification

The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016     

基于节点选择更新的简化LDPC译码算法

文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。     

一种基于图论的网络安全分析方法研究

随着信息技术安全问题的日益突出,对网络系统进行安全分析日益重要.提出了一种基于图论的网络安全分析方法NEG-NSAM,在进行网络参数抽象和脆弱性关联分析的基础上,构造网络渗透图模型,刻画了威胁主体逐步渗透安全目标的动态过程.针对大规模网络环境,提出了渗透图简化算法.最后,运用NEG-NSAM方法进行了实例分析,验证该方法的可行性和有效性.     

新闻视频数据库基于故事单元的“多线程”管理技术研究

新闻视频关于新闻事件的报道是一种"多线程"的形式,针对这种特性提出了一种基于有向图理论的新闻视频数据库管理方法。研究了故事单元相似关系与图论知识之间的联系,结合最小部分树理论提出了一种将故事单元之间复杂相似关系图简化为"多线程"结构树的新闻视频数据库管理技术。实验显示,这种管理方法对于视频数据库的浏览、检索、摘要等实际需求具有重要的理论意义和应用价值。     

基于超网络的作战体系建模方法

基于信息系统体系作战问题研究的基础是作战体系构建。在对作战体系进行网络化结构分析的基础上,重点考虑体系中各类实体及属性的复杂性,根据其网络拓扑特性,以超网络、超图理论为指导,建立了基于结构层和属性层相统一的超网络模型,并结合体系作战过程中的对抗规律,提出超网络模型相应的动态演化方式,最后通过案例建模验证了超网络作战体系构建模型的适应性及优势。     

“三色图”的一个充分条件

文中证明了定理:若图G中不存在与K_4同胚的子图,则其色数X(G)≤3,进而得到三色图的一个充分条件。只要能证明与上述定理类似的一个定理:“若图G中不存在与K_5同胚的子图,则其色数X(G)≤4”,则世界著名的“四色猜想(4CC)”即得证。     

融合图嵌入的Smooth-PCANet图像识别算法

主成分分析网络（Principal Component Analysis Network,PCANet）是一种简单的深度学习算法,在图像识别领域具有优秀的性能。然而PCANet在构建网络卷积核时只关注了图像的主分量信息,忽视了近邻像素点之间的位置关系。而通常情况下,图像的相邻像素点具有空间强相关性,因此利用图结构保持像素点的位置近邻关系更有利于网络提取有效特征。因此,我们将图嵌入思想融入PCANet,提出一种新的图像识别算法Smooth-PCANet。为了验证Smooth-PCANet算法的有效性,我们在人脸、手写体字符以及图片等不同数据集上构建实验,并将Smooth-PCANet与多种基于深度学习的图像识别算法作了对比。实验结果证明,Smooth-PCANet算法比PCANet获得了更高的识别性能,并且更有效地避免了过拟合,在小样本训练时具有显著优势。     

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

Text event mining, as an indispensable method of text mining processing, has attracted the extensive attention of researchers. A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper, i.e. UKGE-MS. Specifically, UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information, and solves the problems of traditional unsupervised feature selection methods, which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples. Firstly, considering the influence of local information of samples in feature correlation evaluation, a feature clustering algorithm based on average neighborhood mutual information is proposed, and the feature clusters with certain event correlation are obtained; Secondly, an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation, so as to enhance the generalization ability of the selected feature items. Finally, the events knowledge graph is constructed by means of sparse representation and l₁ norm. Extensive experiments are carried out on five real datasets and synthetic datasets, and the UKGE-MS are compared with five corresponding algorithms. The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection, and has some advantages over other methods in text event recognition and discovery.