lower bound 中文意思是什麼

lower bound 解釋
【數學】下界,低界。

  • lower : adj 〈low 的比較級〉1 較低的。2 下級的,低級的。 lower animals 下等動物。3 南部的。 in lower Manh...
  • bound : n 〈pl 〉1 界限,界線,限度。2 邊界,邊境;邊界線內的領土。3 區域,領域,范圍。vt 1 限,限制。2 ...
  1. The greatest lower bound of a is also called the infimum of a.

    A的最大下界邊稱為A的下確界。
  2. An almost lower bound is defined similarly as an almost upper bound.

    殆下界的定義與殆上界是類似的。
  3. This result shows that an approximate compatible solution will give a lower bound.

    這個結果說明相容的逼近解將給出較低的界限。
  4. The pressure in a perfect gas, being directly proportional to the kinetic energy of the molecules, has a lower bound of zero.

    理想氣體的壓力與分子的動能成正比,它的下限為零。
  5. Gets the lower bound of the specified dimension in the

    的指定維中的元素數。
  6. If found ; otherwise, the lower bound of the

    的匹配項,則為第一個匹配項的索引;否則為
  7. The lower bound of homeomorphic classification of g and g

    同胚分類的下界
  8. Is less than the lower bound of the first dimension of

    的第一維的下限。
  9. All dimensions of an array must have a zero lower bound

    數組的所有維數必須具有零下限。
  10. A one - dimensional array with an unknown lower bound

    下限未知的一維數組
  11. According to horodeckis, the coherent information of entangled state is supposed to be the lower bound of one - way distillable entanglement. this postulation is called hashing inequality, which is crucial in proving noisy channel coding theorem. it is shown that there are no direc

    根據horodecki等人的研究,糾纏態的相干信息推測是單向蒸餾糾纏的下限,該假設稱為hashing不等n式,對證明有噪通道編碼定理至關重要
  12. For the non - preemptive version, we present a new lower bound 6 5 which improves the known lower bound 1. 161. for the preemptive version, we present an optimal semi - online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5 4 otherwise, while a lower bound 1. 0957 is also presented for general case

    本文的主要結果為:對不可中斷的情況,我們給出了該問題的下界是6 5 ,從而改進了文獻中的給出的結果1 . 161 .對可中斷的情況,所謂工件加工允許中斷,即加工過程中允許機器暫停某工件的加工,而改為加工另一工件。
  13. In addition, it has the advantage that the cramer - rao lower bound can be used as an uncertainty hound on the estimation

    另外最大似然估計的一個優點是用於不確定度計算的克拉美羅下限值更易於獲得。
  14. By making use of two kinds of exponential sums and cohen ' s sieve, we better the lower bound concerning the number of primitive elements and also prove the existence of primitive polynomials with a1, a2 prescribed when n = 5, 6. in the remaining of the paper we study primitive elements in the form of a + a - 1 over finite fields. a counting formula is given as a result, as well as all the finite fields that do not have such elements

    本文對n = 5 , 6兩種情形,利用有限域上的兩類特徵和估計及cohen篩法[ 5 ] [ 7 ] ,改進了[ 10 ] [ 11 ]中關于方程組本原元解個數的下界,並得到在特徵為奇的有限域上存在可預先指定前兩項系數的n次本原多項式。
  15. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法,分枝的過程是普通的0 - 1變量分枝,用簡單的取整啟發式法確定更好的可行解;而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近,由此得到最優值的一個下界。
  16. 4 ) an algorithm for reliability upper bound assessment of large - size network is presented, which is based on the principle of topological classification of node - set ; and the lower bound can be also obtained by dual graph of oriented network.

    應用圖論的點集拓撲分類原理,提出一個計算大型復雜網路可靠度上界的類分法,並應用對偶理論求解網路可靠度的下界。
  17. In order to efficiently analyze the fault - tolerance of hypercube network and to propose a better fault - tolerant algorithms, the evaluation of an upper bound and a lower bound on the lip are given. a very significative conjecture on the bound of lip is obtained. besides, the

    2 .為了更好的分析超立方體網路的容錯性,提出更為優越的容錯路由演算法,文章給出了超立方體網路中lip容錯模型的上下界估計,並給出一個非常有意義的猜想,而且結合程序結果對上下界及猜想進行了驗證。
  18. The resulting array is always one - dimensional with a lower bound of zero

    結果數組始終是具有零下限的一維數組。
  19. 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

    在保證預應力索結構各索段一定的預應力水平且不致鬆弛的情況下,通過改變結構中某些索段的長度,來達到控制節點位移的目的。
  20. Another new mv benchmarking lower bound is established, it can be acquired from the process data and diagonal interactor matrix

    建立了另一最小方差基準下界,此新下界可通過過程數據和對角關聯矩陣得到。
分享友人