概率計演算法 的英文怎麼說

中文拼音 [gàilǜjìyǎnsuànfǎ]
概率計演算法 英文
calculus of probability method
  • 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
  • 率 : 率名詞（比值） rate; ratio; proportion
  • 計 : Ⅰ動詞1 （計算） count; compute; calculate; number 2 （設想; 打算） plan; plot Ⅱ名詞1 （測量或計算...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 概率 : [數學] probability; chance概率論 probability theory; theory of chances; 概率曲線 probability curv...
  1. And then facing the problem of the channel estimation of the adaptive modulation system, we conclude out the channel estimation algorithms on maximum likelihood ( ml ) estimation and maximum a posteriori ( map ) estimation under the condition of flat fading channel and selective fading channel in detail. to meet flat fading channel, we simulate the relationship of the ratio between the error covariance in map estimation and ml estimation and pilot symbol message length. the conclusion can be drawn from these results

    接著，對自適應調制系統中的通道估計問題難點，詳細推導了平衰落通道條件下和選擇性衰落通道條件下最大似然（ ml ）估計和最大后驗概率（ map ）估計演算法，針對平衰落通道，我們模擬了map估計和ml估計的方差與導頻符號長度的關系，模擬結果表明，錯誤方差受多譜勒頻率的變化影響最大，並且對實際的自適應調制系統，導頻符號長度的取值超過20個符號長度時， map通道估計明顯優于ml通道估計。
  2. This dissertation uses genetic algorithm to choose optimum parameters for the widely used pid controllers. in the optimization calculation process, mutation rate, cross rate and parameter range are adaptively changed to accelerate optimization process

    本文用遺傳演算法優化工程中廣泛使用的pid控制器的參數，採用變參數區間、變交叉變異概率等方法提高計算速度，並對適應值函數進行了改進。
  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. 3, on the base of the traditional spatial filtering, the author present, a new despeckle algorithm, that make use of iterated processing and correlated neighbourhood model, iterated filtering method of the sar image combining the correlated neighbourhood model with maximum a posteriori filter. first, a series of templates refecting direction information are established and every template is present for a kind of neighbour structure. then on the basis of sar images statistical property, the maximum a posteriori estimate of the real intensity under observation image values is got by bayes formulatio - n

    3 、針對傳統空間濾波器的不足，引入迭代處理和相關鄰域模型的概念，提出了基於相關鄰域模型的最大后驗迭代濾波。該演算法引用一系列反映局部邊界特徵的鄰域模型，以描述圖像的細節。引入強度的先驗概率分佈模型，利用bayes方法，對各個結構進行實際強度的最大后驗估計。
  5. Turbo codes represent the new code structures, which consist of pccc ( parallel serially convolutional code ) and sccc ( serially concatenated convolutional code ). in this paper, the background of turbo codes are firstly introduced, which includes the base principle of error correction code 、 block code and convolutional code ; the principle of turbo code and the iterative decoding is secondly expanded ; the key decoding algorithm : a revised map algorithm and iterative decoding theory are detailed ; then, a new turbo code structure : hccc ( hybrid concatenated convolutional code ) is presented, and the capacity of this code method is analyzed, the average capacity upper bound is derived ; at last, this code is simulated on awgn ( additive white gaussian noise ) channel and rayleigh fading channel

    本文首先介紹了turbo碼的背景知識，包括差錯控制的基本原理、分組碼和卷積碼；然後闡述了turbo碼的基本原理，包括turbo編譯碼器結構及迭代譯碼原理；較為詳細地描述了關鍵的譯碼演算法： ?種改進的最大后驗概率（ map ）譯碼演算法及迭代譯碼演算法；提出了一種新的turbo碼結構：混合turbo碼（混合級聯卷積碼） ；並用編碼性能聯合界分析方法對混合turbo碼進行了性能分析，得出了其平均性能上界；並在高斯白噪聲通道和瑞利衰落通道上分別作了一些應用研究及計算機模擬實驗。
  6. We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix

    首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。
  7. The acs algorithm inspired by the ants foraging principle is used to solve the problem of the homogenous frequency enlargement of design flood in this paper, the sketch of ants foraging about design flood computation is constructed and retailed process is provided

    摘要採用蟻群acs改進優化演算法求解了典型洪水同頻率放大問題，構造了用於設計洪水過程求解的螞蟻覓食概化結構圖，並給出了具體求解思路和流程。
  8. A systematic summary of previous work has been given first. then this paper presents a novel multi - stage face detection algorithm, which makes a good use of human face pattern ' s valuable information in colour image sequences. the difficult detection task has been divided into four steps : the preprocessing, which is to gain skin colored regions with human skin color model ; the roughly detection and face region refining by elliptic curve fitting ; the fine detection with facial features " detection and location ; the face / non - face classification step based on pca and gaussian density estimation technique

    本文對彩色序列圖像中的人臉檢測和跟蹤技術進行了深入的研究，其具體內容為：對近年來的研究工作進行了系統的介紹；提出了一個由粗到細的多階段的人臉檢測演算法，該演算法充分利用了序列圖像中人臉模式的各種有用信息，將復雜的檢測工作分為了四個部分：膚色區域分割預處理，人臉粗檢及利用橢圓擬和的人臉區域提煉，應用人臉基本特徵檢測和定位的人臉細檢， pca結合高斯概率密度估計的人臉驗證。
  9. In this genetic algorithm, each member in a supply chain alliance has a self - adaptive ability to changes in environment in the genetic process through designing crossover probability and mutation probability

    該演算法設計了自適應交叉概率和變異概率，使每個個體在遺傳過程中對環境變化具有自適應調節能力。
  10. Taking load uncertainties, infeasibility problem and multiple objection of the reactive power optimization in the radial distribution system into consideration, loads are modeled as fuzzy interval numbers. fuzzy power flow is proposed based on fuzzy interval load for the more practical membership function of line losses rate and maximal voltages offset. this thesis presents multiple objection model of the reactive power optimization considering uncertainties using the fuzzy set theory

    對配電網電壓無功優化問題中負荷的非概率性的不確定性問題、多目標問題、約束不可行性問題進行了研究，用模糊區間來描述實際的負荷情況，並用負荷的模糊區間值計算配電網的潮流，得到有功功率損耗和電壓的模糊區間值，使網損率和節點電壓最大偏移量的隸屬函數更接近實際情況；將改進遺傳演算法與模糊集理論相結合，通過求解多目標函數和約束條件的模糊集合的交集，得出網損率和節點電壓最大偏移量最小的最優運行狀態。
  11. 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

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  12. The adaptation processing includes linear prediction coefficient adaptation and adaptation of quantization step size for residual signals. based on g. 726, we adopt a huffman coder to make use of probability statistic of bit cascade covering n ( n 1 ) samples generated from adpcm, in order to further reduce the bit rate. ng is lossless entropy coding, the speech quality of our improved algorithm should be same as that of g. 726 standard

    我們的研究和改進工作包括:研究最優非均勻自適應量化器，及其自適應演算法;研究波形預測函數，以及函數零點、極點的自適應演算法;基於每n （ n 1 ）個樣本所對應符號的概率統計，對預測殘差量化值再進行huffman編碼，進一步降低比特率。
  13. The theory and the implementation of the genetic algorithms are discussed in detail. the question on how to choose the crossover probability, the mutation probability, the scale of population and the numbers of the generation is discussed. then, the mathematics model of the optimal design is established

    詳細介紹了遺傳演算法的理論和實現技術，探討了交叉概率、變異概率、群體規模、進化代數等變量的選取問題，建立起了基於遺傳演算法的深基坑支護結構設計的優化模型，結合彈性地基梁有限元法，利用fortran語言編制了gafortran優化程序，程序中包括普通遺傳演算法和改進遺傳演算法。
  14. A concept - based approach is expected to resolve the word sense ambiguities in information retrieval and apply the semantic importance of the concepts, instead of the term frequency, to representing the contents of a document. consequently, a formalized document framework is proposed. the document framework is used to express the meaning of a document with the concepts which are expressed by high semantic importance. the framework consists of two parts : the " domain " information and the " situation background " information of a document. a document - extracting algorithm and a two - stage smoothing method are also proposed. the quantification of the similarity between the query and the document framework depends on the smoothing method. the experiments on the trec6 collection demonstrate the feasibility and effectiveness of the proposed approach in information retrieval tasks. the average recall level precision of the model using the proposed approach is about 10 ? higher than that of traditional ones

    為了獲取詞語在文章中的語義權重，解決詞語的同義、多義模糊問題，提升信息檢索的效率，提出了一種基於概念的檢索模型，模型中設計了一種形式化的文本內容表示框架，框架由2部分構成:文章的"領域"以及"情景與背景"信息，並由概念（形式化語義）加以表示.同時，提出了提取該概念框架的方法，給出了用於框架與檢索要求間匹配的兩階段平滑演算法.實驗表明，在trec6提供的小規模語料集下，採用所提出方法的信息檢索模型與傳統模型相比，平均召回準確率提升了約10 ? ，效果顯著，充分說明了基於本文描述方法構建的、以概念作為處理中介的信息檢索系統的有效性和可行性
  15. The researches show that the probability method for calculating the cavity dimension of injection mold is more reasonable than the extreme calculation method which is widely adapted now

    研究表明，概率法計算注塑模成型零件工作尺寸比廣為採用的極值計演算法更為合理。
  16. It ' s a pity that although there are many papers and articles focused on data mining published every year, most of them deal with data mining concept and abstract algorithm theory, it is hardly to see their real implementation and application, in this context, when i was in my graduate exercitation in a company in beijing, which focus on developing supermarket software, i joined and completed an olap ( online analytical processing ) project, merchandise analysis and sale report system, which based on microsoft analysis service and microsoft sql server. i also design and implement three important algorithms : merchandise association rule algorithm based on multi - level merchandise category, supermarket member customer shopping frequent sequence generating algorithm, customer classification ( decision tree ) algorithm which based on information entropy and conditional probability tree, and they all achieve expected result

    本文作者在實習期間，參與並完成了基於微軟分析服務器的銷售分析與報表系統；並在公司即將開始的數據挖掘項目中，完成了多個重要演算法的設計和c + +程序實現：基於多層分類商品樹的商品關聯規則演算法，會員顧客的購物頻繁序列模式產生演算法；基於信息熵理論和條件概率樹的會員顧客分類（決策樹）演算法，並分別使用數據進行了測試，取得了較好的結果。
  17. Secondly, the paper shows the results from a great number of experiments of the weight algorithm that chooses samples by probability. the experiments point out that weight algorithm has a better generalization ability than the no weight algorithm. but a single weight algorithm is unstable and it needs tremendous time of calculation to combine many single algorithms into a stable one

    其次對按概率取樣本的有權值演算法進行了大量實驗，實驗結果顯示出按概率選擇樣本權值演算法比無權值演算法的總體性能更為優秀，但其個體演算法的不穩定性以及為了獲得穩定結果所需要的巨大計算時間使其不可能成為一種能廣泛應用的演算法。
  18. This paper studies 3 kinds of algorithms : the viterbi algorithm, multiresolutional algorithm based on wavelet transformation and bayesian bootstrap algorithm. the viterbi algorithm is based on the hidden markov model theory and it is a kind of map estimation, this paper studies this algorithm and puts up an algorithm that suits for filtering in the presence of interference. multiresolutional algorithm takes full advantage of multiresolutional data, we can see it has a better filtering ability than the traditional filtering methods ; bootstrap algorithm is a recursive bayesian estimation, it describes the probability density function by the samples, so it can be used to nonlinear non - gaussion filtering, the simulation result of the two groundings is presented

    Viterbi演算法以隱馬爾可夫理論為基礎，是一種最大后驗概率估計方法，本文對該演算法進行了研究，給出了一種適合於非高斯干擾條件下的濾波方法；多分辨分析方法充分利用到了多解析度測量數據所包含的信息，從模擬結果中可以看出，該方法的濾波精度要高於傳統的濾波演算法；自主濾波方法是一種遞推貝葉斯估計演算法，它利用采樣點來描述目標狀態的概率密度函數，因而適用於非線性、非高斯條件下的濾波，本文分別對這兩種情況下的濾波進行了模擬。
  19. Based on the formers, this dissertation efficiently selects the face features abstracting using ica. with no decline of recognition rate, the feature dimension is reduced, so the course of recognition is accelerated. support vector machine pattern recognition method is based on vc dimension theory, adopting the srm principle and considering training error and the generalization ability, which has shown many special advantages in dealing with small samples, non - linear and pattern recognition in high dimension

    本文採用基於矩陣s的人臉表示方法，將ica特徵選擇的概念和演算法用於人臉特徵的提取和優化，在不影響識別率的情況下，降低了特徵維數，提高了識別速度；支持向量機（ svm ）模式識別方法基於vc維理論，採用結構風險化原理，兼顧訓練誤差和泛化能力，在解決小樣本、非線性及高維模式識別問題中表現出許多特有的優勢；對于多類問題，介紹並採用了「一對一」的策略進行svm分類器設計；對于圖像預處理，詳細介紹了幾何歸一化的演算法步驟。
  20. Its computational complexity for positive region and reduct is o m 2 - tm n instead of o m - tm n 2 in discernibility - matrix - based approach, and is not over o n 2 for other concepts in rough sets, where m and n are the numbers of attributes and objects respectively in a given dataset also called an - it information system in rough sets

    由於reduct是給定信息系統屬性集合的一個屬性子集， reduct可以考慮為特徵選擇的一個解答，因此， reduct理論的另一個可能應用是特徵選擇。無論是情報分析還是特徵選擇，關于這些應用的一個共同要求是，有關計算reduct核以及reduct理論中其它概念的演算法效率必須高。
分享友人
分享到 Line

分享到臉書