partition tree 中文意思是什麼
partition tree
解釋
劃分樹-
The basic ideas and principles of fmea which are applied to the analysis on the reliability of a steam turbine and its assistant systems are explained in detail. the structure tree of a steam turbine is built and the result of partition is given in this article
本文總結了汽輪機及其輔助系統設備劃分的基本原則，根據原則給出了汽輪機及其輔助系統設備劃分的通用結果，建立了汽輪機本體的設備樹。 -
The first part of this thesis describes the theory of rbf neural networks. the input space is thus divided into hyperrectangles organized into a regression tree ( binary tree ) by recursively partition the input space in two
第一部分從rbf網路出發，通過遞歸分割將輸入空間劃分為兩部分，從而將輸入空間變成一個用超矩形構成的回歸樹（二叉樹） 。 -
To the problem that finding rules in enormous data is very time - consumable and the expansibility of existed algorithms is not very good, the thesis proposes a new method to discompose large data table based on the concepts of positive region and the importance of attribute in rough set theory. existed algorithms of rule deduction can be applied directly on the tree structure obtained by partition and the times for computation will be reduced observably. validation of information entropy on the partition structure shows that the partition of data table will not lead to the loss of information, while the computing speed increases at the same time, which reflects the practicability and rationality about the partition of large data table
針對海量數據處理起來極為耗時，現有演算法拓展性較差的問題，基於rough集理論中的集合正域概念以及由此定義的屬性重要性概念，提出一種大型數據表分解演算法，現有的規則歸納演算法可直接在分解得到的樹型結構上應用，將大大降低知識發現的時間，並從信息理論的角度利用信息熵概念對該分解結構進行了驗證，分析了這種分解的實用性及合理性，揭示了這種分解結構在提高計算速度的同時不會損失信息量。 -
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排序的濾波路線演算法，突破了空域濾波路線上區域相鄰的限制;在這些研究的基礎上實現了快速卡爾曼估計，實驗驗證了該方法相對逐點卡爾曼估計可以提高運算速度三倍左右;雜波抑制結果表明傳統的高斯性檢驗並不適合卡爾曼估計后的殘余圖像，由此建立了殘余圖像的雙參數拉普拉斯模型，實驗表明其可以完好的吻合殘余圖像的概率密度曲線。 -
In the coding scheme, this paper uses the coding method based on quad - tree partition, which increases the speed and veracity of the coding and is useful for object recognition. there are various flags during the quad - tree partition coding. in order to get the best coding, this paper alteres the flags, which include maximum recursion depth, minimum recursion depth, domain pool type, scaling bits, offset bits, number of iterations
這些參數包括有最小最大深度、 domain集類型、比例系數、偏移系數、匹配域類型；在解碼過程中，有迭代次數、比例系數、偏移系數，針對要編碼的圖像，調節以上參數，得到一組最佳參數，這樣，利用最佳參數可以達到最好的編碼質量，從而提高識別的效果。 -
After studying various constraints, a constraint - based cluster using function partition based on angle dissimilarity, a partition sowntown means with least outspread tree method, and the quantity of customer ' s sale was forecasted by time - series analysis were presented. so, a series of cspr ( cluster sown town partition rule ) to manage lcc database was describe
為實現對滿足約束條件的聚類尋找適當的方法，作者在分析聚類約束條件的基礎上，提出運用基於角度相異度的函數劃分法處理地理位置的約束條件，用最小生成樹聚類分析方法生成滿足多項約束條件的聚類，用時間序列預測技術使客戶銷量約束條件趨于完善。 -
Tree partition problems with some fixed vertices
固定頂點的樹劃分問題 -
Points to the top of the clustered index b - tree in the specified partition
列指向指定分區內聚集索引b樹的頂端。 -
The server uses the index b - tree to find the data pages in the partition
服務器使用索引b樹查找分區中的數據頁。 -
When a heap or a clustered table has multiple partitions, each partition has a heap or b - tree structure that contains the group of rows for that specific partition
當堆或聚集表具有多個分區時，每個分區都有一個堆或b樹結構，其中包含該指定分區的行組。
分享友人