概率性收斂 的英文怎麼說

中文拼音 [gàixìngshōuliǎn]
概率性收斂 英文
convergence in probability
  • : Ⅰ名詞1 (大略) general outline 2 (神氣) manner of carrying and conducting oneself; deportment ...
  • : 率名詞(比值) rate; ratio; proportion
  • : Ⅰ名詞1 (性格) nature; character; disposition 2 (性能; 性質) property; quality 3 (性別) sex ...
  • : Ⅰ動詞1 (把攤開的或分散的事物聚集、合攏) put away; take in 2 (收取) collect 3 (收割) harvest...
  • : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
  • 率性 : levity
  • 收斂 : 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. 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具有不同度的信息節點密度演化的差異,對高階星座中具有較高級別的子通道提供額外的保護,可使迭代反饋判決時,星座子集擁有最大的無錯反饋歐氏距離調和均值,從而改善系統的迭代
  5. 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

    因為遺傳演算法具有全局隨機搜索能力,魯棒強、使用簡單和廣泛的特點,它不採用路徑搜索,而採用搜索,不用關心問題本身的內在規律,能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解,所以可以彌補神經網路學習演算法的不足,使陷入局部最小值的可能大大減少,使得速度提高,訓練量減小。
  6. 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 ]就是這方面的經典文獻。
  7. Its encoding way is also analyzed in this paper. we adopt sa to produce the initial packing, which ensure the parent generations are choiceness. the crossover ( pc ) can prevent the fitness individual to be abandoned, the probability of mutation ( pm ) can prevent the algorithm is convergent before premature

    文中對其編碼方式進行分析,採用模擬退火法產生初始布局,保證了父輩解群的優良,採用交叉pc有效地防止具有高適應度值的個體被排擠掉,變異pm防止了搜索在成熟前
  8. 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

    同時還對本文方法的一些特(優化側重、與小事件的關系等)進行了實驗和分析。
  9. According to probabilistic convergence of incomplete enumeration, the concept of near - implicit enumeration is proposed

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

    摘要由隨機變量序列幾乎處處可推出其依,進而可推出其依分佈,可見判別幾乎處處的重要
  11. 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 )的核形估計,並討論了這一估計的漸近正態、依速度、和均方速度。
  12. 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

    論文在軟體項目迭代過程風險的貝葉斯網路模型研究中,定義了有環貝葉斯網路,證明了有環貝葉斯網路中有向環的質,給出了有環貝葉斯網路的推理方法。
  13. An algorithm for detecting moving ir point target in complex background is proposed, which is based on the reverse phase feature of neighborhood ( rpfn ) of target in difference between neighbor frame images that two positions of the target in the difference image are near and the gray values of them are close to in absolute value but with inverse sign. firstly, pairs of points with rpfn are detected in the difference image between neighbor frame images, with which a virtual vector graph is made, and then the moving point target can be detected by the vectors ' sequence cumulated in vector graphs. in addition, a theorem for the convergence of detection of target contrail by this algorithm is given and proved so as to afford a solid guarantee for practical applications of the algorithm proposed in this paper. finally, some simulation results with 1000 frames from 10 typical images in complex background show that moving point targets with snr not lower than 1. 5 can be detected effectively

    基於運動點目標在鄰幀差分圖像中所具有的近鄰反相特徵,即運動點目標的兩個位置相鄰近、灰度值一正一負,提出一種在復雜背景下,基於紅外序列圖像的運動點目標檢測演算法.本演算法利用該特徵在鄰幀差分圖像中檢測反相點對,進而構造反相點對矢量圖,最後依據累積反相點對矢量圖中多矢量首位相接的連續檢測出運動的點目標.文中給出並證明應用本演算法能以1檢測到運動點目標的定理.對典型復雜背景下10幅1000幀圖像的模擬結果表明,當信噪比大於或等於1 . 5時,可以有效檢測出運動點目標
  14. Equivalence theorem about weak convergence of probability measures ' convolution powers on locally compact groups

    局部緊群上測度卷積冪弱等價定理
  15. In the first chapter, we narrate the characteristic of convertible bond, give some clues about development and actuality of the market and its pricing theory ; in the second chapter, we introduce modeling idea and some material problems in the model in detail, draw the yield curve which is very important to the model by spline method ; in the third chapter, we first explain the basic idea and convergent speed of monte carlo method, then, give the mathematical description for financial market, prove equivalence of non - arbitrage market, existence of risk neutral probability measure in the market and the price process of underlying asset is a martingale ; in the forth section, we introduce how to simulate stock price path by monte carlo method in detail, based on foregoing result, we prove the path is a martingale, thereby, the model is logical

    本文第一章先對可轉債的特點、市場發展和現狀及其定價理論的發展和現狀作一述;第二章詳細介紹了建模思想和模型中的一些具體問題,利用spline方法繪出了在模型中具有重要作用的益曲線;第三章首先敘述了montecarlo方法的基本思想和有關其速度的一些質,然後從數學的角度給出了對金融市場的描述,證明了市場無套利、市場存在風險中測度及標的資產價格過程為鞅的等價;在第四節中,對用montecarlo方法模擬的帶跳股價路徑作了詳細介紹,並利用前兩節的結論證明了模擬的帶跳股價路徑為一個鞅過程,從而保證了模型在理論上的合理
  16. The algorithm can implement the diversity of solution, avoid converging local optimal solution, and prevent the possibility of losing optimal solution effectively, by holding some optimal chromosomes in each generation and introducing expectation reproduction rate

    通過保留每代最佳的若干染色體以及引入期望繁殖念,本演算法可以實現解的多樣,避免于局部最優解,同時可以有效的防止在進化的過程中失去最優解的可能
  17. 7. for the purpose of analyzing its asymptotic convergence properties the evolution strategy procedures for real - valued function optimization are described. two convergence theorems, which show that under suitable conditions the evolution strategy asymptotically converges to a global minimum point with probability one, are given

    對于有界閉集上的連續函數,利用作者給出的一種簡潔的方法,證明了一類進化策略以為1(幾乎處處)于優化問題的全局極小點,為進化演算法的分析提供了一種新的模式。
  18. Pso is simple and efficient, so many researchers have been attracted by this algorithm, and furthermore, it converges fast by moving each particle aimed at guides when it deals with single - objective optimization, and these features are important in multi - objective optimization also. from some current research works, we describe a multi - objective particle swarm optimization algorithm ( mopso ) that incorporates the concept of the enhanced - dominance, we present this new concept to update the archive, the archiving technique can help us to maintain a sequence of well - spread solutions. a new particle update strategy and the mutation operator are shown to speed up convergence

    目前,國內外已有部分相關研究成果,但是它們在解集分佈方面仍存在不足,在吸取已有成果的基礎上,本文提出了一種改進的多目標粒子群演算法( mopso ) ,使用我們提出的強支配念構造外部種群,使解集保持良好的分佈,同時,通過採用新的全局極值和個體極值的選取方式及採用新的種群更新策略加快解集的,提出基於快速排序的非支配集構造方法加快演算法運行效
  19. Convergence in probability

    概率性收斂
  20. 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的一般理論進行分析,證明了、幾乎處處弱、漸進質。
分享友人