Extremal properties of flood-filling games

The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about the maximum number of moves that might be required in the worst case remain unanswered. We begin a systematic investigation of such questions, with the goal of determining, for a given graph, the maximum number of moves that may be required, taken over all possible colourings. We give several upper and lower bounds on this quantity for arbitrary graphs and show that all of the bounds are tight for trees; we also investigate how much the upper bounds can be improved if we restrict our attention to graphs with higher edge-density.Comment: Final version, accepted to DMTC

Identifying defective sets using queries of small size

We examine the following version of a classic combinatorial search problem introduced by Rényi: Given a finite set X of n elements we want to identify an unknown subset Y of X, which is known to have exactly d elements, by means of testing, for as few as possible subsets A of X, whether A intersects Y or not. We are primarily concerned with the non-adaptive model, where the family of test sets is specified in advance, in the case where each test set is of size at most some given natural number k. Our main results are nearly tight bounds on the minimum number of tests necessary when d and k are fixed and n is large enough. © 2017 Elsevier B.V

Identification of herbal teas and their compounds eliciting antiviral activity against SARS-CoV-2 in vitro

Background: The SARS-CoV-2/COVID-19 pandemic has inflicted medical and socioeconomic havoc, and despite the current availability of vaccines and broad implementation of vaccination programs, more easily accessible and cost-effective acute treatment options preventing morbidity and mortality are urgently needed. Herbal teas have historically and recurrently been applied as self-medication for prophylaxis, therapy, and symptom alleviation in diverse diseases, including those caused by respiratory viruses, and have provided sources of natural products as basis for the development of therapeutic agents. To identify affordable, ubiquitously available, and effective treatments, we tested herbs consumed worldwide as herbal teas regarding their antiviral activity against SARS-CoV-2. Results: Aqueous infusions prepared by boiling leaves of the Lamiaceae perilla and sage elicit potent and sustained antiviral activity against SARS-CoV-2 when applied after infection as well as prior to infection of cells. The herbal infusions exerted in vitro antiviral effects comparable to interferon-β and remdesivir but outperformed convalescent sera and interferon-α2 upon short-term treatment early after infection. Based on protein fractionation analyses, we identified caffeic acid, perilla aldehyde, and perillyl alcohol as antiviral compounds. Global mass spectrometry (MS) analyses performed comparatively in two different cell culture infection models revealed changes of the proteome upon treatment with herbal infusions and provided insights into the mode of action. As inferred by the MS data, induction of heme oxygenase 1 (HMOX-1) was confirmed as effector mechanism by the antiviral activity of the HMOX-1-inducing compounds sulforaphane and fraxetin. Conclusions: In conclusion, herbal teas based on perilla and sage exhibit antiviral activity against SARS-CoV-2 including variants of concern such as Alpha, Beta, Delta, and Omicron, and we identified HMOX-1 as potential therapeutic target. Given that perilla and sage have been suggested as treatment options for various diseases, our dataset may constitute a valuable resource also for future research beyond virology

Performance of the CMS Cathode Strip Chambers with Cosmic Rays

The Cathode Strip Chambers (CSCs) constitute the primary muon tracking device in the CMS endcaps. Their performance has been evaluated using data taken during a cosmic ray run in fall 2008. Measured noise levels are low, with the number of noisy channels well below 1%. Coordinate resolution was measured for all types of chambers, and fall in the range 47 microns to 243 microns. The efficiencies for local charged track triggers, for hit and for segments reconstruction were measured, and are above 99%. The timing resolution per layer is approximately 5 ns

Aligning the CMS Muon Chambers with the Muon Alignment System during an Extended Cosmic Ray Run

Peer reviewe

Abstracts from the 8th International Conference on cGMP Generators, Effectors and Therapeutic Implications

This work was supported by a restricted research grant of Bayer AG

Extremal properties of flood-filling games

The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about the maximum number of moves that might be required in the worst case remain unanswered. We begin a systematic investigation of such questions, with the goal of determining, for a given graph, the maximum number of moves that may be required, taken over all possible colourings. We give several upper and lower bounds on this quantity for arbitrary graphs and show that all of the bounds are tight for trees; we also investigate how much the upper bounds can be improved if we restrict our attention to graphs with higher edge-density