替換演演算法 的英文怎麼說

中文拼音 [tìhuànyǎnyǎnsuànfǎ]
替換演演算法 英文
replacement algorithm
  • 替 : Ⅰ動詞1 （代替） replace; substitute for; supply [take] the place of 2 [書面語] （衰敗） decline Ⅱ...
  • 換 : 動詞1. （給人東西同時從他那裡取得別的東西） exchange; barter; trade 2. （變換; 更換） change 3. （兌換） exchange; cash
  • 演 : 動詞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 （標...
  • 替換 : replace; substitute for; displace; interchange; take the place of
  1. So it ’ s very important to do research in it. this thesis has a detailed analysis on common smt cache replace strategy and slot schedule strategy, and finds some deficiencies in their design. we propose a new cache replace algorithm, caducity cache replace algorithm

    本文詳細研究了常見的smt處理器中cache資源所應用的cache替換演算法，以及取指功能部件中所應用的線索調度策略，從cache替換演算法以及線索調度演算法這兩個角度，提出了幾種新的演算法。
  2. Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach

    保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。
  3. In geometry fitting, we introduce the scattered data interpolation technology, and by using the corresponding points on the shared boundary between the given facial mesh and the organ to be pasted, the facial mesh can be automatically fitted to the organ to be used. and in texture fitting, we extend the improved field - based morphing algorithm to the corresponding texture map, and with the preprocessing of the histogram - matching method we can obtain smooth replacing result in the texture map

    在紋理上，將改進的場變形演算法拓展到人臉模型對應的紋理圖上，不但完成了紋理圖中對應器官區域的替換，同時通過引入以點到邊界距離的函數為權重的線性插值，實現了在替換器官區域從目標圖像到源圖像的均勻過渡；又通過引入直方圖規定化的技術，解決了由於膚色相差較大而產生的邊界不能平滑過渡的問題。
  4. An error - tolerant algorithm in decoding module of mandarin continuous speech recognition is examined to correct substitution, insertion and deletion errors in acoustic recognition

    摘要本文研究了漢語連續語音識別音字轉換中的容錯演算法，以糾正聲學識別的替代、插入、刪除錯誤。
  5. Basing on the analysis of above two algorithms, we propose a new algorithm, rp - all - pairs, which uses a method of randomized project to find ungapped local alignments in genomic sequence with up to a specified fraction of substitutions

    在分析以上兩種方法的基礎上，本文提出了一種新的演算法： rp - all - pairs演算法。該演算法通過隨機投影發現基因組序列中含有特定部分的替換的無間隔局部對齊。
  6. The special replacemetlt algorithin of this information cache assures that the nodes in the cache are the k most overloaded nodes and the k most underloaded nodes in the cluster system

    信息cache通過特殊的替換演算法，保證兩個cache中的信息分別為系統中負載最大的k個超載節點的信息和負載最小的k個欠載節點的信息。
  7. Especially to strategy and state, there are deeper discussions. aided with strategy, we not only get its initial purpose of encapsulating a series of complicated algorithms so they can replace each other, but also grasp another advantage that it helps resolve the multiple - hierarchy problem in designing objects

    我們使用策略模式不僅達到了它的原始意圖? ?封裝一系列復雜演算法，使它們可以相互替換，而且體會到了另外一種益處? ?它有助於解決設計對象過程中「多重繼承」的難題。
  8. The performance metrics, access latency, throughput, hr hit ratio and bhr byte hit ratio are analyzed and discussed. simulations show that compared with caching only model, iwpcm can further improve the throughput, hr and bhr efficiently and reduce the access latency. the performance evaluation based on the spn model can provide a basis for implementation of web prefetching and caching and the combination of web prefetching and caching holds the promise of improving the qos of web systems

    對于緩存命中率和位元組命中率等性能指標，使用基於一階ppm prediction by partial match預測演算法，通過四種典型的緩存替換策略gdsf greedy dual size frequency ， gdsize greedy dual size ， lfu least frequently used ， lru least recently used在僅緩存模型和一體化模型中的應用驗證了一體化模型比僅緩存技術具有更好的性能。
  9. In addition, several way are adopted to optimize the one dimensional transform architecture. improving the architecture resulting from the standard lifting scheme reduces the critical path delay ; an embedded boundary extension algorithm is adopted instead of the standard symmetric extension and it ’ s easier to implement ; the pipeline technique is adopted to increase the speed of processing ; coefficients of the multipliers are transformed into csd forms and the multiplications are substitute by minimum shift - add operations

    改進了由標準的提升演算法得到的變換結構，減小了關鍵路徑上的延時;採用內嵌的邊界延拓來代替標準的對稱延拓，實現更加簡單;採用流水線技術顯著提高了處理的速度;把乘法器系數表示為csd形式，將常系數乘法優化為最少的移位加操作。
  10. According to the virtual endoscopy automatic navigation, using the two - distance field - based 3d center path finding algorithm to find the path, adopting the cylindrical approximation of tubular organs to replace the center path by several approximate cylinders, while using distance transformation that is substituted by euclidean distance to calculate the approximate cylinder ' s axis and radius, the algorithm can save much time

    摘要針對虛擬內窺鏡自動漫遊技術，利用基於雙距離場的三維中心路徑提取演算法進行路徑提取，採用管狀器官的圓柱狀近似，將中心路徑用多個近似的圓柱體代替，用距離變換代替歐式距離公式計算近似圓柱體的軸和半徑，節省了大量的計算時間。
  11. In order to help algorithm jump out of local max, simulating ant searching food strategy has been brought forward. it is designed based on ant ' s searching food behavior. its core is when algorithm enters into local max, put individuals to cross with idle individuals and replace those by spared individuals which do n ' t have cross with idle individuals

    為使演算法在陷入局部極優后能自動跳出，提出了模擬螞蟻覓食的執行策略，這種策略是模擬螞蟻覓食中不斷調整不斷轉移目標而啟發設計的，要點是在演算法進入局部極優后不再執行原有的交叉操作，而是與游蕩個體相交叉，未得到交叉的個體則以後備個體相替換。
  12. The driver may use several algorithms, including the lru least recently used replacement algorithm, to implement the caching scheme

    驅動程序可以使用多種演算法來實現緩存方案，包括lru （最近最少使用的）替換演算法。
  13. The synchronization control algorithm for entity set in ciao ( collaborative immersive architectural layout ) is amended. within the amended algorithm, semi - optimistic locking mechanism in ciao is replaced by token mechanism, and receiver - reliable multicast based on the father node number is proposed to enhance robustness of system. entities and avatars in scene are organized the structure of tree

    西南交通大學博士研究生學位論文第11頁改進了ciao （ collaborativeimmersivearchitecturallayout ）中實體組同步控制演算法，用令牌機制替換ciao中半樂觀鎖機制，並提出了基於父節點記錄的收端可靠多播演算法，即在每個實體的espdu （ entitystateprotocol ? dataunits ）中增加父節點的節點號，接收端根據父節點的節點號調整本地場景樹的結構。
  14. By studying the discrete fourier transform properties of the band - limited digital signal, the authors introduce alternating projection neural networks into the paper, expand apnn ' s application scope from real field to complex field, and present several important conclusions on apnn. analyzing and discussing network ' s tolerance to noise, convergence rate and the spectral leakage problem of the truncated signal expected to be extrapolated by using these conclusions, the paper presents an extrapolation algorithm for band - limited signals based on alternating projection neural networks. a lot of simulation experiments show that the algorithm is effective. in addition, the algorithm is also effective to spectrum extrapolation. owing to adopting network structure, the algorithm is prone to parallel computation and vlsi design, and consequently can satisfy real time military processing needs

    本文通過對頻帶受限數字信號的離散傅立葉變換特性的研究，引進了交替投影神經網路，並將其應用范圍從實數域拓廣到復數域，且給出了在復數域仍然成立的若干結論.運用這些結論，在對網路噪聲抑制、網路收斂速度及待外推信號因截斷而造成頻譜嚴重外泄問題的分析與討論的基礎上，提出了一種基於交替投影神經網路的外推演算法.模擬實驗表明該方法是行之有效的.另外，該演算法對頻譜外推同樣適用；由於它採用全互連神經網路結構，易於并行計算和vlsi實現，從而可滿足軍事上實時處理的需要
  15. The major tasks include : ( 1 ) expand the schema theorem for ga. the schema theorem with binary coding advanced by professor holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding. ( 2 ) put forward replacing by the excellent chromosome ga ( recga ), superiority colony first ga ( scfga ) and improve the ga ; ( 3 ) make probability convergence analysis of recga using the theory of markov chain, random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga, modify the arithmetic and then conduct tests

    主要有以下幾方面工作： （ 1 ）將二進制編碼遺傳演算法的模式定理擴展到由有限整數、字母或取值個數有限的浮點數編碼，或它們混合編碼的遺傳演算法范圍； （ 2 ）提出最佳個體替換策略遺傳演算法（ recga ） 、優勢群體優先策略遺傳演算法（ scfga ） ，對遺傳演算法進行改進； （ 3 ）使用隨機過程理論markov鏈對recga進行了收斂性分析； （ 4 ）使用泛函分析理論壓縮映射原理對scfga進行了收斂性分析； （ 5 ）使用遺傳演算法設計了解決np類問題（排課問題）的測試程序（ cap ） ，並根據recga對演算法進行改進並進行測試。
  16. To solve the problem of watermark encryption, a novel permutation operator is proposed, based on which the permutation scheme and the substitution scheme for watermark encryption are designed ; encryption algorithms in spatial domain and transform domain are proposed. the ciphered image can be jpeg compressed before it is transmitted, and low - distortion plain image can be obtained after decrypting the compressed encryption image

    為解決水印信息加密問題，我們在第三章提出混沌有序化運算元方法，設計了水印信息加密的置亂模塊和替代模塊;還給出了空間域和變換域數字圖像加密演算法，密文圖像可以經過有損壓縮再傳輸，經過解密得到低失真的明文圖像。
  17. Moreover, this theory can change the problem in non - linearity space to that in the linearity space in order to reduce the algorithm complexity by using the kernel function idea. svm have become the hotspot of machine learning because of their excellent learning performance

    由於採用了結構風險最小化原則代替經驗風險最小化原則，使得較好的解決了小樣本學習的問題；又由於採用了核函數思想，使它把非線性空間的問題轉換到線性空間，降低了演算法的復雜度。
  18. We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study

    根據johnson演算法和并行可替換機床優化調度演算法，構造了兩種可行的啟發式優化調度演算法，並通過數值計算，驗證了演算法的有效性。
  19. Using trace - driven simulation, the results show that acr algorithm is better than several traditional algorithms in staleness - hit rate, hence acr algorithm proves to be rational, effective and practical

    通過trace d yen4g擬實驗，結果表明acr演算法在陳舊命中比上均憂于傳統的幾個替換演算法，從而證明了新提出的acr演算法是合理、有效和實用的。
  20. We propose two replacement algorithm of disk cache in the hierarchical storage systems to put the really popular programs into the disk cache

    本文提出了兩種層次化存儲系統中的磁盤cache替換演算法。
分享友人
分享到 Line

分享到臉書