助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   local connectivity 的翻译结果: 查询用时:0.01秒
图标索引 在分类学科中查询
所有学科
电信技术
数学
互联网技术
更多类别查询

图标索引 历史查询
 

local connectivity
相关语句
  局部连通性
     At the end of the last century, C. J. Yoccoz is made significant contributions to the theory of complex dynamics, one of which is the study of the local connectivity of the Julia sets of quadratic polynomials pc(z) = z2 + c and the Mandelbrot set M. In his work.
     在上世纪末,J.C.Yoccoz对复动力系统理论作出了重要的贡献,其中之一就是对二次多项式pc(Z)=Z~2+c的Julia集和Mandelbrot集M的局部连通性的研究。
短句来源
     This paper first reviews AODV routing protocol briefly and introduces its two different mechanisms maintaining local connectivity: Link layer mechanism based on Cross-Layer Design and Network layer mechanism, then compares the performance of AODV routing protocol under these two mechanisms through NS2, and points out the merits and demerits between them.
     本文首先对AODV路由协议做以简单回顾,介绍其两种不同的局部连通性维护机制:基于跨层设计的链路层机制和网络层机制,然后通过NS2 模拟软件对两种不同机制下的AODV协议性能进行对比分析,从而指出两者所具有的优缺点,最后对全文进行总结。
     The Local Connectivity of Peripherally Continuous Mappings
     边界连续映射的局部连通性
短句来源
     In addition, it is proved that the two kinds of algorithms based on local weak-connectivity concepts are extensions of the algorithms based on the two kinds of local connectivity concepts.
     同时证明了新提出的两个局部弱连通性概念分别是原有的两个局部连通性概念的扩展。
短句来源
     Some Properties of Local Connectivity in Fuzzifying Topolgy
     不分明化拓扑中局部连通性的若干性质
短句来源
更多       
  “local connectivity”译为未确定词的双语例句
     Performance Analysis and Improvement of AODV Local Connectivity Management
     AODV局部连接性管理的性能分析及其改进
短句来源
     Local Connectivity Map and Peripherally Continuous Mapping.
     局部連通映象与边界連續映象
短句来源
     Continuity and Connectivity of Peripherally Continuous Map, Almost Continuous Map and Local Connectivity Map
     边界連續映像、几乎連續映像、局部連通映像的連通性及連續性
短句来源
     THE MAXIMAL SIZE OF A DIGRAPH WITH MAXIMAL LOCAL CONNECTIVITY 1
     局部连通度至多是1的有向图的最大弧数
短句来源
     Furthermore ,there exists Y_3 V_3-free graphs with arbitrarily high connectivity and local connectivity which are nonhamiltonian. The research of the longest cycles will promote the Hamitonian Problem research.
     得到了下面的结果:定理2.1.2顶点数不小于3的连通、局部连通V_3 -free、爪心独立图是完全圈可扩的。
短句来源
更多       
  相似匹配句对
     LOCAL R-STRONG CONNECTIVITY
     局部R-强连通性
短句来源
     The Local Connectivity of Peripherally Continuous Mappings
     边界连续映射的局部连通性
短句来源
     Local News
     本地要闻
短句来源
     LOCAL NEWS
     国内消息
短句来源
     Super Connectivity of Dotgraphs
     点积图的超连通性(英文)
短句来源
查询“local connectivity”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  local connectivity
The CNN silicon integration success is due mainly to the local connectivity of processing cells.
      
The systolic array has advantages of pipelinability, regularity, modularity, local connectivity and scalability, thus making it to be very suitable for VLSI implementation.
      
We present a new description of ordering and phase transitions in terms of genuine local connectivity, i.e., physical connections and disconnections which lead to global order and disorder, respectively.
      
Description of ordering and phase transitions in terms of local connectivity: Proof of a novel type of percolated state in the g
      
In fact, their regular structure and their local connectivity feature contribute to render this class of neural networks especially appealing for VLSI implementations.
      
更多          


The concepts of local connectivity of single-value mappings and peripherally continu- ous mapping are extended to set-value.The condition is given in which set-value peripheri- ally mapping is set-value local connecting mappings.

把单值映射局部连通性和边界连续映射的概念推广到集值映射上,并且给出了集值边界连续映射是集值局部连通映射的条件.

Routing has been a popular topic in the study of computer networks. With the continuous increasing in network size, routing in large size networks with faults has become unavoidable. We introduce a new and natural concept of fault tolerance for hypercube networks: local-connectivity. Two kinds of local-connectivity have been defined in this paper. The first kind of local-connectivity is local k-subcube-connectivity, in which each k-dimensional subcube H k contains...

Routing has been a popular topic in the study of computer networks. With the continuous increasing in network size, routing in large size networks with faults has become unavoidable. We introduce a new and natural concept of fault tolerance for hypercube networks: local-connectivity. Two kinds of local-connectivity have been defined in this paper. The first kind of local-connectivity is local k-subcube-connectivity, in which each k-dimensional subcube H k contains less than 2 k-1 faulty nodes and the non-faulty nodes in H k make a connected graph. The second kind of local-connectivity is local subcube-connectivity, in which if for every k-dimensional subcube H k of H n, where k1, there is an h-dimensional subcube H h containing H k (thus hk) such that H h is locally h-subcube connected. We show that a locally connected hypercube network may contain a large number of faulty nodes, and prove that a locally connected hypercube network is also globally connected. We develop two efficient routing algorithms on locally connected hypercube networks: for a locally k-subcube-connected n-dimensional hypercube network H n, our first routing algorithm constructs a path of non-faulty nodes from a given source node to a given destination node in time O(n2k); for a locally subcube-connected n-dimensional hypercube network H n, our second routing algorithm constructs a path of non-faulty nodes from a given source node to a given destination node in time O(n2 k min), where k min is the smallest integer such that the n-dimensional hypercube H n is locally k min-subcube-connected (where the value k min is not necessarily known to our algorithm)/ Our routing algorithms are distributed and local-information-based in the sense that each node in the network knows only its neighbors' status and no global information of the network is required by the algorithms. Our new concept of local-connectivity is easily extendable to other hierarchical networks. Finally, other network problems, such as network emulation and network broadcasting, should also be interesting under our new concept of local-connectivity.

该文提出了容错超立方体网络的一个很自然的新概念 :局部连通性 ;讨论了两种类型的局部连通性 :局部k-维子立方体连通性和局部子立方体连通性 .一个局部连通的超立方体网络可容许大量错误结点且能确保超立方体网络是全局连通的 ;给出了满足局部连通性条件的超立方体网络中的几个高效的容错路由算法 .文中的容错路由算法是分布式的和基于局部信息的 ,因而具有很强的实际意义

Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied. Using experimental results, the fault tolerance and effectiveness and efficiency of parallel fault tolerant routing algorithm are analysed, which is based on both locally k subcube connected fault tolerant model and locally 3 subcube connected fault tolerant model with up to 25.0% faulty nodes. It is well known that the number of parallel paths which can be found by a parallel routing algorithm...

Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied. Using experimental results, the fault tolerance and effectiveness and efficiency of parallel fault tolerant routing algorithm are analysed, which is based on both locally k subcube connected fault tolerant model and locally 3 subcube connected fault tolerant model with up to 25.0% faulty nodes. It is well known that the number of parallel paths which can be found by a parallel routing algorithm is at most min( D(u),D(v) ), and at least min (D k(u),D k(v)) . Considering that k is small (such as 3, 4 or 5), and that n is large (such as 10, 15, 20 or 30), then min (D(u),D(v) ) is very close to min (D k(u),D k(v) ). In this way, the capability of finding the parallel routing paths as much as possible is near optimal. The theoretical analysis and the experimental results show that not only parallel routing algorithms are strong fault tolerant and highly effective and efficient, but also local connectivity fault tolerant model is applicable.

研究了具有大量错误结点的超立方体网络中的并行容错路由算法 .其步骤是 :首先 ,通过实验分析基于局部k维子立方体连通性容错模型中并行容错路由算法的容错性和效率 ,然后分析k =3且有多达 2 5 .0 %的错误结点时并行容错路由算法的容错性和效率 .研究结果表明 :并行路由算法所能找到的并行路径的数目最多可达到min(D(u) ,D(v) ) ,至少可达到min(Dk(u) ,Dk(v) ) ;如果只考虑k比较小 (如 3 ,4,5等 )而n比较大 (如 1 0 ,1 5 ,2 0等 )的情况 ,则min(D(u) ,D(v) )与min(Dk(u) ,Dk(v) )非常接近 ,说明并行路由算法所能找到的尽可能多的并行路径的能力是接近最优的 ;并行容错路由算法容错性强 ,效率高

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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