小颜色控制管理探讨

针对某车厂油漆车间小颜色的高浪费率和高返工率问题,采取了合理安排车间的小颜色生产计划,以及改进调漆间加料与循环系统等方法。与此同时,制定了小颜色控制管理流程,从而有效控制了小颜色易产生的喷涂缺陷,如色差、黑点、结漆等,大大减少了返工率,降低了生产成本。

一种新型适用于小颜色的走珠式快速换色系统

针对目前涂装工艺需求及传统模式限制导致小颜色系统存在的问题进行了分析,并对行业上新出现的"走珠式快速换色系统"进行了阐述及总结,通过本系统的优化降低了色差发生率和生产成本,节省了生产时换色时间。

杜尔走珠系统在小颜色喷涂领域中的应用

以上汽大通汽车有限公司无锡分公司涂装车间小颜色喷涂技术攻关项目为背景,从走珠系统的组成、安装调试以及功能性等方面,多层次地论述了杜尔走珠系统的基本工作原理及其在小颜色喷涂领域中的应用。

快速换色系统在涂装车间的应用与改进

快速换色系统是目前最新的一种油漆供应设备,已逐步在各涂装车间推广使用。简要介绍了快速换色系统的组成及其功能,总结了该系统存在的四大优势,强调了通过对系统进行了本地化的改进,使其在涂装车间发挥更大作用。

Rapid vision-based system for secondary copper content estimation

A vision-based color analysis system was developed for rapid estimation of copper content in the secondary copper smelting process. Firstly, cross section images of secondary copper samples were captured by the designed vision system. After the preprocessing and segmenting procedures, the images were selected according to their grayscale standard deviations of pixels and percentages of edge pixels in the luminance component. The selected images were then used to extract the information of the improved color vector angles, from which the copper content estimation model was developed based on the least squares support vector regression (LSSVR) method. For comparison, three additional LSSVR models, namely, only with sample selection, only with improved color vector angle, without sample selection or improved color vector angle, were developed. In addition, two exponential models, namely, with sample selection, without sample selection, were developed. Experimental results indicate that the proposed method is more effective for improving the copper content estimation accuracy, particularly when the sample size is small.

Study on Chironomid Larvae Recognition Based on DWT and Improved KNN

A chironomid larvae images recognition method based on wavelet energy feature and improved KNN is developed. Wavelet decomposition and color information entropy are selected to construct vectors for KNN that is used to classify of the images. The distance function is modified according to the weight determined by the correlation degree between feature and class, which effectively improves classification accuracy. The result shows the mean accuracy of classification rate is up to 95.41% for freshwater plankton images, such as chironomid larvae, cyclops and harpacticoida.

重卡商用车油漆色彩开发及验证

文章描述了重卡商用车新油漆色彩开发的背景和意义,列举了几种主要的开发形式,梳理了新油漆色彩开发流程,重点对色彩开发的整车验证环节进行了详细的介绍。

Preliminary Studies on Inheritance of Seed Color in Black Wheat

[Objective]The aim was to study the inheritance property of the color of seed in black wheat.[Method]Segregation for seed coat colors was studied in F1,F2 and F3 population from eight crosses of four black-seed wheat cultivars（Heixiaomai76,Heixiaomai18,96-45 and S-1）with four white-seed wheat cultivars（9-231,Ningchun16,Ningchun17 and Xinchun22）.[Result]The results showed that the color of Heixiaomai 76 maternal genetic traits is controlled by two incompletely dominant genes,the segregation in F3 populations fits 9（dark）∶7（white）ratio.Color of S-1,96-45,and Heixiaomai 18 is controlled by two Independent and complementary genetic genes,the segregation for black kernel color in F2 populations fits 9（dark）∶7（white）ratio.[Conclusion]Different kinds of new species can be breed through the hybrid of black wheat and white wheat varieties.

Soft measurement for component content based on adaptive model of Pr/Nd color features

For measurement of component content in the extraction and separation process of praseodymium/neodymium(Pr/Nd), a soft measurement method was proposed based on modeling of ion color features, which is suitable for fast estimation of component content in production field. Feature analysis on images of the solution is conducted,which are captured from Pr/Nd extraction/separation field. H/S components in the HSI color space are selected as model inputs, so as to establish the least squares support vector machine(LSSVM) model for Nd(Pr) content,while the model parameters are determined with the GA algorithm. To improve the adaptability of the model,the adaptive iteration algorithm is used to correct parameters of the LSSVM model, on the basis of model correction strategy and new sample data. Using the field data collected from rare earth extraction production, predictive methods for component content and comparisons are given. The results indicate that the proposed method presents good adaptability and high prediction precision, so it is applicable to the fast detection of element content in the rare earth extraction.

AN IMAGE RETRIEVAL METHOD BASED ON SPATIAL DISTRIBUTION OF COLOR

Color histogram is now widely used in image retrieval. Color histogram-based image retrieval methods are simple and efficient but without considering the spatial distribution information of the color. To overcome the shortcoming of conventional color histogram-based image retrieval methods, an image retrieval method based on Radon Transform (RT) is proposed. In order to reduce the computational complexity, wavelet decomposition is used to compress image data. Firstly, images are decomposed by Mallat algorithm. The low-frequency components are then projected by RT to generate the spatial color feature. Finally the moment feature matrices which are saved along with original images are obtained. Experimental results show that the RT based retrieval is more accurate and efficient than traditional color histogram-based method in case that there are obvious objects in images. Further more, RT based retrieval runs significantly faster than the traditional color histogram methods.

Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by χ'' (G). It is shown that if a planar graph G has maximum degree Δ≥9, then χ'' (G) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then χ ''(G) = 9.

Graphs with vertex rainbow connection number two

An edge colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. A vertex colored graph G is vertex rainbow connected if any two vertices are connected by a path whose internal vertices have distinct colors. The vertex rainbow connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G vertex rainbow connected. In 2011, Kemnitz and Schiermeyer considered graphs with rc(G) = 2.We investigate graphs with rvc(G) = 2. First, we prove that rvc(G) 2 if |E(G)|≥n-22 + 2, and the bound is sharp. Denote by s(n, 2) the minimum number such that, for each graph G of order n, we have rvc(G) 2provided |E(G)|≥s(n, 2). It is proved that s(n, 2) = n-22 + 2. Next, we characterize the vertex rainbow connection numbers of graphs G with |V(G)| = n, diam(G)≥3 and clique number ω(G) = n- s for 1≤s≤4.