68 research outputs found
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving
We derive efficient algorithms for coarse approximation of algebraic
hypersurfaces, useful for estimating the distance between an input polynomial
zero set and a given query point. Our methods work best on sparse polynomials
of high degree (in any number of variables) but are nevertheless completely
general. The underlying ideas, which we take the time to describe in an
elementary way, come from tropical geometry. We thus reduce a hard algebraic
problem to high-precision linear optimization, proving new upper and lower
complexity estimates along the way.Comment: 15 pages, 9 figures. Submitted to a conference proceeding
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
Reflections on a crisis: political disenchantment, moral desolation, and political integrity
Declining levels of political trust and voter turnout, the shift towards populist politics marked by appeals to ‘the people’ and a rejection of ‘politics-as-usual’, are just some of the commonly cited manifestations of our culture of political disaffection. Democratic politics, it is argued, is in crisis. Whilst considerable energy has been expended on the task of lamenting the status of our politics and pondering over recommendations to tackle this perceived crisis, amid this raft of complaints and solutions lurks confusion. This paper seeks to explore the neglected question of what the precise nature of the crisis with which we are confronted involves, and, in so doing, to go some way towards untangling our confusion. Taking my cue from Machiavelli and his value-pluralist heirs, I argue that there is a rift between a morally admirable and a virtuous political life. Failure to appreciate this possibility causes narrations of crisis to misconstrue the moral messiness of politics in ways that lead us to misunderstand how we should respond to disenchantment. Specifically, I suggest that: (i) we think that there is a moral crisis in politics because we have an unsatisfactorily idealistic understanding of political integrity in the first place; and (ii) it is a mistake to imagine that the moral purification of politics is possible or desirable. Put simply, our crisis is not moral per se but primarily philosophical in nature: it relates to the very concepts we employ—the qualities of character and context we presuppose whilst pondering over political integrity
Author manuscript, published in "AlgoTel (2009)" Fast Data Gathering in Radio Grid Networks
Nous présentons des algorithmes efficaces pour la collecte d’informations par une station de base au sein d’un réseau sans-fil multi sauts en présence d’interférences. Nous nous focalisons sur les réseaux en grille car ils sont un bon modèle des réseaux d’accès comme des réseaux aléatoires de capteurs. Le temps est divisé en étapes élémentaires. Au cours d’une étape, un nœud peut transmettre au plus un message à l’un de ces voisins. Chaque appareil est équipé d’un interface half duplex et ne peut donc émettre et recevoir à la même étape. Ainsi, au cours d’une étape, l’ensemble des transmissions valides induit un couplage de la grille. Le problème consiste à minimiser le nombre d’étapes nécessaires à la collecte de tous les messages par la station de base. Le meilleur algorithme connu était une 3/2 approximation. Nous donnons un algorithme très simple qui approche l’optimum à 2 près, puis nous présentons un algorithme plus évolué qui est une +1 approximation. Nos résultats sont valides lorsque les appareils ne disposent d’aucune mémoire tampon et doivent retransmettre un message à l’étape suivant sa réception
- …