最優檢索演算法 的英文怎麼說

中文拼音 [zuìyōujiǎnsuǒyǎnsuànfǎ]
最優檢索演算法 英文
optimalsearchingalgorithm
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 檢 : Ⅰ動詞1 （查） check up; inspect; examine 2 （約束; 檢點） restrain oneself; be careful in one s c...
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 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 （標...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 檢索 : retrieval; retrieve; search; searching
  1. This dissertation deals with the content - based image retrieval ( cbir ) theory and technique ; some new features and tools for more concisely and discriminatingly charactering the content of an image are proposed, such as region - based color histogram, grey - primitive co - occurrence matrix, ratio of centripetal moment, ratio of eccentric moment and ratio of inertial moment. a new modified genetic algorithm is also described in this dissertation, which can upgrade the performance of standard genetic algorithm ( sga ) while used in image segmentation

    本文以圖像數據庫檢索為主線，討論了基於視覺內容的圖像檢索方法，提出包括基於區域顏色直方圖、灰度?基元共生矩陣及向心矩比、偏心矩比、慣性矩比的特徵描述方式；對遺傳演算法存在的早熟、收斂到最優解慢等問題提出了解決方法，並將改進遺傳演算法應用到圖像分割中，編制了相應程序。
  2. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  3. Our system model is a simplified one which is convenient for simulation experiment. our research is the first one which use optimal search theory to optimize the resource retrieval system. we focused on the optimal mobile agent dispatching, the initial searching parameters dicision and updating mothods. we extended ns2 network simulator to support mobile agent simulation and did several experiments under this simulation

    本文首次將最優搜索理論用於資源檢索系統的優化，通過在系統中增加最優分派器進行移動agent的最優分派，重點研究了使用最優搜索理論進行系統優化的方法，並對最優搜索演算法的初始參數確定、動態參數更新以及具體實現做了深入研究，實現了一致最優演算法。
  4. The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation

    該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。
  5. To manage large - scale xml documents with complicated structure, this dissertation focus on the efficient structural indexing algorithm for xml data, result size estimation problem for xml structure based query optimization, result relevance ranking algorithm, and infrastructure for xml query processing for both text - rich and data - rich xml documents. to address the aforementioned issues, this dissertation makes the following contributions. first, it investigates the drawbacks of existing indexing algorithm for xml data, and propose a dynamic indexing algorithm for xml data based on d - bisimilarity, difx

    為滿足結構復雜、大規模的xml數據管理需要，本文深入研究了xml信息檢索系統中的結構索引演算法設計和結構化查詢優化中的查詢代價估計問題，以及查詢結果和查詢條件間的相關度演算法，主要取得了4個方面的成果：第一，分析了已有的xml數據索引演算法中存在的問題，提出了一種高效的動態xml結構索引演算法difx ，它採用動態後向結構相似性（ d - bisimilarity ）的概念，可以根據實際查詢需求以及索引最優化的要求動態決定索引中保存的結構信息。
  6. Most of the music analysis and music information retrieval ( mir ) researches are based on structural information such as label, midi, or music notes etc. in this thesis we first improve and design a series of algorithms that based on a completely new view of music structure to automate analysis the music structure and label it after a consider comparison and analysis of the related researches before

    與音樂分析與檢索相關的研究大部分都是基於結構化信息如音樂標簽、 midi格式、樂譜等，針對實際音樂內容的分析與檢索的研究是最近三四年才出現的。本文針對實際音樂，從一個新的領域? ?音樂結構分析入手，對比分析以往研究的優點與不足，改進和設計一系列的新演算法實現了音樂結構自動分析和標注，並以此為基礎進一步研究了基於音樂結構的音樂檢索和文摘。
  7. By using of simulated annealing algorithm, attribute weights of hierarchy clustering model were optimized in terms of weights allocation quotas, which was used to improve the case retrieval efficiency and quality

    基於模擬退火演算法對特徵屬性的權重值進行優化，通過在相似度檢索模型中加入權值分配的指導信息，防止檢索出的相似度系數最大的事例並非最佳事例，提高了檢索的質量。
  8. The paper carries on the research of network topology, algorithm of state estimation and detection and identification of bad data, and applies the method of tracking search to network topology, semi - dynamic optimization to node numbering, algorithm of weighted least - squares with constraints to state estimation and rn to detection and identification of bad data. the calculation is made for jinzhong ' s electrical network according to its circumstances in shanxi

    本文對電力系統狀態估計理論中網路拓撲分析、狀態估計演算法、不良數據的檢測與辨識進行了研究，採用獨立於結線方式的跟蹤搜索法進行網路拓撲分析、半動態優化技術進行節點優化，帶約束加權最小二乘法進行狀態估計計算，標準化殘差進行不良數據的檢測與辨識。
分享友人
分享到 Line

分享到臉書