Distributed CSMA with pairwise coding

We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an increase in network throughput under certain routing conditions. We previously developed a centralized control policy to jointly optimize for routing and scheduling combined with a simple network coding strategy using max-weight scheduling (MWS) [9]. In this work we focus on pairwise network coding and develop a distributed carrier sense multiple access (CSMA) policy that supports all arrival rates allowed by the network subject to the pairwise coding constraint. We extend our scheme to optimize for packet overhearing to increase the number of beneficial coding opportunities. Simulation results show that the CSMA strategy yields the same throughput as the optimal centralized policy of [9], but at the cost of increased delay. Moreover, overhearing provides up to an additional 25% increase in throughput on random topologies.United States. Dept. of Defense. Assistant Secretary of Defense for Research & EngineeringUnited States. Air Force (Air Force Contract FA8721-05-C-0002

Topology control for wireless networks with highly-directional antennas

In order to steer antenna beams towards one another for communication, wireless nodes with highly-directional antennas must track the channel state of their neighbors. To keep this overhead manageable, each node must limit the number of neighbors that it tracks. The subset of neighbors that each node chooses to track constitutes a network topology over which traffic can be routed. We consider this topology design problem, taking into account channel modeling, transmission scheduling, and traffic demand. We formulate the optimal topology design problem, with the objective of maximizing the scaling of traffic demand, and propose a distributed method, where each node rapidly builds a segment of the topology around itself by forming connections with its nearest neighbors in discretized angular regions. The method has low complexity and message passing overhead. The resulting topologies are shown to have desirable structural properties and approach the optimal solution in high path loss environments.National Science Foundation (U.S.) (Grant CNS-1524317)National Science Foundation (U.S.) (Grant CNS-1116209)National Science Foundation (U.S.) (Grant AST-1547331)United States. Air Force (Contract FA8721-05-C-0002

Optimal routing and scheduling for a simple network coding scheme

We consider jointly optimal routing, scheduling, and network coding strategies to maximize throughput in wireless networks. While routing and scheduling techniques for wireless networks have been studied for decades, network coding is a relatively new technique that allows for an increase in throughput under certain topological and routing conditions. In this work we introduce k-tuple coding, a generalization of pairwise coding with next-hop decodability, and fully characterize the region of arrival rates for which the network queues can be stabilized under this coding strategy. We propose a dynamic control policy for routing, scheduling, and k-tuple coding, and prove that our policy is throughput optimal subject to the k-tuple coding constraint. We provide analytical bounds on the coding gain of our policy, and present numerical results to support our analytical findings. We show that most of the gains are achieved with pairwise coding, and that the coding gain is greater under 2-hop than 1-hop interference. Simulations show that under 2-hop interference our policy yields median throughput gains of 31% beyond optimal scheduling and routing on random topologies with 16 nodes.National Science Foundation (U.S.) (grant CNS-0915988)United States. Office of Naval Research (grant N00014-12-1-0064)United States. Office of Naval Research. Multidisciplinary University Research Initiative (grant number W911NF-08-1-0238)United States. Air ForceUnited States. Dept. of Defense (Contract No. FA8721-05-C-0002

An overlay architecture for throughput optimal multipath routing

Legacy networks are often designed to operate with simple single-path routing, like shortest-path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions. In this work, we study an overlay architecture for dynamic routing such that only a subset of devices (overlay nodes) need to make dynamic routing decisions. We determine the essential collection of nodes that must bifurcate traffic for achieving the maximum multicommodity network throughput. We apply our optimal node placement algorithm to several graphs and the results show that a small fraction of overlay nodes is sufficient for achieving maximum throughput. Finally, we propose a heuristic policy (OBP), which dynamically controls traffic bifurcations at overlay nodes. In all studied simulation scenarios, OBP not only achieves full throughput, but also reduces delay in comparison to the throughput optimal backpressure routing.United States. Air Force (Contract FA8721-05-C-0002)National Science Foundation (U.S.) (Grant CNS-0915988)United States. Office of Naval Research (Grant N00014-12-1-0064)United States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238)European Social Fund (WiNC Project of the Action:Supporting Postdoctoral Researchers

A clonal Plasmodium falciparum population in an isolated outbreak of malaria in the Republic of Cabo Verde

We present the first parasitological, molecular and longitudinal analysis of an isolated outbreak of malaria. This outbreak occurred on Santiago Island (Republic of Cabo Verde), a region where malaria is hypoendemic and controlled, and thus the population is considered non-immune. Blood samples were collected from the inhabitants over 1 month and during cross-sectional surveys in the following year. The presence and nature of the parasites was determined by PCR. Plasmodium falciparum was the only species detected. Genetic analysis revealed that the circulating parasites were genetically homogeneous, and probably clonal. Gametocytes were found throughout this period. Our data suggest that this represented a focal outbreak, resulting in the infection of at least 40% of the villagers with a clonal parasite line. Thus, P. falciparum infections can persist for at least 1 year in a substantial proportion (10%) of the hosts. Implications for malaria control and the interpretation of epidemiological data are discussed

Assessement of Malaria Transmission in an Area with Very Low Mosquito Density

The increase in world travel in recent years, especially to and from areas where vector-borne diseases are endemic, has resulted in a substantial rise in imported cases of those diseases. In particular, malaria is a cause of concern. In those countries at the edge of its distribution, it can be difficult to distinguish between autochthonous and imported cases. However, distinguishing between the two is important because of the different allocation of resources to combat the disease that each requires. In general, observation of the various stages of parasite development in wild-caught female mosquitoes is considered evidence of autochthonous transmission. Observation of oocysts in the mosquito mid-gut testifies that mosquitoes are susceptible to infection but conclusions cannot be reached about their ability to complete the transmission cycle. Perhaps the best indication of autochthonous transmission is microscopic observation of sporozoites in mosquito salivary glands, since this detects parasites ready to be inoculated (BELER et al., 1990). Detection of circumsporozoite protein (CSP)(BURKOT, WILLIAMS & SCHNEIDER, 1984) in dry mosquito thoraxes, by Enzyme Linked Immunosorbent Assay (ELISA) is also widely used to determine transmission, especially when large numbers of mosquitoes need to be processed. Such assays provide information about the parasite species infecting the mosquito (BURKOT & WIRTZ, 1986; WIRTZ et al., 1987; BELER et al., 1990)

Genome landscapes and bacteriophage codon usage

Across all kingdoms of biological life, protein-coding genes exhibit unequal usage of synonmous codons. Although alternative theories abound, translational selection has been accepted as an important mechanism that shapes the patterns of codon usage in prokaryotes and simple eukaryotes. Here we analyze patterns of codon usage across 74 diverse bacteriophages that infect E. coli, P. aeruginosa and L. lactis as their primary host. We introduce the concept of a `genome landscape,' which helps reveal non-trivial, long-range patterns in codon usage across a genome. We develop a series of randomization tests that allow us to interrogate the significance of one aspect of codon usage, such a GC content, while controlling for another aspect, such as adaptation to host-preferred codons. We find that 33 phage genomes exhibit highly non-random patterns in their GC3-content, use of host-preferred codons, or both. We show that the head and tail proteins of these phages exhibit significant bias towards host-preferred codons, relative to the non-structural phage proteins. Our results support the hypothesis of translational selection on viral genes for host-preferred codons, over a broad range of bacteriophages.Comment: 9 Color Figures, 5 Tables, 53 Reference

Computations of Unsteady Viscous Compressible Flows Using Adaptive Mesh Refinement in Curvilinear Body-fitted Grid Systems

A methodology for accurate and efficient simulation of unsteady, compressible flows is presented. The cornerstones of the methodology are a special discretization of the Navier-Stokes equations on structured body-fitted grid systems and an efficient solution-adaptive mesh refinement technique for structured grids. The discretization employs an explicit multidimensional upwind scheme for the inviscid fluxes and an implicit treatment of the viscous terms. The mesh refinement technique is based on the AMR algorithm of Berger and Colella. In this approach, cells on each level of refinement are organized into a small number of topologically rectangular blocks, each containing several thousand cells. The small number of blocks leads to small overhead in managing data, while their size and regular topology means that a high degree of optimization can be achieved on computers with vector processors

Antitumour necrosis factor-α therapy for hidradenitis suppurativa: results from a national cohort study between 2000 and 2013

International audienceHidradenitis suppurativa (HS) is a frequent chronic inflammatory skin disease typically characterized by recurrent painful, deep inflammatory nodules of the axillary, breast, groin and gluteal areas. European recommendations are mainly based on expert opinion. Drug treatments are heterogenous (e.g., antibiotics, corticosteroids, retinoids) and lack consensus among expert centres. The most severe disease forms or those failing to respond to conventional drugs may be associated with worsened functional prognosis. Anti-tumor necrosis factor α (anti-TNFα) drugs have been prescribed in these cases. The results of randomized controlled trials (RCTs) are discordant. Three RCTs concluded to the efficacy of adalimumab (ADA), and two others did not detect any difference between infliximab (IFX) or etanercept (ETA) and placebo. Finally, data from the literature and reported experiences do not conclude on the efficacy of anti-TNFα drugs for HS. This article is protected by copyright. All rights reserve