partition algorithm 中文意思是什麼
partition algorithm
解釋
分塊演算法-
To solve the problem of rule learning time cost for traditional transformation based part of speech tagging method of latin mongolian, a dynamic partition algorithm was presented
針對傳統基於轉換的詞性標注方法中規則學習速度過慢的問題提出了一種對訓練語料庫進行動態劃分的演算法。 -
A new edge detection algorithm based on fuzzy partition
一種基於模糊劃分的邊緣檢測演算法 -
Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms
實驗表明，該優化劃分方法相對于傳統的圖劃分演算法能夠有效地提高模擬性能。 -
We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept, we proposed an effective algorithm
對從廣義開關網路中提取出兩點間連接矩陣的方法進行了研究，利用tarjan的拓撲圖塊劃分演算法、開關網路中的不可分二端圖概念等設計了較有效的演算法。 -
One of the main problems in pdes is how to partition the network simulation workload to decrease the time needed to complete the simulation and improve performance of simulation. here a new optimized partition algorithm was put forward, which first analyses the performance factors of parallel simulation and then constructs a performance estimation model for partition ; based on this model, it mends the graph partition algorithm to consider all factors, including simulation applications and simulation environments. optimized factors are workload balance 、 communication cost and time window of lookhead
鑒于基於傳統圖劃分演算法的任務劃分工具存在諸多不足，本文提出了并行網路模擬任務的優化劃分方法，其思想是:首先從pdes機制出發，分析影響并行網路模擬性能的各種因素並建立一個能夠綜合考慮各種因素的并行網路模擬性能估計模型;其次，改進多級圖劃分演算法，使得演算法具有綜合考慮模擬應用與模擬運行環境，同時在優化過程中使用性能估計模型指導劃分，實現對影響并行網路模擬性能的三個因素（包括負載均衡、通信開銷、安全時間窗口長度）的優化能力;最後，結合併行網路模擬性能估計模型與改進的多極圖劃分演算法，實現了并行網路模擬任務的優化劃分。 -
The basis is hierarchical placement based on the model of directed graph partition. introducing timing - driven placement to clustering, it is an excellent method that mixes the characteristics of timing - driven placement, clustering and directed graph partition. integrated with cdp, this algorithm can solve the system - level vfg problems of electronic devices
該演算法是基於有向圖分解模型的分級布局演算法，將定時驅動布局思想引入結群過程，是集定時驅動布局、基於結群的布局、基於劃分的布局和有向圖分解思想為一體的快速布局演算法。 -
It introduces the definition of texture direction. then, it proposes a sorting and partition algorithm of images with directional texture
給出了紋理方向的定義和一個具有方向性紋理圖像分類和分割演算法。 -
And got a novel cvq algorithm. because the data of cvq has been split by the algorithm already, it is the right occasion of of parallel program with domain partition. so we implement the parallel algorithm of this algorithm
然後我們又研究了分類矢量量化器，得到一個高效的分類量化器，並使用并行演算法加快了其處理速度，並討論了負載平衡的問題。 -
The paper puts forward the clustering algorithm includes : clustering based on grid and iterative, enhanced clustering algorithm base on density and k - medoids, enhanced k - means algorithm ( optimize chooseing consult _ points in iterative process ), enhanced clustering algorithm base on distance. they can overcome many limitations ( some traditional algorithms terminate in local optimization. many results of cluster are roundness, too many times in partition iterative process ), which are related to the static architecture of traditional model
在傳統聚類演算法的基礎上，結合我們科學數據挖掘的應用對象?分子動力學數據，提出了迭代網格聚類演算法， k -平均和基於密度結合的聚類演算法，迭代過程中優化選擇中心點的k -平均方法，以及改進型的基於距離的聚類演算法等模式識別方法，能夠解決傳統演算法帶來的諸多問題（比如一些傳統的聚類演算法常常收斂于局部最優，發現都模式都趨近於球形，劃分方法中迭代次數過多帶來的效率問題） 。 -
Some other techniques were also introduced including a reasonable space partition scheme to accelerate the algorithm, a proper selection criterion to select candidate points, and an additive topological operation to assure the correctness of topology
第1階段生長點分佈均勻並且密度相對較高的區域，剩下的部分在第2階段生長；還提出了一種空間劃分方法和選擇新點生成三角形的方法，並採用了附加三角形提高拓撲操作的可靠性。 -
Partition algorithm for key - machine dispatch in job - shop
單件車間關鍵工序調度問題的定界演算法 -
This dissertation mainly deals with the surface reconstruction on the basis of the numeric tooth surface of the spiral bevel gear. the first step of surface reconstruction is designing the algorithm to partition the grids and transforming the origin data to the matrix style face by face
螺旋錐齒輪齒面形狀復雜，一般採用數值模擬的方法進行設計，為了使得到的數值齒面能被通用cad cae軟體採用，需要把離散點連續化，重構出輪齒表面。 -
Based on range - partition, this paper proposes an efficient asymptotical algorithm of load balance to insure the storage balance in any time, and demonstrates its validity through theory analysis
摘要基於范圍分割提出了一個有效的、漸近的負載平衡演算法，可確保在任意時間的存儲平衡，理論分析證明了該方法的有效性。 -
The paper can be divided into two partitions : in the first part the p / g network verification problem in the vlsi chip scope is probed. an algorithm is proposed which partition the global network into several sub networks. then it performs sub network compressing equivalent transform and calculates the final size - reduced linear equations
本論文包括兩個部分，第一部分探討了vlsi晶元p g網驗證問題，提出基於網路劃分、子網等效壓縮變換的大規模線性方程組求解方法；第二部分探討了一個晶體管級宏單元自動版圖布線系統的有關理論問題，並實現了一個實用的處理宏單元版圖的自動布線系統。 -
Since the problem of load balance can not be solved effecfivety by the parallel algorithm for mining association rules, on the basis of cd algorithm, this paper presents a parallel algorithm for mining association rules based on dynamic dataset partition
摘要針對并行關聯規則挖掘演算法不能有效的解決負載平衡的問題，在cd演算法的基礎上，介紹了一種基於動態數據集劃分的并行關聯規則挖掘演算法。 -
It firstly utilizes the characteristic of layout geometric information to partition the global network into some sub networks. after these sub networks are compressed by cholesky factorization, the sub networks edge nodes are combined with other nodes. calculating the final linear equations group, the algorithm can be very effective
演算法首先利用版圖幾何特徵，按最小割原理將電源地網劃分成子網，利用對稱正定矩陣cholesky分解壓縮子網內點；將子網等效成與網路其它部分連接的結點集的等效網路，最後通過計算壓縮后的網路，獲得線性方程組求解答案。 -
In chapter 2, on the basis of reference to classical static priority scheduling theory for hard real - time systems, we proposed a delay computation method with partition algorithm
第二章在借鑒強實時系統靜態優先級調度理論的基礎上，提出一種通過引入分區演算法來計算atm交換延遲的方法。 -
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排序的濾波路線演算法，突破了空域濾波路線上區域相鄰的限制;在這些研究的基礎上實現了快速卡爾曼估計，實驗驗證了該方法相對逐點卡爾曼估計可以提高運算速度三倍左右;雜波抑制結果表明傳統的高斯性檢驗並不適合卡爾曼估計后的殘余圖像，由此建立了殘余圖像的雙參數拉普拉斯模型，實驗表明其可以完好的吻合殘余圖像的概率密度曲線。 -
A better partition algorithm is a key to parallel simulation
其中，一個優化的劃分演算法是實現并行模擬的關鍵。 -
With the booming of the requirement of network management, network intrusion detection arid qos, a new fast scalable multi - dimension packet classification algorithms, based on pcbnp, rfc and regional partition algorithm, is given in this paper
該演算法通過壓縮、分割和索引操作，設計了壓縮分割規則表和索引列表結構表這兩類數據存儲結構，能支持上萬條多維分類規則，分類速度快、存儲空間小、支持快速更新。
分享友人