hypercube中文是什么意思

发音:

中文翻译
造句

超正方体
心慌方・超立方体
异次元杀阵2：超级立方体

hypercube network 超立方形网络
hypercube system 超立方系统
hypercube topology 超立方拓扑结构
hypercrystal lcd 万像素的超晶 lcd
hypercrystal 超清透
hypercryesthesia 冷觉过敏
hypercupremia 高铜血症
hypercryalgesia 冷觉过敏
hypercuprmia 高铜血症
hypercross-linking 过度互联

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Among all proposed wireless mobile adhoc routing protocols , adhoc on - demand distance vector routing ( aodv ) and dynamic source routing ( dsr ) are the most prominent . we do research on distributed algorithms , mainly the multi - dimensional interval routing scheme on hypercube and the routing algorithms on adhoc network
目前， adhoc无线网络设计的研究主要集中于分布式路由技术，在所有的adhoc请求路由算法中， adhoc请求距离向量路由和动态源路由是重要的请求路由算法。
The paper will study the upper questions based on the two interconnection networks . first , we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second , with the rapid progress in vlsi , the failing probability of processors and links is very low , the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary , we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time , the result is the same as the hypercube . we also give a related algorithm in o ( n ) time , and the length of the longest path ; third , we apply cluster faun tolerance introduced by q . - p
根据menger定理， n -维交叉立方体可以容纳n - 1个故障顶点，我们给出了它的时间复杂度为o ( n )的容错路由选择算法及其最长路径长度分析；在此基础上本文证明， n -维交叉立方体的条件连通度为2n - 2 ( n 2 ) ，并给出了相应时间复杂度为o ( n )的算法及其最长路径长度；除此之外，本文还证明当n -维交叉立方体中的故障簇个数不大于n - 1 ，其直径不大于1 ，故障顶点总数不超过2n - 3 ( n 2 )时，交叉立方体中任两个无故障顶点都至少有一条可靠路径。
It has small diameter , strong expansibility , symmetrical structure and simple path searching algorithms , etc . , what more , many interconnection networks with different topologies can be easily embedded in it . so it becomes one of the most important and attractive network models . in this thesis , based on the above two aspects , the fault - tolerance and routing algorithms of the hypercube are studied
超立方体网络是多处理机系统中常见的一种互连网络,这种网络拓扑结构由于具有直径小、可扩展性强、结构对称、网络寻路算法简单等优点,且多种拓扑结构的互连网络都可以很容易的嵌入其中,因而成为最重要和最具吸引力的网络模型之一。
For the next interconnection network , we proved the connectivity of the n - enhanced crossed cube is n + 1 , and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time , which is better than the hypercube and the crossed cube , two related algorithms in o ( n ) time are also given ; more , we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ) , which is better than the hypercube and the crossed cube also
本文证明n -维加强交叉立方体的连通度为n + l ，条件连通度为zn ( n > 3 ) ，簇容错特征数为( n ， l ， zn ) ， ( : 1 > 3 ) ，这些性质都比交叉立方体的更优越。更进一步，木文也给出了加强交叉立方体的基于连通度的，条件连通度的时间复杂度为o ( n )的容错路由选择算法及最长路径长度。
Therefore , it turned out most important that how to find a new kind fault - tolerance model to hold more faulty nodes and how to design more efficient fault - tolerant routing algorithm to ensure accurate and reliable message passing among non - faulty nodes . hypercube is one of the common interconnection networks
因此,如何找出一种新的网络容错模型以便容纳更多的错误节点,以及如何设计高效的容错路由算法以便保证无故障处理器间正确可靠的信息传递是至关重要的。
With the development of computer networks and computing science , paralleling computer and interconnection networks , covering mathematics 、 computing science 、 information science and so on , are becoming one of the hotspots of computer science research . all kinds of interconnection networks with different topologies , such as ring , mesh , hypercube , star topology network etc . , have been received rapidly development
随着计算机网络技术与计算科学的发展,并行计算机及其互连网络作为一个跨数学、计算科学与信息科学等多门学科的领域,逐渐成为计算机科学研究的热点之一,各种拓扑结构的互连网络,如环、 mesh 、超立方体、星型网络等得到迅速发展。
In order to efficiently analyze the fault - tolerance of hypercube network and to propose a better fault - tolerant algorithms , the evaluation of an upper bound and a lower bound on the lip are given . a very significative conjecture on the bound of lip is obtained . besides , the
2 .为了更好的分析超立方体网络的容错性,提出更为优越的容错路由算法,文章给出了超立方体网络中lip容错模型的上下界估计,并给出一个非常有意义的猜想,而且结合程序结果对上下界及猜想进行了验证。