多冗余点到点链路下OSPF扩散算法的一种改进方案

文章讨论了OSPF路由协议的扩散算法在多冗余点到点链路情况下存在的缺陷,提出了一种基于扩散接口选举的改进方案。     

基于改进AdaBoost算法的复杂网络链路预测

链路预测是复杂网络的重要研究方向,当前的链路预测算法因可利用的网络信息有限,导致预测算法的精确度受限。为了提高预测算法的性能,采用改进的AdaBoost算法进行链路预测。首先根据复杂网络样本建立邻接矩阵,完成样本的矩阵化处理;然后采用AdaBoost算法进行分类训练,通过权重投票获取预测结果;最后,考虑到复杂网络弱分类器预测正负误差分布的不均衡问题,设置权重调整因子η及其调整范围[η1,η2],并根据η值动态调整AdaBoost算法的多个弱分类器分类结果的权重,从而获得准确的链路预测结果。实验结果证明,相比其他常用网络链路预测算法及传统AdaBoost算法,改进的AdaBoost算法的预测准确率优势明显,且在节点数量较多时,其预测时间性能和其他算法的差距较小。     

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.

基于实体数据模型的空间邻接定量分析探讨*

空间邻接是一种基本的空间拓扑关系, 它对研究地理现象的分布规律和演化过程有着重要的意义。而目前许多GIS 软件所采用的空间实体数据模型并不包含拓扑信息, 故难以定量地计算、分析地理对象间的空间邻接关系。针对上述缺陷提出了基于实体数据模型的空间邻接定量分析算法, 并以MapInfo 为例予以实现, 最后以实例分析验证算法的有效性。     

化学结构的计算机处理（Ⅱ）：化学结构的计算机内存储方式和文件格式

化学结构作为化学家最普遍使用的语言，在化学知识的记录，传播和交流中起着十分重要的作用。随着计算机的普及，广大化学工作者都希望能用计算机来帮助处理化学结构，本文介绍了目前面向计算机的化学描述方法中用得最多的几种存储方式和文件格式，它们是：邻接矩阵，邻接表，邻接多表和ＭＯＬ格式，ＳＭＤ格式，简要评述了这些存储方式和文件格式的特点，局限性的应用。     

基于邻接矩阵的公交换乘算法的研究

首先介绍了邻接矩阵的基本概念,讨论了用邻接矩阵建立城市公交线路换乘的模型和算法,最后用V isual FoxP ro实现邻接矩阵的存储和运算.     

Hadamard矩阵对应图类的特征

讨论Hadamard矩阵对应的简单图类的邻接矩阵的特征及其相互关系，证明了1－4阶Hadamard矩阵对应的图只有K1、K2∪K2、K3∪K1和K4；偶图G的邻接矩阵是Hadamard矩阵充分必要条件是G＝K2∪K2。     

A new full-text indexing model with low space overhead for chinese text retrieval

Text retrieval systems require an index to allow efficient retrieval of documents at the cost of some storage overhead. This paper proposes a novel full-text indexing model for Chinese text retrieval based on the concept of adjacency matrix of directed graph. Using this indexing model, on one hand, retrieval systems need to keep only the indexing data, instead of the indexing data and the original text data as the traditional retrieval systems always do. On the other hand, occurrences of index term are identified by labels of the so-called s-strings where the index term appears, rather than by its positions as in traditional indexing models. Consequently, system space cost as a whole can be reduced drastically while retrieval efficiency is maintained satisfactory. Experiments over several real-world Chinese text collections are carried out to demonstrate the effectiveness and efficiency of this model. In addition to Chinese, The proposed indexing model is also effective and efficient for text retrieval of other Oriental languages, such as Japanese and Korean. It is especially useful for digital library application areas where storage resource is very limited (e.g., e-books and CD-based text retrieval systems).     

基于梯度向量流的医学图像自动分割

提出了一种基于梯度向量流的自动图像分割算法，该算法首先将梯度向量流场转化为一个标量场，该标量场能够显著简化种子点选取和区域增长的步骤。在得到图像的初始分割后，再使用基于区域邻接图的算法来将相似区域合并得到最终分割结果。试验结果表明，该算法能够有效地解决医学图像中多目标区域的自动分割问题。     

近完全图的不同构图确定和计数的研究

本文首次定义了近完全图的概念并采用先分解后组合的方法研究出一种边数很多、接近于完全图的不同构图的确定方法及其数目的比较算法,给出了判断定理及其证明和应用。