樹樣分枝的 的英文怎麼說

中文拼音 [shùyàngfēnzhīde]
樹樣分枝的 英文
arboroid
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 樣 : Ⅰ名詞1. （形狀） appearance; shape 2. （樣品） sample; model; pattern Ⅱ量詞（表示事物的種類） kind; type
  • 分 : 分Ⅰ名詞1. （成分） component 2. （職責和權利的限度） what is within one's duty or rights Ⅱ同 「份」Ⅲ動詞[書面語] （料想） judge
  • 枝 : Ⅰ名詞1. （枝子） branch; twig 2. （姓氏） a surname Ⅱ量詞1. （用於帶枝子的花朵） 2. （用於桿狀物）
  • 的 : 4次方是 The fourth power of 2 is direction
  1. When the approximate optimized scheme of common job - shop scheduling discussed in the paper is applied to the practice, it could make some parts of working procedures of processing product be the tail end of the tree that working procedures of this product makes, that is, these parts of working procedures still makes a tree like the whole process. during the processing of one product, if another product needed to be processed, we could process it with the mentioned method solving static job - shop scheduling. therefore, a new method to solve dynamic job - shop scheduling is put forward and validated by practice

    同時採用本文提出的解決一般job - shop調度問題的全新近優解方案，可以使得產品所加工的部分工序是產品的加工工藝圖（加工樹）某些枝杈的末端，即產品未加工的剩餘部分工序的加工工藝圖仍然是一棵加工樹，這樣對于正在加工的產品，如果有另外需要加工的產品，可一併按上述解決靜態job - shop調度問題的方法處理，於是本文又提出了一個解決動態job - shop調度問題的新方法，並通過實例加以說明。
  2. The results show that the a - phase - transformation of pure aach can be completed by heating at 1200 ? for two hours. but under this temperature, the alumina particles will be sintered together, which can lead to the formation of bough - like structures. and these bough - like structure will make the powder difficult to be dispersed

    接著對碳酸鋁銨進行了焙燒實驗，研究了其在升溫過程中的相變行為，結果表明：純aach在1200保溫1 . 5h的情況下才能100轉變為氧化鋁，而在這樣高的溫度下，粒子之間會形成燒結頸，從而使粉體產物在形貌上出現所謂「樹枝狀」結構，給粉體使用時的分散帶來了困難。
  3. Westward, the wiry boughs of the bare thorn hedge which formed the boundary of the field rose against the pale opalescence of the lower sky

    在西邊，光禿禿的棘樹的枝條像鐵絲一樣，結成樹籬，形成一塊塊田地的邊界，在低矮的灰白天色里十分顯眼。
  4. Firstly, some basic algorithms for inducing decision tree are discussed, including id3, which uses information gain to select a splitting attribute when partitioning a training set ; c4. 5, which can deal with numeric attributes ; cart, which uses gini rule in attribute selection and induces a binary tree ; public, which puts tree pruning in the tree building phase ; interactive method, which puts artificial intelligence and human - computer interaction into the procedure of decision tree induction ; as well as sliq and sprint which are scalable and can be easily parallelized. advantages and disadvantages of these algorithms are also presented

    文中詳細闡述了幾種極具代表性的決策樹演算法：包括使用信息熵原理分割樣本集的id3演算法；可以處理連續屬性和屬性值空缺樣本的c4 . 5演算法；依據gini系數尋找最佳分割並生成二叉決策樹的cart演算法；將樹剪枝融入到建樹過程中的public演算法；在決策樹生成過程中加入人工智慧和人為干預的基於人機交互的決策樹生成方法；以及突破主存容量限制，具有良好的伸縮性和并行性的sliq和sprint演算法。
分享友人
分享到 Line

分享到臉書