Conformational flexibility of DNA: polymorphism and handedness

It is shown that left-handed duplexes are possible for A, B, and D forms of DNA. These duplexes are stereochemically satisfactory and are consistent with the observed x-ray intensity data. On scrutiny the refined right-handed models of B and D DNA by Arnott and coworkers are found to be stereochemically unacceptable. It was possible to formulate a stereochemical guideline for molecular model building based on theory and analysis of single-crystal structure data of dinucleoside monophosphate and higher oligomers. This led to both right- and left-handed DNA duplexes. The right-handed B and D DNA duplexes so obtained are stereochemically superior to earlier models and agree well with the observed x-ray intensity data. The observation that DNA can exist in either handedness for all the polymorphous forms of DNA at once explained A in equilibrium B and B in equilibrium D transitions. Hence it is confirmed that polymorphism of DNA is a reflection on the conformational flexibility inherent in DNA, the same cause that ultimately allows DNA in either handedness. The possibility of various types of right- and left-handed duplexes generated by using dinucleoside monophosphate and trinucleoside diphosphate as repeating units resulted in a variety of models, called RL models. All these models have alternating right and left helical segments and inverted stacking at the bend region as suggested by us earlier. It turns out that the B-Z DNA model of Wang et al. is only an example of RL models.

STBC's from representation of extended Clifford Algebras

A set of sufficient conditions to construct lambda-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for lambda = 2(a), a is an element of N is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.

The scratch hardness and friction of a soft rigid-plastic solid

The paper describes an experimental and analytical study of the normal and scratch hardnesses of a model soft rigid-plastic solid. The material known as ‘Plasticine’, a mixture of dry particles and a mineral oil, has been deformed with a range of rigid conical indentors with included angles of between 30° and 170°. The sliding velocity dependence of the computed scratch hardness and friction has been examined in the velocity range 0.19 mm/s to 7.3 m/s. Data are also described for the time dependence of the normal hardness and also the estimated rate dependence of the intrinsic flow stress. The latter values were estimated from data obtained during the upsetting of right cylinders. Three major conclusions are drawn from these data and the associated analysis. (1) A first-order account of the scratching force may be provided by adopting a model which sums the computed plastic deformation and interfacial sliding contributions to the total sliding work. This is tantamount to the adoption of the two-term non-interacting model of friction. (2) For this system during sliding, at high sliding velocities at least, the interface shear stress which defines the boundary condition is not directly related to the bulk shear stress. The interface rheological characteristics indicate an appreciable dependence on the imposed strain or strain rate. In particular, the relative contributions of the slip and stick boundary conditions appear to be a function of the imposed sliding velocity. (3) The computed normal and scratch hardness values are not simply interrelated primarily because of the evolving boundary conditions which appear to exist in the scratching experiments.

Experimental and simulation studies on the performance of standing wave thermoacoustic prime mover for pulse tube refrigerator

The thermoacoustic prime mover (TAPM) has gained considerable attention as a pressure wave generator to drive pulse tube refrigerator (PTR) due to no moving parts, reasonable efficiency, use of environmental friendly working fluids etc. To drive PTCs, lower frequencies (f) with larger pressure amplitudes (Delta P) are essential, which are affected by geometric and operating parameters of TAPM as well as working fluids. For driving PTRs, a twin standing wave TAPM is built and studied by using different working fluids such as helium, argon, nitrogen and their binary mixtures. Simulation results of DeltaEc are compared with experimental data wherever possible. DeltaEc predicts slightly increased resonance frequencies, but gives larger Delta P and lower temperature difference Delta T across stack. High mass number working fluid leads to lower frequency with larger Delta P, but higher Delta T. Studies indicate that the binary gas mixture of right composition with lower Delta T can be arrived at to drive TAPM of given geometry. (C) 2013 Elsevier Ltd and IIR. All rights reserved.

Hardware Accelerator for 3D Method of Moments based Parasitic Extraction

A Field Programmable Gate Array (FPGA) based hardware accelerator for multi-conductor parasitic capacitance extraction, using Method of Moments (MoM), is presented in this paper. Due to the prohibitive cost of solving a dense algebraic system formed by MoM, linear complexity fast solver algorithms have been developed in the past to expedite the matrix-vector product computation in a Krylov sub-space based iterative solver framework. However, as the number of conductors in a system increases leading to a corresponding increase in the number of right-hand-side (RHS) vectors, the computational cost for multiple matrix-vector products present a time bottleneck, especially for ill-conditioned system matrices. In this work, an FPGA based hardware implementation is proposed to parallelize the iterative matrix solution for multiple RHS vectors in a low-rank compression based fast solver scheme. The method is applied to accelerate electrostatic parasitic capacitance extraction of multiple conductors in a Ball Grid Array (BGA) package. Speed-ups up to 13x over equivalent software implementation on an Intel Core i5 processor for dense matrix-vector products and 12x for QR compressed matrix-vector products is achieved using a Virtex-6 XC6VLX240T FPGA on Xilinx's ML605 board.

Fusing the Navigation Information of Dual Foot-Mounted Zero-Velocity-Update-Aided Inertial Navigation Systems

A range constraint method viz. centroid method is proposed to fuse the navigation information of dual (right and left) foot-mounted Zero-velocity-UPdaTe (ZUPT)-aided Inertial Navigation Systems (INSs). Here, the range constraint means that the distance of separation between the position estimates of right and left foot ZUPT-aided INSs cannot be greater than a quantity known as foot-to-foot maximum separation. We present the experimental results which illustrate the applicability of the proposed method. The results show that the proposed method significantly enhances the accuracy of the navigation solution when compared to using two uncoupled foot-mounted ZUPT-aided INSs. Also, we compare the performance of the proposed method with the existing data fusion methods.

Accelerating method of moments based package-board 3D parasitic extraction using FPGA

In this article, a Field Programmable Gate Array (FPGA)-based hardware accelerator for 3D electromagnetic extraction, using Method of Moments (MoM) is presented. As the number of nets or ports in a system increases, leading to a corresponding increase in the number of right-hand-side (RHS) vectors, the computational cost for multiple matrix-vector products presents a time bottleneck in a linear-complexity fast solver framework. In this work, an FPGA-based hardware implementation is proposed toward a two-level parallelization scheme: (i) matrix level parallelization for single RHS and (ii) pipelining for multiple-RHS. The method is applied to accelerate electrostatic parasitic capacitance extraction of multiple nets in a Ball Grid Array (BGA) package. The acceleration is shown to be linearly scalable with FPGA resources and speed-ups over 10x against equivalent software implementation on a 2.4GHz Intel Core i5 processor is achieved using a Virtex-6 XC6VLX240T FPGA on Xilinx's ML605 board with the implemented design operating at 200MHz clock frequency. (c) 2016 Wiley Periodicals, Inc. Microwave Opt Technol Lett 58:776-783, 2016

Algebraic design techniques for reliable stabilization

In this paper we study two problems in feedback stabilization. The first is the simultaneous stabilization problem, which can be stated as follows. Given plantsG_{0}, G_{1},..., G_{l}, does there exist a single compensatorCthat stabilizes all of them? The second is that of stabilization by a stable compensator, or more generally, a "least unstable" compensator. Given a plantG, we would like to know whether or not there exists a stable compensatorCthat stabilizesG; if not, what is the smallest number of right half-place poles (counted according to their McMillan degree) that any stabilizing compensator must have? We show that the two problems are equivalent in the following sense. The problem of simultaneously stabilizingl + 1plants can be reduced to the problem of simultaneously stabilizinglplants using a stable compensator, which in turn can be stated as the following purely algebraic problem. Given2lmatricesA_{1}, ..., A_{l}, B_{1}, ..., B_{l}, whereA_{i}, B_{i}are right-coprime for alli, does there exist a matrixMsuch thatA_{i} + MB_{i}, is unimodular for alli?Conversely, the problem of simultaneously stabilizinglplants using a stable compensator can be formulated as one of simultaneously stabilizingl + 1plants. The problem of determining whether or not there exists anMsuch thatA + BMis unimodular, given a right-coprime pair (A, B), turns out to be a special case of a question concerning a matrix division algorithm in a proper Euclidean domain. We give an answer to this question, and we believe this result might be of some independent interest. We show that, given twon times mplantsG_{0} and G_{1}we can generically stabilize them simultaneously provided eithernormis greater than one. In contrast, simultaneous stabilizability, of two single-input-single-output plants, g0and g1, is not generic.