Sensitivity of Water Dynamics to Biologically Significant Surfaces of Monomeric Insulin: Role of Topology and Electrostatic Interactions

In addition to the biologically active monomer of the protein insulin circulating in human blood, the molecule also exists in dimeric and hexameric forms that are used as storage. The insulin monomer contains two distinct surfaces, namely, the dimer forming surface (DFS) and the hexamer forming surface (HFS), that are specifically designed to facilitate the formation of the dimer and the hexamer, respectively. In order to characterize the structural and dynamical behavior of interfacial water molecules near these two surfaces (DFS and HFS), we performed atomistic molecular dynamics simulations of insulin with explicit water. Dynamical characterization reveals that the structural relaxation of the hydrogen bonds formed between the residues of DFS and the interfacial water molecules is faster than those formed between water and that of the HFS. Furthermore, the residence times of water molecules in the protein hydration layer for both the DFS and HFS are found to be significantly higher than those for some of the other proteins studied so far, such as HP-36 and lysozyme. In particular, we find that more structured water molecules, with higher residence times (similar to 300-500 ps), are present near HFS than those near DFS. A significant slowing down is observed in the decay of associated rotational auto time correlation functions of O-H bond vector of water in the vicinity of HFS. The surface topography and the arrangement of amino acid residues work together to organize the water molecules in the hydration layer in order to provide them with a preferred orientation. HFS having a large polar solvent accessible surface area and a convex extensive nonpolar region, drives the surrounding water molecules to acquire predominantly an outward H-atoms directed, clathrate-like structure. In contrast, near the DFS, the surrounding water molecules acquire an inward H-atoms directed orientation owing to the flat curvature of hydrophobic surface and the interrupted hydrophilic residual alignment. We have followed escape trajectory of several such quasi-bound water molecules from both the surfaces that reveal the significant differences between the two hydration layers.

Molecular topology of three ring nematogens from C-13-H-1 dipolar couplings

Molecules in their liquid crystalline phase undergo rotational motion about the long axis of the molecule and the shape adopted by the rotating molecule plays an important role in influencing the mesophase morphology. In this context, obtaining the topology and the relative orientation of the different sub-units are important steps. For studying the liquid crystalline phase, C-13 NMR spectroscopy is a convenient method and for certain specifically designed nematogens, 2-dimensional separated local field (2D-SLF) NMR spectroscopy provides a particularly simple and straightforward means of arriving at the molecular topology. We demonstrate this approach on two three ring based nematogens designed with a phenyl or a thiophene ring at one of the termini. From the C-13-H-1 dipolar couplings of the terminal carbon obtained using the 2D-SLF NMR technique, the order parameter of the local symmetry axis of the terminal phenyl ring as well as of the long molecular axis could be easily estimated. For the thiophene nematogen, the lack of symmetry of the thiophene moiety necessitates some additional computational steps. The results indicate that the thiophene unit has its local ordering axis oriented away from the long molecular axis by a small angle, consistent with a bent structure expected in view of the thiophene geometry. The experiment also demonstrates the ability of 2D-SLF NMR to provide high resolution spectra by separation of several overlapped resonances in terms of their C-13-H-1 dipolar couplings. The results are consistent with a rod-like topology of the core of the investigated mesogens. The investigation demonstrates the potential of 2D-SLF NMR C-13 spectroscopy for obtaining atomistic level information and its utility for topological studies of different mesogens.

Flexible implementation of power system corrective topology control

This paper proposes a novel decision making framework for optimal transmission switching satisfying the AC feasibility, stability and circuit breaker (CB) reliability requirements needed for practical implementation. The proposed framework can be employed as a corrective tool in day to day operation planning scenarios in response to potential contingencies. The switching options are determined using an efficient heuristic algorithm based on DC optimal power flow, and are presented in a multi-branch tree structure. Then, the AC feasibility and stability checks are conducted and the CB condition monitoring data are employed to perform a CB reliability and line availability assessment. Ultimately, the operator will be offered multiple AC feasible and stable switching options with associated benefits. The operator can use this information, other operating conditions not explicitly considered in the optimization, and his/her own experience to implement the best and most reliable switching action(s). The effectiveness of the proposed approach is validated on the IEEE-118 bus test system. (C) 2015 Elsevier B.V. All rights reserved.

MS3ALIGN: an efficient molecular surface aligner using the topology of surface curvature

Background: Aligning similar molecular structures is an important step in the process of bio-molecular structure and function analysis. Molecular surfaces are simple representations of molecular structure that are easily constructed from various forms of molecular data such as 3D atomic coordinates (PDB) and Electron Microscopy (EM) data. Methods: We present a Multi-Scale Morse-Smale Molecular-Surface Alignment tool, MS3ALIGN, which aligns molecular surfaces based on significant protrusions on the molecular surface. The input is a pair of molecular surfaces represented as triangle meshes. A key advantage of MS3ALIGN is computational efficiency that is achieved because it processes only a few carefully chosen protrusions on the molecular surface. Furthermore, the alignments are partial in nature and therefore allows for inexact surfaces to be aligned. Results: The method is evaluated in four settings. First, we establish performance using known alignments with varying overlap and noise values. Second, we compare the method with SurfComp, an existing surface alignment method. We show that we are able to determine alignments reported by SurfComp, as well as report relevant alignments not found by SurfComp. Third, we validate the ability of MS3ALIGN to determine alignments in the case of structurally dissimilar binding sites. Fourth, we demonstrate the ability of MS3ALIGN to align iso-surfaces derived from cryo-electron microscopy scans. Conclusions: We have presented an algorithm that aligns Molecular Surfaces based on the topology of surface curvature. Awebserver and standalone software implementation of the algorithm available at http://vgl.serc.iisc.ernet. in/ms3align.

Reduced common-mode voltage operation of a new seven-level hybrid multilevel inverter topology with a single DC voltage source

In this study, analysis of extending the linear modulation range of a zero common-mode voltage (CMV) operated n-level inverter by allowing reduced CMV switching is presented. A new hybrid seven-level inverter topology with a single DC supply is also presented in this study and inverter operation for zero and reduced CMV is analysed. Each phase of the inverter is realised by cascading two three-level flying capacitor inverters with a half-bridge module in between. Proposed inverter topology is operated with zero CMV for modulation index <86% and is operated with a CMV magnitude of V-dc/18 to extend the modulation range up to 96%. Experimental results are presented for zero CMV operation and for reduced common voltage operation to extend the linear modulation range. A capacitor voltage balancing algorithm is designed utilising the pole voltage redundancies of the inverter, which works for every sampling instant to correct the capacitor voltage irrespective of load power factor and modulation index. The capacitor voltage balancing algorithm is tested for different modulation indices and for various transient conditions, to validate the proposed topology.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

A New Mechanism For Ferromagnetism In C-60-TDAE

Based on the topology of C-60 and the resulting non-disjoint nature of the lowest unoccupied molecular orbitals, Ne propose a new model for ferromagnetic exchange in C-60-TDAE. Within the Hubbard model, we find that the ferromagnetic exchange integral is stabilized to first order in the inter-ball transfer integral, while the antiferromagnetic coupling is stabilized only to second order. This difference is adequate to counter the larger phase space available for stabilizing the antiferromagnetic state. Thus, the ground state is found to be ferromagnetic for reasonable inter-ball transfer integrals.

Void Geometry Driven Spin Crossover in Zeolite-Encapsulated Cobalt Tris(bipyridyl) Complex Ion

The cobalt(II) tris(bipyridyl) complex ion encapsulated in zeolite-Y supercages exhibits a thermally driven interconversion between a low-spin and a high-spin state-a phenomenon not observed for this ion either in solid state or in solution. From a comparative study of the magnetism and optical spectroscopy of the encapsulated and unencapsulated complex ion, supported by molecular modeling, such spin behavior is shown to be intramolecular in origin. In the unencapsulated or free state, the [Co(bipy)(3)](2+) ion exhibits a marked trigonal prismatic distortion, but on encapsulation, the topology of the supercage forces it to adopt a near-octahedral geometry. An analysis using the angular overlap ligand field model with spectroscopically derived parameters shows that the geometry does indeed give rise to a low-spin ground state, and suggests a possible scenario for the spin state interconversion.

Solar powered high voltage energization for vehicular exhaust cleaning: A step towards possible retrofitting in vehicles

This paper proposes a novel way of generating high voltage for electric discharge plasma in controlling NOx emission in diesel engine exhaust. A solar powered high frequency electric discharge topology has been suggested that will improve the size and specific energy density required when compared to the traditional repetitive pulse or 50 Hz AC energization. This methodology has been designed, fabricated and experimentally verified by conducting studies on real diesel engine exhaust.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification. Conclusion: A statistically robust and computationally efficient LP-based method for estimating the topology of a large sparse undirected graph from high-dimensional data yields representations of genetic networks that are biologically plausible and useful abstractions of the structures of real genetic networks. Analysis of the statistical and topological properties of learned LP-SLGNs may have practical value; for example, genes with high random walk betweenness, a measure of the centrality of a node in a graph, are good candidates for intervention studies and hence integrated computational – experimental investigations designed to infer more realistic and sophisticated probabilistic directed graphical model representations of genetic networks. The LP-based solutions of the sparse linear regression problem described here may provide a method for learning the structure of transcription factor networks from transcript profiling and transcription factor binding motif data.

Latency, Power and Performance Trade-offs in Network-on-Chips by Link Microarchitecture Exploration

This paper presents a power, latency and throughput trade-off study on NoCs by varying microarchitectural (e.g. pipelining) and circuit level (e.g. frequency and voltage) parameters. We change pipelining depth, operating frequency and supply voltage for 3 example NoCs - 16 node 2D Torus, Tree network and Reduced 2D Torus. We use an in-house NoC exploration framework capable of topology generation and comparison using parameterized models of Routers and links developed in SystemC. The framework utilizes interconnect power and delay models from a low-level modelling tool called Intacte[1]1. We find that increased pipelining can actually reduce latency. We also find that there exists an optimal degree of pipelining which is the most energy efficient in terms of minimizing energy-delay product.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

A New Three-Phase Current Source Inverter with Flexible PWM Capability

A new three-phase current source inverter topology is presented, consisting of three single-phase bridge inverters connected in series and feeding the isolated windings of a standard three-phase induction motor. Because a current zero in one phase now does not affect the others, it enables the implementation of a wide range of current PWM patterns for the reduction and selective elimination of torque pulsations. Furthermore, this system allows for very fast control of the fundamental load current through the use of sinusoidal PWM, a method that was not possible to implement on existing inverter topologies.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.