Beeping a Maximal Independent Set

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possible to find an MIS in O(log^3 n) time. Second, if we assume sleeping nodes are awoken by neighboring beeps, then we can also find an MIS in O(log^3 n) time. Third, if in addition to this wakeup assumption we allow sender-side collision detection, that is, beeping nodes can distinguish whether at least one neighboring node is beeping concurrently or not, we can find an MIS in O(log^2 n) time. Finally, if instead we endow nodes with synchronous clocks, it is also possible to find an MIS in O(log^2 n) time.Comment: arXiv admin note: substantial text overlap with arXiv:1108.192

On Matrices, Automata, and Double Counting

Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables M, with the same constraint defined by a finite-state automaton A on each row of M and a global cardinality constraint gcc on each column of M. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the gcc constraints from the automaton A. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We evaluate the impact of our methods on a large set of nurse rostering problem instances

Computing in Additive Networks with Bounded-Information Codes

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique. Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking problems, approximating network parameters, and solving an \emph{asymmetry revealing} problem such as computing a maximal input. The key method used is a novel random coding technique that allows a node to successfully decode the received information, as long as it does not contain too many distinct values. We then design our algorithms to produce a limited amount of information in each neighborhood in order to leverage our enriched toolbox for computing in additive networks

Investigation of the solid/liquid phase transitions in the U–Pu–O system

Mixed oxides of uranium and plutonium U1-yPuyO2-x are currently studied as reference fuel for Sodium-cooled Fast Reactors (SFRs). To predict the margin to fuel melting, an accurate description of both solidus and liquidus temperatures of these materials is crucial. In this work, after a critical review of the literature data, the parameters of the liquid phase of the CALPHAD models of the Pu–O and U–Pu–O systems are reassessed based on the model of Gu´eneau et al.. A good agreement between the calculated and selected experimental data is obtained. Using this model, the melting behaviour of U1-yPuyO2±x oxides is then studied as a function of plutonium content and oxygen stoichiometry. The congruent melting for the mixed oxides is found to be shifted towards low O/M ratios compared to the end-members (UO1.97 and PuO1.95). The temperature of this congruent melting is nearly constant (3130–3140 K) along a ternary phase boundary from UO1.98 to U0.55Pu0.45O1.82 and then decreases with Pu content to a maximum of approximately 3040 K for PuO1.95. This observation is explained by the stabilisation of the hypo-stoichiometric mixed oxides due to the increase of the configurational entropy at high temperatures by the formation of oxygen vacancies and related cation mixing. The influence of the atmosphere used in the laser heating melting experiments on the oxygen stoichiometry of the sample and its solidus and liquidus temperatures is investigated. The determination of this O/M ratio after laser melting tests using XANES is also reported. The simultaneous presence of U6+, U5+, U4+, Pu3+ and Pu4+ is observed, highlighting the occurrence of charge compensation mechanisms. The samples are highly oxidised in air whereas close to stoichiometry (O/M = 2.00) in argon. These results are in agreement with the computed solidification paths. This work illustrates the complex melting behaviour of the U1-yPuyO2±x fuels and highlights the need for the CALPHAD method to accurately describe and predict the high-temperature transitions of the U–Pu–O system

Analytic and Gevrey Hypoellipticity for Perturbed Sums of Squares Operators

We prove a couple of results concerning pseudodifferential perturbations of differential operators being sums of squares of vector fields and satisfying H\"ormander's condition. The first is on the minimal Gevrey regularity: if a sum of squares with analytic coefficients is perturbed with a pseudodifferential operator of order strictly less than its subelliptic index it still has the Gevrey minimal regularity. We also prove a statement concerning real analytic hypoellipticity for the same type of pseudodifferential perturbations, provided the operator satisfies to some extra conditions (see Theorem 1.2 below) that ensure the analytic hypoellipticity

Geometric optics and instability for semi-classical Schrodinger equations

We prove some instability phenomena for semi-classical (linear or) nonlinear Schrodinger equations. For some perturbations of the data, we show that for very small times, we can neglect the Laplacian, and the mechanism is the same as for the corresponding ordinary differential equation. Our approach allows smaller perturbations of the data, where the instability occurs for times such that the problem cannot be reduced to the study of an o.d.e.Comment: 22 pages. Corollary 1.7 adde