DNA replication is a dynamic process that occurs in a temporal order along each of the chromosomes. A consequence of the temporally coordinated activation of replication origins is the establishment of broad domains (>100 kb) that replicate either early or late in S phase. This partitioning of the genome into early and late replication domains is important for maintaining genome stability, gene...

It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on-Chip. This paper proposes a novel scheduling algorithm, called Replication-based Partial Dynamic Scheduling (RPDS). It aims to improve the NP performance by combining the strategies of partial dynamic mapping and tas...

This paper provides a new hedge fund replication method, which extends Kat and Palaro (2005) and Papageorgiou, Remillard and Hocquard (2008) to multiple trading assets with both long and short positions. The method generates a target payoff distribution by the cheapest dynamic portfolio. It is regarded as an extension of Dybvig (1988) to continuous-time framework and dynamic portfolio optimizat...

Distributed Hash Tables (DHTs) provide an efficient solution for data location and lookup in large-scale P2P systems. However, it is up to the applications to deal with the availability of the data they store in the DHT, e.g. via replication. To improve data availability, most DHT applications rely on data replication. However, efficient replication management is quite challenging, in particula...

In designing and building distributed systems, it is common engineering practice to separate steady-state (“normal”) operation from abnormal events such as recovery from failure. This way the normal case can be optimized extensively while recovery can be amortized. However, integrating the recovery procedure with the steady-state protocol is often far from obvious, and can present subtle diffic...

Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).

*Correspondence: [email protected] 1Institute of Networked and Embedded Systems/Lakeside Labs, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria 2Computer Science Department, University of Neuchâtel, Neuchâtel, Switzerland Full list of author information is available at the end of the article Abstract Purpose: Content delivery in dynamic networks is a challenging task, because paths may...

Many algorithms exist in literature to manage replicated database objects. Some of these are dynamic and attempt to adapt to changing network configurations due to failures, particularly due to network partitioning. This paper presents a new dynamic algorithm for replication control with several desirable features: not only does it enhance the availability of read and write operations in failur...

Dynamic replication can be used to reduce bandwidth and access latency in high performance “data grids” where users require remote access to files that are large: on average, around two Gigabytes. Different replication strategies are defined depending on when, where, and how the replicas are created and destroyed. We describe a simulation framework that we have developed to enable comparative s...

PURPOSE OF REVIEW HIV targets primary CD4(+) T cells. The virus depends on the physiological state of its target cells for efficient replication, and, in turn, viral infection perturbs the cellular state significantly. Identifying the virus-host interactions that drive these dynamic changes is important for a better understanding of viral pathogenesis and persistence. The present review focuses...