Explore the vast range of titles available.

The paravertebral spread that occurs after erector spinae plane block may be volume-dependent. This cadaveric study was undertaken to compare the extent of paravertebral spread with erector spinae plane block using different dye volumes. After randomization, twelve erector spinae plane blocks were performed bilaterally with either 10 ml or 30 ml of dye at the level of T5 in seven unembalmed cadavers except for two cases of unexpected pleural puncture using the 10 ml injection. Direct visualization of the paravertebral space by endoscopy was performed immediately after the injections. The back regions were also dissected, and dye spread and nerve involvement were investigated. A total of five 10 ml injections and seven 30 ml injections were completed for both endoscopic and anatomical evaluations. No paravertebral spread was observed by endoscopy after any of the 10-ml injections. Dye spread to spinal nerves at the intervertebral foramen was identified by endoscopy at adjacent levels of T5 (median: three levels) in all 30 ml injections. In contrast, the cases with two, four, and three out of five were stained at only the T4, T5, and T6 levels, respectively, with the 10 ml injection. Upon anatomical dissection, all blocks were consistently associated with posterior and lateral spread to back muscles and fascial layers, especially with the 30 ml injections, which showed greater dye expansion. In one 30 ml injection, sympathetic nerve involvement and epidural spread were observed at the level of the injection site. Although paravertebral spread following erector spinae plane block increased in a volume-dependent manner, this increase was variable and not pronounced. As the injectate volume increased for the erector spinae blocks, the injectate spread to the back muscles and fascial layers seemed to be predominantly increased compared with, the extent of paravertebral spread.

The clustered chromatic number of a class of graphs is the minimum integer$k$such that for some integer$c$every graph in the class is$k$-colourable with monochromatic components of size at most$c$. We determine the clustered chromatic number of any minor-closed class with bounded treedepth, and prove a best possible upper bound on the clustered chromatic number of any minor-closed class with bounded pathwidth. As a consequence, we determine the fractional clustered chromatic number of every minor-closed class.

Petruševski and Škrekovski recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph G is said to be odd if for each non-isolated vertex x ∈ V ( G ) there exists a colour c appearing an odd number of times in its neighbourhood N ( x ). Petruševski and Škrekovski proved that for any planar graph G there is an odd colouring using at most 9 colours and, together with Caro, showed that 8 colours are enough for a significant family of planar graphs. We show that 8 colours suffice for all planar graphs.

We investigate the list packing number of a graph, the least$k$such that there are always$k$disjoint proper list-colourings whenever we have lists all of size$k$associated to the vertices. We are curious how the behaviour of the list packing number contrasts with that of the list chromatic number, particularly in the context of bounded degree graphs. The main question we pursue is whether every graph with maximum degree$\\Delta$has list packing number at most$\\Delta +1$. Our results highlight the subtleties of list packing and the barriers to, for example, pursuing a Brooks’-type theorem for the list packing number.

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.

We undertook a randomised, double-blinded, placebo-controlled, crossover trial to test whether intake of artificial food colour and additives (AFCA) affected childhood behaviour. 153 3-year-old and 144 8/9-year-old children were included in the study. The challenge drink contained sodium benzoate and one of two AFCA mixes (A or B) or a placebo mix. The main outcome measure was a global hyperactivity aggregate (GHA), based on aggregated z-scores of observed behaviours and ratings by teachers and parents, plus, for 8/9-year-old children, a computerised test of attention. This clinical trial is registered with Current Controlled Trials (registration number ISRCTN74481308). Analysis was per protocol. 16 3-year-old children and 14 8/9-year-old children did not complete the study, for reasons unrelated to childhood behaviour. Mix A had a significantly adverse effect compared with placebo in GHA for all 3-year-old children (effect size 0·20 [95% CI 0·01–0·39], p=0·044) but not mix B versus placebo. This result persisted when analysis was restricted to 3-year-old children who consumed more than 85% of juice and had no missing data (0·32 [0·05–0·60], p=0·02). 8/9-year-old children showed a significantly adverse effect when given mix A (0·12 [0·02–0·23], p=0·023) or mix B (0·17 [0·07–0·28], p=0·001) when analysis was restricted to those children consuming at least 85% of drinks with no missing data. Artificial colours or a sodium benzoate preservative (or both) in the diet result in increased hyperactivity in 3-year-old and 8/9-year-old children in the general population.

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.

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]

[This corrects the article DOI: 10.1371/journal.pone.0251491.].