ergodic problem 中文意思是什麼
ergodic problem
解釋
脯歷經問題-
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的總傳導率之比。 -
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機上進行數值模擬計算，比較遍歷法和遺傳演算法的計算結果。 -
Then we brought out algorithm to construct ergodic matrix according to the recursion formula ( i ) and expatiate characteristic theorems about “ ergodic matrix ” by the numbers, the difficult problem and one - way ( trapdoor ) function based on the ergodic matrix over finite field. then we put forward the concept of strong matrix based on ergodic matrix according to a problem and the algorithm of finding and constructing the strong matrix of ergodic matrix. as one - way function played an important role in cryptography, we gave a new plan to realize application pattern in cryptology
基於單向函數在密碼學中的重要性，本文構造了基於遍歷矩陣的單向函數b = q _ 1 ~ aaq _ 2 ~ b ，並在此基礎上實現了包括密鑰管理協議、認證協議和智力撲克協議在內的五種典型的安全協議，同時就演算法的特點和攻擊特性進行了分析。
分享友人