樹檢索演算法 的英文怎麼說

中文拼音 [shùjiǎnsuǒyǎnsuànfǎ]
樹檢索演算法 英文
tree search algorithm
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 檢 : Ⅰ動詞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 （標...
  • 檢索 : retrieval; retrieve; search; searching
  1. Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  2. As an important component of the above researches, this paper covers following aspects : ? firstly, product design theories are summarized, status and development trend of machinery product design are analyzed, and application of knowledge based design method in machinery product design is put forward. ? kbe ( knowledge based engineering ) theories such as knowledge acquisition, representation and storage are discussed, kbe concept is integrated with ug secondary development technology, and design knowledge is induced and stored to establish the design knowledge base. ? product case representation is researched, a hierarchical tree type product case library for complex products is established, retrieve strategy for cases of the nearest filed is put forward and corresponding algorithm is given

    本文的主要研究內容及成果如下: ?對產品設計理論和方法進行了總結和概括，分析了機械產品設計的現狀和發展趨勢，將基於知識的設計方法應用到機械產品的設計中; ?研究了知識獲取、表達、存儲等kbe理論，並將kbe思想應用到ug二次開發中，將設計知識歸納存儲，建立了設計知識庫; ?研究了產品實例表示，建立了復雜產品層次樹狀產品實例庫，介紹了最近鄰域實例檢索策略並給出相應的演算法; ?研究了基於知識重用的三維產品建模技術，研究了在設計過程中的設計資源的重用，計算過程的重用，計算數據的重用，推理過程的重用等等;介紹了基於設計重用的凸輪三維模型的實現方法。
  3. So a fast pattern matching algorithm on mass string assemble has been proposed to solve the problem of fuzzy matching between a string pattern and a string assemble. to make the algorithm cost - effective in space and time, we have developed an optimized trie - tree structure to store the string assemble and introduced the knuth - morris - pratt ( kmp ) and finite - automata ( fa ) string matching thought to our algorithm. the algorithm has been describled in details and the cost of space and run time has been analized in the thesis

    為了實現漢字輸入碼的不完整輸入，解決帶有模糊輸入符的字元串模式與一個字元串集合之間的匹配問題，論文在第三章提出一種海量字元串集合的模式匹配演算法，給出了演算法的具體實現和復雜度分析，並且提出一種優化的檢索樹結構來存儲字元串集合以節省內存空間。為了提高演算法的運行速度，演算法還引入了kmp模式匹配和有限自動機匹配的思想。
分享友人
分享到 Line

分享到臉書