data tree 中文意思是什麼

data tree 解釋
數據梭
  • data : n 1 資料，材料〈此詞系 datum 的復數。但 datum 罕用，一般即以 data 作為集合詞，在口語中往往用單數...
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  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. The thesis is based on income question, forest coverage rate and grop production. to beging with, date envelopment analysis is proved that it can be applicated into grain for green in shan - bei district, and then in view of the fact, seven esential factors which have influence on the project are found out : expense of dam, expense of crop, expense of cash tree, expense of defense tree, other economic crop, expense of grass and graziery ; and the output factors include : income of gdp, pure income per captia, the area of decreasing land loss, graziery income, crop production, income of tree, the totle income of economic crop. after the date of each facts are puted into dea model, unefficiencial decision making units ( dmu ) found. the data that are got through adjusting unefficiencial dmus dy dea can offer guide in shanbei district upgrading of an industrial structure. at the same time, taking into account some possible problems in or after grain for green in shan - bei district, the thesis bring out some propesal to improve the circ umstance, enhance the life level and put the relation of population, resource and circumstance into a healthy orbit

    因此，加快退耕還林還草，調整土地利用結構和產業結構，已成為實現山川秀美工程和可持續發展戰略的必經之路。論文以解決陜北地區的收入問題，植被問題以及糧食產量問題為出發點，首先從理論上分析了包絡分析方法在陜北地區退耕還林（草）中運用的可行性，然後結合陜北地區目前的實際情況，綜合分析出影響陜北地區退耕還林（草）的關鍵的七個因素作為輸入指標：水利水保設施投入，農作物投入，經濟林種支出，防護林支出，其它經濟作物，草類支出，畜牧業投入；以退耕還林所要解決的最終問題作為輸出指標： gdp收入、農民人均純收入、水土流失減少量、牧業總產值、糧食產量、林業總產值、其他經濟作物總產值。將各指標所對應的數據代入模型后，通過分析求解得出非有效的決策單元，再運用包絡分析方法的一些基本原理對非有效的決策單元進行調整，由此所得的數據對陜北地區的實際投入具有很好的指導意義。
  3. Then, the associated search optimal algorithm based on virtual avl tree is promoted to rapidly reconstruct the half - edge topological structure. 3. to rebuild the tooth surface from the littery measure data, the membrane deformation algorithm based on loop subdivision is given to fit density triangle meshes to subdivision surface

    前者巧妙、高效地完成了去除冗餘點的工作，將stl數據的存儲尺寸壓縮為原來的18 % 25 % ;後者完成了數據的半邊拓撲重建，使得后續對于邊界邊搜索、 1環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。
  4. Sometimes, it is not practical to statically predefine the tree structure due to data size or custom content that depends on user input

    有時，靜態地預定義樹結構並不可行，因為有時數據大小或自定義內容依用戶輸入而定。
  5. Collection. sometimes, it is not practical to statically predefine the tree structure due to data size or custom content that depends on user input

    有時，靜態地預定義樹結構並不可行，因為有時數據大小或自定義內容依用戶輸入而定。
  6. Very large data bases, brighton, england, 1987, pp. 507 - 518. 26 beckmann n, kriegel h - p, schneider r, seeger b. the r - tree : an efficient and robust access method for points and rectangles. in proc

    Iv在各種各樣的設置下利用合成的與真實的數據進行大量的實驗評估實驗結果表明本文提出的演算法在效率和擴展性上均大大勝過其它同類演算法。
  7. Management data, boston, usa, 1984, pp. 47 - 54. 3 beckmann n, kriegel h - p, schneider r, seeger b. the r - tree : an efficient and robust access method for points and rectangles. in proc

    對cdt索引來說，首先高維數據點通過k平均聚類演算法得到若干類，然後分別計算該點對應的始點與質心距離，並且將這兩個距離通過線性組合得到該點的復合索引鍵值。
  8. Also, paleoclimatologists can use data from tree rings, pollen analysis and the local geology to determine the temperatures and precipitation at the time

    此外，古氣候學者利用年輪、花粉分析、當地地質等資料，可以確定當時的氣溫與雨量。
  9. With the frequency division of wpd, etm uses shannon entropy as the criterion of determining whether or not dsi exist in certain wpd tree nodes and interference are suppressed successfully. lots of simulation data, lab data and on - site data have indicated that etm works with good efficiency, without pre - knowing of dsi information, extracts the phase of pd pulses accurately and can calibrate quantity of single type discharge

    大量的模擬數據、實驗室實測數據以及現場實測數據處理結果表明，小波包變換熵閾值法抑制干擾能力強，無需事先確定干擾的分佈，能夠準確檢測局部放電信號的相位信息，對于單一的放電類型，可以確定放電量的大小。
  10. 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演算法挖掘含負項目的頻繁項集演算法相比，無需對原始數據庫進行負項目的擴展，也不用再構造並銷毀額外的數據結構，只需在原始的頻繁模式樹上修改，在時間和空間的開銷上都具有一定的優勢。
  11. 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匯編語言層次上對所有的演算法加以實現。
  12. 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中間表示的轉換。
  13. 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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  14. 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樣條）曲面擬合、三叉樹等值線填充演算法和基於掃描線的復雜剖面填充演算法。
  15. 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

    在流場計算中，本文採用格心格式的有限體積法用二階中心差分對歐拉方程作空間離散，用四步龍格庫塔方法作顯式時間推進。
  16. In a hierarchical database hdbms, you begin with a strictly defined tree of data nodes

    在層次數據庫（ hdbms ）中，首先是從嚴格定義的數據節點樹開始的。
  17. [ definition : an internal tree representation of the values and state of all the instance data nodes associated with a particular form

    [定義：與特定表單相聯系的全部實例數據結點的值或狀態的內部樹型表示。
  18. It introduces the distinguishing method, first deals with the milling regions, and then generates the data tree for these regions by the accurate treatment

    第一次為粗判別，得到加工區域的初步信息；在此基礎上進行精確判別，生成加工區域的樹狀數據結構，獲得待加工區域。
  19. Secondly, in consideration of better integration of heterogeneous data resources and query optimizing, i adopt the " data tree " theory to construct a mathematical model of eihdr and solve the query in data resources by relational operation in mathematics. there are some differences in different data source ' s basic processing capability and i bring forward an eihdr ' s integration strategy based upon data tree to solve them

    其次，出於對數據源集成和查詢優化的考慮，本文採用「數據樹」理論對企業異構數據源集成建立數學模型，通過數學運算來處理涉及多個數據源的查詢問題，針對企業數據源存在「基本操作能力」的問題，本文提出了基於「數據樹」理論的企業異構數據源集成策略，實現了系統模型，並使查詢的效率得到提高。
  20. Secondly, when processing branching queries, compared with the join method, the amount of nodes that need to be traversed in the xml data tree here could be reduced to a great extent, what is more, it would not need to store intermediate results to obtain the final result, which makes it engrosses little memory

    第二、對于分支查詢的處理，相比于join的方法，所需遍歷的節點數量得到很大程度的降低，並且無須保存中間結果即可得到最終結果集，內存開銷極小，使得分支查詢的處理效率明顯提高。
分享友人
分享到 Line

分享到臉書