Distributed Approximation of Maximum Independent Set and Maximum Matching

We present a simple distributed $\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\mathsf{CONGEST}$ model which completes in $O(\texttt{MIS}(G)\cdot \log W)$ rounds, where $\Delta$ is the maximum degree, $\texttt{MIS}(G)$ is the number of rounds needed to compute a maximal independent set (MIS) on $G$, and $W$ is the maximum weight of a node. %Whether our algorithm is randomized or deterministic depends on the \texttt{MIS} algorithm used as a black-box. Plugging in the best known algorithm for MIS gives a randomized solution in $O(\log n \log W)$ rounds, where $n$ is the number of nodes. We also present a deterministic $O(\Delta +\log^* n)$-round algorithm based on coloring. We then show how to use our MaxIS approximation algorithms to compute a $2$-approximation for maximum weight matching without incurring any additional round penalty in the $\mathsf{CONGEST}$ model. We use a known reduction for simulating algorithms on the line graph while incurring congestion, but we show our algorithm is part of a broad family of \emph{local aggregation algorithms} for which we describe a mechanism that allows the simulation to run in the $\mathsf{CONGEST}$ model without an additional overhead. Next, we show that for maximum weight matching, relaxing the approximation factor to ($2+\varepsilon$) allows us to devise a distributed algorithm requiring $O(\frac{\log \Delta}{\log\log\Delta})$ rounds for any constant $\varepsilon>0$. For the unweighted case, we can even obtain a $(1+\varepsilon)$-approximation in this number of rounds. These algorithms are the first to achieve the provably optimal round complexity with respect to dependency on $\Delta$

Baseline cerebral oximetry values in cardiac and vascular surgery patients: a prospective observational study

<p>Abstract</p> <p>Aim</p> <p>This study was conducted to evaluate baseline INVOS values and identify factors influencing preoperative baseline INVOS values in carotid endarterectomy and cardiac surgery patients.</p> <p>Methods</p> <p>This is a prospective observational study on 157 patients (100 cardiac surgery patients, 57 carotid endarterectomy patients). Data were collected on factors potentially related to baseline INVOS values. Data were analyzed with student's t-test, Chi-square, Pearson's correlation or Linear Regression as appropriate.</p> <p>Results</p> <p>100 cardiac surgery patients and 57 carotid surgery patients enrolled. Compared to cardiac surgery, carotid endarterectomy patients were older (71.05 ± 8.69 vs. 65.72 ± 11.04, P < 0.001), with higher baseline INVOS (P < 0.007) and greater stroke frequency (P < 0.002). Diabetes and high cholesterol were more common in cardiac surgery patients. Right side INVOS values were strongly correlated with left-side values in carotid (r = 0.772, P < 0.0001) and cardiac surgery patients (r = 0.697, P < 0.0001). Diabetes and high cholesterol were associated with significantly (P < 0.001) lower INVOS and smoking was associated with higher INVOS values in carotid, but not in cardiac surgery patients. Age, sex, CVA history, Hypertension, CAD, Asthma, carotid stenosis side and surgery side were not related to INVOS. Multivariate analysis showed that diabetes is strongly associated with lower baseline INVOS values bilaterally (P < 0.001) and explained 36.4% of observed baseline INVOS variability in carotid (but not cardiac) surgery.</p> <p>Conclusion</p> <p>Compared to cardiac surgery, carotid endarterectomy patients are older, with higher baseline INVOS values and greater stroke frequency. Diabetes and high cholesterol are associated with lower baseline INVOS values in carotid surgery. Right and left side INVOS values are strongly correlated in both patient groups.</p

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous if it admits a b-coloring with t colors, for every t = \chi(G),\ldots,\chi_b(G), and b-monotonic if \chi_b(H_1) \geq \chi_b(H_2) for every induced subgraph H_1 of G, and every induced subgraph H_2 of H_1. We investigate the b-chromatic number of graphs with stability number two. These are exactly the complements of triangle-free graphs, thus including all complements of bipartite graphs. The main results of this work are the following: - We characterize the b-colorings of a graph with stability number two in terms of matchings with no augmenting paths of length one or three. We derive that graphs with stability number two are b-continuous and b-monotonic. - We prove that it is NP-complete to decide whether the b-chromatic number of co-bipartite graph is at most a given threshold. - We describe a polynomial time dynamic programming algorithm to compute the b-chromatic number of co-trees. - Extending several previous results, we show that there is a polynomial time dynamic programming algorithm for computing the b-chromatic number of tree-cographs. Moreover, we show that tree-cographs are b-continuous and b-monotonic

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs.

An (r,ℓ)(r,ℓ)-partition of a graph G is a partition of its vertex set into r independent sets and ℓℓ cliques. A graph is (r,ℓ)(r,ℓ) if it admits an (r,ℓ)(r,ℓ)-partition. A graph is well-covered if every maximal independent set is also maximum. A graph is (r,ℓ)(r,ℓ)-well-covered if it is both (r,ℓ)(r,ℓ) and well-covered. In this paper we consider two different decision problems. In the (r,ℓ)(r,ℓ)-Well-Covered Graph problem ((r,ℓ)(r,ℓ) wcg for short), we are given a graph G, and the question is whether G is an (r,ℓ)(r,ℓ)-well-covered graph. In the Well-Covered (r,ℓ)(r,ℓ)-Graph problem (wc (r,ℓ)(r,ℓ) g for short), we are given an (r,ℓ)(r,ℓ)-graph G together with an (r,ℓ)(r,ℓ)-partition of V(G) into r independent sets and ℓℓ cliques, and the question is whether G is well-covered. We classify most of these problems into P, coNP-complete, NP-complete, NP-hard, or coNP-hard. Only the cases wc(r, 0)g for r≥3r≥3 remain open. In addition, we consider the parameterized complexity of these problems for several choices of parameters, such as the size αα of a maximum independent set of the input graph, its neighborhood diversity, or the number ℓℓ of cliques in an (r,ℓ)(r,ℓ)-partition. In particular, we show that the parameterized problem of deciding whether a general graph is well-covered parameterized by αα can be reduced to the wc (0,ℓ)(0,ℓ) g problem parameterized by ℓℓ, and we prove that this latter problem is in XP but does not admit polynomial kernels unless coNP⊆NP/polycoNP⊆NP/poly

The Canine Papillomavirus and Gamma HPV E7 Proteins Use an Alternative Domain to Bind and Destabilize the Retinoblastoma Protein

The high-risk HPV E6 and E7 proteins cooperate to immortalize primary human cervical cells and the E7 protein can independently transform fibroblasts in vitro, primarily due to its ability to associate with and degrade the retinoblastoma tumor suppressor protein, pRb. The binding of E7 to pRb is mediated by a conserved Leu-X-Cys-X-Glu (LXCXE) motif in the conserved region 2 (CR2) of E7 and this domain is both necessary and sufficient for E7/pRb association. In the current study, we report that the E7 protein of the malignancy-associated canine papillomavirus type 2 encodes an E7 protein that has serine substituted for cysteine in the LXCXE motif. In HPV, this substitution in E7 abrogates pRb binding and degradation. However, despite variation at this critical site, the canine papillomavirus E7 protein still bound and degraded pRb. Even complete deletion of the LXSXE domain of canine E7 failed to interfere with binding to pRb in vitro and in vivo. Rather, the dominant binding site for pRb mapped to the C-terminal domain of canine E7. Finally, while the CR1 and CR2 domains of HPV E7 are sufficient for degradation of pRb, the C-terminal region of canine E7 was also required for pRb degradation. Screening of HPV genome sequences revealed that the LXSXE motif of the canine E7 protein was also present in the gamma HPVs and we demonstrate that the gamma HPV-4 E7 protein also binds pRb in a similar way. It appears, therefore, that the type 2 canine PV and gamma-type HPVs not only share similar properties with respect to tissue specificity and association with immunosuppression, but also the mechanism by which their E7 proteins interact with pRb

Search for R-parity-violating supersymmetry in events with four or more leptons in sqrt(s) =7 TeV pp collisions with the ATLAS detector

A search for new phenomena in final states with four or more leptons (electrons or muons) is presented. The analysis is based on 4.7 fb−1 of $\sqrt{s}=7\;\mathrm{TeV}$ proton-proton collisions delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with Standard Model expectations in two signal regions: one that requires moderate values of missing transverse momentum and another that requires large effective mass. The results are interpreted in a simplified model of R-parity-violating supersymmetry in which a 95% CL exclusion region is set for charged wino masses up to 540 GeV. In an R-parity-violating MSUGRA/CMSSM model, values of m 1/2 up to 820 GeV are excluded for 10 < tan β < 40

Search for high-mass resonances decaying to dilepton final states in pp collisions at s√=7 TeV with the ATLAS detector

The ATLAS detector at the Large Hadron Collider is used to search for high-mass resonances decaying to an electron-positron pair or a muon-antimuon pair. The search is sensitive to heavy neutral Z′ gauge bosons, Randall-Sundrum gravitons, Z * bosons, techni-mesons, Kaluza-Klein Z/γ bosons, and bosons predicted by Torsion models. Results are presented based on an analysis of pp collisions at a center-of-mass energy of 7 TeV corresponding to an integrated luminosity of 4.9 fb−1 in the e + e − channel and 5.0 fb−1 in the μ + μ −channel. A Z ′ boson with Standard Model-like couplings is excluded at 95 % confidence level for masses below 2.22 TeV. A Randall-Sundrum graviton with coupling k/MPl=0.1 is excluded at 95 % confidence level for masses below 2.16 TeV. Limits on the other models are also presented, including Technicolor and Minimal Z′ Models

At What Stage of Neural Processing Does Cocaine Act to Boost Pursuit of Rewards?

Dopamine-containing neurons have been implicated in reward and decision making. One element of the supporting evidence is that cocaine, like other drugs that increase dopaminergic neurotransmission, powerfully potentiates reward seeking. We analyze this phenomenon from a novel perspective, introducing a new conceptual framework and new methodology for determining the stage(s) of neural processing at which drugs, lesions and physiological manipulations act to influence reward-seeking behavior. Cocaine strongly boosts the proclivity of rats to work for rewarding electrical brain stimulation. We show that the conventional conceptual framework and methods do not distinguish between three conflicting accounts of how the drug produces this effect: increased sensitivity of brain reward circuitry, increased gain, or decreased subjective reward costs. Sensitivity determines the stimulation strength required to produce a reward of a given intensity (a measure analogous to the KM of an enzyme) whereas gain determines the maximum intensity attainable (a measure analogous to the vmax of an enzyme-catalyzed reaction). To distinguish sensitivity changes from the other determinants, we measured and modeled reward seeking as a function of both stimulation strength and opportunity cost. The principal effect of cocaine was a two-fourfold increase in willingness to pay for the electrical reward, an effect consistent with increased gain or decreased subjective cost. This finding challenges the long-standing view that cocaine increases the sensitivity of brain reward circuitry. We discuss the implications of the results and the analytic approach for theories of how dopaminergic neurons and other diffuse modulatory brain systems contribute to reward pursuit, and we explore the implications of the conceptual framework for the study of natural rewards, drug reward, and mood

A Model of Brain Circulation and Metabolism: NIRS Signal Changes during Physiological Challenges

We construct a model of brain circulation and energy metabolism. The model is designed to explain experimental data and predict the response of the circulation and metabolism to a variety of stimuli, in particular, changes in arterial blood pressure, CO2 levels, O2 levels, and functional activation. Significant model outputs are predictions about blood flow, metabolic rate, and quantities measurable noninvasively using near-infrared spectroscopy (NIRS), including cerebral blood volume and oxygenation and the redox state of the CuA centre in cytochrome c oxidase. These quantities are now frequently measured in clinical settings; however the relationship between the measurements and the underlying physiological events is in general complex. We anticipate that the model will play an important role in helping to understand the NIRS signals, in particular, the cytochrome signal, which has been hard to interpret. A range of model simulations are presented, and model outputs are compared to published data obtained from both in vivo and in vitro settings. The comparisons are encouraging, showing that the model is able to reproduce observed behaviour in response to various stimuli

Tractability in Constraint Satisfaction Problems: A Survey

International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tractable classes of CSP instances have been identified. After discussing different forms and uses of tractability, we describe some landmark tractable classes and survey recent theoretical results. Although we concentrate on the classical CSP, we also cover its important extensions to infinite domains and optimisation, as well as #CSP and QCSP