Timing the Emergence of Resistance to Anti-HIV Drugs with Large Genetic Barriers

New antiretroviral drugs that offer large genetic barriers to resistance, such as the recently approved inhibitors of HIV-1 protease, tipranavir and darunavir, present promising weapons to avert the failure of current therapies for HIV infection. Optimal treatment strategies with the new drugs, however, are yet to be established. A key limitation is the poor understanding of the process by which HIV surmounts large genetic barriers to resistance. Extant models of HIV dynamics are predicated on the predominance of deterministic forces underlying the emergence of resistant genomes. In contrast, stochastic forces may dominate, especially when the genetic barrier is large, and delay the emergence of resistant genomes. We develop a mathematical model of HIV dynamics under the influence of an antiretroviral drug to predict the waiting time for the emergence of genomes that carry the requisite mutations to overcome the genetic barrier of the drug. We apply our model to describe the development of resistance to tipranavir in in vitro serial passage experiments. Model predictions of the times of emergence of different mutant genomes with increasing resistance to tipranavir are in quantitative agreement with experiments, indicating that our model captures the dynamics of the development of resistance to antiretroviral drugs accurately. Further, model predictions provide insights into the influence of underlying evolutionary processes such as recombination on the development of resistance, and suggest guidelines for drug design: drugs that offer large genetic barriers to resistance with resistance sites tightly localized on the viral genome and exhibiting positive epistatic interactions maximally inhibit the emergence of resistant genomes.

Reorientation of Water Inside Carbon Nanorings by Large Angular Jumps

Molecular dynamics simulations of the orientational dynamics of water molecules confined inside narrow carbon nanorings reveal that reorientational relaxation is mediated by large amplitude angular jumps. The distribution of waiting time between jumps peaks at about 60 fs, and has a slowly decaying exponential tail with a timescale of about 440 fs. These time scales are much faster than the mean waiting time between jumps of the water molecules in bulk.

Memory effect in Dy0.5Sr0.5MnO3 single crystals

We have performed a series of magnetic aging experiments on single crystals of Dy0.5Sr0.5MnO3. The results demonstrate striking memory and chaos-like effects in this insulating half-doped perovskite manganite and suggest the existence of strong magnetic relaxation mechanisms of a clustered magnetic state. The spin-glass-like state established below a temperature T-sg approximate to 34 K originates from quenched disorder arising due to the ionic-radii mismatch at the rare earth site. However, deviations from the typical behavior seen in canonical spin glass materials are observed which indicate that the glassy magnetic properties are due to cooperative and frustrated dynamics in a heterogeneous or clustered magnetic state. In particular, the microscopic spin flip time obtained from dynamical scaling near the spin glass freezing temperature is four orders of magnitude larger than microscopic times found in atomic spin glasses. The magnetic viscosity deduced from the time dependence of the zero-field-cooled magnetization exhibits a peak at a temperature T < T-sg and displays a marked dependence on waiting time in zero field.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.

Relaxation and jump dynamics of water at the mica interface

The orientational relaxation dynamics of water confined between mica surfaces is investigated using molecular dynamics simulations. The study illustrates the wide heterogeneity that exists in the dynamics of water adjacent to a strongly hydrophilic surface such as mica. Analysis of the survival probabilities in different layers is carried out by normalizing the corresponding relaxation times with bulk water layers of similar thickness. A 10-fold increase in the survival times is observed for water directly in contact with the mica surface and a non-monotonic variation in the survival times is observed moving away from the mica surface to the bulk-like interior. The orientational relaxation time is highest for water in the contact layer, decreasing monotonically away from the surface. In all cases the ratio of the relaxation times of the 1st and 2nd rank Legendre polynomials of the HH bond vector is found to lie between 1.5 and 1.9 indicating that the reorientational relaxation in the different water layers is governed by jump dynamics. The orientational dynamics of water in the contact layer is particularly novel and is found to undergo distinct two-dimensional hydrogen bond jump reorientational dynamics with an average waiting time of 4.97 ps. The waiting time distribution is found to possess a long tail extending beyond 15 ps. Unlike previously observed jump dynamics in bulk water and other surfaces, jump events in the mica contact layer occur between hydrogen bonds formed by the water molecule and acceptor oxygens on the mica surface. Despite slowing down of the water orientational relaxation near the surface, life-times of water in the hydration shell of the K ion are comparable to that observed in bulk salt solutions. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4717710]

How Do Glassy Domains Grow?

We construct equations for the growth kinetics of structural glass within mode-coupling theory, through a nonstationary variant of the three-density correlator defined by G. Biroli et al. Phys. Rev. Lett. 97, 195701 (2006)]. We solve a schematic form of the resulting equations to obtain the coarsening of the three-point correlator chi(3)(t, t(w)) as a function of waiting time tw. For a quench into the glass, we find that chi(3) attains a peak value similar to t(w)(0.5) at t - t(w) similar to t(w)(0.8), providing a theoretical basis for the numerical observations of Parisi J. Phys. Chem. B 103, 4128 (1999)] and Kob and Barrat Phys. Rev. Lett. 78, 4581 (1997)]. The aging is not ``simple'': the t(w) dependence cannot be attributed to an evolving effective temperature.

Packet scheduling for priority based transmission in energy harvesting sensors

In this paper, we determine packet scheduling policies for efficient power management in Energy Harvesting Sensors (EHS) which have to transmit packets of high and low priorities over a fading channel. We assume that incoming packets are stored in a buffer and the quality of service for a particular type of message is determined by the expected waiting time of packets of that type of message. The sensors are constrained to work with the energy that they garner from the environment. We derive transmit policies which minimize the sum of expected waiting times of the two types of messages, weighted by penalties. First, we show that for schemes with a constant rate of transmission, under a decoupling approximation, a form of truncated channel inversion is optimal. Using this result, we derive optimal solutions that minimize the weighted sum of the waiting times in the different queues.

Probabilistic Prediction based Scheduling for Delay Sensitive Traffic in Internet of Things

This paper proposes a probabilistic prediction based approach for providing Quality of Service (QoS) to delay sensitive traffic for Internet of Things (IoT). A joint packet scheduling and dynamic bandwidth allocation scheme is proposed to provide service differentiation and preferential treatment to delay sensitive traffic. The scheduler focuses on reducing the waiting time of high priority delay sensitive services in the queue and simultaneously keeping the waiting time of other services within tolerable limits. The scheme uses the difference in probability of average queue length of high priority packets at previous cycle and current cycle to determine the probability of average weight required in the current cycle. This offers optimized bandwidth allocation to all the services by avoiding distribution of excess resources for high priority services and yet guaranteeing the services for it. The performance of the algorithm is investigated using MPEG-4 traffic traces under different system loading. The results show the improved performance with respect to waiting time for scheduling high priority packets and simultaneously keeping tolerable limits for waiting time and packet loss for other services. Crown Copyright (C) 2015 Published by Elsevier B.V.

Influence of recombination on acquisition and reversion of immune escape and compensatory mutations in HIV-1

Following transmission, HIV-1 adapts in the new host by acquiring mutations that allow it to escape from the host immune response at multiple epitopes. It also reverts mutations associated with epitopes targeted in the transmitting host but not in the new host. Moreover, escape mutations are often associated with additional compensatory mutations that partially recover fitness costs. It is unclear whether recombination expedites this process of multi-locus adaptation. To elucidate the role of recombination, we constructed a detailed population dynamics model that integrates viral dynamics, host immune response at multiple epitopes through cytotoxic T lymphocytes, and viral evolution driven by mutation, recombination, and selection. Using this model, we compute the expected waiting time until the emergence of the strain that has gained escape and compensatory mutations against the new host's immune response, and reverted these mutations at epitopes no longer targeted. We find that depending on the underlying fitness landscape, shaped by both costs and benefits of mutations, adaptation proceeds via distinct dominant pathways with different effects of recombination, in particular distinguishing escape and reversion. When adaptation at a single epitope is involved, recombination can substantially accelerate immune escape but minimally affects reversion. When multiple epitopes are involved, recombination can accelerate or inhibit adaptation depending on the fitness landscape. Specifically, recombination tends to delay adaptation when a purely uphill fitness landscape is accessible at each epitope, and accelerate it when a fitness valley is associated with each epitope. Our study points to the importance of recombination in shaping the adaptation of HIV-1 following its transmission to new hosts, a process central to T cell-based vaccine strategies. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license.

Performance modelling of a fault-tolerant real-time multiprocessor using stochastic Petri nets

The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault- tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.

Landau-Zener problem with waiting at the minimum gap and related quench dynamics of a many-body system

We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.

Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems

Prediction of queue waiting times of jobs submitted to production parallel batch systems is important to provide overall estimates to users and can also help meta-schedulers make scheduling decisions. In this work, we have developed a framework for predicting ranges of queue waiting times for jobs by employing multi-class classification of similar jobs in history. Our hierarchical prediction strategy first predicts the point wait time of a job using dynamic k-Nearest Neighbor (kNN) method. It then performs a multi-class classification using Support Vector Machines (SVMs) among all the classes of the jobs. The probabilities given by the SVM for the class predicted using k-NN and its neighboring classes are used to provide a set of ranges of predicted wait times with probabilities. We have used these predictions and probabilities in a meta-scheduling strategy that distributes jobs to different queues/sites in a multi-queue/grid environment for minimizing wait times of the jobs. Experiments with different production supercomputer job traces show that our prediction strategies can give correct predictions for about 77-87% of the jobs, and also result in about 12% improved accuracy when compared to the next best existing method. Experiments with our meta-scheduling strategy using different production and synthetic job traces for various system sizes, partitioning schemes and different workloads, show that the meta-scheduling strategy gives much improved performance when compared to existing scheduling policies by reducing the overall average queue waiting times of the jobs by about 47%.

Unsteady-Flow Of A Viscous-Fluid Between 2 Parallel Disks With A Time-Varying Gap Width And A Magnetic-Field

The unsteady incompressible viscous fluid flow between two parallel infinite disks which are located at a distance h(t*) at time t* has been studied. The upper disk moves towards the lower disk with velocity h'(t*). The lower disk is porous and rotates with angular velocity Omega(t*). A magnetic field B(t*) is applied perpendicular to the two disks. It has been found that the governing Navier-Stokes equations reduce to a set of ordinary differential equations if h(t*), a(t*) and B(t*) vary with time t* in a particular manner, i.e. h(t*) = H(1 - alpha t*)(1/2), Omega(t*) = Omega(0)(1 - alpha t*)(-1), B(t*) = B-0(1 - alpha t*)(-1/2). These ordinary differential equations have been solved numerically using a shooting method. For small Reynolds numbers, analytical solutions have been obtained using a regular perturbation technique. The effects of squeeze Reynolds numbers, Hartmann number and rotation of the disk on the flow pattern, normal force or load and torque have been studied in detail

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Time-Resolved Resonance Raman Spectroscopic Studies on the Radical Anions of Menaquinone and Naphthoquinone

Quinones and their radical ion intermediates have been much studied by vibrational spectroscopy to understand their structure-function relationships in various biological processes. In this paper, we present a comprehensive analysis of vibrational spectra in the structure-sensitive region of both the naphthoquinone (NQ) and 2-methyl-1,4-naphthoquinone (MQ, menaquinone) radical anions using time-resolved resonance Raman and ab initio studies. Specific vibrational mode assignments have been made to all the vibrational frequencies recorded in the experiment. It is observed that the carbonyl and C-C stretching frequencies show considerable coupling in NQ and MQ radical anions. Further, the asymmetric substitution present in MQ with respect to NQ shows important signatures in the radical anion spectrum. It is concluded that assignments of vibrational frequencies of asymmetrically substituted quinones must take into consideration the influence of asymmetry on structure and reactivity.