confidence bound

confidence bound的基本解释

-

置信界限

与confidence bound相关的网络例句 [注：此内容来源于网络，仅供参考]

Meanwhile, it could be seen that there does not exist a confidence interval with width less than 0.5 because of the property of Poisson distribution. Based on these conditions, the author mainly carried out research into two aspects of this problem as follows. Firstly, by numerical and theoretical analysis, the author compares some existent confidence intervals, for example,"exact" confidence interval, Wald confidence interval and Bayesian confidence interval, and finds some deficiencies points of the confidence intervals, whose modification version has been proposed .Also, several better confidence intervals such asare also presented .Secondly, for given confidence coefficient and interval width, the author constructs a class of asymptotical two-stage interval estimate procedures. At the same time, under varies restriction of confidence coefflcientent interval width, the optional sample size of the first stage has been computed by numerical computation. The numerical computation shows that the method considered in this dissertation have good properties and applied value.

同时，由于Poisson分布的特性，我们知道不存在其参数区间长度小于0.5的置信区间，基于这些情况，我们主要展开了以下两个方面的研究：一是利用数值计算分析与理论分析的方法对现有的若干置信区间如"精确"置信区间，Wald置信区间，Bayes置信区间等进行分析比较，发现了一些缺陷，针对这些缺陷，我们进行适当的修正，并得到几种性质较好的置信区间如：修正大样本区间Jeffreys原则下置信区间二是针对已给定的置信系数与区间长度，我们提出了一种渐近的两阶段区间估计程序，并利用数值计算的方法，在各种置信系数与区间长度限定下，算出了最优的第一阶段观测次数，大量数据表明，本文考虑的方法性态良好，具有应用价值。

Next, after analyzing the nets′relationship in three layer channel routing, setting up the objective function toward channel area minimization, we propose some new terms, for example, the withstand bound columns, valid complete cover net sets, TRACK valid routing, etc.. The conceptions and natures of static bound of nets, dynamic bound of unrouted net set and the lower bound value of the horizontal tracks are discussed; and the methods of calculating static bound, dynamic bound and lower bound are put forward.

文章接着分析了线网在三层通道区布线中的相互关系，为了以完成布线所需通道区面积最小化为目标解决三层通道区布线问题，提出了柱界列、完全有效覆盖线网集、TRACK有效布线等一些新的概念，讨论了三层通道区布线问题中线网定界、未布线网集动界和水平通道数Lower-Bound等概念和它们的性质，给出了定界、动界、Lower-Bound值的计算方法。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

与confidence bound相关的网络解释 [注：此内容来源于网络，仅供参考]

confidence level,confidence coefficient：置信水平,置信系数

单侧置信区间 one-sided confidence interval | 置信水平,置信系数 confidence level,confidence coefficient | 置信限 confidence limit

in confidence：当作秘密

you should have more confidence in yourself 你应该增强自信心. | in confidence 当作秘密 | I am telling you this in confidence 我现在告诉你的这件事情是个秘密 (strict confidence 绝密)

build confidence in oneself：树立自信心;in confidence 私下

break one's confidence辜负某人的信任; | build confidence in oneself树立自信心;in confidence 私下 | 154 confine vt. 使局限, 使不外出