收斂進化 的英文怎麼說

中文拼音 [shōuliǎnjìnhuà]
收斂進化 英文
convergent evolution
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 進 : 進構詞成分。
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  • 進化 : evolution
  1. Abstract : based on a numbers piled up for varies resources ( labor, materials, mechines ) in neuron plan, a composed distribution for various resources was obtained. then, using time difference and quantities of materials, the best selected work and time started as astrictive conditions, the best optimum distribution which satisfied variou resources in difference optimodel and astrictive conditions was got

    文摘:將多種資源（人工、材料、機械）的數量同時在神經網路計劃技術上實行數字化疊加，從而獲得多資源疊加的合成分佈，再利用神經網路計劃技術中各個工作的不同時差和資源數量，按收斂條件選擇最佳開工工作和開工時間，滿足多種資源在優化模式中按收斂條件進行最優分佈
  2. We will regularize the equations by the standard mollifier to get the approximate solutions. then by making uniform estimates to the approximate solutions and by passing to the limit, we obtain the local existence for the above problem. then, based on the local existence of the classical solution, we discuss the blow - up criterion

    我們主要研究了此方程組古典解的局部存在性，爆破準則以及通過粘性消失方法來研究如上方程組的局部存在性和收斂率問題，主要結論有： （ 1 ）解的局部存在性利用光滑子對方程組進行正則化，從而得到原方程組的逼近解。
  3. Introduction of prepotency operator in the initialize population step and the improved mutation operator accelerate the convergence process, and the introduction of new operator in forming new population step avoid converging in local optimum, and promote the ability of global convergence

    演算法在初始化種群階段引入了「優生」運算元，以及改進的變異操作使演算法的收斂速度大大提高；在形成新種群階段引入新的運算元避免了局部早熟，提高了全局收斂能力。
  4. The improved algorithm is combined with normalized least - mean - square ( nlms ) alg orithm. computer simulations are presented detailedly to show the algorithm exhibits excellent convergence, tracking capability, as well as lower ber

    改進演算法結合了歸一化最小均方（ nlms ）演算法，模擬結果表明改進演算法具有良好的收斂性、跟蹤性能及較低的誤碼率。
  5. In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance

    本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。
  6. A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived

    對于曲線坐標系下的拋物化穩定性方程，文中發展了求解的高效數值方法:引進法向變換，使得在臨界層與壁面之間的擾動量變化最快的區域有更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向有限差分格式，這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式，大大加速收斂並得到更精確的特徵值。
  7. In solving the helmholtz equation in the acoustical waveguides with a curved bottom, slow convergence may occurs when the linear local orthogonal transformation is adopted. in this paper, a class of nonlinear local orthogonal transformations ( nlot ) is proposed. it is an approach to improve the slow convergence mentioned above

    本文嘗試通過在深度方向選取非線性局部正交變換，將曲底求解區域化為平坦求解區域，然後求解helmholtz方程的辦法，來改善用線性（深度方向）局部正交變換時，步進求解時會出現的局部收斂慢的問題。
  8. A novel dynamic evolutionary clustering algorithm ( deca ) is proposed in this paper to overcome the shortcomings of fuzzy modeling method based on general clustering algorithms that fuzzy rule number should be determined beforehand. deca searches for the optimal cluster number by using the improved genetic techniques to optimize string lengths of chromosomes ; at the same time, the convergence of clustering center parameters is expedited with the help of fuzzy c - means ( fcm ) algorithm. moreover, by introducing memory function and vaccine inoculation mechanism of immune system, at the same time, deca can converge to the optimal solution rapidly and stably. the proper fuzzy rule number and exact premise parameters are obtained simultaneously when using this efficient deca to identify fuzzy models. the effectiveness of the proposed fuzzy modeling method based on deca is demonstrated by simulation examples, and the accurate non - linear fuzzy models can be obtained when the method is applied to the thermal processes

    針對模糊聚類演算法不適應復雜環境的問題，提出了一種新的動態進化聚類演算法，克服了傳統模糊聚類建模演算法須事先確定規則數的缺陷.通過改進的遺傳策略來優化染色體長度，實現對聚類個數進行全局尋優;利用fcm演算法加快聚類中心參數的收斂;並引入免疫系統的記憶功能和疫苗接種機理，使演算法能快速穩定地收斂到最優解.利用這種高效的動態聚類演算法辨識模糊模型，可同時得到合適的模糊規則數和準確的前提參數，將其應用於控制過程可獲得高精度的非線性模糊模型
  9. At first, based on the simple genetic algorithm, an improved ga which adopts a combination of emigration policy and adaptive operator is presented. results of numerical optimization show that the improved ga is effective on preventing premature problem

    本文在基本遺傳演算法的基礎上首先研究了浮點編碼遺傳演算法在數值優化中的應用，通過引進「移民策略」和自適應運算元相結合的方法，改進了基本遺傳演算法在後期進化緩慢的問題，極大地減少了早熟性收斂的現象。
  10. Compared with the classical bp algorithm, robust adaptive bp algorithm possesses some advantages as following : ( 1 ) increasing the accuracy of the network training by means of using both the relative and absolute residual to adjust the weight values ; ( 2 ) improve the robustness and the network convergence rate through combining with the robust statistic technique by way of judging the values of the samples " relative residual to establish the energy function so that can suppress the effect on network training because of the samples with high noise disturbances ; ( 3 ) prevent entrapping into the local minima area and obtain the global optimal result owing to setting the learning rate to be the function of the errors and the error gradients when network is trained. the learning rate of the weights update change with the error values of the network adaptively so that can easily get rid of the disadvantage of the classical bp algorithm that is liable to entrap into the local minima areas

    與基本bp演算法相比，本文提出的魯棒自適應bp演算法具有以下優點： （ 1 ）與魯棒統計技術相結合，通過訓練樣本相對偏差的大小，確定不同訓練樣本對能量函數的貢獻，來抑制含高噪聲干擾樣本對網路訓練的不良影響，從而增強訓練的魯棒性，提高網路訓練的收斂速度； （ 2 ）採用相對偏差和絕對偏差兩種偏差形式對權值進行調整，提高了網路的訓練精度； （ 3 ）在採用梯度下降演算法對權值進行調整的基礎上，通過將學習速率設為訓練誤差及誤差梯度的特殊函數，使學習速率依賴于網路訓練時誤差瞬時的變化而自適應的改變，從而可以克服基本bp演算法容易陷入局部極小區域的弊端，使訓練過程能夠很快的「跳出」局部極小區域而達到全局最優。
  11. The results of simulation prove that the improved algorithms are feasible for evolving the digital combinational logic circuits and improve the evolvable efficiency and convergence performance

    模擬實驗結果證明了改進演化演算法對于實現函數級數字組合邏輯電路的硬體演化是可行的，並且提高了演化演算法的演化效率和收斂性能。
  12. The method of sobel edge detection is used to get the initial position and orientation value of optimization in order to improve the convergence speed. the iteration numbers and feature abstraction effect are compared with the method in which the initial value is randomly created

    演算法使用sobel邊緣檢測方法，給出優化初始位置和方向，以提高優化的收斂速度，針對提取特徵時的優化迭代次數和提取特徵的效果與隨機產生優化初始值的方法進行了比較。
  13. Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  14. This optimizing method had been used successfully in full - scale aircraft testing. 6 ) in the global equilibrating, a modified lagrange multiplier method had bring forward. this method can solve inequality constrained optimizer problems

    在整體平衡中，提出了改進的拉格朗日乘數法，成功地解決了含不等式約束條件的優化問題，該方法具有計算簡單，收斂速度快等特點。
  15. To optimize the multi - phase homing trajectory, an improved adaptive genetic algorithm ( iaga ) was proposed, which could efficiently improve convergence speed and avoid the occurrence of premature

    在對分段歸航軌跡的優化中，提出了改進自適應遺傳演算法，該演算法通過增加「強化」運算元、改進對種群「早熟」程度評價指標等，有效地提高了收斂速度、避免了「早熟」現象。
  16. To some eigenproblems, the corresponding ritz vectors always converge very slowly even sometimes do n ' t converge when ritz values have converged. so in order to improve the convergence of ritz vectors, firstly, refining - strategy is applied to the davidson method in this paper. the process restarts with the refined ritz vectors as the initial vectors, and then we get the refined block davidson method

    為了改善ritz向量的收斂性，本文首先在塊davidson方法的執行過程中，運用精化策略，求出相應的精化向量並將其作為初始向量進行重新開始過程，由此得到了精化塊davidson方法，並對精化塊davidson方法進行了收斂性分析；其次，本文將精化塊davidson方法結合收縮技術，提出了收縮的精化塊davidson方法。
  17. Reactive optimal control of distribution system is based on power flow calculation. alternate iterating algorithm is proposed in this paper according to characters of reactive optimal control. the algorithm has advantages of fast computation speed, a few iterating times, high accuracy convergence and easy programming. it is an effect method applied to reactive optimal control

    其次，針對配電網無功優化控制對配電網潮流計算的要求，採用交替迭代演算法進行配電網的潮流計算，該演算法編程簡單、收斂性好、計算速度快，適合於配電網無功優化控制的調用。
  18. At first, in order to prevent the premature convergence of genetic algorithm effectively, the author brings forward a novel dyadic floating - point supplementary mutation operator. then, simulating the natural evolution, the author presents a novel topology, unoriented - connected topology, for parallel genetic algorithm. in the end, an interval decomposed optimization method is brought forward for ipga, which can improve the optimization performance of the algorithm

    為提高演算法的性能，作者對遺傳演算法進行三種改進：首先，為克服遺傳演算法早熟收斂，作者提出一種新的二元浮點補碼變異運算元；其次，模擬生物自然進化模式，為并行遺傳演算法提出了一個新的并行拓撲結構- - - -無定向拓撲連接；最後，作者提出一種區間分解優化思想，來提高對最優解的搜索能力。
  19. According to the shortage of ga converging to a local optimal solution because of reducing the diversity of individuals, the theory of biological immune system is cited, the immune operators including calculation the densities of antibodies, activating or suppressing antibodies and making the memory cell are designed, and effectively combined with ga operators

    同時，針對遺傳演算法在收斂計算後期，由於種群趨向單一化，出現早熟現象而陷入局部最優解的缺點，借鑒生物原理的免疫系統，設計出抗體濃度計算、抗體的抑制/促進、構造記憶單元等多個免疫運算元，並與遺傳運算元進行有效結合。
  20. Two convergence theorems, which show that under suitable conditions evolution strategy asymptotically converges to a global minimum point with probability one, are given

    對于有界閉集上的連續函數，證明了進化策略以概率為1收斂（幾乎處處收斂）于優化問題的全局極小點。
分享友人
分享到 Line

分享到臉書