Coupling of High Voltage AC Power Line Fields to Metallic Pipelines

In the recent years, there has been a trend to run metallic pipelines carrying petroleum products and high voltage AC power lines parallel to each other in a relatively narrow strip of land. Due to this sharing of the right-of-way, verhead AC power line electric field may induce voltages on the metallic pipelines running in close vicinity leading to serious adverse effects. In this paper, the induced voltages on metallic pipelines running in close vicinity of high voltage power transmission lines have been computed. Before computing the induced voltages, an optimum configuration of the phase conductors based on the lowest conductor surface gradient and field under transmission line has been arrived at. This paper reports the conductor surface field gradients calculated for the various configurations. Also the electric fields under transmission line, for single circuit and double circuit (various phase arrangements) have been analyzed. Based on the above results, an optimum configuration giving the lowest field under the power line as well as the lowest conductor surface gradient has been arrived at and for this configuration, induced voltage on the pipeline has been computed using the Charge Simulation Method (CSM). For comparison, induced voltages on the pipeline has been computed for the various other phase configurations also.

Influence of Gate Corrugations on the Performance of Thin-Film Transistors

This letter investigates the influence of a corrugated gate on the transfer characteristics of thin-film transistors. Corrugations that run parallel to the length of the channel from source to drain are patterned on the gate. The author finds that these corrugations result in higher currents as compared to conventional planar-gate transistors.

A power scalable receiver front-end at 2.4 GHz

We propose a Low Noise Amplifier (LNA) architecture for power scalable receiver front end (FE) for Zigbee. The motivation for power scalable receiver is to enable minimum power operation while meeting the run-time performance needed. We use simple models to find empirical relations between the available signal and interference levels to come up with required Noise Figure (NF) and 3rd order Intermodulation Product (IIP3) numbers. The architecture has two independent digital knobs to control the NF and IIP3. Acceptable input match while using adaptation has been achieved by using an Active Inductor configuration for the source degeneration inductor of the LNA. The low IF receiver front end (LNA with I and Q mixers) was fabricated in 130nm RFCMOS process and tested.

Reactive pulsed laser deposition and characterization of niobium nitride thin films

We present a systematic study to explore the effect of important process variables on the composition and structure of niobium nitride thin films synthesized by Reactive Pulsed Laser Deposition (RPLD) technique through ablation of high purity niobium target in the presence of low pressure nitrogen gas. Secondary Ion Mass Spectrometry has been used in a unique way to study and fix gas pressure, substrate temperature and laser fluence, in order to obtain optimized conditions for one variable in single experimental run. The x-ray diffraction and electron microscopic characterization have been complemented by proton elastic backscattering spectroscopy and x-ray photoelectron spectroscopy to understand the incorporation of oxygen and associated non-stoichiometry in the metal to nitrogen ratio. The present study demonstrates that RPLD can be used for obtaining thin film architectures using non-equilibrium processing. Finally the optimized NbN thin films were characterized for their hardness using nano-indentation technique and found to be similar to 30 GPa at the deposition pressure of 8 Pa. (C) 2011 Elsevier B.V. All rights reserved.

Mechanisms of summer intraseasonal sea surface temperature oscillations in the Bay of Bengal

Intraseasonal variations (ISV) of sea surface temperature (SST) in the Bay of Bengal (BoB) is highest in its northwestern part. An Indian Ocean model forced by QuikSCAT winds and climatological river discharge (QR run) reproduces ISV of SST, albeit with weaker magnitude. Air-sea fluxes, in the presence of a shallow mixed layer, efficiently effect intraseasonal SST fluctuations. Warming during intraseasonal events is smaller (<1°C) for June - July period and larger (1.5° to 2°C) during September, the latter due to a thinner mixed layer. To examine the effect of salinity on ISV, the model was run by artificially increasing the salinity (NORR run) and by decreasing it (MAHA10 run). In NORR, both rainfall and river discharge were switched off and in MAHA10 the discharge by river Mahanadi was increased tenfold. The spatial pattern of ISV as well as its periodicity was similar in QR, NORR and MAHA10. The ISV was stronger in NORR and weaker in MAHA10, compared to QR. In NORR, both intraseasonal warming and cooling were higher than in QR, the former due to reduced air-sea heat loss as the mean SST was lower, and the latter due to enhanced subsurface processes resulting from weaker stratification. In MAHA10, both warming and cooling were lower than in QR, the former due to higher air-sea heat loss owing to higher mean SST, and the latter due to weak subsurface processes resulting from stronger stratification. These model experiments suggest that salinity effects are crucial in determining amplitudes of intraseasonal SST variations in the BoB.

Synthesis, Reactivity Studies, Structural Aspects, and Solution Behavior of Half Sandwich Ruthenium(II) N,N `,N `'-Triarylguanidinate Complexes

[(eta(6)-C(10)H(14))RuCl(mu-Cl)](2) (eta(6)-C(10)H(14) = eta(6)-p-cymene) was subjected to a bridge-splitting reaction with N,N',N `'-triarylguanidines, (ArNH)(2)C=NAr, in toluene at ambient temperature to afford [(eta(6)-C(10)H(14))RuCl{kappa(2)(N,N')((ArN)(2)C-N(H)Ar)}] (Ar = C(6)H(4)Me-4 (1), C(6)H(4)(OMe)-2 (2), C(6)H(4)Me-2 (3), and C(6)H(3)Me(2)-2,4 (4)) in high yield with a view aimed at understanding the influence of substituent(s) on the aryl rings of the guanidine upon the solid-state structure, solution behavior, and reactivity pattern of the products. Complexes 1-3 upon reaction with NaN(3) in ethanol at ambient temperature afforded [(eta(6)-C(10)H(14))RuN(3){kappa(2)(N,N')((ArN)(2)C-N(H)Ar)}] (Ar = C(6)H(4)Me-4 (5), C(6)H(4)(OMe)-2 (6), and C(6)H(4)Me-2 (7)) in high yield. [3 + 2] cycloaddition reaction of 5-7 with RO(O)C-C C-C(O)OR (R = Et (DEAD) and Me (DMAD)) (diethylacetylenedicarboxylate, DEAD; dimethylacetylenedicarboxylate, DMAD) in CH(2)Cl(2) at ambient temperature afforded [(eta(6)-C(10)H(14))Ru{N(3)C(2)(C(O)OR)(2)}{kappa(2)(N,N')((ArN)(2) C-N(H)Ar)}center dot xH(2)O (x = 1, R = Et, Ar = C(6)H(4)Me-4 (8 center dot H(2)O); x = 0, R = Me, Ar = C(6)H(4)(OMe)-2 (9), and C(6)H(4)Me-2 (10)) in moderate yield. The molecular structures of 1-6, 8 center dot H(2)O, and 10 were determined by single crystal X-ray diffraction data. The ruthenium atom in the aforementioned complexes revealed pseudo octahedral ``three legged piano stool'' geometry. The guanidinate ligand in 2, 3, and 6 revealed syn-syn conformation and that in 4, and 10 revealed syn-anti conformation, and the conformational difference was rationalized on the basis of subtle differences in the stereochemistry of the coordinated nitrogen atoms caused by the aryl moiety in 3 and 4 or steric overload caused by the substituents around the ruthenium atom in 10. The bonding pattern of the CN(3) unit of the guanidinate ligand in the new complexes was explained by invoking n-pi conjugation involving the interaction of the NHAr/N(coord)Ar lone pair with C=N pi* orbital of the imine unit. Complexes 1, 2, 5, 6, 8 center dot H(2)O, and 9 were shown to exist as a single isomer in solution as revealed by NMR data, and this was ascribed to a fast C-N(H)Ar bond rotation caused by a less bulky aryl moiety in these complexes. In contrast, 3 and 10 were shown to exist as a mixture of three and five isomers in about 1:1:1 and 1.0:1.2:2:7:3.5:6.9 ratios, respectively in solution as revealed by a VT (1)H NMR, (1)H-(1)H COSY in conjunction with DEPT-90 (13)C NMR data measured at 233 K in the case of 3. The multiple number of isomers in solution was ascribed to the restricted C-N(H)(o-tolyl) bond rotation caused by the bulky o-tolyl substituent in 3 or the aforementioned restricted C-NH(o-tolyl) bond rotation as well as the restricted ruthenium-arene(centroid) bond rotation caused by the substituents around the ruthenium atom in 10.

Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation

Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an optimizing compiler, they do not succeed many a time due to limited knowledge of run-time data. In this paper we examine instruction reuse of integer ALU and load instructions in network processing applications. Specifically, this paper attempts to answer the following questions: (1) How much of instruction reuse is inherent in network processing applications?, (2) Can reuse be improved by reducing interference in the reuse buffer?, (3) What characteristics of network applications can be exploited to improve reuse?, and (4) What is the effect of reuse on resource contention and memory accesses? We propose an aggregation scheme that combines the high-level concept of network traffic i.e. "flows" with a low level microarchitectural feature of programs i.e. repetition of instructions and data along with an architecture that exploits temporal locality in incoming packet data to improve reuse. We find that for the benchmarks considered, 1% to 50% of instructions are reused while the speedup achieved varies between 1% and 24%. As a side effect, instruction reuse reduces memory traffic and can therefore be considered as a scheme for low power.

Traffic Profiling for Efficient Network Resource Utilization.

Traffic Engineering has been the prime concern for Internet Service Providers (ISPs), with the main focus being minimization of over-utilization of network capacity even though additional capacity is available which is under-utilized, Furthermore, requirements of timely delivery of digitized audiovisual information raises a new challenge of finding a path meeting these requirements. This paper addresses the issue of (a) distributing load to achieve global efficiency in resource utilization. (b) Finding a path satisfying the real time requirements of, delay and bandwidth requested by the applications. In this paper we do a critical study of the link utilization that varies over time and determine the time interval during which the link occupancy remains constant across days. This information helps in pre-determining link utilization that is useful in balancing load in the network Finally, we run simulations that use a dynamic time interval for profiling traffic and show improvement in terms number of calls admitted/blocked.

A Five-Level Inverter Topology with Single-DC Supply by Cascading a Flying Capacitor Inverter and an H-Bridge

In this paper, a new three-phase, five-level inverter topology with a single-dc source is presented. The proposed topology is obtained by cascading a three-level flying capacitor inverter with a flying H-bridge power cell in each phase. This topology has redundant switching states for generating different pole voltages. By selecting appropriate switching states, the capacitor voltages can be balanced instantaneously (as compared to the fundamental) in any direction of the current, irrespective of the load power factor. Another important feature of this topology is that if any H-bridge fails, it can be bypassed and the configuration can still operate as a three-level inverter at its full power rating. This feature improves the reliability of the circuit. A 3-kW induction motor is run with the proposed topology for the full modulation range. The effectiveness of the capacitor balancing algorithm is tested for the full range of speed and during the sudden acceleration of the motor.

Monsoon Regimes and Processes in CCSM4. Part I: The Asian-Australian Monsoon

The simulation characteristics of the Asian-Australian monsoon are documented for the Community Climate System Model, version 4 (CCSM4). This is the first part of a two part series examining monsoon regimes in the global tropics in the CCSM4. Comparisons are made to an Atmospheric Model Intercomparison Project (AMIP) simulation of the atmospheric component in CCSM4 Community Atmosphere Model, version 4, (CAM4)] to deduce differences in the monsoon simulations run with observed sea surface temperatures (SSTs) and with ocean-atmosphere coupling. These simulations are also compared to a previous version of the model (CCSM3) to evaluate progress. In general, monsoon rainfall is too heavy in the uncoupled AMIP run with CAM4, and monsoon rainfall amounts are generally better simulated with ocean coupling in CCSM4. Most aspects of the Asian-Australian monsoon simulations are improved in CCSM4 compared to CCSM3. There is a reduction of the systematic error of rainfall over the tropical Indian Ocean for the South Asian monsoon, and well-simulated connections between SSTs in the Bay of Bengal and regional South Asian monsoon precipitation. The pattern of rainfall in the Australian monsoon is closer to observations in part because of contributions from the improvements of the Indonesian Throughflow and diapycnal diffusion in CCSM4. Intraseasonal variability of the Asian-Australian monsoon is much improved in CCSM4 compared to CCSM3 both in terms of eastward and northward propagation characteristics, though it is still somewhat weaker than observed. An improved simulation of El Nino in CCSM4 contributes to more realistic connections between the Asian-Australian monsoon and El Nino-Southern Oscillation (ENSO), though there is considerable decadal and century time scale variability of the strength of the monsoon-ENSO connection.

An Online Actor-Critic Algorithm with Function Approximation for Constrained Markov Decision Processes

We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.

MPI-based parallel synchronous vector evaluated particle swarm optimization for multi-objective design optimization of composite structures

This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.

Statistical Methods for Accelerated Life Testing with Particular Reference to Resin Impregnated Paper Bushings

Electrical failure of insulation is known to be an extremal random process wherein nominally identical pro-rated specimens of equipment insulation, at constant stress fail at inordinately different times even under laboratory test conditions. In order to be able to estimate the life of power equipment, it is necessary to run long duration ageing experiments under accelerated stresses, to acquire and analyze insulation specific failure data. In the present work, Resin Impregnated Paper (RIP) a relatively new insulation system of choice used in transformer bushings, is taken as an example. The failure data has been processed using proven statistical methods, both graphical and analytical. The physical model governing insulation failure at constant accelerated stress has been assumed to be based on temperature dependent inverse power law model.

Virtually cool ternary content addressable memory

Fast content addressable data access mechanisms have compelling applications in today's systems. Many of these exploit the powerful wildcard matching capabilities provided by ternary content addressable memories. For example, TCAM based implementations of important algorithms in data mining been developed in recent years; these achieve an an order of magnitude speedup over prevalent techniques. However, large hardware TCAMs are still prohibitively expensive in terms of power consumption and cost per bit. This has been a barrier to extending their exploitation beyond niche and special purpose systems. We propose an approach to overcome this barrier by extending the traditional virtual memory hierarchy to scale up the user visible capacity of TCAMs while mitigating the power consumption overhead. By exploiting the notion of content locality (as opposed to spatial locality), we devise a novel combination of software and hardware techniques to provide an abstraction of a large virtual ternary content addressable space. In the long run, such abstractions enable applications to disassociate considerations of spatial locality and contiguity from the way data is referenced. If successful, ideas for making content addressability a first class abstraction in computing systems can open up a radical shift in the way applications are optimized for memory locality, just as storage class memories are soon expected to shift away from the way in which applications are typically optimized for disk access locality.

Reuse, recycle to de-bloat software

Most Java programmers would agree that Java is a language that promotes a philosophy of “create and go forth”. By design, temporary objects are meant to be created on the heap, possibly used and then abandoned to be collected by the garbage collector. Excessive generation of temporary objects is termed “object churn” and is a form of software bloat that often leads to performance and memory problems. To mitigate this problem, many compiler optimizations aim at identifying objects that may be allocated on the stack. However, most such optimizations miss large opportunities for memory reuse when dealing with objects inside loops or when dealing with container objects. In this paper, we describe a novel algorithm that detects bloat caused by the creation of temporary container and String objects within a loop. Our analysis determines which objects created within a loop can be reused. Then we describe a source-to-source transformation that efficiently reuses such objects. Empirical evaluation indicates that our solution can reduce upto 40% of temporary object allocations in large programs, resulting in a performance improvement that can be as high as a 20% reduction in the run time, specifically when a program has a high churn rate or when the program is memory intensive and needs to run the GC often.