Leomyosarcome du larynx

Le leiomyosarcome laryngé est une tumeur musculaire lisse maligne rare. Il représente moins de 1% de toutes les tumeurs malignes laryngées. Nous rapportons un nouveau cas chez un patient de 63 ans. Le traitement a consisté en une laryngectomie totale avec curage ganglionnaire suivie de radiothérapie. A travers ce cas et une revue de la littérature, nous discutons les aspects épidémiologiques, cliniques et étiopathogéniques de ce sarcome rare du larynx.Mots clés : Léiomyosarcome, larynx, radiothérapie, chirurgie

SPECTROPHOTOMETRIC DETERMINATION OF PHENOL BY CHARGE-TRANSFER COMPLEXATION

The phenol is used in pharmaceutical domain as agent of preservation, a rapid and reliable spectrophotometric method was validated for its determination in routine control. This method is based on the formation of a charge transfer complex between phenol and 2,6-dichloroquinone-4-chloroimide (DCQ) in basic medium. This produced a blue product with maximum absorption at 610nm. Beer's law is obeyed and the calibration curve was linear (r = 0.999) over the range 7.5 10 -6 M -7.5 10 -

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults

A set of mobile robots is placed at points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority. The collection contains an unknown subset of "spies", i.e., byzantine robots, which are indistinguishable from the non-faulty ones. The set of the non-faulty robots need to rendezvous in the shortest possible time in order to perform some task, while the byzantine robots may try to delay their rendezvous for as long as possible. The problem facing a central authority is to determine trajectories for all robots so as to minimize the time until the non-faulty robots have rendezvoused. The trajectories must be determined without knowledge of which robots are faulty. Our goal is to minimize the competitive ratio between the time required to achieve the first rendezvous of the non-faulty robots and the time required for such a rendezvous to occur under the assumption that the faulty robots are known at the start. We provide a bounded competitive ratio algorithm, where the central authority is informed only of the set of initial robot positions, without knowing which ones or how many of them are faulty. When an upper bound on the number of byzantine robots is known to the central authority, we provide algorithms with better competitive ratios. In some instances we are able to show these algorithms are optimal

Self-stabilizing Deterministic Gathering

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd

An incremental modular technique for checking LTL-X properties on Petri nets

Model-checking is a powerful and widespread technique for the verification of finite state concurrent systems. However, the main hindrance for wider application of this technique is the well-known state explosion problem. Modular verification is a promising natural approach to tackle this problem. It is based on the "divide and conquer" principle and aims at deducing the properties of the system from those of its components analysed in isolation. Unfortunately, several issues make the use of modular verification techniques difficult in practice. First, deciding how to partition the system into components is not trivial and can have a significant impact on the resources needed for verification. Second, when model-checking a component in isolation, how should the environment of this component be described? In this paper, we address these problems in the framework of model-checking LTL\X action-based properties on Petri nets. We propose an incremental and modular verification approach where the system model is partitioned according to the actions occurring in the property to be verified and where the environment of a component is taken into account using the linear place invariants of the system

NF-κB: A lesson in family values

A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from the reliable ones. The reliable robots need to gather, i.e., arrive to a configuration in which at the same time, all of them occupy the same point on the plane. The robots are equipped with GPS devices and at the beginning of the gathering process they communicate the Cartesian coordinates of their respective positions to the central authority. On the basis of this information, without the knowledge of which robots are faulty, the central authority designs a trajectory for every robot. The central authority aims to provide the trajectories which result in the shortest possible gathering time of the healthy robots. The efficiency of a gathering strategy is measured by its competitive ratio, i.e., the maximal ratio between the time required for gathering achieved by the given trajectories and the optimal time required for gathering in the offline case, i.e., when the faulty robots are known to the central authority in advance. The role of the byzantine robots, controlled by the adversary, is to act so that the gathering is delayed and the resulting competitive ratio is maximized. The objective of our paper is to propose efficient algorithms when the central authority is aware of an upper bound on the number of byzantine robots. We give optimal algorithms for collections of robots known to contain at most one faulty robot. When the proportion of byzantine robots is known to be less than one half or one third, we provide algorithms with small constant competitive ratios. We also propose algorithms with bounded competitive ratio in the case where the proportion of faulty robots is arbitrary

When Patrolmen Become Corrupted: Monitoring a Graph using Faulty Mobile Robots

International audienceA team of k mobile robots is deployed on a weighted graph whose edge weights represent distances. The robots perpetually move along the domain, represented by all points belonging to the graph edges, not exceeding their maximal speed. The robots need to patrol the graph by regularly visiting all points of the domain. In this paper, we consider a team of robots (patrolmen), at most f of which may be unreliable, i.e. they fail to comply with their patrolling duties. What algorithm should be followed so as to minimize the maximum time between successive visits of every edge point by a reliable patrolmen? The corresponding measure of efficiency of patrolling called idleness has been widely accepted in the robotics literature. We extend it to the case of untrusted patrolmen; we denote by Ifk (G) the maximum time that a point of the domain may remain unvisited by reliable patrolmen. The objective is to find patrolling strategies minimizing Ifk (G). We investigate this problem for various classes of graphs. We design optimal algorithms for line segments, which turn out to be surprisingly different from strategies for related patrolling problems proposed in the literature. We then use these results to study the case of general graphs. For Eulerian graphs G, we give an optimal patrolling strategy with idleness Ifk (G) = (f + 1)|E|/k, where |E| is the sum of the lengths of the edges of G. Further, we show the hardness of the problem of computing the idle time for three robots, at most one of which is faulty, by reduction from 3-edge-coloring of cubic graphs — a known NP-hard problem. A byproduct of our proof is the investigation of classes of graphs minimizing idle time (with respect to the total length of edges); an example of such a class is known in the literature under the name of Kotzig graphs

New Mediterranean Marine biodiversity records (June 2013)

This paper concerns records of species that have extended their distribution in the Mediterranean Sea. The finding of the rare brackish angiosperm Althenia filiformis in the island of Cyprus is interesting since its insertion in the Red Data Book of the Flora of Cyprus is suggested. The following species enriched the flora or fauna lists of the relevant countries: the red alga Sebdenia dichotoma (Greece), the hydrachnid mite Pontarachna adriatica (Slovenia), and the thalassinid Gebiacantha talismani (Turkey). Several alien species were recorded in new Mediterranean localities. The record of the burrowing goby Trypauchen vagina in the North Levantine Sea (Turkish coast), suggests the start of spreading of this Lessepsian immigrant in the Mediterranean Sea. The findings of the following species indicate the extension of their occurrence in the Mediterranean Sea: the foraminifer Amphistegina lobifera (island of Zakynthos, Greece), the medusa Cassiopea andromeda (Syria), the copepod Centropages furcatus (Aegean Sea), the decapod shrimp Melicertus hathor (island of Kastellorizo, Greece), the crab Menoethius monoceros (Gulf of Tunis), the barnacles Balanus trigonus, Megabalanus tintinnabulum, Megabalanus coccopoma and the bivalves Chama asperella, Cucurbitula cymbium (Saronikos Gulf, Greece)

Pharmacogenetic Associations of MMP9 and MMP12 Variants with Cardiovascular Disease in Patients with Hypertension

MMP-9 and -12 function in tissue remodeling and may play roles in cardiovascular disease (CVD). We assessed associations of four MMP polymorphisms and three antihypertensive drugs with cardiovascular outcomes.Hypertensives (n = 42,418) from a double-blind, randomized, clinical trial were randomized to chlorthalidone, amlodipine, lisinopril, or doxazosin treatment (mean follow up, 4.9 years). The primary outcome was coronary heart disease (CHD). Secondary outcomes included combined CHD, all CVD outcomes combined, stroke, heart failure (HF), and mortality. Genotype-treatment interactions were tested. = 0.015). for CHD and composite CVD. The data suggest that these genes may provide useful clinical information with respect to treatment decisions

Electrochemical Characterization of Coinage Techniques the 17(th) Century: The maravedis Case

This is the peer reviewed version of the following article: Doménech Carbó, A.; Domenech Carbo, MT.; Álvarez-Romero, C.; Montoya, N.; Pasies-Oviedo, T.; Buendía Ortuño, MDM. (2017). Electrochemical Characterization of Coinage Techniques the 17(th) Century: The maravedis Case. Electroanalysis. 29(9):2008-2018. doi:10.1002/elan.201700326, which has been published in final form at http://doi.org/10.1002/elan.201700326. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving."[EN] The voltammetry of immobilized particles (VIMP) methodology was applied to the discrimination of Spanish maravedis produced in 10 different mints between 1661 and 1664 using characteristic signatures for the reduction of cuprite and tenorite in the patina of the coins and catalytic effects on the hydrogen evolution reaction (HER). The variation of the apparent tenorite/cuprite ratio with depth was fitted to potential laws differing from one mint to another for A Coruna, Burgos, Cordoba, Cuenca, Granada, Madrid, Trujillo, Segovia, Sevilla and Valladolid coins. Electrochemical data permitted to detect the changes in the composition (with lowering of the silver content) and manufacturing technique (from hammer to mill) occurring in this historical period.Financial support from the MICIN Projects CTQ2014-53736-C3-1-P and CTQ2014-53736-C3-2-P, which are also supported with ERDF funds, is gratefully acknowledged. Thanks to the Museum of Prehistory of Valencia for facilitating the access to its collections.Domenech Carbo, A.; Domenech Carbo, MT.; Álvarez-Romero, C.; Montoya, N.; Pasies-Oviedo, T.; Buendía Ortuño, MDM. (2017). Electrochemical Characterization of Coinage Techniques the 17(th) Century: The maravedis Case. Electroanalysis. 29(9):2008-2018. https://doi.org/10.1002/elan.201700326S2008201829