It is given in chapter three and four 這些,是本文提出的判定算法的petri網(wǎng)方面的理論依據(jù)。
The difficulties of the whole system design are the design of the pit judgment arithmetic , the writing of the hy6070 vxd , the design and operation about the database 所以整個(gè)系統(tǒng)設(shè)計(jì)的難點(diǎn)在于:缺陷判定算法的設(shè)計(jì); hy6070虛擬驅(qū)動(dòng)程序的編寫(xiě);數(shù)據(jù)庫(kù)的設(shè)計(jì)和操作。
The difficult part of the whole system is : the design of the interface circuit , the virtual device driver of the data collection card hy - 6070c , the design of the flaw determinant algorithm and the design and operation of the database 整個(gè)系統(tǒng)設(shè)計(jì)的關(guān)鍵在于:接口電路的設(shè)計(jì)、 hy - 6070c數(shù)據(jù)采集卡虛擬驅(qū)動(dòng)程序的編寫(xiě)、缺陷判定算法的設(shè)計(jì)、數(shù)據(jù)庫(kù)的設(shè)計(jì)和操作。
In this article , a algorithm ccn ( calculate crossing number ) is put forward to study the crossing number . it is a very important development in graph planarity issue after planarity - determinant algorithm and embedding algorithm 本文首次給出了較好的計(jì)算圖的交叉數(shù)算法ccn ( calculatecrossingnumber ) ,這是繼圖平面性判定算法,二連通圖的平面嵌入算法之后在圖的平面性問(wèn)題上的一個(gè)最重要的進(jìn)展。
14 gallo g , mishra b . efficient algorithms and bounds for wu - ritt characteristic sets . effective methods in algebraic geometry , progress in mathematics , 1991 , : 119 - 142 . 15 gao x s , chou s c . a zero structure theorem for differential parametric systems 本文簡(jiǎn)要介紹了代數(shù)方程組的特征列方法及其在幾何定理機(jī)器證明發(fā)現(xiàn)與含參數(shù)代數(shù)方程求解中的應(yīng)用,進(jìn)一步給出了基于特征列方法代數(shù)閉域上的一階邏輯公式的判定算法。
Using these algorithms , we can use computer mechanically to list truth value table of a group of propositional formulae , determine that if a given propositional formula is a tautology , a contradiction , or if the formula is satisfiable 給出了命題邏輯中任一命題公式的真值表的生成算法與命題公式類型的判定算法,實(shí)現(xiàn)了利用計(jì)算機(jī)對(duì)有限多個(gè)命題公式的真值表的直接計(jì)算和輸出,以及對(duì)一個(gè)命題公式是重言式、矛盾式或可滿足式的機(jī)械判定。
The difficulties of the whole system design are : design of the interface ; programming of the vxd for the hy - 6070c a / d card ; design of the pit judgment arithmetic ; design and operation about the database . all of the difficulties have been studied in detail in this thesis 所以整個(gè)系統(tǒng)設(shè)計(jì)的難點(diǎn)在于:接口電路的設(shè)計(jì)、 hy - 6070c數(shù)據(jù)采集卡虛擬驅(qū)動(dòng)程序的編寫(xiě)、缺陷判定算法的設(shè)計(jì)、數(shù)據(jù)庫(kù)的設(shè)計(jì)和操作,在本文中對(duì)于這幾部分作了詳細(xì)的討論。
The effectively retiming determining algorithm is key of retiming , so it is the key of sequence adjust strategy . the effectively retiming determining algorithm can be mainly classified into two categories : one is based on minimal weight path algorithm , the other is based on simple retiming 在時(shí)序調(diào)整策略中,有效重定時(shí)的判定算法主要分為兩類,一類是基于圖中最小權(quán)路徑算法的有效重定時(shí)的判定算法,另一類是基于簡(jiǎn)單重定時(shí)的有效重定時(shí)的判定算法。
According to the definitions of bottleneck bandwidth , available bandwidth and bulk transfer capacity , we analyzed the algorithms which named vps ( variable packet size ) , pptd ( packet pair / train dispersion ) , slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement , we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range , approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ) , we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth , we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap , we developed a measurement program to look for bottleneck bandwidth . in ns2 experiments , the algorithm based on heterogenous packet - pair train fitted well , and the algorithm of self - loading binary search worked quickly , and the sctp scheme improved the throughput effectively 本文根據(jù)瓶頸帶寬、可用帶寬和btc ( bulktransfercapacity )三類網(wǎng)絡(luò)帶寬定義,分析了vps ( variablepacketsize )和pptd ( packetpair / traindispersion )瓶頸帶寬測(cè)試算法, slops ( self - loadingperiodicstreams )和topp ( trainsofpacketpairs )可用帶寬測(cè)試算法;基于子路徑瓶頸測(cè)試原理,設(shè)計(jì)了異構(gòu)包對(duì)序列的瓶頸測(cè)試算法;并結(jié)合三個(gè)子算法(界定帶寬范圍算法、接近帶寬值算法和帶寬變化趨勢(shì)判定算法) ,設(shè)計(jì)了自載流折半查找的可用帶寬測(cè)試算法;把上面的算法應(yīng)用到sctp ( streamcontroltransmissionprotocal )的多宿性和可用帶寬測(cè)試,提出了一個(gè)網(wǎng)絡(luò)擁塞或故障時(shí)調(diào)整sctp傳輸路徑的方案;結(jié)合winsock和winpcap兩套網(wǎng)絡(luò)開(kāi)發(fā)工具,設(shè)計(jì)了一個(gè)瓶頸帶寬測(cè)試程序;通過(guò)ns2仿真實(shí)驗(yàn),驗(yàn)證了基于異構(gòu)包對(duì)序列瓶頸測(cè)試算法的準(zhǔn)確性、自載流折半查找算法的快速性,和sctp改進(jìn)方案的有效性。
Based on the model , the thesis proposes the algorithm deciding the important manufacturing process , which can be used to decide the important parts of manufacturing process ; and proposes the algorithm affecting unqualified index of manufacturing quality , which can be used to find the process affecting the unqualified index 基于該模型,提出了重點(diǎn)工序確定算法,用于確定制造過(guò)程中需要重點(diǎn)控制的質(zhì)量環(huán)節(jié);提出了不合格指標(biāo)相關(guān)工藝判定算法,用于快速找出質(zhì)量檢驗(yàn)中影響不合格指標(biāo)的相關(guān)工序。