نتایج جستجو برای: colors c

تعداد نتایج: 1072323  

Journal: :JAPAN TAPPI JOURNAL 2001

Journal: :iranian journal of basic medical sciences 0
sara faryadian physiology department, faculty of medicine, ilam university of medical sciences, ilam, iran afra khosravi immunology department, faculty of medicine, ilam university of medical sciences, ilam, iran

objective(s):there is much evidence indicating that depression is influenced by the levels of neurotransmitters such as dopamine, gaba and adrenaline. the current study we designed to investigate the effect of exposure of pregnant rats to different colors on neurotransmitters level, as indicators of mood disorders in off springs. materials and methods:five groups of pregnant female wistar rats ...

2011
Marek Karpinski Yakov Nekrich

In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a query range [a, b] and a value K, we have to report K colors with the highest priorities among all colors that occur in A[a..b], sorted in reverse order by their priorities. We show that such queries can be answered in...

2013
Vitaly Voloshin

A mixed hypergraph is a tripleH = (X, C,D), whereX is the vertex set and each of C, D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is an injective mapping c : X → {1, . . . , k} such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. Maximum number of colors in a coloring using all the colo...

Journal: :Scientific American 1878

Journal: :Journal of Vision 2013

2006
Lin Hu Xueliang Li

Let G = (V,E) be an edge-colored graph, i.e., G is assigned a surjective function C : E → {1, 2, · · · , r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Let (B,C) be an edge-colored bipartite graph and d(v) be color degree of a vertex v. We show that if d(v) ≥ k for every vertex v of B, then B has a heterochromatic matching of cardina...

Journal: :Graphs and Combinatorics 2015
Tomás Bálint Július Czap

A facial parity edge coloring of a 2-edge-connected plane graph is such an edge coloring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same color, in addition, for each face f and each color c, either no edge or an odd number of edges incident with f is colored with c. It is known that any 2-edgeconnected plane graph has a facial parity edge c...

2003
Richard H. Hall Patrick Hanna Jakob Nielsen

The purpose of this experiment was to examine the effect of web page text/background color combination on readability, retention, aesthetics, and behavioral intention. One hundred and thirty-six participants studied two Web pages, one with educational content and one with commercial content, in one of four color-combination conditions. Major findings were: a) Colors with greater contrast ratio ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید