助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   邻接网络 的翻译结果: 查询用时:0.017秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

邻接网络
相关语句
  “邻接网络”译为未确定词的双语例句
     Algorithm based on adjacent lattice for mining sequence rules
     基于邻接网络的序列规则挖掘算法
短句来源
     Algorithm based on adjacent lattice for finding frequent itemsets
     基于邻接网络的频繁项目集发现算法
短句来源
     A new algorithm for mining sequence rules is given in this paper. The algorithm converts the origin transaction database to sequences adjacent lattice in a preprocess, where each sequence vertex have a label to save its support.
     给出一个新的序列规则挖掘算法 ,该算法在挖掘规则以前将数据库预先存贮为序列邻接网络 ,在序列邻接网络中每个项目集顶点都有一个域来记录它的支持度 .
短句来源
  相似匹配句对
     NETWORK
     网络
短句来源
     Network Data
     网络
短句来源
     Studies on Neighboring Rights in Cyberspace
     网络传播中的邻接权研究
短句来源
     Realizing Algorithms of ABNET Based on Adjacency Matrix
     抗体网络基于邻接矩阵的算法实现
短句来源
查询“邻接网络”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  adjacent_lattice
Crystallite-conjugation regions and adjacent lattice regions in polycrystalline iridium: I.
      
Crystallite-conjugation regions and adjacent lattice regions in polycrystalline iridium: II.
      
Crystallite-conjugation regions and adjacent lattice regions in polycrystalline iridium: III.
      
The granule matrix consists of compacted and loosely aggregated fine fibrils and paracrystalline cores made up of rod-like subunits; the superimposed rodlets of adjacent lattice planes intersect at 70 degrees.
      
The average number of steps required for a walker to be trapped is calculated when the probability of stepping to adjacent lattice sites is not symmetrical, and is found to be less than that calculated for a symmetrical walk.
      
更多          


A new algorithm for mining sequence rules is given in this paper. The algorithm converts the origin transaction database to sequences adjacent lattice in a preprocess, where each sequence vertex have a label to save its support. The algorithm changes the mining task in the database into a searching process in the lattice, which can speeds up greatly the mining. Furthermore, the algorithm uses a vertical id list database format to compute the support of each sequence, where each sequence is associated with a...

A new algorithm for mining sequence rules is given in this paper. The algorithm converts the origin transaction database to sequences adjacent lattice in a preprocess, where each sequence vertex have a label to save its support. The algorithm changes the mining task in the database into a searching process in the lattice, which can speeds up greatly the mining. Furthermore, the algorithm uses a vertical id list database format to compute the support of each sequence, where each sequence is associated with a list of objects in which it occurs, along with the time stamps.

给出一个新的序列规则挖掘算法 ,该算法在挖掘规则以前将数据库预先存贮为序列邻接网络 ,在序列邻接网络中每个项目集顶点都有一个域来记录它的支持度 .算法把频繁序列规则的发现问题转化为网络中的顶点搜索问题 ,大大提高了搜索过程的效率 .为了有效地解决网络生成过程中的序列支持度计算问题 ,采用了一种纵向的数据库表示格式

IP routing design is a vital part of the campus logical network. According to the hierarchical design model, a way of hierarchical ip addressing has been offered in this article. By understanding of traffic flow, using a VLSM-designed network, the paper describes and gives examples of route summarization, including implementation considerations. By studying the discontinuous subnets, and regulating the scale of subnets granularity, the paper presents a useful approach to campus networking, in which class routing...

IP routing design is a vital part of the campus logical network. According to the hierarchical design model, a way of hierarchical ip addressing has been offered in this article. By understanding of traffic flow, using a VLSM-designed network, the paper describes and gives examples of route summarization, including implementation considerations. By studying the discontinuous subnets, and regulating the scale of subnets granularity, the paper presents a useful approach to campus networking, in which class routing protocol such as RIP and IGRP or classless routing protocol such as OSPF and EIGRP is used. As a result, reduced number of routing table entries and efficient allocation of addresses make a campus network more extendable and manageable.

IP路由设计是校园网络在逻辑实现上的核心,合理的IP路由设计会使网络具有较高的性能。根据校园网络的拓扑和流量分布情况,按照分层设计思想,通过应用VLSM,提出了校园网络IP分层寻址和聚合路由设计方法。在此基础上,结合常用路由协议,具体提供了聚合路由的实施策略。对有类路由协议RIP和IGRP、无类路由协议EIGRP和OSPF情况下的不邻接网络、子网粒度问题作了重点分析实现,从而有效减少网络通信流量和路由选择表大小,以增强网络的可管理性、可靠性和可扩展性。

It is well known that the task of finding frequent itemsets in large database is the bottleneck problem in the research of association rules mining. A new algorithm for mining frequent itemsets is proposed in this paper.Based on the graph theory,the algorithm converts the origin transaction database to an itemsets adjacent lattice in the preprocessing,where each itemset vertex has a label to save its support.The algorithm changes the complicated task of mining frequent itessets in the database to a simpler one...

It is well known that the task of finding frequent itemsets in large database is the bottleneck problem in the research of association rules mining. A new algorithm for mining frequent itemsets is proposed in this paper.Based on the graph theory,the algorithm converts the origin transaction database to an itemsets adjacent lattice in the preprocessing,where each itemset vertex has a label to save its support.The algorithm changes the complicated task of mining frequent itessets in the database to a simpler one of searching vertex in the lattice,which can speed up greatly the mining process.Furthermore,to compute the support of each itemset,the algorithm uses a vertical(tid-list) database format,where each itemset is associated with a list of transactions in which it occurs.At the end,we carried out the algorithm,and analyzed the result of the experiment.

频繁项目集发现一直都是关联规则研究领域中最关键的问题.文章给出了一个新的频繁项目集发现算法,该算法的特别之处在于事先利用有向图进行的一次数据预处理,在预处理过程中将数据库预先存贮为每个结点都有一个域来记录其支持度的项目集邻接网络,从而把复杂的频繁项目集的发现问题转化为简单的图中搜索问题,这就大大提高了频繁项目集发现过程的效率.同时为了有效地解决预处理过程中的项目集支持度计算问题,采用了一种纵向的数据库表示格式.最后对所采用的算法给出实验结果.

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关邻接网络的内容
在知识搜索中查有关邻接网络的内容
在数字搜索中查有关邻接网络的内容
在概念知识元中查有关邻接网络的内容
在学术趋势中查有关邻接网络的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社