比演演算法 的英文怎麼說

中文拼音 [bǐyǎnyǎnsuànfǎ]
比演演算法 英文
viterbi algorithm
  • 比 : Ⅰ動詞1 （比較; 較量高下、 長短、距離、好壞等） compare; compete; contrast; match; emulate 2 （比...
  • 演 : 動詞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 （標...
  1. And a station in california will predict rain less often than a station reporting the same conditions elsewhere in the country, because the algorithm takes into account the mediterranean climate on the west coast

    即使在同樣天氣條件下，比起美國其他地方來，加州的氣象站就不常預測降雨，因為演演算法已考慮到美國西岸的地中海型氣候。
  2. Experimental results show that the method is more accurate than normal region - based retrieval methods

    實驗證明與一般的區域檢索方法相比，該演算法有效的提高了檢索精度。
  3. For the problems of load balance between clusters, the author and his research team build a job migration management system which is able to work with dedicated job scheduling system of every cluster, set up the multi - cluster resource reserving plan and the mechanism to enable jobs to utilize the idle resources in whole cluster group by migrating, and formulates a algorithm to compare migrating destinations

    針對集群系統之間負載平衡問題，作者及課題組研製了集群系統間的作業遷移管理系統，實現了集群組之間的資源保障計劃和作業通過遷移利用集群組空閑資源的機制，制訂了遷移目標比較演算法。
  4. Vance bjorn, the company ' s co - founder, developed the key fingerprint - recognition algorithms in the early 1990s with fellow caltech student serge belongie, who is now an assistant professor at the university of california at san diego

    公司的共同創辦人比約恩與加州理工學院的同學畢隆吉（現為加州大學聖地牙哥分校助理教授）於1990年代早期開發出主要的指紋辨識演演算法。
  5. This algorithm can take a relatively long time to converge

    這個演演算法會花比較長的時間去收斂。
  6. With each user ' s sub - channel snrs, the transmitter then schedules the transmission to one particular selected with proportional fair scheduling algorithm

    發射端根據回饋的信噪比，採用比例調度演演算法選出期望用戶。
  7. Experiment illustrates that the method is simpler and more flexible, efficient and useful, compared with the previous methods

    實驗結果表明，與傳統的方法相比，該演算法極大地提高了挖掘效率。
  8. The system consists of five functional modules, sequence file management, sequence alignment algorithms selection, parameters setting, alignment result displaying, guide tree displaying, and so on

    其功能主要包括序列文件管理、序列比對演算法選擇、參數設置、比對結果輸出和指導樹查看等。
  9. Compared with the analytical expressions applicable to a few of special vibro - impacting systems only, the method provides a widely feasible way to solve the obliqu e - impact problems of various dynamic systems

    和僅適應于特定斜碰撞系統的解析形式的碰撞關系相比，該演算法為不同的力學模型提供了一種普適性的求取斜碰撞規律的思路。
  10. On it the dissertation shows a relatively best solve of database storage structures and corresponding match method by testing some projects

    在此基礎上通過對給出的幾個具體的存儲方案及相應的比對演算法的實際測試，得到一個相對較優的解決方案。
  11. With this representation, an improved algorithm for case similarity measurement is brought up here. it is used in the data mining algorithms for modeling the case feathers

    以此為基礎，對現在的領域無關的案例相似性比較演算法進行改進，在數據挖掘中基於該演算法建立案例特徵的描述模型。
  12. Experimental results show that this ep - trained mlp model can generate a chaotic series, whose attractor can be reconstructed better than that generated by the bp - trained mlp model and which generates many chaotic sequences by changing weights of this mlps very easily

    計算機模擬結果表明：該模型比bp演算法訓練的神經網路模型能更好地重構混沌吸引子，調整網路權值即可產生多種混沌序列。
  13. Based on fast pairwise sequence alignment algorithm named as ukkonen, a high efficient applied global pairwise sequence alignment algorithm is presented in this paper. the algorithm used the memory method of fa ( fast alignment ) algorithm for reference. the fa algorithm records element ' s origin relation while computing score matrix

    在經典的ukkonen快速序列比對演算法基礎上，借鑒fa演算法（ fastalignmentalgorithm ）在計算得分矩陣時記錄元素來源關系的存儲方法，運用在矩陣中尋找checkpoint點的checkpoint技術，研究了一種基於動態規劃思想的較為實用的全局雙序列比對演算法。
  14. The results are compared with the genetic algorithm in combination with the k - nearest neighbor ( knn ) classification rule

    最後，將比較的結果再與基因演演算法結合k個最近鄰法進行比較。
  15. In contrast to existing simplex method, this method has several peculiarities as follows : to begin with, applying it to solve linear programming problem. one need n ' t introduce any additional variable such as relaxing variable, artificial variable and other parameters, so that calculation is subtracted on a large scale. in addition to this, as a result of its higher degree of structuralization, this algorithm can be more easily transformed into program language and, of course, more quickly performed by computers

    與現有的單純形法相比，新演算法具有如下主要特徵：第一，求解過程不需要引進諸如松馳變量、人工變量等參變量參與運算，計算量大大減少了；第二，新演算法較單純形法的結構化程度高，更容易轉化為程序語言，進而在計算機上更快地得以實現；第三，新演算法在運算過程中不會引起攝動現象。
  16. It then briefly introduces the key techniques, such as xml ( s ), rdf ( s ), ontology, owl etc. we specially analyze the role of ontology in semantic web, and discuss the comparison algorithms between different version of ontology, and also, the merging algorithms of ontology from different sources. we have made some essential improvement to the algorithms, and also put forward a notation method to the integration of wsdl and ontology. we have applied our research to the uddi workflow and satisfactorily solved the many problems of traditional keyword - based searching method of uddi

    其中對本體和語義web的關系做了重點分析；接下來，我們討論了不同版本間本體的比較演算法，以及不同來源本體的合併演算法，並嘗試著做了一定的改進；然後，由於wsdl語言的缺乏語義，我們給出了一種注釋的方法，從而將wsdl與具有語義的本體結合起來；針對uddi僅能基於關鍵字來搜索的弱點，本文最後還討論了如何將前面所分析的本體匹配演算法和web服務描述的語義化方法應用於uddi的工作流程，並給出了一個dumf框架，在一定程度上提高了uddi的語義層次。
  17. Firstly, this thesis studied sequence alignment algorithms in detail, such as needleman - wunch algorithm based on the dynamic programming ( dp algorithm ), smith - waterman algorithm etc, and compared with their advantageous and disadvantageous

    首先，論文詳細研究了序列比對方法，其中包括needleman等人的動態規劃（ dp ）比對演算法、 smith - waterman演算法、以及部分多序列比對演算法，並比較了各自的優缺點。
  18. Overview of dna sequence alignment algorithms

    序列比對演算法的簡述
  19. The author also makes a comparison between lifting scheme and tst and find that lifting produces a complete new multiwavelet and uses no matrix division or singular matrixes and generally produces shorter new masks than the tst algotithm. so we choose lifting as our method to improve the multiwavelet ’ s property

    我們研究了提升和兩尺度相似變換，發現通過提升可以構造全新的多小波而且不需要矩陣分解和求逆，產生的掩模通常比tst演算法更短，因而選擇提升作為改進多小波性質的方法。
  20. Comparison of experimentation results created by different term selection methods, including pattern database processing and mutual information methods. 6. comparison and analysis with former people based on open corpus

    6 、在spamassassin公共郵件語料平臺上與前人的實驗結果對比， teiresias演算法具有較好的表現。
分享友人
分享到 Line

分享到臉書