convergence in probability 中文意思是什麼

convergence in probability 解釋
概率性收斂
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  • in : adv 1 朝里，向內，在內。 A coat with a furry side in有皮裡子的外衣。 Come in please 請進來。 The ...
  • probability : n 1 或有；或然性。2 【哲學】蓋然性〈在 certainly 和 doubt 或 posibility 之間〉。3 【數學】幾率，...
  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 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演算法收斂速度慢以及容易陷入局部最小點的缺點，從而提高了神經網路用於負荷預測的效率和精度。
  4. In this paper, we give an equal proposition of the convergence in probability and its some applications

    摘要給出了以概率收斂的一個等價命題及其應用。
  5. 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

    摘要將依概率收斂的一維隨機變量序列的連續函數仍依概率收斂的結論推廣到隨機向量序列的情形。
  6. 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 ）的核形估計，並討論了這一估計的漸近正態性、依概率收斂速度、和均方收斂速度。
  7. 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

    論文在軟體項目迭代過程風險的貝葉斯網路模型研究中，定義了有環貝葉斯網路，證明了有環貝葉斯網路中有向環的概率收斂性質，給出了有環貝葉斯網路的概率推理方法。
  8. In chapter 2, a sort of genetic algorithm based on estimation range is presented. by the means of probability analysis, the convergence area of the optimal result can be estimated. in this way, the search range can be shrinked > the search precision can be improved and the quality of result can be ameliorated

    本文針對優化設計中的智能方法進行了研究，在本文的第2章，提出了一種基於區間估計的遺傳演算法，應用概率分析，通過對最優解的收斂區間進行估計，縮小了搜索范圍，提高了搜索精度，最優解的質量有所改善。
  9. 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對演算法進行改進並進行測試。
  10. 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

    在大量試驗中，固定狀態出現次數的相對頻率可以用條件概率來加以說明，它是對一重馬氏鏈強極限性質的一個推廣；本論文進一步引入了有關二重馬氏鏈更廣泛的函數即二重馬氏鏈泛函，並研究了其強極限的性質；最後研究了二重馬氏鏈泛函的平均收斂性。
  11. Su chun, shao qi - man solved the problem, we investigate the relations between the convergence of tail probability series and the existence of some type of the moment for partial sums of interchangeable random variables and positive monotone functions, we answer the three questions for interchangeable random variables, our results are new and we obtain a series of sufficient and equivalent results. in section 4 we give the law of interated logarithm for interchangeable random variables, and obtain the following main results

    藝闊8藝潤、藝側蘇淳、邵啟滿解決了pi ， ollorov提出的這一問題，這一節我們通過討論可交換隨機變量序列的部分和關于正值單調函數的尾概率級數的收斂性和某種形式矩的存在性之間的關系，回答了在一定條件下可交換隨機變量關于這三個問題的一些結果，這些結果是全新的，並得到了一系列充分性和等價性結論
  12. In the research of the algorithms and theory of temporal difference learning, a new class of multi - step learning prediction algorithms based on linear function approximators and recursive least squares methods is proposed, which are called the rls - td ( t ) learning algorithm. the convergence with probability one of the rls - td ( t ) algorithm is proved for ergodic markov chains, and the conditions for convergence are analyzed

    在時域差值學習（ temporaldifferencelearning ）學習演算法和理論方面，首次提出了一種基於線性值函數逼近的多步遞推最小二乘td （ ） （ rls - td （ ） ）學習演算法，並分析和證明了該演算法在求解遍歷markov鏈學習預測問題中的收斂條件和一致收斂性。
  13. But, pso convergence ' s speed become slow in latter iterative phase, and pso is easy to fall into local optimization. at present, some scholars improve base pso mostly using 3 methods : disperse algorithm, increase convergence speed, enhance particle ' kinds. in the paper, i put forward 2 methods aiming at local best resutl but not whole best result. i modify base pso using the last method. some scholars put forward times initializations, so i select best result after circulating some times to be a parameter of formula. first, put particle into some small region, and ensure every region having one paticle at least. second, every region ' s particle has probability transfer other regions. although increase running time, enhance particle ' kinds, decrese the probability of convergence far from whole best result. nerms ( network educational resource management system ) is one of the research projects in the science and technology development planning of jilin province. the aim of nerms is to organize and manage various twelve kinds of network educational resources effectively so that people can share and gain them easily and efficiently, so as to quicken the development of network education

    但粒子群演算法仍存在如下不足:首先在多峰的情況下，粒子群有可能錯過全局最優解，遠離最優解的空間，最終得到局部最優解;其次在演算法收斂的情況下，由於所有的粒子都向最優解的方向群游，所有的粒子趨向同一，失去了粒子間解的多樣性，使得後期的收斂速度明顯變慢，同時演算法收斂到一定精度時，演算法無法繼續優化，本文對原始粒子群演算法提出了二點改進方案: 1 .演算法迭代到一定代數后，把此時找到的全局最優解當作速度更新公式的另一參數（本文稱之為階段最優解）再進行迭代; 2 .每次迭代過程中除最優解以外的每個粒子都有一定概率「變異」到一個步長以外的區域，其中「變異」的粒子在每一維上都隨機生成一個步長。
  14. Convergence in probability

    概率性收斂
  15. Meanwhile, extend discussions are carried out on the general convergence of iga in the pure mathematical sense, iga is proved to be weakly convergent in the sence of probability, weakly convergent a. e.,

    同時在純數學意義上拓展討論，就iga的一般收斂理論進行分析，證明了概率弱收斂、幾乎處處弱收斂、漸進收斂等性質。
分享友人
分享到 Line

分享到臉書