A frame-invariant scheme for the geometrically exact beam using rotation vector parametrization

While frame-invariant solutions for arbitrarily large rotational deformations have been reported through the orthogonal matrix parametrization, derivation of such solutions purely through a rotation vector parametrization, which uses only three parameters and provides a parsimonious storage of rotations, is novel and constitutes the subject of this paper. In particular, we employ interpolations of relative rotations and a new rotation vector update for a strain-objective finite element formulation in the material framework. We show that the update provides either the desired rotation vector or its complement. This rules out an additive interpolation of total rotation vectors at the nodes. Hence, interpolations of relative rotation vectors are used. Through numerical examples, we show that combining the proposed update with interpolations of relative rotations yields frame-invariant and path-independent numerical solutions. Advantages of the present approach vis-a-vis the updated Lagrangian formulation are also analyzed.

Simple Coding Scheme For Modular Arithmetic

A dual representation scheme for performing arithmetic modulo an arbitrary integer M is presented. The coding scheme maps each integer N in the range 0 <= N < M into one of two representations, each being identified by its most significant bit. The encoding of numbers is straightforward and the problem of checking for unused combinations is eliminated.

Icosahedral DNA Nanocapsules by Modular Assembly

The construction of well-defined 3D architectures is one of the greatest challenges of self-assembly. Nanofabrication through molecular self-assembly has resulted in the formation of DNA polyhedra with the connectivities of cubes,[1] tetrahedra,[2,3] octahedra,[4, 5] dodecahedra,[3] and buckminsterfullerene.[ 3] DNA polyhedra could also function as nanocapsules and thereby enable the targeted delivery of entities encapsulated from solution. Key to realizing this envisaged function is the construction of complex polyhedra that maximize encapsulation volumes while preserving small. pore size.

Dynamic Digital Simulation of HVDC Systems Using a Novel Modular Converter Model

This paper describes a method for the dynamic digital simulation of HVDC transmission systems. The method employs a novel modular converter representation during both normal and abnormal conditions.

Modular design of synthetic protein mimics. Crystal structures, assembly, and hydration of two 15- and 16-residue apolar, leucyl-rich helical peptides

Two IS- and 16-residue peptides containing a-aminoisobutyric acid (Aib) have been synthesized, as part of a strategy to construct stereochemically rigid peptide helices, in a modular approach to design of protein mimics. The peptides Boc-(Val-Ala-Leu-Aib),-OMe ( I ) and Boc-Val-Ala-Leu-Aib-Val-Ala-Leu-(Val-Ala-Leu-Aib()11z)- OhaMvee been crystallized.Both crystals are stable only in the presence of mother liquor or water. The crystal data are as follows. I: C78H140N16019~2H20,P2,, a = 16.391 (3) A, b = 16.860 (3) A, c = 18.428 (3) A, p = 103.02 (I)O, Z = 2, R = 9.6% for 3445 data with lFol >30(F), resolution 0.93 A. 11: C7,Hl,,N,S018.7.5H,0, C2221, a = 18.348 ( 5 ) A, b = 47.382 (1 1) A, c = 24.157 ( 5 ) A, Z =8, R = l0,6%, for 3147 data with lFol > 3a(F), resolution 1.00 A. The 15-residue peptide (11) is entirely a helical, while the 16-residue peptide ( I ) has a short segment of 310 helix at the N terminus. The packing of the helices in the crystals is rather incfficicnt with no particular attractions between Leu-Leu side chains, or any other pair. Both crystals have fairly large voids, which are filled with water molecules in a disordered fashion. Water molecule sites near the polar head-to-tail regions are well detcrmined, those closer to the hydrophobic side chains less so and a number of possible water sites in the remaining "empty" space are not determined. No interdigitation of Leu side chains is observed in the crystal as is hypothesized in the "leucine zipper" class of DNA binding proteins.

Modular design of synthetic protein mimics. Crystal structure of two seven-residue helical peptide segments linked by .epsilon.-aminocaproic acid

Two seven-residue helical segments, Val-Ala-Leu-Aib-Val-Ala-Leu, were linked synthetically with an epsilon-aminocaproic acid (Acp) linker with the intention of making a stable antiparallel helix-helix motif. The crystal structure of the linked peptide Boc-Val-Ala-Leu-Aib-Val-Ala-Leu-Acp-Val-Ala-Leu-Aib-Val-Ala-Leu-OMe (1) shows the two helices displaced laterally from each other by the linker, but the linker has not folded the molecule into a close-packed antiparallel conformation. Two strong intermolecular NH...O = C hydrogen bonds are formed between the top of the lower helix of one molecule and the bottom of the upper helix in a laterally adjacent molecule to give the appearance of an extended single helix. The composite peptide with Boc and OMe end groups, C76H137N15O18.H2O, crystallize in space group P2(1) with a = 8.802 (1) angstrom, b = 20.409 (4) angstrom, c = 26.315 (3) angstrom, and beta = 90.72 (1)degrees; overall agreement R = 7.86% for 5030 observed reflections (\F(o)\ > 3-sigma(F)); resolution = 0.93 angstrom. Limited evidence for a more compact conformation in solution consistent with an antiparallel helix arrangement is obtained by comparison of the HPLC retention times and CD spectra of peptide 1 with well-characterized continuous helices of similar length and sequence.

An accurate numerical integration scheme for finite rotations using rotation vector parametrization

A numerical integration procedure for rotational motion using a rotation vector parametrization is explored from an engineering perspective by using rudimentary vector analysis. The incremental rotation vector, angular velocity and acceleration correspond to different tangent spaces of the rotation manifold at different times and have a non-vectorial character. We rewrite the equation of motion in terms of vectors lying in the same tangent space, facilitating vector space operations consistent with the underlying geometric structure. While any integration algorithm (that works within a vector space setting) may be used, we presently employ a family of explicit Runge-Kutta algorithms to solve this equation. While this work is primarily motivated out of a need for highly accurate numerical solutions of dissipative rotational systems of engineering interest, we also compare the numerical performance of the present scheme with some of the invariant preserving schemes, namely ALGO-C1, STW, LIEMIDEA] and SUBCYC-M. Numerical results show better local accuracy via the present approach vis-a-vis the preserving algorithms. It is also noted that the preserving algorithms do not simultaneously preserve all constants of motion. We incorporate adaptive time-stepping within the present scheme and this in turn enables still higher accuracy and a `near preservation' of constants of motion over significantly longer intervals. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Transformation formula for exponential sums involving fourier coefficients of modular forms

In 1984 Jutila [5] obtained a transformation formula for certain exponential sums involving the Fourier coefficients of a holomorphic cusp form for the full modular group SL(2, Z). With the help of the transformation formula he obtained good estimates for the distance between consecutive zeros on the critical line of the Dirichlet series associated with the cusp form and for the order of the Dirichlet series on the critical line, [7]. In this paper we follow Jutila to obtain a transformation formula for exponential sums involving the Fourier coefficients of either holomorphic cusp forms or certain Maass forms for congruence subgroups of SL(2, Z) and prove similar estimates for the corresponding Dirichlet series.

Recursive parametrization of quark flavour mixing matrices

We examine quark flavour mixing matrices for three and four generations using the recursive parametrization of U(n) and SU(n) matrices developed earlier. After a brief summary of the recursive parametrization, we obtain expressions for the independent rephasing invariants and also the constraints on them that arise from the requirement of mod symmetry of the flavour mixing matrix.

The approximate parametrization of the curve of intersection of implicit surfaces

A clear definition of an approximate parametrization of the curve of intersection of (n-1) implicit surfaces in Rn is given. It is justified that marching methods yield such an approximation.

PRUNE and PROBE-two modular web services for protein-protein docking

The protein-protein docking programs typically perform four major tasks: (i) generation of docking poses, (ii) selecting a subset of poses, (iii) their structural refinement and (iv) scoring, ranking for the final assessment of the true quaternary structure. Although the tasks can be integrated or performed in a serial order, they are by nature modular, allowing an opportunity to substitute one algorithm with another. We have implemented two modular web services, (i) PRUNE: to select a subset of docking poses generated during sampling search (http://pallab.serc.iisc.ernet.in/prune) and (ii) PROBE: to refine, score and rank them (http://pallab.serc.iisc.ernet.in/probe). The former uses a new interface area based edge-scoring function to eliminate > 95% of the poses generated during docking search. In contrast to other multi-parameter-based screening functions, this single parameter based elimination reduces the computational time significantly, in addition to increasing the chances of selecting native-like models in the top rank list. The PROBE server performs ranking of pruned poses, after structure refinement and scoring using a regression model for geometric compatibility, and normalized interaction energy. While web-service similar to PROBE is infrequent, no web-service akin to PRUNE has been described before. Both the servers are publicly accessible and free for use.

A Systematic Approach to Synthesis of Verification Test-suites for Modular SoC Designs

Verification is one of the important stages in designing an SoC (system on chips) that consumes upto 70% of the design time. In this work, we present a methodology to automatically generate verification test-cases to verify a class of SoCs and also enable re-use of verification resources created from one SoC to another. A prototype implementation for generating the test-cases is also presented.