收斂時間 的英文怎麼說

中文拼音 [shōuliǎnshíjiān]
收斂時間 英文
convergence time
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. Agglomerative effectiveness : the effect on regional economical inequality because of industrial agglomeration. in order to show the effects of industry on regional inequality, the model of panel data is applied to analyze the relationship between industrialization and economy growth., which is helpful to estimate whether the tendency of growth is convergence and the structural effectiveness. the time series model is used to analyze the effect of industrial agglomeration on regional inequality, where gini coefficient is taken as the index of industrial agglomeration

    為了更清楚地把握工業在地區差距上的效應，本文用面板數據模型分析工業化程度和經濟增長之間的相關關系，從而判斷區域經濟發展趨勢是否收斂，工業在「結構效應」方面的影響;計算表示工業集聚程度的基尼系數，通過時間序列模型分析工業集聚對地區經濟差距的「集聚效應」影響。
  2. 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

    文摘:將多種資源（人工、材料、機械）的數量同時在神經網路計劃技術上實行數字化疊加，從而獲得多資源疊加的合成分佈，再利用神經網路計劃技術中各個工作的不同時差和資源數量，按收斂條件選擇最佳開工工作和開工時間，滿足多種資源在優化模式中按收斂條件進行最優分佈
  3. As soon as the servo system is concerned, the celerity of control algorithm is a very important capability guideline

    在計算機控制系統中，控製程序的時間間隔對控製品質有著很重要的影響，這就要求所設計的控制器收斂速度快。
  4. On one hand, numerical derivatives provide proper search directions in optimization, therefore their accuracy is of great importance for fast convergency. on the other hand, derivative evaluation is one of the most time - consuming steps in optimization

    當前的高性能數學規劃演算法大都依賴于導數計算以快速收斂到最優點，所以對求導精度的要求比較高；而導數計算所消耗的時間占優化時間的比例又非常的大。
  5. The presence even for a moment among a party of debauchees of a woman endued with every quality of modesty and not less severe than beautiful refrained the humorous sallies even of the most licentious but her departure was the signal for an outbreak of ribaldry

    一賢淑端莊容貌標致之淑女一時出現于蕩子群中，彼等淫蕩之徒便即刻收斂其輕佻猥褻。然而俟伊退出后，穢言穢語剎那間重新爆發。
  6. The present paper firstly represents the model about random walks in time - random environments on the right line, then the studies about recurrence - transience criteria and limit theorem by using some relative theories of markov chains, and finally a center limit theorem of this random walks in the non - recurrence case

    摘要給出了半直線上時間隨機環境下隨機游動的模型，並利用馬氏鏈理論研究了該隨機游動的常返暫留準則和依概率收斂的大數定律，得到在非常返情形下的中心極限定理。
  7. The viscid flux is discretized by second - order central difference scheme. baldwin - lomax turbulence model is implemented in navier - stokes flow solver. for steady - state calculations, a four - stage runge - kutta scheme with convergence acceleration techniques such as local - time stepping and implicit residual smoothing is used

    其中，定常計算中的時間推進採用四步runge ? kutta方法，並應用了當地時間步長、隱式殘值光順等加速收斂措施；非定常計算中的時間推進採用jameson的隱式雙時間方法。
  8. It is demonstrated that the solution for 141 000 order normal equations for a simulated astro - geodetic network ( 47 057 points ) and a space one ( 476 points ) iterates 4 993 times to converge to 1 10 - 18 second, taking 28 min and 47 seconds, on a pii / 233 computer, showing over 40 times more efficiency, as compared with the coefficients unadjusted

    利用模擬的天文大地網（ 47057點）和空間網（ 476點）在pii / 233微機上解算14 . 1萬階方程組共迭代4993次（收斂至1 10 - 18角秒） ，花費機時28分47秒，與未進行系數調整相比，功效提高40多倍。
  9. 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的總傳導率之比。
  10. Controlling time - specific and province - specific factors and serial correlation, we find there is conditional convergence of regional disparity for province - based rural development and internal disparity among the east, the middle and the west of china

    檢驗結果顯示，在考慮了時間和省份特殊效應、序列相關等因素的影響后，中國各省農村發展差距以及東中西部地區農村發展的內部差距均存在條件性收斂。
  11. 4. a 2 - d and 3 - d euler equations and n - s equations are solved using the cell - centered finite volume method and four - step runge - kutta scheme on the cartesian grids with standard convergence acceleration techniques such as local time stepping, enthalpy and implicit residual smoothing

    使用jameson中心有限體積法和runge - kutta時間推進方法，求解了關於二維、三維復雜流場的euler 、 navier - stokes方程，採用了當地時間步長、隱式殘值光順等多種加速收斂方法。
  12. Lastly, the dissertation designs a rank - reduced blind space - time 2 - d rake receiver using time extraction which has not only the capability of space - time equilibrium but also reduces the convergence time of adaptive array and the rank of correlated matrix of the received data

    最後，設計了一種時間抽取降秩盲空時2 - drake接收機。分析了其性能和參考信號的提取方法。該接收機不但具有空時均衡的能力，而且降低了陣列的收斂時間和接收數據相關矩陣的秩。
  13. The tc bit is set by the root for a period of max _ age + forward _ delay seconds, which is 20 + 15 = 35 seconds by default

    根橋設置的tc位所經歷的時間20 （老化時間） 15 （轉發延遲時間） 35秒，再加上根橋的轉發延遲時間15秒，所以一般來說默認的收斂時間為50秒。
  14. Researchers also noticed that while there was a trend toward convergence of per capita incomes between the richer and poorer members of the organization for economic cooperation and development ( oecd ), the gap between the developed and the developing countries widened

    研究人員還發現當經濟發展與合作組織（ oecd ）中的富裕國家和落後國家之間的人均收益水平差距趨于收斂時，發達國家與發展中國家的差距則越大。
  15. The results show that bayes algorithm performs well in combining radar information for target identification because the need of prior probability is not too strict. but for bayes method, the robustness is not so well as that of d - s method

    結果表明， bayes方法對先驗信息的精確程度要求並不十分嚴格，能較好地解決雷達情報綜合問題，而d - s方法比bayes方法更具有穩健性，但是其收斂時間較長。
  16. The main studying contents and achievements in this dissertation are presented as follows. based on the analysis of the selective harmonic elimination pwm mathematical model, an equivalent newton iteration solving method about the switching angles nonlinear transcendental equation set is presented. the algorithmic convergence time is enormously reduced and the algorithmic convergence ability is highly increased

    本文的主要研究內容和成果如下：通過對單相特定消諧pwm數學模型的分析，提出了關于開關角非線性超越方程組的等效轉化牛頓迭代解法，極大地縮短了演算法收斂時間，提高了演算法的收斂性，為特定消諧pwm開關角的工程計算提供了新的方法。
  17. Two popular statistical - based techniques, namely, bayes and dempster - shafer methods are applied to develop radar target identification algorithms for our application. the performance of bayes method and d - s method is compared in convergence time and robustness

    運用兩種普遍使剛的統計推斷方法? bayes方法和d - s證據理論對以上空中目標進行識別，比較了它們的收斂時間和穩健性。
  18. This thesis introduces the key technique of the us military distributed information system, with focuses on algorithms about related navigation of military tactics. kalman filtering combined with least square method is proposed for the current military development stage. the method of observation result including velocity component minimizes the convergence time, improves the positioning precision and acquired satisfied experiment results, which makes the pla independence of the us high - tech equipments

    本文簡要介紹了現階段美軍在戰術信息分佈系統實現中所採用的關鍵技術，重點對戰術飛機相對導航的各種實現演算法進行了深入探討，針對我軍當前在該系統領域中的技術現狀，提出了以最小二乘法輔助卡爾曼濾波，濾波過程中觀測量加入速度分量的方法，縮短了導航濾波起始階段的收斂時間，提高了定位精度，在工程上取得了較理想的實驗數據，在一定程度上擺脫了我軍在相對導航領域對美軍先進技術裝備的依賴。
  19. It is widely adopted in a lot of applications, such as multimedia conference, intelligent robot, speech enhancement, etc. adaptive eigenvalue deposition algorithm aeda is one of the effective methods for its robustness performance of noise and reverberation. however, aeda is suffered from its slowness in tracking variation of time delay of arrival tdoa as well as its sensitivity to initial value

    針對傳統的自適應特徵值分解時延估計演算法收斂時間慢對初值敏感以及不能有效跟蹤時延變化等問題，提出了一種改進的自適應特徵值分解時延估計演算法，該方法通過改進初值設定方法，有效改善了對時延變化的估計。
  20. The proposed algorithm is called agvf snake algorithm. when deformable models are used to extract brain contour from the head mr images, problems associated with initialization and time consuming iteration limit their utility. to overcome these problems, a region based variable expansion force is proposed

    對于可變形模型對初始輪廓的依賴較大，外力的作用范圍有限，迭代演算法收斂時間較長等問題，提出了一種新的外力，我們稱之為基於區域的可變膨脹力（ regionbasedvariableexpansionforce ） 。
分享友人
分享到 Line

分享到臉書