bound length 中文意思是什麼

bound length 解釋
鍵長
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • length : n. 1. 長，長度，長短。2. （時間的）長短，期間。3. （賽艇的）一艇的長度；一馬的長度。4. 程度，范圍。5. 【板球】球程；投至適當距離的球。6. 【語言學】音長。7. 一段，一節。
  1. 5. two criteria are put out in straw classification process. the first one is based on the proportion of length and width of object ' s bound box, and the second one is based on the circularity of object

    5針對秸稈物體的形狀特徵，提出用物體外包矩形的長寬比以及物體的圓形度二準則依次進行目標形狀判斷的方法。
  2. By using the multi - configuration dirac - fock ( mcdf ) method, the effects of relaxation and correlation on the transition energies and probabilities of electric - dipole allowed ( el ) resonance and intercombination transitions for 2p53s3 - 2p6 in neutral neon have been systematically studied firstly. and the results of the transition energies and probabilities ( lifetimes ) in length and velocity gauge have been presented. during the calculation, in order to consider the rearrangement effects of the bound - state density and some important correlations, the asfs of transition initial - and final - states were divided according to their angular - momentum and parity and calculated, and different number of csfs were included in the expansion of asfs

    本文利用多組態dirac - fork （ mcdf ）理論方法，通過對輻射躍遷初、末態電子波函數的獨立計算以及在原子態波函數的展開中考慮不同數量的組態波函數，系統地研究了弛豫和相關效應對中性ne原子2p ~ 53s ~ （ 1 . 3 ） p _ 1 ~ o - 2p ~ 6 ~ 1s _ 0電偶極共振和復合躍遷的能量以及躍遷幾率的影響，給出了長度和速度兩種不同規范下激發態的能量和輻射壽命；以中性ne原子的研究為基礎，進一步研究了類ne等電子系列離子（ z = 11 - 18 ）較低的激發組態2p ~ 53s和基組態2p ~ 6的能級結構以及各能級間的輻射躍遷特性。
  3. No upper bound on the event detail length is set

    ，則不設置事件詳細信息長度的上限。
  4. By altering the length of some structural members while keeping the prestress level above a given lower bound without relaxation, the nodal displacements of prestressed cable structure are controlled

    在保證預應力索結構各索段一定的預應力水平且不致鬆弛的情況下，通過改變結構中某些索段的長度，來達到控制節點位移的目的。
  5. Next, the lower and upper bound expressions are evaluated, insofar they are present ; defaults are zero and the sequence ' s length

    下一步，在它們所出現的范圍內，對上下限表達式求值；預設值是零和序列長度。
  6. First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals

    需加工n個工件人； … ；人，每個工件是在線到達（ oneb ， olle ）且可打斷的，機器人人的準備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應用背景。這里工件在線到達（ onebyone ）指的是工件的情況並不是提前知道的，只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。
  7. We give the value of the code - length n and dimension k, and the lower bound of the minimal distances of the new linear code under some particular condition

    在某些情況下，我們得到了該類線性碼的碼長n和維數k的取值以及最小距離d的下限。
  8. Firstly, we introduced the significance and development, and theory of fingerprinting technology in a whole and analyzed that the lower bound on the fingerprint length needed approximately grows logarithmically in the number of uses and linearly in the number of pirates in theory

    本文首先對數字指紋技術的意義、發展、理論等方面作了全面的概述；並從理論上分析了理想情況下所需指紋長度的下界近似地隨著碼集可容納用戶數對數增加，隨著抗合謀用戶數線性增加的原理。
  9. Second, combining with the construction principle of geometry - goppa codes, we present a kind of new algebraic - geometry code by using the properties of algebraic curves on finite fields. we determine the value of the code - length n and d imension k, and the lower bound of the minimal distances of the new algebraic - geometry code. the new algebraic - geometry code have the following characteristics : ( l ) the new code is the generalization of geometry - goppa codes and the algebraic - geometry code constructed by chaoping xing and san ling in 2000 ( 2 ) compared with brouwer ' table of the best known codes, we find more new codes, there are at least 60 new codes under two - dimension cases

    其次，結合幾何goppa碼的構造原理，利用有限域上代數曲線的特點來構造代數幾何碼，確定了新的代數幾何碼的碼長n和維數k的取值，給出了最小距離d的下限，這類碼的特點是： （ 1 ）新的代數幾何碼是幾何goppa碼和新加坡國立大學chaopingxing和sanling在2000年所構造的代數幾何碼的推廣； （ 2 ）這類碼中有許多種碼的參數優于brouwer碼表，僅二維情形時，就有60多種碼優于brouwer碼表。
  10. Consequently a new cac scheme for cbr traffic, lv ~ ? { ~ l ~ : atm ~ iija ~ jlijf ~ linear approximation cac scheme based on the lowest rate replacing, is presented. instead of using the tail of the infinite queue length distribution as an estimate to clr, this cac scheme obtains clr by the upper bound on it, and qos can be well guaranteed in our scheme

    在此基礎上，提出了一種新的cbr業務連接允許控制機制；基於最小速率替換的線性近似cac機制，該機制能夠提供服務質量保證，並且採用了有限容量緩沖區情況下cbr業務信元丟失率的上界，而不是將clr用無限容量緩沖區排隊系統的隊長尾部分佈來近似。
  11. Such was the dream which that day s burning sun brought me through the leafy trees and i, lying full - length in the grass of the island where we had landed, free of all human ties which had hitherto bound me, allowed my mind to run free and gather up all the hopes it met with

    這就是那天灼熱的陽光穿過樹葉的空隙給我帶來的夢境。我們的遊船停在一個孤島上，我們躺在小島的草地上，割斷了過去的一切人間關系，我聽任自己思潮起伏，憧憬著未來。
分享友人
分享到 Line

分享到臉書