另存復本為 的英文怎麼說

中文拼音 [lìngcúnfùběnwéi]
另存復本為 英文
save copy as
  • 另 : Ⅰ代詞（別的） another; other Ⅱ副詞（另外） in addition; moreover; separately
  • 存 : 動詞1 （存在; 生存） exist; live; survive 2 （儲存; 保存） store; keep 3 （蓄積; 聚集） accumulat...
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 本 : i 名詞1 （草木的莖或根）stem or root of plants 2 （事物的根源）foundation; origin; basis 3 （本錢...
  1. Secondly, there are so many same objects managed in the storage manage system and a greate deal of memory is occupied, and in order to access the resources between processes entry management library is presented. thirdly, this paper also researches the ag ( atomic group ) function, then implements an method to deal with the disater recovery in san and ag make users easier to operate than a volume

    另外，針對存儲管理系統中要保存諸多同類信息、佔用內存大的問題，同時考慮到能夠實現進程間的數據訪問，提出，設計並實現了entry管理庫，從而大大降低了內存的使用量。另外，本文還設計和實現了ag （ atomicgroup ）功能，提供了一種解決災難恢復的方案，同時相對于單個volume的操作，以組為單位操作，簡化了用戶的操作。
  2. The simplest method is to open notepad, create a new file, copy the following code listing 2 into the new notepad file, and save as

    最簡單的方法是打開記事本，新建一個文件，將下列代碼（清單2 ）復制到新記事本文件中，然後另存為
  3. An efficient algorithm qais is proposed that uses the efficient method to reduce database access activity, and present a novel algorithm aiu based on this algorithm, it is fit for mining association rules and incremental updating. it is especially effective in vldb, mining long patterns, and high support. the perfermance of qais / aiu is verified on the basis of synthetic data, experiments show that the proposed algorithm can mine association rules more efficiently by not generating candidate itemsets and reducing the redundancy of frequent itemsets while generating association rules

    然而目前大多數挖掘關聯規則的演算法往往必需多次掃描事務數據庫才能達到要求的目標，這樣重復性的數據庫存取動作將會導致過多的執行時問浪費在i o動作上，另外在頻繁集生成規則時現有的演算法沒有考慮到規則的大量冗餘，為了解決這個問題本文提出了一個不需要生成候選集同時有效的去除生成規則時產生大量冗餘的演算法qais ，來提高關聯規則生成的速度，並且在此演算法基礎上提出了新穎的關聯規則增量更新演算法aiu ，通過應用合成數據驗證了qais aiu演算法的有效性，由試驗結果來看這個方法確實能更有效且準確地獲得事務數據庫的關聯規則，尤其適合挖掘超大數據庫中高支持度下長模式的挖掘。
  4. Then, the thesis presents a schema based two - level associated model, which dramatically reduces the number of the candidate subscriptions. in addition, an incremental subscription matching algorithm is proposed to efficiently matching events for millions subscriptions. furthermore, since indexing is very important to the system, the indexing scheme for xml data is defined based on the containment relationship, which can be more efficient to deal with relative paths than previous methods

    另外，由於在意向匹配過程中涉及大量索引問題，為此針對先前研究在處理基於相對路徑的意向表示上存在的問題，本文提出了一種基於相容關系的索引模式，利用系統抽象數據拓撲結構進行相對路徑到絕對路徑的轉換，通過基於相容關系的數字方式編碼，能夠快速確定對應結點的依賴關系，同時提出了新的路徑轉換演算法，將時間復雜度由過去的平方時間變為線性。
  5. Save copy as

    另存復本為
  6. As a result, the window for double booking becomes much larger due to the latency between saving the accepted reservation into a second replica and having it replicate back to the r r database s home server so it can be put into busytime

    因此，由於在將已接受的預訂請求保存為另一個副本和將它復制回r & r數據庫的主機服務器以便它被置於忙碌狀態之間存在延遲，那麼遇到重復預訂窗口的機會也變得大了很多。
  7. To download a jpeg file, position your mouse pointer over the desired link and right mouse click, then choose " save link as " mozilla or " save target as " explorer to copy to a local drive

    要下載jpeg文件，請將鼠標指針放在相應鏈接上，按一下鼠標右鍵，然後選擇「鏈接另存為」 mozilla或「目標另存為」 explorer將其復制到本機硬盤。
  8. So at first in this paper, a disk - based xml data storage structure ldf & b based on f & b index is proposed. on one side, ldf & b wipes off the redundancy existing in traditional storage structure which stores the same value information repeatedly ; on the other hand, the index on the tape and the inverted index introduced in this storage structure enable nodes with the same property to be clustered when stored on disk, and enable nodes satisfied with the query to be searched effectively. that is to say, ldf & b can support xml query processing effectively

    為此，本文首先提出了一種基於f & b索引的xml數據的磁盤壓縮存儲結構ldf & b ，其優點在於:一方面， ldf & b摒除了傳統存儲方法中相同的值信息重復存儲帶來大量冗餘的問題;另一方面，該結構引入的同帶索引與反向索引結構將具有相同性質的節點聚集在一起，使得可以快速的定位到滿足條件的節點集，很好的支持了其上的查詢處理。
分享友人
分享到 Line

分享到臉書