Metal-Nucleotide Interactions: Crystal Structures of Alkali (Li+, Na+, K+) and Alkaline Earth (Ca2+, Mg2+) Metal Complexes of Adenosine 2'-Monophosphate

Crystal structures of lithium, sodium, potassium, calcium and magnesium salts of adenosine 2'-monophosphate (2'-AMP) have been obtained at atomic resolution by X-ray crystallographic methods. 2'-AMP.Li belongs to the monoclinic space group P21 with a = 7.472(3)Å, b = 26.853(6) Å, c = 9.184(1)Å, b = 113.36(1)Å and Z= 4. 2'-AMP.Na and 2'-AMP.K crystallize in the trigonal space groups P31 and P3121 with a = 8.762(1)Å, c = 34.630(5)Å, Z= 6 and a = 8.931(4), Åc = 34.852(9)Å and Z= 6 respectively while 2'-AMP.Ca and 2'-AMP.Mg belong to space groups P6522 and P21 with cell parameters a = 9.487(2), c = 74.622(13), Z = 12 and a = 4.973(1), b = 10.023(2), c = 16.506(2), beta = 91.1(0) and Z = 2 respectively. All the structures were solved by direct methods and refined by full matrix least-squares to final R factors of 0.033, 0.028, 0.075, 0.069 and 0.030 for 2'-AMP.Li, 2'-AMP.Na, 2'- AMP.K, 2'-AMP.Ca and 2'-AMP.Mg, respectively. The neutral adenine bases in all the structures are in syn conformation stabilized by the O5'-N3 intramolecular hydrogen bond as in free acid and ammonium complex reported earlier. In striking contrast, the adenine base is in the anti geometry (cCN = -156.4(2)°) in 2'-AMP.Mg. Ribose moieties adopt C2'-endo puckering in 2'-AMP.Li and 2'-AMP.Ca, C2'-endo-C3'-exo twist puckering in 2'-AMP.Na and 2'-AMP.K and a C3'-endo-C2'-exo twist puckering in 2'-AMP.Mg structure. The conformation about the exocyclic C4'-C5' bond is the commonly observed gauche-gauche (g+) in all the structures except the gauche- trans (g-) conformation observed in 2'-AMP.Mg structure. Lithium ions coordinate with water, ribose and phosphate oxygens at distances 1.88 to 1.99Å. Na+ ions and K+ ions interact with phosphate and ribose oxygens directly and with N7 indirectly through a water oxygen. A distinct feature of 2'-AMP.Na and 2'-AMP.K structures is the involvement of ribose O4' in metal coordination. The calcium ion situated on a two-fold axis coordinates directly with three oxygens OW1, OW2 and O2 and their symmetry mates at distances 2.18 to 2.42Å forming an octahedron. A classic example of an exception to the existence of the O5'-N3 intramolecular hydorgen bond is the 2'-AMP.Mg strucure. Magnesium ion forms an octahedral coordination with three water and three phosphate oxygens at distances ranging from 2.02 to 2.11Å. A noteworthy feature of its coordination is the indirect link with N3 through OW3 oxygen resulting in macrochelation between the base and the phosphate group. Greater affnity of metal clays towards 5' compared to 2' and 3' nucleotides (J. Lawless, E. Edelson, and L. Manring, Am. Chem. Soc. Northwest Region Meeting, Seattle. 1978) due to macrochelation infered from solution studies (S. S. Massoud, H. Sigel, Eur. J. Biochem. 179, 451-458 (1989)) and interligand hydrogen bonding induced by metals postulated from metal-nucleotide structures in solid state (V. Swaminathan and M. Sundaralingam, CRC. Crit. Rev. Biochem. 6, 245-336 (1979)) are borne out by our structures also. The stacking patterns of adenine bases of both 2'-AMP.Na and 2'-AMP.K structures resemble the 2'-AMP.NH4 structure reported in the previous article. 2'-AMP.Li, 2'-AMP.Ca and 2'-AMP.Mg structures display base-ribose O4' stacking. An overview of interaction of monovalent and divalent cations with 2' and 5'-nucleotides has been presented.

Optimal resource allocation in conflicts with the Lanchester linear law (2,1) model

This paper presents a detailed analysis of a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts in an area fire situation. Lanchester linear law attrition model is used to develop the dynamical equations governing the variation in force strength. Here we address a static resource allocation problem namely, Time-Zero-Allocation (TZA) where the resource allocation is done only at the initial time. Numerical examples are given to support the analytical results.

Quadrature generation techniques for frequency multiplication based oscillators

Frequency multiplication (FM) can be used to design low power frequency synthesizers. This is achieved by running the VCO at a much reduced frequency, while employing a power efficient frequency multiplier, and also thereby eliminating the first few dividers. Quadrature signals can be generated by frequency- multiplying low frequency I/Q signals, however this also multiplies the quadrature error of these signals. Another way is generating additional edges from the low-frequency oscillator (LFO) and develop a quadrature FM. This makes the I-Q precision heavily dependent on process mismatches in the ring oscillator. In this paper we examine the use of fewer edges from LFO and a single stage polyphase filter to generate approximate quadrature signals, which is then followed by an injection-locked quadrature VCO to generate high- precision I/Q signals. Simulation comparisons with the existing approach shows that the proposed method offers very good phase accuracy of 0.5deg with only a modest increase in power dissipation for 2.4 GHz IEEE 802.15.4 standard using UMC 0.13 mum RFCMOS technology.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Software Pipelined Execution of Stream Programs on GPUs

The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multi-core architectures. This model allows programmers to specify the structure of a program as a set of filters that act upon data, and a set of communication channels between them. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on modern Graphics Processing Units (GPUs), as they support abundant parallelism in hardware. In this paper, we describe the challenges in mapping StreamIt to GPUs and propose an efficient technique to software pipeline the execution of stream programs on GPUs. We formulate this problem - both scheduling and assignment of filters to processors - as an efficient Integer Linear Program (ILP), which is then solved using ILP solvers. We also describe a novel buffer layout technique for GPUs which facilitates exploiting the high memory bandwidth available in GPUs. The proposed scheduling utilizes both the scalar units in GPU, to exploit data parallelism, and multiprocessors, to exploit task and pipelin parallelism. Further it takes into consideration the synchronization and bandwidth limitations of GPUs, and yields speedups between 1.87X and 36.83X over a single threaded CPU.

Direct torque control schemes for split-phase induction machine

In this paper, direct torque control (DTC) algorithms for a split-phase induction machine (SPIM) are established. An SPIM has two sets of three-phase stator windings, with a shift of thirty electrical degrees between them. The significant contributions of this paper are: 1) two new methods of DTC technique for an SPIM are developed, called Resultant Flux Control Method and Individual Flux Control Method and 2) advantages and disadvantages of both methods are discussed. High torque ripple is a disadvantage for three-phase DTC. It is found that torque ripple in an SPIM can be significantly reduced without increasing the switching frequency.

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.

Distributed space-time codes with reduced decoding complexity

We address the problem of distributed space-time coding with reduced decoding complexity for wireless relay network. The transmission protocol follows a two-hop model wherein the source transmits a vector in the first hop and in the second hop the relays transmit a vector, which is a transformation of the received vector by a relay-specific unitary transformation. Design criteria is derived for this system model and codes are proposed that achieve full diversity. For a fixed number of relay nodes, the general system model considered in this paper admits code constructions with lower decoding complexity compared to codes based on some earlier system models.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Approximate linear time ML decoding on tail-biting trellises in two rounds

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(m log m) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.

Guessing under source uncertainty with side information

We study the problem of guessing the realization of a finite alphabet source, when some side information is provided, in a setting where the only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. We define a notion of redundancy, identify a quantity that measures this redundancy, and study its properties. We then identify good guessing strategies that minimize the supremum redundancy (over the family). The minimum value measures the richness of the uncertainty class.

Stability of scheduled message communication over degraded broadcast channels

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel.

Laser Surface Alloying of a Creep Resistant Magnesium Alloy MRI 230D with Al and Al2O3

A creep resistant permanent mould cast Mg alloy MRI 230D was laser surface alloyed with Al and a mixture of Al and Al2O3 using pulsed Nd:YAG laser irradiation at four different scan speeds in order to improve the corrosion and wear resistance. The microstructure, corrosion and wear behavior of the laser surface alloyed material is reported in this manuscript. The coating comprised of a featureless microstructure with cellular-dendritic microstructure near the interface and exhibited good interfacial bonding. A few solidification cracks reaching down to substrate were also observed. The two step coating with Al followed by a mixture of Al and Al2O3 exhibited a slightly better corrosion resistance than the single step coating with Al. In the long run, however, corrosion resistance of both the coatings became comparable to the as-cast alloy. The corroded surface of the laser surface alloyed specimens revealed a highly localized corrosion. The laser surface alloyed specimens exhibited an improvement in wear resistance. The laser scan speed did not exhibit a monotonic trend either in corrosion or wear resistance.

A low power, process invariant keeper design for high speed dynamic logic circuits

A low power keeper circuit using the concept of rate sensing has been proposed. The proposed technique reduces the amount of short circuit power dissipation in the domino gate by 70% compared to the conventional keeper technique. Also the total power-delay product is 26% lower compared to the previously reported techniques. The process tracking capability of the design enables the domino gate to achieve uniform delay across different process corners. This reduces the amount of short circuit power dissipation that occurs in the cascaded domino gates by 90%. The use of the proposed technique in the read path of a register file reduces the energy requirement by 26% as compared to the other keeper techniques. The proposed technique has been prototyped in 130nm CMOS technology.