algorithm comparison 中文意思是什麼

algorithm comparison 解釋
演算法比較
  • algorithm : n. 【數學】演算法；規則系統；演段。
  • comparison : n. 1. 比較，對照；類似。2. 【語法】比較法；【修辭學】比喻。
  1. This article discussed ar modeling method, capon method, music method and mn method four kinds of high resolution algorithms principle and has separately made the computer simulation in the ideal situation to the above four algorithms. through the comparison, the beam width of high resolution algorithm is much narrower than conventional beamforming method. then unifies the actual utilization, discussed the influence of time delay unbalance, time domain sampling, plane wave supposition and array element with scope and phase not identically to the beamforming and made the computer simulation

    本文首先討論了ar模型法、 capon法、 music法和mn法四種高解析度演算法的原理，在理想的情況下分別對上述四種演算法作了計算機模擬，通過比較，高解析度演算法的束寬比常規波束形成法窄得多;然後結合實際運用時的情況，重點探討了延時失配、時域抽樣、平面波假設和基陣的幅相不一致對波束形成的影響並做了計算機模擬。
  2. Then, by the comparison between aes and des algorithm, we draw a conclusion that aes algorithm with strong security performance can resist any cryptanalysis attack

    然後對分組加密演算法aes和des進行了全面的比較分析。結果表明aes演算法具有良好的安全性，能抵抗已知的任何密碼分析法。
  3. A comparison of two constraint propagation algorithms and an improved algorithm for disjunctive scheduling problem

    調度問題中兩類分離約束傳播演算法的比較及一種改進演算法
  4. The paper introduces a sorting algorithm, in the unsorted data sheet, firstly this algorithm counts the element that is smaller or equal to each element by comparison, then determines the location of element in the new sheet according to the above counted nummer directly

    摘要本文介紹了一種在待排序的記錄表中，通過兩兩比較先求出小於每個元素的元素個數，然後根據此個數直接確定該元素在排序后新表中的位置的排序演算法。
  5. The innovations of this thesis can be summarized into three points. firstly, the average relative velocity is introducd into a novel adptive weighted clustering algorithm as one important parameter of weight, then it increases the stability and self - adaptability of cluster head. secondly, a new approach to calculating weight is suggested by integrating subjective and objective factors. it is verified by comparison with other approaches to selecting weight. thus the velocity of weight responding to the changes of network topology is increased. finally, using a som neural network to create a classifying model enables every node to learn to identify by itself the role in manet

    本文的創新點有三個:首先本文在wca和aow分簇演算法的基礎上，引入了平均相對移動速度作為權值重要的參數，提出了一種新的基於權值的自適應分簇演算法，提高了簇頭在移動中的穩定性和自適應性;其次，提出了利用主客觀綜合賦權法確定權重的權值計算方法，通過與其他權重選擇方法比較，網路結構變化的權值響應速度得到了改進;最後，論文利用自組織特徵映射神經網路建立分類模型，使得網路中的節點可以自學習地確定簇中角色。
  6. 1, q 3, and at last prove the exisitence of ( q, m + n, n, m ) resilient functions when n > q ? 1. intelligentized ids methods, which can make the system more adaptability and self - studying, are important research directions of ids so far. in order to make the ids systems have better identifying ability and efficiency against new intrusions, we propose the intrusion feature extra - ction algorithm based on ikpca by studying the different kinds of intrusion detection feature extraction algorithm based on unsupervised learning, and then theoretically analysis the conver - gence of the algorithm. in addition, we validate the validity of the algorithm by means of experim - ents ; at the same time, through studying ica and neural networks, we propose fastica - nn ids, and then test the kddcup99 10 % date set to make comparison of kpca 、 ikpca and fastica algorithms in intrusion detection advantages and disadvantages

    為了使入侵檢測系統對新的入侵行為有更好的識別能力和識別效率，本文在研究了各種基於無監督學習的入侵檢測特徵提取方法的基礎上，提出了基於增量核主成份分析（ ikpca ）的入侵檢測特徵提取方法，並對該方法進行了收斂性分析，同時結合模擬試驗對其正確性進行了驗證;另外，本文通過研究獨立成份分析和神經網路，提出了基於快速獨立成份分析和神經網路的入侵檢測方法（ fastica - nnids ） ，並通過對kddcup99的10 %數據集的檢測比較了核主成份分析（ kpca ） 、增量核主成份分析（ ikpca ）和快速獨立成份分析（ fastica ）在入侵檢測特徵提取方面的優缺點。
  7. Strong and weak comparison on positive progression judgment convergence algorithm

    正項級數判斂法的強弱比較
  8. Based on the fact of generating the synthetic data using poisson distribution function and exponential distribution function, the performance of hy algorithm and the comparison among hy algorithm, apriori algorithm and dhp algorithm is experimented. these experiments include the one that compares the execution time using variant synthetic data and variant minimum supports, and the scale - up one that compares the execution time using variant transaction number and variant item number in synthetic data. finally the results of the experiments are analysed

    在構造基於泊松分佈函數和指數分佈函數的合西南交通大學碩士研究生學位論文第iii頁成數據的基礎上，對hy演算法的性能及其與apriori演算法和dhp演算法的比較進行了實驗，這些實驗包括針對不同的合成數據和不同的最小支持度，對各演算法的執行時間進行比較的實驗以及針對合成數據的不同的事務數和不同的項數對各演算法的執行時間進行比較的規模實驗，並對實驗結果進行了分析，反映出hy演算法具有良好的性能。
  9. 2 http : www. genome. washington. edu uwgc. 3 pearson w r. searching protein sequences libraries : comparison of the sensitivity and selectivity of the smith - waterman and fasta algorithm. genomics, 1991, 11 : 635 - 650

    由於需要排序得到最終的比對結果， megablast採用先計算分值然後輸出的串列過程，這樣還導致大量中間結果的積累出現內存消耗過大的情況。
  10. It also has comparison between kalman filtering algorithm and least square method in post - flight data processing

    在事後數據處理中，用最小二乘法與kalman濾波方法進行比較。
  11. The verification of the algorithm is performed using a gauss - distributed concentration ball and a stock wave at steady flow in an open channel. the comparison with an analytical problem solution shows that the precision and the stability of quasi - consistence hexahedral element method is as good as that of consistence hexahedral element method, better than that of the linear interpolating function method

    6 、比較分析了網格布置形式對圓管流動和臺階突擴流動計算結果的影響后表明，應在物理量梯度變化較大的區域適當加密網格，才能較好地模擬這些區域的流動特性以及壁面對整個流動的影響。
  12. The solution algorithm involves tracing the characteristic lines backwards in time from a upwind element of an interior point. two advanced mehtods, quasi - consistence and consistence hexahedral element method, for three - dimensional advective problem are developed. and comparison of these two methods with linear interpolating function method is implemented

    當re 400時，流動明顯地具有二維性； re 800時，流動具有一定程度的三維性，而且出現了次迴流區； re 1000時，流動則具有明顯的三維性。
  13. This paper firstly introduces the phylogeny and actuality of tide - power stations ; the development style of them ; and then, establishes the mathematics model of optimal regulation of tide - power stations ; narrates how to use eq, dynamic programming, genetic algorithm to solve the problem of optimal regulation of tide - power stations individually ; makes comparison of three kinds of methods, pointing out the excellence and weakness of each method ; discusses some particular problems of tide - power stations, differing from normal water power stations. besides, this paper uses vb to develop an optimal regulation software which can be used in all tide - power stations

    本論文首先介紹了世界潮汐電站的發展史及發展現狀；潮汐電站的建庫方案；然後建立潮汐電站廠內經濟運行和短期優化調度的數學模型；在此基礎上，進一步使用等微增率法、動態規劃法和基因遺傳演算法來求解潮汐電站優化調度問題，並對三種方法作了比較，指出各自的優缺點；論文也探討了潮汐電站優化調度中不同於常規水電站優化調度的特殊問題的處理方法。
  14. Thirdly, the process of this algorithm is described in detail, and a comparison of the dc - dispersion results among different size of window functions is made

    然後詳細講述了這種消色散演算法的具體實現步驟，並且比較了在選取不同長度的時間窗函數的情況下，消色散的處理過程和殘余色散量。
  15. Using optimal power flow based spot price algorithm / software, the effect of the interruptible load management and the installation of shunt devices on handling the transmission congestion was analyzed, and then, an analysis was carried out in comparison with transmission congestion contract ( tcc ) based transmission congestion management strategy

    用基於最優潮流的節點實時電價演算法及軟體，分析了用戶側可中斷供電管理和電網無功補償設備對消除傳輸擁擠的作用，並與通過傳輸擁擠合同的管理方式進行了比較。
  16. The comparison results show that the left edge algorithm can only resolve the channel routing problem without vertical constraints, while the greedy channel router can accomplish the problem with vertical and horizontal constraints

    比較結果證明，左邊演算法只能解決不存在垂直約束的通道布線問題，而貪婪演算法在充分考慮垂直和水平約束的條件下能較好地完成布線。
  17. We put the emphases on the soft output viterbi algorithm ( sova ), which is one of turbo code ’ s decoding algorithms, and presents the derivation and computation step of the sova decoding algorithm. after presenting sova and map decoding algorithms and analyzing four kinds of decoding algorithms, the paper makes a comparison among the different decoding algorithms by emulation analysis, and analyzes the time complexity of various algorithms, and then contrasts them. in the last part of this paper, according to the criterion recommended by the consultative committee for space data systems ( ccsds ), including code rate,

    根據空間數據系統顧問委員會（ ccsds ）為turbo碼應用於深空通信系統推薦的標準，包括碼率、碼塊大小、分量碼類型、約束長度、碼生成多項式，以及交織器的選擇等參數的建議以及sova譯碼演算法的理論基礎，設計了sova演算法的實現結構，通過模擬驗證了本文所採用的turbo碼的性能，從而證明turbo碼確實是一種很好的通道糾錯編碼方式，它適用於要求功耗低或信噪比低的深空通信系統中。
  18. Based on collected and read literatures, this paper gives the analysis of its characteristics, architecture, security problem, qos problem, and comparison among present popular wireless ad hoc routing algorithm as well. 4. according to the characteristics of wireless network situation of wearable computer, this paper comes up with a wireless network frame for wearable computer based on lsr ( link state routing protocol )

    （ 4 ）結合可穿戴計算機無線網路環境的特點，在對自組網路由選擇演算法比較分析的基礎上，提出了一種適用於可穿戴計算機無線網路的基於混合路由策略的lsr （ linkstateroutingprotocol ）路由協議的框架，它能夠根據網路拓撲結構變化的不同程度在先應式和后應式路由策略之間進行自然平滑的切換。
  19. In order to find out a novel fuzzy inference algorithm being superior to cr1 algorithm and a novel fuzzy neural network, the author deduces nine kind of triple i algorithms by nine fuzzy operators. further more, the author compares these algorithms with the ordinary intuitional rules respectively and gives a conclusion that rl - type triple i algorithm is rather more closely to the intuitional rules. because fuzzy neural networks require the conditions of continuous and differential on membership functions of fuzzy sets and fuzzy operators of fuzzy inference, by means of comparison study, the author obtains a conclusion that the fuzzy neural networks with production operator and cr1 inference algorithm are very fit to study the problem of control

    為了找出優于cri演算法的模糊推理方法和新型模糊神經網路，本文首先對常用九種模糊運算元給出了具體三i演算法，並從模糊推理的另一個方面，考察了各種演算法對日常直觀模糊推理規則的貼近程度，得出「 r _ l型三i演算法貼近日常直觀推理規則」這一結論；同時，考慮到模糊神經網路要求「網路輸出保持對模糊運算元和隸屬函數連續性、可微性」這一特性，通過比較研究，得出利用乘積運算元和cri推理的模糊神經網路最適合控制問題。
  20. Sequential quadratic programming ( sqp ) method is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocities, accelerations, and jerk. algorithm comparison of flexible polyhedron and sqp is done to show the good quality of sqp

    在速度、加速度、加速度變化率的約束條件下，使用二次規劃法獲得了運動總時間最短時的關節軌跡，將所用演算法與現有演算法對比表明了所用演算法的優化性。
分享友人
分享到 Line

分享到臉書