限間檢索 的英文怎麼說

中文拼音 [xiànjiānjiǎnsuǒ]
限間檢索 英文
between-limits search
  • 限 : Ⅰ名詞（指定的范圍; 限度） limit; bounds Ⅱ動詞（指定范圍, 不許超過） set a limit; limit; restrict
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 檢 : Ⅰ動詞1 （查） check up; inspect; examine 2 （約束; 檢點） restrain oneself; be careful in one s c...
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 檢索 : 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. Between - limits search

    限間檢索
  3. The results of research reveals the variation disciplinarian and the affected factor, defines the factor limiting the urban regional development. all these offer scientific references for reasonable city planning, municipal building project planning, reasonable arrangement of land use, the confirmation of land use intensity and the improving land use benefit. and a series of methods we have explored can apply the practical manipulation of grading and assessing urban land, which contribute to enhance working efficiency, shorten the time of evaluation, enhance the updating of urban land price, establish a system of dynamic superviso ry control and examination, and enhance accuracy and objectivity of urban land - rated evaluation

    再由球形檢驗和主成份分析、信度分析、多元回歸分析的技術路線，逐層遞深地解譯影響城市地價的主要因素及相互數量關系，其研究結果揭示了城市地價的變化規律和影響因素、明確了限制城市區域發展的因素，為合理的城市規劃，市政建設項目規劃，合理安排土地用途，確定土地利用強度，提高土地利用效益等提供了科學依據，同時探索的系列化方法可直接應用於城市定級估價的實際操作中，有利於提高工作效率，縮短估價時間，提高城市地價的現勢性，建立地價動態監控和測算系統，又可提高城市定級估價的準確度和客觀性，在理論上、學術和實踐上均有積極意義。
  4. An assistant trade controls officer of the customs and excise department was sentenced to 16 months imprisonment for accepting bribes totalling 82, 000 from a garment factory operator for providing restricted information on a number of textile companies under investigation, and staff duty rosters to facilitate the transporting of undeclared textile products across the border

    一名香港海關助理貿易管制主任，收受一名成衣廠商提供合共八萬二千元的賄款，以檢索有關多間被調查的紡織廠的限閱資料，並提供海關人員值勤表的消息，以協助該名廠商運送未報關的紡織品往內地，被判入獄十六個月。
  5. An assistant trade controls officer of the customs and excise department was charged for allegedly accepting 82, 000 in bribes for retrieving restricted information on the status of six companies which had been subjects of c e investigation, and providing information on the deployment of officers of the textiles tactical strike units of c e

    廉政公署落案起訴一名香港海關助理貿易管制主任，控告他涉嫌收受一名成衣廠商提供合共八萬二千元的賄款，以檢索有關六間曾被海關調查的公司的限閱資料，以及提供海關轄下紡織品突擊檢查課人員調動的消息。
  6. Firstly, we consider the 3d model retrieval problem under a limited time resource

    在這篇論文里我們首先考慮了在有限時間資源情況下的三維模型檢索問題。
  7. The method of model checking is a formal verification technique using the method of state - space search to verify if the behaviors of a given system ( the model ) satisfy a certain property that represented by temporal logic formulas, while the system presented as a kripke structure

    它通常採用狀態空間搜索的方法來檢測一個給定的計算模型是否滿足某個用時序邏輯公式表示的特定屬性。它是一個自動檢驗有限狀態並發系統的技術。
  8. 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模式匹配和有限自動機匹配的思想。
  9. According to some strategy, dcm divides frequent itemsets lk into three non - intersect subsets thus the generation of most candidates can be localized in each individual subset and some unnecessary interactions between subsets are avoided ; moreover, most of the cut - off actions are also localized in each subset and we do n ' t need to scan the whole set lk as before

    這樣，大部分候選項目集的生成可以分別在這三個子集上進行，從而避免一些子集之間的連接；同時大部分的剪枝也可以分別局限在每個子集上單獨進行檢索，避免在整個l _ k搜索而耗費時間。
  10. To search products by selecting recent developed time

    指定期限內的開發時間檢索最新開發產品信息
  11. Finally, we adopt the bottom up scheme to achieve the path match, and such a method not only could precisely locate the user demands but also would decrease the consumed time and improve the retrieval speed

    採用自底向上的查找方法實現路徑匹配，準確定位用戶的興趣需要，同時最大限度地減少檢索時間，提高檢索速度。
分享友人
分享到 Line

分享到臉書