1) Minimal approximation extensions
极小逼近扩张
2) minimax approximation
极大极小逼近
3) minimax approximation
极小化极大逼近
4) minimal weak approximate Hessian
极小弱逼近Hessian
5) minimal asymptotic u-similarity
极小逼近酉相似
6) diffusion approximation
扩散逼近
1.
Based on the result of stability of Lu-Kumar queueing network,this paper studies the diffusion approximation of Lu-Kumar queueing network under SBP service discipline.
论文在讨论了Lu-Kumar排队网络稳定性相关结果的基础上,研究了Lu-Kumar排队网络在具有优先权的服务规则下的扩散逼近。
2.
A heavy traffic limit theorem is proved to justify diffusion approximations for multiclass queueing networks under preemptive priority service discipline and provide effective stochastic dynamical models for the systems.
证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型。
3.
And in this paper, by Functional Strong-Law-of-Large-Numbers (known as fluid limit or fluid approximation) and Functional Central Limit Theorem (known as diffusion approximation), we develop an approximating technique on max function of independent and identically distributed (i.
此外本文用逼近的方法研究了一类独立同分布随机变量序列,得到了泛函大数定律(Functional Strong-Law-of-Large-Numbers,也称流体逼近或流体极限)与泛函中心极限定理(Functional Central Limit Theorem,也称扩散逼近)的相关结果,然后用此方法得到了队长过程、忙期过程、负荷过程的流体逼近与扩散逼近。
补充资料：极大扩张和极小扩张
极大扩张和极小扩张
maximal and minimal extensions
极大扩张和极小扩张匡.习的司出目.公油抽lex妇心.旧;MaKcl.Ma刀‘.oe H Mll.”M田.妇oe PaC山一Pe皿朋] 一个对称算子(s笋nr贺苗c opemtor)A的极大扩张和极小扩张分别是算子牙(A的闭包，(见闭算子(cfo“月。详mtor”)和A’(A的伴随，见伴随算子(呐。int opera.tor)).A的所有闭对称扩张都出现在它们之间.极大扩张和极小扩张相等等价于A的自伴性(见自伴算子(义休.adjoint operator))，并且是自伴扩张唯一性的必要和充分条件.A.H.J’Ior朋oB，B.c.lll户、MaR撰
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条