索引法 的英文怎麼說

中文拼音 [suǒyǐn]
索引法 英文
indexing
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • : Ⅰ動詞1 (牽引; 拉) draw; stretch 2 (引導) lead; guide 3 (離開) leave 4 (伸著) stretch 5 (...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 索引 : index; indexing; key; repertory; subscript; concordance
  1. Report ucb csd - 01 - 1141, university of california, berkeley, usa, 2001. 8 cuenca - acuna f m, nguyen t d. text - based content search and retrieval in ad hoc p2p communities

    本文針對上述問題,提出對等數據系統中的摘要結構及建立在此基礎上的基於內容的近似查詢處理方
  2. The following example shows a simple way to defragment all indexes in a database that is fragmented above a declared threshold

    以下示例將展示一種簡單的方,對數據庫中碎片數量在聲明的閾值之上的所有進行碎片整理。
  3. It implements web crawling through distributed technology, and builds index database through accidence analyzing chinese characters separating unuseful words deleting etyma extracting index words selecting and lexicon. the level system uses new model of web accessing and level computation to build web level system so that the requirement for computer resources is greatly reduced

    該搜擎使用分散式技術實現網頁獲取模塊;通過詞分析、中文分詞、無用詞匯刪除、詞干提取、詞條選擇和詞典等技術建立數據庫;該搜擎的級別系統使用了新的網路訪問模型和級別計算模型,大大降低了搜擎對于計算機資源的要求。
  4. As it ' s proprietary, a large numbers of bibliography resource ca n ' t be provided to common readers of internet. along with the development of network technology, it has a instancy need to conversion marc format to the information that the browser can recognize. the language xml not only can expresses the metadata, but also can show the content of data. lt can provide individuation page layout

    Marc格式是目前圖書館館藏資源的主要表示格式,由於其專用性,使得目前大量的書目資源無通過一般的搜擎向internet用戶提供,隨著網路技術的不斷發展,迫切需要將marc格式的數據轉換成常用瀏覽器所能識別的信息,為大眾提供服務,可擴展標記語言xml不僅可以表達元數據,而且可以揭示數據的內容,提供個性化的頁面顯示,用xml語言對marc數據進行描述是解決這一問題的有效途徑,文章提供了marc數據的xml表示方和實現途徑。
  5. A coding scheme is proposed to eliminate the redundancy of output vectors in pyramidal lattice vector quantization ( plvq ). a fast algorithm of labeling lattice points and a fast algorithm of finding lattice points are presented. and the transmission priority in case of asynchronous transfer mode is suggested

    提出了一種與圖象本身無關的熵編碼方去消除金字塔格型矢量量化( plvq )的輸出冗餘:同時也提出了由格點輸出和由輸出格點的快速演算;而且還根據異步傳輸模式( atm )的特點,選擇了傳輸的優先級。
  6. Stay tuned for part 2, when i ll cover performance considerations for the queries themselves, including access methods, join methods, extents for tables and indexes, index levels, fragmentation and pdq priority

    第2部分仍然是調優,我將介紹查詢本身的性能考慮,其中包括訪問方、連接方、表和的區段、層次、分段以及pdq優先級。
  7. In general, search engines have turned away from metadata, and they try to hone in more on what s exactly perceivable to the user

    總之,搜擎擺脫了元數據的桎梏,它們設更多在對用戶的感受上努力。
  8. He opened his book of statues on the table and scanned the index.

    他打開桌子上的令全書查看
  9. In the proposed join algorithms, although some algorithms such as mpmgin algorithm [ 23 ], outperform standard rdbms join algorithms, they perform a lot of unnecessary computation and i / o for matching basic structural relationships, especially in the case of parent - child relationships ; other algorithms such as the stack - tree - desc algorithm [ 24 ], represent the state - of - the - art in structural joins, however, they do not utilize indexed structures but sequentially scan the input lists. thus, i / o ' s can be wasted for scanning element that do not participate in the join, and join speed can be influenced

    另外,在所提出的演算中,盡管有的演算,如mpmgjn演算[ 23 ]優于標準的rdbms連接演算,但是該演算為匹配基本的結構關系,特別是在父子關系情況下,執行了大量不必要的計算和佔用了大量的i / o資源;有的演算雖然代表了結構連接演算的先進水平,如stack - tree - desc [ 24 ]連接演算,但是它沒有利用結構而是順序瀏覽輸入列表。
  10. Management data, boston, usa, 1984, pp. 47 - 54. 3 beckmann n, kriegel h - p, schneider r, seeger b. the r - tree : an efficient and robust access method for points and rectangles. in proc

    對cdt來說,首先高維數據點通過k平均聚類演算得到若干類,然後分別計算該點對應的始點與質心距離,並且將這兩個距離通過線性組合得到該點的復合鍵值。
  11. Glossary by the international research institute for advanced buddhology of soka university. it has very detailed tables, guides and indexes. file size is more than 27mb

    第1 ? ) 》 ;縮略語表、符號表、均非常仔細,使用時請多參考做得很認真的用說明,詞典檔超過27mb ,下載會較需時。
  12. According to the study on case category, by applying the cooperation of the inductive indexing method and the near - neighbor method, the system entrance and the case shape retrieval of cbid system was realized

    根據系統案例類別研究的結果,本研究主要運用歸納索引法和最臨近相結合的檢,實現了cbid系統的入口和案例造型檢環節。
  13. First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine

    首先闡述了搜擎的工作原理,性能指標,主要技術;分析了現有目錄式搜擎的缺點,接著介紹了聚類分析演算與螞蟻演算的理論,並論述了二者結合的可能性和必要性,這種結合方也在一定程度上克服了聚類分析演算容易陷入局部最優的缺點,最終提出了通過使用螞蟻演算建立二叉樹、 m叉樹和樹作為信息數據處理的思想,大大提高了搜擎搜的效率。
  14. For the sake of further improving performance, this paper made some improvements to sliq. first, we use a new splitting index to evaluate the “ goodness ” of the alternative splits for attributes instead of gini index. secondly, we regard categorical attributes with only two possible values as numeric attributes when evaluate splits

    為了進一步提高分類準確率和速度,論文對sliq演算作了一些改進:用新的屬性選擇度量代替gini,用處理連續值屬性的方處理只有兩個可能值的分類屬性。
  15. The first step in deciding which defragmentation method to use is to analyze the index to determine the degree of fragmentation

    決定使用哪種碎片整理方的第一步是分析以確定碎片程度。
  16. Method to determine the position of the index in the

    來確定
  17. Because of considerable storage space and larger index database, higher rate in the full searching and the lower rate in the exact searching, the article demonstrates a new retrieval method based on the phrase list

    然後針對該演算存在的「庫較大、匹配速度不高和查全率較高而查準率較低」等缺點,入了第二種檢:基於詞表的檢
  18. In systems with vsam, a named structure consisting of a group of related components, forexample, a data component with its index component

    在具有虛擬存儲訪問( vsam )的系統中,由一組相關部件組成的一種命名結構,例如帶有其部件的數據部件。
  19. The tranditional cbr system always adopts the methods of nearest learning > induction indexing and knowledge inducting, thses three methods adapt to the case - searching of qualitative cases

    傳統的cbr系統的相似演算主要採用最近相鄰檢、歸納索引法和知識導這3種實例檢策略。
  20. Realizing english text classification with semantic set index method

    運用語義集索引法實現英文文本分類
分享友人