生成樹演算法 的英文怎麼說

中文拼音 [shēngchéngshùyǎnsuànfǎ]
生成樹演算法 英文
spanning tree algorithm
  • 生 : Ⅰ動詞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 （樹...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 生成 : 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. 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

    本文的第三章從單個可修復元件的可靠性指標出發，在分析電網路的拓撲結構的基礎上，利用一定的演算法求出其對應的生成樹，根據生成樹和最小割集之間的對應關系，得到整個電網路的最小割集。
  3. 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導致阻塞埠轉換為轉發模式。
  4. 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克隆個數的最佳值。
  5. 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 ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  6. It introduces the architecture of the switch, hol, delay control, vlan and spanning - tree algorithm, and crossbar backplane and store - and - forward technology

    介紹了線頭阻塞、時延控制、虛擬局域網和生成樹演算法等概念以及交換機的交換矩陣和共享存儲器等關鍵技術。
  7. The reduction request knowledge of background and meet with standard of data mining. decisive tree algorithm of id3 is used to prove the validity of feature reduction and to generate intrusion detection rules

    粗糙集約簡具有扎實數學理論基礎，不需要背景知識，符合數據挖掘的要求。用id3決策樹演算法去印證約簡的有效性和檢測的時間效率並生成檢測規則。
  8. Minimum spanning tree algorithm based on extended double list storage structure

    基於擴展雙鏈式存儲結構的最小生成樹演算法
  9. It ' s a pity that although there are many papers and articles focused on data mining published every year, most of them deal with data mining concept and abstract algorithm theory, it is hardly to see their real implementation and application, in this context, when i was in my graduate exercitation in a company in beijing, which focus on developing supermarket software, i joined and completed an olap ( online analytical processing ) project, merchandise analysis and sale report system, which based on microsoft analysis service and microsoft sql server. i also design and implement three important algorithms : merchandise association rule algorithm based on multi - level merchandise category, supermarket member customer shopping frequent sequence generating algorithm, customer classification ( decision tree ) algorithm which based on information entropy and conditional probability tree, and they all achieve expected result

    本文作者在實習期間，參與並完成了基於微軟分析服務器的銷售分析與報表系統；並在公司即將開始的數據挖掘項目中，完成了多個重要演算法的設計和c + +程序實現：基於多層分類商品樹的商品關聯規則演算法，會員顧客的購物頻繁序列模式產生演算法；基於信息熵理論和條件概率樹的會員顧客分類（決策樹）演算法，並分別使用數據進行了測試，取得了較好的結果。
  10. The nmst is taken as prediction tree and is used to remove the correlation of hyperspectral image. compared with the mst algorithm, the construction speed of nmst is improved more than ten times

    近最小生成樹演算法與最小生成樹演算法相比，預測樹的構造速度提高一個數量級以上，而壓縮比降低了不到5 。
  11. Secondly, the thesis puts forward that conditional probability of attribute to positive example can be used to compare the information which attribute provides so as to construct decision tree and to get classify rules. and a demonstration shows that the algorithm simplifies the decision tree ' s building process efficiently

    其次，提出了利用屬性對正例的影響度來比較屬性對分類提供的信息量，進而選擇分類屬性構造決策樹的條件概率決策樹演算法，同時實例計算說明該演算法有效地簡化了決策樹的生成過程。
  12. The application and analyze about the algorithm of minimum spanning tree in multi - join

    最小生成樹演算法在多元連接中的應用及演算法分析
  13. At the same time, a fast heuristic algorithm of mimimum cost tree with delay constraint are presented, its time complexity is ( pn2 )

    同時還提出了一種滿足延遲約束的多播最小生成樹演算法（時間復雜度為（ pn2 ） ） 。
  14. ( 3 ) on the basis of the dimensioning principle of correctness, integrality, clearness and rationality, utilizing the modified spanning tree algorithm in graph theory to ascertain the non - functional dimensions, accomplish the dimensioning mode analysis of the part

    （ 3 ）根據尺寸標注所要求的正確性、完整性、清晰性及合理性等原則，用改進了的圖論中的生成樹演算法，確定出零件的非功能尺寸，完成零件尺寸標注模式的分析。
  15. This paper begins with analyzing current metro transport network. combined with ethernet work technologies, an innovative scheme has been proposed to solve transporting packet - service on metro transport network. in this scheme, the key technology is using stackable vlan to establish metro ethernet evc, and using " self - limited " protocols to manage layered metro ethernet network

    方案中採用了可堆疊式vlan （ stackablevlan ）技術來建立城域以太網evc連接，提出並採用了「自限」的概念，改造了用於以太交換網路的傳統生成樹演算法和傳統gvrp協議，實現了網路設備的分層、分自治域管理。
  16. This viewer displays mining models that are built with the microsoft decision trees algorithm

    該查看器顯示使用microsoft決策樹演算法生成的挖掘模型。
  17. 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演算法。
  18. At last, according to the characteristic of report generator in tribon, we established the product structure managing system, studied the algorithm for the generation of the product structure tree and generated the visual product structure tree, and have an eye on the management of bom, taking accout of the correctness of the information of bom, we adopted the method of from top to bottom or from bottom to top to provide information ; and designed 6 bom to accomplish the function

    最後，根據tribon系統中報表生成器的特點，建立了產品結構管理系統，研究了產品結構樹生成的演算法，生成了可視化產品結構樹。並對產品物料清單bom的管理進行了研究，考慮到bom信息的準確性，採用了bom以自頂向下分解的形式或是以自底向上跟蹤的形式提供信息；並設計了物料清單bom的六種形式來實現其功能。
  19. Chapter 6 discusses a modeling of the mst algorithm of supporting qos multicast routing, puts forward a new algorithm, simulates it and gets the results, the proof of correctness and complexity analysis of the new algorithm are given, chapter 7 summarizes this paper, at the same time, suggestions for future research are given

    第6章，討論了支持qos多播路由的基於最小生成樹演算法的理論模型並提出一種新的演算法，試驗模擬結果證明了它的效率會比傳統演算法大大提高。第7章，給出了本文的總結，並對下一步的工作作了展望。
  20. The process of generating decision - making tree from collaboration net is presented and the algorithms to optimize collaboration tree are adopted to construct the best decision - making tree

    並描述了從組織協作網到決策樹的生成過程，對生成過程的求解採用了優化協作樹演算法。
分享友人
分享到 Line

分享到臉書