Optimal (Degree+1)-Coloring in Congested Clique

We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u)+1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list coloring problem is a natural generalization of the classical (?+1)-coloring and (?+1)-list coloring problems, both being benchmark problems extensively studied in distributed and parallel computing. In this paper we settle the complexity of the (degree+1)-list coloring problem in the Congested Clique model by showing that it can be solved deterministically in a constant number of rounds

Optimal (degree+1)-Coloring in Congested Clique

We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u) + 1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list coloring problem is a natural generalization of the classical (Δ + 1)-coloring and (Δ + 1)-list coloring problems, both being benchmark problems extensively studied in distributed and parallel computing. In this paper we settle the complexity of the (degree+1)-list coloring problem in the Congested Clique model by showing that it can be solved deterministically in a constant number of rounds

Students and Their Meetings with Guidance Counselors: Findings From a National Study

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/66655/2/10.1177_019263659407856516.pd

Optimal (degree+1)-coloring in congested clique

We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u) + 1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list coloring problem is a natural generalization of the classical (Δ + 1)-coloring and (Δ + 1)-list coloring problems, both being benchmark problems extensively studied in distributed and parallel computing. In this paper we settle the complexity of the (degree+1)-list coloring problem in the Congested Clique model by showing that it can be solved deterministically in a constant number of rounds

Parallel derandomization for coloring

Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designing efficient deterministic algorithms for these problems has been found particularly challenging. In this work we consider this challenge, and design a novel framework for derandomizing algorithms for coloring-type problems in the Massively Parallel Computation (MPC) model with sublinear space. We give an application of this framework by showing that a recent (degree+1)-list coloring algorithm by Halldorsson et al. (STOC'22) in the LOCAL model of distributed computation can be translated to the MPC model and efficiently derandomized. Our algorithm runs in O(log log log n) rounds, which matches the complexity of the state of the art algorithm for the (Delta + 1)-coloring problem

NADPH oxidase 4 protects against development of endothelial dysfunction and atherosclerosis in LDL receptor deficient mice

AIMS Endothelial dysfunction is an early step in the development of atherosclerosis. Increased formation of superoxide anions by NADPH oxidase Nox1, 2, and 5 reduces nitric oxide availability and can promote endothelial dysfunction. In contrast, recent evidence supports a vasoprotective role of H2O2 produced by main endothelial isoform Nox4. Therefore, we analysed the impact of genetic deletion of Nox4 on endothelial dysfunction and atherosclerosis in the low-density lipoprotein receptor (Ldlr) knockout model. METHODS AND RESULTS Ex vivo analysis of endothelial function by Mulvany myograph showed impaired endothelial function in thoracic aorta of Nox4(-/-)/Ldlr(-/-) mice. Further progression of endothelial dysfunction due to high-fat diet increased atherosclerotic plaque burden and galectin-3 staining in Nox4(-/-)/Ldlr(-/-) mice compared with Ldlr(-/-) mice. Under physiological conditions, loss of Nox4 does not influence aortic vascular function. In this setting, loss of Nox4-derived H2O2 production could be partially compensated for by nNOS upregulation. Using an innovative optical coherence tomography approach, we were able to analyse endothelial function by flow-mediated vasodilation in the murine saphenous artery in vivo. This new approach revealed an altered flow-mediated dilation in Nox4(-/-) mice, indicating a role for Nox4 under physiological conditions in peripheral arteries in vivo. CONCLUSIONS Nox4 plays an important role in maintaining endothelial function under physiological and pathological conditions. Loss of Nox4-derived H2O2 could be partially compensated for by nNOS upregulation, but severe endothelial dysfunction is not reversible. This leads to increased atherosclerosis under atherosclerotic prone conditions

Formación de películas anódicas en una aleaciónAl-W: Migración de fósforo

El presente trabajo investiga la incorporación y migración de especies de fósforo en las películas anódicas y su interacción con las especies de wolframio incorporadas a las películas anódicas desde el sustrato metálico. El estudio usa películas de alúmina, formadas sobre una aleación Al-15at.%W depositada catódicamente, en soluciones que contienen fosfatos. La morfología y la composición de las películas se determinaron por microscopia electrónica de barrido (SEM) y espectroscopia de emisión óptica (GDOES). Se observó que las películas están constituidas o por una región externa rica en wolframio y una región interna relativamente libre de wolframio, o solamente por una región rica en wolframio. Las especies de fósforo migran hacia dentro de la película más despacio en las películas que contienen wolframio que en las que no contienen wolframio. En contraste, la migración de las especies de wolframio hacia la solución no se ve afectada por la presencia de fósforo

Combining remote sensing and household level data for regional scale analysis of land cover change in the Brazilian Amazon

Land cover change in the Brazilian Amazon depends on the spatial variability of political, socioeconomic and biophysical factors, as well as on the land use history and its actors. A regional scale analysis was made in Rondônia State to identify possible differences in land cover change connected to spatial policies of land occupation, size and year of establishment of properties, accessibility measures and soil fertility. The analysis was made based on remote sensing data and household level data gathered with a questionnaire. Both types of analyses indicate that the highest level of total deforestation is found inside agrarian projects, especially in those established more than 20 years ago. Even though deforestation rates are similar inside and outside official settlements, inside agrarian projects forest depletion can exceed 50% at the property level within 10–14 years after establishment. The data indicate that both small-scale and medium to large-scale farmers contribute to deforestation processes in Rondônia State encouraged by spatial policies of land occupation, which provide better accessibility to forest fringes where soil fertility and forest resources are important determinants of location choic