查找樹 的英文怎麼說
中文拼音 [zhāzhǎoshù]
查找樹
英文
search tree-
Similarly, some universities have installed wireless networks on campus so students can sit under the trees and consult the library ' s card catalog or read their e - mail
類似地，一些大學也在校園內安裝了無線網路，學生坐在樹下便能查找圖書館的卡片目錄，或者閱讀電子郵件。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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。These researches will help us to discover changing or developing principle of things, support to decision - making, etc. the thesis addresses several key technical problems of pattern mining and its search based similarity in time series, which covers feature patterns and relationship patterns mining, pattern search based similarity in time series and stream time series and issues concerning application system implementation oriented to analysis. major contributions of this thesis include : 1. research of mining feature patterns in time series a novel method is proposed to discovery frequent pattern from time series
本文在分析時間序列特點和實際應用需求的基礎上，針對時間序列的挖掘與相似性查找一些關鍵技術進行了研究，具體包括特徵模式挖掘、多序列關聯模式挖掘、相似性模式查找等方面，所做的工作和取得的創新成果體現在以下三個方面： 1 ）時間序列特徵模式挖掘研究首次提出了一種基於互關聯后繼樹模型的時序特徵模式挖掘方法。These researches will help us to discover changing or developing principle of things, support to decision - making, etc. the thesis addresses several key technical problems of pattern mining and its search based similarity in time series, which covers feature patterns and relationship patterns mining, pattern search based on similarity in time series and stream time series and issues concerning application system implementation oriented to analysis. major contributions of this thesis include : 1. research of mining feature patterns in time series a novel method is proposed to discovery frequent pattern from time series
本文在分析時間序列特點和實際應用需求的基礎上，針對時間序列的挖掘與相似性查找一些關鍵技術進行了研究，具體包括特徵模式挖掘、多序列關聯模式挖掘、相似性模式查找，在線相似性查找以及最終的分析應用系統開發等方面，所做的工作和取得的創新成果體現在以下五個方面： 1 ）時間序列特徵模式挖掘研究首次提出了一種基於互關聯后繼樹模型的時序特徵模式挖掘方法。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匯編語言層次上對所有的演算法加以實現。The morphological diagnostic characters for many mature and early instar larvae are still lacking in china. partial sequences of the mitochondrial cytochrome oxydase i and ii and a transfor rna ( co i co ii and trna ) gene of the adults and larvae from caddisflies were. lepidostomaflavum, l. fui, l. arcuatum, paraphlegopteryx morsei, apsilochorema unculatum and apsilochorema hwangi, and the larval and adult stages of these species were sequenced and associated
採用dnastarpackage中的editseq軟體進行序列編輯、 orf查找；採用clustalx軟體進行序列比對（ alignment ） ；比對結果輸入mega2 . 1軟體計算各樣品間的遺傳距離，並基於kjmura2 - parameter模型，用鄰接法（ neighbor - jojning ， nj ）構建系統發生樹，通過自展（ bootstrap1000次）檢驗獲得系統樹分支的置信度。Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索樹在查找經常變化的列表時是很非常有用的。Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索樹在查找經常變化的列表時是很非常有用的。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
在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。Using the tree data structure to manage the grids, the search and connectivity of data can be realized and quickened. the omni - tree structure is developed, which supports anisotropic grid adaptations in any of the coordinate directions and allows high aspect ratio cells. four separate data entities are defined, including nodes, lines, faces and cells, which is convenient to control information management in grids generation and flow calculation
利用叉樹數據結構，實現並加速了網格生成中數據的搜索和查找；發展並提出了全叉樹和各向異性，使得網格的自適應加密可以根據需要在多個方向上任意的選擇；構造點、線、面和網格的四級數據管理模式，改善和方便了數據的有效組織和管理。This article, according to the common digital keyboard on the mobile communication equipment, make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard. using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information. chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space
本文就根據移動通信設備上常見的數字鍵盤，為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究；並使用了一種在查找時空間復雜度為o （ n ） 、時間復雜度為o （ n ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。At the same time, three region segmentation algorithms also are introduced, i. e. global - based segmentation algorithm, tree - based region find in rle map image, and statistic - based region feature computation algorithm
同時在目標區域合併（分割）階段，提出了基於全局掃描的分割演算法、行程編碼圖中基於樹的區域查找演算法和基於統計的區域特徵量計算方法。Find maki wakui s news at google. com
查找夕樹舞子相關新聞Abstract : in this paper, the fault tree of a hydraulic steering gear system was built, methods of fault - shooting with fta were analyzed. such trouble as steering gear moving too slowly of the system could be solved audio - visually and efficiently with mentioned methods
文摘:故障樹分析技術在船舶機械設備維修中的應用越來越廣泛;通過建立某液壓舵機系統故障樹，討論了應用故障樹查找故障的方法，並應用於系統「轉舵太慢」故障檢測中，直觀、高效地解決了問題。A part can be located rapidly in a huge assembly tree by its attribute information, thus the part can be edited in design context. at last, author develops a set of tool with ug / open application programming interfaces and menu tools. using the tool, visible parts in a view can be selected automatically and invisible parts can be blanked or closed automatically according to user ' s requirement
快速操縱大裝配，利用組件過濾器和控制開關快速打開大裝配，減少大裝配的打開時間；利用組件的屬性信息操縱大裝配樹，快速定位查找裝配體中某一組件以便在裝配的上下文中編輯組件，修改組件的設計；最後利用ug的介面函數和菜單定義工具二次開發實現了大裝配體在某一視圖中可見組件的自動選取，自動隱藏或關閉不可見組件，減少了內存中加載組件的數量，能在某一視圖中快速操縱大裝配。Digital search tree
數字查找樹Binary search tree
二叉查找樹The traditional methods on extracting content are representing the web page with the data structure of trees in the main memory. unfortunately, the space and time complexity is relatively high when building and searching the tree
傳統的方法是將網頁結構表示成樹，但建樹與查找樹的過程中，空間與時間復雜度都過高。The beginning of this article presented a scenario in which the use of standard xsl techniques for looking up data in distinct subtrees of an xml document used excessive amounts of compute time
本文的開頭演示了這樣一種方案：在xml文檔的各個獨立的子樹中使用標準xsl技術查找數據，會花費過多數量的計算時間。11 mouratidis k, papadias d, bakiras s, tao y. a threshold - based algorithm for continuous monitoring of k nearest neighbors. ieee trans. knowledge and data engineering, 2005, 17 : 1451 - 1464
鑒於此，本文研究了在存儲有歷史移動對象軌跡信息的類r樹r - tree - like結構譬如tb樹3維r樹等上有效地處理knn k1查找的問題。分享友人