Temperature and thiol-induced desensitization of a Ca2+-sensitive cyclic-3',5'-nucleotide phosphodiesterase from sheep lung

Ca2+-sensitivity of sheep lung cyclic-3',5'-nucleotide phosphodiesterase is provided by endogenous tightly bound calmodulin. The calcium sensitivity of a highly purified enzyme was desensitized by increasing the assay temperature. It could also be desensitized to Ca2+-activation by thiols such as dithiothreitol. The thiol-induced desensitization could be partially reversed by dialysis and almost completely reversed by dilution. The results presented in this paper indicate that thiols are possibly involved in the interaction of calmodulin with cyclic-3',5'-nucleotide phosphodiesterase. This is the first report on temperature and thiol-induced desensitization of Ca2+-sensitivity of a cyclic-3',5'-nucleotide phosphodiesterase.

Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Stress-strain characteristics of Tress-strain characteristics of reinforcing steel bars under cyclic loading

This paper presents test results for 22 high strength deformed bars and nine mild steel bars subjected to monotonic repeated and reversed axial loading to determine the stress-strain behavior. Equations have been proposed for the stress-strain curves and have been compared with test results. Satisfactory agreement was obtained.

Stress-Strain Characteristics of Reinforcing Steel Bars Under Cyclic Loading

This paper presents test results for 22 high strength deformed bars and nine mild steel bars subjected to monotonic repeated and reversed axial loading to determine the stress-strain behavior. Equations have been proposed for the stress-strain curves and have been compared with test results. Satisfactory agreement was obtained.

Structure of a cyclic water tetramer in a nucleotide crystal host and a hypothetical model for water cluster growth

Structure of a cyclic water tetramer in channels (pores) formed by self-assembly of N6-methyl-5'-AMP center dot Na-2 molecules is described and a hypothetical model is proposed for growth of water clusters. (C) 2010 Elsevier B.V. All rights reserved.

Stereochemical studies on cyclic peptides. Part XI. Conformation of cyclic pentapeptides having intramolecular 3 leads to 1 hydrogen bonds.

Conformational analysis of cyclic pentapeptides having two intra-ring 3 leads to 1 hydrogen bonds has been carried out. It is found that the structure can easily be formed with trans planar peptide units without causing significant angular strain at the alpha-carbon atoms. Four different types of conformations designated Types I--IV are possible for the backbone structure. Details of these four types of conformations and also the accommodating possibility of these types for allglycyl and all-alanyl residues are presented. Three of the four types have relatively low energies for glycyl residues whereas the other one has a slightly higher energy. When alanyl residues are introduced at the five alpha-carbon atoms, the types that are energetically favourable depend upon the sequence of isomers. Energy calculations have also been carried out for the combinations of glycyl, L- and D-alanyl residues. The theoretical results are compared with available experimental observations both from solution and solid state studies.

Control of Agent Swarms using Generalized Centroidal Cyclic Pursuit Laws

One of the major tasks in swarm intelligence is to design decentralized but homogenoeus strategies to enable controlling the behaviour of swarms of agents. It has been shown in the literature that the point of convergence and motion of a swarm of autonomous mobile agents can be controlled by using cyclic pursuit laws. In cyclic pursuit, there exists a predefined cyclic connection between agents and each agent pursues the next agent in the cycle. In this paper we generalize this idea to a case where an agent pursues a point which is the weighted average of the positions of the remaining agents. This point correspond to a particular pursuit sequence. Using this concept of centroidal cyclic pursuit, the behavior of the agents is analyzed such that, by suitably selecting the agents' gain, the rendezvous point of the agents can be controlled, directed linear motion of the agents can be achieved, and the trajectories of the agents can be changed by switching between the pursuit sequences keeping some of the behaviors of the agents invariant. Simulation experiments are given to support the analytical proofs.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Distinct Allostery Induced in the Cyclic GMP-binding, Cyclic GMP-specific Phosphodiesterase (PDE5) by Cyclic GMP, Sildenafil, and Metal Ions

The activity of many proteins orchestrating different biological processes is regulated by allostery, where ligand binding at one site alters the function of another site. Allosteric changes can be brought about by either a change in the dynamics of a protein, or alteration in its mean structure. We have investigated the mechanisms of allostery induced by chemically distinct ligands in the cGMP-binding, cGMP-specific phosphodiesterase, PDE5. PDE5 is the target for catalytic site inhibitors, such as sildenafil, that are used for the treatment of erectile dysfunction and pulmonary hypertension. PDE5 is a multidomain protein and contains two N-terminal cGMP-specific phosphodiesterase, bacterial adenylyl cyclase, FhLA transcriptional regulator (GAF) domains, and a C-terminal catalytic domain. Cyclic GMP binding to the GAFa domain and sildenafil binding to the catalytic domain result in conformational changes, which to date have been studied either with individual domains or with purified enzyme. Employing intramolecular bioluminescence resonance energy transfer, which can monitor conformational changes both in vitro and in intact cells, we show that binding of cGMP and sildenafil to PDE5 results in distinct conformations of the protein. Metal ions bound to the catalytic site also allosterically modulated cGMP- and sildenafil-induced conformational changes. The sildenafil-induced conformational change was temperature-sensitive, whereas cGMP-induced conformational change was independent of temperature. This indicates that different allosteric ligands can regulate the conformation of a multidomain protein by distinct mechanisms. Importantly, this novel PDE5 sensor has general physiological and clinical relevance because it allows the identification of regulators that can modulate PDE5 conformation in vivo.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 <= p(e) < 0.5). We obtain bounds on the performance of such CNECCs based on a modified generating function (the transfer function) of the CNECCs. For a given network, we derive a mathematical condition on how small p(e) should be so that only single edge network-errors need to be accounted for, thus reducing the complexity of evaluating the probability of error of any CNECC. Simulations indicate that convolutional codes are required to possess different properties to achieve good performance in low p(e) and high p(e) regimes. For the low p(e) regime, convolutional codes with good distance properties show good performance. For the high p(e) regime, convolutional codes that have a good slope ( the minimum normalized cycle weight) are seen to be good. We derive a lower bound on the slope of any rate b/c convolutional code with a certain degree.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.