European clinical guidelines for Tourette syndrome and other tic disorders. Part II: pharmacological treatment

To develop a European guideline on pharmacologic treatment of Tourette syndrome (TS) the available literature was thoroughly screened and extensively discussed by a working group of the European Society for the Study of Tourette syndrome (ESSTS). Although there are many more studies on pharmacotherapy of TS than on behavioral treatment options, only a limited number of studies meets rigorous quality criteria. Therefore, we have devised a two-stage approach. First, we present the highest level of evidence by reporting the findings of existing Cochrane reviews in this field. Subsequently, we provide the first comprehensive overview of all reports on pharmacological treatment options for TS through a MEDLINE, PubMed, and EMBASE search for all studies that document the effect of pharmacological treatment of TS and other tic disorders between 1970 and November 2010. We present a summary of the current consensus on pharmacological treatment options for TS in Europe to guide the clinician in daily practice. This summary is, however, rather a status quo of a clinically helpful but merely low evidence guideline, mainly driven by expert experience and opinion, since rigorous experimental studies are scarce

Influenza vaccination for immunocompromised patients: systematic review and meta-analysis from a public health policy perspective.

Immunocompromised patients are vulnerable to severe or complicated influenza infection. Vaccination is widely recommended for this group. This systematic review and meta-analysis assesses influenza vaccination for immunocompromised patients in terms of preventing influenza-like illness and laboratory confirmed influenza, serological response and adverse events

Clause Learning and New Bounds for Graph Coloring

International audienceGraph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov's tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to produce a clausal explanation of this bound for use in a CDCL algorithm; and a branching heuristic emulating Brelaz on the Zykov tree. The combination of these techniques in both a branch-and-bound and in a bottom-up search outperforms Dsatur and other SAT-based approaches on standard benchmarks both for finding upper bounds and for proving lower bounds