As emphasis, we propose a new backward width-flrst search circuit partitioning method with flip-flop as core for synchronous sequential circuits . and then based on it, we develop a new circuit parallel tg algorithm 最后重點(diǎn)對(duì)電路并行方法進(jìn)行了研究,提出了一種新的以觸發(fā)器為核且消除大功能塊之間反饋的寬度優(yōu)先反向搜索同步時(shí)序電路劃分方法。
System level design . in this level, the thesis provides the system partition method, function design and method of design based on finite state machine . the key is the modification of available soft ip and realization of ad bus reuse technology 系統(tǒng)級(jí)設(shè)計(jì):論述了pci安全芯片的系統(tǒng)劃分、功能設(shè)計(jì)和基于有限狀態(tài)機(jī)的設(shè)計(jì)思想,重點(diǎn)是對(duì)已有ip的修改方法和ad總線再?gòu)?fù)用技術(shù)的實(shí)現(xiàn)。
4 ) the circle data partition method of spectral adjoint model is put forward . the method increases 30.7 % of parallel computing ratio under distributed-memory environments with 32-processors . the butterfly-net data redistribution of spectral adjoint models is put forward 4)提出了譜離散伴隨模式并行計(jì)算的有效循環(huán)數(shù)據(jù)分配方法,采用該方法在某分布式存儲(chǔ)并行計(jì)算機(jī)上32臺(tái)處理機(jī)并行計(jì)算效率提高了30.7。
In ttg model, task is the base design granularity, the partition of task affect the quality of system design heavily . the thesis addresses the importance of the task partition problem and presents a task partition method based the closeness measurements of system behavior objec1fs ttg模型中以任務(wù)作為設(shè)計(jì)的基本粒度,本文指出了任務(wù)劃分問(wèn)題的重要性,并提出了基于系統(tǒng)行為對(duì)象關(guān)系度量進(jìn)行任務(wù)劃分的方法。
But the influence trend of the maximum rolling angle and the rolling period was not so simple, it was because the influence of which embodied in the phase relationship of mass flow and the pressure drop across the tube . the d-partition method was developed to separate the test tube into four regions and the drift flow model was imported into the two phase region, based on which the solution of the response of the pressure drop of tested tube to the inlet mass flow perturbation can be obtained 在不搖擺和搖擺工況下,采用d分區(qū)法對(duì)實(shí)驗(yàn)段進(jìn)行分區(qū),在兩相區(qū)采用漂移流模型對(duì)實(shí)驗(yàn)段的壓降對(duì)入口流速擾動(dòng)的響應(yīng)進(jìn)行了求解,給出了各區(qū)壓降響應(yīng)的表達(dá)式,進(jìn)而得到了在不搖擺和搖擺工況下,壓降與入口流速擾動(dòng)之間的傳遞函數(shù)。
Because of the importance and specialize of the cluster analysis in data management, the research in this field get a great advancement in recent years, a number of clustering algorithms has been founded, in general, major clustering methods can be classified into the following categories : partitioning methods, hierarchical methods, density ? ased methods, grid-based methods, model-based methods, besides these, some clustering algorithms integrate the ideas of several clustering methods 由于聚類(lèi)分析在現(xiàn)實(shí)數(shù)據(jù)處理中的重要性和特殊性,近年來(lái)在該領(lǐng)域的研究取得了長(zhǎng)足的發(fā)展,涌現(xiàn)出了許多聚類(lèi)分析的方法,如基于劃分(partition-based)的聚類(lèi)方法、基于層次(hierarchical-based)的聚類(lèi)方法、基于密度(density-based)的聚類(lèi)方法、基于網(wǎng)格(grid-based)的聚類(lèi)方法、基于模型(model-based)的聚類(lèi)方法等等。
In this dissertation, the experimental study of rolling condition on two-phase flow instabilities of the forced-single-tube circulation system was carried out . furthermore, based on the d-partition method and the hypothesis of drift flow model, given some conservative equation, using the perturbation method the response of the pressure drop of the tube to the inlet flow rate perturbation was analyzed both in rolling condition and in normal upright position 本文主要通過(guò)實(shí)驗(yàn)對(duì)搖擺條件對(duì)單管強(qiáng)迫循環(huán)中汽液兩相流動(dòng)不穩(wěn)定性的影響,同時(shí)在d分區(qū)法的前提下,在兩相區(qū)基于漂移流模型,一定的守恒條件下,在搖擺和不搖擺工況中用線性小擾動(dòng)法對(duì)實(shí)驗(yàn)段的壓降對(duì)入口流速的擾動(dòng)的響應(yīng)進(jìn)行了分析。
K-means algorithm is one of the major clustering algorithm . it is a kind of clustering algorithm based on partitioning method . this algorithm chooses k ( the number of clusters ) points as the initial cluster centers, achieve the process of clustering through iteration . this algorithm is correspondingly telescopic and effective, but it has its own inherent deficiency : the process is iterative, and can ’ t be sure to converge at the optimum value, it always coverge at the partial optimum value instead of global optimum value 目前聚類(lèi)算法大體上分為基于劃分的方法、基于層次的方法、基于密度的方法、基于網(wǎng)格的方法、基于模型的方法以及模糊聚類(lèi)。k-means算法是聚類(lèi)算法中主要算法之一。它是一種基于劃分的聚類(lèi)算法。
Data transfer is an important part of data collection and pretreatment, whose crucial part is to transfer continuous data to distribute data, so we use an inflexion partition method to implement it . we also extend fp-growth algorithm to avoid large memory requirement by means of splitting alarm database to multi-databases with dealt data to realize date mining fp-growth算法對(duì)內(nèi)存消耗很高,不加任何處理地對(duì)大量的電信數(shù)據(jù)進(jìn)行數(shù)據(jù)挖掘是不能實(shí)現(xiàn)的,為此對(duì)fp-growth算法進(jìn)行了擴(kuò)展,通過(guò)劃分投影數(shù)據(jù)庫(kù)的方法使得數(shù)據(jù)挖掘來(lái)減小算法對(duì)內(nèi)存的要求。
Theory analysis and computer simulation show the improved smf can extract small target from ir background effectively . in the end of this chapter, a kind of threshold partition method is used to transform the gray images to black-white images in order to provide a better condition for the image sequences detection 在本章最后,采用一種自適應(yīng)門(mén)限分割方法對(duì)抑制了背景的紅外圖像加以進(jìn)一步的處理,得到了僅含有少量可疑目標(biāo)的二值化圖像,從而為后面的序列圖像檢測(cè)方法提供了有利條件。