probability convergence 中文意思是什麼

probability convergence 解釋
依概率收斂
  • probability : n 1 或有；或然性。2 【哲學】蓋然性〈在 certainly 和 doubt 或 posibility 之間〉。3 【數學】幾率，...
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. 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的總傳導率之比。
  2. Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce

    因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。
  3. The classical probability limit theory researchs largely the weak convergence or strong approximation of partial sums of random variable sequences. there is a classical literature, such as [ 19 ], [ 37 ] about that

    經典的概率極限理論研究的對象主要是隨機變量的部分和的弱收斂性或強收斂性， [ 18 ] [ 36 ]就是這方面的經典文獻。
  4. Simple genetic algorithm gets local minimization too easily and converges slowly. to solve these problems, adaptive crossover rate that has reverse hyperbolic rel ation with the numbers of iteration is designed, and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relat ion to the numbers of iteration is put forward. the practical simulation results show that the adaptive ga has greater convergence speed and larger probability o f getting the best solution

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  5. The artificial neural net ( ann ) way is universal regard as one of the most effective ways of stlf. in this paper, some research is developed for stlf using ann ways in several parts : the first part is about the arithmetic of ann based on bp model, namely the advanced of traditional bp arithmetic, one alterable step and scale bp arithmetic based on comparability of model and probability of accepting bp arithmetic is used to enhances a lot the convergence rate of learning process of bp network, but also avoid the stagnation problem to some extent. it indicates that the ann ' s efficiency and precision by the way can be ameliorated by the simulation of real data

    神經網路方法在短期預測中已經被公認為較有效的方法，本文針對神經網路用於電力系統短期負荷預測的幾個方面展開研究工作：第一部分研究一般用於負荷預測的神經網路bp模型的演算法，即對傳統的bp演算法的改進，將一種基於模式逼近度和接受概率的變步長快速bp演算法應用到短期負荷預測，模擬結果表明該方法有效的改善了bp演算法收斂速度慢以及容易陷入局部最小點的缺點，從而提高了神經網路用於負荷預測的效率和精度。
  6. Two convergence theorems, which show that under suitable conditions evolution strategy asymptotically converges to a global minimum point with probability one, are given

    對于有界閉集上的連續函數，證明了進化策略以概率為1收斂（幾乎處處收斂）于優化問題的全局極小點。
  7. Moreover, some related topics of the algorithm are given, such as the focus on optimization, the relationship between the convergence and the events happened with small probability

    同時還對本文方法的一些特性（優化側重、收斂性與小概率事件的關系等）進行了實驗和分析。
  8. In this paper, we give an equal proposition of the convergence in probability and its some applications

    摘要給出了以概率收斂的一個等價命題及其應用。
  9. Through almost sure convergence of random variables, the probability convergence can be derived ; and further the weak convergence can be derived

    摘要由隨機變量序列幾乎處處收斂可推出其依概率收斂，進而可推出其依分佈收斂，可見判別幾乎處處收斂的重要性。
  10. The property of continuous function and the formula of probability addition to the convergence in probability of continuous function sequence of random vector is used

    摘要將依概率收斂的一維隨機變量序列的連續函數仍依概率收斂的結論推廣到隨機向量序列的情形。
  11. This paper gaves its equivalent propositions and proves that a. s. convergence of independent random variables ' s sum variables is equivalent to its probability convergence, and equivalent to its weak convergence

    給出了它的幾個等價命題，同時還證明了獨立隨機變量和序列幾乎處處收斂等價于依概率收斂，亦等價于依分佈收斂。
  12. In this paper, we give a kernel shape estimation of m ( x ) using variable bandwidth local linear refression approch, and discuss the asymptotic normality, the convergence rate of mean square and convergence rate with probability

    本文對上述模型，利用變窗寬局部線性回歸方法，給出了m （ x ）的核形估計，並討論了這一估計的漸近正態性、依概率收斂速度、和均方收斂速度。
  13. The two - stage modeling method takes into account the characteristics of software project risk management and software metrics data, integrates qualitative knowledge and quantitative data. to study the software project iterative process risk ’ s bayesian network model, the definition of cyclic bayesian network is presented, probability convergence property of directed cycle in cyclic bayesian network is proved and probability inference method is put forward

    論文在軟體項目迭代過程風險的貝葉斯網路模型研究中，定義了有環貝葉斯網路，證明了有環貝葉斯網路中有向環的概率收斂性質，給出了有環貝葉斯網路的概率推理方法。
  14. Based on the genetic algorithm ' s global searching capability with probability regulation and euclid ' s space distance metric to settle multi - objective, the algorithm that integrates multi - objective ' s decision - making into the modified genetic algorithm to solute the optimal model with discrete variables and multi - objective is proposed. during the algorithm ' s design, the euclid ' s space distance metric is proposed to transform the multi - objective problem into single objective problem. and some modified measure to fitness function and crossover probability and mutation probability are used to improve the performance of the algorithm and avoid premature convergence

    演算法設計過程中，利用歐幾里德空間距離準則和罰函數法，將含有約束條件的多目標規劃問題轉化為無約束的單目標優化問題；針對簡單遺傳演算法出現的早熟，構造隨進化代數動態調整適應度的適應度函數和隨個體適應度自適應調整的交叉、變異概率；提出比例選擇與精英保留策略相結合的選擇、兩點交叉和簡單變異的改進遺傳演算法。
  15. Equivalence theorem about weak convergence of probability measures ' convolution powers on locally compact groups

    局部緊群上概率測度卷積冪弱收斂等價性定理
  16. Through chaos optimization method embedded into the genetic algorithm. the algorithm with the combination the advantages of the genetic algorithm and chaos optimization method which need not the optimal problem function ' s differential and promote the ability of the genetic algorithm ' s locally meticulous search can be obtained with the faster convergence and the greater probability for the global solution. a chaotic sequence is inserted into the search procedure of genetic algorithm, which can overcome premature of the search by genetic algorithm and the speed of convergence is faster than standard genetic algorithm

    對遺傳演算法進行了理論分析，並且研究了遺傳演算法的設計與實現；利用混沌優化方法不依賴于梯度信息的性質，將其與遺傳演算法相結合，提出了一種求解連續不可微函數優化問題的混合遺傳演算法；基於對于符號動力系統的研究，利用混沌序列的遍歷性，將混沌序列引入遺傳演算法中，提出一種嵌入哈爾濱工程大學博土學位論文一混飩序列的遺傳演算法，該演算法有效地克服了標準遺傳演算法中的早熟現象，並且具有更快的收斂速度。 」
  17. Statistical convergence and probability measure

    統計收斂與概率測度
  18. Limit theorems for the integration of function sequence with respect to weak convergence probability measure sequence

    函數序列關於弱收斂概率測度序列積分的極限定理
  19. Strong convergence rate of recursive probability density estimator for na sequences

    負相協下遞歸密度估計的強收斂速度
  20. The major tasks include : ( 1 ) expand the schema theorem for ga. the schema theorem with binary coding advanced by professor holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding. ( 2 ) put forward replacing by the excellent chromosome ga ( recga ), superiority colony first ga ( scfga ) and improve the ga ; ( 3 ) make probability convergence analysis of recga using the theory of markov chain, random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga, modify the arithmetic and then conduct tests

    主要有以下幾方面工作： （ 1 ）將二進制編碼遺傳演算法的模式定理擴展到由有限整數、字母或取值個數有限的浮點數編碼，或它們混合編碼的遺傳演算法范圍； （ 2 ）提出最佳個體替換策略遺傳演算法（ recga ） 、優勢群體優先策略遺傳演算法（ scfga ） ，對遺傳演算法進行改進； （ 3 ）使用隨機過程理論markov鏈對recga進行了收斂性分析； （ 4 ）使用泛函分析理論壓縮映射原理對scfga進行了收斂性分析； （ 5 ）使用遺傳演算法設計了解決np類問題（排課問題）的測試程序（ cap ） ，並根據recga對演算法進行改進並進行測試。
分享友人
分享到 Line

分享到臉書