遍歷定理 的英文怎麼說

中文拼音 [biànlìdìnglǐ]
遍歷定理 英文
ergodensatz ergodic theorem
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 定 : Ⅰ形容詞1 （平靜; 穩定） calm; stable 2 （已經確定的; 不改變的） fixed; settled; established Ⅱ動詞...
  • 理 : Ⅰ名詞1 （物質組織的條紋） texture; grain （in wood skin etc ） 2 （道理;事理） reason; logic; tru...
  1. The most plausible operatorial generalization of result of preceding paragraph is known as the "mean ergodic theorem for unitary operators. "

    前段結果可以推廣到運算元去，其中最近情近理的推廣是「單運算元的平均遍歷定理」。
  2. This paper has launched exhaustive analysis and study to every module of pll and its key part ( vco ) is also improved. the history of phase - locked technology and the actuality of research on it are introduced. and then beginning with the fundamental principles of a phase - locked system, we build the mathematical model based on the architecture of the traditional analog pll, and afterwards investigate some of its characters such as tracking, acquisition, noising, and stability

    本文在對鎖相技術的發展歷史和研究現狀調查研究的基礎上，從鎖相系統的工作原理入手，分析了鎖相環的數學模型，並以此為出發點對其跟蹤性能、捕獲性能、穩定性及噪聲性能等性能進行了較為深入的研究，對環路的各項參數指標進行了詳細的推導，得出了鎖相環數理分析的普遍結論。
  3. 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跟蹤性。
  4. 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 ） 。
  5. The introduction reveals if s value to the research of the development of zen, and of the development of thought of zen in china. the second chapter tries to solve the problems of the decision of the names of some manual scripts in dunhuang zen documents and some other problems. it clears the misunderstanding in a few important questions. the next chapter, stepping in from a researching and data - sorting - out view, discusses in details the writing symbols and their explanations in the zen documents and the mistakes often seen in proof - reading, etymological and semantic explanations of words and phrases

    第一章概要論述了敦煌禪宗文獻的內容、時代及研究的歷史與現狀，揭示了敦煌禪宗文獻在中國禪宗發展史、禪思想史研究方面的重要價值；第二章對敦煌禪宗文獻部分寫卷的定名及諸多問題進行了考論，澄清了已往對一些重大問題的錯誤認識；第三章從文獻整理與研究的角度切入，對敦煌禪宗文獻的書寫符號與釋讀、寫本的常見錯誤、校勘以及詞語考釋等作了詳細論述，揭示出釋讀校理敦煌文獻與研治敦煌學的普遍規律；第四章就敦煌禪宗文獻的語料價值，包括對大型語文辭書的局限性、失收詞語、釋義、溯源等問題的探討，為辭書編纂修訂和構建科學完備的漢語史提供了第一手資料。
  6. The most plausible operatorial generalization of result of preceding paragraph is known as the " mean ergodic theorem for unitary operators.

    前段結果可以推廣到運算元去，其中最近情近理的推廣是「單運算元的平均遍歷定理」 。
  7. 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 -正則預解運算元族的平均遍歷定理和遍歷極限的收斂率。
  8. 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遍歷性的定義，並證明了它們的相互關系和一些基本性質。
  9. 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 =仕工， 。
  10. May involve more computation than is obvious - when traversing a hash bucket to find a specific key,

    ，可能比表面上要進行更多的處理當遍歷一個hash表的bucket以期找到某一特定的key時，
  11. Our results show that the rate of correlation among the random variables of those output sequences are low although they are not independent ; in addition, the output sequences of those combined generators are homogeneous markov chains which are strictly stationary processes with ergodicity ; the output sequences of those combined generators are also proved to summit to the strong law of large numbers and the central limit theorem ; finally the computation formula of the rate of the accordance between the output sequences and input sequences of those combined generators is given

    我們的研究結論表明：雖然這些序列中隨機變量之間不具有相互獨立性，但它們的相關程度卻比較低；證明了「停走」生成器， km _ 1m _ 2型組合生成器和加法型組合生成器的概率模型輸出序列都是強平穩的和遍歷的齊次馬氏鏈；討論了這些序列的概率極限性質，證明了它們均服從強大數定律和中心極限定理；還分別給出了各類生成器的輸出序列與輸入序列之間的符合率的計算公式。
  12. It can be used in any complex environment, can locate all paths from transmitter to receiver which avoid redundant calculation, and it is a standard 3 - d forecast model ; in addition, it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently, the proagmme can back - search the virtual fountain tree when it is running. these operation increase the calculate speed and it result in the higher receive efficiency and precision. the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models. the comparsion result indicate the new model is a better model

    它可應用於任何復雜的傳播環境中，能找到發射機到接收機之間的所有電波傳播路徑而無須冗餘的計算，是一種準三維的預測模型；另外，從本質上講，它仍然是一種基於鏡像理論的點對點的射線跟蹤法，所以它無須進行接收測試；而且由於採用了反向演算法，運用數據結構中多叉樹的概念，先確定需要計算的場點位置，找出所有能從源點到達場點的射線，並且可一次性建立一個虛擬源樹，以後每次的計算只要通過對該樹進行後序遍歷即可，大大提高了運算速度，因而有較高的接收效率與精度。本文對該模型進行了相應的模擬，並將其預測結果與實測結果以及基於cost231經驗性模型和基於強力射線跟蹤確定性模型的預測結果進行了比較，結果表明了該模型的優越性。
  13. A number of tree - walking optimizations are built into this macro, giving you linear - o in big - o notation - efficiencies in processing a given sxml structure ; a naive approach could easily use more memory or cpu time. see resources

    這個宏對樹遍歷進行了一些優化，可以以線性效率用大o表示法為o （ n ）處理給定的sxml結構，普通的方法很容易會佔用更多的內存和cpu時間。
  14. Subsequently we analyze the isomorphism relationship between ergodic matrices and the corresponding permutation group. by defining the permutation symbol operation system of ergodic matrices, we constructed a union form to express all existed permutation algorithms

    通過在理論上分析遍歷矩陣和置換群的同構關系，定義了遍歷矩陣對應的置換運算和符號體系，再統一的框架下表達各種圖像置亂變換。
  15. Reich [ 2 ] proved the ergodic theorems to nonexpansive semigroups in hilbert spaces. takahashi and zhang [ 3 ], tan and xu [ 4 ] extended baillon ' s theorem to asymptotically nonexpansive and asymptotically nonexpansive type semigroups in hilbert spaces. recently, reich [ 6 ], bruck [ 5 ], oka [ 7 ] gave the ergodic convergence theorems for nonexpansive, asymptotically nonexpansive mappings and semigroups in uniformly convex banach spaces with frechet differentiable norm. li and ma [ 13 ] obtained the ergodic convergence theorems for general commutative asymptotically nonexpansive type topological semigroups in reflexive banach space, which is a great breakthrough

    Baillon [ 1 ]首先在hilbert空間的非空凸閉子集上給出了非擴張映照的弱遍歷收斂定理。 baillon的定理引起了很多數學家的興趣， reich [ 2 ]在hilbert空間中證明了非擴張半群的遍歷收斂定理。 takahashi和zhang [ 3 ] ， tan和xu [ 4 ]分別將baillon的定理推廣到漸近非擴張半群及漸近非擴張型半群。
  16. Branching query processing efficiency has also been promoted remarkably. thirdly, when processing simple path queries, this paper proposes methods that could locate the appropriate nodes

    第三、對于單路徑查詢的處理，本文提出的方法可以迅速定位出匹配查詢條件的結點，減少了需遍歷的節點數量，提高了查詢處理效率。
  17. In this paper, we brought forward the concept of ergodic matrix over finite field f _ q, simply discussed theory of finite field including property theory of finite field, calculation in finite field and construction from low - degree finite field to high - degree finite field. there are important applications in encryption because operations in the finite field has many characteristics such as without carrying bits, equal bits and without rounding error

    文中首先引入了遍歷矩陣的概念，接著對f _ q上遍歷矩陣的性質進行了分析，闡述了遍歷矩陣的判定定理，並根據遞推關系給出了構造f _ q上遍歷矩陣的演算法，最後提出了強壯矩陣的概念並初步探討了尋找強壯矩陣的演算法。
  18. ( 2 ) as an application of ( 1 ), in view of the vagueness in the proof of the theorem 2. 1 : " a continuous flow is uniquely ergodic on 2 - dimensional torus if and only if it has at most one periodic orbit " in [ 2 ], we give it a proof

    （ 2 ）作為（ 1 ）的應用，針對[ 2 ]的定理2 . 1 ： 「環面上無不動點的連續流是唯一遍歷的當且僅當它至多有一條周期軌」證明中所存在的含糊之處，我們給出了它的一個證明。
  19. Some fundamental methods in mathematical analysis are applied to prove the unique decomposition theorem : the distance between vector - valued pseudo almost periodic functions in metric spaces and almost periodic functions is an ergodic perturbation

    應用數學分析中的基本方法證明了唯一分解定理，即距離空間中的向量值偽概周期函數和概周期函數之間的距離是一個遍歷擾動。
  20. In this paper, we brought forward the concept of ergodic matrix over finite field fq, simply discussed theory of finite field including property theory of finite field, calculation in finite field and construction from low - degree finite field to high - degree finite field

    本文引入了有限域上n階遍歷矩陣的概念，對遍歷矩陣進行了初步的探討，給出了遍歷矩陣的一些定理及構造遍歷矩陣的遞推關系式，討論了其難破解性。
分享友人
分享到 Line

分享到臉書