Mutational meltdown in primary endosymbionts: selection limits Muller's ratchet

Background Primary bacterial endosymbionts of insects (p-endosymbionts) are thought to be undergoing the process of Muller's ratchet where they accrue slightly deleterious mutations due to genetic drift in small populations with negligible recombination rates. If this process were to go unchecked over time, theory predicts mutational meltdown and eventual extinction. Although genome degradation is common among p-endosymbionts, we do not observe widespread p-endosymbiont extinction, suggesting that Muller's ratchet may be slowed or even stopped over time. For example, selection may act to slow the effects of Muller's ratchet by removing slightly deleterious mutations before they go to fixation thereby causing a decrease in nucleotide substitutions rates in older p-endosymbiont lineages. Methodology/Principal Findings To determine whether selection is slowing the effects of Muller's ratchet, we determined the age of the Candidatus Riesia/sucking louse assemblage and analyzed the nucleotide substitution rates of several p-endosymbiont lineages that differ in the length of time that they have been associated with their insect hosts. We find that Riesia is the youngest p-endosymbiont known to date, and has been associated with its louse hosts for only 13–25 My. Further, it is the fastest evolving p-endosymbiont with substitution rates of 19–34% per 50 My. When comparing Riesia to other insect p-endosymbionts, we find that nucleotide substitution rates decrease dramatically as the age of endosymbiosis increases. Conclusions/Significance A decrease in nucleotide substitution rates over time suggests that selection may be limiting the effects of Muller's ratchet by removing individuals with the highest mutational loads and decreasing the rate at which new mutations become fixed. This countering effect of selection could slow the overall rate of endosymbiont extinction.

Materiality, subjectification, and government: the geographies of Britain's Motorway Code

In this paper I provide a critical discussion of Foucault's work on government and governmentality. I argue that geographers have tended to overlook the ways in which practices of self-government and subjectification are performed in relation to programmes of government, and suggest that they should examine the technical devices which are embedded in networks of government. Drawing upon these observations I suggest how geographers might proceed, tracing the geographies of a specific artefact: the British government's 1958 Motorway Code. I examine how the code was designed to serve as a technology of government that could shape the conduct of fairly mobile and distant subjects, enabling them to govern their conduct and the movements of their vehicles.

MPJ express meets gadget: towards a java code for cosmological simulations

Gadget-2 is a massively parallel structure formation code for cosmological simulations. In this paper, we present a Java version of Gadget-2. We evaluated the performance of the Java version by running colliding galaxies simulation and found that it can achieve around 70% of C Gadget-2's performance.

A robust non-orthogonal space-time block code for four transmit antennas

Several non-orthogonal space-time block coding (NO-STBC) schemes have recently been proposed to achieve full rate transmission. Some of these schemes, however, suffer from weak robustness: their channel matrices will become ill conditioned in the case of highly correlated channels (HCC). To address this issue, this paper derives a family of robust NO-STBC schemes for four Tx antennas based on the worst case of HCC. These codes turned out to be a superset of Jafarkhani's quasi-orthogonal STBC codes. A computationally affordable linear decoder is also proposed. Although these codes achieve a similar performance to the non-robust schemes under normal channel conditions, they offer a strong robustness against HCC (although possibly yielding a poorer performance). Finally, computer simulations are presented to verify the algorithm design.

Code-switching and transfer: an exploration of similarities and differences

This handbook article gives an historical overview of the development of research into code-switching and discusses its relationship to other language contact phenomena.