查询词典 outward-bound

Each variable bound in a for clause may have an associated positional variable that is bound at the same time.

for子句中绑定的每一个变量会被同时绑定一个相关的位置变量。

We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.

本文考虑此类问题中的如下一个新问题：一个企业的专用网即Intranet网，在因特网上有两种功能。

Corresponding to such a NP-hard problem, this paper gives some polynomial time solvable cases, and a branch and bound algorithm with a rapid method for estimating the lower bound for general case.

对这一NP-困难的排序问题，文中给出了几个多项式可解的特殊情形，一般情况下的一个快速下界估计方法以及相应的分支定界算法。

The imprecise polynomial circuit optimization is based on arithmetic transformation method, considering the fixed point and floating point representation condition first, then give a realization of circuits under different accuracy boundary, trade off error with power dissipation and area, applying branch and bound method to find the solution with minimal cost, determine the minimal word length which satisfies the error bound, make use of the automation synthesis approach to get ultimate optimize structure at the same time.

非精确多项式电路优化基于算术变换方法，首先考虑电路的定点和浮点表示情况，给出电路在不同精度界限下的实现，进行误差和功耗、面积的权衡，然后应用分枝定界方法求解出最小代价电路，决定满足误差要求的最小字长，同时利用自动综合优化方法得到最终的优化结构。

If all the flows getting into the system were constrained by the leaky-bucket parameters, the maximum cell delay and the buffer content bound were got when the capacity of the crosspoint was enough, and the maximum cell delay and the buffer capacity bound which can guarantee the maximum cell delay were also got when the content of the crosspoint was not enough.

在各数据流都由令牌桶参数约束的条件下，得到了交叉点缓存容量足够大情况下的最大信元时延和缓存临界容量大小，还得到了交叉点缓存容量不足够大情况下的最大信元时延以及保证信元具有时延上界的缓存临界容量大小。

While Chebyshev's Inequality gives an upper bound on P, there is no guarantee that the upper bound is a good approximation.

因为切尔雪夫不等式给出的是每个象素灰度的上限，而又没法保证其上限是一个很好的估计。

I. d. Bernoulli random variables. First, we can get the upper bound with order from Chebyshev inequality. Second, a better upper bound was gotten with the new inequalities, which can fasten the convergence rate.

并对服从两点分布的独立随机变量X1，X2，…，X进行研究，首先利用Chebyshev不等式得到随机变量偏离方差ES的上界，但它只有阶的收敛速度，然后利用新的不等式得到一个新的上界，它有更快的收敛速度，这在探讨收敛速度时有着重要的理论意义。

We establish a relation between μ and the stucture of the group G, and obtain the lower bound of the ratio by the mininal prime divisor of the order and commutator of the group G, and give a necessary and sufficient condition under which this lower bound is attained.

第一部分，记有限群G的阶与不可约特征标个数的比值为μ，我们研究了一般的非交换有限群G的结构和μ之间的关系，通过群G的阶的最小素因子和换位子群G′的最小素因子得到了μ的一个下界，同时给出了达到下界的一个充分必要条件。

Because as long as you are bound by color, shape, you are bound by compounded things.

只要你受限于这些颜色和形状，你就会被和合事物所限制。

In this paper, the computation of original likelihood function is transformed into the optimal problem of its low bound through the conjugate representation of the convex function, and a additional parameter is introduced to control the smoothing degree of low bound, and so the performance of local optimal solution can be improved.

我们利用凸泛函的对偶性，将原似然函数的复杂计算问题转化为对其下界函数的优化问题，从而降低学习算法的复杂性；并通过引入一个参数来控制下界函数的光滑程度来改善局部最优解的性能；指出了传统的期望最大化算法(Expectation Maximization Algorithm)是变分学习算法的特殊情况。

You can snipe the second and third union leaders from this position.

您可以鹬第二和第三工会领袖从这一立场出发。

Aiming at the currently shortage of XML streams quality detecting, this paper proposes a new forecasting method of XML streams quality by least squares support vector machines, which is used the method of XML keys' vector matrix as windows, and vector product wavelet transform to multilevel decompose and refactor the XML streams series, that can fulfill real-time checking demand of XML quality, and ensure constraint, consist- ency and integrality. For even more adapting net load, it proposes a control strategy by weight and adaptive adjustment to ensure XML streams quality.

针对当前XML数据流质量检测存在的不足，提出构建XML键的矢量矩阵作为窗口，利用矢量积小波变换多级分解与重构XML数据流，再结合最小二乘支持向量机对XML数据流质量进行预测的一种方法，满足XML数据流质量重构时实时检测的要求，保证XML数据的约束性、一致性与完整性；为了更好的适应网络负载，采取加权与自适应窗口调整等调度策略充分保证XML数据流的质量检测。