Replication is a key technique in the design of efficient and reliable distributed systems. As information grows, it becomes difficult or even impossible to store all information at every replica. A common approach to deal with this problem is to rely on partial replication, where each replica maintains only a part of the total system information. As a consequence, a remote replica might need t...

We consider the problem of NON-UNIFORM GRAPH PARTITIONING, where the input is an edge-weighted undirected graph G = (V,E) and k capacities n1, . . . , nk, and the goal is to find a partition {S1, S2, . . . , Sk} of V satisfying |Sj | ≤ nj for all 1 ≤ j ≤ k, that minimizes the total weight of edges crossing between different parts. This natural graph partitioning problem arises in practical scen...

Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant losses in performance. However, these performance losses are incurred only due to a small fraction of instructions, which are intolerant to the non-atomic scheduling. We first perform an empirical analysis of the inst...

As devices become more susceptible to transient faults that can affect program correctness, processor designers will increasingly compensate by adding hardware or software redundancy. Proposed redundancy techniques and those currently in use are generally applied uniformly to a structure despite non-uniformity in the way errors within the structure manifest themselves in programs. This uniform ...

We investigate in this paper the non-uniform sampling of EEG dipolar potentials and its impact on source analysis. We suppose some a priori knowledge on the approximate location of the dipole. We show that, in a noise-free situation, the electrode spacing needs to be around 3cm in the region of the dipole only, whereas it can drop to 8cm in remote regions.

Given εi ∈ [0,1) for each 1 < i < n, a particle performs the following random walk on {1,2, . . . ,n}: If the particle is at n, it chooses a point uniformly at random (u.a.r.) from {1, . . . ,n− 1}. If the current position of the particle is m (1 < m < n), with probability εm it decides to go back, in which case it chooses a point u.a.r. from {m + 1, . . . ,n}. With probability 1− εm it decides...

In this paper we begin the study the dynamical behavior of non-uniform cellular automata and compare it to the behavior of “classical” cellular automata. In particular we focus on surjectivity and equicontinuity.

Background CMR tagging in polar patterns is desirable because of its close compatibility to the annular geometry and motion of the left ventricle in short axis view. This circular symmetry does not exist in some pathological cases neither in the normal long axis view. An oval-shaped pattern is more suitable for assessment of the deformation in these conditions. Herein, we present the non-unifor...

We provide a joint strong approximation of the uniform spacings empirical pro1 cess and of the uniform quantile process by sequences of independent Gaussian processes. 2 This allows us to obtain an explicit description of the limiting Gaussian process generated by 3 the sample spacings from a non-uniform distribution. It is of the form B(t)+ (1− σF ){(1− 4 t) log(1 − t)} ∫ 1 0 {B(s)/(1 − s)}ds,...