And based on it,reach an approach to fast program for unreference die.
介绍了数控电火花线切割加工冲裁模时基准模与非基准模补偿量的计算方法,并在此基础上得出一种快速编制非基准模加工程序的途径。
A lower for the number of non-essential edges of the triangle-free minimally 3-connected graph and the characterization of the graph that reach the lower bound are given.
给出无三边形极小3连通图G的非基本边数的下界︱G︱+3,并证明图G的非基本边数达到下界当且仅当G同构于K3,3。
This theorem ensures the existence of at least one non-essential edge in every simple 3-connected graph that is not a wheel.
对于3连通图中的非基本边。
The distribution of non-essential edges in reduced minimally 3-connected graphs is discussed in this paper.
通过分析简约极小3连通图G的非基本边的分布规律,得出:G中没有连续相邻的5条基本边;G的每一个圈C上至少有15C条非基本边。
The algorithm can solve test number of all nonbasic variable once.
提出了一种关于检验运输问题中最优调运方案的矩阵算法,可以一次性解决所有非基变量的检验数,其优点是既避免了闭回路法中对众多非基变量检验数的逐一计算,又回避了位势法中多次利用求解线性方程组来计算位势的过程。
