有效收斂 的英文怎麼說

中文拼音 [yǒuxiàoshōuliǎn]
有效收斂 英文
effective convergence
  • : 有副詞[書面語] (表示整數之外再加零數): 30 有 5 thirty-five; 10 有 5年 fifteen years
  • : Ⅰ名詞(效果; 功用) effect; efficiency; result Ⅱ動詞1 (仿效) imitate; follow the example of 2 ...
  • : Ⅰ動詞1 (把攤開的或分散的事物聚集、合攏) put away; take in 2 (收取) collect 3 (收割) harvest...
  • : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
  • 有效 : effective; valid; efficacious
  • 收斂 : 1 (減弱或消失) weaken or disappear 2 (約束言行) restrain oneself 3 [數學] convergence; constr...
  1. Furthermore, we made a great deal of numerical experiments and the numerical results suggest that the new 9 parameters triangular element is more effective than robust element, and the new 12 parameters rectangular element is more effective than the 12 parameters one in [ 5 ], acm, and the non - complete biquadratic rectangular element

    0 )的性,並進行了大量數值實驗,結果表明:新的9參三角形元比robust非協調元,新的12參矩形元已的12參矩形元, acm元,不完全雙二次矩形元數值果都要好
  2. It is shown in the case that super matrix is easy to constringe the selection sequence assisted by the software, which is efficient and convenient for manager to evaluate and choose the project

    案例顯示,加權超級矩陣在軟體求解的基礎上可以快速,得出各種方案的優先排序,從而幫助管理者簡便、地進行方案決策。
  3. The numerical simulations demonstrate the convergency within a wide region of this method to out - perform the conventional regularization gauss - newton method

    通過與傳統的正則化高斯牛頓法相比較,顯示了小波多尺度法是一個大范圍、能夠節省計算量的方法,數值模擬的結果也表明了方法的性。
  4. The freezed euphorbia thymifolia has qualities of endurability and softness. it has beautifying effects and are suitable to grow in humid and nutritious environments. it symbolized female glow and strength

    雲:千根草纖弱卻耐性,適合濕潤及滋潤之環境,美容之用,冰結千根草之氣質出眾,纖弱耐力,象徵女性光輝,柔以刻剛。
  5. The dynamic glycolysis chaotic oscillation process is identified using vbl network, which shows that this algorithm has better convergence property than other algorithms

    對糖酵解混沌振蕩過程進行動態辨識建模,結果表明本演算法具較好的辨識果和性。
  6. Different algorithms were compared in the numerical simulation and model experiment of concrete velocity inversion the results showed that, compared with the least - square solutions and the damped least - square solutions, the damped and natural weighted least - square solutions reflected the inner defections of the tested object more reliably and exactly due to the usage of correct priori information, which benefited the suppression of noises and made the iterations of inverse stable and convergent

    結果表明,相對于最小二乘法和阻尼最小二乘法,基於自然權的加權阻尼最小二乘演算法,由於利用了正確的先驗信息,不但使反演過程,而且具數值穩定、抗噪能力強的優點,其成像結果能真實地反映對象內部缺陷,因此更適用於混凝土的超聲波速度反演。
  7. Immune clone strategy is introduced into c - means algorithm, which can effectively tackle those problems of nonstability, slow convergence and nonideal clustering that exist in ids with the traditional c - means. the experimental results reveal that the system can detect variety of unknown abnormal intrusions, and demonstrate that our combined clustering algorithm has good performance

    實驗結果證明該上述兩種演算法地克服了傳統c -均值聚類演算法在解決入侵檢測問題中的穩定性差、性不好和聚類果不理想等問題,並能在一定程度上檢測到未知的異常入侵行為。
  8. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構出發,以減小bp神經網路的規模為手段來克服陷入局部極小點,提出了bp神經網路的拆分組裝方法,即將一個大的bp網機地拆分為幾個小的子bp網,每個子網的權值單獨訓練,訓練好以後,再將每個子網的單元和權值機地組裝成原先的bp網,從理論和實驗上證明了該方法在解決局部極小值這一問題時是的;在拆分組裝方法基礎上,本文詳細闡述了輸入樣本的預處理過程,更進一步地減小了bp網路的規模,使子網的學習更加容易了;對于子網的學習,本文採用了最速梯度? ?遺傳混合演算法(即gdr ? ? ga演算法) ,使gdr演算法和ga演算法的優點互為補充,提高了速度;最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  9. Experimental results with some real images show the method has good performance and high speed. 3

    實驗結果表明該方法、穩定,並具較快的速度。
  10. White oak bark is one of the strongest natural astringent herbs available. it tightens tissues, contains blood - clotting agents and strengthens blood vessels, making it ideal for treating bleeding

    白英國櫟是最強的天然劑,它能緊組織、含凝血因子和強化血管作用,于止血方面非常
  11. Cleanse, de - congest and astrigent ; can hydrate and regulate sebum production, prevent acne ; contains azulene which possesses anti - inflammatory and soothing effect, can reduce reddness and soothe sensitive skins

    清潔、疏通及毛孔;保濕、 ,調節皮脂分泌,預防粉刺生成;含豐富的甘菊藍,防止皮膚發炎的功,舒緩、降低敏感現象。
  12. 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的總傳導率之比。
  13. 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 )在入侵檢測特徵提取方面的優缺點。
  14. Trajectory control algorithm is also presented to make the excursion of flight converge to zero in given limited time during flying. it is mainly used to control and reduce the excursion and crab angle within given limited time when the aerocraft is following the reference flight path

    然後本文提出了用於控制飛行器在跟蹤參考航跡過程中出現的航跡偏移和偏航角的航跡控制演算法,該演算法能地使航跡偏移量和偏航角在給定的時間約束內
  15. 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

    對于曲線坐標系下的拋物化穩定性方程,文中發展了求解的高數值方法:引進法向變換,使得在臨界層與壁面之間的擾動量變化最快的區域更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向限差分格式,這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式,大大加速並得到更精確的特徵值。
  16. The simulation results demonstrate that the maekf has better performance than the ekf in accuracy

    對比模擬分析表明,濾波所改善,提高了精度和速度。
  17. Abstract : based on the iterative bit - filling procedure, a computationally efficient bit and power allocation algorithm is presented. the algorithm improves the conventional bit - filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance

    文摘:基於迭代的比特和功率分配機制,提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同,該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外,通過選擇等功率分配方案作為初始方案加快了演算法的速度,進一步降低了演算法復雜度.模擬結果表明,提出的改進演算法在基本不犧牲系統性能的前提下地降低了演算法復雜度
  18. It exploits the structured of the hessian matrix of the objective function sufficiently. an attractive property of the structured bfgs method is its local superlinear / quadratic convergence property for the nonzero / zero residual problems. the local convergence of the structured bfgs method has been well established

    它們充分利用了目標函數的hesse矩陣的結構以提高演算法的率,該演算法的顯著優點是對于零殘量問題具二階性而對于非零殘量問題具超線性性。
  19. Regarding social behaviors, it is responsive, inter - protocol fair ( tcp - compatible ), intra - protocol fairness convergent, and efficiency convergent

    在集體行為方面,它是易響應的,協議間公平( tcp -兼容)的,協議內部公平有效收斂的。
  20. For both methods, at most two reduced linear systems of equations with the same coefficient matrix need to be solved in order to get iterative directions at each iteration and the iterative matrix involves only constraints in the working set, whose cardinality are much less than the number of original constraints

    在其每次迭論文摘要代中,只工作集中的約束參與計算。在本文中,我們在facchinei一fischer一kanzowkkt點約束集識別技術的基礎上提出了三個具性的qp一free演算法。
分享友人