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.

Hydrolysis of Ammonia Borane as a Hydrogen Source: Fundamental Issues and Potential Solutions Towards Implementation

In todays era of energy crisis and global warming, hydrogen has been projected as a sustainable alternative to depleting CO2-emitting fossil fuels. However, its deployment as an energy source is impeded by many issues, one of the most important being storage. Chemical hydrogen storage materials, in particular B?N compounds such as ammonia borane, with a potential storage capacity of 19.6 wt?% H2 and 0.145 kg?H?2?L-1, have been intensively studied from the standpoint of addressing the storage issues. Ammonia borane undergoes dehydrogenation through hydrolysis at room temperature in the presence of a catalyst, but its practical implementation is hindered by several problems affecting all of the chemical compounds in the reaction scheme, including ammonia borane, water, borate byproducts, and hydrogen. In this Minireview, we exhaustively survey the state of the art, discuss the fundamental problems, and, where applicable, propose solutions with the prospect of technological applications.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

A survey of cloud storage facilities

There are many applications such as software for processing customer records in telecom, patient records in hospitals, email processing software accessing a single email in a mailbox etc. which require to access a single record in a database consisting of millions of records. A basic feature of these applications is that they need to access data sets which are very large but simple. Cloud computing provides computing requirements for these kinds of new generation of applications involving very large data sets which cannot possibly be handled efficiently using traditional computing infrastructure. In this paper, we describe storage services provided by three well-known cloud service providers and give a comparison of their features with a view to characterize storage requirements of very large data sets as examples and we hope that it would act as a catalyst for the design of storage services for very large data set requirements in future. We also give a brief overview of other kinds of storage that have come up in the recent past for cloud computing.

Information-theoretically secure regenerating codes for distributed storage

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security. In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes. We provide explicit constructions of regenerating codes that achieve information-theoretic secrecy capacity in this setting.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Analytical solutions for diffuse fluorescence spectroscopy/imaging in biological tissues. Part I: zero and extrapolated boundary conditions

The mathematical model for diffuse fluorescence spectroscopy/imaging is represented by coupled partial differential equations (PDEs), which describe the excitation and emission light propagation in soft biological tissues. The generic closed-form solutions for these coupled PDEs are derived in this work for the case of regular geometries using the Green's function approach using both zero and extrapolated boundary conditions. The specific solutions along with the typical data types, such as integrated intensity and the mean time of flight, for various regular geometries were also derived for both time-and frequency-domain cases. (C) 2013 Optical Society of America

Analytical solutions for diffuse fluorescence spectroscopy/imaging in biological tissues. Part II: comparison and validation

The analytical solutions for the coupled diffusion equations that are encountered in diffuse fluorescence spectroscopy/ imaging for regular geometries were compared with the well-established numerical models, which are based on the finite element method. Comparison among the analytical solutions obtained using zero boundary conditions and extrapolated boundary conditions (EBCs) was also performed. The results reveal that the analytical solutions are in close agreement with the numerical solutions, and solutions obtained using EBCs are more accurate in obtaining the mean time of flight data compared to their counterpart. The analytical solutions were also shown to be capable of providing bulk optical properties through a numerical experiment using a realistic breast model. (C) 2013 Optical Society of America

Synthesis of nanosized Ce0.85M0.1Ru0.05O2-delta (M = Si, Fe) solid solution exhibiting high CO oxidation and water gas shift activity

Nanosized Ce0.85M0.1Ru0.05O2-delta (M = Si, Fe) has been synthesized using a low temperature sonication method and characterized using XRD, TEM, XPS and H-2-TPR. The potential application of both the solid solutions has been explored as exhaust catalysts by performing CO oxidation. The addition of Si- and Fe-in Ce0.95Ru0.05O2-delta greatly enhanced the reducibility of Ce0.85M0.1Ru0.05O2-delta (M = Si, Fe), as indicated by the H-2-TPR study. The oxygen storage capacity has been used to correlate surface oxygen reactivity to the CO oxidation activity. Both the compounds reversibly release lattice oxygen and exhibit excellent CO oxidation activity with 99% conversion below 200 degrees C. A bifunctional reaction mechanism involving CO oxidation by the extraction of lattice oxygen and rejuvenation of oxide vacancy with gas feed O-2 has been used to correlate experimental data. The performance of both the solid solutions has also been investigated for energy application by performing the water gas shift reaction. The present catalysts are highly active and selective towards the hydrogen production and a lack of methanation activity is an important finding of present study.

Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Solutions of a system of forced Burgers equation

In this article, we obtain explicit solutions of a system of forced Burgers equation subject to some classes of bounded and compactly supported initial data and also subject to certain unbounded initial data. In a series of papers, Rao and Yadav (2010) 1-3] obtained explicit solutions of a nonhomogeneous Burgers equation in one dimension subject to certain classes of bounded and unbounded initial data. Earlier Kloosterziel (1990) 4] represented the solution of an initial value problem for the heat equation, with initial data in L-2 (R-n, e(vertical bar x vertical bar 2/2)), as a series of self-similar solutions of the heat equation in R-n. Here we express the solutions of certain classes of Cauchy problems for a system of forced Burgers equation in terms of self-similar solutions of some linear partial differential equations. (C) 2013 Elsevier Inc. All rights reserved.

Surface freshwater storage and variability in the Amazon basin from multi-satellite observations, 1993-2007

The amount of water stored and moving through the surface water bodies of large river basins (river, floodplains, wetlands) plays a major role in the global water and biochemical cycles and is a critical parameter for water resources management. However, the spatiotemporal variations of these freshwater reservoirs are still widely unknown at the global scale. Here, we propose a hypsographic curve approach to estimate surface freshwater storage variations over the Amazon basin combining surface water extent from a multi-satellite-technique with topographic data from the Global Digital Elevation Model (GDEM) from Advance Spaceborne Thermal Emission and Reflection Radiometer (ASTER). Monthly surface water storage variations for 1993-2007 are presented, showing a strong seasonal and interannual variability, and are evaluated against in situ river discharge and precipitation. The basin-scale mean annual amplitude of similar to 1200 km(3) is in the range of previous estimates and contributes to about half of the Gravity Recovery And Climate Experiment (GRACE) total water storage variations. For the first time, we map the surface water volume anomaly during the extreme droughts of 1997 (October-November) and 2005 (September-October) and found that during these dry events the water stored in the river and floodplains of the Amazon basin was, respectively, similar to 230 (similar to 40%) and 210 (similar to 50%) km(3) below the 1993-2007 average. This new 15 year data set of surface water volume represents an unprecedented source of information for future hydrological or climate modeling of the Amazon. It is also a first step toward the development of such database at the global scale.

Role of different factors affecting interdiffusion in Cu(Ga) and Cu(Si) solid solutions

A detailed diffusion study was carried out on Cu(Ga) and Cu(Si) solid solutions in order to assess the role of different factors in the behaviour of the diffusing components. The faster diffusing species in the two systems, interdiffusion, intrinsic and impurity diffusion coefficients, are determined to facilitate the discussion. It was found that Cu was more mobile in the Cu-Si system, whereas Ga was the faster diffusing species in the Cu-Ga system. In both systems, the interdiffusion coefficients increased with increasing amount of solute (e.g. Si or Ga) in the matrix (Cu). Impurity diffusion coefficients for Si and Ga in Cu, found out by extrapolating interdiffusion coefficient data to zero composition of the solute, were both higher than the Cu tracer diffusion coefficient. These observed trends in diffusion behaviour could be rationalized by considering: (i) formation energies and concentration of vacancies, (ii) elastic moduli (indicating bond strengths) of the elements and (iii) the interaction parameters and the related thermodynamic factors. In summary, we have shown here that all the factors introduced in this paper should be considered simultaneously to understand interdiffusion in solid solutions. Otherwise, some of the aspects may look unusual or even impossible to explain.

Diffraction tomography from intensity measurements: an evolutionary stochastic search to invert experimental data

We develop iterative diffraction tomography algorithms, which are similar to the distorted Born algorithms, for inverting scattered intensity data. Within the Born approximation, the unknown scattered field is expressed as a multiplicative perturbation to the incident field. With this, the forward equation becomes stable, which helps us compute nearly oscillation-free solutions that have immediate bearing on the accuracy of the Jacobian computed for use in a deterministic Gauss-Newton (GN) reconstruction. However, since the data are inherently noisy and the sensitivity of measurement to refractive index away from the detectors is poor, we report a derivative-free evolutionary stochastic scheme, providing strictly additive updates in order to bridge the measurement-prediction misfit, to arrive at the refractive index distribution from intensity transport data. The superiority of the stochastic algorithm over the GN scheme for similar settings is demonstrated by the reconstruction of the refractive index profile from simulated and experimentally acquired intensity data. (C) 2014 Optical Society of America