检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《现代计算机(中旬刊)》2016年第3期10-15,24,共7页Modern Computer
摘 要:随着信息网络的发展,信息网络拓扑维上卷逐渐成为本领域的一个热点,同时它的应用价值也随之提升。对给定节点不上卷,其他节点上卷到指定层次的方法来满足用户的特定需求。提出满足用户需求的信息网络拓扑维上卷模型。主要贡献有:(1)首次提出有效上卷代价的概念,(2)首次实现用户的特定需求上卷,(3)设计信息网络的拓扑维上卷算法。实验证明该算法能够满足用户的特定需求,实现指定拓扑维上卷操作,具有很强的实用价值。With the development of information networks, the network topology information on the volume dimension is becoming a hot spot in the field, while its value also will increase. The main work is for a given node is not on the volume, the volume to a specified level approach on other nodes to meet the specific needs of the user. It proposed to meet the information needs of users on the network topology dimen- sional volume model. The main contribution is: (1) first proposed the concept of the effective cost of the volume, (2) the first time the specific needs of the user on the volume, (3) design the topological dimension algorithm information on the volume of the network. Ex- periments show that our algorithm can meet the specific needs of users to achieve specified operation on a volume topological dimension, with strong value.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229