Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

Joint Power Control, Scheduling and Routing for Multihop Energy Harvesting Sensor Networks

We study wireless multihop energy harvesting sensor networks employed for random field estimation. The sensors sense the random field and generate data that is to be sent to a fusion node for estimation. Each sensor has an energy harvesting source and can operate in two modes: Wake and Sleep. We consider the problem of obtaining jointly optimal power control, routing and scheduling policies that ensure a fair utilization of network resources. This problem has a high computational complexity. Therefore, we develop a computationally efficient suboptimal approach to obtain good solutions to this problem. We study the optimal solution and performance of the suboptimal approach through some numerical examples.

Study Of The Hvdc-Torsional Interactions Through Digital Dynamic Simulation

This paper presents the detailed dynamic digital simulation for the study of phenomenon of torsional interaction between HVDC-Turbine generator shaft, dynamics using the novel converter model presented in [ 1 ] The system model includes detailed representation of the synchronous generator and the shaft dynamics, the ac and dc network transients. The results of a case study indicate the various factors that influence the torsional interaction.

The Mechanism Of The Hydrogen Abstraction Process By Photo-Excited Ketones

Qualitative potential energy surfaces for hydrogen abstraction from alkanes containing primary, secondary and tertiary C-H bonds by a photo-excited ketone have been reported, The results suggest that the activation barriers for these processes decrease in the order primary > secondary > tertiary in agreement with the observed trend in the rate constants. The analysis of the electronic structure of the transition-state reveal that electron-transfer from hydrocarbon to ketone and formation of a new bond are almost synchronous in the hydrogen transfer process. The tunneling of hydrogen is not important in the normal temperature region even though the barriers are small.

A Resonant Integrator Based PLL and AC Current Controller for Single Phase Grid Connected PWM-VSI

Grid connected PWM-VSIs are being increasingly used for applications such as Distributed Generation (DG), power quality, UPS etc. Appropriate control strategies for grid synchronisation and line current regulation are required to establish such a grid interconnection and power transfer. Control of three phase VSIs is widely reported in iterature. Conventionally, dq control in Synchronous Reference Frame(SRF) is employed for both PLL and line current control where PI-controllers are used to track the DC references. Single phase systems do not have defined direct (d) and quadrature (q) axis components that are required for SRF transformation. Thus, references are AC in nature and hence usage of PI controllers cannot yield zero steady state errors. Resonant controllers have the ability to track AC references accurately. In this work, a resonant controller based single phase PLL and current control technique are being employed for tracking grid frequency and the AC current reference respectively. A single phase full bridge converter is being operated as a STATCOM for performance evaluation of the control scheme.

Optimal explicit guidance of multistage launch vehicle along three-dimensional trajectory

Details of an efficient optimal closed-loop guidance algorithm for a three-dimensional launch are presented with simulation results. Two types of orbital injections, with either true anomaly or argument of perigee being free at injection, are considered. The resulting steering-angle profile under the assumption of uniform gravity lies in a canted plane which transforms a three-dimensional problem into an equivalent two-dimensional one. Effects of thrust are estimated using a series in a recursive way. Encke's method is used to predict the trajectory during powered flight and then to compute the changes due to actual gravity using two gravity-related vectors. Guidance parameters are evaluated using the linear differential correction method. Optimality of the algorithm is tested against a standard ground-based trajectory optimization package. The performance of the algorithm is tested for accuracy, robustness, and efficiency for a sun-synchronous mission involving guidance for a multistage vehicle that requires large pitch and yaw maneuver. To demonstrate applicability of the algorithm to a range of missions, injection into a geostationary transfer orbit is also considered. The performance of the present algorithm is found to be much better than others.

Concepts of Static Var System Control For Enhancing Power Transfer in Long Transmission Lines

This paper is concerned with the influence of different levels of complexity in modelling various constituent subsystems on the dynamic stability of power systems compensated by static var systems (SVS) operating on pure voltage control. The system components investigated include thyristor controlled reactor (TCR) transients, SVS delays, network transients, the synchronous generator and automatic voltage regulator (AVR). An overall model is proposed which adequately describes the system performance for small signal perturbations. The SVS performance is validated through detailed nonlinear simulation on a physical simulator.

Analyzing Cache Performance Bottlenecks of STM Applications and addressing them with Compiler's help

Software transactional memory (STM) is a promising programming paradigm for shared memory multithreaded programs as an alternative to traditional lock based synchronization. However adoption of STM in mainstream software has been quite low due to its considerable overheads and its poor cache/memory performance. In this paper, we perform a detailed study of the cache behavior of STM applications and quantify the impact of different STM factors on the cache misses experienced by the applications. Based on our analysis, we propose a compiler driven Lock-Data Colocation (LDC), targeted at reducing the cache overheads on STM. We show that LDC is effective in improving the cache behavior of STM applications by reducing the dcache miss latency and improving execution time performance.

NUcache: A Multicore Cache Organization Based on Next-Use Distance

In this work, we propose a new organization for the last level shared cache of a rnulticore system. Our design is based on the observation that the Next-Use distance, measured in terms of intervening misses between the eviction of a line and its next use, for lines brought in by a given delinquent PC falls within a predictable range of values. We exploit this correlation to improve the performance of shared caches in multi-core architectures by proposing the NUcache organization.

Post-transcriptional Repair of a Split Heat Shock Protein 90 Gene by mRNA trans-Splicing

Heat shock protein 90 participates in diverse biological processes ranging from protein folding, cell cycle, signal transduction and development to evolution in all eukaryotes. It is also critically involved in regulating growth of protozoa such as Dictyostelium discoideum, Leishmania donovani, Plasmodium falciparum, Trypanosoma cruzi, and Trypanosoma evansi. Selective inhibition of Hsp90 has also been explored as an intervention strategy against important human diseases such as cancer, malaria, or trypanosomiasis. Giardia lamblia, a simple protozoan parasite of humans and animals, is an important cause of diarrheal disease with significant morbidity and some mortality in tropical countries. Here we show that the G. lamblia cytosolic hsp90 ( glhsp90) is split in two similar sized fragments located 777 kb apart on the same scaffold. Intrigued by this unique arrangement, which appears to be specific for the Giardiinae, we have investigated the biosynthesis of GlHsp90. We used genome sequencing to confirm the split nature of the giardial hsp90. However, a specific antibody raised against the peptide detected a product with a mass of about 80 kDa, suggesting a post-transcriptional rescue of the genomic defect. We show evidence for the joining of the two independent Hsp90 transcripts in-trans to one long mature mRNA presumably by RNA splicing. The splicing junction carries hallmarks of classical cis-spliced introns, suggesting that the regular cis-splicing machinery may be sufficient for repair of the open reading frame. A complementary 26-nt sequence in the ``intron'' regions adjacent to the splice sites may assist in positioning the two pre-mRNAs for processing. This is the first example of post-transcriptional rescue of a split gene by trans-splicing.

Electro-magnetically Actuated Minute Polymer Pump Fabricated using Packaging Technology

Design, fabrication and preliminary testing of a flat pump with millimetre thickness are described in this paper. The pump is entirely made of polymer materials barring the magnet and copper coils used for electromagnetic actuation. The fabrication is carried out using widely available microelectronic packaging machinery and techniques. Therefore, the fabrication of the pump is straightforward and inexpensive. Two types of prototypes are designed and built. One consists of copper coils that are etched on an epoxy plate and the other has wound insulated wire of 90 mu m diameter to serve as a coil. The overall size of the first pump is 25 mm x 25 mm x 3.6 mm including the 3.1 mm-thick NdFeB magnet of diameter 12 mm. It consists of a pump chamber of 20 mm x 20 mm x 0.8 mm with copper coils etched from a copper-clad epoxy plate using dry-film lithography and milled using a CNC milling machine, two passive valves and the pump-diaphragm made of Kapton film of 0.089 mm thickness. The second pump has an overall size of 35 mm x 35 mm x 4.4 mm including the magnet and the windings. A breadboard circuit and DC power supply are used to test the pump by applying an alternating square-wave voltage pulse. A water slug in a tube attached to the inlet is used to observe and measure the air-flow induced by the pump against atmospheric pressure. The maximum flow rate was found to be 15 ml/min for a voltage of 2.5 V and a current of 19 mA at 68 Hz.

Stochastic Approximation Algorithms for Constrained Optimization via Simulation

We develop four algorithms for simulation-based optimization under multiple inequality constraints. Both the cost and the constraint functions are considered to be long-run averages of certain state-dependent single-stage functions. We pose the problem in the simulation optimization framework by using the Lagrange multiplier method. Two of our algorithms estimate only the gradient of the Lagrangian, while the other two estimate both the gradient and the Hessian of it. In the process, we also develop various new estimators for the gradient and Hessian. All our algorithms use two simulations each. Two of these algorithms are based on the smoothed functional (SF) technique, while the other two are based on the simultaneous perturbation stochastic approximation (SPSA) method. We prove the convergence of our algorithms and show numerical experiments on a setting involving an open Jackson network. The Newton-based SF algorithm is seen to show the best overall performance.

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.

Additive Spanners and (alpha, beta)-Spanners

An (alpha, beta)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of a and an additive term beta. It is well known that any graph contains a (multiplicative) (2k - 1, 0)-spanner of size O(n(1+1/k)) and an (additive) (1, 2)-spanner of size O(n(3/2)). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (alpha, beta)-spanners. Our first result is an additive (1, 6)-spanner of size O(n(4/3)). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (alpha, beta)-spanners can be computed efficiently, ideally in linear time. We show that, for any k, a (k, k - 1)-spanner with size O(kn(1+1/k)) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.