冗餘度概念 的英文怎麼說

中文拼音 [rǒngyúdùgàiniàn]
冗餘度概念 英文
concept of redundancy
  • 冗 : [書面語]Ⅰ形容詞1. （多餘的） superfluous; redundant 2. （煩瑣） full of trivial detailsⅡ名詞（繁忙的事） business
  • 餘 : Ⅰ同「余」Ⅰ-Ⅳ1. Ⅱ名詞（姓氏） a surname
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
  • 念 : Ⅰ動詞1 （看著文字發出聲音; 讀） read aloud 2 （上學） study; attend school 3 （想念; 考慮） think...
  • 冗餘 : redundance; redundancy冗餘校驗 redundancy check; redundant check; 冗餘碼 redundant code; redundan...
  • 概念 : concept; conception; notion; idea
  1. It can be used in any complex environment, can locate all paths from transmitter to receiver which avoid redundant calculation, and it is a standard 3 - d forecast model ; in addition, it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently, the proagmme can back - search the virtual fountain tree when it is running. these operation increase the calculate speed and it result in the higher receive efficiency and precision. the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models. the comparsion result indicate the new model is a better model

    它可應用於任何復雜的傳播環境中，能找到發射機到接收機之間的所有電波傳播路徑而無須冗餘的計算，是一種準三維的預測模型；另外，從本質上講，它仍然是一種基於鏡像理論的點對點的射線跟蹤法，所以它無須進行接收測試；而且由於採用了反向演算法，運用數據結構中多叉樹的概念，先確定需要計算的場點位置，找出所有能從源點到達場點的射線，並且可一次性建立一個虛擬源樹，以後每次的計算只要通過對該樹進行後序遍歷即可，大大提高了運算速度，因而有較高的接收效率與精度。本文對該模型進行了相應的模擬，並將其預測結果與實測結果以及基於cost231經驗性模型和基於強力射線跟蹤確定性模型的預測結果進行了比較，結果表明了該模型的優越性。
  2. The answer lies in the introduction of concept of visual hull, which is a hollow hull that contains the real object in world coordinate system

    如何避免內部提速的冗餘計算，答案是引入可見殼的概念? ?計算一個沒有厚度包圍物體的空殼體。
  3. New dominant forecasting method and redundant measure are defined for combination forecasting method with generalized weight arithmetic average, based on error of power of p

    摘要從p次冪誤差的概念出發，提出了廣義加權算術平均組合預測法新的預測方法優超和冗餘度的定義。
  4. As the application of distributed computing is used much more widely ， distributed database becomes a significant part of information management it avoids a lot of disadvantages of conventional centralized database ， and is applicable to many situations distributed database is a set of data which is the unity logic ， but in fact these data is located on different sites it is of high availability ， easy expansibility ， high concurrency ， high efficiency and etc in distributed system ， data redundancy is a method to improve the speed of query and the availability of system distributed query should shield the lower level details of data redundancy from end users ， distributed transaction should ensure data from disaccord this paper introduces basic conceptions of distributed database firstly ， discusses distributed transaction and concurrent control ， describes the development prototype mysql ’ s characters ， architecture and executive mechanism ， then shows the skeleton model of dpsql and exposes the strategy and algorithm of distributed query and distributed transaction ， at last analyzes the extra expenses and response delay of distributed processes this paper exposes the implementation mechanism of distributed query and distributed transaction emphatically distributed query uses the strategy of “ read one ， write a11 ” s0 in such a system if user ’ s requests are read - - only for the most part and the distribution of data redundancy is plausible ， efficiency is very high distributed transaction uses two - 。 phase commit protocol to ensure the consistency of global data ， which has less communication overhead

    分散式查詢需要向用戶屏蔽數據冗餘分散的底層細節，分散式事務處理要保證全局數據完整，這都是傳統集中式數據庫不曾面臨的問題。本文首先介紹了分散式數據庫的概念性問題；接著討論了分散式事務涉及的定義及演算法；然後描述了dpsql的原型mysql的特性、結構和執行機制；繼而給出了dpsql的梗概模型，闡述了實現分散式查詢和分散式事務處理的策略及演算法；最後分析了進行分散式處理給系統增加的額外開銷和客戶端的額外響應延遲。本文重點描述了分散式查詢和分散式事務處理的實現機制，分散式查詢採用」讀一個寫全部」的本地優先策略，在讀操作頻繁的系統中，只要庫的分佈合理，單機效率極高，幾乎無任何附加開銷和延遲，而以整個系統的角度看來，吞吐量就更是優于單機系統；分散式事務處理採用兩階段提交協議，通信次數較少並能確實保證副本一致。
分享友人
分享到 Line

分享到臉書