立方體的 的英文怎麼說

中文拼音 [lìfāngtǐde]
立方體的 英文
cubical
  • 立 : 動1 （站） stand; remain in an erect position 2 （使豎立; 使物件的上端向上） erect; stand; set up...
  • 方 : Ⅰ名詞1 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 體 : 體構詞成分。
  • 的 : 4次方是 The fourth power of 2 is direction
  • 立方 : 1. [數學] cube 2. [簡] （立方體） cube3. （立方米） cubic metre; stere
  1. Use the vector dot product to find the obtuse angle between two diagonals of a cube.

    用矢量點積求立方體的兩條對角線所夾的鈍角。
  2. 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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  3. The crystal structure has each atom surrounded by eight nearest neighbors which lie at the corners of a cube.

    其晶體結構是每個原子都被8個最鄰近的原子所包圍，它們分別位於立方體的各個角上。
  4. The crossed cube is a variant of the hypercube, and it has better recursive structure, graph parameters and topological properties

    摘要交叉立方體是超立方體的一個變種，具有良好的圖參數、拓撲性質和結構遞歸性。
  5. An olap cube ( sales ) is built as an example. then it analyzes the cube by multidimensional expressions ( mdx ), some examples are presented. this paper also makes some suggestions to ameliorate the model

    而後，根據超市配送系統所涉及的工作和抉策分析的需求，設計銷售立方體的星型模型，確定立方體的維度表和事實表的結構。
  6. Firstly, the notion of the form as a = > b [ s %, c % ] is researched and some algorithms are discussed. an algorithm named a progressive refinement approach to spatial data mining is discussed in detail. and a new thought of mining spatial association rule based on spatial data cube is brought forward

    闡述了a = > b [ s ， c ]形式的空間關聯規則的基本概念和演算法，詳細研究了一種逐步求精的空間關聯規則挖掘演算法的實現；提出一種基於空間數據立方體的空間關聯規則挖掘的新思路；將空間統計分析引入空間關聯規則挖掘領域，研究了空間權重矩陣、空間自相關、空間關聯等的度量函數，並利用空間統計分析技術發現空間相關關系和空間關聯規則。
  7. Fluorite is found in various parts of the world, especially in england, germany, mexico, and in kentucky and illinois in the united states

    瑩石晶體常呈立方體八面體或立方體的穿插雙晶，集合體呈粒狀或塊狀。
  8. Perspective laws not allowed to be ignored focal perspective relations of cubes

    論關于立方體的焦點透視關系
  9. But i want to debate this particle cube thing

    但是我想對這個立方體的微粒討論一下
  10. A new method to compute the sparse datacube

    一種新的計算稀疏數據立方體的方法
  11. All the six faces of the cube were white.

    這個立方體的六個面都是白色的。
  12. Design multidimensional data model

    多維立方體的形式化描述
  13. Asymptotic properties of hypercubes

    超立方體的漸近性質
  14. Having the shape of a cube

    立方體的具有立方體形狀的
  15. Algorithms for data cube - based intra - dimensional association rules mining

    基於數據立方體的維內關聯規則挖掘演算法
  16. With this method, in the present thesis, we will classify all the connected regular covering graphs of the cube satisfying the following two properties : ( 1 ) the covering transformation group is isomorphic to the elementary abelian p - group ; ( 2 ) the group of fibre - preserving automorphisms acts edge - transitively

    本文中，我們用同一種方法分類立方體的正則連通覆蓋圖，並且滿足兩個條件，覆蓋變換群同構于初等交換p -群且保纖維自同構群是邊傳遞的。
  17. 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 ）的容錯路由選擇演算法及最長路徑長度。
  18. The article described the operation on the multidimensional data mode through simply way

    以一種更簡明的方式展現了針對立方體的基本操作。
  19. Age 3 + ) perfect for hands - on learning and illustrative teaching of area, volume, surface area - nets, symmetry and perimeter. this 16 - piece set includes 8 transparent shapes and 8 folding shapes. shapes are 3 ’ ’ in height

    適合三歲或以上）此套裝共有8個三?高透明幾何立方體以及8塊可摺成不同幾何形狀立方體的咭紙，可用來教導面積、體積、表面積、對稱和周界等概念。
  20. 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

    交叉立方體的上述這些性質都與超立方體的相同。為了進一步提高連通度，我們改進了交叉立方體的網路拓撲結構，對頂點地址相反的頂點對之間增加一條邊，構成加強交叉立方體。
分享友人
分享到 Line

分享到臉書