Identification and characterization of a library of microheterogeneous cyclohexadepsipeptides from the fungus Isaria

Ten new cyclic hexadepsipeptides, six isariins and four isaridins, from the fungus Isaria have been identified and characterized by high-performance liquid chromatography, coupled to tandem electrospray ionization mass spectrometry (LC-ESIMS/MS). The isariins possess a beta-hydroxy acid residue and five alpha-amino acids, while isaridins contain a beta-amino acid, an alpha-hydroxy acid, and four alpha-amino acids. One- and two-dimensional NMR spectroscopy confirmed the chemical identity of some of the isariin fractions. Mass spectral fragmentation patterns of [M + H](+) ions reveal clear diagnostic fragment ions for the isariins and isaridins. Previously described cyclic depsipeptides, isarfelins from Isaria felina (Guo, Y. X.; Liu, Q. H.; Ng, T. B.; Wang H. X. Peptides 2005, 26, 2384), are now reassigned as members of the isaridin family. Examination of isaridin sequences revealed significant similarities with cyclic hexadepsipeptides such as destruxins and roseotoxins. The structure of an isariin (isariin A) investigated by NMR spectroscopy indicated the presence of a hybrid alpha beta C-11 turn, formed by the beta-hydroxy acid and glycine residues and a (D)Leu-(L)Ala type II' beta-turn. Additionally, the inhibitory effect of isariins and an isaridin on the intra-erythrocytic growth of Plasmodium falciparum is presented.

Parallel circuit partitioning on a reduced array architecture

The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is necessary to partition a large electrical circuit into several smaller circuits such that the total cross-wiring is minimized. This problem is a variant of the more general graph partitioning problem, and it is known that there does not exist a polynomial time algorithm to obtain an optimal partition. The heuristic procedure proposed by Kernighan and Lin1,2 requires O(n2 log2n) time to obtain a near-optimal two-way partition of a circuit with n modules. In the VLSI context, due to the large problem size involved, this computational requirement is unacceptably high. This paper is concerned with the hardware acceleration of the Kernighan-Lin procedure on an SIMD architecture. The proposed parallel partitioning algorithm requires O(n) processors, and has a time complexity of O(n log2n). In the proposed scheme, the reduced array architecture is employed with due considerations towards cost effectiveness and VLSI realizability of the architecture.The authors are not aware of any earlier attempts to parallelize a circuit partitioning algorithm in general or the Kernighan-Lin algorithm in particular. The use of the reduced array architecture is novel and opens up the possibilities of using this computing structure for several other applications in electronic design automation.

Architecture of Run-time Reconfigurable Channel Decoder

Modern wireline and wireless communication devices are multimode and multifunctional communication devices. In order to support multiple standards on a single platform, it is necessary to develop a reconfigurable architecture that can provide the required flexibility and performance. The Channel decoder is one of the most compute intensive and essential elements of any communication system. Most of the standards require a reconfigurable Channel decoder that is capable of performing Viterbi decoding and Turbo decoding. Furthermore, the Channel decoder needs to support different configurations of Viterbi and Turbo decoders. In this paper, we propose a reconfigurable Channel decoder that can be reconfigured for standards such as WCDMA, CDMA2000, IEEE802.11, DAB, DVB and GSM. Different parameters like code rate, constraint length, polynomials and truncation length can be configured to map any of the above mentioned standards. A multiprocessor approach has been followed to provide higher throughput and scalable power consumption in various configurations of the reconfigurable Viterbi decoder and Turbo decoder. We have proposed A Hybrid register exchange approach for multiprocessor architecture to minimize power consumption.

Design and performance evaluation of a systolic architecture for hidden-surface removal

In this paper, we propose a systolic architecture for hidden-surface removal. Systolic architecture is a kind of parallel architecture best known for its easy VLSI implementability. After discussing the design details of the architecture, we present the results of the simulation experiments conducted in order to evaluate the performance of the architecture.

Classification of Protein Kinases on the Basis of Both Kinase and Non-Kinase Regions

Background: Protein phosphorylation is a generic way to regulate signal transduction pathways in all kingdoms of life. In many organisms, it is achieved by the large family of Ser/Thr/Tyr protein kinases which are traditionally classified into groups and subfamilies on the basis of the amino acid sequence of their catalytic domains. Many protein kinases are multidomain in nature but the diversity of the accessory domains and their organization are usually not taken into account while classifying kinases into groups or subfamilies. Methodology: Here, we present an approach which considers amino acid sequences of complete gene products, in order to suggest refinements in sets of pre-classified sequences. The strategy is based on alignment-free similarity scores and iterative Area Under the Curve (AUC) computation. Similarity scores are computed by detecting common patterns between two sequences and scoring them using a substitution matrix, with a consistent normalization scheme. This allows us to handle full-length sequences, and implicitly takes into account domain diversity and domain shuffling. We quantitatively validate our approach on a subset of 212 human protein kinases. We then employ it on the complete repertoire of human protein kinases and suggest few qualitative refinements in the subfamily assignment stored in the KinG database, which is based on catalytic domains only. Based on our new measure, we delineate 37 cases of potential hybrid kinases: sequences for which classical classification based entirely on catalytic domains is inconsistent with the full-length similarity scores computed here, which implicitly consider multi-domain nature and regions outside the catalytic kinase domain. We also provide some examples of hybrid kinases of the protozoan parasite Entamoeba histolytica. Conclusions: The implicit consideration of multi-domain architectures is a valuable inclusion to complement other classification schemes. The proposed algorithm may also be employed to classify other families of enzymes with multidomain architecture.

Identification and characterization of a library of microheterogeneous cyclohexa-depsipeptides from the fungus

Ten new cyclic hexadepsipeptides, six isariins and four isaridins, from the fungus Isaria have been identified and characterized by high-performance liquid chromatography, coupled to tandem electrospray ionization mass spectrometry (LC-ESIMS/MS). The isariins possess a beta-hydroxy acid residue and five alpha-amino acids, while isaridins contain a beta-amino acid, an alpha-hydroxy acid, and four alpha-amino acids. One- and two-dimensional NMR spectroscopy confirmed the chemical identity of some of the isariin fractions. Mass spectral fragmentation patterns of [M + H](+) ions reveal clear diagnostic fragment ions for the isariins and isaridins. Previously described cyclic depsipeptides, isarfelins from Isaria felina (Guo, Y. X.; Liu, Q. H.; Ng, T. B.; Wang H. X. Peptides 2005, 26, 2384), are now reassigned as members of the isaridin family. Examination of isaridin sequences revealed significant similarities with cyclic hexadepsipeptides such as destruxins and roseotoxins. The structure of an isariin (isariin A) investigated by NMR spectroscopy indicated the presence of a hybrid alpha beta C-11 turn, formed by the beta-hydroxy acid and glycine residues and a (D)Leu-(L)Ala type II' beta-turn. Additionally, the inhibitory effect of isariins and an isaridin on the intra-erythrocytic growth of Plasmodium falciparum is presented.

Parallel min-cut placement on reduced hardware SIMD architecture.

Massively parallel SIMD computing is applied to obtain an order of magnitude improvement in the executional speed of an important algorithm in VLSI design automation. The physical design of a VLSI circuit involves logic module placement as a subtask. The paper is concerned with accelerating the well known Min-cut placement technique for logic cell placement. The inherent parallelism of the Min-cut algorithm is identified, and it is shown that a parallel machine based on the efficient execution of the placement procedure.

A fault-tolerant multi-transputer architecture

A new fault-tolerant multi-transputer architecture capable of tolerating failure of any one component in the system is described. In the proposed architecture the processing nodes are automatically reconfigured in the event of a fault and the computations continue from the stage where the fault occurred. The process of reconfiguration is transparent to the user, and the identity of the failed component is communicated to the user along with the results of computations. Parallel solution of a typical engineering problem involving solution of Laplace's equation by the boundary element method has been implemented. The performance of the architecture in the event of faults has been investigated.

Architecture of Physalis Mottle Tymovirus as Probed by Monoclonal Antibodies and Cross-Linking Studies

Physalis mottle tymovirus (previously named belladonna mottle virus, Iowa strain) RNA was cross-linked to its coat protein by exposure of the intact virus to ultraviolet light. The site of cross-linking of the coat protein with the RNA was identified as Lys-10 by sequencing the oligonucleotide-linked tryptic peptide obtained upon HPLC separation subsequent to enzymetic digestion of the cross-linked and dissociated virus. Three monoclonal antibodies PA3B2, PB5G9, and PF12C9, obtained using denatured coat protein as antigen, cross-reacted effectively with the intact virus indicating that the epitopes recognized by these monoclonals are on the surface of the virus. Using the peptides generated by digestion with CNBr, clostripain, V-8 protease, or trypsin and a recombinant protein lacking the N-terminal 21 residues expressed from a cDNA clone, it was shown that PA3B2 recognizes the sequence 22-36 on the coat protein while PB5G9 and PF12C9 recognize region 75-110. These results suggest that Lys-10 is one of the specific sites through which the RNA interacts in the intact virus. The polypeptide segment (region 22-36) following this buried portion as well as the epitope within the region 75-110 are exposed in the intact virus. These observations are consistent with the canonical β-barrel structure observed in certain other plant viruses.

Area Optimized H.264 Intra Prediction Architecture for 1080p HD Resolution

High performance video standards use prediction techniques to achieve high picture quality at low bit rates. The type of prediction decides the bit rates and the image quality. Intra Prediction achieves high video quality with significant reduction in bit rate. This paper present an area optimized architecture for Intra prediction, for H.264 decoding at HDTV resolution with a target of achieving 60 fps. The architecture was validated on Virtex-5 FPGA based platform. The architecture achieves a frame rate of 64 fps. The architecture is based on multi-level memory hierarchy to reduce latency and ensure optimum resources utilization. It removes redundancy by reusing same functional blocks across different modes. The proposed architecture uses only 13% of the total LUTs available on the Xilinx FPGA XC5VLX50T.

Diacetylenic lipid tubules:experimental evidence for a chiral molecular architecture

Molecular self-assembly is of key importance for the rational design of advanced materials. To investigate the causal relation between molecular structure and the consequent self-assembled microstructure, self-assembled tubules of diacetylenic lipids were studied. Circular-dichroism studies give experimental evidence that the formation of tubules is driven by chiral molecular packing, in agreement with recent theories of tubules. On the basis of these results, a molecular mechanism for the formation of tubules is proposed.

Primary structure of sesbania mosaic virus coat protein: its implications to the assembly and architecture of the virus

Sesbania mosaic virus (SMV) is a plant virus that infects Sesbania grandiflora plants in Andhra Pradesh, India. The amino acid sequence of the coat protein of SMV was determined using purified peptides generated by cleavage with trypsin, chymotrypsin, V8 protease and clostripain. The 230 residues so far determined were compared to the corresponding residues of southern bean mosaic virus (SBMV), the type member of sobemoviruses. The overall identity between the sequences is 61.7%. The amino terminal 64 residues, which constitute an independent domain (R-domain) known to interact with RNA, are conserved to a lower extent (52.5%). Comparison of the positively charged residues in this domain suggests that the RNA-protein interactions are considerably weaker in SMV. The residues that constitute the major domain of the coat protein, the surface domain (S-domain, residues 65-260), are better conserved (66.5%). The positively charged residues of this domain that face the nucleic acid are well conserved. The longest conserved stretch of residues (131-142) corresponds to the loop involved in intersubunit interactions between subunits related by the quasi 3-fold symmetry. A unique cation binding site located on the quasi 3-fold axis contributes to the stability of SMV. These differences are reflected in the increased stability of the SMV coat protein and its ability to be reconstituted with RNA at pH 7.5. A major epitope was identified using monoclonal antibodies to SMV in the segment 201-223 which contains an exposed helix in the capsid structure. This region is highly conserved between SMV and SBMV (70%) suggesting that it could represent the site of an important function such as vector recognition.

A single network adaptive critic (SNAC) architecture for optimal control synthesis for a class of nonlinear systems

Even though dynamic programming offers an optimal control solution in a state feedback form, the method is overwhelmed by computational and storage requirements. Approximate dynamic programming implemented with an Adaptive Critic (AC) neural network structure has evolved as a powerful alternative technique that obviates the need for excessive computations and storage requirements in solving optimal control problems. In this paper, an improvement to the AC architecture, called the �Single Network Adaptive Critic (SNAC)� is presented. This approach is applicable to a wide class of nonlinear systems where the optimal control (stationary) equation can be explicitly expressed in terms of the state and costate variables. The selection of this terminology is guided by the fact that it eliminates the use of one neural network (namely the action network) that is part of a typical dual network AC setup. As a consequence, the SNAC architecture offers three potential advantages: a simpler architecture, lesser computational load and elimination of the approximation error associated with the eliminated network. In order to demonstrate these benefits and the control synthesis technique using SNAC, two problems have been solved with the AC and SNAC approaches and their computational performances are compared. One of these problems is a real-life Micro-Electro-Mechanical-system (MEMS) problem, which demonstrates that the SNAC technique is applicable to complex engineering systems.