Spontaneous self-assembly of designed cyclic dipeptide (Phg-Phg) into two-dimensional nano- and mesosheets

In this study, we present the spontaneous self-assembly of designed simplest aromatic cyclic dipeptides of (L-Phg-L-Phg) and (D-Phg-L-Phg) to form highly stable two-dimensional (2D) nano- and mesosheets with large lateral surface area. Various microscopy data revealed that the morphology of 2D mesosheets resembles the hierarchical natural materials with layered structure. Solution and solid-state NMR studies on cyclo(L-Phg-L-Phg) revealed the presence of strong (N-H-O) hydrogen-bonded molecular chains supported by aromatic pi-pi interactions to form 2D mesosheets. Interestingly, cyclo(D-Phg-L-Phg) self-assembles to form single-crystalline as well as non-crystalline 2D rhomboid sheets with large lateral dimension. X-ray diffraction analysis revealed the stacking of (N-H-O) hydrogen-bonded molecular layers along c-axis supported by aromatic pi-pi interactions. The thermogravimetric analysis shows two transitions with overall high thermal stability attributed to layered hierarchy found in 2D mesosheets.

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.

Evaluation of damage in reinforced concrete bridge beams using acoustic emission technique

Acoustic emission (AE) testing is a well-known method for damage identification of various concrete structures including bridges. This article presents a method to assess damage in reinforced concrete (RC) bridge beams subjected to incremental cyclic loading. The specifications in the standard NDIS-2421 were used to classify the damage in RC bridge beams. Earlier researchers classified the damage occurring in bridge beams by using crack mouth opening displacement (CMOD) and AE released and proposed a standard (NDIS-2421: the Japanese Society for NonDestructive Inspection). In general, multiple cracks take place in RC beams under bending; therefore, utilisation of CMOD for crack detection may not be appropriate. In the present study, the damage in RC beams is classified by using the AE released, deflection, strains in steel and concrete, because the measurement of the strains in steel and concrete is easy and the codes of practice are specified for different limit states (IS-456:2000). The observations made in the present experimental study have some important practical applications in assessing the state of damage of concrete structural members.

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.

Synthesis and Characterization of a Fluorescent Analogue of Cyclic di-GMP

Cyclic di-GMP (c-di-GMP), a ubiquitous bacterial second messenger, has emerged as a key controller of several biological processes. Numbers of reports that deal with the mechanistic aspects of this second messenger have appeared in the literature. However, the lack of a reporter tag attached to the c-di-GMP at times limits the understanding of further details. In this study, we have chemically coupled N-methylisatoic anhydride (MANT) with c-di-GMP, giving rise to Mant-(c-di-GMP) or MANT-CDG. We have characterized the chemical and physical properties and spectral behavior of MANT-CDG. The fluorescence of MANT-CDG is sensitive to changes in the microenvironment, which helped us study its interaction with three different c-di-GMP binding proteins (a diguanylate cyclase, a phosphodiesterase, and a PilZ domain-containing protein). In addition, we have shown here that MANT-CDG can inhibit diguanylate cyclase activity; however, it is hydrolyzed by c-di-GMP specific phosphodiesterase. Taken together, our data suggest that MANT-CDG behaves like native c-di-GMP, and this study raises the possibility that MANT-CDG will be a valuable research tool for the in vitro characterization of c-di-GMP signaling factors.

Cyclic AMP-induced Conformational Changes in Mycobacterial Protein Acetyltransferases

The activities of a number of proteins are regulated by the binding of cAMP and cGMP to cyclic nucleotide binding (CNB) domains that are found associated with one or more effector domains with diverse functions. Although the conserved architecture of CNB domains has been extensively studied by x-ray crystallography, the key to unraveling the mechanisms of cAMP action has been protein dynamics analyses. Recently, we have identified a novel cAMP-binding protein from mycobacteria, where cAMP regulates the activity of an associated protein acetyltransferase domain. In the current study, we have monitored the conformational changes that occur upon cAMP binding to the CNB domain in these proteins, using a combination of bioluminescence resonance energy transfer and amide hydrogen/deuterium exchange mass spectrometry. Coupled with mutational analyses, our studies reveal the critical role of the linker region (positioned between the CNB domain and the acetyltransferase domain) in allosteric coupling of cAMP binding to activation of acetyltransferase catalysis. Importantly, major differences in conformational change upon cAMP binding were accompanied by stabilization of the CNB and linker domain alone. This is in contrast to other cAMP-binding proteins, where cyclic nucleotide binding has been shown to involve intricate and parallel allosteric relays. Finally, this powerful convergence of results from bioluminescence resonance energy transfer and hydrogen/deuterium exchange mass spectrometry reaffirms the power of solution biophysical tools in unraveling mechanistic bases of regulation of proteins in the absence of high resolution structural information.

Damage limit states of reinforced concrete beams subjected to incremental cyclic loading using relaxation ratio analysis of AE parameters

This paper presents an experimental study on damage assessment of reinforced concrete (RC) beams subjected to incremental cyclic loading. During testing acoustic emissions (AEs) were recorded. The analysis of the AE released was carried out by using parameters relaxation ratio, load ratio and calm ratio. Digital image correlation (DIC) technique and tracking with available MATLAB program were used to measure the displacement and surface strains in concrete. Earlier researchers classified the damage in RC beams using Kaiser effect, crack mouth opening displacement and proposed a standard. In general (or in practical situations), multiple cracks occur in reinforced concrete beams. In the present study damage assessment in RC beams was studied according to different limit states specified by the code of practice IS-456:2000 and AE technique. Based on the two ratios namely load ratio and calm ratio and when the deflection reached approximately 85% of the maximum allowable deflection it was observed that the RC beams were heavily damaged. The combination of AE and DIC techniques has the potential to provide the state of damage in RC structures.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

EXIT Chart Based Design of Irregular LDPC Codes for Large-MIMO Systems

In this letter, we characterize the extrinsic information transfer (EXIT) behavior of a factor graph based message passing algorithm for detection in large multiple-input multiple-output (MIMO) systems with tens to hundreds of antennas. The EXIT curves of a joint detection-decoding receiver are obtained for low density parity check (LDPC) codes of given degree distributions. From the obtained EXIT curves, an optimization of the LDPC code degree profiles is carried out to design irregular LDPC codes matched to the large-MIMO channel and joint message passing receiver. With low complexity joint detection-decoding, these codes are shown to perform better than off-the-shelf irregular codes in the literature by about 1 to 1.5 dB at a coded BER of 10(-5) in 16 x 16, 64 x 64 and 256 x 256 MIMO systems.

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.

W/T SPR codes offer higher throughput in OCDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. Two types of random access protocols are proposed for packet transmission. In protocol 1, all distinct codes and in protocol 2, distinct codes as well as shifted versions of all these codes are used. O-CDMA network performance using optical orthogonal codes (OOCs) 1-D and two-dimensional (2-D) wavelength/time single-pulse-per-row (W/T SPR) codes are analyzed. The main advantage of using 2-D codes instead of one-dimensional (1-D) codes is to reduce the errors due to multiple access interference among different users. SPR codes are chosen as they have nearly ideal correlation properties. In this paper, correlation receiver is considered in the analysis. Using analytical model, we compare the OOC and SPR code performances in O-CDMA networks. We compute packet-success probability and throughput for both the types of codes. The analysis shows improved performance with SPR codes as compared to OOC codes.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.