Influence of gestational age at initiation of antihypertensive therapy: secondary analysis of CHIPS trial data (control of hypertension in pregnancy study)

For hypertensive women in CHIPS (Control of Hypertension in Pregnancy Study), we assessed whether the maternal benefits of tight control could be achieved, while minimizing any potentially negative effect on fetal growth, by delaying initiation of antihypertensive therapy until later in pregnancy. For the 981 women with nonsevere, chronic or gestational hypertension randomized to less-tight (target diastolic blood pressure, 100 mm Hg), or tight (target, 85 mm Hg) control, we used mixed-effects logistic regression to examine whether the effect of less-tight (versus tight) control on major outcomes was dependent on gestational age at randomization, adjusting for baseline factors as in the primary analysis and including an interaction term between gestational age at randomization and treatment allocation. Gestational age was considered categorically (quartiles) and continuously (linear or quadratic form), and the optimal functional form selected to provide the best fit to the data based on the Akaike information criterion. Randomization before (but not after) 24 weeks to less-tight (versus tight) control was associated with fewer babies with birth weight 48 hours (Pinteraction=0.354). For the mother, less-tight (versus tight) control was associated with more severe hypertension at all gestational ages but particularly so before 28 weeks (Pinteraction=0.076). In women with nonsevere, chronic, or gestational hypertension, there seems to be no gestational age at which less-tight (versus tight) control is the preferred management strategy to optimize maternal or perinatal outcomes

Geometric routing without geometry

In this paper we propose a new routing paradigm, called pseudo-geometric routing. In pseudo-geometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On theses pseudo coordinates we employ greedy geometric routing. Almost as a side effect, pseudo-geometric routing is not restricted to planar unit disk graph networks anymore, but succeeds on general networks.

Formal Verification of Distributed Algorithms

International audienceWe exhibit a methodology to develop mechanically-checkable parameterized proofs of the correctness of fault-tolerant round-based distributed algorithms in an asynchronous message-passing setting. Motivated by a number of case studies, we sketch how to replace often-used informal and incomplete pseudo code by mostly syntax-free formal and complete definitions of a global-state transition system. Special emphasis is put on the required deepening of the level of proof detail to be able to check them within an interactive theorem proving environment

Some projection-like methods for the generalized Nash equilibria

Generalized Nash equilibrium, Quasi-variational inequality, Projection-like method, Convergence,