1) minimal order
最小阶
2) weak minimal order
次最小阶
1.
In this paper,the authors discussed connected residually complete graphs,determined the third minimal order of connected K_2residual graphs,for n≠2 the weak minimal order of connected K_n-residual graphs,that ismin{v(G)｜G is connected K_n-residual graph,v(G)>2n+2}=2n+3,n=2,4,62n+4,n≠2,4,6and constructed the corresponding graphs.
讨论连通的残差完备图,确定了连通的K2残差图的第二个最小阶及n≠2时,连通的Kn残差图的次最小阶,即min{v(G)|G是连通的Kn残差图,v(G)>2n+2}=2n+3,n=2,4,62n+4,n≠2,4,6并且构造了对应的残差完备图;同时证明了n=6时,C5[K3]是唯一的2n+3阶的连通Kn残差图,还对任意正整数n和k,构造了具有2n+2k阶的残差完备图。
3) least mean fourth
最小四阶矩
1.
A code-constrained least mean fourth(LMF) criterion is presented for blind multiuser detection.
为了解决常用高阶准则存在局部极小点问题,提出了一种约束最小四阶矩(LMF)盲多用户信号检测准则,它是最小均方准则(LMS)的一种高阶改进形式。
2.
In CDMA system,a constrained least mean fourth(LMF) criterion is proposed to construct a multi-user detection algorithm.
基于约束最小四阶矩(LeastMean Fourth,LMF)准则,提出了一种新的高阶统计类型的盲多用户检测方法。
4) SOMST
二阶最小生成树
1.
Based on characteristics of the SOMST(Second-Order Minimal Spanning Tree) in which shortcut edges can be avoided,this paper presented a variant of ISOMAP,i.
本文根据二阶最小生成树不含有“短路”边的特性提出了能有效删除邻域图中的“短路”边因而对邻域大小不甚敏感的P-ISOMAP算法。
5) minimal order controller
最小阶控制器
6) minimum G2-aberration
G2最小低阶混杂
1.
Through this formula,projection justification of minimum G2-aberration is established.
通过这个公式,给出了G2最小低阶混杂的投影证明。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条