生成樹 的英文怎麼說

中文拼音 [shēngchéngshù]
生成樹 英文
generation tree
  • 生 : Ⅰ動詞1 （生育; 生殖） give birth to; bear 2 （出生） be born 3 （生長） grow 4 （生存; 活） live;...
  • 成 : Ⅰ動詞1 （完成; 成功） accomplish; succeed 2 （成為; 變為） become; turn into 3 （成全） help comp...
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 生成 : create; generate; produce生成演算法 generating algorithm; 生成文法 generating grammar; 生成物 pro...
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. A mst based clustering method with controlling vertexes

    一種帶控制節點的最小生成樹聚類方法
  3. To set the priority of a spantree in an instance, use the set spantree priority priority mst instance command

    去設置生成樹的優先級在勢力中，使用設置生成樹優先級優先mst實例命令。
  4. Using the set spantree mst link - type mode port link - type command, you can configure the link type in any of the following three ways

    使用一個設備mst生成樹鏈路類型使得埠鏈路類型命令，你能夠配置特定的鏈路類型在以下的三種方法里。
  5. By analyzing the topology of an interconnected power system, chapter 3 of this thesis derives the spanning tree, and builds the corresponding minimal cut set. by combining the results from the graph theory with the reliability indices of the individual reparable components, the reliability indices at the load point can be obtained, and the reliability indices for the whole system are deduced

    本文的第三章從單個可修復元件的可靠性指標出發，在分析電網路的拓撲結構的基礎上，利用一定的演算法求出其對應的生成樹，根據生成樹和最小割集之間的對應關系，得到整個電網路的最小割集。
  6. Virtually the only concept to be used is that of a spanning tree.

    更確切地說，只使用了生成樹的概念。
  7. Most of the spanning tree algorithm ( sta ) failures occur due to the excessive loss of bpdus causing the blocked ports to transition to forwarding mode

    大多的生成樹演算法（ sta ）失敗發生由於過多的丟失bpdu導致阻塞埠轉換為轉發模式。
  8. With applying dsst algorithm, mobile agent can solve the problem of selecting router. synthesizing advantages of centralized search engine and distributed search engine, through it that system obtains the best way that agents mobile does. after statistics analysis, the author gets the mathematic pattern that mobil agent clones right times

    利用idl語言定義了agent在多種平臺上移動的介面，設計了一個符合maf規范的插件，實現agent在異種平臺之間的移動；利用動態最小生成樹演算法解決移動agent的路由選擇問題，綜合集中式搜索和分散式搜索的特點，動態尋找出一條agent移動的最佳路線；通過統計分析得到移動agent克隆的數學模型，通過計算可以獲得agent克隆個數的最佳值。
  9. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  10. Figures 3 and 4 show the code generation tree structures built from the

    中的綁定構建的代碼生成樹結構。
  11. I described how the jibx 1. x binding compiler generates bytecode based on a code generation tree structure constructed from the binding definition

    中，我描述了jibx 1 . x綁定編譯器如何基於代碼生成樹結構產生位元組碼，這種樹結構是根據綁定的定義構建的。
  12. To control the process of adding all the methods and classes described in the last section, the jibx binding compiler first creates an internal representation of each binding in the form of a code generation tree structure

    為了控制上一節中描述的所有方法和類的添加過程， jibx綁定編譯器首先用代碼生成樹結構的形式，創建了每個綁定的內部表示形式。
  13. It introduces the architecture of the switch, hol, delay control, vlan and spanning - tree algorithm, and crossbar backplane and store - and - forward technology

    介紹了線頭阻塞、時延控制、虛擬局域網和生成樹演算法等概念以及交換機的交換矩陣和共享存儲器等關鍵技術。
  14. Redundant power supplies, hot - swappable modules and spanning tree protocol ( stp ) support are all mandatory elements of a backbone switch, as is support for emerging switch technologies, including virtual lans

    具有冗餘能力的電源、可熱插拔的模塊和對生成樹協議（ stp ）的支持都是基幹交換機必備的成分，實際上它支持新出現的交換技術，如虛擬局域網。
  15. Evidently, the graph must be connected in order to contain a spanning tree.

    顯然一個圖必須是連通的才能包含一生成樹。
  16. There is a recursive formula for the number of spanning trees in a graph.

    對於一個圖的生成樹的棵數，存在一個遞推公式。
  17. In order to solve this problem, we present a new method in this paper through using the bezier curve as the axial deformation control curve to generate variety trunks and branches

    在生成樹的過程中，利用bezier曲線作為頂點控制曲線，採用軸變形方法生成形態各異、效果逼真的樹乾和分枝。
  18. Minimum spanning tree algorithm based on extended double list storage structure

    基於擴展雙鏈式存儲結構的最小生成樹演算法
  19. Series of numerical examples are tested and the results are compared with that of some other algorithms

    在最小生成樹的基礎上，將超過度約束的頂點降低度數使之滿足度約束條件。
  20. In particular, if t is a spanning tree of g, we shall call its complement t' a cotree.

    如果T是G的一棵生成樹，我們稱它的補集T'為一副樹。
分享友人
分享到 Line

分享到臉書