Some version of the statement of the Fundamental Theorem of Algebra first appeared early in the 17th century in the writings of several mathematicians, including Peter Roth, Albert Girard, and René Descartes. The first proof of the Fundamental Theorem was published by Jean Le Rond d’Alembert in 1746 [2], but his proof was not very rigorous. Carl Friedrich Gauss is often credited with producing ...

This paper presents an optimized color characterization model based on radial basis functions (RBF). The performance of the proposed model was tested on a number of different mobile devices and compared with the performance of other state of the art color characterization models. We compared the accuracy of models using the CIELAB color difference. Four different models were discussed in detail...

In this paper we present a method for retrieval of color images via query-by-example which takes into consideration human perception regarding the number of colors present in images being compared.. First, we perform HSV-space segmentation to extract regions of perceptually relevant color, to build a low-level color representation. This segmented result is then used to build image indices by ta...

An ongoing web-based color naming experiment has collected a small number of unconstrained color names from a large number of observers. This has resulted in a large database of color names for a coarse sampling of red, green and blue display values. This paper builds on a previous paper, that demonstrated the close agreement for this technique to earlier results for the basic colors, and prese...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...

We quantified pollinator visit behavior, pollen receipt and export, and changes in allele and genotype frequencies from initial Hardy- Weinberg conditions in experimental arrays of two color morphs of snapdragons (Antirrhinum majus) visited by freely foraging bumble bees (Bombus appositus and B. flavifrons). The number of pollen grains received by a flower depended most on the number of pollina...

Observers viewed displays containing a variable number of distractors of one color and a target of another color. In some experiments, the target and distractors maintained their color from trial to trial; in others, they reversed unpredictably. Observers made a speeded two-choice judgment concerning either the presence, the color, or the shape of the odd-colored target. With only one exception...

The color reproduction of an image sensor is one of the important characteristics which determine the performance of the image sensor. Recently, the pixel size of image sensor has become smaller due to the demand of large pixel count. So, small F-number lens is needed to improve the sensitivity. However, the crosstalk component of spectral sensitivity characteristics increases due to using the ...

This paper proposes a method to apply BPCSSteganography that we have already proposed for gray scale images to palette-based images which consists of a palette storing color vector information and an index image whose pixel value is corresponding to a index in the palette. A palette-based images can be represented by combining R G and B color component images. We embed secret information into t...