ergodic 中文意思是什麼

ergodic 解釋
theorem
  1. Though maximum likelihood detection ( mld ) can obtain optimum detection performance in mimo communication systems, the ergodic search increases the complexity exponentially with the number of the antennas, which lead to implemental difficulty

    在mimo通信系統信號檢測中，最大似然檢測（ mld ）可以獲得最佳的誤碼性能，然而遍歷式搜索方式使得mld的計算復雜度隨天線數呈指數形式遞增，在實際系統中，往往難以實時實現或者不能實現。
  2. The most plausible operatorial generalization of result of preceding paragraph is known as the "mean ergodic theorem for unitary operators. "

    前段結果可以推廣到運算元去，其中最近情近理的推廣是「單運算元的平均遍歷定理」。
  3. 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的總傳導率之比。
  4. We define a type of hyperbolicity on the full measure invariant set which is given by the oseledec ' s multiplicative ergodic theorem and prove that the system has the lipschitz shadowing property on it

    對于由oseledec乘法遍歷定理得到的滿測度（ fullmeasure ）不變集定義了雙曲性，並證明了系統在這個不變集上具有lipschitz跟蹤性。
  5. In this paper, we brought out the concept of “ ergodic matrix ”, and gave out the recursion formula ( ii ) which can construct the ergodic matrix q with n n dimensions using a vector with n dimension. that is, we can delegate n2 bits ergodic matrix q using n bits integer vector, at the same time save the complexity of space and time

    在此基礎上，本文對利用遍歷矩陣生成信息摘要以及利用它們實現一般數字簽名和具有仲裁方式的數字簽名的演算法及應用進行了相關的一些研究，對演算法的強度進行了分析，並用程序對演算法進行了驗證。
  6. One - dimension inundated area series is developed to multi - dimension inundated area series with reconstruction of phase space, and the multi - dimension series include ergodic information, so that more abundant information can be found in favor of ann training

    通過相空間重構，把一維成災面積時間序列拓展為多維序列，而多維序列包含著各態歷經的信息，從而可挖掘更為豐富的信息，有利於神經網路的訓練。
  7. A necessary and sufficient condition with ergodic of 1 - order probability distribution function of stochastic process ( theorem 1 and corollary 1 ) and extended the general distribution theorem of stochastic variable under the case of weakly condition ( theorem2 ) are presented

    摘要提出了隨機過程一階概率分佈函數具有遍歷性的一個充分必要條件（定理1和推論1 ） ，並在較弱條件下，對一般的關于隨機變量函數分佈定理作了進一步的推廣（定理2 ） 。
  8. We find a simple relation between the maximal ergodic subgroup and distal properties of algebraic actions and characterize the distal properties of zd algebraic actions. we also prove that if the group action is equicontinuous then ergodicity and topological transitivity are equivalent

    討論了離散群在緊群上代數作用的極大遍歷子群與distal性質的關系；給出了z ~ d代數作用的distal性質的刻畫；證明了離散群等度連續作用下，遍歷與拓撲可遷等價。
  9. In chapter 2. we research topologically ergodic maps

    第二章研究了拓撲遍歷映射。
  10. The most plausible operatorial generalization of result of preceding paragraph is known as the " mean ergodic theorem for unitary operators.

    前段結果可以推廣到運算元去，其中最近情近理的推廣是「單運算元的平均遍歷定理」 。
  11. 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 -正則預解運算元族的平均遍歷定理和遍歷極限的收斂率。
  12. In three part we study the ergodicty for k - regularized resolvent operator families including the mean ergodicty, abel - ergodicity and cesaro - ergodicity. we prove the mean ergodic theorems of k - regularized resolvent operator families. and we give out the definition of abel - ergodicity and cesaro - ergodicity for k - regularized resolvent operator families. moreover, we give the relationship between the two kinds of ergodicity and their basic properties

    我們證明了k -正則預解運算元族的平均遍歷定理。給出了k -正則預解運算元族的abel遍歷性和ces ro遍歷性的定義，並證明了它們的相互關系和一些基本性質。
  13. The ergodic properties of markov chains in random environments

    隨機環境中馬氏鏈的強遍歷性
  14. Ergodicity on ergodic measure product

    關于遍歷測度乘積的遍歷性
  15. Some ergodic results for markov chains

    馬氏鏈遍歷性的幾個結果
  16. In chapter 4, we consider the ergodic properties of group actions

    第四章，考慮離散群作用的遍歷性問題。
  17. As an application of the ergodic theory, we discuss the method of calculating a type of limits

    摘要作為遍歷理論的應用，討論一類極限的求法。
  18. Chapter 2 of this paper, by using a new method of proof, we obtain the weak ergodic convergence theorem for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by theorem 2. 1 of chapter 1 we get the weak ergodic convergence theorem of almost orbit for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by this method of proof, we give the weak ergodic convergence theorems for right reversible semigroups. by theorem 2. 1 of chapter l, we generalize the result to almost orbit case. so we can remove a key supposition that almost orbit is almost asymptotically isometric. it includes all commutative semigroups cases. baillon [ 8 ], hirano and takahashi [ 9 ] gave nonlinear retraction theorems for nonexpansive semigroups. recently mizoguchi and takahashi [ 10 ] proved a nonlinear ergodic retraction theorem for lipschitzian semigroups. hirano and kido and takahashi [ 11 ], hirano [ 12 ] gave nonlinear retraction theorems for nonexpansive mappings in uniformly convex banach spaces with frechet differentiable norm. in 1997, li and ma [ 16 ] proved the ergodic retraction theorem for general semitopological semigroups in hilbert space without the conditions that the domain is closed and convex, which greatly extended the fields of applications of ergodic theory. chapter 2 of this paper, we obtain the ergodic retraction theorem for general semigroups and almost orbits of asymptotically nonexpansive type semigroups in reflexive banach spaces. and we give the ergodic retraction theorem for almost orbits of right reversible semitopological semigroups

    近年來， bruck [ 5 ] ， reich [ 6 ] ， oka [ 7 ]等在具frechet可微范數的一致凸banach空間中給出了非擴張及漸近非擴張映射及半群的遍歷收斂定理。 li和ma [ 13 ]在具frechet可微范數的自反banach空間中給出了一般交換漸近非擴張型拓撲半群的遍歷收斂定理，這是一個重大突破。本文第二章用一種新的證明方法在自反banach空間中，研究了揚州大學碩士學位論文2一般半群上的（ r ）類漸近非擴張型半群的弱遍歷收斂定理，即:定理3 . 1設x是具性質（ f ）的實自反banach空間， c是x的非空有界閉凸子集， g為含單位元的一般半群， s =仕工， 。
  19. In the final part we concern with the convergence rates of ergodic limits and approximation for k - regularized resolvent families for a linear volterra integral equation. we give the ergodicty for k - regularized resolvent operator families at 0 and we also prove their basic properties by means of k - functional and relative completion. finally, we obtain some results of the convergence rates of ergodic limits and approximation for k - regularized resolvent families

    第四章我們主要研究了k -正則預解運算元族的遍歷極限的收斂率和逼近。藉助于k -泛函和相對完備化，給出了k -正則預解運算元族在0點的遍歷性，證明了一些基本性質。我們也證明了k -正則預解運算元族的遍歷極限的收斂率和逼近的一些結果。
  20. We found that the ergodic method used to calculate the symmetries of a multidimensional system would give rise to the computing complexity problem, hi order to avoid the computing complexity problem, we present a novel approach using genetic algorithms for calculating the permutation symmetries of a patterns set and the weight matrix of the network. we design the corresponding computer program with visual c + + 6. 0 language. and numerical simulat

    並用wsualc語言分別設計了求解網路連接矩陣和給定樣本集的置換對稱性相應的遍歷法和遺傳演算法的程序，在pc機上進行數值模擬計算，比較遍歷法和遺傳演算法的計算結果。
分享友人
分享到 Line

分享到臉書