演算法與性能 的英文怎麼說

中文拼音 [yǎnsuànxìngnéng]
演算法與性能 英文
algorithms & performance
  • : 動詞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 (性格) nature; character; disposition 2 (性能; 性質) property; quality 3 (性別) sex ...
  • : 能名詞(姓氏) a surname
  1. In order to compare performance of current feedback control with flux feedback control, the pid parameters optimization algorithm is designed based on genetic algorithm

    為了便於對採用電流反饋採用磁通反饋的懸浮控制進行比較,設計了基於遺傳的pid參數優化方
  2. 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具有良好的
  3. In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local

    本文首先對聚類分析的遺傳進行了研究,討論了聚類問題的編碼方式和適應度函數的構造方案,分析了不同遺傳操作對聚類和聚類效果的影響意義。然後對k - means中初值的選取方進行了分析和研究,提出了一種基於遺傳的k - means聚類改進(混合聚類) ,在基於均勻采樣的小樣本集上用k值學習遺傳確定聚類數k ,用遺傳聚類的聚類結果作為k - means聚類的初始聚類中心,最後在已知初始聚類數和初始聚類中心的情況下用k - means對完整數據集進行聚類。由於遺傳是一種通過模擬自然進化過程搜索最優解的方,其顯著特點是隱含并行和對全局信息的有效利用的力,所以新的改進具有較強的穩健,可避免陷入局部最優,大大提高聚類效果。
  4. An adaptive macroblock - group coding algorithm for progressive and interlaced video. in proc. iscas 2004, vancouver, may 2004, pp. iii - 969 - 972

    h . 264中的mbaff相比,提出的ambaff可以得到0 . 16db的平均編碼增益。
  5. We propose an algorithm, which integrate the shift invariance of redundant discrete wavelet transformation ( rdwt ) and the flexibility of multi - resolution motion estimation, to overcome the shift variance of dwt and get the precise motion vector. under the different code parameter, we take the proposed algorithm compared to several present algorithms, and experiment results have shown that proposed algorithm could leave less energy in the residual frames, get more precise motion vector and better reconstructed frames

    文章最後在不同的編碼參數下,將所提兩種傳統小波域運動估計作比較,根據實驗所得數據分析,發現所提上要優于另外幾種,具體體現在運動估計后所得殘差幀量更小,重構幀客觀主觀質量更高。
  6. This paper also makes many reforms on genetic algorithm, which include using the technology of the real number code, broadening the selecting space, punishment tactics, arithmetical crossover, dynamic mutation and combining genetic algorithm with grg method, so it brings faster searching velocity and better accuracy

    本文對遺傳作了很多的改進,採用了自然數編碼技術、擴大采樣空間技術、懲罰策略、術交叉和動態變異技術,並將遺傳grg有機地結合起來,改善了遺傳,充分地提高了搜索的效率和精度。
  7. However, the performance of a minutiae extraction algorithm relies heavily on the quality of the input fingerprint images

    然而,細節提取好壞輸入圖像質量有著密切的關系。
  8. 2 ) in the arithmetic of beamforming algorithm ( lcmv, etc ) in up link, some arith - metic meanings are compared and the differences exist in practical application in system tdd and fdd are particularly analyzed as well

    2 :上行鏈路中智接收的波束形成;對比了一些(如lcmvesb)的,並且詳細論述了tdd系統fdd系統在應用智天線上的不同。
  9. Therefore, in order to evaluate the performance of the two basic algorithms in detail, two typical mobile communication channel models ( cost 259 and t1p1 ) are employed for further detailed simulation, and the corresponding performance is evaluated by rmse and cdf. in this simulation, many relative parameters are examined, such as the cell size, the number of base stations taking part in the location service, equipment measurement errors, nlos effect, and the positions of bss etc. the simulation results show that, taylor algorithm and chan algorithm fit in various simulation environments

    為了詳細評價這兩種基本定位,本文就兩種典型移動通信通道環境模型( cost259和tip1 ) ,研究了多種參數對定位的影響,包括蜂窩小區的大小,參定位的基站個數,設備測量誤差,通道中的nlos誤差和基站排列方式等等。
  10. Comparison study between the constant modulus decision feedback equalizer ( dfe ) and several others is made on combating the frequency selective fading of uwac, and their tracking performance to time varying is also investigated

    ?針對水聲通道的頻率選擇衰落,對比研究了常數模判決反饋盲均衡其它幾種盲均衡。針對水聲通道的時變特,研究了該的跟蹤摘要
  11. 5. study of routing and wavelength assignment. compareing some alorithms ’ performance, one new routing algorithms is described in this thesis, which synthetically considers the effect of hops, network loads and link loads

    5 .研究了路由波長選路問題,對現有rwa進行了比較,提出了一種基於光通道跳數、整個網路負載以及鏈路負載綜合選路的,並對該進行計機模擬,模擬結果表明,該比far 、 fplc好。
  12. We provide an algorithm for the special case in which the jobs have two release times and prove that its worst case ratio is not more than 33 / 14

    就所有工件有兩個到達時間的且工件加工時間尺寸大小一致的排序給出,並證明了比不超過33 / 14 。
  13. 3 ) the instruction - level parallel calculation of streamlines on 3d curvilinear grids has been implemented firstly by using the streaming simd extensions ( sse ), which are a set of extensions of the intel pentium hi / 4 processor. compared with the conventional algorithm, sse - based algorithm coded by vector class library enhances performance about 55 %, and coded by inlined - assembly is about 75 %

    ) pentium ( pentium4 )處理器的流simd擴展( sse ) ,首次實現了3d曲線網格流線計的指令級并行,傳統相比,向量類庫編碼實現的sse提高了55左右,嵌入匯編實現提高了75左右。
  14. Then a kind of fuzzy - smith control strategies for a large dead - time system is studied and improved. the simulation results show that the fuzzy - smith control method has some excellent performances, which is suitable for systems with deadtime - varying parameters. considering that the conventional fuzzy has a shortcoming of invariable fuzzy rules, an algorithm of adjustable fuzzy rules based on a single neural cell is proposed in this paper, which is used for modifying the fuzzy control query table on - line

    本文分析了模糊控制、神經網路和常規控制存在的不足,研究了如何將各的優勢互補,相互融合,形成復合的自適應智控制;針對大時滯系統的特點研究了fuzzy - smith控制,並在前人基礎上做出了一定的改進研究,進一步提高了fuzzy - smith控制;又將常規pid神經網路有機結合,研究了單神經元pid控制:針對常規模糊控制不可調整模糊控制規則的局限,本文利用單神經元的自適應、自學習力對模糊規則庫進行了間接在線自調整。
  15. We give comparison of the two endpoint examination methods : double - gate thresh - hold method and energy - frequency - value method. experiments show that latter can partition the endpoint of noise speech better

    文中還比較了雙門限語音端點檢測方頻值端點檢測,實驗證實頻值端點檢測很好的區分含噪語音端點。
  16. The modified b - p, wb - p, is very efficient for the complicated application scenario, such as impsar, gpr, where the imaging system moves along a fluctuated path. a wb - p fast algorithm, named pure backprojection ( pb - p ), is presented

    提出了一種快速b - p,純反向投影( pb - p ) ,分析成像實驗均證明了所提出的較之b - p上有很大的提高。
  17. The new udp congestion control scheme has better performance than the other udp congestion control scheme such as tcp - friendly rate control ( tfrc ) protocol, especial in the throughput and tcp - friendliness. ( 3 ) based on the fluid - based data transmission, this thesis proposes a dynamic model for a simple ip network with a single bottle - neck link. we decompose the simple network into several basic parts and set up the corresponding dynamic models

    結合上述的ip網路系統模型,實現了對tcp / ip網路數據傳輸動態過程的描述,並通過matlab模擬ns模擬的實驗結果對比,驗證了tcp / ip動態模型的正確有效; 5 .基於上述tcp / ip數學解析模型,對現有的主動隊列管理策略進行了分析,提出了隊列管理策略的主要控制目標,然後設計了一種帶有非線補償的新的主動隊列管理策略,模擬顯示了該要優于目前的red 、 pl等
  18. In cellular envirorunents, because of the influence of several adverse factors, such as muitipath, non - line - of sight propagation, noise, interference and channel frequency characteristics, radio statistics measuremenis like tdoa, toa and aoa related to mobile position, the performance of location algorithms mny be significantly degraded and the position estimation of ms is inevitably biased

    在蜂窩網路環境中,由於受多徑、非視距傳播、噪聲、干擾和通道頻率特等多種不利因素的綜合影響,使tdoa 、 toa 、 aoa等移動臺位置有關的電波特徵測量值不可避免地出現較大誤差,從而使各種定位顯著下降,造成移動臺位置估計出現較大偏差。
  19. Then the paper analyzes the shortcomings of simple aco and proposes an approved aco algorithm, and then analyzes the intensification - diversification schemes of it. moreover experiments on dimacs benchmarks are run and the results show that the approved aco algorithm not only outperforms the simple aco algorithm, but also outperforms ea / g algorithm, the best genetic algorithm for mcp found so far

    此外還利用dimacs提供的最大團問題的基準實例,對改進的蟻群優化進行了測試,實驗結果表明,該不僅超過了簡單的蟻群優化,還超過了其機制類似的迄今為止最好的遺傳? ea / g
  20. In chapter 2, several feature extraction methods are discussed. one of these discussions is focused on corner point detection, a new effective detection algorithm is proposed, and compared with the traditional ways in experiments. besides, a set of definitions of the features used in on - line recognition is also given, together with the relational algorithms

    第二章對聯機識別中的特徵提取方進行了研究,首先對經典的幾種特徵點檢測進行了討論,分析了其優勢和不足之處,在此基礎上提出了一種新的檢測方,並經典進行了實驗比較,驗證了該;然後,給出了幾種用於聯機圖形識別的特徵定義,並對其中的幾種定義給出了相應的
分享友人