概率收斂 的英文怎麼說

中文拼音 [gàilǜshōuliǎn]
概率收斂 英文
converge in probability
  • 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
  • 率 : 率名詞（比值） rate; ratio; proportion
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 概率 : [數學] probability; chance概率論 probability theory; theory of chances; 概率曲線 probability curv...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. The cause is that depending strength of government only to hit lawless proprietor and safeguard consumer ' s leigitimate rights and interests is limited, because the proprietor can constringe the action of self due to the government strike it strongly in the short - term, but government can not be persisted over a long period of time because of the restriction of resources such as funds etc. in another aspect, if encouraging consumer to safeguard the leigitimate rights and interests of self, the probability that proprietor ' s tort occurs could reduce generally, moreover it is lasting

    本文首先從靜態的角度來分析消費者權益受到損害的原因。通過分析發現，單純地依靠政府的力量來打擊不法經營者、維護消費者合法權益的作用是有限的，短期中經營者會因為政府加大打擊力度而收斂自己的行為，但政府由於受經費等資源的限制，不可能長期堅持下去。從另一個角度，如果鼓勵消費者維護自身的合法權益，則經營者侵權行為發生的概率會降低，而且具有持久性。
  2. The newly exploration on the convergent character by probability

    依概率收斂性質的推廣
  3. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  4. The present paper firstly represents the model about random walks in time - random environments on the right line, then the studies about recurrence - transience criteria and limit theorem by using some relative theories of markov chains, and finally a center limit theorem of this random walks in the non - recurrence case

    摘要給出了半直線上時間隨機環境下隨機游動的模型，並利用馬氏鏈理論研究了該隨機游動的常返暫留準則和依概率收斂的大數定律，得到在非常返情形下的中心極限定理。
  5. 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的總傳導率之比。
  6. Another advantage, contrast to using convolutional codes or turbo codes, is its low complexity while maintain high ber performance because the check equations are used to terminate the both iterations. we develop the theoretical error free feedback bound for bpcm - id and predict the threshold for decder convergence using the extrinsic information ransfer chart ( exit )

    利用非正則ldpc具有不同度的信息節點概率密度演化的差異，對高階星座中具有較高級別的子通道提供額外的保護，可使迭代反饋判決時，星座子集擁有最大的無錯反饋歐氏距離調和均值，從而改善系統的迭代收斂特性。
  7. 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

    因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。
  8. 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 ]就是這方面的經典文獻。
  9. 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

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  10. 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演算法收斂速度慢以及容易陷入局部最小點的缺點，從而提高了神經網路用於負荷預測的效率和精度。
  11. In this paper, we give an equal proposition of the convergence in probability and its some applications

    摘要給出了以概率收斂的一個等價命題及其應用。
  12. According to probabilistic convergence of incomplete enumeration, the concept of near - implicit enumeration is proposed

    根據不完全枚舉的概率收斂性，提出近隱式枚舉的概念。
  13. Through almost sure convergence of random variables, the probability convergence can be derived ; and further the weak convergence can be derived

    摘要由隨機變量序列幾乎處處收斂可推出其依概率收斂，進而可推出其依分佈收斂，可見判別幾乎處處收斂的重要性。
  14. 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

    摘要將依概率收斂的一維隨機變量序列的連續函數仍依概率收斂的結論推廣到隨機向量序列的情形。
  15. 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

    給出了它的幾個等價命題，同時還證明了獨立隨機變量和序列幾乎處處收斂等價于依概率收斂，亦等價于依分佈收斂。
  16. It is proved that as the number of insured tends to infinity the average prospective loss random variable of this portfolio tends in probability to a certain random variable of which the approximate distribution function is derived

    證明了當保單數趨于無窮多時，平均損失變量按概率收斂于某一個隨機變量，推導得到了該隨機變量的近似分佈函數。
  17. 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 ）的核形估計，並討論了這一估計的漸近正態性、依概率收斂速度、和均方收斂速度。
  18. 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

    論文在軟體項目迭代過程風險的貝葉斯網路模型研究中，定義了有環貝葉斯網路，證明了有環貝葉斯網路中有向環的概率收斂性質，給出了有環貝葉斯網路的概率推理方法。
  19. In chapter 2, we present two extensions of the fundamental concepts - convergence order and efficiency index, which are needed to analysis the efficiency

    第二章，我們提供了用於分析演算法效率的兩個基本概念?收斂階和效率的擴充定義。
  20. The convergence of the pnn decision rule for the bayesian decision rule is proved with probability. an explicit formulation of pnn generalization ability is proposed. and the accuracy rate of a classification network is explained as the maximum likelihood estimation of the generalization ability

    證明了pnn的決策函數依概率收斂于貝葉斯決策函數;給出了pnn的推廣能力表達式;證明了一個分類網路的測試集正確率是該網路推廣能力的極大似然估計;給出了分類網路中需要的測試集數目表達式;證明了pnn推廣能力不大於由貝葉斯決策所帶來的正確識別率
分享友人
分享到 Line

分享到臉書