partition algorithm造句
例句與造句
- By analysis the instance of complete - point and bi - partition point , the thesis presents two merge rules to improve the partition algorithm given by c . j . tseng . the experiments show the pedition results improved notably by using the revised algorithm
文中通過分析完全點和二分點的情況，提出了兩個合并準則，對于c . j . tseng提出的、目前使用廣泛的基團剖分算法進行了改進。 - 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
該算法通過壓縮、分割和索引操作，設(shè)計了壓縮分割規(guī)則表和索引列表結(jié)構(gòu)表這兩類數(shù)據(jù)存儲結(jié)構(gòu)，能支持上萬條多維分類規(guī)則，分類速度快、存儲空間小、支持快速更新。 - 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
鑒于基于傳統(tǒng)圖劃分算法的任務(wù)劃分工具存在諸多不足,本文提出了并行網(wǎng)絡(luò)模擬任務(wù)的優(yōu)化劃分方法,其思想是:首先從pdes機制出發(fā),分析影響并行網(wǎng)絡(luò)模擬性能的各種因素并建立一個能夠綜合考慮各種因素的并行網(wǎng)絡(luò)模擬性能估計模型;其次,改進多級圖劃分算法,使得算法具有綜合考慮模擬應(yīng)用與模擬運行環(huán)境,同時在優(yōu)化過程中使用性能估計模型指導(dǎo)劃分,實現(xiàn)對影響并行網(wǎng)絡(luò)模擬性能的三個因素(包括負載均衡、通信開銷、安全時間窗口長度)的優(yōu)化能力;最后,結(jié)合并行網(wǎng)絡(luò)模擬性能估計模型與改進的多極圖劃分算法,實現(xiàn)了并行網(wǎng)絡(luò)模擬任務(wù)的優(yōu)化劃分。 - 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
首先分析了經(jīng)典的非參數(shù)法,對于四種具有代表性的核,從前述的三個性能評價方面做了分析和對比,指出了其速度快的優(yōu)點和對非平穩(wěn)圖像適應(yīng)性差的弱點,針對非參數(shù)法的弱點,重點研究了對非平穩(wěn)圖像適應(yīng)良好的卡爾曼雜波抑制技術(shù):建立了非平穩(wěn)圖像的類自回歸模型,在此基礎(chǔ)上建立了二維卡爾曼濾波基礎(chǔ)的兩個方程:狀態(tài)方程和測量方程;建立了非平穩(wěn)圖像準平穩(wěn)區(qū)域快速劃分算法:基于四叉樹法的有限分裂合并算法;二維空間的基于k排序的濾波路線算法,突破了空域濾波路線上區(qū)域相鄰的限制;在這些研究的基礎(chǔ)上實現(xiàn)了快速卡爾曼估計,實驗驗證了該方法相對逐點卡爾曼估計可以提高運算速度三倍左右;雜波抑制結(jié)果表明傳統(tǒng)的高斯性檢驗并不適合卡爾曼估計后的殘余圖像,由此建立了殘余圖像的雙參數(shù)拉普拉斯模型,實驗表明其可以完好的吻合殘余圖像的概率密度曲線。 - The training method is very important to hmm based approaches , a new model training method based on genetic algorithm is also discussed at the end . and in chapter 5 , a fuzzy rule based recognition method is proposed . it is heavily rely on a new feature space partition algorithm , in which a modified fuzzy clustering method is used
首先，研究了一種基于模糊聚類的特征空間劃分方法以及一種隸屬度函數(shù)的優(yōu)化算法；然后討論了一種新的模糊規(guī)則提取算法，用于提取合理的分類規(guī)則；為了有效地構(gòu)造基于模糊規(guī)則的分類器，引入了一種網(wǎng)絡(luò)模型，使用該網(wǎng)絡(luò)可以有效地實現(xiàn)一個模糊規(guī)則系統(tǒng)；在此基礎(chǔ)上，構(gòu)造了具有實用價值的識別系統(tǒng)。 - It's difficult to find partition algorithm in a sentence. 用partition algorithm造句挺難的
- The method is also tested by finite volume scheme and partitioning algorithm of euler equation in parallel computing in fluid dynamics . the testing results demonstrate that the suggested method in this method is of practical and scientific significance in parallel computing in fluid dynamics
本文還結(jié)合euler方程的有限體積格式和區(qū)域分解算法對文中的算法在流體力學并行計算中進行了進一步的驗證，從數(shù)值計算結(jié)果可以看出，本文提出的算法能夠很好地應(yīng)用于計算流體力學并行計算，具有一定的科學應(yīng)用價值。 - It is efficient when applied in the control intensive design but the quality of synthesis " results is not well accepted when used for other type of design . the other is a multi - target hls optimization method , used before the subtask of hls scheduling . the essence of the method is a system partition algorithm , the multi - target optimization is reflected when convert the behavioral description into a graph . the purpose of the partition is to find the explicit control relation and parallel computation
其二是提出了一種多目標的高級綜合優(yōu)化策略，該方法用在高級綜合的調(diào)度之前，其核心是對系統(tǒng)進行劃分，在將行為描述轉(zhuǎn)化為內(nèi)部表示模型的時，通過探索中間表示結(jié)果的關(guān)系來發(fā)現(xiàn)原設(shè)計描述中的控制關(guān)系和并行計算，以便在高級綜合中取得理想的結(jié)果，同時將行為描述轉(zhuǎn)化為圖的過程中體現(xiàn)多種優(yōu)化目的，所采用的中間表示模型為基于petri網(wǎng)的內(nèi)部表示模型，劃分采用了模擬退火算法。 - Abstract : the parallel computer ' s resource can be used efficiently by proper task partitioning and parallel granularity controlling . by analyzing the characteristic of simulation program , this paper points out a task partitioning algorithm which take state equations as core and right - hand function as object . the algorithm has been used in the automatic parallel tools which we have developed and the application results have showed good effect on parallel simulation
文摘:有效地進行任務(wù)劃分、控制并行粒度，才能充分利用并行計算機的資源，通過對復(fù)雜連續(xù)系統(tǒng)仿真程序特點的分析，提出了以狀態(tài)方程為核心、以右函數(shù)段的計算為主要對象的自動任務(wù)劃分算法，使用結(jié)果表明具有很好的并行效果。 - Firstly , the size of the graph is reduced by collapsing vertices and edges . then , each smaller graph is divided into a certain number of subdomains by means of initial partitioning algorithm . finally , these subdomains are refined back to the original graph through mapping and multi - partitioning refinement strategy
首先通過圖的頂點和邊的收縮將圖逐層縮小，然后在小圖上用初始分區(qū)算法將它劃分為給定數(shù)目的子區(qū)，最后利用映射和多分區(qū)調(diào)整策略將小圖上的分區(qū)細化回歸到原始圖。 - A new dynamic process model partition and distribution method is proposed in this thesis , which can delete the redundant information form distributed executing sites gradually during the process execution , and still support dynamic change of the workflow processes . the process partition algorithm is studied in detail , and the architecture of a fully distributed workflow executing system is put forward based on this algorithm
當前兩種主要的工作流分布式執(zhí)行方法? ?可移動代理和過程定義分割? ?不能同時解決工作流動態(tài)更改和運行時數(shù)據(jù)傳輸量大的問題，本文提出一種新的過程模型動態(tài)分割和動態(tài)分配方法，它可以在運行時逐步從分布式執(zhí)行站點上去除冗余信息，并保證得到的部分過程模型仍能支持動態(tài)更改。 - Abstract : an efficient partitioning algorithm for mixed - mode placement , extended - mffc - based partitioning , is presented . it combines the bottom - up clustering and the top - down partitioning together . to do this , designers can not only cluster cells considering logic dependency but also partition them aiming at min - cut . experimental results show that extended - mffc - based partitioning performs well in mixed - mode placement with big pre - designed blocks . by comparison with the famous partitioning package hmetis , this partitioning proves its remarkable function in mixed - mode placement
文摘:提出一種專用于帶有預(yù)設(shè)計模塊的混合模式布局的劃分算法.它基于擴展的mffc結(jié)群算法,結(jié)合自下而上的結(jié)群和自上而下的劃分為一體進行混和模式下的劃分.這樣不僅可以使劃分能夠考慮電路本身的邏輯依賴,而且可以得到很好的"最小割"劃分結(jié)果.實驗結(jié)果表明,這種劃分算法在層次式混合模式布局流程里起到了顯著的作用.將此算法和當今國際上著名的劃分包hmetis進行比較,結(jié)果表明此算法有一定的優(yōu)勢
更多例句： 上一頁