着色

The company has a number of plastic products specializing in coloring, modified and functional additive technology developed by staff, with a solid technical foundation and rich experience, has overcome Rubber coloring, additives and many other aspects of problems, development and developed many new products .

公司拥有一批专门从事塑料制品着色、改性和功能助剂开发的技术人员，具有雄厚的技术基础和丰富经验，先后攻克橡塑着色，助剂等许多方面难题，开发和研制了许多新型产品。

The concepts of adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence coloring number of graphs are defined on the basis of the concept of incidence coloring of graphs.

在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数，研究了圈、完全二部图、Cm。

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.

在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数：对图G，设Q_u={|u"∈N}∪{|u∈N}，σ：I→C为图G的k-关联着色，C_u表示着在Q_u上的色集。

If for any uv∈E, C_u≠C_v, then we callσis a k-adjacent vertex distinguishing incidence coloring of G andχ_=min{k| there exists a k- adjacent vertex distinguishing incidence coloring of G} is the adjacent vertex distinguishing incidence chromatic number of G.

若对任意uv∈E满足C_u≠C_v，则称σ为G的k-邻点可区别关联着色，并称X_=min{k|存在G的k-邻点可区别关联着色}为G的邻点可区别关联色数。

A lot of experts and investigators who are domestic and overseas give researches and discusses about it, it can be expressed as a bipartite graph edges coloring problem under a certain constraints condition.

国内外的许多学者对它进行了研究和讨论，在某些限制条件下，可以表述为二部图的边着色问题，但通常比着色问题复杂。

Color filter is structured by 4 major components: Black Matrix to block light, pattern to display colors, transparent protection film made from protection pattern and transparent electrode film used for driver LC.

Color filter一般是由遮光用的Black matrix、color显示用的着色pattern、保护着色pattern的透明保护膜、以及驱动液晶用的透明电极膜等4种要素所构成。

At last, we learn the property of the problem on the relaxed game chromatic on graphs. Then we introduce the concept of edge relaxed game chromatic number, and we give the upbound of edge relaxed game chromatic number of chain and cycle.

最后对于松弛对策着色问题进行了初步的探讨，提出了边松弛对策着色问题，给出了边松弛对策色数的概念，并给出了链、圈的边松弛对策色数的上界。

Characters and features: in excellent performance of coloring, in bright color of brown yellow, good tinting streng thand covering capacity, tinting strength almost equivalent to lead oxide yellow or chrome yellow, good resistance to light and atmosphere and foul gas.

性状特点：具有优良的颜料性能，色泽为鲜明的褐黄色，着色力和遮盖力都好，着色力几乎与铅黄铬黄相等，耐光、大气性、污浊气体性都非常好。

A brief introduction to the automatic plotting aerogeophysical profile map is given firstly in this paper, and some processing methods are described on some plotting issues.

简要介绍了航空物探平面剖面图的自动绘制方法，给出了绘制中对一些问题的处理方法；重点介绍了彩色渐变填充着色、彩色渐变渲染着色等几种可视化处理方法，并提出了着色中渐变度、透明度概念及应用方法。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。