查询词典 upper bound
- 与 upper bound 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Of course,one may choose to use an a priori upper bound on the number of nodes in the system;for example,we could postulate at most one Chord server per IPv4 address.
当然, 你也许选择使用一个演绎最高界面在结的数量在system;for 例子,我们能假设至多一台弦服务器每IPv4 地址。
-
An adaptive algorithm is also incorporated to remove the requirement for a priori knowledge about the upper bound of the derivative of observed signal.
而其中适应性控制法则是用来消除"需要知道信号其导数上界"的这一项前题。
-
So,current upper boun d formula can be perfectly replaced by derived upper bound formula.
因此,应该用推导出的公式代替现用公式。
-
We first prove a general upper bound in term of the size:〓then derive the exact upper bounds for 3-uniform hypergraphs and (n-2)-uniformhypergraphs of order n.
首先用超图的边数给出了圈示数的一般上界:〓-m+1。随后求出了n阶齐3超图与齐(n-2)超图圈示数的精确上界。
-
Firstly, we give a new upper bound of a mixed graph′s largest Laplacian eigenvalue, which is more precise. And also we give a lower bound of a mixed connected graph′s largest Laplacian eigenvalue.
首先给出了混合图的最大Laplace特征值的一个新的上界,并且用实例说明我们的结果与以往结果相比更精确,同时也给出了一个连通混合图的最大Laplace特征值的一个新的下界。
-
The estimation problem of the fuzzy nonlinear complexity of the random vector is studied, and some upper bounds are given. The limit properties of fuzzy nonlinear complexity of random vector are studied, and the limit theorem and the upper bound of variance limit of the fuzzy nonlinear complexity of random vector are given.(3) Enumeration of lst-order correlation-immune functions is discussed further.
首次提出了模糊非线性复杂度的概念,对随机向量的模糊非线性复杂度的均值进行了估计,给出了若干上界估计公式,并研究了随机向量模糊非线性复杂度的极限性质,给出了随机向量模糊非线性复杂度的极限定理及其方差极限的上界。
-
As the true capacity formula for blind-CSI in both transmitter and receiver is hard to obtain, we derive its independent upper bound instead, and establish a close-form expression of the independent bound for any memory order $M$.
由於,在传送端与接收端均无「频道状态资讯」的情况下,管道传输极限的计算相当困难,因此我们转而探讨其「独立上界」。
-
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系统的设计都是足够好的。
-
The lower bound of the subrange must not be greater than the upper bound.
在指定子区域上限值时,上界值小于它的下限值。
-
Using the independence number and the girth, the upper bound of the Betti deficiency is obtained. A better lower bound on the maximum genus of a graph is obtained and a previous result is improved.
利用图的独立数和围长,得到了一个Betti亏数的上界,进而得到了最大亏格的一个比较好的下界,改进了黄元秋先前的一个结果。
- 推荐网络例句
-
On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.
另一方面,更重要的是由于城市住房是一种异质性产品。
-
Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.
气候直方图是将所收集的降水量测定值,分为几个相等的区间作为横轴,并将各区间内所测定值依所出现的次数累积而成的面积,用柱子排起来的图形,也叫做柱状图。
-
You rap, you know we are not so good at rapping, huh?
你唱吧,你也知道我们并不那么擅长说唱,对吧?