tree structures 中文意思是什麼

tree structures 解釋
樹狀結構表
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • structures : 構築物
  1. Motivated by this observation, this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories. two algorithms are developed based on best - first traversal paradigm, called bfp k nn and bft k nn, which handle the k nn retrieval with respect to the static query point and the moving query trajectory, respectively. both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result

    例如，若已知動物的軌跡，則動物學家可能提出如下兩種查詢： i在時間區間ti ， tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti ， tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。
  2. In the proposed join algorithms, although some algorithms such as mpmgin algorithm [ 23 ], outperform standard rdbms join algorithms, they perform a lot of unnecessary computation and i / o for matching basic structural relationships, especially in the case of parent - child relationships ; other algorithms such as the stack - tree - desc algorithm [ 24 ], represent the state - of - the - art in structural joins, however, they do not utilize indexed structures but sequentially scan the input lists. thus, i / o ' s can be wasted for scanning element that do not participate in the join, and join speed can be influenced

    另外，在所提出的演算法中，盡管有的演算法，如mpmgjn演算法[ 23 ]優于標準的rdbms連接演算法，但是該演算法為匹配基本的結構關系，特別是在父子關系情況下，執行了大量不必要的計算和佔用了大量的i / o資源；有的演算法雖然代表了結構連接演算法的先進水平，如stack - tree - desc [ 24 ]連接演算法，但是它沒有利用索引結構而是順序瀏覽輸入列表。
  3. The analysis and comparison of the storage structures for trinary tree

    三叉樹存儲結構分析比較
  4. In addition, comparing to direct using fp _ growth algorithms, this algorithm has no need to expand negative item to original database, and construc or destruct additional data structures, which only make some changes on the original frequent pattern tree, so it has certain advantages in time and space costs

    除此之外，該演算法與直接使用fp _ growth演算法挖掘含負項目的頻繁項集演算法相比，無需對原始數據庫進行負項目的擴展，也不用再構造並銷毀額外的數據結構，只需在原始的頻繁模式樹上修改，在時間和空間的開銷上都具有一定的優勢。
  5. Three amendments are made to neighbor - joining method : first, a more precise evolution model is used to calculate the distance between sequences ; second, sequences are used to generate multiple typological structures, and hence compensate the shortcoming of neighbor - joining method, which can generate only one typological structure ; third, back mechanism is introduces to avoid the negative branch length in distance method and get a more accurate tree

    本文對距離法中的鄰接法進行了三點改進: 1 .使用更精確的進化模型來度量序列之間的距離，降低因模型而帶來的誤差; 2 .通過隊列產生多個拓撲結構，解決了鄰接法只能產生一個拓撲結構的缺陷; 3 .引入回退機制，消除了距離法中負枝長的產生，得到的樹更準確。
  6. Figures 3 and 4 show the code generation tree structures built from the

    中的綁定構建的代碼生成樹結構。
  7. Searching in high - dimensional spaces : index structures for improving the performance of multimedia databases. acm computing surveys, 2001, 33 : 322 - 373. 2 guttman a. r - tree : a dynamic index structure for spatial searching

    本文試圖將高維空間中的每個點對應的兩種距離尺度通過線性組合的方式表達成復合距離尺度，從而能夠較好地縮小查詢空間，提高查詢效率。
  8. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. by the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine

    為此，我們提出視點相關的順序點模型樹，將層次化的樹結構嵌入點的順序化線形序列中，並生成兩種索引以方便對點數據進行由近及遠和由粗至細的處理。
  9. Moreover, scheme comes with a rich library of list and tree manipulation functions, and a history of contemplating manipulation of those very structures

    另外， scheme還擁有豐富的列表和樹處理函數庫，以及專注于處理這些結構的歷史。
  10. According to the complexity of pattern, the mined characteristic patterns could be sorted as frequent item, frequent sequence and frequent sub tree, etc. the paper builds tree - model of rna molecules and utilizes frequent sub tree mining algorithm to mine common topological patterns among rna secondary structures

    根據特徵模式復雜性，可分為頻繁項模式、頻繁序列模式以及頻繁子樹模式等。本文對rna分子建立樹形模型，利用頻繁子樹挖掘演算法挖掘rna二級結構中的公共拓撲模式。
  11. Reference counting is simple, lends itself well to incremental collection, and the collection process tends to have good locality of reference, but it is rarely used in production garbage collectors for a number of reasons, such as its inability to reclaim unreachable cyclic structures objects that reference each other directly or indirectly, like a circularly linked list or a tree that contains back - pointers to the parent node

    引用計數很簡單，很適用於增量收集，收集過程一般會得到好的引用區域性，但是出於幾個理由，它很少在生產垃圾收集器中使用，如它不能回收不可到達的循環結構（彼此直接或者間接引用的幾個對象，如循環鏈接的列表或者包含指向父節點的反向指針的樹） 。
  12. The text brings forward many rapid calculations according to physical truth. in the algorithm routine, using the multi - way tree of the data structure, using the concept the software visual c + + ’ s array of structures to form dummy source tree

    在演算法程序的編制上，採用了數據結構中多叉樹的思想，利用visualc + +模擬計算軟體中的結構數組的概念形成了「虛擬源樹」的射線跟蹤模型。
  13. 42 wang h x, meng x f. on the sequencing of tree structures for xml indexing. icde 2005, tokyo, japan, pp. 372 - 383

    在xml管理方面我們研製了orientx系統，研究的xml數據的直接存儲模式管理索引管理和查詢引擎等諸方面都有獨到之處。
  14. Essentially, builders allow you to easily represent nested tree - like data structures, such as xml documents, in groovy

    實際上，生成器允許您很方便地在groovy中表示樹形數據結構，例如xml文檔。
  15. Give the tree structures for the following sentences - include ips and cps

    畫出下列句子的樹形圖，包括含字尾變化的片語（ ip ）和補語片語（ cp ） 。
  16. Three - dimensional topological description of vessel structures based on tree model

    基於樹形模型的血管三維拓撲結構描述
  17. Lines within your tree can provide a greater visual effect and make larger tree structures easier to read

    在樹形視圖中的線條可提供較好的可視效果，且使得大的樹形結構易讀。
  18. 4 this thesis analyses the classification, the data - source storing method of different kinds of tree structures in the product - oriented capp system, and studies the pattern of the constructing trees. puts forward various kinds of function operations of tree structures

    研究面向產品capp系統中各種樹結構的分類、樹結構數據來源的存儲方式及樹的構建範式；研究樹節點各種功能操作的共性點。
  19. It adopts xml documents to manage the database of the components, for their metadata structures are tree - structures. it makes it possible to manipulate the database such as insert, delete, update and query

    由於它們的元數據結構是樹狀結構，本論文採用xml文檔來管理組件的數據庫，並提供對該數據庫完成增加、刪除、修改、查詢記錄等傳統的數據庫操作的功能。
  20. Tree structures, file addressing

    檔案尋址型樹狀結構
分享友人
分享到 Line

分享到臉書