A Robust AFPTAS for Online Bin Packing with Polynomial Migration

In this paper we develop general LP and ILP techniques to find an approximate solution with improved objective value close to an existing solution. The task of improving an approximate solution is closely related to a classical theorem of Cook et al. in the sensitivity analysis for LPs and ILPs. This result is often applied in designing robust algorithms for online problems. We apply our new techniques to the online bin packing problem, where it is allowed to reassign a certain number of items, measured by the migration factor. The migration factor is defined by the total size of reassigned items divided by the size of the arriving item. We obtain a robust asymptotic fully polynomial time approximation scheme (AFPTAS) for the online bin packing problem with migration factor bounded by a polynomial in $\frac{1}{\epsilon}$. This answers an open question stated by Epstein and Levin in the affirmative. As a byproduct we prove an approximate variant of the sensitivity theorem by Cook at el. for linear programs

Vector Bin Packing with Multiple-Choice

We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types, each with its own cost and $D$-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a solution whose cost is about $\ln D$ times the optimum. For the running time to be polynomial we require $D=O(1)$ and $T=O(\log n)$. This extends previous results for vector bin packing, in which each item has a single incarnation and there is only one bin type. To obtain our result we also present a PTAS for the multiple-choice version of multidimensional knapsack, where we are given only one bin and the goal is to pack a maximum weight set of (incarnations of) items in that bin

Scheduling periodic tasks in a hard real-time environment

We consider a real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks $au_i=(c_i,p_i)$ on a minimum number of identical machines and to compute offsets $a_i$ for the tasks such that no collision occurs. A task $au_i$ releases a job of running time $c_i$ at each time $a_i + kcdot p_i,k in mathbb{N}_0$ and a collision occurs if two jobs are simultaneously active on the same machine. We shed some light on the complexity and approximability landscape of this problem. Although the problem cannot be approximated within a factor of $n^{1-varepsilon}$ for any $varepsilon>0$, an interesting restriction is much more tractable: If the periods are dividing (for each $i,j$ one has $p_i | p_j$ or $p_j | p_i$), the problem allows for a better structured representation of solutions, which leads to a 2-approximation. This result is tight, even asymptotically

Terrestrial Implications of Cosmological Gamma-Ray Burst Models

The observation by the BATSE instrument on the Compton Gamma Ray Observatory that gamma-ray bursts (GRBs) are distributed isotropically around the Earth but nonuniformly in distance has led to the widespread conclusion that GRBs are most likely to be at cosmological distances, making them the most luminous sources known in the Universe. If bursts arise from events that occur in normal galaxies, such as neutron star binary inspirals, then they will also occur in our Galaxy about every hundred thousand to million years. The gamma-ray flux at the Earth due to a Galactic GRB would far exceed that from even the largest solar flares. The absorption of this radiation in the atmosphere would substantially increase the stratospheric nitric oxide concentration through photodissociation of N$_2$, greatly reducing the ozone concentration for several years through NO$_x$ catalysis, with important biospheric effects due to increased solar ultraviolet flux. A nearby GRB may also leave traces in anomalous radionuclide abundances.Comment: uuencoded, gzip-ed postscript; 6 pages; submitted to ApJ Letter

An EPTAS for scheduling jobs on uniform processors using an MILP relaxation with a constant number of integral variables

We present an efficient polynomial time approximation scheme (EPTAS) for scheduling on uniform processors, i.e. finding a minimum length schedule for a set of n independent jobs on m processors with different speeds (a fundamental NP-hard scheduling problem). The previous best polynomial time approximation scheme (PTAS) by Hochbaum and Shmoys has a running time of (n/\epsilon)^{O(1/\epsilon^2)}. Our algorithm, based on a new mixed integer linear programming (MILP) formulation with a constant number of integral variables and an interesting rounding method, finds a schedule whose length is within a relative error $\epsilon$ of the optimum, and has running time 2^{O(1/\epsilon^2 \log(1/\epsilon)^3)} + poly(n)

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

We introduce the "First Fit Matching Periods" algorithm for static-priority multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments if utilization values are chosen uniformly at random. More precisely we prove that the expected waste is upper bounded by O(n^(3/4) * (log n)^(3/8)). Here the waste denotes the ratio of idle times, cumulated over all processors and n gives the number of tasks. The algorithm can be implemented to run in time O(n log n) and even in the worst case, an asymptotic approximation ratio of 2 is guaranteed. Experiments yield an expected waste proportional to n^0.70, indicating that the above upper bound on the expected waste is almost tight

Highlights from the Pierre Auger Observatory

The Pierre Auger Observatory is the world's largest cosmic ray observatory. Our current exposure reaches nearly 40,000 km$^2$ str and provides us with an unprecedented quality data set. The performance and stability of the detectors and their enhancements are described. Data analyses have led to a number of major breakthroughs. Among these we discuss the energy spectrum and the searches for large-scale anisotropies. We present analyses of our X$_{max}$ data and show how it can be interpreted in terms of mass composition. We also describe some new analyses that extract mass sensitive parameters from the 100% duty cycle SD data. A coherent interpretation of all these recent results opens new directions. The consequences regarding the cosmic ray composition and the properties of UHECR sources are briefly discussed.Comment: 9 pages, 12 figures, talk given at the 33rd International Cosmic Ray Conference, Rio de Janeiro 201

Antimicrobial resistance among migrants in Europe: a systematic review and meta-analysis

BACKGROUND: Rates of antimicrobial resistance (AMR) are rising globally and there is concern that increased migration is contributing to the burden of antibiotic resistance in Europe. However, the effect of migration on the burden of AMR in Europe has not yet been comprehensively examined. Therefore, we did a systematic review and meta-analysis to identify and synthesise data for AMR carriage or infection in migrants to Europe to examine differences in patterns of AMR across migrant groups and in different settings. METHODS: For this systematic review and meta-analysis, we searched MEDLINE, Embase, PubMed, and Scopus with no language restrictions from Jan 1, 2000, to Jan 18, 2017, for primary data from observational studies reporting antibacterial resistance in common bacterial pathogens among migrants to 21 European Union-15 and European Economic Area countries. To be eligible for inclusion, studies had to report data on carriage or infection with laboratory-confirmed antibiotic-resistant organisms in migrant populations. We extracted data from eligible studies and assessed quality using piloted, standardised forms. We did not examine drug resistance in tuberculosis and excluded articles solely reporting on this parameter. We also excluded articles in which migrant status was determined by ethnicity, country of birth of participants' parents, or was not defined, and articles in which data were not disaggregated by migrant status. Outcomes were carriage of or infection with antibiotic-resistant organisms. We used random-effects models to calculate the pooled prevalence of each outcome. The study protocol is registered with PROSPERO, number CRD42016043681. FINDINGS: We identified 2274 articles, of which 23 observational studies reporting on antibiotic resistance in 2319 migrants were included. The pooled prevalence of any AMR carriage or AMR infection in migrants was 25·4% (95% CI 19·1-31·8; I2 =98%), including meticillin-resistant Staphylococcus aureus (7·8%, 4·8-10·7; I2 =92%) and antibiotic-resistant Gram-negative bacteria (27·2%, 17·6-36·8; I2 =94%). The pooled prevalence of any AMR carriage or infection was higher in refugees and asylum seekers (33·0%, 18·3-47·6; I2 =98%) than in other migrant groups (6·6%, 1·8-11·3; I2 =92%). The pooled prevalence of antibiotic-resistant organisms was slightly higher in high-migrant community settings (33·1%, 11·1-55·1; I2 =96%) than in migrants in hospitals (24·3%, 16·1-32·6; I2 =98%). We did not find evidence of high rates of transmission of AMR from migrant to host populations. INTERPRETATION: Migrants are exposed to conditions favouring the emergence of drug resistance during transit and in host countries in Europe. Increased antibiotic resistance among refugees and asylum seekers and in high-migrant community settings (such as refugee camps and detention facilities) highlights the need for improved living conditions, access to health care, and initiatives to facilitate detection of and appropriate high-quality treatment for antibiotic-resistant infections during transit and in host countries. Protocols for the prevention and control of infection and for antibiotic surveillance need to be integrated in all aspects of health care, which should be accessible for all migrant groups, and should target determinants of AMR before, during, and after migration. FUNDING: UK National Institute for Health Research Imperial Biomedical Research Centre, Imperial College Healthcare Charity, the Wellcome Trust, and UK National Institute for Health Research Health Protection Research Unit in Healthcare-associated Infections and Antimictobial Resistance at Imperial College London

Gene Network Disruptions and Neurogenesis Defects in the Adult Ts1Cje Mouse Model of Down Syndrome

Background: Down syndrome (DS) individuals suffer mental retardation with further cognitive decline and early onset Alzheimer's disease. Methodology/Principal Findings: To understand how trisomy 21 causes these neurological abnormalities we investigated changes in gene expression networks combined with a systematic cell lineage analysis of adult neurogenesis using the Ts1Cje mouse model of DS. We demonstrated down regulation of a number of key genes involved in proliferation and cell cycle progression including Mcm7, Brca2, Prim1, Cenpo and Aurka in trisomic neurospheres. We found that trisomy did not affect the number of adult neural stem cells but resulted in reduced numbers of neural progenitors and neuroblasts. Analysis of differentiating adult Ts1Cje neural progenitors showed a severe reduction in numbers of neurons produced with a tendency for less elaborate neurites, whilst the numbers of astrocytes was increased. Conclusions/Significance: We have shown that trisomy affects a number of elements of adult neurogenesis likely to result in a progressive pathogenesis and consequently providing the potential for the development of therapies to slow progression of, or even ameliorate the neuronal deficits suffered by DS individuals.Chelsee A. Hewitt, King-Hwa Ling, Tobias D. Merson, Ken M. Simpson, Matthew E. Ritchie, Sarah L. King, Melanie A. Pritchard, Gordon K. Smyth, Tim Thomas, Hamish S. Scott and Anne K. Vos