binary tree 中文意思是什麼

binary tree 解釋
二元樹
  • binary : adj. 二，雙，復；【化學】二元的；【數學】二進制的。n. 二，雙，復；雙體，復體；【天文學】雙[聯]星【數學】二進制。
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. A binary tree - based and dyadic indicated codification method is proposed in the digital watershed model ( dwm )

    摘要在數字流域模型中提出了一種基於二叉樹理論，並以二元形式表示的河網編碼方法。
  2. Firstly the patterns of the multifingered hands are detailed, eight patterns are defined. the classical bayes method is used in the classification of pre - grasp of multiple fingers based on three patterns which are grasping, holding and pinching. based on the eight pre - grasp patterns, bp neural network is applied in the classification of the pre - grasp of multifingered hands and gets a good effect. the method solves the shortcoming input sample relying on the propobility density and simplified the un - insititution characters extraction. in this paper, support vector machine ( svm ) and binary - tree with clustering is applied in the classification. this method can solve the slow speed and effect with fewness sample in the classification, achieving a good effect. in this papper, we extract the characters of the regulation object with geometry characters and extact the unregulation object with the image analysis

    此法解決了輸入樣本依賴物體的概率密度的特點，簡化了分類特徵提取的不直觀性。本文還採用了支持向量機（ svm ）和聚類二叉樹相結合的方法對機器人手預抓取八類模式進行分類，解決了預抓取模式分類訓練速度過慢以及在分類中樣本數量偏少而影響分類效果的問題，得到了較高的正確率。本文對預抓取幾何形狀規則的物體採用直接提取其幾何特徵，對于預抓取幾何形狀不規則的物體採用圖像分析的方法進行特徵提取。
  3. The main context of this paper is to generalize some rigurous results of " critical exponents " from binary tree to k - nary tree. percolation on the trees is defined as follows. we write t = ( z, e ) for the bond percolation on the tree. we write z for the set of vertices of t. arid e for the set of its edges

    K分樹是一種特殊的樹，它是一種規則樹，具體的定義如下：圖t = （ z ， e ）稱為k分樹， （其中z表示點集， e表示邊集）是指除了一個點（稱為頂點） ，與k個邊相連（即該點的度為k ） ，其它各點均與k + 1個邊相連（度為k + 1 ） ，我們可以把該點記為，稱為第0代（或祖先） ，與該頂點相鄰的點稱為第一代。
  4. First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine

    首先闡述了搜索引擎的工作原理，性能指標，主要技術；分析了現有目錄式搜索引擎的缺點，接著介紹了聚類分析演算法與螞蟻演算法的理論，並論述了二者結合的可能性和必要性，這種結合方法也在一定程度上克服了聚類分析演算法容易陷入局部最優的缺點，最終提出了通過使用螞蟻演算法建立二叉樹、 m叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  5. Full binary tree

    滿二叉樹
  6. A binary search tree is a binary tree with the following properties

    二進制搜索樹（ bst ）是具有以下屬性的二進制樹：
  7. Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  8. The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree

    在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。
  9. On the basis of analysis by consistent query answer of inconsistent database, and of nonaggregate constraints, keyword as metadata, the principle of the b - tree and binary tree, found a new research method to inconsistent database

    摘要在分析非一致性數據庫一致性查詢方法的基礎上，結合非聚集約束條件，以關鍵詞為元數據，利用b -樹與二叉樹的原理，提出一種新的針對非一致性數據庫的查詢方法。
  10. Binary tree sort

    二叉樹排序
  11. The first part of this thesis describes the theory of rbf neural networks. the input space is thus divided into hyperrectangles organized into a regression tree ( binary tree ) by recursively partition the input space in two

    第一部分從rbf網路出發，通過遞歸分割將輸入空間劃分為兩部分，從而將輸入空間變成一個用超矩形構成的回歸樹（二叉樹） 。
  12. The core contents of digital power transmission network are to build the true three dimension scene of objective region, to search for the transmission equipments and to operate them in the scene interactively. according to the two main kinds of three dimension digital models ( earth surface model and transmission equipment model ), this thesis describes a simplifying method depended on view - point : it accomplishes displaying and flying over a large area of true earth surface with level of detail model based on block - binary tree. and it realizes " the efficient display of abundant data of equipment models and interactive management by the method of combination of models and images

    構建目標區域的真實三維場景，並在場景中對輸電設備進行查詢和交互操作是數字輸電網路的核心內容，本文針對數字平臺中兩種主要的三維數據模型? ?地表模型及輸電設備模型提出了基於視點的簡化方法：用塊? ?二叉樹結構的動態細節層次模型解決了大區域真實地形的顯示及漫遊方法；用失柵結合的方式實現了對海量設備模型數據的高效顯示及交互管理的功能。
  13. Traversing binary tree

    遍歷二叉樹
  14. 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

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  15. The recursive and non - recursive algorithm of post - traversing binary tree

    二叉樹後序遍歷的遞歸和非遞歸演算法
  16. Threaded binary tree

    線索二叉樹
  17. An attribute means clustering binary tree is presented in this paper. the binary tree is extends naturally and turns to be a supervised classification method. the orl database is used to evaluate the proposed method. the performance of the attribute means clustering binary tree used in face recognition is compared with the standard eigenface approach and improves their performance much in the experiment

    在無監督的屬性聚類網路的基礎上，提出了一種二叉樹分類方法。此二叉樹自然地在無監督聚類的基礎上擴展開來，成為一有監督的分類方法。用orl人臉數據庫做了測試，同標準的特徵臉eigenface方法相比，識別率得到了較大的提高。
  18. In the light of the method of top - down, the author put forward the concept of product function structure tree, which was used to express the product ' s function structure during the conceptual design. based on it, the product structure was expressedthe paper studies the definition of the function model which supports the method of top - down design, and the expression of function model based on binary - tree was also put forward in the thesis. for the abstract description of parts in the assembly level and the integration with other systems during the whole life circle of the products, the concept of assembly model was presented, the definiton, classfication and expresstion method of assembly feature was studied in this thesis. the representation of assembly relationship and data structure of the assembly model based on diagram was further studied. for the constraints transfer between function model and assembly model, an hierarchical component model is presented. an arithmetic of the change of assembly relationship when assembly model changing was also studied. fmally, a system named fb - tpms, which using object oriented programming technology and pro / toolkit, was developed

    為了支持在裝配層次上的零件的抽象建模，提出了骨架模型的概念，並討論了裝配模型的建立方法。根據前述裝配模型有關研究，探討了從功能模型到裝配模型以及從上一級裝配模型到下一級裝配模型的數據和約束傳遞問題，並用層次化單元裝配模型得以解決，同時提出了裝配模型變動時引起的裝配關系的變化的有關演算法。在論文的最後部分用用面向對象的程序設計方法，結合課題要求，研究了支持自頂向下設計方法的裝配建模系統fb - tpms 。
  19. Due to the data transmission characteristics between tags and reader, space division multiple access ( sdma ), frequency division multiple access ( fdma ) and code division multiple access ( cdma ) are applied in a limited way in rfid system. therefore, time division multiple ( tdma ) has been generally accepted. according to tdma, there are aloha protocol, s - aloha, binary - tree protocol, clipped binary - tree protocol and others

    解決這個問題必須要用到多路存取法，針對射頻識別系統中閱讀器與應答器之間的通信特點，空分多路法、頻分多路法、碼分多路法在rfid系統中應用都受到一定的限制，只能應用到一些特定的場合，一般採用時分多路法，按照時分多路法的演算法有aloha演算法、時隙aloha演算法、二進制樹型搜索演算法、修剪枝的二進制樹型搜索演算法等防碰撞演算法協議，分析了各自特點以及存在的缺點。
  20. Equivalence analysis of binary - tree - type hierarchical fuzzy systems

    二叉樹型分層模糊系統的等效性分析
分享友人
分享到 Line

分享到臉書