樹的遍歷 的英文怎麼說

中文拼音 [shùdebiànlì]
樹的遍歷 英文
traversal of tree
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 的 : 4次方是 The fourth power of 2 is direction
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  1. With the plant bionomy the tree ' s growth mechanism is analysed. tree ' s growth model and data structure are builded, and the way of traversaling is advanced

    本文從植物生態學角度出發，根據樹的生長原理，建立生長模型及相應的數據結構，並提出該結構的遍歷演算法。
  2. In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree

    特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。
  3. That makes the tree walking more explicit

    的改寫，它使得樹的遍歷演算法更明顯。
  4. We studied the relation of knowledge - points and give a personal control - tactical algriothms for learning knowledge - points. and this will help construct the personal courseware structure. as for selecting suitable knowledge - point, we also use the the history records metioned above, and attempt to find the regularation between the attributes of knowledge - point the characters of the learners

    知識點的遍歷過程即是課件的學習過程，本文從知識點之間關系的角度，建立知識點網路，給出了遍歷課件知識點網路的個性化控制策略演算法；至於選擇適合的知識點，本文利用上面已建好的數據倉庫，運用決策樹方法，找出學生特點與知識點屬性的關系，為製作課件時組織知識點提供參考。
  5. This is a heuristic strategy. it can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. the correctness and validity of collision detection can be guaranteed by maintaining the tracing list

    這是一個啟發式的策略，通過跟蹤國防科學技術大學研究生院學位論文上一時間采樣點對包圍盒樹的遍歷過程，確定當前時間采樣點的遍歷路徑，從而有效地減少了遍歷過程中包圍盒相交測試的次數，提高了演算法效率，同時通過對跟蹤表的維護，保證了碰撞檢測的正確性和有效性。
  6. It leads to a declarative style of programming because it saves having to write all the tree walking and tree manipulation routines

    從而形成了聲明性的編程風格，因為避免了編寫所有的樹遍歷和樹處理常式。
  7. When the walk is completed, creates a new tree the output tree from the input tree and the rules in the templates

    遍歷完成時，按照輸入樹和模板中的規則生成一棵新樹（輸出樹） 。
  8. Sax walks the document tree bit by bit and sends out events corresponding to the current node

    Sax逐位遍歷文檔樹並發送出與當前節點相應的事件。
  9. In this paper, we discuss a kind of filter generator whose filter functions have less input bits than the degree of the linear feedback shift register ( lfsr ). by analyzing the structure of the filter generator and its equivalent system, we give out a conditional search algorithm ( csa ) to attack this kind of filter generators

    針對濾波函數f （ x ）的輸入比特數m少於線性反饋移位寄存器級數n的濾波生成器，本文通過分析其等價的組合生成器的結構，以及不同節拍上驅動序列的各個符號之間的制約關系，給出了廣義解序列的概念，並提出了類似遍歷二叉樹的條件搜索演算法csa ，用於攻擊該類特殊的濾波序列。
  10. According to binary tree level traversal principle, this article embarks from fully binary tree ' s definition and the nature, and proposes a method to judge fully binary tree on the basis of traversing binary tree

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  11. The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent

    本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。
  12. That implements the tree walking

    實現了樹的遍歷。
  13. Traversal of tree

    樹的遍歷
  14. This gives you flexibility to serialize the same dom tree into multiple xml documents, again avoiding potentially costly traversals and modifications of a dom tree

    這樣就提供了將相同的dom樹串列化成多個xml文檔的靈活性，同時再次避免了可能代價很高的對dom樹的遍歷和修改。
  15. 5. the design of dynamic link library. the system ' s dynamic link library encapsulates a series of function including database ' s call, clusters construction, thrice catalogue constructions tree, building the html code of the tree, etc. 6

    系統的底層支撐動態鏈接庫封裝了實現數據庫訪問、類結構、三叉目錄結構樹、樹結構html編碼、樹的遍歷、子結點搜索、素材文件的流式傳輸等功能的一系列函數。
  16. Furthermore, combined the execution rule of petri nets and the search algorithms of tree, an innovative scheduling method is proposed by applying a heuristic search to the state space of petri nets. specially, by introducing heuristic function, depth - first and width - first is mixed in the search course ; thereby a feasible solution can be generated in a reasonable amount of time

    其次，在所得柔性製造系統petri網模型的基礎上，通過把樹的遍歷演算法與petri網的運行規則相結合，提出了一種啟發式調度演算法，通過在演算法中引入反映問題特徵的啟發函數，把廣度優先和深度優先搜索有機地結合，使得該演算法能夠在合理的時間復雜度內得到滿足精度要求的優化調度。
  17. By introduction of derivative rule, derivative formula can be found ; through defining multi - dimension function space and reorganizing the function rules, the inaccuracy rules, and the end rules, the scope of formula finding is broadened ; by introduction of three - dimension expand rule and multidimensional expand rule, multi - dimension formulas can be discovered ; through improvement of flow of algorithm, more complete traverse has been achieved

    通過引入導數規則，可以發現導數公式；通過定義函數空間，重新組織函數規則，誤差規則，終止規則等知識，擴大了公式發現的廣度；引入多維擴展規則，可以發現多維函數公式；針對公式發現流程進行了改進，使得對搜索樹的遍歷更加完備。
  18. In chapter 3, for the case that the terrain data can not fit in memory, we describe a data layout technique of providing coherent access to the terrain data that are consistent with our mesh simplification. we reorder the data in a manner that is of multiresolution and the overhead is completely eliminated

    第三章中，為了能處理超出內存容量的地形數據，我們對海量地形數據進行了重新組織，設計了一種基於層次二叉樹的遍歷方式的頂點存儲方式，存儲的頂點數據是多解析度組織的，並且沒有冗餘。
  19. Firstly, singly linked lists are used as the data structure of this algorithm rather than doubly linked lists or trees as other algorithms use, so less memory space and running time are required. secondly, the relationship between the entry and exit points on the two polygons is found and argumentation, which, with the reasonable operations on the lists, reduces the times that the lists are traversed and allows the polygon to be input clockwise or counterclockwise

    該演算法使用單線性鏈表數據結構，與其它使用雙鏈表或樹結構的演算法相比具有佔用空間少及處理速度快的特點；其次，找出並論證兩個多邊形之間進、出點之間的關系，並通過合理的數據結構處理，減少了演算法對多邊形鏈表的遍歷次數，而且允許多邊形既可以按順時針方向也可以按逆時針方向輸入。
  20. Because any component ( including segtion of line ) in distribution network belongs to the main line or branch line, this aogorithm classfies all the components in the distribution network into two type of aggregated components, feeder - node component and branch line - node component, and thinking the component fault is equivalent to the corresponding node component fault, adopting binary tree as the model of distribution network is very fast to traverse all the nodes and search of any node in the network

    根據配電網路中任一元件位於饋線或分支線這一特點，將整個網路的元件組合成饋線節點和分支線節點兩種集合元件，從而將元件故障等效為相應的節點故障，實現對配電網路模型的簡化，採用二叉樹模型作為演算法的數據結構，易於實現對整個網路節點的遍歷及節點的搜索。
分享友人
分享到 Line

分享到臉書