最大重傳次數 的英文怎麼說

中文拼音 [zuìdàzhòngzhuàncìshǔ]
最大重傳次數 英文
attempt limit
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 重 : 重Ⅰ名詞（重量; 分量） weight Ⅱ動詞（重視） lay [place put] stress on; place value upon; attach im...
  • 傳 : 傳名詞1 （解釋經文的著作） commentaries on classics 2 （傳記） biography 3 （敘述歷史故事的作品）...
  • 次 : Ⅰ名詞1 （次序; 等第） order; sequence 2 [書面語] （出外遠行時停留的處所） stopping place on a jou...
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 次數 : number of times; frequency
  1. In qg - dcf, qos grades include both delay grade and packet drop probability grade. qg - dcf supports the two grades by means of adjusting the minimum contention window and the maximum re - transmission limit

    Qg一dcf提供兩種qos分級服務:時延分級和丟組率分級，並且分別通過調節最小競爭窗口和最大重傳次數來實現這兩種分級服務。
  2. We analyze how bit error rate ( ber ), average delay, and throughput of the two structures vary with the maximal number of transmission attempts, and find that syndrome - ahead structure is suited for short codes with poor error - correction capacity, while syndrome - behind structure is suited for long codes with powerful error - correction capacity

    分析了該harq的可靠性、時延和流量與最大重傳次數之間的關系，發現短碼長、糾錯能力低的碼宜採用前向校正子結構，而長碼長、糾錯能力高的碼宜採用後向校正子結構，二者具有互補性。
  3. It takes good use of these two numerical computation methods merits and it is valuable for defmiting the computation model of pile ? oil ; at the same time, it builds the computation model of compound pile foundation and uses the software ansys which is about finite element to build the mechanics model. in regular quality soil, the result worked by this way has good unanimity with traditional results, so it applies us strong evidence for using the way which this article tells us to solve problems which is difficult to handle in compound pile foundation, such as irregular quality, layer quality of the soil. at last, taking foundation soil ' s measuring data of liaoning technology university ' s test building for example, and using the way this article tells us to build compution module, we solve the sharing ration of pile and loading board

    本文利用有限元與邊界元耦合的方法求解樁土相互作用問題，充分利用兩種數值計算方法的優點，對確定樁土相互作用計算模型是一次有益的嘗試；同時建立了群樁相互作月的數學模型，並利用有限元分析軟體ansys建立其力學模型，在均質土體中取得了與傳統解答較好的一致性，從而為拓展利用本文所述建模方法，解決群樁作用機理研究中難以處理的土體成層、非均質等性質，提供了有力的根據；最後，以遼工大實驗館地基土實測資料為例，利用本文建模方法，求解出承臺與樁的荷載分擔比，對安全、經濟地進行群樁基礎設計具有重要指導作用和應用價值。
  4. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  5. " in most children, weight problems wo n ' t surface until later, but by checking four - year - olds we hope to find people who are especially at risk, who are genetically predisposed to become overweight, " carl - erik flodmark, head physician at the child obesity center in skaane in southern sweden, told afp. the move to screen bmi in four - year - olds follows a slew of reports showing an increased incidence of sweden ' s traditionally healthy children being overweight or obese

    瑞典南部斯科訥地區兒童肥胖中心的首席醫生卡爾埃里克弗羅德馬克說： 「對于大多數兒童來說，其所面臨的體重問題要等到長大以後才會逐漸顯現出來，但我們希望通過這次普查能找出正處于高危狀態下的孩子以及那些從遺傳角度來講體重最容易超標的孩子。 」
  6. 8 computer program, then used to calculate di stance matrix with kimura ' s two - parameter method and construct phylogenetic trees by applying neighbor - joining and maximum parsimony analyses using mega2. 1 computer program. bootstrap analyses were carried out to evaluate statistical reliability based on 500 resamplings of the data set

    新鮮或硅膠乾燥樣品被用於總dna提取並用於pcr反應， pcr擴增產物回收后直接用於測序反應，序列數據經chstalx1 . 8軟體排序后，採用mega2 . 1軟體根據kimura 』 s雙因子法計算遺傳距離，並應用鄰接法（ neighbour - jointing ）和最大簡約法（ maximumparsimony ）構建系統樹， bootstrap法（ 500次重復）評估分支可信度。
分享友人
分享到 Line

分享到臉書