排序方式: 共有77条查询结果,搜索用时 343 毫秒
41.
42.
随着信息技术安全问题的日益突出,对网络系统进行安全分析日益重要.提出了一种基于图论的网络安全分析方法NEG-NSAM,在进行网络参数抽象和脆弱性关联分析的基础上,构造网络渗透图模型,刻画了威胁主体逐步渗透安全目标的动态过程.针对大规模网络环境,提出了渗透图简化算法.最后,运用NEG-NSAM方法进行了实例分析,验证该方法的可行性和有效性. 相似文献
43.
新闻视频关于新闻事件的报道是一种"多线程"的形式,针对这种特性提出了一种基于有向图理论的新闻视频数据库管理方法。研究了故事单元相似关系与图论知识之间的联系,结合最小部分树理论提出了一种将故事单元之间复杂相似关系图简化为"多线程"结构树的新闻视频数据库管理技术。实验显示,这种管理方法对于视频数据库的浏览、检索、摘要等实际需求具有重要的理论意义和应用价值。 相似文献
44.
45.
董晓光 《国防科技大学学报》1989,11(2):29-32
文中证明了定理:若图G中不存在与K_4同胚的子图,则其色数X(G)≤3,进而得到三色图的一个充分条件。只要能证明与上述定理类似的一个定理:“若图G中不存在与K_5同胚的子图,则其色数X(G)≤4”,则世界著名的“四色猜想(4CC)”即得证。 相似文献
46.
主成分分析网络(Principal Component Analysis Network,PCANet)是一种简单的深度学习算法,在图像识别领域具有优秀的性能。然而PCANet在构建网络卷积核时只关注了图像的主分量信息,忽视了近邻像素点之间的位置关系。而通常情况下,图像的相邻像素点具有空间强相关性,因此利用图结构保持像素点的位置近邻关系更有利于网络提取有效特征。因此,我们将图嵌入思想融入PCANet,提出一种新的图像识别算法Smooth-PCANet。为了验证Smooth-PCANet算法的有效性,我们在人脸、手写体字符以及图片等不同数据集上构建实验,并将Smooth-PCANet与多种基于深度学习的图像识别算法作了对比。实验结果证明,Smooth-PCANet算法比PCANet获得了更高的识别性能,并且更有效地避免了过拟合,在小样本训练时具有显著优势。 相似文献
47.
《防务技术》2022,18(12):2150-2159
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 l1 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. 相似文献
48.
49.
DS-CDMA是在扩频技术上发展起来的多址接入方式,但在用户接入数量过载时难以保证高质量的通信性能。基于此,提出了一种基于稀疏图的DS-CDMA系统。该系统以低密度二分图的形式来描述扩频码片和用户之间的关系,使得参与通信的每个用户只在少量码片上进行非零位扩频调制,最大程度地减少了用户间的相互干扰。借助图模型的相关理论,把适合于稀疏图的置信度传播算法应用于该系统,进行多用户检测,通过码片与用户之间的消息迭代来消除噪声和多址干扰带来的影响。结合计算机仿真,从不同的角度测试了系统的误码率等性能。理论分析与性能验证表明,稀疏图DS-CDMA在接入用户数量远远超过系统容量的情况下,依然具有优良的性能。 相似文献
50.
Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015 相似文献