Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

An efficient web cache replacement policy

Several replacement policies for web caches have been proposed and studied extensively in the literature. Different replacement policies perform better in terms of (i) the number of objects found in the cache (cache hit), (ii) the network traffic avoided by fetching the referenced object from the cache, or (iii) the savings in response time. In this paper, we propose a simple and efficient replacement policy (hereafter known as SE) which improves all three performance measures. Trace-driven simulations were done to evaluate the performance of SE. We compare SE with two widely used and efficient replacement policies, namely Least Recently Used (LRU) and Least Unified Value (LUV) algorithms. Our results show that SE performs at least as well as, if not better than, both these replacement policies. Unlike various other replacement policies proposed in literature, our SE policy does not require parameter tuning or a-priori trace analysis and has an efficient and simple implementation that can be incorporated in any existing proxy server or web server with ease.

Mutagenicity associated with O6-methylguanine-DNA damage and mechanism of nucleotide flipping by AGT during repair

Methylated guanine damage at O6 position (i.e. O6MG) is dangerous due to its mutagenic and carcinogenic character that often gives rise to G:C-A:T mutation. However, the reason for this mutagenicity is not known precisely and has been a matter of controversy. Further, although it is known that O6-alkylguanine-DNA alkyltransferase (AGT) repairs O6MG paired with cytosine in DNA, the complete mechanism of target recognition and repair is not known completely. All these aspects of DNA damage and repair have been addressed here by employing high level density functional theory in gas phase and aqueous medium. It is found that the actual cause of O6MG mediated mutation may arise due to the fact that DNA polymerases incorporate thymine opposite to O6MG, misreading the resulting O6MG:T complex as an A:T base pair due to their analogous binding energies and structural alignments. It is further revealed that AGT mediated nucleotide flipping occurs in two successive steps. The intercalation of the finger residue Arg 128 into the DNA double helix and its interaction with the O6MG: C base pair followed by rotation of the O6MG nucleotide are found to be crucial for the damage recognition and nucleotide flipping.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Emulating Optimal Replacement with a Shepherd Cache

The inherent temporal locality in memory accesses is filtered out by the L1 cache. As a consequence, an L2 cache with LRU replacement incurs significantly higher misses than the optimal replacement policy (OPT). We propose to narrow this gap through a novel replacement strategy that mimics the replacement decisions of OPT. The L2 cache is logically divided into two components, a Shepherd Cache (SC) with a simple FIFO replacement and a Main Cache (MC) with an emulation of optimal replacement. The SC plays the dual role of caching lines and guiding the replacement decisions in MC. Our pro- posed organization can cover 40% of the gap between OPT and LRU for a 2MB cache resulting in 7% overall speedup. Comparison with the dynamic insertion policy, a victim buffer, a V-Way cache and an LRU based fully associative cache demonstrates that our scheme performs better than all these strategies.

Base excision and nucleotide excision repair pathways in mycobacteria

About a third of the human population is estimated to be infected with Mycobacterium tuberculosis. The bacterium displays an excellent adaptability to survive within the host macrophages. As the reactive environment of macrophages is capable of inducing DNA damage, the ability of the pathogen to safeguard its DNA against the damage is of paramount significance for its survival within the host. Analysis of the genome sequence has provided important insights into the DNA repair machinery of the pathogen, and the studies on DNA repair in mycobacteria have gained momentum in the past few years. The studies have revealed considerable differences in the mycobacterial DNA repair machinery when compared with those of the other bacteria. This review article focuses especially on the aspects of base excision, and nucleotide excision repair pathways in mycobacteria. (C) 2011 Elsevier Ltd. All rights reserved.

A new pentameric structure of rotavirus NSP4 revealed by molecular replacement

The region spanning residues 95-146 of the rotavirus nonstructural protein NSP4 from the asymptomatic human strain ST3 has been purified and crystallized and diffraction data have been collected to a resolution of 2.6 angstrom. Several attempts to solve the structure by the molecular-replacement method using the available tetrameric structures of this domain were unsuccessful despite a sequence identity of 73% to the already known structures. A more systematic approach with a dimer as the search model led to an unexpected pentameric structure using the program Phaser. The various steps involved in arriving at this molecular-replacement solution, which unravelled a case of subtle variation between different oligomeric states unknown at the time of solving the structure, are presented in this paper.

Injection-molded high-density polyethylene-hydroxyapatite-aluminum oxide hybrid composites for hard-tissue replacement: Mechanical, biological, and protein adsorption behavior

In this article, we report the mechanical and biocompatibility properties of injection-molded high-density polyethylene (HDPE) composites reinforced with 40 wt % ceramic filler [hydroxyapatite (HA) and/or Al2O3] and 2 wt % titanate as a coupling agent. The mechanical property measurements revealed that a combination of a maximum tensile strength of 18.7 MPa and a maximum tensile modulus of about 855 MPa could be achieved with the injection-molded HDPE20 wt % HA20 wt % Al2O3 composites. For the same composite composition, the maximum compression strength was determined to be 71.6 MPa and the compression modulus was about 660 MPa. The fractrography study revealed the uniform distribution of ceramic fillers in the semicrystalline HDPE matrix. The cytocompatibility study with osteoblast-like SaOS2 cells confirmed extensive cell adhesion and proliferation on the injection-molded HDPE20 wt % HA20 wt % Al2O3 composites. The cell viability analysis with the 3(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide assay revealed a statistically significant difference between the injection-molded HDPE20 wt % HA20 wt % Al2O3 composites and sintered HA for various culture durations of upto 7 days. The difference in cytocompatibility properties among the biocomposites is explained in terms of the difference in the protein absorption behavior. (C) 2011 Wiley Periodicals, Inc. J Appl Polym Sci, 2012

Distinct Roles of FANCO/RAD51C Protein in DNA Damage Signaling and Repair Implications for Fanconi Anemia and Breast Cancer Susceptibility

RAD51C, a RAD51 paralog, has been implicated in homologous recombination (HR), and germ line mutations in RAD51C are known to cause Fanconi anemia (FA)-like disorder and breast and ovarian cancers. The role of RAD51C in the FA pathway of DNA interstrand cross-link (ICL) repair and as a tumor suppressor is obscure. Here, we report that RAD51C deficiency leads to ICL sensitivity, chromatid-type errors, and G(2)/M accumulation, which are hallmarks of the FA phenotype. We find that RAD51C is dispensable for ICL unhooking and FANCD2 monoubiquitination but is essential for HR, confirming the downstream role of RAD51C in ICL repair. Furthermore, we demonstrate that RAD51C plays a vital role in the HR-mediated repair of DNA lesions associated with replication. Finally, we show that RAD51C participates in ICL and double strand break-induced DNA damage signaling and controls intra-S-phase checkpoint through CHK2 activation. Our analyses with pathological mutants of RAD51C that were identified in FA and breast and ovarian cancers reveal that RAD51C regulates HR and DNA damage signaling distinctly. Together, these results unravel the critical role of RAD51C in the FA pathway of ICL repair and as a tumor suppressor.

3D finite element modelling of a composite patch repair

Composite-patching on cracked/weak metallic aircraft structures improves structural integrity. A Boron Epoxy patch employed to repair a cracked Aluminum sheet is modeled employing 3D Finite Element Method (FEM). SIFs extracted using ''displacement extrapolation'' are used to measure the repair effectiveness. Two issues viz., patch taper and symmetry have been looked into.

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.