نتایج جستجو برای: color number

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

1999
Tonguç Rador

We calculate the rates for lepton number violating processes via the exchange of the Z ′ boson occuring in top-color assisted technicolor. We found that μ-e conversion in nuclei is about an order of magnitude better than μ → 3e for constraining the magnitudes of the lepton mixing angles. The decay μ → eγ yields much weaker bounds. The current experimental limits allow for a mass of the new gaug...

Journal: :Cortex; a journal devoted to the study of the nervous system and behavior 2010
Ilaria Berteletti Edward M Hubbard Marco Zorzi

A fundamental question in the study of consciousness is the connection between subjective report and objective measures. We explored this question by testing NM, a grapheme-color synesthete, who experiences colors when viewing digits but not dot patterns. Synesthesia research has traditionally used variants of the Stroop paradigm as an objective correlate of these subjective synesthetic reports...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

Journal: :CoRR 2016
Siddu P. Algur Narasimha H. Ayachit Vivek R

Color is one of the most important and easily identifiable features for describing the visual content. The MPEG standard has developed a number of descriptor that covers different aspects of the visual content. Dominant color descriptor is one of them. This paper proposes a channelized binning approach, a novel method for extraction of dominant color pixel value, which is a variant of dominant ...

2006
Vikram Jagannathan R. Hariharan Aparna Mahadevan E. Srinivasan

The dependence on computing machines and utility of information has been growing tremendously in the last few decades. As a result, evolving effective techniques for storing and transmitting the ever increasing volumes of data has become a high priority issue. Image compression addresses the problem by reducing the amount of data required to represent a digital image. The underlying basis of th...

Journal: :Electronic Notes in Discrete Mathematics 2016
Maria Pastora Revuelta Marchena Luis Boza Juan Manuel Marín María Isabel Sanz Domínguez

For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number WRk(n, c) is defined as the least integer N , if it exists, such that for every ncoloring of the set {1, 2, ..., N}, there exists a monochromatic solution in that set to the equation x1 + x2 + ... + xk + c = xk+1, such that xi ̸= xj when i ̸= j. If no such N exists, then WRk(n, c) is defined as infinite. In this work, we c...

Journal: :journal of crop protection 2014
mohammad javad ardeh ali mohammadipour raoof kolyaee hassan rahimi hadi zohdi

the leopard moth, zeuzera pyrina (l.) (lepidoptera: cossidae) is a serious pest of walnut and apple trees in iran. one of the control methods for this pest is the mass trapping of males using pheromone traps. to determine the best size and color of traps, four different colors (green, yellow, white, gray) and two different sizes (delta shape with standard adhesive surface, 19 × 22 cm and trapez...

Akbar Derakhshan, Shahram Bamdad, Somaye Bazdar,

Background: Color vision has an important role in daily activities and also learning special talents in different jobs, especially in the field of medicine. However, they are many people all over the world that has no insight into their color blindness and choose the study fields that are completely dependent on vision. Due to the importance of color vision in the field of medicine, we conducte...

Journal: :journal of algorithms and computation 0
alex f. collins rochester institute of technology, school of mathematical sciences, rochester, ny 14623 alexander w. n. riasanovsky university of pennsylvania, department of mathematics, philadelphia, pa 19104, usa john c. wallace trinity college, department of mathematics, hartford, ct 06106, usa stanis law p. radziszowski rochester institute of technology, department of computer science, rochester, ny 14623

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

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

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