概略更新率 的英文怎麼說

中文拼音 [gàilüègēngxīnlǜ]
概略更新率 英文
crude renewal rate
  • 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
  • 略 : Ⅰ名詞1 （簡單扼要的敘述） summary; outline; brief account; résumé: 節略 memorandum; aide mémoire;...
  • 更 : 更副詞1. （更加） more; still more; even more 2. （再,又） further; still further; furthermore
  • 新 : Ⅰ形容詞1 （剛出現的或剛經驗到的） new; fresh; novel; up to date 2 （沒有用過的） unused; new 3 （...
  • 率 : 率名詞（比值） rate; ratio; proportion
  • 概略 : outline; summary
  • 更新 : renew; replace; renovate; update; renewal; angenesis; restoration; regeneration; kainogenesis; tu...
  1. To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5

    詳細分析了與rwa相關的光網路關鍵技術，包括傳輸、交換、組網等，重點研究了光交叉連接的功能和結構、性能，對其引入的串擾進行了詳細分析，選擇恰當的器件參數進行了數值模擬，並提出了抑制措施（如雙重濾波、優化判決門限、選擇恰當的復用波長數） ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題（光網路類型、業務類型、流量類型、光網路生存性） 、 r認人演算法的分類和比較，具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法，提出預置光路的概念，對網路資源進行狀態分類（佔用、未佔用、預置） ，利用改進的r認叭演算法模擬，預置光路可為部分新到的連接請求快速建立連接，從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法，提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數，利用基於波長分層圖模型的并行r場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。
  2. In order to identify the dependent relationship between words based on statistics efficiently and accurately, this paper has rectified part of the shortcomings of present algorithms by making the best of the distribution characteristic between words, distinguishing the collocation, coordinate and affiliation relationship between words, identifying them respectively by different strategies, presenting a new module of matching between strings and a new module of dependent intensity between words, constructing the tree of dependent relationship, pruning the constructed tree of dependent relationship and identifying some latent dependent relationship

    摘要本文擴展和改進了現有的詞語間依存關系定量識別演算法，充分考慮詞項概率分佈的影響；明確區分詞項之間的搭配關系、並列關系和從屬關系，針對它們不同的特點，提出不同的識別演算法；提出字串匹配模型；充分考慮兩個詞項之間相互位置的離散分佈和距離的影響、以及它們的概率分佈特性，提出詞項間的依存強度模型，並據此構建詞語間依存關系樹；提出更新策略，對已經建好的依存關系樹進行裁剪，並挖掘出潛在的依存關系。
  3. Pso is simple and efficient, so many researchers have been attracted by this algorithm, and furthermore, it converges fast by moving each particle aimed at guides when it deals with single - objective optimization, and these features are important in multi - objective optimization also. from some current research works, we describe a multi - objective particle swarm optimization algorithm ( mopso ) that incorporates the concept of the enhanced - dominance, we present this new concept to update the archive, the archiving technique can help us to maintain a sequence of well - spread solutions. a new particle update strategy and the mutation operator are shown to speed up convergence

    目前，國內外已有部分相關研究成果，但是它們在解集分佈性、收斂性方面仍存在不足，在吸取已有成果的基礎上，本文提出了一種改進的多目標粒子群演算法（ mopso ） ，使用我們提出的強支配概念構造外部種群，使解集保持良好的分佈性，同時，通過採用新的全局極值和個體極值的選取方式及採用新的種群更新策略加快解集的收斂，提出基於快速排序的非支配集構造方法加快演算法運行效率。
  4. Finally, genetic optimization research is summarized on several typical production scheduling problems. after expounding the general idea of genetic algorithm, the comparative advantages in contrast to the traditional algorithm, the basic characteristics of genetic algorithm and its theoretical base, the paper puts emphasis on the efficiency of genetic algorithm in the scheduling of flow shop, and puts forward an improving genetic algorithm : the ordinal genetic algorithm based on the heuristic rules. the new algorithm introduces into the initial group the solution of heuristic algorithm, and in the group structure adopts a strategy of first ordering according to the priority of the adaptive solution, and then defining a new way of choosing probability by segments, which provides more hybridizing opportunity for optimized individuals, and designs variation - control rule to prevent single population and partial optimal solution

    在論述了遺傳演算法的思想、與傳統搜索演算法的比較優勢、遺傳演算法的基本特徵和遺傳演算法的理論基礎（包括模式定理、隱含并行性、基因塊假設、欺騙問題和收斂性定理）后，重點探討了遺傳演算法在flowshop調度問題中的潛力和有效性；結合啟發式規則，提出了一個改進的遺傳演算法?基於啟發式規則的有序遺傳演算法，新演算法在初始種群中引入了啟發式演算法的解，在種群結構上採用了先按適應值優劣排序再分段確定選擇概率的新策略，使優質個體有更多的雜交機會，在變異中設計了變異控制規則，以防種群單一化，而陷入局部優化解。
分享友人
分享到 Line

分享到臉書