Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
20,143
result(s) for
"Coloring"
Sort by:
Monascus secondary metabolites: production and biological activity
The genus Monascus, comprising nine species, can reproduce either vegetatively with filaments and conidia or sexually by the formation of ascospores. The most well-known species of genus Monascus, namely, M. purpureus, M. ruber and M. pilosus, are often used for rice fermentation to produce red yeast rice, a special product used either for food coloring or as a food supplement with positive effects on human health. The colored appearance (red, orange or yellow) of Monascus-fermented substrates is produced by a mixture of oligoketide pigments that are synthesized by a combination of polyketide and fatty acid synthases. The major pigments consist of pairs of yellow (ankaflavin and monascin), orange (rubropunctatin and monascorubrin) and red (rubropunctamine and monascorubramine) compounds; however, more than 20 other colored products have recently been isolated from fermented rice or culture media. In addition to pigments, a group of monacolin substances and the mycotoxin citrinin can be produced by Monascus. Various non-specific biological activities (antimicrobial, antitumor, immunomodulative and others) of these pigmented compounds are, at least partly, ascribed to their reaction with amino group-containing compounds, i.e. amino acids, proteins or nucleic acids. Monacolins, in the form of β-hydroxy acids, inhibit hydroxymethylglutaryl-coenzyme A reductase, a key enzyme in cholesterol biosynthesis in animals and humans.
Journal Article
Pro photo colorizing with GIMP
Obtain techniques for adding color to black and white or monochrome photographic images using GIMP. In this book you'll also learn to create a hand-tinted effect to add an element of antiquity. Pro Photo Colorizing with GIMP also teaches techniques that enable you to selectively colorize images, mixing black and white with color. There are also tips to go the opposite way: converting color images into black and white (there's more to it than just removing color). Written with both beginning and experienced GIMP users in mind, Pro Photo Colorizing with GIMP shows you how to colorize black and white images to achieve a high degree of realism. What You'll Learn Gain a basic overview of the GIMP workspace, tools, color palettes, layers, and layer masks Learn how to make the proper tonal adjustments to black and white images before starting the colorizing process Complete simple colorizing exercises for beginners and progress to more advanced colorizing techniques Colorize skin, teeth, hair, and eyes Create a nostalgic hand-tinted look and selectively colorize (mixing color with black and white) to create interesting images Use textures and patterns to create artistic colorized images Properly convert color images into black and white Colorize black and white portraits, and re-colorize old faded color portraits Who This Book Is For Pro Photo Colorizing with GIMP is primarily for GIMP users (but users of other photo editing software packages can benefit as well). It is especially useful for those who edit photographs, restore old photographs, or those who want to apply colorizing techniques for artistic effect.
Book
Biological Properties and Applications of Betalains
Betalains are water-soluble pigments present in vacuoles of plants of the order Caryophyllales and in mushrooms of the genera Amanita, Hygrocybe and Hygrophorus. Betalamic acid is a constituent of all betalains. The type of betalamic acid substituent determines the class of betalains. The betacyanins (reddish to violet) contain a cyclo-3,4-dihydroxyphenylalanine (cyclo-DOPA) residue while the betaxanthins (yellow to orange) contain different amino acid or amine residues. The most common betacyanin is betanin (Beetroot Red), present in red beets Beta vulgaris, which is a glucoside of betanidin. The structure of this comprehensive review is as follows: Occurrence of Betalains; Structure of Betalains; Spectroscopic and Fluorescent Properties; Stability; Antioxidant Activity; Bioavailability, Health Benefits; Betalains as Food Colorants; Food Safety of Betalains; Other Applications of Betalains; and Environmental Role and Fate of Betalains.
Journal Article
Alia & Ayman's big book of Palestine
\"Coloring pages and a variety of activity pages inspired by the best selling children's book series!\"--Cover.
Book
Correction: Enhanced pigment content estimation using the Gauss-peak spectra method with thin-layer chromatography for a novel source of natural colorants
[This corrects the article DOI: 10.1371/journal.pone.0251491.].
Journal Article
Distributed $(\\Delta+1)$-Coloring in Linear (in $\\Delta$) Time
The distributed $(\\Delta + 1)$-coloring problem is one of the most fundamental and well-studied problems in distributed algorithms. Starting with the work of Cole and Vishkin in 1986, a long line of gradually improving algorithms has been published. The state-of-the-art running time, prior to our work, is $O(\\Delta \\log \\Delta + \\log^* n)$, due to Kuhn and Wattenhofer [Proceedings of the $25$th Annual ACM Symposium on Principles of Distributed Computing, Denver, CO, 2006, pp. 7--15]. Linial [Proceedings of the $28$th Annual IEEE Symposium on Foundation of Computer Science, Los Angeles, CA, 1987, pp. 331--335] proved a lower bound of $\\frac{1}{2} \\log^* n$ for the problem, and Szegedy and Vishwanathan [Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 201--207] provided a heuristic argument that shows that algorithms from a wide family of locally iterative algorithms are unlikely to achieve a running time smaller than $\\Theta(\\Delta \\log \\Delta)$. We present a deterministic $(\\Delta + 1)$-coloring distributed algorithm with running time $O(\\Delta) + \\frac{1}{2} \\log^* n$. We also present a trade-off between the running time and the number of colors, and devise an $O(\\lambda\\cdot\\Delta)$-coloring algorithm, with running time $O(\\Delta / \\lambda + \\log^* n)$, for any parameter $\\lambda > 1$. Our algorithm breaks the heuristic barrier of Szegedy and Vishwanathan and achieves running time which is linear in the maximum degree $\\Delta$. On the other hand, the conjecture of Szegedy and Vishwanathan may still be true, as our algorithm does not belong to the family of locally iterative algorithms. On the way to this result we study a generalization of the notion of graph coloring, which is called defective coloring [L. Cowen, R. Cowen, and D. Woodall, J. Graph Theory, 10 (1986), pp. 187--195]. In an $m$-defective $p$-coloring the vertices are colored with $p$ colors so that each vertex has up to $m$ neighbors with the same color. We show that an $m$-defective $p$-coloring with reasonably small $m$ and $p$ can be computed very efficiently in the distributed setting. We also develop a technique to employ multiple defective colorings of various subgraphs of the original graph $G$ for computing a $(\\Delta+1)$-coloring of $G$. We believe that these techniques are of independent interest. [PUBLICATION ABSTRACT]
Journal Article