A simple and fast scheme for code compression for VLIW processors

Summary form only given. A scheme for code compression that has a fast decompression algorithm, which can be implemented using simple hardware, is proposed. The effectiveness of the scheme on the TMS320C62x architecture that includes the overheads of a line address table (LAT) is evaluated and obtained compression rates ranging from 70% to 80%. Two schemes for decompression are proposed. The basic idea underlying the scheme is a simple clustering algorithm that partially maps a block of instructions into a set of clusters. The clustering algorithm is a greedy algorithm based on the frequency of occurrence of various instructions.

Designed Cyclic Permutants of HIV-1 gp120: Implications for Envelope Trimer Structure and Immunogen Design

Most HIV-1 broadly neutralizing antibodies are directed against the gp120 subunit of the env surface protein. Native env consists of a trimer of gp120-gp41 heterodimers, and in contrast to monomeric gp120, preferentially binds CD4 binding site (CD4bs)-directed neutralizing antibodies over non-neutralizing ones. Some cryo-electron tomography studies have suggested that the V1V2 loop regions of gp120 are located close to the trimer interface. We have therefore designed cyclically permuted variants of gp120 with and without the h-CMP and SUMO2a trimerization domains inserted into the V1V2 loop. h-CMP-V1cyc is one such variant in which residues 153 and 142 are the N- and C-terminal residues, respectively, of cyclically permuted gp120 and h-CMP is fused to the N-terminus. This molecule forms a trimer under native conditions and binds CD4 and the neutralizing CD4bs antibodies b12 with significantly higher affinity than wild-type gp120. It binds non-neutralizing CD4bs antibody F105 with lower affinity than gp120. A similar derivative, h-CMP-V1cycl, bound the V1V2 loop-directed broadly neutralizing antibodies PG9 and PG16 with similar to 20-fold higher affinity than wild-type JRCSF gp120. These cyclic permutants of gp120 are properly folded and are potential immunogens. The data also support env models in which the V1V2 loops are proximal to the trimer interface.

Thermal Management of Electronics Using PCM-Based Heat Sink Subjected to Cyclic Heat Load

Designing a heat sink based on a phase change material (PCM) under cyclic loading is a critical issue. For cyclic operation, it is required that the fraction of the PCM melting during the heating cycle should completely resolidify during the cooling period, so that that thermal storage unit can be operated for an unlimited number of cycles. Accordingly, studies are carried out to find the parameters influencing the behavior of a PCM under cyclic loading. A number of parameters are identified in the process, the most important ones being the duty cycle and heat transfer coefficient (h) for cooling. The required h or the required cooling period for complete resolidification for infinite cyclic operation of a conventional PCM-based heat sink is found to be very high and unrealistic with air cooling from the surface. To overcome this problem, the conventional design is modified where h and the area exposed to heat transfer can be independently controlled. With this arrangement, the enhanced area provided for cooling keeps h within realistic limits. Analytical investigation is carried out to evaluate the thermal performance of this modified PCM-based heat sink in comparison to those with conventional designs. Experiments are also performed on both the conventional and the modified PCM-based heat sinks to validate the new findings.

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.

A MATLAB Code for Three Dimensional Linear Elastostatics using Constant Boundary Elements

Present work presents a code written in the very simple programming language MATLAB, for three dimensional linear elastostatics, using constant boundary elements. The code, in full or in part, is not a translation or a copy of any of the existing codes. Present paper explains how the code is written, and lists all the formulae used. Code is verified by using the code to solve a simple problem which has the well known approximate analytical solution. Of course, present work does not make any contribution to research on boundary elements, in terms of theory. But the work is justified by the fact that, to the best of author’s knowledge, as of now, one cannot find an open access MATLAB code for three dimensional linear elastostatics using constant boundary elements. Author hopes this paper to be of help to beginners who wish to understand how a simple but complete boundary element code works, so that they can build upon and modify the present open access code to solve complex engineering problems quickly and easily. The code is available online for open access (as supplementary file for the present paper), and may be downloaded from the website for the present journal.

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.

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.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Verification of Masonry Building Code to Flexural Behavior of Cement-Stabilized Soil Block

Most studies involving cement-stabilized soil blocks (CSSB) concern material properties, such as the characteristics of erosion and strength and how the composition of the block affects these properties. Moreover, research has been conducted on the performance of various mortars, investigating their material properties and the tensile bond strength between CSSB units and mortar. In contrast, very little is currently known about CSSB masonry structural behavior. Because structural design codes of traditional masonry buildings were well developed over the past century, many of the same principles may be applicable to CSSB masonry buildings. This paper details the topic of flexural behavior of CSSB masonry walls and whether the Masonry Standards Joint Committee (MSJC) code can be applied to this material for improved safety of such buildings. DOI: 10.1061/(ASCE)MT.1943-5533.0000566. (C) 2013 American Society of Civil Engineers.

A cyclic peptide mimic of an RNA recognition motif of human La protein is a potent inhibitor of hepatitis C virus

Due to limited available therapeutic options, developing new lead compounds against hepatitis C virus is an urgent need. Human La protein stimulates hepatitis C virus translation through interaction with the hepatitis C viral RNA. A cyclic peptide mimicking the beta-turn of the human La protein that interacts with the viral RNA was synthesized. It inhibits hepatitis C viral RNA translation significantly better than the corresponding linear peptide at longer post-treatment times. The cyclic peptide also inhibited replication as measured by replicon RNA levels using real time RT-PCR. The cyclic peptide emerges as a promising lead compound against hepatitis C.