hypercube network 中文意思是什麼
hypercube network
解釋
超立方形網路-
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 、超立方體、星型網路等得到迅速發展。 -
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
超立方體網路是多處理機系統中常見的一種互連網路，這種網路拓撲結構由於具有直徑小、可擴展性強、結構對稱、網路尋路演算法簡單等優點，且多種拓撲結構的互連網路都可以很容易的嵌入其中，因而成為最重要和最具吸引力的網路模型之一。 -
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容錯模型的上下界估計，並給出一個非常有意義的猜想，而且結合程序結果對上下界及猜想進行了驗證。 -
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請求距離向量路由和動態源路由是重要的請求路由演算法。 -
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 ）的容錯路由選擇演算法及最長路徑長度。 -
An updated - latin hypercube sampling and calculated data based on wave motion theories are adapted for efficient generation of the patterns of training the neural network. the levenberg - marquardt algorithms was applied to modify the weight matrices of neural network
採用修正的latin超立方采樣技術和波動理論的計算數據來形成網路的輸入和輸出數據，用lm演算法訓練網路，改善了網路訓練的收斂性能。
分享友人