Characterization of a dual-active enzyme, DcpA, involved in cyclic diguanosine monophosphate turnover in Mycobacterium smegmatis

We have reported previously that the long-term survival of Mycobacterium smegmatis is facilitated by a dual-active enzyme MSDGC-1 (renamed DcpA), which controls the cellular turnover of cyclic diguanosine monophosphate (c-di-GMP). Most mycobacterial species possess at least a single copy of a DcpA orthologue that is highly conserved in terms of sequence similarity and domain architecture. Here, we show that DcpA exists in monomeric and dimeric forms. The dimerization of DcpA is due to non-covalent interactions between two protomers that are arranged in a parallel orientation. The dimer shows both synthesis and hydrolysis activities, whereas the monomer shows only hydrolysis activity. In addition, we have shown that DcpA is associated with the cytoplasmic membrane and exhibits heterogeneous cellular localization with a predominance at the cell poles. Finally, we have also shown that DcpA is involved in the change in cell length and colony morphology of M. smegmatis. Taken together, our study provides additional evidence about the role of the bifunctional protein involved in c-di-GMP signalling in M. smegmatis.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Boundary Tracking using a Hybrid Cyclic Pursuit Scheme

There has been a lot of work in the literature, related to the mapping of boundaries of regions, using multiple agents. Most of these are based on optimization techniques or rely on potential fields to drive the agents towards the boundary and then retain them there while they space out evenly along the perimeter or surface (in two-dimensional and three-dimensional cases, respectively). In this paper an algorithm to track the boundary of a region in space is provided based on the cyclic pursuit scheme. This enables the agents to constantly move along the perimeter in a cluster, thereby tracking a dynamically changing boundary. The trajectories of the agents provide a sketch of the boundary. The use of multiple agents may facilitate minimization of tracking error by providing accurate estimates of points on the boundary, besides providing redundancy. Simulation results are provided to highlight the performance of the proposed scheme.

Effects of temperature and clay content on water absorption characteristics of modified MMT clay/cyclic olefin copolymer nanocomposite films: Permeability, dynamic mechanical properties and the encapsulated organic device performance

In the present study, amino-silane modified layered organosilicates were used to reinforce cyclic olefin copolymer to enhance the thermal, mechanical and moisture impermeable barrier properties. The optimum clay loading (4%) in the nanocomposite increases the thermal stability of the film while further loading decreases film stability. Water absorption behavior at 62 degrees C was carried out and compared with the behavior at room temperature and 48 degrees C. The stiffness of the matrix increases with clay content and the recorded strain to failure for the composite films was lower than the neat film. Dynamic mechanical analysis show higher storage modulus and low loss modulus for 2.5-4 wt% clay loading. Calcium degradation test and device encapsulation also show the evidence of optimum clay loading of 4 wt% for improved low water vapor transmission rates compared to other nanocomposite films. (C) 2014 Elsevier Ltd. All rights reserved.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Performance Analysis of Heat Sinks With Phase-Change Materials Subjected to Transient and Cyclic Heating

Phase-change cooling technique is a suitable method for thermal management of electronic equipment subjected to transient or cyclic heat loads. The thermal performance of a phase-change based heat sink under cyclic heat load depends on several design parameters, namely, applied heat flux, cooling heat transfer coefficient, thermophysical properties of phase-change materials (PCMs), and physical dimensions of phase-change storage system during melting and freezing processes. A one-dimensional conduction heat transfer model is formulated to evaluate the effectiveness of preliminary design of practical PCM-based energy storage units. In this model, the phase-change process of the PCM is divided into melting and solidification subprocesses, for which separate equations are written. The equations are solved sequentially and an explicit closed-form solution is obtained. The efficacy of analytical model is estimated by comparing with a finite-volume-based numerical solution for both transient and cyclic heat loads.

Novel Functions of (p)ppGpp and Cyclic di-GMP in Mycobacterial Physiology Revealed by Phenotype Microarray Analysis of Wild-Type and Isogenic Strains of Mycobacterium smegmatis

The bacterial second messengers (p)ppGpp and bis-(3'-5')-cyclic dimeric GMP (c-di-GMP) regulate important functions, such as transcription, virulence, biofilm formation, and quorum sensing. In mycobacteria, they regulate long-term survival during starvation, pathogenicity, and dormancy. Recently, a Pseudomonas aeruginosa strain lacking (p) ppGpp was shown to be sensitive to multiple classes of antibiotics and defective in biofilm formation. We were interested to find out whether Mycobacterium smegmatis strains lacking the gene for either (p)ppGpp synthesis (Delta rel(Msm)) or c-di-GMP synthesis (Delta dcpA) would display similar phenotypes. We used phenotype microarray technology to compare the growth of the wild-type and the knockout strains in the presence of several antibiotics. Surprisingly, the Delta rel(Msm) and Delta dcpA strains showed enhanced survival in the presence of many antibiotics, but they were defective in biofilm formation. These strains also displayed altered surface properties, like impaired sliding motility, rough colony morphology, and increased aggregation in liquid cultures. Biofilm formation and surface properties are associated with the presence of glycopeptidolipids (GPLs) in the cell walls of M. smegmatis. Thin-layer chromatography analysis of various cell wall fractions revealed that the levels of GPLs and polar lipids were reduced in the knockout strains. As a result, the cell walls of the knockout strains were significantly more hydrophobic than those of the wild type and the complemented strains. We hypothesize that reduced levels of GPLs and polar lipids may contribute to the antibiotic resistance shown by the knockout strains. Altogether, our data suggest that (p)ppGpp and c-di-GMP may be involved in the metabolism of glycopeptidolipids and polar lipids in M. smegmatis.

Cyclic nucleotide binding and structural changes in the isolated GAF domain of Anabaena adenylyl cyclase, CyaB2

GAF domains are a large family of regulatory domains, and a subset are found associated with enzymes involved in cyclic nucleotide (cNMP) metabolism such as adenylyl cyclases and phosphodiesterases. CyaB2, an adenylyl cyclase from Anabaena, contains two GAF domains in tandem at the N-terminus and an adenylyl cyclase domain at the C-terminus. Cyclic AMP, but not cGMP, binding to the GAF domains of CyaB2 increases the activity of the cyclase domain leading to enhanced synthesis of cAMP. Here we show that the isolated GAFb domain of CyaB2 can bind both cAMP and cGMP, and enhanced specificity for cAMP is observed only when both the GAFa and the GAFb domains are present in tandem(GAFab domain). In silico docking and mutational analysis identified distinct residues important for interaction with either cAMP or cGMP in the GAFb domain. Structural changes associated with ligand binding to the GAF domains could not be detected by bioluminescence resonance energy transfer (BRET) experiments. However, amide hydrogen-deuterium exchange mass spectrometry (HDXMS) experiments provided insights into the structural basis for cAMP-induced allosteric regulation of the GAF domains, and differences in the changes induced by cAMP and cGMP binding to the GAF domain. Thus, our findings could allow the development of molecules that modulate the allosteric regulation by GAF domains present in pharmacologically relevant proteins.

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4 `)biphenylophane and first preparation of a microporous polymer network from a macrocyclic precursor by cyclotrimerization

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4') biphenylophane (MC) was achieved in high yield; its structure was verified by single crystal X-ray analysis. As a first example, a microporous polymer network was formed from macrocycle MC via acid-catalysed cyclotrimerization yielding a BET surface area of ca. 570 m(2) g(-1).

Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels

In this paper, we consider spatial modulation (SM) operating in a frequency-selective single-carrier (SC) communication scenario and propose zero-padding instead of the cyclic-prefix considered in the existing literature. We show that the zero-padded single-carrier (ZP-SC) SM system offers full multipath diversity under maximum-likelihood (ML) detection, unlike the cyclic-prefix based SM system. Furthermore, we show that the order of ML detection complexity in our proposed ZP-SC SM system is independent of the frame length and depends only on the number of multipath links between the transmitter and the receiver. Thus, we show that the zero-padding applied in the SC SM system has two advantages over the cyclic prefix: 1) achieves full multipath diversity, and 2) imposes a relatively low ML detection complexity. Furthermore, we extend the partial interference cancellation receiver (PIC-R) proposed by Guo and Xia for the detection of space-time block codes (STBCs) in order to convert the ZP-SC system into a set of narrowband subsystems experiencing flat-fading. We show that full rank STBC transmissions over these subsystems achieves full transmit, receive as well as multipath diversity for the PIC-R. Furthermore, we show that the ZP-SC SM system achieves receive and multipath diversity for the PIC-R at a detection complexity order which is the same as that of the SM system in flat-fading scenario. Our simulation results demonstrate that the symbol error ratio performance of the proposed linear receiver for the ZP-SC SM system is significantly better than that of the SM in cyclic prefix based orthogonal frequency division multiplexing as well as of the SM in the cyclic-prefixed and zero-padded single carrier systems relying on zero-forcing/minimum mean-squared error equalizer based receivers.