Minimum switching loss pulse width modulation for reduced power conversion loss in reactive power compensators

Advanced bus-clamping switching sequences, which employ an active vector twice in a subcycle, are used to reduce line current distortion and switching loss in a space vector modulated voltage source converter. This study evaluates minimum switching loss pulse width modulation (MSLPWM), which is a combination of such sequences, for static reactive power compensator (STATCOM) application. It is shown that MSLPWM results in a significant reduction in device loss over conventional space vector pulse width modulation. Experimental verification is presented at different power levels of up to 150 kVA.

Anomalous power law decay in solvation dynamics of DNA: a mode coupling theory analysis of ion contribution

Several time dependent fluorescence Stokes shift (TDFSS) experiments have reported a slow power law decay in the hydration dynamics of a DNA molecule. Such a power law has neither been observed in computer simulations nor in some other TDFSS experiments. Here we observe that a slow decay may originate from collective ion contribution because in experiments DNA is immersed in a buffer solution, and also from groove bound water and lastly from DNA dynamics itself. In this work we first express the solvation time correlation function in terms of dynamic structure factors of the solution. We use mode coupling theory to calculate analytically the time dependence of collective ionic contribution. A power law decay in seen to originate from an interplay between long-range probe-ion direct correlation function and ion-ion dynamic structure factor. Although the power law decay is reminiscent of Debye-Falkenhagen effect, yet solvation dynamics is dominated by ion atmosphere relaxation times at longer length scales (small wave number) than in electrolyte friction. We further discuss why this power law may not originate from water motions which have been computed by molecular dynamics simulations. Finally, we propose several experiments to check the prediction of the present theoretical work.

Influence of sputter power on structural and electrical properties of TiO2 films for Al/TiO2/Si gate capacitors

Titanium dioxide (TiO2) thin films were deposited onto p-Si substrates held at room temperature by reactive Direct Current (DC) magnetron sputtering at various sputter powers in the range 80-200W. The as-deposited TiO2 films were annealed at a temperature of 1023K. The post-annealed films were characterized for crystallographic structure, chemical binding configuration, surface morphology and optical absorption. The electrical and dielectric properties of Al/TiO2/p-Si structure were determined from the capacitance-voltage and current-voltage characteristics. X-ray diffraction studies confirmed that the as-deposited films were amorphous in nature. After post-annealing at 1023K, the films formed at lower powers exhibited anatase phase, where as those deposited at sputter powers >160W showed the mixed anatase and rutile phases of TiO2. The surface morphology of the films varied significantly with the increase of sputter power. The electrical and dielectric properties on the air-annealed Al/TiO2/p-Si structures were studied. The effect of sputter power on the electrical and dielectric characteristics of the structure of Al/TiO2/p-Si (metal-insulator-semiconductor) was systematically investigated. Copyright (c) 2014 John Wiley & Sons, Ltd.

Coordination of Reactive Power in Grid-Connected Wind Farms for Voltage Stability Enhancement

This paper studies the feasibility of utilizing the reactive power of grid-connected variable-speed wind generators to enhance the steady-state voltage stability margin of the system. Allowing wind generators to work at maximum reactive power limit may cause the system to operate near the steady-state stability limit, which is undesirable. This necessitates proper coordination of reactive power output of wind generators with other reactive power controllers in the grid. This paper presents a trust region framework for coordinating reactive output of wind generators-with other reactive sources for voltage stability enhancement. Case studies on 418-bus equivalent system of Indian southern grid indicates the effectiveness of proposed methodology in enhancing the steady-state voltage stability margin.

Universal power law in crossover from integrability to quantum chaos

We study models of interacting fermions in one dimension to investigate the crossover from integrability to nonintegrability, i.e., quantum chaos, as a function of system size. Using exact diagonalization of finite-sized systems, we study this crossover by obtaining the energy level statistics and Drude weight associated with transport. Our results reinforce the idea that for system size L -> infinity nonintegrability sets in for an arbitrarily small integrability-breaking perturbation. The crossover value of the perturbation scales as a power law similar to L-eta when the integrable system is gapless. The exponent eta approximate to 3 appears to be robust to microscopic details and the precise form of the perturbation. We conjecture that the exponent in the power law is characteristic of the random matrix ensemble describing the nonintegrable system. For systems with a gap, the crossover scaling appears to be faster than a power law.

Solar thermal power system augmented with LHP

The present work reports the study of the bubble formation dynamics in the compensation chamber (CC) of the evaporator in Loop Heat Pipes. A series of experiments were conducted at different heat loads and bubbles in the CC were visualized. Bubbles diameter, frequency and velocity were measured and correlated against heat loads. Temperatures were measured at various locations and heat transfer coefficient was calculated. Performance of the LHP evaporator was evaluated at different heat loads. (C) 2013 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license

Comparison of CO2 and steam in transcritical Rankine cycles for concentrated solar power

High temperature, high pressure transcritical condensing CO2 cycle (TC-CO2) is compared with transcritical steam (TC-steam) cycle. Performance indicators such as thermal efficiency, volumetric flow rates and entropy generation are used to analyze the power cycle wherein, irreversibilities in turbo-machinery and heat exchangers are taken into account. Although, both cycles yield comparable thermal efficiencies under identical operating conditions, TC-CO2 plant is significantly compact compared to a TC-steam plant. Large specific volume of steam is responsible for a bulky system. It is also found that the performance of a TC-CO2 cycle is less sensitive to source temperature variations, which is an important requirement of a solar thermal system. In addition, issues like wet expansion in turbine and vacuum in condenser are absent in case of a TC-CO2 cycle. External heat addition to working fluid is assumed to take place through a heat transfer fluid (HTF) which receives heat from a solar receiver. A TC-CO2 system receives heat though a single HTF loop, whereas, for TC-steam cycle two HTF loops in series are proposed to avoid high temperature differential between the steam and HTF. (C) 2013 P. Garg. Published by Elsevier Ltd.

Interference-Constrained Optimal Power-Adaptive Amplify-and-Forward Relaying and Selection for Underlay Cognitive Radios

In an underlay cognitive radio (CR) system, a secondary user can transmit when the primary is transmitting but is subject to tight constraints on the interference it causes to the primary receiver. Amplify-and-forward (AF) relaying is an effective technique that significantly improves the performance of a CR by providing an alternate path for the secondary transmitter's signal to reach the secondary receiver. We present and analyze a novel optimal relay gain adaptation policy (ORGAP) in which the relay is interference aware and optimally adapts both its gain and transmit power as a function of its local channel gains. ORGAP minimizes the symbol error probability at the secondary receiver subject to constraints on the average relay transmit power and on the average interference caused to the primary. It is different from ad hoc AF relaying policies and serves as a new and fundamental theoretical benchmark for relaying in an underlay CR. We also develop a near-optimal and simpler relay gain adaptation policy that is easy to implement. An extension to a multirelay scenario with selection is also developed. Our extensive numerical results for single and multiple relay systems quantify the power savings achieved over several ad hoc policies for both MPSK and MQAM constellations.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

2-Connecting outerplanar graphs without blowing up the pathwidth

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl 1], in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two-dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl 1] for 2-vertex-connected outerplanar graphs will work for all outer planar graphs. (C) 2014 Elsevier B.V. All rights reserved.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

Optimal Binary Power Control for Underlay CR With Different Interference Constraints and Impact of Channel Estimation Errors

Adapting the power of secondary users (SUs) while adhering to constraints on the interference caused to primary receivers (PRxs) is a critical issue in underlay cognitive radio (CR). This adaptation is driven by the interference and transmit power constraints imposed on the secondary transmitter (STx). Its performance also depends on the quality of channel state information (CSI) available at the STx of the links from the STx to the secondary receiver and to the PRxs. For a system in which an STx is subject to an average interference constraint or an interference outage probability constraint at each of the PRxs, we derive novel symbol error probability (SEP)-optimal, practically motivated binary transmit power control policies. As a reference, we also present the corresponding SEP-optimal continuous transmit power control policies for one PRx. We then analyze the robustness of the optimal policies when the STx knows noisy channel estimates of the links between the SU and the PRxs. Altogether, our work develops a holistic understanding of the critical role played by different transmit and interference constraints in driving power control in underlay CR and the impact of CSI on its performance.

Performance Assessment of a Small Biogas-fuelled Power Generator Prototype

This study reports the development and performance evaluation of prototypes of biogas-fuelled stationary power generators in the range of 1 kW. Strategies to achieve high engine efficiency namely pulsed manifold injection, electronic throttle control and dual spark plugs, have been incorporated in the prototype. A complete closed-loop control of the engine operation to maintain a steady engine speed of 3000 rpm (+/- 5%) across the entire load range while maintaining an optimum fuel-air equivalence ratio is made possible by an electronic control unit (ECU) controlling the injection duration, ignition timing and throttle position. This study specifically focuses on the response of the generator to transient loads, and the overall efficiency obtained. The results obtained from testing the prototype have been found to be satisfactory and show that biogas power generators for low power applications can be made efficient (overall efficiency of 19% at electrical load of 640 W) using the strategies of biogas fuel injection.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.