Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...

Given a grayscale photograph as input, this paper attacks the problem of hallucinating a plausible color version of the photograph. This problem is clearly underconstrained, so previous approaches have either relied on significant user interaction or resulted in desaturated colorizations. We propose a fully automatic approach that produces vibrant and realistic colorizations. We embrace the und...

How the displays of bowerbirds have evolved has attracted widespread interest. Endler et al. (2005) analyzed color use in display in a subset of bowerbird species and generalized their results to all bowerbirds. Here we discuss problems with their analysis that calls into question their conclusions. For example, they state that bowerbirds do not use decorations that match their background, but ...

Fragmentation trees are a technique for identifying molecular formulas and deriving some chemical properties of metabolites small organic molecules solely from mass spectral data. Computing these trees involves nding exact solutions to the NP-hard Maximum Colorful Subtree problem. Existing solvers struggle to solve the large instances involved fast enough to keep up with instrument throughput, ...

Daytime radiative cooling has attracted extensive research interest due to its potential impact for energy sustainability. To achieve subambient during the daytime, a white surface that strongly scatters incident solar light is normally desired. However, in many practical applications (e.g., roofing materials and car coatings), colored surfaces are more popular. Because of this, there strong de...

Let C1, ..., Cd+1 be d+ 1 point sets in R, each containing the origin in its convex hull. A subset C of ⋃d+1i=1 Ciis called a colorful choice (or rainbow) for C1, . . . ,Cd+1, if it contains exactly one point from each set Ci. Thecolorful Carathéodory theorem states that there always exists a colorful choice for C1, . . . , Cd+1 that has theorigin in its convex hull. Thi...