收斂測試 的英文怎麼說
中文拼音 [shōuliǎncèshì]
收斂測試
英文
convergence test- 收 : Ⅰ動詞1 (把攤開的或分散的事物聚集、合攏) put away; take in 2 (收取) collect 3 (收割) harvest...
- 斂 : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
- 測 : 動詞1. (測量) survey; fathom; measure 2. (測度; 推測) conjecture; infer
- 試 : 名詞(古代占卜用的器具) astrolabe
- 收斂 : 1 (減弱或消失) weaken or disappear 2 (約束言行) restrain oneself 3 [數學] convergence; constr...
- 測試 : test; testing; checkout; measurement
-
This paper utilized the deformation characteristics of rock and expatiates on the strain test method of surrounding rock by which to judge the surrounding rock ' s stability, and to choose the suitable opportunity and style of the secondary lining
摘要利用巖體的變形特性,通過測試隧道圍巖應變出隧道凈空實際收斂量,從而判定施工過程中隧道圍巖的穩定性,為選取合適的支護時機和方式提供依據。A chaos optimum and neural network calculation model was built based on plenty of testing data of concrete intensity to cover the shortage of single bp neural network, such as slow astringency and easy torpidity
摘要依據混凝土標準試塊強度檢測數據,建立了混沌優化的神經網路計算模型,從而克服傳統bp網路收斂速度慢、易出現麻痹現象等不足。1, q 3, and at last prove the exisitence of ( q, m + n, n, m ) resilient functions when n > q ? 1. intelligentized ids methods, which can make the system more adaptability and self - studying, are important research directions of ids so far. in order to make the ids systems have better identifying ability and efficiency against new intrusions, we propose the intrusion feature extra - ction algorithm based on ikpca by studying the different kinds of intrusion detection feature extraction algorithm based on unsupervised learning, and then theoretically analysis the conver - gence of the algorithm. in addition, we validate the validity of the algorithm by means of experim - ents ; at the same time, through studying ica and neural networks, we propose fastica - nn ids, and then test the kddcup99 10 % date set to make comparison of kpca 、 ikpca and fastica algorithms in intrusion detection advantages and disadvantages
為了使入侵檢測系統對新的入侵行為有更好的識別能力和識別效率,本文在研究了各種基於無監督學習的入侵檢測特徵提取方法的基礎上,提出了基於增量核主成份分析( ikpca )的入侵檢測特徵提取方法,並對該方法進行了收斂性分析,同時結合模擬試驗對其正確性進行了驗證;另外,本文通過研究獨立成份分析和神經網路,提出了基於快速獨立成份分析和神經網路的入侵檢測方法( fastica - nnids ) ,並通過對kddcup99的10 %數據集的檢測比較了核主成份分析( kpca ) 、增量核主成份分析( ikpca )和快速獨立成份分析( fastica )在入侵檢測特徵提取方面的優缺點。The simulation result indicates that the performance of bspso on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms
測試結果表明:採用該演算法求解0 / 1背包問題所得的最優解明顯優于貪婪演算法和遺傳演算法,且有較快的收斂速度。In the same time we also use it to test the power of dc crossover. in this algorithm every element in the population a domination count is defined together with a neighborhood density measure based on a sharing function. those two parameters are then non - linear combined in order to define the individual ' s fitness
演算法通過計算種群中pareto優于某個個體的個體數目以及個體所在位置的密集度來定義適應度函數,多個算例的測試結果表明該演算法結合錯位交叉運算元具有較好的性能,能夠使演算法收斂到pareto概念下的比較均勻的一組非劣最優解。Based on the papers [ 10 ] and [ 19 ], we propose a new nonmonotone conjugate gradient algorithm, prove its convergence and test the new nonmonotone algorihm
基於文獻[ 10 ]和[ 19 ] ,我們提出了一種新的非單調共軛梯度演算法,證明了新演算法的收斂性,並對它進行了測試。The major tasks include : ( 1 ) expand the schema theorem for ga. the schema theorem with binary coding advanced by professor holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding. ( 2 ) put forward replacing by the excellent chromosome ga ( recga ), superiority colony first ga ( scfga ) and improve the ga ; ( 3 ) make probability convergence analysis of recga using the theory of markov chain, random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga, modify the arithmetic and then conduct tests
主要有以下幾方面工作: ( 1 )將二進制編碼遺傳演算法的模式定理擴展到由有限整數、字母或取值個數有限的浮點數編碼,或它們混合編碼的遺傳演算法范圍; ( 2 )提出最佳個體替換策略遺傳演算法( recga ) 、優勢群體優先策略遺傳演算法( scfga ) ,對遺傳演算法進行改進; ( 3 )使用隨機過程理論markov鏈對recga進行了收斂性分析; ( 4 )使用泛函分析理論壓縮映射原理對scfga進行了收斂性分析; ( 5 )使用遺傳演算法設計了解決np類問題(排課問題)的測試程序( cap ) ,並根據recga對演算法進行改進並進行測試。Simulation and test results show that the requirments of calculation speed and logic resource consuming can be satisfied
模擬測試結果表明,論文實現的演算法在速度、資源佔用及收斂性能上完全滿足項目的要求。Finally, experiment results are given to demonstrate the performance of the proposed aec algorithm, where erle and rate of convergence are the main indexes
最後兩章給出了具體的實驗結果和未來工作展望。其中主要測試指標為回波消去量( erle )和收斂速度。The testers can also be used to measure wavefront curvature and quantify divergence / convergence magnitude
這些測試儀器也可以用於測量波陣面曲度和確定發散量/收斂量。The theoretical analysis and test result show that the proper preprocessing an appropriate preprocessing of the optimization mathematical model can simplify the optimal design process, accelerate the algorithm convergence speed, and at the same time, improve the best solution quality
理論分析和測試數據表明:對優化數學模型採用適當的預處理,簡化了優化設計過程,加速了演算法的收斂速度,同時提高了最優解的質量。The convergence of the new algorithm is better then that of nsga - ii through examination of a testing function
通過測試函數計算表明, ipga演算法收斂性優于nsga -演算法。Nevertheless, the numeric simulation study shows that for some test problems the hybrid algorithm converges very fast, while for some problems especially for those which have numerous local optimal traps it does not behave better than the original nsga -, which calls for further studies
實驗表明其對于某些測試問題收斂非常快,但對于某些具有大量局部最優陷阱的測試問題並不比原來的nsga -表現更出色,需要進一步研究。The synthetic tests show that the new sata algorithm is superior to the conventional linear geophysical inverse methods without depending on the initial model, and superior to the conventional non - linear geophysical inversion methods with higher speed of convergence
用理論測試函數對這種新的反演方法進行了數值試驗,結果表明該方法具有解不依賴于初始模型、收斂速度快等優點。In this part, a series of functions are built to test several different algorithms. also, the computing cost and the search efficiency are defined. then two measurements - search efficiency and convergence rate, are given to compare searching performance of algorithms
構造了系列的測試函數對不同的演算法進行系統的測試,定義了演算法的搜索計算量和搜索效率,通過搜索效率和收斂率兩種方法,比較並討論了mec和幾種遺傳演算法的性能。In this part, another global optimization method, direct is also tested. it is a deterministic method, not as ga, therefore possessing relatively stronger robustness. though the precision of the optimum it finds usually is not high, it has fast convergence rate and is also an appropriate choice for many engineering problems
在此部分還測試了另外一種全局優化方法direct ,該方法不同於遺傳演算法,是一種確定性演算法,有較強的健壯性,雖找到的最優解的精度不高,但收斂比較快,對於一般的工程問題也是一種合適的選擇。Experimental test demonstrates that the scheme can universally accelerate the search speed
實驗測試表明,應用該方案能普遍提高演算法的收斂速度。The convergence of the pnn decision rule for the bayesian decision rule is proved with probability. an explicit formulation of pnn generalization ability is proposed. and the accuracy rate of a classification network is explained as the maximum likelihood estimation of the generalization ability
證明了pnn的決策函數依概率收斂于貝葉斯決策函數;給出了pnn的推廣能力表達式;證明了一個分類網路的測試集正確率是該網路推廣能力的極大似然估計;給出了分類網路中需要的測試集數目表達式;證明了pnn推廣能力不大於由貝葉斯決策所帶來的正確識別率分享友人