下界

Firstly, the decision matrix is transformed into an objective matrix, and then the weight of every objective is determined by means of entropy coefficient method. By Integration of experts' knowledge, the acceptable lower bound of degree of satisfaction and acceptable upper one of degree of dissatisfaction of every objective are decided. At last, by using the weight vector and the acceptable lower boun...

首先将决策矩阵转化为目标矩阵，然后利用熵权系数法计算各个目标的权重，综合专家的意见得到对于每个目标可以接受的满意度的下界和不满意度的上界，最后利用得到的权重向量以及得到的满意度的下界和不满意度的上界计算各方案的vague估计值，将得到的vague估计值按照评分函数进行排序，得到方案的排序结果。

In chapter four, we prove that a complete open Riemmannian manifold with Ricci curvature negatively lower bounded is of finite topological type provided that the conjugate radius is bounded from below by a positive constant and its excess is bounded by some function of its conjugate radius.

第四章，我们证明了对于Ricci曲率具负下界的完备开Riemannian流形，当其共轭半径有正下界且它的Excess被其共轭半径的某个函数所界定时，它就有有限拓扑型。

FR conjugate gradient methods with perturbations are proposed. The global convergence property of the first method is proved under the condition of main directions' sufficient descent. Whereas, in the proof of the convergence for the other two methods, we only need main directions' descent. Importantly and quite interesting, boundedness conditions such as objective function being bounded below, boundedness of level set are not needed. Chapter 5 presents a version of Dai-Yuan conjugate gradient method with perturbations.

在主方向充分下降的条件下证明了第一个方法的全局收敛性，而后两个方法的收敛性是在主方向下降的条件下证明的，这些收敛性证明的一个共同特征就是不需要目标函数有下界或水平集有界等有界性条件，第5章采用Wolfe或Armijo步长规则提出了带扰动项的Dai-Yuanabbr。

For a given compound rule, if the upper bounds of both confidence and support minus their corresponding lower bounds are less than a given constant, the measurements of the rule are definite; if the the lower bounds of both confidence and support are greater than their corresponding thresholds, the existence of the rule is certain.

对于一个复合型分类关联规则，如果规则的支持度和置信度的下界都分别超过支持度阈值和置信度阈值，则称该规则的存在性是确定的；如果规则的支持度和置信度各自的上界与下界之差小于一个给定的常量，则认为规则的度量参数是确定的。

The representation of sequences is very helpful for the research of their linear complexity,so this paper we first research trace representation of periodic sequences,and the trace representation of a New Generalized Cyclotomic Sequence of order two of length pq is given,then for 2~mp~n period binary sequences,where p is an odd prime and 2 is a primitive root modulo p~2,we present a relation-ship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity and have the upper bound and lower bound of the value k, finally we discuss the k-error linear complexity of legendre sequences,also have the upper bound and lower bound of the value k,and discusses the situation where the linear complexity drop again for some Legendre sequences.

序列的表达形式对于其线性复杂度的研究是十分有帮助的，本文我们首先研究的是周期序列的迹表示，给出了2阶pq长度的扩展分圆序列的迹表示，然后讨论了周期为2~mp~n(m≥2)序列的线性复杂度与使得线性复杂度变小的最小的k值的关系，给出了k值的上界和下界，这里p为奇素数，2是模p~2的本原根，并通过例子讨论了其线性复杂度的稳定性，最后对Legendre序列k-错线性复杂度进行了分析，也给出了k值的上界和下界，并对某些Legendre序列讨论了线性复杂度再次下降的情况。

Secondly, the author gives some exact values of mb(2 q) for some values of b, which impliesthat the above lower bound is not only the lower bound but also the infimum.

其次，对于部分b值，给出了m_b（2，q）的确切值，从而说明了上面给出的下界值不仅是下界而且是下确界。

We determine the bounds on the upperand lower orientable strong radius and strong diameter of graphs satisfyingthe Ore condition. Let G_1, G_2 be any connected graph, we present the exactvalue of srad(G_1×G_2), consider the relationship between sdiam(G_1×G_2) andr(G_1×G_2), d (G_1×G_2). Moreover, we determine the values of the lower orientablestrong diameters of some special graphs. Furthermore, we give the exact value ofSDIAM, a lower bound for SDIAM, an upper and lowerbound for SRAD and SRAD, respectively.

对满足Ore条件的图，给出了最小强半径、最大强半径的上、下界；对笛卡尔乘积图G_1×G_2，确定了G_1×G_2的最小强半径与G_1×G_2的半径以及G_1和G_2的最小强直径之间的关系，并进而确定了一些特殊笛卡尔乘积图的最小强直径的值，确定了SDIAM的值，SDIAM的下界，SRAD和SRAD相应的上、下界。

And the self-shrinking generator is a typical model of the clock-conctolled During the past ten years or more, some researches have been done on the period and linear complexity of the self-shrinking sequence obtained from an m-sequence which is generated by a primitive polynomial f over GF(2), degree=n , in the related academies.

近十余年，国际上已对由n级m-序列导出的自收缩序列的周期和线性复杂度做了研究，给出周期的上下界，其中所给的下界为2~([n/2])，由此也给出了线性复杂度的下界为2~([n/2]-1)+1。

First, for a given integer value of the objective function, the lower and upper bounds of the variables were determined by the optimum simplex tableau of the linear programming relaxation problem. Then the conditions on the bounds were added to the constraints as cuts to the associated objective function hyperplane. Finally, a branch procedure of the branch-and-bound algorithm was applied to finding a feasible solution on the objective function hyperplane.

对于给定的目标函数整数值，首先利用线性规划松弛问题的最优单纯形表确定变量的上、下界，然后将变量的上、下界条件加入约束条件中对相应的目标函数超平面进行切割，最后应用分支定界算法中的分支方法来搜寻目标函数超平面上的可行解。

Through establishing the priori estimates for the approximation solutions, we pove the existence of global generalized solution by using the compactness principle and obtain the global property for the generalized solutions in the space L〓. At the last, a new method is used to prove the uniqneness which is a good results, at some extense, under generalize conditions.

运用De Giorgi的最大模估计方法，证明了解的整体上界估计和准衰减型的估计，进一步，在边值和初值具有正的下界条件下，证明了解的一致下界估计，得到了深刻结果。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷