Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

The Nature of Bond Critical Points in Dinuclear Copper(I) Complexes

Closed-shell contacts between two copper(I) ions are expected to be repulsive. However, such contacts are quite frequent and are well documented. Crystallographic characterization of such contacts in unsupported and bridged multinuclear copper(I) complexes has repeatedly invited debates on the existence of cuprophilicity. Recent developments in the application of Baders theory of atoms-in-molecules (AIM) to systems in which weak hydrogen bonds are involved suggests that the copper(I)copper(I) contacts would benefit from a similar analysis. Thus the nature of electron-density distributions in copper(I) dimers that are unsupported, and those that are bridged, have been examined. A comparison of complexes that are dimers of symmetrical monomers and those that are dimers of two copper(I) monomers with different coordination spheres has also been made. AIM analysis shows that a bond critical point (BCP) between two Cu atoms is present in most cases. The nature of the BCP in terms of the electron density, ?, and its Laplacian is quite similar to the nature of critical points observed in hydrogen bonds in the same systems. The ? is inversely correlated to Cu?Cu distance. It is higher in asymmetrical systems than what is observed in corresponding symmetrical systems. By examining the ratio of the local electron potential-energy density (Vc) to the kinetic energy density (Gc), |Vc|/Gc at the critical point suggests that these interactions are not perfectly ionic but have some shared nature. Thus an analysis of critical points by using AIM theory points to the presence of an attractive metallophilic interaction similar to other well-documented weak interactions like hydrogen bonding.

Quenching across quantum critical points in periodic systems: Dependence of scaling laws on periodicity

We study the quenching dynamics of a many-body system in one dimension described by a Hamiltonian that has spatial periodicity. Specifically, we consider a spin-1/2 chain with equal xx and yy couplings and subject to a periodically varying magnetic field in the (z) over cap direction or, equivalently, a tight-binding model of spinless fermions with a periodic local chemical potential, having period 2q, where q is a positive integer. For a linear quench of the strength of the magnetic field (or chemical potential) at a rate 1/tau across a quantum critical point, we find that the density of defects thereby produced scales as 1/tau(q/(q+1)), deviating from the 1/root tau scaling that is ubiquitous in a range of systems. We analyze this behavior by mapping the low-energy physics of the system to a set of fermionic two-level systems labeled by the lattice momentum k undergoing a nonlinear quench as well as by performing numerical simulations. We also show that if the magnetic field is a superposition of different periods, the power law depends only on the smallest period for very large values of tau, although it may exhibit a crossover at intermediate values of tau. Finally, for the case where a zz coupling is also present in the spin chain, or equivalently, where interactions are present in the fermionic system, we argue that the power associated with the scaling law depends on a combination of q and the interaction strength.

Determination of alpha(s)(M-tau(2)) from improved fixed order perturbation theory

We revisit the extraction of alpha(s)(M-tau(2)) from the QCD perturbative corrections to the hadronic tau branching ratio, using an improved fixed-order perturbation theory based on the explicit summation of all renormalization-group accessible logarithms, proposed some time ago in the literature. In this approach, the powers of the coupling in the expansion of the QCD Adler function are multiplied by a set of functions D-n, which depend themselves on the coupling and can be written in a closed form by iteratively solving a sequence of differential equations. We find that the new expansion has an improved behavior in the complex energy plane compared to that of the standard fixed-order perturbation theory (FOPT), and is similar but not identical to the contour-improved perturbation theory (CIPT). With five terms in the perturbative expansion we obtain in the (MS) over bar scheme alpha(s)(M-tau(2)) = 0.338 +/- 0.010, using as input a precise value for the perturbative contribution to the hadronic width of the tau lepton reported recently in the literature.

Uptake of permanganate from aqueous environment by surfactant modified montmorillonite batch and fixed bed studies

Organo-clay was prepared by incorporating different amounts (in terms of CEC, ranging from 134-840 mg of quaternary ammonium cation (QACs) such as hexadecytrimethylammonium bromide (C19H42N]Br) into the montmorillonite clay. Prepared organo-clays are characterized by CHN analyser and XRD to measure the amount of elemental content and interlayer spacing of surfactant modified clay. The batch experiments of sorption of permanganate from aqueous media by organo-clays was studied at different acidic strengths (pH 1-7). The experimental results show that the rate and amount of adsorption of permanganate was higher at lower pH compared to raw montmorillonite. Laboratory fixed bed experiments were conducted to evaluate the breakthrough time and nature of breakthrough curves. The shape of the breakthrough curves shows that the initial cationic surfactant loadings at 1.0 CEC of the clay is enough to enter the permanganate ions in to the interlamellar region of the surfactant modified smectile clays. These fixed bed studies were also applied to quantify the effect of bed-depth and breakthrough time during the uptake of permanganate. Calculation of thermodynamic parameters shows that the sorption of permanganate is spontaneous and follows the first order kinetics.

Synchronization of globally coupled two-state stochastic oscillators with a state-dependent refractory period

We present a model of identical coupled two-state stochastic units, each of which in isolation is governed by a fixed refractory period. The nonlinear coupling between units directly affects the refractory period, which now depends on the global state of the system and can therefore itself become time dependent. At weak coupling the array settles into a quiescent stationary state. Increasing coupling strength leads to a saddle node bifurcation, beyond which the quiescent state coexists with a stable limit cycle of nonlinear coherent oscillations. We explicitly determine the critical coupling constant for this transition.

Exploiting the Structure of the Constraint Graph for Efficient Points-to Analysis

Points-to analysis is a key compiler analysis. Several memory related optimizations use points-to information to improve their effectiveness. Points-to analysis is performed by building a constraint graph of pointer variables and dynamically updating it to propagate more and more points-to information across its subset edges. So far, the structure of the constraint graph has been only trivially exploited for efficient propagation of information, e.g., in identifying cyclic components or to propagate information in topological order. We perform a careful study of its structure and propose a new inclusion-based flow-insensitive context-sensitive points-to analysis algorithm based on the notion of dominant pointers. We also propose a new kind of pointer-equivalence based on dominant pointers which provides significantly more opportunities for reducing the number of pointers tracked during the analysis. Based on this hitherto unexplored form of pointer-equivalence, we develop a new context-sensitive flow-insensitive points-to analysis algorithm which uses incremental dominator update to efficiently compute points-to information. Using a large suite of programs consisting of SPEC 2000 benchmarks and five large open source programs we show that our points-to analysis is 88% faster than BDD-based Lazy Cycle Detection and 2x faster than Deep Propagation. We argue that our approach of detecting dominator-based pointer-equivalence is a key to improve points-to analysis efficiency.

Prioritizing constraint evaluation for efficient points-to analysis

Pervasive use of pointers in large-scale real-world applications continues to make points-to analysis an important optimization-enabler. Rapid growth of software systems demands a scalable pointer analysis algorithm. A typical inclusion-based points-to analysis iteratively evaluates constraints and computes a points-to solution until a fixpoint. In each iteration, (i) points-to information is propagated across directed edges in a constraint graph G and (ii) more edges are added by processing the points-to constraints. We observe that prioritizing the order in which the information is processed within each of the above two steps can lead to efficient execution of the points-to analysis. While earlier work in the literature focuses only on the propagation order, we argue that the other dimension, that is, prioritizing the constraint processing, can lead to even higher improvements on how fast the fixpoint of the points-to algorithm is reached. This becomes especially important as we prove that finding an optimal sequence for processing the points-to constraints is NP-Complete. The prioritization scheme proposed in this paper is general enough to be applied to any of the existing points-to analyses. Using the prioritization framework developed in this paper, we implement prioritized versions of Andersen's analysis, Deep Propagation, Hardekopf and Lin's Lazy Cycle Detection and Bloom Filter based points-to analysis. In each case, we report significant improvements in the analysis times (33%, 47%, 44%, 20% respectively) as well as the memory requirements for a large suite of programs, including SPEC 2000 benchmarks and five large open source programs.

Performance analysis of fixed gain amplify-and-forward relaying with time-efficient cascaded channel estimation

In a cooperative system with an amplify-and-forward relay, the cascaded channel training protocol enables the destination to estimate the source-destination channel gain and the product of the source-relay (SR) and relay-destination (RD) channel gains using only two pilot transmissions from the source. Notably, the destination does not require a separate estimate of the SR channel. We develop a new expression for the symbol error probability (SEP) of AF relaying when imperfect channel state information (CSI) is acquired using the above training protocol. A tight SEP upper bound is also derived; it shows that full diversity is achieved, albeit at a high signal-to-noise ratio (SNR). Our analysis uses fewer simplifying assumptions, and leads to expressions that are accurate even at low SNRs and are different from those in the literature. For instance, it does not approximate the estimate of the product of SR and RD channel gains by the product of the estimates of the SR and RD channel gains. We show that cascaded channel estimation often outperforms a channel estimation protocol that incurs a greater training overhead by forwarding a quantized estimate of the SR channel gain to the destination. The extent of pilot power boosting, if allowed, that is required to improve performance is also quantified.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

DSA image registration using non-uniform MRF model and pivotal control points

In order to reduce the motion artifacts in DSA, non-rigid image registration is commonly used before subtracting the mask from the contrast image. Since DSA registration requires a set of spatially non-uniform control points, a conventional MRF model is not very efficient. In this paper, we introduce the concept of pivotal and non-pivotal control points to address this, and propose a non-uniform MRF for DSA registration. We use quad-trees in a novel way to generate the non-uniform grid of control points. Our MRF formulation produces a smooth displacement field and therefore results in better artifact reduction than that of registering the control points independently. We achieve improved computational performance using pivotal control points without compromising on the artifact reduction. We have tested our approach using several clinical data sets, and have presented the results of quantitative analysis, clinical assessment and performance improvement on a GPU. (C) 2013 Elsevier Ltd. All rights reserved.

On the Erdos-Szekeres n-interior-point problem

The n-interior-point variant of the Erdos Szekeres problem is the following: for every n, n >= 1, does there exist a g(n) such that every point set in the plane with at least g(n) interior points has a convex polygon containing exactly n interior points. The existence of g(n) has been proved only for n <= 3. In this paper, we show that for any fixed r >= 2, and for every n >= 5, every point set having sufficiently large number of interior points and at most r convex layers contains a subset with exactly n interior points. We also consider a relaxation of the notion of convex polygons and show that for every n, n >= 1, any point set with at least n interior points has an almost convex polygon (a simple polygon with at most one concave vertex) that contains exactly n interior points. (C) 2013 Elsevier Ltd. All rights reserved.

A general geomorphological recession flow model for river basins

Recession flows in a basin are controlled by the temporal evolution of its active drainage network (ADN). The geomorphological recession flow model (GRFM) assumes that both the rate of flow generation per unit ADN length (q) and the speed at which ADN heads move downstream (c) remain constant during a recession event. Thereby, it connects the power law exponent of -dQ/dt versus Q (discharge at the outlet at time t) curve, , with the structure of the drainage network, a fixed entity. In this study, we first reformulate the GRFM for Horton-Strahler networks and show that the geomorphic ((g)) is equal to D/(D-1), where D is the fractal dimension of the drainage network. We then propose a more general recession flow model by expressing both q and c as functions of Horton-Strahler stream order. We show that it is possible to have = (g) for a recession event even when q and c do not remain constant. The modified GRFM suggests that is controlled by the spatial distribution of subsurface storage within the basin. By analyzing streamflow data from 39 U.S. Geological Survey basins, we show that is having a power law relationship with recession curve peak, which indicates that the spatial distribution of subsurface storage varies across recession events. Key Points The GRFM is reformulated for Horton-Strahler networks. The GRFM is modified by allowing its parameters to vary along streams. Sub-surface storage distribution controls recession flow characteristics.

DEPRESSION OF MAGNETlCALLY FIXED EMISSION ZONE IN LOW PRESSURE MERCURY ARCS

A transverse magnetic field was used to fix the cathode spot of a low pressure mercury arc with liquid cathode It was noticed that such fixation causes consider-abledepression of the emission zone below the mercury level.This depression varies with the arc current and the magnetic field and is associated with an increase in the arc voltage drop. It indicates appreciable pressure in the emission zone.