遞增演算法 的英文怎麼說
中文拼音 [dìzēngyǎnsuànfǎ]
遞增演算法
英文
add algorithm- 遞 : Ⅰ動詞(傳送;傳遞) hand over; pass; give Ⅱ副詞(順著次序) in the proper order; successively
- 演 : 動詞1 (演變; 演化) develop; evolve 2 (發揮) deduce; elaborate 3 (依照程式練習或計算) drill;...
- 算 : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
- 法 : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
- 遞增 : increase progressively; increase by degrees
-
Theoretical analysis and experimental results indicate that algorithm ecfpcg1 and algorithm ecfpcg2 es - tablished by specifying parameters are much more efficient than the imth method, and roughly speaking, the relative efficiency of the algorithms versus the imth method tends to + 00 at the asymptotic formula inn / in3 when n tends to + 00
理論分析結果表明:這兩個演算法比imth方法具有更高的效率,而且,演算法ecfpcg1的效率高於演算法ecfpcg2的效率。進一步地,演算法ecfpcg2與imth方法的效率比分別為問題維數n和目標函數復雜性嚴格遞增函數,而且這個效率比的下界隨問題維數n的增大以ln ( n ) ln3的速率趨于無窮大。One of its most important applications is to improve the optimization algorithms by evaluating the relevant derivatives information efficiently the aim of the work includes : to establish and study new algorithms - - cf - pcg algorithrns with ad ; to establish and study the extended cf - pcg algorithm ( ecfpcg ). cf - pcg algorithms with ad is proposed on the basis of cf - pcg algorithms with sd, in addition to replace sd with ad, there are other significant modification to the algorithms. the results by theoretical analysis and numerical experiments implicate that cf - pcg algo - rithm with ad is an improvement to newton method with ad
論文首次將自動微分應用於牛頓- pcg型演算法,構造了新演算法,並從理論上比較了新演算法與牛頓法的效率,證明了新演算法的效率嚴格大於牛頓法的效率,而且新演算法與牛頓法的效率比分別是問題維數n和目標函數復雜性的嚴格單調遞增函數,當n趨于無窮大時,這個效率比的下界以ln ( n ) ln2的速率趨于無窮大。The recursive algorithms of restricted, increased, decreased mode are deduced without the calculation of the inversion
分別導出了rkrls和rsvm演算法在限定、增長和縮減記憶模式下的遞推公式,均無需進行求逆計算。The weights are trained with gradient descent method. the increase algorithm of bvs, and restricted algorithm, was induced
利用梯度下降法對網路的權值進行訓練,並且推導了bvs的增長演算法,以及網路訓練的限制記憶遞推公式。For above problems, i design boole process - based algorithm. for example, hazards finding theory work out a formal method of finding hazards by waveforms computing ; waveforms increasing algorithm settle the defect of boole process in feedback cycle treatment ; false paths discerning algorithm can delete useless nodes in netlist effectively ; inertia conflict eliminating method describes the state of nodes truelier and reduces computing
其中,冒險檢測定理給出了通過波形運算檢測電路中冒險現象的哈爾濱工程大學碩士學位論文形式化方法;波形遞增演算法解決了boole過程在處理電路中反饋環問題上的缺陷;偽路徑識別演算法能夠有效地去除電路網表中的無用節點;而慣性沖突消除法能使對節點狀態的描述更加真實,並減少了計算量。For large errors introduced by nonlinear state - space model in passive locating and tracking problems, various suboptimal recursive filtering algorithms are aralyzed and summarized, such as the extended kalman filtering ( ekf ), the modified gain extended kalman filtering ( mgekf ), the second order filtering and the adaptive extended kalman filtering ( aekf )
摘要針對被動定位跟蹤中狀態空間模型非線性程度較高所引發的濾波精度偏低的問題,分析和總結了已有的包括推廣卡爾曼濾波( ekf ) 、修正增益的推廣卡曼濾波( mgekf ) 、二階濾波、自適應推廣卡爾受濾波( aekf )等各種次優遞推濾波演算法的特點。To identify the model parameters of controlled esvrst system on line, the recursive extended least square with variety forgetting factor is used, which makes the control system possess anti - disturb ability obviously and unchangeable precision of stochastic waveform reappearance
本文提出了用變遺忘因子的增廣最小二乘遞推演算法在線識別電液伺服汽車道路模擬試驗臺被控系統的模型參數,使控制系統在實現波形再現時具有顯著的抗干擾能力和穩定的波形再現精度。In decision tree algorithm, the famous one is id3 algorithm, which was presented by quinlan in 1986. it is not a algorithm increasing by degrees, and it uses information entropy as a standard to select attribute, but the disadvantage of this algorithm is that it is easy to select those attributes whose values is more, while attributes whose values is more are not always the best
在決策樹演算法中屬quinlan於1986年提出的id3演算法最有名,它是非遞增演算法,並且採用信息熵作為屬性選擇的標準,可是這個標準易偏向于值數較多的屬性,而屬性值較多的屬性卻不總是最優的屬性。The rapid prototyping algorithms were implemented by programming in ejb. the algorithms included the algorithm of choosing entity slicing layer thickness, the scanning algorithm of beeline parallel to x axis at first layer and beeline increasing by some angle and the area - scanning algorithm, etc. the general of the rapid prototyping software system based on j2ee was solved in the generals of system, module and application
在j2ee框架模型ejb組件中,編程實現了應用層收縮率v對固定的鋪粉厚度和自適應變鋪粉厚度進行調整的兩種實體分層層厚選取演算法;為了提高軟體的運行效率,將整個三維數據源表按z向高度分成20份的切片處理演算法;第一層平行於x軸每層比前層遞增一定角度的直線掃描演算法和分區掃描等演算法。The thesis, in the probability analysis and computation, considers the failure history of space frames and trusses, adopts the bound criterion and algorithms on the base of system ' s critical strength, and introduces the soft self - adaptation control bound into the identification of dominant failure modes ; at the same time, with the incremental load method and differential equalized recursive method, computes the limit - state function of failure mode and probability index precisely under no leaking the dominant failure modes
文中在可靠性分析和計算部分,考慮空間剛桁架結構系統的失效演化歷程,採用基於系統臨界強度的約界準則和約界演算法,將柔性自適應控制邊界引入失效模式識別過程;同時,用荷載增量法和微分等價遞歸演算法相結合,確保在嚴格不遺漏主要失效模式的情況下,快速準確地求解失效模式的極限狀態方程和可靠度指標。A method of automatically generating nbs is developed. the algorithms - of increasing network node, adjusting nb parameter and adjusting weights are presented
推導了網路節點增長的權值遞推演算法、網路基參數的校正演算法以及網路權值的校正演算法的遞推公式。Based on the classical least squares method ( rls ) in system identification, the several new identification algorithms of parameter estimation for the autoregressive moving average ( arma ) model, are presented. they include univariable and multivariable two - stage recursive least squares - recursive extended least squares ( rls - rels ) and two - stage recursive least squares - pseudo - inverse ( rls - pi ) algorithms
本文在系統辨識經典的最小二乘法( rls )的基礎上,提出了自回歸滑動平均( arma )模型參數估計的一些新的辨識演算法,它包括單變量和多變量兩段遞推最小二乘?遞推增廣最小二乘( rls ? rels )演算法和兩段遞推最小二乘?偽逆( rls ? pi )演算法等。A method based on fuzzy equivalence relation is applied to implement target classification and a synthetic algorithm is presented to fulfill multi - layer structure among groups by using the nearest - neighbor method and field knowledge
應用基於模糊等價關系的方法實現目標編群,並提出一種基於域知識和最近鄰法相結合的演算法來實現群結構遞增形成的策略。Although the congestion control research of host - ends has made great strides, the current queue management mechanism in router is not able to provide end - to - end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop - rate for different types of flows and the synchronization of all tcp flows in network. so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ). this article analyzes the main traits of host - ends congestion control and all kinds of fashionable queue management machanism, which include queue mechanism with absolute priority, weighted fair queue mechanism and class - based queue mechanism
本文分析了主機端的擁塞控制機制和網路中路由器的現有各種隊列管理機制:絕對優先級隊列機制、加權公平隊列( weightedfairqueue ) [ 1 ]機制、基於類的隊列( class - basedqueue ) [ 2 ]機制以及red ( randomearlydetection ) [ 3 ]機制的主要特點,並重點針對ietf ( internetengineeringtaskforce )推薦的把red演算法與明確的擁塞通告ecn ( explicitcongestionnotification ) [ 4 ]結合的方法進行了分析,發現隨著internet流量的日益遞增, red機制的依賴平均隊列長度來管理擁塞控制的演算法並不能有效地阻止包丟失:與drop - tail相比, red確實消除了對陣發流量( tcp )的偏見,但是增加了平滑流量( udp )的丟包概率。Incremental learning algorithm of induction
一種遞增式歸納學習演算法The computation should be as below : firs t to process and analyze the data with software - sas, spss and so on ; then to set up linear production function, cobb - douglass production function and quadratic production function ; and to calculate total returns, marginal returns and average returns ; and finally to carry out comparative analysis about all the computation results of different methods
除此以外,還建立了線性生產函數、二次生產函數等不同類型的數學模型,並對不同方法的計算結果進行對比分析,以尋找最切合實際而行之有效的經濟學方法。分析表明:在時間演變上,張掖綠洲農業水資源總效益是遞增的,而且具有加速度,反映了農業技術進步對生產發展的促進。The algorithm used by the admin process to create new ports uses a default value 9080 for http transport and increments up to the next free value for each new server that is defined
管理進程創建新埠所用的演算法,為每個定義的新服務器使用默認值( http傳輸使用9080 )並遞增到下一個沒有被佔用的值。When solving independent problems, the mathematical analysis shows that when a schema whose fitness is higher than the overall average fitness, the schema ' s exponential increase index of trials allocated in the next generations of coevolutionary genetic algorithm ( cga ) is higher than that of csga
數學分析表明,對于獨立多問題,共同進化演算法採用按比例選擇策略時,高於平均適應值的模式的逐代遞增指數高於傳統單種群遺傳演算法,說明共同進化演算法的效率高於傳統的單種群遺傳演算法。分享友人