次平均收斂 的英文怎麼說

中文拼音 [cìpíngjūnshōuliǎn]
次平均收斂 英文
convergence in the th mean p
  • 次 : Ⅰ名詞1 （次序; 等第） order; sequence 2 [書面語] （出外遠行時停留的處所） stopping place on a jou...
  • 平 : Ⅰ形容詞1 （沒有高低凹凸 不頃斜） flat; level; even; smooth 2 （高度相同; 不相上下） on the same l...
  • 均 : Ⅰ形容詞（均勻） equal; even Ⅱ副詞（都; 全） without exception; all
  • 收 : Ⅰ動詞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...
  1. The improved algorithm not only inherits the fast convergence trait from rls and realizable systolic array from qr _ rls, but also eliminates square - root operation and gets directly equalizer output signals from systolic array. so this algorithm has more simple operation, faster executing speed, less hardware resource and lower hardware cost. some different equalization algorithm are imitated on the qpsk communication system with multipath channel

    其次對一些成熟的自適應均衡演算法（如lms演算法、 rls演算法、 qr _ rls演算法、逆qr _ rls演算法）進行了分析;介紹了一種改進后的無平方根的qr _ rls演算法，該演算法不但繼承了rls的快速收斂特性和qr _ rls演算法的systolic陣列可實現性，還取消了qr _ rls演算法的平方根運算，使演算法在硬體實現時運行速度更快，佔用資源也更少，同時該演算法還可由systolic陣列直接得到均衡后的輸出信號，運算量更小。
  2. In this thesis we mainly study degenerate - times integrated operater families and its applications to abstract cauchy problems, and we study the mean ergodicty theorems and the convergence rates of ergodic limits and approximation for k - regularized resolvent families

    本文我們主要研究退化（ r ） -次積分預解運算元族及它對抽象cauchy問題的應用，並且研究k -正則預解運算元族的平均遍歷定理和遍歷極限的收斂率。
  3. The paper puts forward the clustering algorithm includes : clustering based on grid and iterative, enhanced clustering algorithm base on density and k - medoids, enhanced k - means algorithm ( optimize chooseing consult _ points in iterative process ), enhanced clustering algorithm base on distance. they can overcome many limitations ( some traditional algorithms terminate in local optimization. many results of cluster are roundness, too many times in partition iterative process ), which are related to the static architecture of traditional model

    在傳統聚類演算法的基礎上，結合我們科學數據挖掘的應用對象?分子動力學數據，提出了迭代網格聚類演算法， k -平均和基於密度結合的聚類演算法，迭代過程中優化選擇中心點的k -平均方法，以及改進型的基於距離的聚類演算法等模式識別方法，能夠解決傳統演算法帶來的諸多問題（比如一些傳統的聚類演算法常常收斂于局部最優，發現都模式都趨近於球形，劃分方法中迭代次數過多帶來的效率問題） 。
  4. Meanwhile, we also study the convergence behavior of iterative detection in different methods, which are the proposed average source entropy and the covariance matrix perturbation characterized by the variations of its dominant eigenvalue as well as the conventional approach based on the mutual information

    為了分析迭代譯碼的收斂特性，本文從不同角度出發，在研究了傳統的互信息方法的基礎上，本文首次提出並使用了平均信源熵和用協方差矩陣最大特徵值表徵其抖動這兩種方法，使迭代過程的收斂分析變得簡單方便。
  5. This article gets some good results on the two - order markov chains on the base of the studies of one - order markov chains : in infinite experiment, the frequency of times of stationary state is accessing to transition probability. the indication function which is the times of appearance is a special function, so this paper in forth chapter continue to study more general function regarding to two - order markov chains, which is the property of the function of two - order markov chains. in chapter five, this paper study the convergence of cesaro averages for two - order morkov chains

    在大量試驗中，固定狀態出現次數的相對頻率可以用條件概率來加以說明，它是對一重馬氏鏈強極限性質的一個推廣；本論文進一步引入了有關二重馬氏鏈更廣泛的函數即二重馬氏鏈泛函，並研究了其強極限的性質；最後研究了二重馬氏鏈泛函的平均收斂性。
分享友人
分享到 Line

分享到臉書