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.

Verification of Masonry Building Code to Flexural Behavior of Cement-Stabilized Soil Block

Most studies involving cement-stabilized soil blocks (CSSB) concern material properties, such as the characteristics of erosion and strength and how the composition of the block affects these properties. Moreover, research has been conducted on the performance of various mortars, investigating their material properties and the tensile bond strength between CSSB units and mortar. In contrast, very little is currently known about CSSB masonry structural behavior. Because structural design codes of traditional masonry buildings were well developed over the past century, many of the same principles may be applicable to CSSB masonry buildings. This paper details the topic of flexural behavior of CSSB masonry walls and whether the Masonry Standards Joint Committee (MSJC) code can be applied to this material for improved safety of such buildings. DOI: 10.1061/(ASCE)MT.1943-5533.0000566. (C) 2013 American Society of Civil Engineers.

Magnetic and transport relaxation property of La0.85Sr0.15CoO3 single crystals

Here, we present a comprehensive investigation of the dc magnetization and magnetotransport studies on La0.85Sr0.15CoO3 single crystals grown by the optical float zone method. The spin freezing temperature in the ac susceptibility study shifts to lower value at higher dc field and this is well described by the de Almeida-Thouless line which is the characteristic of SG behavior. The Magnetotransport study shows that the sample exhibits a huge negative MR of similar to 70% at 10 K which monotonically decreases with the increase in temperature. Besides, the magnetization and the resistivity relaxation give strong indication that the MR scales with sample's magnetization. In essence, all the present experimental findings evidence the SG behavior of La0.85Sr0.15CoO3 single crystals.

Enhanced DMT-optimality criterion for STBC schemes for asymmetric MIMO systems

For any n(t) transmit, n(r) receive antenna (n(t) x n(r)) multiple-input multiple-output (MIMO) system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code schemes (LSTBC schemes) that have the nonvanishing determinant (NVD) property are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of n(r) if they have a code rate of n(t) complex dimensions per channel use. However, for asymmetric MIMO systems (where n(r) < n(t)), with the exception of a few LSTBC schemes, it is unknown whether general LSTBC schemes with NVD and a code rate of n(r) complex dimensions per channel use are DMT optimal. In this paper, an enhanced sufficient criterion for any STBC scheme to be DMT optimal is obtained, and using this criterion, it is established that any LSTBC scheme with NVD and a code rate of min {n(t), n(r)} complex dimensions per channel use is DMT optimal. This result settles the DMT optimality of several well-known, low-ML-decoding-complexity LSTBC schemes for certain asymmetric MIMO systems.

Structure-property correlation in BaO-TiO2-B2O3 glasses: glass stability, optical, hydrophobic, and dielectric properties

Glasses in the x(BaO-TiO2)-B2O3 (x = 0.25, 0.5, 0.75, and 1 mol.) system were fabricated via the conventional melt-quenching technique. Thermal stability and glass-forming ability as determined by differential thermal analysis (DTA) were found to increase with increasing BaO-TiO2 (BT) content. However, there was no noticeable change in the glass transition temperature (T-g). This was attributed to the active participation of TiO2 in the network formation especially at higher BT contents via the conversion of the TiO6 structural units into TiO4 units, which increased the connectivity and resulted in an increase in crystallization temperature. Dielectric and optical properties at room temperature were studied for all the glasses under investigation. Interestingly, these glasses were found to be hydrophobic. The results obtained were correlated with different structural units and their connectivity in the glasses.

Combining ``chimie douce'' and green principles for the developing world: Improving industrial viability of photocatalytic water remediation

We highlight the need for a comprehensive, multi-disciplinary approach for the development of cost-effective water remediation methods. Combining ``chimie douce'' and green chemical principles seems essential for making these technologies economically viable and socially relevant (especially in the developing world). A comprehensive approach to water remediation will take into account issues such as nanotoxicity, chemical yield, cost, and ease of deployment in reactors. By considering technological challenges that lie ahead, we will attempt to identify directions that are likely to make photocatalytic water remediation a more global technology than it currently is. (C) 2013 Elsevier Ltd. All rights reserved

Biological sulfate reduction of a sulfate-rich industrial waste liquor using sulfate reducing bacteria

An industrial waste liquor having high sulfate concentrations was subjected to biological treatment using the sulfate-reducing bacteria (SRB) Desulfovibrio desulfuricans. Toxicity levels of different sulfate, cobalt and nickel concentrations toward growth of the SRB with respect to biological sulfate reduction kinetics was initially established. Optimum sulfate concentration to promote SRB growth amounted to 0.8 - 1 g/L. The strain of D. desulfuricans used in this study initially tolerated up to 4 -5 g/L of sulfate or 50 mg/L of cobalt and nickel, while its tolerance could be further enhanced through adaptation by serial subculturing in the presence of increasing concentrations of sulfate, cobalt and nickel. From the waste liquor, more than 70% of sulfate and 95% of cobalt and nickel could be precipitated as sulfides, using a preadapted strain of D. desulfuricans. Probable mechanisms involving biological sulfide precipitation and metal adsorption onto precipitates and bacterial cells are discussed.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

CFD Analysis of two phase flow with a prediction of torque demand of a Bi-lobe rotor of a mixing chamber

An attempt to study the fluid dynamic behavior of two phase flow comprising of solid and liquid with nearly equal density in a geometrical case that has an industrial significance in theareas like processing of polymers, food, pharma ceutical, paints. In this work,crystalline silica is considered as the dispersed medium in glycerin. In the CFD analysis carried out,the two phase components are considered to be premixed homogeneously at the initial state. The flow in a cylinder that has an axially driven bi-lobe rotor, a typical blender used in polymer industry for mixing or kneading to render the multi-component mixture to homogeneous condition is considered. A viscous, incompressible, isothermal flow is considered with an assumption that the components do not undergo any physical change and the solids are rigid and mix in fully wetting conditions. Silica with a particle diameter of 0.4 mm is considered and flow is analyzed for different mixing fractions. An industry standard CFD code is used for solving 3D-RANS equations. As the outcome of the study the torque demand by the bi-lobe rotor for different mixture fractions which are estimated show a behavioral consistency to the expected physical phenomena occurring in the domain considered.

Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

Size Control and Magnetic Property Trends in Cobalt Ferrite Nanoparticles Synthesized Using an Aqueous Chemical Route

Cobalt ferrite (CoFe2O4) is an engineering material which is used for applications such as magnetic cores, magnetic switches, hyperthermia based tumor treatment, and as contrast agents for magnetic resonance imaging. Utility of ferrites nanoparticles hinges on its size, dispersibility in solutions, and synthetic control over its coercivity. In this work, we establish correlations between room temperature co-precipitation conditions, and these crucial materials parameters. Furthermore, post-synthesis annealing conditions are correlated with morphology, changes in crystal structure and magnetic properties. We disclose the synthesis and process conditions helpful in obtaining easily sinterable CoFe2O4 nanoparticles with coercive magnetic flux density (H-c) in the range 5.5-31.9 kA/m and M-s in the range 47.9-84.9 A.m(2)Kg(-1). At a grain size of similar to 54 +/- 2 nm (corresponding to 1073 K sintering temperature), multi-domain behavior sets in, which is indicated by a decrease in H-c. In addition, we observe an increase in lattice constant with respect to grain size, which is the inverse of what is expected of in ferrites. Our results suggest that oxygen deficiency plays a crucial role in explaining this inverse trend. We expect the method disclosed here to be a viable and scalable alternative to thermal decomposition based CoFe2O4 synthesis. The magnetic trends reported will aid in the optimization of functional CoFe2O4 nanoparticles

Using Relationships for Matching Textual Domain Models with Existing Code

We address the task of mapping a given textual domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has applications in improving the understandability of an existing application, migrating it to a more flexible architecture, or integrating it with other related applications. We use the vector-space model to abstractly represent domain model elements as well as source-code artifacts. The key novelty in our approach is to leverage the relationships between source-code artifacts in a principled way to improve the mapping process. We describe experiments wherein we apply our approach to the task of matching two real, open-source applications to corresponding industry-standard domain models. We demonstrate the overall usefulness of our approach, as well as the role of our propagation techniques in improving the precision and recall of the mapping task.

Multivalent Cu-Doped ZnO Nanoparticles with Full Solar Spectrum Absorbance and Enhanced Photoactivity

Full solar spectrum absorbers are widely pursued for applications related to photocatalysis and photovoltaics. Here we report multivalent Cu-doped ZnO nanoparticles which exhibit full solar spectrum absorbance and high photoactivity. Metathesis-based, green-chemical approaches with synthesis yield of similar to 100% are used. Cu incorporation in ZnO results in an increase of average solar spectrum absorbance from a mere 0.4% to 34%. On the other hand, (Zn, Cu)0 composites result in materials with up to 64% average solar spectrum absorbance. Doped systems operate well under both visible and UV illumination. The nanomaterials prepared are characterized by using X-ray powder diffraction (XRD), scanning electron microscopy (SEM), Brunauer-Emmett-Teller (BET) surface area analysis, and X-ray photoelectron spectroscopy (XPS). Photocatalysts explored have particle sizes >= 50 nm. This is deliberately done in order to avoid the nanotoxic size regime of ZnO. Despite the large particle size and low specific surface area (<20 m(2).g(-1)), the best catalyst reported here compare favorably with recent reports on ZnO based systems. Using X-photoelectron spectroscopy and synthesis property correlations, we infer that the presence of multivalent Cu (most likely in the form of Cu1+delta) on ZnO surface is responsible for the observed photoactivity enhancement.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Programming for parallel architectures that do not have a shared address space is extremely difficult due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and multiple GPUs, or a distributed-memory cluster are examples of such systems. Past works that try to automate data movement for distributed-memory architectures can lead to excessive redundant communication. In this paper, we propose an automatic data movement scheme that minimizes the volume of communication between compute devices in heterogeneous and distributed-memory systems. We show that by partitioning data dependences in a particular non-trivial way, one can generate data movement code that results in the minimum volume for a vast majority of cases. The techniques are applicable to any sequence of affine loop nests and works on top of any choice of loop transformations, parallelization, and computation placement. The data movement code generated minimizes the volume of communication for a particular configuration of these. We use a combination of powerful static analyses relying on the polyhedral compiler framework and lightweight runtime routines they generate, to build a source-to-source transformation tool that automatically generates communication code. We demonstrate that the tool is scalable and leads to substantial gains in efficiency. On a heterogeneous system, the communication volume is reduced by a factor of 11X to 83X over state-of-the-art, translating into a mean execution time speedup of 1.53X. On a distributed-memory cluster, our scheme reduces the communication volume by a factor of 1.4X to 63.5X over state-of-the-art, resulting in a mean speedup of 1.55X. In addition, our scheme yields a mean speedup of 2.19X over hand-optimized UPC codes.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.