索引輸入輸出 的英文怎麼說

中文拼音 [suǒyǐnshūshūchū]
索引輸入輸出 英文
indexed io
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • : Ⅰ動詞1 (牽引; 拉) draw; stretch 2 (引導) lead; guide 3 (離開) leave 4 (伸著) stretch 5 (...
  • : Ⅰ動詞1 (運輸; 運送) transport; convey 2 [書面語] (捐獻) contribute money; donate 3 (失敗) l...
  • : Ⅰ動詞1 (進來或進去) enter 2 (參加) join; be admitted into; become a member of 3 (合乎) conf...
  • 索引 : index; indexing; key; repertory; subscript; concordance
  • 輸入 : 1 (從外部送到內部) import 2 [電學] input; entry; entering; in fan; fan in; 輸入變壓器 input tra...
  • 輸出 : 1 (從內部送到外部) export 2 [電學] output; outcome; outlet; out fan; fanout; 輸出變壓器 output ...
  1. 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 ]連接演算法,但是它沒有利用結構而是順序瀏覽列表。
  2. Replaces each indexed format item embedded in a source string with the formatted equivalent of a corresponding element in a list of values

    System . io . textwriter的方法的支持,該功能可以將嵌源字元串中的每個格式項替換為值列表中對應元素的格式化等效項。
  3. Secondly, it begins to explore the vital effect of the early - warning system in survival development for it industry in fujian, besides the characteristics, precondition, building process, structure and function. thirdly, it establishes an index system, which includes a constraint layer of three constraint factors, such as industrial science and technology, industrial economics and industrial circumstance, and 19 indexes. in order to ascertain the dividing lines of alarming situation, it introduces the concept of subordinate degree

    論文首先提福建省電子信息產業可持續發展理論,在此基礎上,探預警系統在可持續發展中的重要作用,分析電子信息產業可持續發展預警系統的特徵、建立的前提條件、構建過程及其結構和功能;然後構建一套由產業科技、產業經濟和產業環境三個約束因子構成的約束層,及由19個指標構成的福建省電子信息產業可持續發展預警系統指標體系,並模糊數學的隸屬度概念,將預警界限的確定轉化為相應隸屬度的確定,預警結果的採用紅、黃、綠三色信號燈顯示系統法;最後用1995 - 2001年福建電子信息產業的相關統計數據對所建立的福建省電子信息產業可持續發展預警系統進行實例驗證。
  4. There are two parts of the bandwidth use, one is for media data, which can be reduced by effective compression, the other is for controlling information, which is essential to streaming media technology. as the latter occupies too large a part of the bandwidth use, streaming avi files is not practical. the thesis puts forth a system solution to the problem by cutting the index in the controlling information

    媒體流的帶寬佔用分為兩部分:一部分是多媒體數據,此部分主要通過視頻壓縮來控制;另一部分是傳、播放控制信息,此部分是實時數據流生成時需要加的信息,但它佔用帶寬過多造成了avi流媒體實用價值不高,對此本文提通過去掉avi播放信息中項來解決。
  5. The traditional search engines request user input the combination of keywords, and then locate the literature for the inquiry of which the user submitted, users must depend on himself to filter the useful information that he needs ; while question - answering systems enable users to input a question in natural languages, finally give users concise and accurate answers also in natural languages

    傳統的搜擎要求用戶一些關鍵字的組合,且對于用戶提交的查詢只能定位文獻,用戶必須依靠自己去篩選需要的有用信息;而問答系統允許用戶以自然語言的形式一個問句,最終返回給用戶的也是自然語言形式的簡短而準確的答案。
  6. 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模式匹配和有限自動機匹配的思想。
  7. If a class is referenced and not present in the input, the classpath environment variable is automatically searched for the missing class and the first found location is displayed with the error information

    如果一個類被用卻沒有在現,則將通過classpath環境變量自動搜缺少的類並且將顯示第一個找到的位置和錯信息。
  8. As a result of introduction the conception of direction factor and application of the " searching arithmetic based upon direction factor for all least loops and most loops " and " arithmetic relocation of inside and outside wall ", which is firstly presented by the author, the problem of houses partition and relocation of inside or outside wall had been solved

    解決了建築構件信息的界面設計、構件類開放性管理、構件類二次開發等問題。論文了方向因子概念,提了「方向因子的最小迴路、最大迴路搜演算法」和「內墻壁、外墻壁重定位演算法」 。成功地解決了房間的劃分和內墻壁、外墻壁重定位問題。
分享友人