Conformational analysis of small disulfide loops. Spectroscopic and theoretical studies on a synthetic cyclic tetrapeptide containing cystine

The conformational analysis of the synthetic peptide Boc-Cys-Pro-Val-Cys-NHMe has been carried out, as a model for small disulfide loops, in biologically active polypeptides. 'H NMR studies (270 MHz) establish that the Val(3) and Cys(4) NH groups are solvent shielded, while 13C studies establish an all-trans peptide backbone. Circular dichroism and Raman spectroscopy provide evidence for a right-handed twist of the disulfide bond. Analysis of the vicinal (JaB)c oupling constants for the two Cys residues establishes that XI - *60° for Cys(4), while some flexibility is suggested at Cys( 1). Conformational energy calculations, imposing intramolecular hydrogen bonding constraints, favor a P-turn (type I) structure with Pro(2)-Va1(3) as the corner residues. Theoretical and spectroscopic results are consistent with the presence of a transannular 4 - 1 hydrogen bond between Cys( 1) CO and Cys(4) NH groups, with the Val NH being sterically shielded from the solvent environment.

Structural Ordering of Disordered Ligand-Binding Loops of Biotin Protein Ligase into Active Conformations as a Consequence of Dehydration

Mycobacterium tuberculosis (Mtb), a dreaded pathogen, has a unique cell envelope composed of high fatty acid content that plays a crucial role in its pathogenesis. Acetyl Coenzyme A Carboxylase (ACC), an important enzyme that catalyzes the first reaction of fatty acid biosynthesis, is biotinylated by biotin acetyl-CoA carboxylase ligase (BirA). The ligand-binding loops in all known apo BirAs to date are disordered and attain an ordered structure only after undergoing a conformational change upon ligand-binding. Here, we report that dehydration of Mtb-BirA crystals traps both the apo and active conformations in its asymmetric unit, and for the first time provides structural evidence of such transformation. Recombinant Mtb-BirA was crystallized at room temperature, and diffraction data was collected at 295 K as well as at 120 K. Transfer of crystals to paraffin and paratone-N oil (cryoprotectants) prior to flash-freezing induced lattice shrinkage and enhancement in the resolution of the X-ray diffraction data. Intriguingly, the crystal lattice rearrangement due to shrinkage in the dehydrated Mtb-BirA crystals ensued structural order of otherwise flexible ligand-binding loops L4 and L8 in apo BirA. In addition, crystal dehydration resulted in a shift of similar to 3.5 angstrom in the flexible loop L6, a proline-rich loop unique to Mtb complex as well as around the L11 region. The shift in loop L11 in the C-terminal domain on dehydration emulates the action responsible for the complex formation with its protein ligand biotin carboxyl carrier protein (BCCP) domain of ACCA3. This is contrary to the involvement of loop L14 observed in Pyrococcus horikoshii BirA-BCCP complex. Another interesting feature that emerges from this dehydrated structure is that the two subunits A and B, though related by a noncrystallographic twofold symmetry, assemble into an asymmetric dimer representing the ligand-bound and ligand-free states of the protein, respectively. In-depth analyses of the sequence and the structure also provide answers to the reported lower affinities of Mtb-BirA toward ATP and biotin substrates. This dehydrated crystal structure not only provides key leads to the understanding of the structure/function relationships in the protein in the absence of any ligand-bound structure, but also demonstrates the merit of dehydration of crystals as an inimitable technique to have a glance at proteins in action.

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

Cystine peptides. Disulfide conformations in fourteen membered loops investigated by Raman spectroscopy and circular dichroism

NHCH3 (X = Gly 1, Ala 2, Aib 3, Leu 4 and D-Ala 5), have been investigated by Raman and circular dichroism (CD) spectroscopy. Solid state Raman spectra are consistent with β-turn conformations in all five peptides. These peptides exhibit similar conformations of the disulfide segment in the solid state with a characteristic disulfide stretching frequency at 519 ± 3 cm-1, indicative of a trans-gauche-gauche arrangement about the Cα—Cβ—S—S—Cβ—Cα bonds. The results correlate well with the solid state conformations determined by X-ray diffraction for peptides 3 and 4. CD studies in chloroform and dimethylsulfoxide establish solvent dependent conformational changes for peptides 1, 3 and 5. Disulfide chirality has been derived using the quadrant rule. CD results together with previously reported nuclear magnetic resonance (n.m.r.) data suggest a conformational coupling between the peptide backbone and the disulfide segment

Studies on helium flow in experimental loops with different impedances operated with fountain effect pumps

An experimental flow loop with He II flow driven by fountain effect pumps (FEPs) is studied with respect to operation at different flow impedances and with thermal loads applied at different positions. The measured values of temperature, flow rate and pressure drop are compared with calculations resulting from a simplified model which assumes ideal performance of the porous plug and of the heat exchangers and which does not take into account Gorter-Mellink (GM) conduction. The main features of the loop are shown to be well described by this model. Refined calculations with a more complex model, including GM conduction of the He II, are only required for predicting the temperature distribution in some discrete regions of the loop.

An automatic parallelization framework for multicomputers

Several researchers have looked into various issues related to automatic parallelization of sequential programs for multicomputers. But there is a need for a coherent framework which encompasses all these issues. In this paper we present a such a framework which takes best advantage of the multicomputer architecture. We resort to tiling transformation for iteration space partitioning and propose a scheme of automatic data partitioning and dynamic data distribution. We have tried a simple implementation of our scheme on a transputer based multicomputer [1] and the results are encouraging.

Online Unsupervised Pattern Discovery in Speech Using Parallelization

Segmental dynamic time warping (DTW) has been demonstrated to be a useful technique for finding acoustic similarity scores between segments of two speech utterances. Due to its high computational requirements, it had to be computed in an offline manner, limiting the applications of the technique. In this paper, we present results of parallelization of this task by distributing the workload in either a static or dynamic way on an 8-processor cluster and discuss the trade-offs among different distribution schemes. We show that online unsupervised pattern discovery using segmental DTW is plausible with as low as 8 processors. This brings the task within reach of today's general purpose multi-core servers. We also show results on a 32-processor system, and discuss factors affecting scalability of our methods.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

Integrated parallelization of computations and visualization for large-scale applications

Critical applications like cyclone tracking and earthquake modeling require simultaneous high-performance simulations and online visualization for timely analysis. Faster simulations and simultaneous visualization enable scientists provide real-time guidance to decision makers. In this work, we have developed an integrated user-driven and automated steering framework that simultaneously performs numerical simulations and efficient online remote visualization of critical weather applications in resource-constrained environments. It considers application dynamics like the criticality of the application and resource dynamics like the storage space, network bandwidth and available number of processors to adapt various application and resource parameters like simulation resolution, simulation rate and the frequency of visualization. We formulate the problem of finding an optimal set of simulation parameters as a linear programming problem. This leads to 30% higher simulation rate and 25-50% lesser storage consumption than a naive greedy approach. The framework also provides the user control over various application parameters like region of interest and simulation resolution. We have also devised an adaptive algorithm to reduce the lag between the simulation and visualization times. Using experiments with different network bandwidths, we find that our adaptive algorithm is able to reduce lag as well as visualize the most representative frames.

Decoherence suppression by parallelization

Decoherence as an obstacle in quantum computation is viewed as a struggle between two forces [1]: the computation which uses the exponential dimension of Hilbert space, and decoherence which destroys this entanglement by collapse. In this model of decohered quantum computation, a sequential quantum computer loses the battle, because at each time step, only a local operation is carried out but g*(t) number of gates collapse. With quantum circuits computing in parallel way the situation is different- g(t) number of gates can be applied at each time step and number gates collapse because of decoherence. As g(t) ≈ g*(t) competition here is even [1]. Our paper improves on this model by slowing down g*(t) by encoding the circuit in parallel computing architectures and running it in Single Instruction Multiple Data (SIMD) paradigm. We have proposed a parallel ion trap architecture for single-bit rotation of a qubit.

Runtime dependence computation and execution of loops on heterogeneous systems

GPUs have been used for parallel execution of DOALL loops. However, loops with indirect array references can potentially cause cross iteration dependences which are hard to detect using existing compilation techniques. Applications with such loops cannot easily use the GPU and hence do not benefit from the tremendous compute capabilities of GPUs. In this paper, we present an algorithm to compute at runtime the cross iteration dependences in such loops. The algorithm uses both the CPU and the GPU to compute the dependences. Specifically, it effectively uses the compute capabilities of the GPU to quickly collect the memory accesses performed by the iterations by executing the slice functions generated for the indirect array accesses. Using the dependence information, the loop iterations are levelized such that each level contains independent iterations which can be executed in parallel. Another interesting aspect of the proposed solution is that it pipelines the dependence computation of the future level with the actual computation of the current level to effectively utilize the resources available in the GPU. We use NVIDIA Tesla C2070 to evaluate our implementation using benchmarks from Polybench suite and some synthetic benchmarks. Our experiments show that the proposed technique can achieve an average speedup of 6.4x on loops with a reasonable number of cross iteration dependences.