樹排序 的英文怎麼說

中文拼音 [shùbèixù]
樹排序 英文
tree sorting
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 排 : 排構詞成分。
  • 排序 : collate
  1. Binary sort tree

    二叉排序樹
  2. 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匯編語言層次上對所有的演算法加以實現。
  3. This paper gives a survey on experimental forestland. 25 tree species were selected, and arranged in order by average diameter at breast height, average height, average individual volume and annual average volume increment in a unit area in this experiment

    摘要簡要介紹了試驗林地的概況，選擇了25個樹種進行試驗，並按各樹種林分平均胸徑、平均樹高、平均單株材積和平均單位面積蓄積的年平均生長量進行排序。
  4. Wheeler ' s team used dna sequencing and computer simulations to reconstruct the evolutionary tree of venomous fish ? all the way back to their common ancestor

    威勒的團隊使用dna排序和計算機模擬的方法重構了有毒魚類的遺傳樹，一直追溯到它們的共同祖先
  5. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  6. Grey correlation analysis is applied in the model identification of the fault diagnosis. in accordance with the importance degree of basis case, the possibility of fault model could be judged correctly in the fault tree analysis, which provides a scientific basis for fault handling in order of importance and urgency

    在故障診斷模式識別中，運用灰關聯分析，依據故障樹的底事件重要度，通過關聯度計算及排序，對故障樹分析中，各種故障模式發生的可能性大小作出了準確的判斷，從而為處理事故的先後、緩急提供了依據。
  7. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  8. By using the method of fault tree analysis, this paper analyses the causes of fire and explosion of catalying & cracking reactor and regeneration, draws the fault trees of fire and explosion accidents of catalyzing & cracking reactor and regeneration respectively, calculates the structure importance, makes the structure importance arrangement according to the structure importance and the least path set, puts forward the prevention measures, and provides the reliable theoretical basis for the safety control of enterprises

    摘要應用故障樹分析方法，對催化裂化反應器和催化裂化再生器發生火災（爆炸）事故的原因進行分析，分別畫出催化裂化反應器和催化裂化再生器發生火災（爆炸）事故的故障樹，得出最小徑集合，並計算其結構重要度，根據得出的最小徑集合及其結構重要度進行排序，提出預防措施，為企業的安全管理提供了可靠的理論依據。
  9. Binary tree sort

    二叉樹排序
  10. The ecological relationship of species, community and environment in elaeagnus mollis communities were studied by using twinspan and dca

    本文應用twinspan分類和dca排序相結合的方法，研究了翅果油樹群落的物種、植物群落與環境的生態關系。
  11. A red - black tree is a data structure and open technology that can be used for predefined priority - based sorting operations

    紅黑樹是可用於預定義基於優先級的排序操作的數據結構和開放技術。
  12. Based on research of theory and methods, this thesis presents design scheme of the dynamic fault tree analysis platform dfta and implement the platform ; practices a dynamic fault tree analysis example of boeing 707 plane engine oil indication system and alarm system on the platform and gets top event occurrence rate 、 minimal cut sequence 、 probability importance sequence 、 structure importance sequence and critical importance sequence and presents system improvement suggestion based on the analysis results

    在理論方法研究的基礎上，本文提出了動態故障樹分析平臺dfta的設計方案，並進行了實現;利用該軟體對波音707飛機發動機滑油壓力指示和警告系統進行了動態故障樹實例分析，得到了頂事件發生概率、最小順序割集、概率重要度排序、結構重要度排序、關鍵重要度排序等分析結果，並根據上述分析結果提出了系統設計改進建議。
  13. Gets or sets a value indicating whether the tree nodes in the tree view are sorted

    獲取或設置一個值，用以指示樹視圖中的樹節點是否經過排序。
  14. The main content is position matrix is set to record the location of wavelet coefficients, scanning the important wavelet coefficients first by using ordered quad - tree, and encoding the sign by using run length coding as well

    主要思想是：設立位置矩陣記錄子帶的位置信息，對高頻子帶內小波系數進行掃描排序形成有序四叉樹，對輸出的符號串採取行程編碼。
  15. This study uses classification tree to 1. choose important variables for delivery launder, 2. rank the importance of variables, and 3. classify three levels of quantity of launder and examine under what conditions of variables for high level consuming class of laundry by analyzing the multiple response tables to provide a reference of marketing stratagem

    本研究利用分類樹多變量統計探究技術做：一、篩選影響衣物外洗件數多寡之相關變數，二、排序各個變數的重要性，三、將外洗量之多寡分成三個等級，由分析多變反應交叉表，可以得到每一個等級是在那些變數的那些條件下發生的，以供作洗衣業者對未來行銷策略規劃參考之依據。
  16. The theory of minimum cut sets and its application in accident analysis are described with emphasis on putting forward the importance analysis of the weighted structure in sequence gradation of the bottom events of the fault tree

    闡述最小割集理論及其在事故分析中的作用，著重提出了對故障樹底部事件進行排序分級的加權結構重要度分析法。
  17. In this dissertation, the research trends for the problem have been introduced ; the ‘ dim ’ and ‘ point ’ has been strictly defined in mathematics from machine vision and human vision ; the ideal clutter suppression system based on clutter predication and the realization and evaluation of evaluation index has been studied, in succession the clutter suppression technologies have been researched. firstly, the classic nonparametric algorithm has been analyzed in detail and systematically, for it ’ s weakness that it cannot remove the non - stationary clutter ideally, kalman filter algorithm for clutter suppression in 2d image signal has been built. secondly, fast adaptive kalman filter is presented based on fast wide - sense stationary areas partition algorithm : limited combination and division algorithm based on quarti - tree algorithm, new taxis filter route algorithm which can break through the limitation of the necessity of pixel neighborhood of 2d filter and laplace data model with two parameters which is perfectly suitable for the residual image of kalman clutter suppression

    首先分析了經典的非參數法，對於四種具有代表性的核，從前述的三個性能評價方面做了分析和對比，指出了其速度快的優點和對非平穩圖像適應性差的弱點，針對非參數法的弱點，重點研究了對非平穩圖像適應良好的卡爾曼雜波抑制技術:建立了非平穩圖像的類自回歸模型，在此基礎上建立了二維卡爾曼濾波基礎的兩個方程:狀態方程和測量方程;建立了非平穩圖像準平穩區域快速劃分演算法:基於四叉樹法的有限分裂合併演算法;二維空間的基於k排序的濾波路線演算法，突破了空域濾波路線上區域相鄰的限制;在這些研究的基礎上實現了快速卡爾曼估計，實驗驗證了該方法相對逐點卡爾曼估計可以提高運算速度三倍左右;雜波抑制結果表明傳統的高斯性檢驗並不適合卡爾曼估計后的殘余圖像，由此建立了殘余圖像的雙參數拉普拉斯模型，實驗表明其可以完好的吻合殘余圖像的概率密度曲線。
  18. Ranking algorithm based on decision tree

    基於決策樹的排序學習演算法
  19. The construction algorithm embodies three parts that are suffix sorting, logest common prefix evaluation process and child suffix tree construction

    整個建立演算法包括三個部分:后綴排序，計算最短公共前綴和建立子后綴樹。
  20. The information is ordered in a tree hierarchy and the model can be explored with the usual tree model methods

    它們在樹狀層次結構中對信息進行排序，並且可以使用一般的樹狀模型方法來利用模型。
分享友人
分享到 Line

分享到臉書