On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Achieving the D-MG and DMD Tradeoffs of MIMO fading channels

An overview of our recent results relating to the explicit construction of space-time block codes achieving the DMG tradeoff of the quasi-static fading channel is presented. The results include the explicit construction of D-MG optimal codes,generalization of perfect codes to any number of transmit antennas as well as optimal diversity-multiplexing-delay constructions for the MIMO ARQ Channel.

Strength of lime-fly ash compacts using different curing techniques and gypsum additive

Lime-fly ash mixtures are exploited for the manufacture of fly ash bricks finding applications in load bearing masonry. Lime-pozzolana reactions take place at a slow pace under ambient temperature conditions and hence very long curing durations are required to achieve meaningful strength values. The present investigation examines the improvements in strength development in lime-fly ash compacts through low temperature steam curing and use of additives like gypsum. Results of density-strength-moulding water content relationships, influence of lime-fly ash ratio, steam curing and role of gypsum on strength development, and characteristics of compacted lime-fly ash-gypsum bricks have been discussed. The test results reveal that (a) strength increases with increase in density irrespective of lime content, type of curing and moulding water content, (b) optimum lime-fly ash ratio yielding maximum strength is about 0.75 in the normal curing conditions, (c) 24 h of steam curing (at 80A degrees C) is sufficient to achieve nearly possible maximum strength, (d) optimum gypsum content yielding maximum compressive strength is at 2%, (e) with gypsum additive it is possible to obtain lime-fly ash bricks or blocks having sufficient strength (> 10 MPa) at 28 days of normal wet burlap curing.

On network coding for acyclic networks with delays

Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer delays. Using enough memory at the nodes of an acyclic network with integer delays can effectively simulate instantaneous behavior, which is probably why only acyclic instantaneous networks have been primarily focused on thus far. However, nulling the effect of the network delays are not always uniformly advantageous, as we will show in this work. Essentially, we elaborate on issues ((a), (b) and (c) above) related to network coding for acyclic networks with integer delays, and show that using the delay network as is (without adding memory) turns out to be advantageous, disadvantageous or immaterial, depending on the topology of the network and the problem considered i.e., (a), (b) or (c).

Kannada WordNet - a lexical database

This paper presents the preliminary analysis of Kannada WordNet and the set of relevant computational tools. Although the design has been inspired by the famous English WordNet, and to certain extent, by the Hindi WordNet, the unique features of Kannada WordNet are graded antonyms and meronymy relationships, nominal as well as verbal compoundings, complex verb constructions and efficient underlying database design (designed to handle storage and display of Kannada unicode characters). Kannada WordNet would not only add to the sparse collection of machine-readable Kannada dictionaries, but also will give new insights into the Kannada vocabulary. It provides sufficient interface for applications involved in Kannada machine translation, spell checker and semantic analyser.

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs

The maximal rate of a nonsquare complex orthogonal design for transmit antennas is 1/2 + 1/n if is even and 1/2 + 1/n+1 if is odd and the codes have been constructed for all by Liang (2003) and Lu et al. (2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (2007) and it is observed that Liang's construction achieves the bound on delay for equal to 1 and 3 modulo 4 while Lu et al.'s construction achieves the bound for n = 0, 1, 3 mod 4. For n = 2 mod 4, Adams et al. (2010) have shown that the minimal decoding delay is twice the lower bound, in which case, both Liang's and Lu et al.'s construction achieve the minimum decoding delay. For large value of, it is observed that the rate is close to half and the decoding delay is very large. A class of rate-1/2 codes with low decoding delay for all has been constructed by Tarokh et al. (1999). In this paper, another class of rate-1/2 codes is constructed for all in which case the decoding delay is half the decoding delay of the rate-1/2 codes given by Tarokh et al. This is achieved by giving first a general construction of square real orthogonal designs which includes as special cases the well-known constructions of Adams, Lax, and Phillips and the construction of Geramita and Pullman, and then making use of it to obtain the desired rate-1/2 codes. For the case of nine transmit antennas, the proposed rate-1/2 code is shown to be of minimal delay. The proposed construction results in designs with zero entries which may have high peak-to-average power ratio and it is shown that by appropriate postmultiplication, a design with no zero entry can be obtained with no change in the code parameters.

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.