理学 >>> 数学 >>> 应用数学 >>>
搜索结果: 1-15 共查到应用数学 bound相关记录15条 . 查询时间(0.134 秒)
We consider the full system of compressible Navier-Stokes equations for heat conducting fluid. We show that the temperature is uniformly positive for t ≥ t0 (for any t0 > 0) for any solutions with fin...
In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an n-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an importan...
We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\ch...
The Hosoya index of a graph G is defined as the sum of all the numbers of k - matchings (k ≥ 0) in G. An upper bound for the Hosoya index of trees is presented in this note.
A simple bound is presented for the probability that the sum of nonnegative independent random variables is exceeded by its expectation by more than a positive number t. If the variables have the same...
A completely elementary proof of a known upper bound for the deviations from the mean value is given. Related inequalities are also discussed. Applications to triangle inequalities provide characteriz...
A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programmi...
In this note we present a perturbation bound of unitarypolar factors. We add the orthogonal projectors into the bound; asa result, a uniform perturbation bound of $Q$-factors is obtained,and the previ...
A TIGHTER BOUND FOR FFd ALGORITHM     Binpacking  FFD algorithm         2007/12/11
For the bin-packing FFD algorithm we give a.proof of FFD (L) ≤■ OPT (L) +■. The best bound before was FFD (L)≤■ OPT (L) +1 given by Yue Minyi.
r + 1. We consider the eigenvalue problems (1.1) and (1.2), and obtain Theorem 1 and Theorem 2, which generalize the results in [1,2,5].
An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restricted edge connectivity λ_m is the cardinality of a...
It is shown that the lower bound on the maximum genus of a 3-edge connected loopless graph is at least one-third of its cycle rank. Moreover, this lower bound is tight. There are infinitely such graph...
We consider a spherically symmetric, static system of a Dirac particle interacting with classical gravity and an SU(2) Yang-Mills field. The corresponding Einstein-Dirac-Yang/Mills equations are deriv...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...