tree (data structure) 中文意思是什麼

tree (data structure) 解釋
樹 （數據結構）
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • data : n 1 資料，材料〈此詞系 datum 的復數。但 datum 罕用，一般即以 data 作為集合詞，在口語中往往用單數...
  • structure : n. 1. 構造，結構；組織；石理，石紋。2. 建造物。3. 【化學】化學結構。4. 【心理學】（直接經驗中顯現的）結構性，整體性；整體結構。adj. -d ,-less adj.
  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. According to the program structure of ansi c, some syntax - tree - nodes are designed in front - end, including function, block, data structure, type, expression, identifier and so on. syntax tree is divided into three levels, namely program level, function level and block level, which are useful for analysis of syntax and semantic in compiler as well as transferring syntax tree into rtl. retargetable compiler mainly includes intermediate representation, machine description and interface technique between compiler and machine description

    編譯前端的實現技術包括詞法分析、語法語義分析和中間代碼生成技術等，針對ansic的程序結構，分別設計了函數、塊、數據結構、類型、表達式、標識符等語法樹結點，並將語法樹分成編譯層次、函數聲明和塊三個不同層次，使語法樹具有清晰的層次結構，有利於編譯程序的語法和語義分析，以及從語法樹到rtl中間表示的轉換。
  3. 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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  4. 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樣條）曲面擬合、三叉樹等值線填充演算法和基於掃描線的復雜剖面填充演算法。
  5. Compared with octree data structure, the omni - tree data structure could reduce the meshes " total numbers and get better mesh quality. this paper uses cell - centered finite volume spatial discretization and four - stage runge - kutta time - stepping scheme with some convergence acceleration techniques such as local time stepping and enthalpy damping

    在流場計算中，本文採用格心格式的有限體積法用二階中心差分對歐拉方程作空間離散，用四步龍格庫塔方法作顯式時間推進。
  6. 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圖形信息發布。
  7. Many test cases are calculated to verify the above study. the cases are either real or standard testing models, including multi - element airfoil, wing - body configuration, cone / cylinder missile model and 3 - d high - lift systems, etc. the results of present calculation are in good agreement with experiment data, and show flexibility and accuracy of the approaches. base on the cartesian grids, this thesis has targeted the development and integration of many algorithms and techniques such as adaptive refinement, omni - tree data structure, hybrid grid method, etc. an analysis software and research methods are designed and developed for the steady - unsteady and viscous - inviscid flow complex systems and configuration

    7 .運用上述研究成果和結論，進行了大量算例的實驗驗證，外形范圍包括多種標模與型號，涉及多段翼型、 m6機翼、細長體模型、翼身組合體、兩段機翼增升標模、帶縫翼和襟翼的三段增升翼身組合體等復雜外形，計算結果均與實驗吻合良好，充分說明了本文發展的各種演算法、流場求解、網格生成方法的正確性和魯棒性。
  8. 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

    利用叉樹數據結構，實現並加速了網格生成中數據的搜索和查找；發展並提出了全叉樹和各向異性，使得網格的自適應加密可以根據需要在多個方向上任意的選擇；構造點、線、面和網格的四級數據管理模式，改善和方便了數據的有效組織和管理。
  9. The in - memory data structure had a sort of tree structure, as shown in listing 1, rooted at the home pages of the various sites being crawled, so the visitor pattern was ideal for searching it or extracting data from it

    內存中的數據結構是一種樹型結構，如清單1所示，它的根是快速搜索過的各個網站的主頁，因此visitor模式是搜索這些主頁或者從中提取數據的理想模式。
  10. Methods for inducing decision tree in distributed database system are described and a distributed algorithm based on id3 is proposed. using a new data structure called attributes distribution list this algorithm can be scalable and parallelized

    該演算法在傳統的id3演算法的基礎上引進了新的數據結構：屬性按類別分佈表，使得演算法具有可伸縮性和并行性。
  11. A red - black tree is a data structure and open technology that can be used for predefined priority - based sorting operations

    紅黑樹是可用於預定義基於優先級的排序操作的數據結構和開放技術。
  12. 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

    傳統的方法是將網頁結構表示成樹，但建樹與查找樹的過程中，空間與時間復雜度都過高。
  13. In modern aircraft design, there is an urgent requirement for accurate, efficient and easy - to - use numerical analysis tools. for this purpose, this thesis introduces recent progress in the generation and application of cartesian grid with tree data structure and adaptive refinement. coupled with hybrid grid techniques, euler and navier - stokes equations are solved

    本文針對現代飛行器設計中對實用、高效、準確的氣動力分析工具的迫切需求，基於叉樹數據結構，發展了一種自適應直角切割網格方法，採用混合網格技術，實現了對流場euler和navier - stokes方程的計算求解，進一步完成了復雜增升裝置繞流和外掛物分離投放非定常流場的數值模擬。
  14. 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

    採用物面切割，基於叉樹數據結構，發展了一種普遍適用於二維和三維外形的直角切割網格生成方法；構造兩步射線求交演算法，刪除外形內的固體網格，以及小網格合併演算法，確保網格質量和流場計算的穩定性；運用對任意網格的切割細分演算法，實現了針對幾何外形的自適應網格加密，使得網格生成更具普適性和靈活性。
  15. 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 + +模擬計算軟體中的結構數組的概念形成了「虛擬源樹」的射線跟蹤模型。
  16. A novel coding algorithm was presented for still ima ge using biorthogonal wavelet transform. combined with the visibility preaccentua tion before the quantization a new data structure named extended q _ tree was pro posed to organize wavelet transformation coefficients. experimental results show that the new algorithm is very practical and with good performance

    研究了一種基於雙正交小波變換的靜止圖象編碼演算法.結合帶視覺加權的標量量化技術，提出了一種新的數據結構? ?擴展四叉樹，從而實現了一種性能較好、復雜度較低的靜止圖象編碼方案
  17. 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 。
  18. The approach is based on a succinct binary tree data structure, and a system, named atc approach to top - k composite services retrieval system is implemented

    因此，深入和系統地研究web服務技術，已經成為分散式計算領域web技術領域和電子商務研究領域的熱點。
  19. 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樹數據結構組織，進行檢索的方法。
  20. The spatial data index betakes the spatial data structure based on the improved r - tree structure, and the property index uses the b + tree data structure

    空間數據索引採用基於改進r - tree的空間數據索引結構，屬性數據索引採用b ~ +樹數據結構。
分享友人
分享到 Line

分享到臉書