Molecular dynamics simulations on parallel and antiparallel C.G*G triplexes

Molecular dynamics (MD) studies have been carried out on the Hoogsteen hydrogen bonded parallel and the reverse Hoogsteen hydrogen banded antiparallel C.G*G triplexes. Earlier, the molecular mechanics studies had shown that the parallel structure was energetically more favourable than the antiparallel structure. To characterize the structural stability of the two triplexes and to investigate whether the antiparallel structure can transit to an energetically more favourable structure, due to the local fluctuations in the structure during the MD simulation, the two structures were subjected to 200ps of constant temperature vacuum MD simulations at 300K. Initially no constraints were applied to the structures and it was observed that for the antiparallel tripler, the structure showed a large root mean square deviation from the starting structure within the first 12ps and the N4-H41-O6 hydrogen bond in the WC duplex got distorted due to a high propeller twist and a moderate increase in the opening angle in the basepairs. Starting from an initial value of 30 degrees, helical twist of the average structure from this simulation had a value of 36 degrees, while the parallel structure stabilized at a twist of 33 degrees. In spite of the hydrogen bond distortions in the antiparallel tripler, it was energetically comparable to the parallel tripler. To examine the structural characteristics of an undistorted structure, another MD simulation was performed on the antiparallel tripler by constraining all the hydrogen bonds. This structure stabilized at an average twist of 33 degrees. In the course of the dynamics though the energy of the molecule - compared to the initial structure - improved, it did not become comparable to the parallel structure. Energy minimization studies performed in the presence of explicit water and counterions also showed the two structures to be equally favourable energetically Together these results indicate that the parallel C.G*G tripler with Hoogsteen hydrogen bonds also represents a stereochemically and energetically favourable structure for this class of triplexes.

A Cache coherence protocol for MIN-based multiprocessors

In this paper we present a cache coherence protocol for multistage interconnection network (MIN)-based multiprocessors with two distinct private caches: private-blocks caches (PCache) containing blocks private to a process and shared-blocks caches (SCache) containing data accessible by all processes. The architecture is extended by a coherence control bus connecting all shared-block cache controllers. Timing problems due to variable transit delays through the MIN are dealt with by introducing Transient states in the proposed cache coherence protocol. The impact of the coherence protocol on system performance is evaluated through a performance study of three phases. Assuming homogeneity of all nodes, a single-node queuing model (phase 3) is developed to analyze system performance. This model is solved for processor and coherence bus utilizations using the mean value analysis (MVA) technique with shared-blocks steady state probabilities (phase 1) and communication delays (phase 2) as input parameters. The performance of our system is compared to that of a system with an equivalent-sized unified cache and with a multiprocessor implementing a directory-based coherence protocol. System performance measures are verified through simulation.

Evaluation and improvement of generators reactive power margins in interconnected power systems

The amount of reactive power margin available in a system determines its proximity to voltage instability under normal and emergency conditions. More the reactive power margin, better is the systems security and vice-versa. A hypothetical way of improving the reactive margin of a synchronous generator is to reduce the real power generation within its mega volt-ampere (MVA) ratings. This real power generation reduction will affect its power contract agreements entered in the electricity market. Owing to this, the benefit that the generator foregoes will have to be compensated by paying them some lost opportunity cost. The objective of this study is three fold. Firstly, the reactive power margins of the generators are evaluated. Secondly, they are improved using a reactive power optimization technique and optimally placed unified power flow controllers. Thirdly, the reactive power capacity exchanges along the tie-lines are evaluated under base case and improved conditions. A detailed analysis of all the reactive power sources and sinks scattered throughout the network is carried out in the study. Studies are carried out on a real life, three zone, 72-bus equivalent Indian southern grid considering normal and contingency conditions with base case operating point and optimised results presented.

A Change in the 3(10)- to alpha-Helical Transition Point in the Heptapeptides Containing Sulfur and Selenium

Crystal structures of three heptapeptides Boc-Ala-Leu-Aib-XXX-Ala-Leu-Aib-OMe (where XXX = methionine in peptide A, selenomethionine in peptide B, and S-benzyl cysteine in peptide C) reveal mixed 3(10)-/alpha-helical conformations with R factors of 6.94, 5.79, and 5.98, respectively. All the structures were solved in the P2(1)2(1)2(1) space group. 3(10)- to a-helical transitions are observed in all of these peptides. The helices begin as a 3(10)-helical segment at the N-terminus and then transit for peptides A and C at residue Aib(3) carbonyl (O(3)), while for peptide B the transition occurs at residue Leu(2) carbonyl oxygen (O(2)). There are water molecules associated in the crystal of each of these peptides and they form different types of hydrogen bonding patterns in each crystal. The observations suggest that 3(10)- to alpha-helical transition is sequence dependent in these short heptapeptide sequences.

Mode shapes during asynchronous motion and non-proportionality indices

When synchronous motion does not exist, it is not possible to draw the classical mode shapes. In this paper, a representative shape of motion during free vibration of a non-classically damped system is sought. It is noted that this shape provides an optimal representation of free motion. Interpretations of the optimality thus introduced are presented. Their connection with non-proportionality of damping and of gyroscopy is brought out. In the spirit of the optimality presented in this paper, two indices of non-proportionality are defined. Properties of these indices are discussed. Comparison with other indices of non-proportionality available in the literature is presented. Illustrative examples are given. (C) 1999 Academic Press.

Performance issues of distance relays for shunt FACTS compensated transmission lines

In this paper, the performance of distance relays when applied to transmission system equipped with shunt FACTS device, Static Synchronous Compensator (STATCOM) is described. The aim of the proposed study is to evaluate the performance of distance relays when STATCOM is incorporated at the mid point of transmission lines for voltage control. A detailed model of STATCOM and its control strategy is presented. The presence of these devices significantly affects apparent impedance seen by the distance relays due to their rapid response to different power system configurations. The distance relay is evaluated for different loading conditions and for different fault locations. The faults are created during various pre-fault loading conditions. The studies are performed on 400KV and 132KV systems and the results are presented. Simulation studies are carried out using transient simulation software, PSCAD/EMTDC.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

The Borkar-Meyn theorem for asynchronous stochastic approximations

In this paper, we give a generalization of a result by Borkar and Meyn (2000) 1], on the stability and convergence of synchronous-update stochastic approximation algorithms, to the case of asynchronous stochastic approximations with delays. We then describe an interesting application of the result to asynchronous distributed temporal difference (TD) learning with function approximation and delays. (C) 2011 Elsevier B.V. All rights reserved.

On the fundamentally asynchronous nature of interference in cooperative base station systems

Cooperative transmission by base stations can significantly improve the spectral efficiency of multiuser, multi-cell multiple input multiple output systems. We show that in such systems the multiuser interference is asynchronous by nature, even when perfect timing-advance mechanisms ensure that the desired signal components arrive synchronously. We establish an accurate mathematical model for the asynchronism, and use it to show that the asynchronism leads to a significant performance degradation of existing linear preceding designs that assumed synchronous interference. We consider three different previously proposed precoding designs, and show how to modify them to effectively mitigate asynchronous interference.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.

Optimality of orthogonal sequences with multi-dimensional signaling

The sum capacity on a symbol-synchronous CDMA system having processing gain N and supporting K power constrained users is achieved by employing any set of N orthogonal sequences if a few users are allowed to signal along multiple dimensions. Analogously, the minimum received power (energy-per-chip) on the symbolsynchronous CDMA system supporting K users that demand specified data rates is attained by employing any set of N orthogonal sequences. At most (N - 1) users need to be split and if there are no oversized users, these split users need to signal only in two dimensions each. These results show that sum capacity or minimum sum power can be achieved with minimal downlink signaling.

Digital Deadbeat Control Tuning for dc-dc Converters Using Error Correlation

This letter proposes a simple tuning algorithm for digital deadbeat control based on error correlation. By injecting a square-wave reference input and calculating the correlation of the control error, a gain correction for deadbeat control is obtained. The proposed solution is simple, it requires a short tuning time, and it is suitable for different DC-DC converter topologies. Simulation and experimental results on synchronous buck converters confirm the properties of the proposed tuning algorithm.

A Novel VSI- and CSI-Fed Active-Reactive Induction Motor Drive with Sinusoidal Voltages and Currents

Till date load-commutated inverter (LCI)-fed synchronous motor drive configuration is popular in high power applications (>10 MW). The leading power factor operation of synchronous motor by excitation control offers this simple and rugged drive structure. On the contrary, LCI-fed induction motor drive is absent as it always draws lagging power factor current. Therefore, complicated commutation circuit is required to switch off thyristors for a current source inverter (CSI)-driven induction motor. It poses the major hindrance to scale up the power rating of CSI-fed induction motor drive. Anew power topology for LCI-fed induction motor drive for medium-voltage drive application is proposed. A new induction machine (active-reactive induction machine) with two sets of three-phase winding is introduced as a drive motor. The proposed power configuration ensures sinusoidal voltage and current at the motor terminals. The total drive power is shared among a thyristor-based LCI, an insulated gate bipolar transistor (IGBT)-based two-level voltage source inverter (VSI), and a three-level VSI. The benefits of SCRs and IGBTs are explored in the proposed drive. Experimental results from a prototype drive verify the basic concepts of the drive.

Switching Transients in Single-Phase Induction Motors

The subject of transients in polyphase induction motors and synchronous machines has been studied in very great detail by several investigators, but no published literature exists dealing exclusively with the analysis of the problem of transients in single-phase induction motors. This particular problem has been studied in this paper by applying the Laplace transform. The results of actual computation of the currents and developed electrical torque are compared with the data obtained by setting up the integro-differential equations of the machine on an electronic differential analyzer. It is shown that if the motor is switched on to the supply when the potential passes through its zero value, there is a pulsating fundamental frequency torque superimposed on the average steady-state unidirectional torque. If, on the other hand, the switch is closed when the applied potential passes through its maximum value, the developed electrical torque settles down to its final steady-state value during the first cycle of the supply voltage.

Improvement of power-system transient stability by phase-shift insertion

Computational studies of the transient stability of a synchronous machine connected to an infinite busbar by a double-circuit transmission line are used to illustrate the effect of relative phase-shift insertion between the machine and its associated power system. This method of obtaining a change in the effective rotor-excitation angle, and thereby the power transfer, is described, together with an outline of possible methods of implementation by a phase-shifting transformer in a power system.