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.

Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

A symmetric solution X satisfying the matrix equation XA = AtX is called a symmetrizer of the matrix A. A general algorithm to compute a matrix symmetrizer is obtained. A new multiple-modulus residue arithmetic called floating-point modular arithmetic is described and implemented on the algorithm to compute an error-free matrix symmetrizer.

A new parallel algorithm for parsing arithmetic infix expressions

A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is presented. The technique is based on a result due to Fischer (1980) which enables the construction of the parse tree, by appropriately scanning the vector of precedence values associated with the elements of the expression. The algorithm presented here is suitable for execution on a shared memory model of an SIMD machine with no read/write conflicts permitted. It uses O(n) processors and has a time complexity of O(log2n) where n is the expression length. Parallel algorithms for generating code for an SIMD machine are also presented.

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.

Arithmetic Algorithms in a Negative Base

Algorithms are described for the basic arithmetic operations and square rooting in a negative base. A new operation called polarization that reverses the sign of a number facilitates subtraction, using addition. Some special features of the negative-base arithmetic are also mentioned.

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 integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly

An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.

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.

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.