1) topcolor
顶色
1.
We calculated the Pseudo-Goldstone bosons (technipions, top-pious) corrections to the cross-section a of the process e+ e- →bs in topcolor-assisted multiscale technicolor model at LEP Ⅱ energy region.
讨论了顶色辅助的多标度人工色理论预言的赝标哥尔斯通玻色子（ｔｅｃｈ－ ｎｉｐｉｏｎｓ，ｔｏｐ－ｐｉｏｕｓ）对稀有过程ｅ＋ｅ－→ｂｓ的单圈效应，计算了该过程在ＬＥＰⅡ上 的产生截面，得到较标准模型预言值要大一个数量级的数值结果。
2) displacement chromatography
顶替色谱
1.
As a nonlinear chromatographic technique, displacement chromatography has attractive more attention since its introduction in 1943.
作为一种非线性的色谱技术,顶替色谱自问世以来以分辨率高和处理量大而受到业界极大的关注。
3) vertex coloring
顶点着色
1.
Mind evolutionary computation is used in solving vertex coloring problem.
应用思维进化计算求解顶点着色问题,给出求解给定图的色数、最小着色的算法。
2.
Based on the principle of graph theory, the paper transforms the matching/storing problem of railway dangerous goods into vertex coloring problem.
应用图论的原理将危险货物的配放问题转化为对图的顶点着色问题。
4) colour temperature of the zenigh
天顶色温
5) the color of roof
屋顶色彩
6) vertex coloring
顶点染色
1.
The paper shows that the n-dimensional d-ary De Bruijn Graph B(d,n ) is equitable (d+ 1 )-colorable,namely,the set of d" venices of B (d,n ) can be partitioned into d+ 1A vertex coloring theorem of linedigraphs is also proved.
给出了ｎ维ｄ进位ＤｅＢｒｕｉｊｎ图Ｂ（ｄ，ｎ）的一种均匀顶点ｄ＋１染色，即将其顶点集分拆成顶点个数至多相差１的ｄ＋１个无关集，并证明了关于一般有向图的线图的一个顶点染色定理。
2.
In this article,we use the fractional chromatic number to discuss the vertex coloring about a kind of cyclic graph of regularity of degree 6.
运用图的分数染色讨论了一类6-正则循环图的顶点染色,得到了邻接矩阵的首行具有形式(01110…0111)的n阶循环图G点色数:X(G)={4,4|n5,其它。
3.
This paper turns this problem into a mathematical model and resolves it with method of vertex coloring in picture theory,resulting in relatively reasonable algorithms and results.
本文将此问题提炼为一个数学模型，并用图论中已有的顶点染色法解决，得出了较为合理的算法和结果。
补充资料：顶色
1.指顶珠的颜色。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条