您要查找的是不是：
- 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对象。
