hypercube造句
例句與造句
- Analysis of routings for fault in generalized hypercube
廣義超立方體網(wǎng)絡(luò)的容錯路由分析 - On the distinguishing number of the cube of the hypercube
超立方體三次冪的可區(qū)別數(shù)研究 - Latin hypercube sampling based uncertainty simulation of concrete time effects
的混凝土時效不確定性模擬研究 - D , m - dominating numbers of hypercube
的控制數(shù) - The crossed cube is a variant of the hypercube , and it has better recursive structure , graph parameters and topological properties
摘要交叉立方體是超立方體的一個變種，具有良好的圖參數(shù)、拓撲性質(zhì)和結(jié)構(gòu)遞歸性。 - It's difficult to find hypercube in a sentence. 用hypercube造句挺難的
- The emphasis is played on the discussion of sobol " method and the latin hypercube sampling and the wind - stairs sampling characterized as small sample plus quick convergence are selected
著重討論了sobol '靈敏度分析方法和采樣小、收斂快的latin超立方和wind - stairs采樣技術(shù)。 - 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超立方采樣技術(shù)和波動理論的計算數(shù)據(jù)來形成網(wǎng)絡(luò)的輸入和輸出數(shù)據(jù)，用lm算法訓練網(wǎng)絡(luò)，改善了網(wǎng)絡(luò)訓練的收斂性能。 - Gu to the crossed cube , and proved that for node - to - node routing , the crossed cube can tolerate as many as n - 1 faulty clusters of diameter ai most 1 with at most 2n - 3 ( n > 2 ) faully nodes in total which is as good as the hypercube
交叉立方體的上述這些性質(zhì)都與超立方體的相同。為了進一步提高連通度，我們改進了交叉立方體的網(wǎng)絡(luò)拓撲結(jié)構(gòu)，對頂點地址相反的頂點對之間增加一條邊，構(gòu)成加強交叉立方體。 - In chapter two we give a multi - dimensional interval routing scheme on hypercube and a routing algorithm based on the compact routing table . we discuss the complexity of the algorithm . in addition , a fault - tolerant algorithm on hypercube is put forward
第二章給出了超立方體結(jié)構(gòu)的一個多維區(qū)間路由方法，進而給出了一個基于簡明路由表的路由算法，并分析了算法的復雜性，同時還提出了超立方體結(jié)構(gòu)的一個容錯路由算法。 - 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無線網(wǎng)絡(luò)設(shè)計的研究主要集中于分布式路由技術(shù)，在所有的adhoc請求路由算法中， adhoc請求距離向量路由和動態(tài)源路由是重要的請求路由算法。 - 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
根據(jù)menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o ( n )的容錯路由選擇算法及其最長路徑長度分析；在此基礎(chǔ)上本文證明， n -維交叉立方體的條件連通度為2n - 2 ( n 2 ) ，并給出了相應(yīng)時間復雜度為o ( n )的算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數(shù)不大于n - 1 ，其直徑不大于1 ，故障頂點總數(shù)不超過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
超立方體網(wǎng)絡(luò)是多處理機系統(tǒng)中常見的一種互連網(wǎng)絡(luò),這種網(wǎng)絡(luò)拓撲結(jié)構(gòu)由于具有直徑小、可擴展性強、結(jié)構(gòu)對稱、網(wǎng)絡(luò)尋路算法簡單等優(yōu)點,且多種拓撲結(jié)構(gòu)的互連網(wǎng)絡(luò)都可以很容易的嵌入其中,因而成為最重要和最具吸引力的網(wǎng)絡(luò)模型之一。 - 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 ) ，簇容錯特征數(shù)為( n ， l ， zn ) ， ( : 1 > 3 ) ，這些性質(zhì)都比交叉立方體的更優(yōu)越。更進一步，木文也給出了加強交叉立方體的基于連通度的，條件連通度的時間復雜度為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
因此,如何找出一種新的網(wǎng)絡(luò)容錯模型以便容納更多的錯誤節(jié)點,以及如何設(shè)計高效的容錯路由算法以便保證無故障處理器間正確可靠的信息傳遞是至關(guān)重要的。
更多例句： 下一頁