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.

A Revisit to Capture the Entire Behavior of Ultrasonic Wave Dispersion Characteristics of Single Walled Carbon Nanotubes Based on Nonlocal Elasticity Theory and Flugge Shell Model

In this paper, an ultrasonic wave propagation analysis in single-walled carbon nanotube (SWCNT) is re-studied using nonlocal elasticity theory, to capture the whole behaviour. The SWCNT is modeled using Flugge's shell theory, with the wall having axial, circumferential and radial degrees of freedom and also including small scale effects. Nonlocal governing equations for this system are derived and wave propagation analysis is also carried out. The revisited nonlocal elasticity calculation shows that the wavenumber tends to infinite at certain frequencies and the corresponding wave velocity tends to zero at those frequencies indicating localization and stationary behavior. This frequency is termed as escape frequency. This behavior is observed only for axial and radial waves in SWCNT. It has been shown that the circumferential waves will propagate dispersively at higher frequencies in nonlocality. The magnitudes of wave velocities of circumferential waves are smaller in nonlocal elasticity as compared to local elasticity. We also show that the explicit expressions of cut-off frequency depend on the nonlocal scaling parameter and the axial wavenumber. The effect of axial wavenumber on the ultrasonic wave behavior in SWCNTs is also discussed. The present results are compared with the corresponding results (for first mode) obtained from ab initio and 3-D elastodynamic continuum models. The acoustic phonon dispersion relation predicted by the present model is in good agreement with that obtained from literature. The results are new and can provide useful guidance for the study and design of the next generation of nanodevices that make use of the wave propagation properties of single-walled carbon nanotubes.

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.

Contractive Hilbert modules and their dilations

In this note, we show that a quasi-free Hilbert module R defined over the polydisk algebra with kernel function k(z,w) admits a unique minimal dilation (actually an isometric co-extension) to the Hardy module over the polydisk if and only if S (-1)(z, w)k(z, w) is a positive kernel function, where S(z,w) is the Szego kernel for the polydisk. Moreover, we establish the equivalence of such a factorization of the kernel function and a positivity condition, defined using the hereditary functional calculus, which was introduced earlier by Athavale [8] and Ambrozie, Englis and Muller [2]. An explicit realization of the dilation space is given along with the isometric embedding of the module R in it. The proof works for a wider class of Hilbert modules in which the Hardy module is replaced by more general quasi-free Hilbert modules such as the classical spaces on the polydisk or the unit ball in a'', (m) . Some consequences of this more general result are then explored in the case of several natural function algebras.

Effect of dehydration on the mechanical properties of sodium saccharin dihydrate probed with nanoindentation

Nanoindentation is used to explore the variation of mechanical properties associated with the dehydration process in sodium saccharin dihydrate. Upon indenting using a Berkovich tip, (011) and (101) faces exhibit explicit mechanical anisotropy that is consistent with the underlying crystal structure and intermolecular interactions. For freshly grown crystals, (011) is stiffer than (101) by 14%, while (101) is harder than (011) by 8%. Being a heavily hydrated system, the measured mechanical responses contain information pertinent to the fluidity associated with lattice water. Indentation on (011) with a sharp cube-corner tip induces a fluid flow; this observation is uncommon in molecular crystals. The crystals effloresce over a period of time with the generation of a more compact crystal structure and consequently increasing H and E.

Five-stage Milstein methods for SDEs

In this paper, we consider the problem of computing numerical solutions for Ito stochastic differential equations (SDEs). The five-stage Milstein (FSM) methods are constructed for solving SDEs driven by an m-dimensional Wiener process. The FSM methods are fully explicit methods. It is proved that the FSM methods are convergent with strong order 1 for SDEs driven by an m-dimensional Wiener process. The analysis of stability (with multidimensional Wiener process) shows that the mean-square stable regions of the FSM methods are unbounded. The analysis of stability shows that the mean-square stable regions of the methods proposed in this paper are larger than the Milstein method and three-stage Milstein methods.

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.

Reduced dimensionality 3D HNCAN for unambiguous HN, CA and N assignment in proteins

We present here an improvisation of HNN (Panchal, Bhavesh et al., 2001) called RD 3D HNCAN for backbone (HN, CA and N-15) assignment in both folded and unfolded proteins. This is a reduced dimensionality experiment which employs CA chemical shifts to improve dispersion. Distinct positive and negative peak patterns of various triplet segments along the polypeptide chain observed in HNN are retained and these provide start and check points for the sequential walk. Because of co-incrementing of CA and N-15, peaks along one of the dimensions appear at sums and differences of the CA and N-15 chemical shifts. This changes the backbone assignment protocol slightly and we present this in explicit detail. The performance of the experiment has been demonstrated using Ubiquitin and Plasmodium falciparum P2 proteins. The experiment is particularly valuable when two neighboring amino acid residues have nearly identical backbone N-15 chemical shifts. (C) 2012 Elsevier Inc. All rights reserved.

Dilations of Gamma-contractions by solving operator equations

For a contraction P and a bounded commutant S of P. we seek a solution X of the operator equation S - S*P = (1 - P* P)(1/2) X (1 - P* P)(1/2) where X is a bounded operator on (Ran) over bar (1 - P* P)(1/2) with numerical radius of X being not greater than 1. A pair of bounded operators (S, P) which has the domain Gamma = {(z(1) + z(2), z(2)): vertical bar z(1)vertical bar < 1, vertical bar z(2)vertical bar <= 1} subset of C-2 as a spectral set, is called a P-contraction in the literature. We show the existence and uniqueness of solution to the operator equation above for a Gamma-contraction (S, P). This allows us to construct an explicit Gamma-isometric dilation of a Gamma-contraction (S, P). We prove the other way too, i.e., for a commuting pair (S, P) with parallel to P parallel to <= 1 and the spectral radius of S being not greater than 2, the existence of a solution to the above equation implies that (S, P) is a Gamma-contraction. We show that for a pure F-contraction (S, P), there is a bounded operator C with numerical radius not greater than 1, such that S = C + C* P. Any Gamma-isometry can be written in this form where P now is an isometry commuting with C and C. Any Gamma-unitary is of this form as well with P and C being commuting unitaries. Examples of Gamma-contractions on reproducing kernel Hilbert spaces and their Gamma-isometric dilations are discussed. (C) 2012 Elsevier Inc. All rights reserved.

A coupled VOF-IBM-enthalpy approach for modeling motion and growth of equiaxed dendrites in a solidifying melt

A coupled methodology for simulating the simultaneous growth and motion of equiaxed dendrites in solidifying melts is presented. The model uses the volume-averaging principles and combines the features of the enthalpy method for modeling growth, immersed boundary method for handling the rigid solid-liquid interfaces, and the volume of fluid method for tracking the advection of the dendrite. The algorithm also performs explicit-implicit coupling between the techniques used. A two-dimensional framework with incompressible and Newtonian fluid is considered. Validation with available literature is performed and dendrite growth in the presence of rotational and buoyancy driven flow fields is studied. It is seen that the flow fields significantly alter the position and morphology of the dendrites. (C) 2012 Elsevier Inc. All rights reserved.

Cobalt-doped ZnO nanowires on quartz: Synthesis by simple chemical method and characterization

The synthesis of cobalt-doped ZnO nanowires is achieved using a simple, metal salt decomposition growth technique. A sequence of drop casting on a quartz substrate held at 100 degrees C and annealing results in the growth of nanowires of average (modal) length similar to 200 nm and diameter of 15 +/- 4 nm and consequently an aspect ratio of similar to 13. A variation in the synthesis process, where the solution of mixed salts is deposited on the substrate at 25 degrees C, yields a grainy film structure which constitutes a useful comparator case. X-ray diffraction shows a preferred 0001] growth direction for the nanowires while a small unit cell volume contraction for Co-doped samples and data from Raman spectroscopy indicate incorporation of the Co dopant into the lattice; neither technique shows explicit evidence of cobalt oxides. Also the nanowire samples display excellent optical transmission across the entire visible range, as well as strong photoluminescence (exciton emission) in the near UV, centered at 3.25 eV. (C) 2012 Elsevier B.V. All rights reserved.

Energy absorption behaviours of CSM-based GFRC plates with hemispherical features

In the present study, the mechanical behaviour of CSM (chopped strand mat)-based GFRC (glass fibre-reinforced composite) plates with single and multiple hemispheres under compressive loads has been investigated both experimentally and numerically. The basic stress-strain behaviours arc identified with quasi-static tests on two-ply coupon laminates and short cylinders, and these are followed up with compressive tests in a UTM (universal testing machine) on single- and multiple-hemisphere plates. The ability of an explicit LS-DYNA solver in predicting the complex material behaviour of composite hemispheres, including failure, is demonstrated. The relevance and scalability of the present class of structural components as `force-multipliers' and `energy-multipliers' have been justified by virtue of findings that as the number of hemispheres in a panel increased from one to four, peak load and average absorbed energy rose by factors of approximately four and six, respectively. The performance of a composite hemisphere has been compared to similar-sized steel and aluminium hemispheres, and the former is found to be of distinctly higher specific energy than the steel specimen. A simulation-based study has also been carried out on a composite 2 x 2-hemisphere panel under impact loads and its behaviour approaching that of an ideal energy absorber has been predicted. In summary, the present investigation has established the efficacy of composite plates with hemispherical force multipliers as potential energy-absorbing countermeasures and the suitability of CAE (computer-aided engineering) for their design.

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.

Practical fully three-dimensional reconstruction algorithms for diffuse optical tomography

We have developed an efficient fully three-dimensional (3D) reconstruction algorithm for diffuse optical tomography (DOT). The 3D DOT, a severely ill-posed problem, is tackled through a pseudodynamic (PD) approach wherein an ordinary differential equation representing the evolution of the solution on pseudotime is integrated that bypasses an explicit inversion of the associated, ill-conditioned system matrix. One of the most computationally expensive parts of the iterative DOT algorithm, the reevaluation of the Jacobian in each of the iterations, is avoided by using the adjoint-Broyden update formula to provide low rank updates to the Jacobian. In addition, wherever feasible, we have also made the algorithm efficient by integrating along the quadratic path provided by the perturbation equation containing the Hessian. These algorithms are then proven by reconstruction, using simulated and experimental data and verifying the PD results with those from the popular Gauss-Newton scheme. The major findings of this work are as follows: (i) the PD reconstructions are comparatively artifact free, providing superior absorption coefficient maps in terms of quantitative accuracy and contrast recovery; (ii) the scaling of computation time with the dimension of the measurement set is much less steep with the Jacobian update formula in place than without it; and (iii) an increase in the data dimension, even though it renders the reconstruction problem less ill conditioned and thus provides relatively artifact-free reconstructions, does not necessarily provide better contrast property recovery. For the latter, one should also take care to uniformly distribute the measurement points, avoiding regions close to the source so that the relative strength of the derivatives for measurements away from the source does not become insignificant. (c) 2012 Optical Society of America

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parameterization of the maximum-likelihood decoding complexity for linear codes. In this paper, we show the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.