您要查找的是不是：
- X is the lower bound for integrating ERF. X為ERF函數的積分下限。
- Sets the lower bound of the constraint. 設置最小的約束範圍。
- The lower bound always equals 0. 下限始終等於0。
- The greatest lower bound of A is also called the infimum of A. A的最大下界邊稱為A的下確界。
- If a lower bound or size is not specified, it is simply omitted. 如果未指定下限及大小,它將完全被省略。
- However, you cannot specify any other value for the lower bound. 但是,不能將任何其他值指定為下限。
- All dimensions of an array must have a zero lower bound. 數組的所有維數必須具有零下限。
- The lower bound is always zero, whether you specify it or not. 無論您是否指定,下限始終是零。
- The lower bound of an Array is the index of its first element. Array的下限是其第一個元素的索引。
- The Cramer-Rao lower bound is developed for the data model. 給出了所用模型的克拉美勞下限。
- The storage costs still imply a lower bound, but one below zero. 存儲成本仍意味著一個下限，而這個下限是零以下。
- An almost lower bound is defined similarly as an almost upper bound. 殆下界的定義與殆上界是類似的。
- The rank of the safe arrays is always 1 and the lower bound is always 0. 安全數組的秩始終為1,而下限始終為0。
- The resulting array is always one-dimensional with a lower bound of zero. 結果數組始終是具有零下限的一維數組。
- C-style arrays are one-dimensional typed arrays with a fixed lower bound of 0. C樣式數組是具有固定下限0的一維類型化數組。
- This result shows that an approximate compatible solution will give a lower bound. 這個結果說明相容的逼近解將給出較低的界限。
- Since most arrays will have a lower bound of zero, this method would generally return - 1 when value is not found. 由於大多數數組以零作為下限,在找不到value時,此方法通常將返回-1。
- For each dimension, the boundslist specifies the upper bound and optionally the lower bound. 對於每個維,boundslist指定上限,並可選擇性地指定下限。
- Input values outside the range are replaced by the lower bound replacement value, or the upper bound replacement value. 範圍之外的輸入值將由下界替換值或上界替換值進行替換。
- A Type object representing a one-dimensional array of the current type, with a lower bound of zero. 返回一個表示當前類型的一維數組(下限為零)的Type對象。
