1)  disjoint union
无交并
1.
In the notes, we introduce the concept of KI union algebras of BCI-algebras as a generaization of one of disjoint union of BCK-algebras.
本文引入BCI-代数的KI并代数,它是BCK-代数的无交并的推广。
2)  disjoint union graph
无交并图
1.
This paper defines weak odd strong harmonious labeling and proves that disjoint union graphs ∪ from i=1 to n(m_iC_4~2) are odd graceful and weak odd strong harmony.
定义了次奇强协调标号,并证明无交并图∪ from i=1 to n (m_iC_4~2)是奇优美的和次奇强协调的。
2.
This paper defines weak odd strong harmonious labeling and proves that disjoint union graphs (?)m_iC_1~2 are odd graceful and weak odd strong harmony.
定义了次奇强协调标号,并证明无交并图■m_i C_4~2是奇优美的和次奇强协调的。
3)  non-crossing
无交叉
1.
Research conclusions:Simple non-crossing mode is easy to arrange and fix because the system has no crossing between OCS on main line and sid.
研究结论:简单无交叉布置方式正线接触网与侧线接触网无交叉,易于布置及安装;带导向悬挂的无交叉布置方式导向接触网位于正线和侧线接触网之间,在道岔岔心附近区域导向接触网始终与受电弓接触,使得受电弓平稳地从侧线过渡到正线或从正线过渡到侧线,从而减小对正线接触网的冲击,导向接触线亦不会出现非正常磨损,该布置方式对速度适应性更好,弓网受流性能更佳。
4)  without interleaving bus
无交错线
5)  non-interactive
无交互
1.
This paper extends an existed non-interactive sampling scheme based on bin-tree to suit the actual situation.
针对一个已有的基于二叉树的无交互防欺骗检测方法进行改进。
6)  cross-free family
无交叉组
1.
By using the so-called tree representation for any cross-free family,introduced by Edmonds et al.
考虑k≥2,运用Edmonds等人在研究组合优化问题中引入的对无交叉组的树表示,证明了在k≥2时,D中至少有3个出度为k的点。
参考词条
补充资料:交并
1.交集。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。