An Exported Heat Shock Protein 40 Associates with Pathogenesis-Related Knobs in Plasmodium falciparum Infected Erythrocytes

Cell surface structures termed knobs are one of the most important pathogenesis related protein complexes deployed by the malaria parasite Plasmodium falciparum at the surface of the infected erythrocyte. Despite their relevance to the disease, their structure, mechanisms of traffic and their process of assembly remain poorly understood. In this study, we have explored the possible role of a parasite-encoded Hsp40 class of chaperone, namely PFB0090c/PF3D7_0201800 (KAHsp40) in protein trafficking in the infected erythrocyte. We found the gene coding for PF3D7_0201800 to be located in a chromosomal cluster together with knob components KAHRP and PfEMP3. Like the knob components, KAHsp40 too showed the presence of PEXEL motif required for transport to the erythrocyte compartment. Indeed, sub-cellular fractionation and immunofluorescence analysis (IFA) showed KAHsp40 to be exported in the erythrocyte cytoplasm in a stage dependent manner localizing as punctuate spots in the erythrocyte periphery, distinctly from Maurer's cleft, in structures which could be the reminiscent of knobs. Double IFA analysis revealed co-localization of PF3D7_0201800 with the markers of knobs (KAHRP, PfEMP1 and PfEMP3) and components of the PEXEL translocon (Hsp101, PTEX150). KAHsp40 was also found to be in a complex with KAHRP, PfEMP3 and Hsp101 as confirmed by co-immunoprecipitation assay. Our results suggest potential involvement of a parasite encoded Hsp40 in chaperoning knob assembly in the erythrocyte compartment.

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.

Field extension code based dispersion matrices for coherently detected space-time shift keying

Motivated by the recent Coherent Space-Time Shift Keying (CSTSK) philosophy, we construct new dispersion matrices for rotationally invariant PSK signaling sets. Given a specific PSK signal constellation, the dispersion matrices of the existing CSTSK scheme were chosen by maximizing the mutual information over randomly generated sets of dispersion matrices. In this contribution we propose a general method for constructing a set of structured dispersion matrices for arbitrary PSK signaling sets using Field Extension (FE) codes and then study the attainable Symbol Error Rate (SER) performance of some example constructions. We demonstrate that the proposed dispersion scheme is capable of outperforming the existing dispersion arrangement at medium to high SNRs.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

A multi-sheeted three-dimensional potential-energy surface for the H-atom photodissociation of phenol

Extending the previous work of Lan et al. J. Chem. Phys., 122, 224315 (2005)], a multi-state potential model for the H atom photodissociation is presented. All three ``disappearing coordinates'' of the departing H atom have been considered. Ab initio CASSCF computations have been carried out for the linear COH geometry of C-2v symmetry, and for several COH angles with the OH group in the ring plane and also perpendicular to the ring plane. By keeping the C6H5O fragment frozen in a C-2v-constrained geometry throughout, we have been able to apply symmetry-based simplifications in the constructions of a diabatic model. This model is able to capture the overall trends of twelve adiabats at both torsional limits for a wide range of COH bend angles.

Maltose Binding Protein Is Partially Structured in Its Molten Globule State

Seven double cysteine mutants of maltose binding protein (MBP) were generated with one each in the active cleft at position 298 and the second cysteine distributed over both domains of the protein. These cysteines were spin labeled and distances between the labels in biradical pairs determined by pulsed double electron-electron resonance (DEER) measurements. The values were compared with theoretical predictions of distances between the labels in biradicals constructed by molecular modeling from the crystal structure of MBP without maltose and were found to be in excellent agreement. MBP is in a molten globule state at pH 3.3 and is known to still bind its substrate maltose. The nitroxide spin label was sufficiently stable under these conditions. In preliminary experiments, DEER measurements were carried out with one of the mutants yielding a broad distance distribution as was to be expected if there is no explicit tertiary structure and the individual helices pointing into all possible directions.

Mechanistic Insights into the Neutralization of Cytotoxic Abrin by the Monoclonal Antibody D6F10

Abrin, an A/B toxin obtained from the Abrus precatorius plant is extremely toxic and a potential bio-warfare agent. Till date there is no antidote or vaccine available against this toxin. The only known neutralizing monoclonal antibody against abrin, namely D6F10, has been shown to rescue the toxicity of abrin in cells as well as in mice. The present study focuses on mapping the epitopic region to understand the mechanism of neutralization of abrin by the antibody D6F10. Truncation and mutational analysis of abrin A chain revealed that the amino acids 74-123 of abrin A chain contain the core epitope and the residues Thr112, Gly114 and Arg118 are crucial for binding of the antibody. In silico analysis of the position of the mapped epitope indicated that it is present close to the active site cleft of abrin A chain. Thus, binding of the antibody near the active site blocks the enzymatic activity of abrin A chain, thereby rescuing inhibition of protein synthesis by the toxin in vitro. At 1: 10 molar concentration of abrin: antibody, the antibody D6F10 rescued cells from abrin-mediated inhibition of protein synthesis but did not prevent cell attachment of abrin. Further, internalization of the antibody bound to abrin was observed in cells by confocal microscopy. This is a novel finding which suggests that the antibody might function intracellularly and possibly explains the rescue of abrin's toxicity by the antibody in whole cells and animals. To our knowledge, this study is the first report on a neutralizing epitope for abrin and provides mechanistic insights into the poorly understood mode of action of anti-A chain antibodies against several toxins including ricin.

Compositional hierarchical monitoring automaton construction for LTL

In this paper we give a compositional (or inductive) construction of monitoring automata for LTL formulas. Our construction is similar in spirit to the compositional construction of Kesten and Pnueli [5]. We introduce the notion of hierarchical Büchi automata and phrase our constructions in the framework of these automata. We give detailed constructions for all the principal LTL operators including past operators, along with proofs of correctness of the constructions.

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.

Burst error correction using partial fourier matrices and block sparse representation

There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.

Jamming to foil an eavesdropper

We consider key-less secure communication against a passive adversary, by allowing the legitimate receiver to selectively jam transmitted bits. The channel between the transmitter and legitimate receiver is assumed to be half-duplex (i.e., one cannot jam and receive simultaneously), while the only degradation seen by the eavesdropper is due to jamming done by the legitimate receiver. However, jamming must be done without knowledge of the transmitted sequence, and the transmitted sequence must be recovered exactly by the receiver from the unjammed bits alone. We study the resulting coding problem in this setup, both under complete equivocation (CE) and partial equivocation (PE) of the eavesdropper. For (CE), we give explicit code-constructions that achieve the maximum transmission rate, while for (PE) we compute upper and lower bounds on the maximum possible transmission rate.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Regenerating codes: A reformulated storage-bandwidth trade-off and a new construction

In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.

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.

A FUNCTIONAL MODEL FOR PURE Gamma-CONTRACTIONS

A pair of commuting operators (S,P) defined on a Hilbert space H for which the closed symmetrized bidisc Gamma = {(z(1) + z(2), z(1)z(2)) : vertical bar z(1)vertical bar <= 1, vertical bar z(2)vertical bar <= 1} subset of C-2 is a spectral set is called a Gamma-contraction in the literature. A Gamma-contraction (S, P) is said to be pure if P is a pure contraction, i.e., P*(n) -> 0 strongly as n -> infinity Here we construct a functional model and produce a set of unitary invariants for a pure Gamma-contraction. The key ingredient in these constructions is an operator, which is the unique solution of the operator equation S - S*P = DpXDp, where X is an element of B(D-p), and is called the fundamental operator of the Gamma-contraction (S, P). We also discuss some important properties of the fundamental operator.