上界

词组短语

upper bound · Upper World

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

Lastly, the ruin probability of the bidimensional perturbed risk model are studied, whose upper bound of Lundberg-type within infinit-time is obtained and discussed for the case of light-tailed using the martingale technique, the conclusion is gotten that the strength of the dependent of B strongly impact the upper bound can be achieved.

第四章主要研究了带有扰动项的二维风险模型的破产概率，应用鞅论的技巧，在轻尾条件下，求出Lundberg-type在无限时间内的破产概率的上界；并对破产概率的上界进行讨论，获得的相关性的强弱影响着破产概率可达到的上界。

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估计值按照评分函数进行排序，得到方案的排序结果。

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]上的分布情况。

And some new approaches based on minimum upper bound of error probability for feature selection and clustering are proposed.

提出了基于Chernoff上界、优化Chernoff上界和Bayes上界逼近三种最小错误概率上界的精确计算方法。

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序列讨论了线性复杂度再次下降的情况。

On the other hand, when we are proving the upper bounds of the Hausdorff measure functions for the level sets, although we get the answer to the cases for the symmetric processes, we had to consider multi-integral of highly dimensional functions, the proof is quite complex. Therefore, we suggest that the proof for the corresponding problem needs some new ways.

另一方面，我们在证明严格稳定过程的水平集的Hausdorff测度函数的上界时，虽然我们得到了对称的多参数稳定过程的水平集的Hausdorff测度函数上界，但是我们的方法必须考虑多重的高维积分，其证明过程也已经相当复杂，因此，我们认为，为了得到一般的严格稳定过程的水平集的Hausdorff测度函数上界，还需要引入其它新的研究方法。

Moreover, an improved upper bound on the average MAP decoding error probability of linear Slepian-Wolf systems for stationary memoryless sources is derived. Based on this improved bound, we analyze the performance of Slepian-Wolf systems based on LDPC codes and random permutations, and prove that under some conditions, all but diminishingly small proportion of LDPC encoders and permutations are good enough for the design of practical Slepian-Wolf systems when the coding length is very large.

然后，论文在相关平稳无记忆信源下推导出线性Slepian-Wolf系统平均MAP译码错误概率的一个改进上界，并在这一改进上界的基础上，分析了基于LDPC码和随机置换的Slepian-Wolf系统的性能，证明了在一定的条件下，当编码长度非常大时，几乎所有的LDPC编码器和置换对于实际Slepian-Wolf系统的设计都是足够好的。

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

The upper bound of error probability is used as the criteria of clustering and the evaluation of the clustering result. On the basis of initiatory clustering based on distance functions, the algorithms named"pick-over"and"fill-up"are proposed to minimize the upper bound of error probability.

我们将聚类准则即模式相似性测度问题和聚类结果的评价指标统一为总的最小错误概率上界，在算法实现上，首先先用基于距离函数的聚类方法得到初分类，然后采用基于最小错误概率的&抽取&和&回填&算法得到使总的错误概率上界最小的聚类结果的分析方法。

In this paper, using thermodynamic formalism for sub-additive potential defined in [4], upper bounds of Hausdorff dimension and box dimension of non-conformal repellers are obtained.

作者利用确定性的次可加拓扑压的变分原理，给出了非共形排斥子的Hausdorff维数的一个上界估计，证明了Barreira， Falconer， Zhang Yijing等人的几个不同形式的上界的估计是一致的，同时把他们的不同形式的上界统一成广义Bowen 方程的根。

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

Array or substring subscript expression out of range：数组下标低下数组定义下界或高于数组定义上界

170 Program Exception - stack overflow 堆... | 540 Array or substring subscript expression out of range 数组下标低下数组定义下界或高于数组定义上界 | 541 CHARACTER substring expression out of range 字符...

bounded above：有上界的;上有界的

bounded 有界的 | bounded above 有上界的;上有界的 | bounded below 有下界的;下有界的

bounded above：囿于上;有上界的

有界的;囿的 bounded | 囿于上;有上界的 bounded above | 有界(囿)集 bounded aggregate

least upper bound：最小上界

并且一个有序域(ordered field)被称为完全的,如果它的任何在这个域中有上界的非空子集,都有一个在这个域中的最小上界(least upper bound);注意这个定义与序理论中的完全有界性(bounded complete)有细小的差别.

least upper bound：最小上界;上确界

最小平方解 least square solution | 最小上界;上确界 least upper bound | 左零化子 left annihilator

least upper bound：上确界(最小上界)

"生成矩阵","generator matrix" | "上确界(最小上界)","least upper bound" | "数学结构","mathematical structure"

Limes superior supremum limit; upper limit：最小上界;上极限

Limes inferior lower limit; infimum limit 下限;最大下界 | Limes superior supremum limit; upper limit 最小上界;上极限 | linear linear 线性的

supremum：最小上界

supremum 最小上界 | supremum metric 上确界度量 | supremum norm 上确界范数

supremum：最小上界/上确界

supremo /[英口]最高领导人/总裁/ | supremum /最小上界/上确界/ | suprise /惊讶/惊奇/使...惊讶/

joukai; upper world; heaven：上界

商業界shougyoukai; commercial world | 上界joukai; upper world; heaven | 人間界ningenkai; the world of humans