Effects of candesartan cilexetil on carotid remodeling in hypertensive diabetic patients: the MITEC study

In hypertension and diabetes, early structural changes of the arterial wall precede or support atherosclerosis. There is evidence that some antihypertensive drugs exert an antiathero-sclerotic effect. Over 36 months, we investigated the effect of candesartan cilexetil (CC) on the common carotid intima-media thickness (IMT) vs amlodipine besylate (AML) in patients with type 2 diabetes and mild to moderate essential hypertension. After a 4-week wash-out period, 209 patients were randomized to either CC 8 mg or AML 5 mg once daily for a minimum of 1 month, after which, if BP was not normalized, the dosage was doubled, followed by the addition of hydrochlorothiazide 12.5 mg if necessary. No significant differences were observed between the two groups for change in IMT at M12 (−0.001 vs −0.027 mm/year for CC and AML respectively, p = 0.425), at M24 (−0.033 vs −0.019 mm per year respectively, p = 0.442), and at the last visit (−0.016 vs −0.039 mm per year respectively, p = 0.549). Within the group, comparisons did not show a significant difference in changes in IMT from baseline to the three visits. At the last visit, IMT regression was observed in 52.2% of patients receiving CC and in 51.3% of those receiving AML (p = 0.908). The augmentation in carotid lumen diameter from baseline was statistically greater in the AML group at the last visit (p = 0.034). BP variations during the study were similar in the two groups. The results of this study show that CC and AML treatments may alter identically the natural progression of carotid IMT in hypertensive type 2 diabetic patients

Analysis of the Potential Role of GluA4 Carboxyl-Terminus in PDZ Interactions

Peer reviewe

Renal and Neurologic Effects of Cadmium, Lead, Mercury, and Arsenic in Children: Evidence of Early Effects and Multiple Interactions at Environmental Exposure Levels

Lead, cadmium, mercury, and arsenic are common environmental pollutants in industrialized countries, but their combined impact on children’s health is little known. We studied their effects on two main targets, the renal and dopaminergic systems, in > 800 children during a cross-sectional European survey. Control and exposed children were recruited from those living around historical nonferrous smelters in France, the Czech Republic, and Poland. Children provided blood and urine samples for the determination of the metals and sensitive renal or neurologic biomarkers. Serum concentrations of creatinine, cystatin C, and β(2)-microglobulin were negatively correlated with blood lead levels (PbB), suggesting an early renal hyperfiltration that averaged 7% in the upper quartile of PbB levels (> 55 μg/L; mean, 78.4 μg/L). The urinary excretion of retinol-binding protein, Clara cell protein, and N-acetyl-β-d-glucosaminidase was associated mainly with cadmium levels in blood or urine and with urinary mercury. All four metals influenced the dopaminergic markers serum prolactin and urinary homovanillic acid, with complex interactions brought to light. Heavy metals polluting the environment can cause subtle effects on children’s renal and dopaminergic systems without clear evidence of a threshold, which reinforces the need to control and regulate potential sources of contamination by heavy metals

Risks of myeloid malignancies in patients with autoimmune conditions

Autoimmune conditions are associated with an elevated risk of lymphoproliferative malignancies, but few studies have investigated the risk of myeloid malignancies. From the US Surveillance Epidemiology and End Results (SEER)-Medicare database, 13 486 myeloid malignancy patients (aged 67+ years) and 160 086 population-based controls were selected. Logistic regression models adjusted for gender, age, race, calendar year and number of physician claims were used to estimate odds ratios (ORs) for myeloid malignancies in relation to autoimmune conditions. Multiple comparisons were controlled for using the Bonferroni correction (P<0.0005). Autoimmune conditions, overall, were associated with an increased risk of acute myeloid leukaemia (AML) (OR 1.29) and myelodysplastic syndrome (MDS, OR 1.50). Specifically, AML was associated with rheumatoid arthritis (OR 1.28), systemic lupus erythematosus (OR 1.92), polymyalgia rheumatica (OR 1.73), autoimmune haemolytic anaemia (OR 3.74), systemic vasculitis (OR 6.23), ulcerative colitis (OR 1.72) and pernicious anaemia (OR 1.57). Myelodysplastic syndrome was associated with rheumatoid arthritis (OR1.52) and pernicious anaemia (OR 2.38). Overall, autoimmune conditions were not associated with chronic myeloid leukaemia (OR 1.09) or chronic myeloproliferative disorders (OR 1.15). Medications used to treat autoimmune conditions, shared genetic predisposition and/or direct infiltration of bone marrow by autoimmune conditions, could explain these excess risks of myeloid malignancies

Effect of the first wave of COVID-19 on Poison Control Centre activities in 21 European countries : an EAPCCT initiative

Peer reviewe

Distributed Streaming Systems ∗

revised version Mai 2013 — 19 pages Abstract: In this paper, we propose and analyze a simple localized algorithm to balance a tree. The motivation comes from live distributed streaming systems in which a source diffuses a content to peers via a tree, a node forwarding the data to its children. Such systems are subject to a high churn, peers frequently joining and leaving the system. It is thus crucial to be able to repair the diffusion tree to allow an efficient data distribution. In particular, due to bandwidth limitations, an efficient diffusion tree must ensure that node degrees are bounded. Moreover, to minimize the delay of the streaming, the depth of the diffusion tree must also be controlled. We propose here a simple distributed repair algorithm in which each node carries out local operations based on its degree and on the subtree sizes of its children. In a synchronous setting, we first prove that starting from any n-node tree our process converges to a balanced tree in O(n2) turns. We then describe a more restrictive model, adding a small extra information to each node, for which the convergence is reached in O(n log n) turns and this bound is tight. We then exhibit by simulation that the convergence is much faster (logarithmic number of turns in average) for a random tree. Key-words: Distributed algorithms, tree balancing, live streaming, peer-to-pee

Author manuscript, published in &quot;20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Ischia: Italy (2013)&quot; Connected Surveillance Game ⋆

Abstract. The surveillance game [Fomin et al., 2012] models the problem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The first player, called the observer, can mark a fixed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide along edges. The surfer starts at some initially marked vertex of the graph, her objective is to reach an unmarked node The surveillance number sn(G) of a graph G is the minimum amount of nodes that the observer has to mark at each turn ensuring it wins against any surfer in G. Fomin et al. also defined the connected surveillance game where the marked nodes must always induce a connected subgraph. They ask if there is a constant c&gt; 0 such that csn(G) ≤ c for any graph G. It has sn(G) been shown that there are graphs G for which csn(G) = sn(G) + 1. In this paper, we investigate this question. We present a family of graphs G such that csn(G)&gt; sn(G)+1. Moreover, we prove that csn(G) ≤ sn(G) √ n for any n-node graph G. While the gap between these bounds remains huge, it seems difficult to reduce it. We then define the online surveillance game where the observer has no a priori knowledge of the graph topology and discovers it little-bylittle. Unfortunately, we show that no algorithm for solving the online surveillance game has competitive ratio better than Ω(∆)

On the hull number of some graph classes

International audienceGiven a graph $G = (V,E)$, the {\em closed interval} of a pair of vertices $u,v \in V$, denoted by $I[u,v]$, is the set of vertices that belongs to some shortest $(u,v)$-path. For a given $S\subseteq V$, let $I[S] = \bigcup_{u,v\in S} I[u,v]$. We say that $S\subseteq V$ is a {\em convex set} if $I[S] = S$. The {\em convex hull} $I_h[S]$ of a subset $S\subseteq V$ is the smallest convex set that contains $S$. We say that $S$ is a {\em hull set} if $I_h[S] = V$. The cardinality of a minimum hull set of $G$ is the {\em hull number} of $G$, denoted by $hn(G)$. We show that deciding if $hn(G)\leq k$ is an NP-complete problem, even if $G$ is bipartite. We also prove that $hn(G)$ can be computed in polynomial time for cactus and $P_4$-sparse graphs