List Defective Colorings: Distributed Algorithms and Applications

The distributed coloring problem is at the core of the area of distributed graph algorithms and it is a problem that has seen tremendous progress over the last few years. Much of the remarkable recent progress on deterministic distributed coloring algorithms is based on two main tools: a) defective colorings in which every node of a given color can have a limited number of neighbors of the same color and b) list coloring, a natural generalization of the standard coloring problem that naturally appears when colorings are computed in different stages and one has to extend a previously computed partial coloring to a full coloring. In this paper, we introduce \emph{list defective colorings}, which can be seen as a generalization of these two coloring variants. Essentially, in a list defective coloring instance, each node $v$ is given a list of colors $x_{v,1},\dots,x_{v,p}$ together with a list of defects $d_{v,1},\dots,d_{v,p}$ such that if $v$ is colored with color $x_{v, i}$, it is allowed to have at most $d_{v, i}$ neighbors with color $x_{v, i}$. We highlight the important role of list defective colorings by showing that faster list defective coloring algorithms would directly lead to faster deterministic $(\Delta+1)$-coloring algorithms in the LOCAL model. Further, we extend a recent distributed list coloring algorithm by Maus and Tonoyan [DISC '20]. Slightly simplified, we show that if for each node $v$ it holds that $\sum_{i=1}^p \big(d_{v,i}+1)^2 > \mathrm{deg}_G^2(v)\cdot polylog\Delta$ then this list defective coloring instance can be solved in a communication-efficient way in only $O(\log\Delta)$ communication rounds. This leads to the first deterministic $(\Delta+1)$-coloring algorithm in the standard CONGEST model with a time complexity of $O(\sqrt{\Delta}\cdot polylog \Delta+\log^* n)$, matching the best time complexity in the LOCAL model up to a $polylog\Delta$ factor

Comparative spatial spread overtime of Zucchini Yellow Mosaic Virus (ZYMV) and Watermelon Mosaic Virus (WMV) in fields of transgenic squash expressing the coat protein genes of ZYMV and WMV, and in fields of nontransgenic squash

The spatial and temporal patterns of aphid-vectored spread of Zucchini Yellow Mosaic Virus (ZYMV) and Watermelon Mosaic Virus (WMV) were monitored over two consecutive years in plantings of nontransgenic and transgenic squash ZW-20H (commercial cv. Freedom II) and ZW-20B, both expressing the coat protein genes of ZYMV and WMV. All test plants were surrounded by nontransgenic plants that were mechanically inoculated with ZYMV or WMV, and served as primary virus source. Across all trials, none of the transgenic plants exhibited systemic symptoms upon infection by ZYMV and WMV but a few of them developed localized chlorotic dots and/or blotches, and had low mixed infection rates [4% (6 of 139) of ZW-20H and 9% (13 of 139) of ZW-20B], as shown by ELISA. Geostatistical analysis of ELISA positive transgenic plants indicated, (i) a lack of spatial relationship on spread of ZYMV and WMV for ZW-20H with flat omnidirectional experimental semivariograms that fitted poorly theoretical models, and (ii) some extent of spatial dependence on ZYMV spread for ZW-20B with a well structured experimental semivariogram that fitted poorly theoretical models during the first but not the second growing season. In contrast, a strong spatial dependence on spread of ZYMV and WMV was found for nontransgenic plants, which developed severe systemic symptoms, had prevalent mixed infection rates (62%, 86 of 139), and well-defined omnidirectional experimental semivariograms that fitted a spherical model. Geostatistical data were sustained by virus transmission experiments with Myzus persicae in screenhouses, showing that commercial transgenic squash ZW-20H alter the dynamics of ZYMV and WMV epidemics by preventing secondary plant-to-plant sprea

Entwicklung eines Algorithmus zur elektiven OP-Einbestellung in der Klinik für Orthopädie und Rheumatologie

Die Arbeit entwickelt eine bedarfsorientierte langfristige Operationsplanung. Dabei werden die gegebenen Rahmenbedingungen der Klinik für Orthopädie und Rheumatologie in Marburg identifiziert und berücksichtigt. Erklärtes Ziel ist die Reduktion des präoperativen stationären Aufenthaltes und somit eine Verminderung der gesamten Aufenthaltsdauer. Dabei soll die Menge an Operationen pro Jahr indes unverändert bleiben. Mithilfe einer Prozessanalyse werden die gegebenen Arbeitsabläufe untersucht und mit dem eigens entwickelten Dokumentationswerkzeug (MaPDok) erfasst, sowie diskutiert. Die Rahmenbedingungen der Klinik werden als innere und äußere Bedingungen aus Sicht des Patienten identifiziert. Innere Bedingungen sind Wahloptionen für den Patienten, äußere Bedingungen sind Vorgaben, auf die der Patient keinen Einfluss hat. Aus diesen Bedingungen ergeben sich vier Merkmale, die zur Entwicklung eines Algorithmus zur OP-Einbestellung berücksichtigt werden. Es werden verschieden Algorithmen mit unterschiedlichem Komplexitätsgrad entwickelt. Um die Hypothese der Reduktion des präoperativen stationären Aufenthaltes und der gesamten Aufenthaltsdauer zu prüfen, erfolgt ein Vergleich der Algorithmen mit der Ausgangssituation durch stochastische Simulation. Bereits der einfachste Algorithmus kann eine deutliche Reduktion des präoperativen Aufenthaltes und der gesamten Aufenthaltsdauer erreichen. Algorithmen mit einem höheren Grad an Komplexität bringen keine wesentlichen Verbesserungen, sind jedoch in der Anwendung schwieriger. Der favorisierte Algorithmus kann mit oder ohne EDV Unterstützung weitgehend Interventions- und Investitionsneutral umgesetzt werden

Fanleaf degeneration/decline disease of grapevines

NYS IPM Type: Fruits IPM Fact SheetFanleaf degeneration/decline disease is one of the most severe viral disease complexes of grapevine worldwide. It is also one of the oldest known viral diseases of Vitis vinifera with descriptions of symptoms being reported in Europe as early as 1841. This disease is now known to affect grapevines in all temperate regions where Vitis vinifera and hybrid rootstocks are grown. Within the United States, fanleaf degeneration/decline is widespread in California, but has also been observed in Washington State, Maryland, Pennsylvania, New York and Missouri

Plum Pox Disease of Stone Fruits

NYS IPM Type: Fruits IPM Fact SheetPlum pox is a viral disease of stone fruits first reported in Bulgarian plums in the 1910’s. More widely known around the world by its Slavic name, sharka, the disease first spread slowly through eastern Europe, gaining momentum in the 1950’s through the 1970’s as it reached western Europe. Movement of the disease continued in North Africa, the middle East, India and the People’s Republic of China, with symptoms first detected in the western hemisphere in Chile in 1992. In the US, plum pox disease was recorded in Pennsylvania in 1999, followed by New York and Michigan in 2006. In Canada, it was detected in Nova Scotia and Ontario in 2000

Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings

We provide CONGEST model algorithms for approximating minimum weighted vertex cover and the maximum weighted matching. For bipartite graphs, we show that a $(1+\varepsilon)$-approximate weighted vertex cover can be computed deterministically in polylogarithmic time. This generalizes a corresponding result for the unweighted vertex cover problem shown in [Faour, Kuhn; OPODIS '20]. Moreover, we show that in general weighted graph families that are closed under taking subgraphs and in which we can compute an independent set of weight at least a $\lambda$-fraction of the total weight, one can compute a $(2-2\lambda +\varepsilon)$-approximate weighted vertex cover in polylogarithmic time in the CONGEST model. Our result in particular implies that in graphs of arboricity $a$, one can compute a $(2-1/a+\varepsilon)$-approximate weighted vertex cover. For maximum weighted matchings, we show that a $(1-\varepsilon)$-approximate solution can be computed deterministically in polylogarithmic CONGEST rounds (for constant $\varepsilon$). We also provide a more efficient randomized algorithm. Our algorithm generalizes results of [Lotker, Patt-Shamir, Pettie; SPAA '08] and [Bar-Yehuda, Hillel, Ghaffari, Schwartzman; PODC '17] for the unweighted case. Finally, we show that even in the LOCAL model and in bipartite graphs of degree $\leq 3$, if $\varepsilon<\varepsilon_0$ for some constant $\varepsilon_0>0$, then computing a $(1+\varepsilon)$-approximation for the unweighted minimum vertex cover problem requires $\Omega\big(\frac{\log n}{\varepsilon}\big)$ rounds. This generalizes aresult of [G\"o\"os, Suomela; DISC '12], who showed that computing a $(1+\varepsilon_0)$-approximation in such graphs requires $\Omega(\log n)$ rounds

Transgenic Melon and Squash Expressing Coat Protein Genes of Aphid-borne Viruses do not Assist the Spread of an Aphid Non- transmissible Strain of Cucumber Mosaic Virus in the Field

Transgenic melon and squash containing the coat protein (CP) gene of the aphid transmissible strain WL of cucumber mosaic cucumovirus (CMV) were grown under field conditions to determine if they would assist the spread of the aphid non-transmissible strain C of CMV, possibly through heterologous encapsidation and recombination. Transgenic melon were susceptible to CMV strain C whereas transgenic squash were resistant although the latter occasionally developed chlorotic blotches on lower leaves. Transgenic squash line ZW-20, one of the parents of commercialized cultivar Freedom II, which expresses the CP genes of the aphid transmissible strains FL of zucchini yellow mosaic (ZYMV) and watermelon mosaic virus 2 (WMV 2) potyviruses was also tested. Line ZW-20 is resistant to ZYMV and WMV 2 but is susceptible to CMV. Field experiments conducted over two consecutive years showed that aphid-vectored spread of CMV strain C did not occur from any of the CMV strain C-challenge inoculated transgenic plants to any of the uninoculated CMV-susceptible non- transgenic plants. Although CMV was detected in 3% (22/764) of the uninoculated plants, several assays including ELISA, RT- PCR-RFLP, identification of CP amino acid at position 168, and aphid transmission tests demonstrated that these CMV isolates were distinct from strain C. Instead, they were non-targeted CMV isolates that came from outside the field plots. This is the first report on field experiments designed to determine the potential of transgenic plants expressing CP genes for triggering changes in virus-vector specificity. Our results indicate that transgenic plants expressing CP genes of aphid transmissible strains of CMV, ZYMV, and WMV 2 are unlikely to mediate the spread of aphid non-transmissible strains of CMV. This finding is of practical relevance because transgenic crops expressing the three CP genes are targeted for commercial release, and because CMV is economically important, has a wide host range, and is widespread worldwid

Classifying the CP properties of the ggH coupling in H+2j production

The Higgs-gluon interaction is crucial for LHC phenomenology. To improve the constraints on the CP structure of this coupling, we investigate Higgs production with two jets using machine learning. In particular, we exploit the CP sensitivity of the so far neglected phase space region that differs from the typical vector boson fusion-like kinematics. Our results suggest that significant improvements in current experimental limits are possible. We also discuss the most relevant observables and how CP violation in the Higgs-gluon interaction can be disentangled from CP violation in the interaction between the Higgs boson and massive vector bosons. Assuming the absence of CP-violating Higgs interactions with coloured beyond-the-Standard-Model states, our projected limits on a CP-violating top-Yukawa coupling are stronger than more direct probes like top-associated Higgs production and limits from a global fit.Comment: 41 pages, 18 figure