樹形數據結構 的英文怎麼說

中文拼音 [shùxíngshǔjùjiēgòu]
樹形數據結構 英文
tree-form data structure
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 據 : 據Ⅰ動詞1 （占據） occupy; seize 2 （憑借; 依靠） rely on; depend on Ⅱ介詞（按照; 依據） according...
  • 結 : 結動詞（長出果實或種子） bear （fruit）; form （seed）
  • 構 : Ⅰ動詞1 （構造; 組合） construct; form; compose 2 （結成） fabricate; make up 3 （建造; 架屋） bui...
  • 數據 : data; record; information
  • 結構 : 1 （各組成部分的搭配形式） structure; composition; construction; formation; constitution; fabric;...
  1. The techniques related terrain lod is systematically studied based on the quadtree data structure. combining the data block attemperation idea, we solved the data integrating and preculling problem, presented the boundary constraining solution, and calculated the collision detection for rambling

    本文在四叉樹結構的基礎上較為系統的研究了地形相關lod技術，結合數據分塊調度思想，解決了數據連接和預裁剪問題，給出了邊界約束問題的解法，並針對漫遊計算了特定的碰撞檢測。
  2. This thesis gives a brief account of the basic theories of software engineering and computer graphics, of the data structure of individual component modeling, of the design of the software structure and of the method of realizing software. meanwhile, this thesis put more emphasis on the exploration of the arithmetic of the delaunay triangle network, nurbs curve integration, the filling - in arithmetic of triple - tree, and the arithmetic based on the scan - line arithmetic and the filling - in of complex section

    文章介紹了關于軟體工程學與計算機圖形學的基本理論及其各組件模型的數據結構、軟體結構設計與軟體實現的技術方法，並重點討論了基於約束條件的delaunay三角網格化演算法、 nurbs （非均勻有理b樣條）曲面擬合、三叉樹等值線填充演算法和基於掃描線的復雜剖面填充演算法。
  3. 2. dynamically organizing cad graphics information taking the product structure tree as data structure, which links assembly information and geometry information ) the gathering agent can automatically converts assembled relationship into hyperlink relationship of vrml files, so the system could implement a strategy of integrated and visualized sharing approach based on the web - based visualized product structure tree. 3

    產品cad圖形信息的動態組織建立以產品結構樹為中心的數據組織結構，通過採集agent自動地將產品的裝配關系轉化為相關零部件vrml文件間的超鏈接關系，使系統能以「可視化結構樹」的形式進行有效地產品cad圖形信息發布。
  4. This thesis explains the necessity of the character recognition technology of the computer at first, describe the meaning in which the handwritten numeral discerns ; pretreatment technology of handwritten numeral recognition, including two value, line segmentation, word segmentation smooth, removing noising, standardization and thinning are discussed two value concretely discusses whole threshold value, some threshold value, dynamic threshold value and utilize space information to carry on threshold, which are several kinds of common method of choosing threshold value, especially utilize space information to carry on threshold value is describe in detail ; adopting to the foundation of thinning based on mathematics morphology, thinning algorithm of serials same and thinning algorithm of protecting shape are discussed ; afterwards, according to principle ' s diagram of the on - line character recognition, by analyzing the structure feature of the handwritten numeral, this thesis has proposed the online recognition te chnology of the free handwritten numeral based on the stroke feature and the online recognition technology of the free handwritten numeral based on the multistage classifying device. detail narrated noise removing, stroke characteristic definition and discernment, distance criterion of whole word match ; then under the foundation of handwritten numeral segmentation, off - line handwritten numeral recognition is researched. especially minimum distance classifying device, tree classifying device and adaptive resonance ( art ) network classifying device is discussed at the same time, believes degree analyses are introduced to integrate a lot of classifying devices ; at the end, the typical application of the handwritten numeral recognition was briefly narrated, its application in extensive data statistics, financial affairs, tax, finance and mail sorting have been explored

    二值化時對整體閾值二值化、局部閾值二值化、動態閾值二值化和利用空間信息進行閾值選取幾種常用的閾值選取方法進行討論，特別對利用空間信息進行閾值選取進行了詳細論述；在對通過對基於數學形態學的細化的基礎上，討論序貫同倫形態細化演算法和保形的快速形態細化演算法；然後依據聯機字元識別原理框圖，分析了手寫數字的結構特點，提出了基於筆劃特徵的任意手寫數字在線識別技術和基於多級分類器任意手寫數字在線識別技術，對其中涉及的筆劃識別前的噪聲處理、筆劃間特徵量的定義及識別、整字匹配的距離準則進行了詳細敘述；繼而在對手寫數字的分割的基礎下對脫機手寫數字識別進行了研究，對基於最小距離分類器字元識別、基於樹分類器的字元識別、基於自適應共振（ art ）網路的字元識別分別進行了詳細討論，並引入置信度分析將多個分類器進行了混合集成；最後簡單闡述了手寫數字識別的典型應用，對其在大規模數據統計、財務、稅務、金融及郵件分揀中的應用進行了探索。
  5. The famous algorithms include roam, vdpm, adaptive triangulation based quadtree and the improved algorithms of them, etc. however, the improvement of the present algorithms mainly focus on the selection of data structure which can speed up generation of the tmrm, few works were put into ameliorating the simplification criterion, hi fact, the simplification criterions used by the algorithms at present are constructed with only two elements which are the distance the vertex from the viewpoint and the roughness of terrain expressed by z coordinate

    地形多解析度模型的生成演算法種類較多，著名的有：自適應優化格網演算法（ roam ） 、基於視點的累進格網法（ vdpm ） ，基於四叉樹的自適應剖分演算法以及基於各演算法的各種改進演算法等等。但目前人們對演算法的更新及改進主要是從數據結構的角度來考慮，對簡化準則沒有做實質性的改進。
  6. 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

    為此，我們提出視點相關的順序點模型樹，將層次化的樹結構嵌入點的順序化線形序列中，並生成兩種索引以方便對點數據進行由近及遠和由粗至細的處理。
  7. Abstract : biological invasions are a continuous feature of a non - equilibrium world, ever more so as a result of accidental and deliberate introductions by mankind. while many of these introductions are apparently harmless, others have significant consequences for organisms native to the invaded range, and entire communities may be affected. here we provide a survey of common models of range expansion, and outline the consequences these models have for patterns in genetic diversity and population structure. we describe how patterns of genetic diversity at a range of markers can be used to infer invasion routes, and to reveal the roles of selection and drift in shaping population genetic patterns that accompany range expansion. we summarise a growing range of population genetic techniques that allow large changes in population size ( bottlenecks and population expansions ) to be inferred over a range of timescales. finally, we illustrate some of the approaches described using data for a suite of invasions by oak gallwasps ( hymenoptera, cynipidae, cynipini ) in europe. we show that over timescales ranging from 500 10000 years, allele frequency data for polymorphic allozymes reveal ( a ) a consistent loss of genetic diversity along invasion routes, confirming the role of glacial refugia as centres of genetic diversity over these timescales, and ( b ) that populations in the invaded range are more subdivided genetically than those in the native range of each species. this spatial variation in population structure may be the result of variation in the patchiness of resources exploited by gallwasps, particularly host oak plants

    文摘:生物入侵是不均衡世界的一個永恆話題，尤其是當人類有意或無意地引入物種后.很多引入顯然是無害的，但另外一些則有著嚴重的後果，會給入侵地的生物以至於整個生物群落造成影響.本文總結了分佈區擴張的常見模式，概述了它們對遺傳多樣性和種群結構式樣所造成的影響.描述了如何根據以一批遺傳標記所得到的遺傳多樣性式樣來推斷入侵途徑，來揭示伴隨擴張選擇和漂變在形成種群遺傳樣式中的作用.本文對日益增多的群體遺傳學方法進行了總結，這些技術可以用來在不同的時間尺度上推斷種群規模所發生的巨大變化（瓶頸效應及種群擴張） .最後，我們以歐洲櫟癭蜂（膜翅目，癭蜂科，癭蜂族）一系列入侵的數據為例對一些方法進行了說明.從500 10000年的時間尺度上，多態的等位酶位點上等位基因頻率的數據表明: 1 ）遺傳多樣性沿入侵路線呈不斷下降的趨勢，支持了冰河期避難所作為遺傳多樣性中心的作用; 2 ）入侵地區的種群與該物種原產地的種群相比，遺傳上的分化更為強烈.這種種群結構在空間上的變異可能是被櫟癭蜂開發的資源尤其是櫟樹寄主在斑塊上出現變異的反映
  8. 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 ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。
  9. This idea is not just exciting but practically attainable. this paper first provides an overview of our optimization strategy, andthen focuses on the key implementation issues of our rule - basedtransformation system for xml query optimization in a databaseenvironment

    Xml的樹形結構數據模型與關系模型相比本質上具有更高的復雜性，這使得xml的查詢優化空間比關系模型要大許多，從而給xml的查詢優化帶來了困難。
  10. The system manage design process of a product with project mode, and can establish and manage function - means tree, product tree and design matrixes to store structurized design data

    系統以工程形式來管理一個產品的設計過程，能夠創建和管理功能方法樹、產品結構樹，建立設計矩陣，結構化存儲設計數據。
  11. Based on tree data structure, the cartesian grids about 2 - d and 3 - d configurations are generated using the surface - cutting procedure. in the course of grid generation, a two - step ray - casting algorithm to excluded cells inside the body and a cell - merging technique to avoid numerical instability are fully developed. after creating these surrounding grids, the cell - cutting algorithm is designed to perform geometry - based refinement of grids, and greatly improve the applicability and quality of grid generation

    採用物面切割，基於叉樹數據結構，發展了一種普遍適用於二維和三維外形的直角切割網格生成方法；構造兩步射線求交演算法，刪除外形內的固體網格，以及小網格合併演算法，確保網格質量和流場計算的穩定性；運用對任意網格的切割細分演算法，實現了針對幾何外形的自適應網格加密，使得網格生成更具普適性和靈活性。
  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. Essentially, builders allow you to easily represent nested tree - like data structures, such as xml documents, in groovy

    實際上，生成器允許您很方便地在groovy中表示樹形數據結構，例如xml文檔。
  14. The contribution of this dissertation : an image retrieval approach based on dct compressed domain is proposed. first, reorder dct coefficients using multiresolution wavelet transform, then build subband energy histograms formed from reordered dct coefficients of database images, build indices of images by using morton order and order database for indexing by using variant b - tree data structure

    本論文的貢獻：提出了一種將jpeg圖象的dct系數按照多解析度小波變換的形式進行重組，得到若干子帶並建立子帶能量直方圖作為特徵，在按照morton的順序建立索引，並對索引採用變形b樹數據結構組織，進行檢索的方法。
  15. It realized data compress storage by octree data structure and reached the perfect integrating of map and data by uniting mis and gis

    它利用八叉樹數據結構實現了數據的壓縮存儲；結合了傳統的mis技術和gis技術，實現了圖形和數據的有機結合。
  16. The quad - tree automatic simplification technique is used for that terrain in different " pyramid " levels takes on different resolution, and terrain in the same level has multi - resolution. in order to solve geometry - gaps, the author studies and compares two ways : pattern of restricted quad - tree and mark points and pattern of changing connectivity of vertices for higher resolution

    考慮vrml特點，採用「金字塔」數據結構組織地形數據，通過基於四叉樹的地形數據簡化演算法對地形數據進行簡化，使「金字塔」的不同的層次間具有不同的解析度，同一層次間也具有不同的解析度。
  17. 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

    該演算法使用單線性鏈表數據結構，與其它使用雙鏈表或樹結構的演算法相比具有佔用空間少及處理速度快的特點；其次，找出並論證兩個多邊形之間進、出點之間的關系，並通過合理的數據結構處理，減少了演算法對多邊形鏈表的遍歷次數，而且允許多邊形既可以按順時針方向也可以按逆時針方向輸入。
  18. For example, arrays can support dictionary look - up and form the basis for sophisticated kinds of data structures, such as key - value pairs, linked lists, doubly - linked lists, and trees

    例如，數組可以支持字典查詢，並為高級類型的數據結構，例如鍵-值對、鏈接表、雙鏈表和樹形成基礎。
  19. In data structures, the node at the end of a path in a tree structure

    數據結構中，在樹形結構的一條通路末端處的結點。
  20. However, the second technology has the following disadvantages : first, data paging and tmrm generating are integrated into one modulate, next, data structures they used are very complicated and large, in addition, the work of data preprocessing is very heavy and frequently data paging need the server with high performance, at last this paging method is very difficult for implementation. as for the first technology, an important advantage of it is that the data paging and tmrm generating are not interdependent, so it will be more e asily applied in practice than the second one. as an implementation of the first technology, lindstrom introduced a method which uses quadtree and triangle binary tree to organize terrain data and adopt multithread mechanism to realize the data process

    而第一種流式處理技術盡管一次調入的數據量稍大，但其數據調度與多解析度模型的生成在功能上是相互獨立的，如果處理得當更容易在實際工程中得到成功的應用，對於它的實現， lindstrom提出了利用四叉樹及三角形二叉樹進行地形數據組織並利用多線程機制進行數據調度與簡化的流式處理方法，但該方法的缺點是：其數據結構依賴于地形的物理分割，因此數據結構龐大；多解析度模型生成的計算量也依賴於物理分割的粒度，即物理分割粒度較粗時，數據范圍增大，計算量會急劇增加；該方法不能實現模型的增量生成。
分享友人
分享到 Line

分享到臉書