1) minimum bend number
最小折数
1.
This article discusses mainly four kinds of 4-regular graphs,gives a minimum bend number rectilinear extension for such a graph with any order,and provides the relation between its order and the minimum bend number.
主要讨论了4类4-正则图的最小折数纵横扩张,对任意阶这样的的4-正则图都给出了它的一个最小折数纵横扩张,并给出了最小折数与阶数之间的关系。
2.
Based on the algorithm for the minimum bend rectilinear extensions of a kind of 4-regular graphs, this thesis shows four types of 4-regular graphs, for which the minimum bend number rectilinear extensions are established and their minimum bend numbers are determined only dependant on their orders.
本论文在一类4-正则平面图最小折数纵横扩张构造方法的基础上,给出了4类4-正则图,建立了它们的最小折数纵横扩张,并且得到它们的最小折数取决于它们的阶数。
3.
This article discusses mainly a class of 4-regular graphs,gives rectilinear extension of minimum bend number for such a graph with any order,and provides the relations between its order and the minimum bend number.
文中提出了一类新的4-正则图并讨论了其最小折数纵横扩张,设计出了求最小纵横扩张的线性时间算法,给出了最小折数与阶数之间的关系。
2) minmax number
最小最大数
3) discounted least squares
打折最小平方
1.
The discounted least squares (DLS) principle is borrowed to construct the learning algorithm of DLS-RBF based upon squared error criterion.
借用打折最小平方 (DLS)原理构建了基于误差平方准则的DLS RBF网络的学习算法 。
4) discount least absolute value
折扣最小一乘法
1.
On the basis of least absolute value and discount coefficient,the discount least absolute value is offered on the parameter estimation in the grey model GM(1,1);in the meanwhile,it is solved by niche genetic algorithm which overcomes a deviation of discount coefficient determined only by one s experience when it is solved by linear programming.
基于拟合误差绝对值和最小及折扣系数建立了GM(1,1)模型参数估计的折扣最小一乘法,给出了求解折扣最小一乘法的小生境遗传算法,它克服了用线性规划方法求解时,折扣系数靠经验确定而易导致偏差的问题。
5) Cutprice least quadratic
折扣最小二乘
6) minimum discount factor
最小折现因子
补充资料：折数
1.折充抵数。 2.惩罚;报应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条