Fix an integer N ≥ 2. To each diagram of a link colored by 1, . . . , N , we associate a chain complex of graded matrix factorizations. We prove that the homopoty type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain complex defined by Khovanov and Rozansky in [17]. We call the homology o...

The relationship between color and perceived depth for realistic, colored objects with varying shading was explored. Background: Studies have shown that warm-colored stimuli tend to appear nearer in depth than cool-colored stimuli. The majority of these studies asked human observers to view physically equidistant, colored stimuli and compare them for relative depth. However, in most cases, the ...

The mutation process is introduced into the colored coalescent theory. The mutation process can be viewed as an independent Poisson process running on the colored genealogical random tree generated by the colored coalescent process, with the edge lengths of the random tree serving as the time scale for the mutation process. Moving backward along the colored genealogical tree, the color of verti...

In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure for several image processing applications. Traditionally, images are represented by a regular grid of square pixels with one constant color each. In the twocolored pixel representation, we reduce the image resolution an...

Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs explained by unique least resolved trees. We prove property rooted, leaf-colored tree be for some BMG is preserved contraction inner edges. For special case two-colored BMGs, this leads ch...

The translocation of (14)C-photosynthate in detached blades of sugarcane was studied under illumination from red, green, blue, and cool-white fluorescent lamps; under far-red illumination from the sun, and from incandescent lamps; and in total darkness.The percentage of basipetal translocation and the accumulation against the concentration gradient were stimulated by light from the red or blue ...

Nested words allow modeling of linear and hierarchical structure in data, and nested word automata are special kinds of pushdown automata whose push/pop actions are directed by the hierarchical structure in the input nested word. The resulting class of regular languages of nested words has many appealing theoretical properties, and has found many applications, including model checking of proced...

Network motifs are small overrepresented patterns that have been used successfully to characterize complex networks. Current algorithmic approaches focus essentially on pure topology and disregard node and edge nature. However, it is often the case that nodes and edges can also be classified and separated into different classes. This kind of networks can be modeled by colored (or labeled) graph...

Fig. 1. Our technique enables color printing with precisely controlled gradients using a filament printer. Le : The printer is equipped with an o -the-shelf nozzle that inputs multiple filaments (three in the picture) and outputs molten mixed plastic through a single exit hole. Such devices cannot directly be used to print gradients: the transition between mixtures takes time, and this timing v...

In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate sketching techniques on our framework, we obtained efficient data structures that provide approximate solutions to these problems. In addition, the framework can be employed to attack other related problems by findin...