347 research outputs found

    Separation of Circulating Tokens

    Full text link
    Self-stabilizing distributed control is often modeled by token abstractions. A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a synchronous system with m circulating tokens has at least d distance between tokens. This problem is first considered in a ring where d is given whilst m and the ring size n are unknown. The protocol solving this problem can be uniform, with all processes running the same program, or it can be non-uniform, with some processes acting only as token relays. The protocol for this first problem is simple, and can be expressed with Petri net formalism. A second problem is to maximize d when m is given, and n is unknown. For the second problem, the paper presents a non-uniform protocol with a single corrective process.Comment: 22 pages, 7 figures, epsf and pstricks in LaTe

    Reachability problems for products of matrices in semirings

    Get PDF
    We consider the following matrix reachability problem: given rr square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multiplied at left and right by prescribed row and column vectors, gives a prescribed scalar). We show that over any semiring, scalar reachability reduces to vector reachability which is equivalent to matrix reachability, and that for any of these problems, the specialization to any r2r\geq 2 is equivalent to the specialization to r=2r=2. As an application of this result and of a theorem of Krob, we show that when r=2r=2, the vector and matrix reachability problems are undecidable over the max-plus semiring (Z{},max,+)(Z\cup\{-\infty\},\max,+). We also show that the matrix, vector, and scalar reachability problems are decidable over semirings whose elements are ``positive'', like the tropical semiring (N{+},min,+)(N\cup\{+\infty\},\min,+).Comment: 21 page

    TCP is Max-Plus Linear and what it tells us on its throughput

    Get PDF
    Projet MCRWe give a representation of the packet-level dynamical behavior of the Reno and Tahoe variants of TCP over a single end-to-end connection. This representation allows one to consider the case when the connection involves a network made of several, possibly heterogeneous, deterministic or random routers in series. It is shown that the key features of the protocol and of the network can be expressed via a linear dynamical system in the so called max-plus algebra. This opens new ways of both analytical evaluation and fast simulation based on products of matrices in this algebra. This also leads to closed form formulas for the throughput allowed by TCP under natural assumptions on the behavior of the routers and on the detection of losses and timeouts; these new formulas are shown to refine those obtained from earlier models which either assume that the network could be reduced to a single bottleneck router and/or approximate the packets by a fluid

    Stochastic analysis of spatial and opportunistic aloha

    Full text link

    Branching processes, the max-plus algebra and network calculus

    Get PDF
    Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First, we consider this recursion in the max-plus algebra where branching corresponds to finding the maximal offspring of the current generation. Secondly, we consider network-calculus-type deterministic bounds as introduced by Cruz, which we extend to handle branching-type processes. The paper provides both qualitative and quantitative results and introduces various applications of (max-plus) branching processes in queueing theory

    Complete solution of a constrained tropical optimization problem with application to location analysis

    Full text link
    We present a multidimensional optimization problem that is formulated and solved in the tropical mathematics setting. The problem consists of minimizing a nonlinear objective function defined on vectors over an idempotent semifield by means of a conjugate transposition operator, subject to constraints in the form of linear vector inequalities. A complete direct solution to the problem under fairly general assumptions is given in a compact vector form suitable for both further analysis and practical implementation. We apply the result to solve a multidimensional minimax single facility location problem with Chebyshev distance and with inequality constraints imposed on the feasible location area.Comment: 20 pages, 3 figure

    Antimicrobial Stewardship Interventions in Pediatric Oncology: A Systematic Review

    Get PDF
    Antimicrobial stewardship programs represent efficacious measures for reducing antibiotic overuse and improving outcomes in different settings. Specific data on pediatric oncology are lacking. We conducted a systematic review on the PubMed and Trip databases according to the PRISMA guidelines, searching for reports regarding antimicrobial stewardship in pediatric oncology and hematology patients. The aim of the study was to summarize the present literature regarding the implementation of antimicrobial stewardship programs or initiatives in this particular population, and provide insights for future investigations. Nine papers were included in the qualitative analysis: three regarding antifungal interventions, five regarding antibacterial interventions, and one regarding both antifungal and antibacterial stewardship interventions. Variable strategies were reported among the included studies. Different parameters were used to evaluate the impact of these interventions, including days of therapy per 1000-patient-days, infections with resistant strains, safety analysis, and costs. We generally observed a reduction in the prescription of broad-spectrum antibiotics and an improved appropriateness, with reduced antibiotic-related side effects and no difference in infection-related mortality. Antibiotic stewardship programs or interventions are effective in reducing antibiotic consumption and improving outcomes in pediatric oncology hematology settings, although stewardship strategies differ substantially in different institutions. A standardized approach needs to be implemented in future studies in order to better elucidate the impact of stewardship programs in this category of patients

    Cyclic projectors and separation theorems in idempotent convex geometry

    Full text link
    Semimodules over idempotent semirings like the max-plus or tropical semiring have much in common with convex cones. This analogy is particularly apparent in the case of subsemimodules of the n-fold cartesian product of the max-plus semiring it is known that one can separate a vector from a closed subsemimodule that does not contain it. We establish here a more general separation theorem, which applies to any finite collection of closed semimodules with a trivial intersection. In order to prove this theorem, we investigate the spectral properties of certain nonlinear operators called here idempotent cyclic projectors. These are idempotent analogues of the cyclic nearest-point projections known in convex analysis. The spectrum of idempotent cyclic projectors is characterized in terms of a suitable extension of Hilbert's projective metric. We deduce as a corollary of our main results the idempotent analogue of Helly's theorem.Comment: 20 pages, 1 figur

    Semiring and semimodule issues in MV-algebras

    Full text link
    In this paper we propose a semiring-theoretic approach to MV-algebras based on the connection between such algebras and idempotent semirings - such an approach naturally imposing the introduction and study of a suitable corresponding class of semimodules, called MV-semimodules. We present several results addressed toward a semiring theory for MV-algebras. In particular we show a representation of MV-algebras as a subsemiring of the endomorphism semiring of a semilattice, the construction of the Grothendieck group of a semiring and its functorial nature, and the effect of Mundici categorical equivalence between MV-algebras and lattice-ordered Abelian groups with a distinguished strong order unit upon the relationship between MV-semimodules and semimodules over idempotent semifields.Comment: This version contains some corrections to some results at the end of Section
    corecore