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.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

An automated approach to network features of protein structure ensembles

Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone-efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user-friendly, standalone program package named PSN-Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X-ray structures. The novelty in network construction lies in the explicit consideration of side-chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long-range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross-correlation/interaction energy in PSN-Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN-Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin-conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN-Ensemble for single-static structures of active/inactive states of 2-adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN-Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN-Ensemble/psn_index.html.

A Quick-Simulation Tool for Induction Motor Drives Controlled Using Advanced Space-Vector-Based PWM Techniques

Space-vector-based pulse width modulation (PWM) for a voltage source inverter (VSI) offers flexibility in terms of different switching sequences. Numerical simulation is helpful to assess the performance of a PWM method before actual implementation. A quick-simulation tool to simulate a variety of space-vector-based PWM strategies for a two-level VSI-fed squirrel cage induction motor drive is presented. The simulator is developed using C and Python programming languages, and has a graphical user interface (GUI) also. The prime focus being PWM strategies, the simulator developed is 40 times faster than MATLAB in terms of the actual time taken for a simulation. Simulation and experimental results are presented on a 5-hp ac motor drive.

On existence of periodic solutions for stable interval plants with odd, sector type nonlinearities

In several systems, the physical parameters of the system vary over time or operating points. A popular way of representing such plants with structured or parametric uncertainties is by means of interval polynomials. However, ensuring the stability of such systems is a robust control problem. Fortunately, Kharitonov's theorem enables the analysis of such interval plants and also provides tools for design of robust controllers in such cases. The present paper considers one such case, where the interval plant is connected with a timeinvariant, static, odd, sector type nonlinearity in its feedback path. This paper provides necessary conditions for the existence of self sustaining periodic oscillations in such interval plants, and indicates a possible design algorithm to avoid such periodic solutions or limit cycles. The describing function technique is used to approximate the nonlinearity and subsequently arrive at the results. Furthermore, the value set approach, along with Mikhailov conditions, are resorted to in providing graphical techniques for the derivation of the conditions and subsequent design algorithm of the controller.

A Vision-Based Micro-Newton Static Force Sensor Using a Displacement-Amplifying Compliant Mechanism (DaCM)

A micro-newton static force sensor is presented here as a packaged product. The sensor, which is based on the mechanics of deformable objects, consists of a compliant mechanism that amplifies the displacement caused by the force that is to be measured. The output displacement, captured using a digital microscope and analyzed using image processing techniques, is used to calculate the force using precalibrated force-displacement curve. Images are scanned in real time at a frequency of 15 frames per second and sampled at around half the scanning frequency. The sensor was built, packaged, calibrated, and tested. It has simulated and measured stiffness values of 2.60N/m and 2.57N/m, respectively. The smallest force it can reliably measure in the presence of noise is about 2 mu N over a range of 1.4mN. The off-the-shelf digital microscope aside, all of its other components are purely mechanical; they are inexpensive and can be easily made using simple machines. Another highlight of the sensor is that its movable and delicate components are easily replaceable. The sensor can be used in aqueous environment as it does not use electric, magnetic, thermal, or any other fields. Currently, it can only measure static forces or forces that vary at less than 1Hz because its response time and bandwidth are limited by the speed of imaging with a camera. With a universal serial bus (USB) connection of its digital microscope, custom-developed graphical user interface (GUI), and related software, the sensor is fully developed as a readily usable product.

GPU-based normalized cuts for road extraction using satellite imagery

This paper presents a GPU implementation of normalized cuts for road extraction problem using panchromatic satellite imagery. The roads have been extracted in three stages namely pre-processing, image segmentation and post-processing. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, vegetation,. and fallow regions). The road regions are then extracted using the normalized cuts algorithm. Normalized cuts algorithm is a graph-based partitioning `approach whose focus lies in extracting the global impression (perceptual grouping) of an image rather than local features. For the segmented image, post-processing is carried out using morphological operations - erosion and dilation. Finally, the road extracted image is overlaid on the original image. Here, a GPGPU (General Purpose Graphical Processing Unit) approach has been adopted to implement the same algorithm on the GPU for fast processing. A performance comparison of this proposed GPU implementation of normalized cuts algorithm with the earlier algorithm (CPU implementation) is presented. From the results, we conclude that the computational improvement in terms of time as the size of image increases for the proposed GPU implementation of normalized cuts. Also, a qualitative and quantitative assessment of the segmentation results has been projected.

Design of an Automated Dispenser Unit

This paper presents our work on developing an automated micro positioner and a low cost disposable dispenser module having a disposable dispenser core. The dispenser core is made up of Polydimethylsiloxane (PDMS). Once the user specifies the dispensing location in the Graphical User Interface (GUI), the movement of the micropositioner is automatic. The design, fabrication and characterization results of the dispenser module are also presented. The dispensing experiments are performed with Di-Ethanol Amine as the working reagent. The minimum dispensed volume achieved is about 4 nL.

Colored polydimethylsiloxane micropillar arrays for high throughput measurements of forces applied by genetic model organisms

Measuring forces applied by multi-cellular organisms is valuable in investigating biomechanics of their locomotion. Several technologies have been developed to measure such forces, for example, strain gauges, micro-machined sensors, and calibrated cantilevers. We introduce an innovative combination of techniques as a high throughput screening tool to assess forces applied by multiple genetic model organisms. First, we fabricated colored Polydimethylsiloxane (PDMS) micropillars where the color enhances contrast making it easier to detect and track pillar displacement driven by the organism. Second, we developed a semiautomated graphical user interface to analyze the images for pillar displacement, thus reducing the analysis time for each animal to minutes. The addition of color reduced the Young's modulus of PDMS. Therefore, the dye-PDMS composite was characterized using Yeoh's hyperelastic model and the pillars were calibrated using a silicon based force sensor. We used our device to measure forces exerted by wild type and mutant Caenorhabditis elegans moving on an agarose surface. Wild type C. elegans exert an average force of similar to 1 mu N on an individual pillar and a total average force of similar to 7.68 mu N. We show that the middle of C. elegans exerts more force than its extremities. We find that C. elegans mutants with defective body wall muscles apply significantly lower force on individual pillars, while mutants defective in sensing externally applied mechanical forces still apply the same average force per pillar compared to wild type animals. Average forces applied per pillar are independent of the length, diameter, or cuticle stiffness of the animal. We also used the device to measure, for the first time, forces applied by Drosophila melanogaster larvae. Peristaltic waves occurred at 0.4Hz applying an average force of similar to 1.58 mu N on a single pillar. Our colored microfluidic device along with its displacement tracking software allows us to measure forces applied by multiple model organisms that crawl or slither to travel through their environment. (C) 2015 AIP Publishing LLC.

THREE-LAYER FLUID FLOW OVER A SMALL OBSTRUCTION ON THE BOTTOM OF A CHANNEL

Many boundary value problems occur in a natural way while studying fluid flow problems in a channel. The solutions of two such boundary value problems are obtained and analysed in the context of flow problems involving three layers of fluids of different constant densities in a channel, associated with an impermeable bottom that has a small undulation. The top surface of the channel is either bounded by a rigid lid or free to the atmosphere. The fluid in each layer is assumed to be inviscid and incompressible, and the flow is irrotational and two-dimensional. Only waves that are stationary with respect to the bottom profile are considered in this paper. The effect of surface tension is neglected. In the process of obtaining solutions for both the problems, regular perturbation analysis along with a Fourier transform technique is employed to derive the first-order corrections of some important physical quantities. Two types of bottom topography, such as concave and convex, are considered to derive the profiles of the interfaces. We observe that the profiles are oscillatory in nature, representing waves of variable amplitude with distinct wave numbers propagating downstream and with no wave upstream. The observations are presented in tabular and graphical forms.

Evaluating Methods to Predict Streamflow at Ungauged Sites using Regional Flow Duration Curves: A Case Study

Precise information on streamflows is of major importance for planning and monitoring of water resources schemes related to hydro power, water supply, irrigation, flood control, and for maintaining ecosystem. Engineers encounter challenges when streamflow data are either unavailable or inadequate at target locations. To address these challenges, there have been efforts to develop methodologies that facilitate prediction of streamflow at ungauged sites. Conventionally, time intensive and data exhaustive rainfall-runoff models are used to arrive at streamflow at ungauged sites. Most recent studies show improved methods based on regionalization using Flow Duration Curves (FDCs). A FDC is a graphical representation of streamflow variability, which is a plot between streamflow values and their corresponding exceedance probabilities that are determined using a plotting position formula. It provides information on the percentage of time any specified magnitude of streamflow is equaled or exceeded. The present study assesses the effectiveness of two methods to predict streamflow at ungauged sites by application to catchments in Mahanadi river basin, India. The methods considered are (i) Regional flow duration curve method, and (ii) Area Ratio method. The first method involves (a) the development of regression relationships between percentile flows and attributes of catchments in the study area, (b) use of the relationships to construct regional FDC for the ungauged site, and (c) use of a spatial interpolation technique to decode information in FDC to construct streamflow time series for the ungauged site. Area ratio method is conventionally used to transfer streamflow related information from gauged sites to ungauged sites. Attributes that have been considered for the analysis include variables representing hydrology, climatology, topography, land-use/land- cover and soil properties corresponding to catchments in the study area. Effectiveness of the presented methods is assessed using jack knife cross-validation. Conclusions based on the study are presented and discussed. (C) 2015 The Authors. Published by Elsevier B.V.

An alternative approach to study nonlinear inviscid flow over arbitrary bottom topography

This paper deals with a new approach to study the nonlinear inviscid flow over arbitrary bottom topography. The problem is formulated as a nonlinear boundary value problem which is reduced to a Dirichlet problem using certain transformations. The Dirichlet problem is solved by applying Plemelj-Sokhotski formulae and it is noticed that the solution of the Dirichlet problem depends on the solution of a coupled Fredholm integral equation of the second kind. These integral equations are solved numerically by using a modified method. The free-surface profile which is unknown at the outset is determined. Different kinds of bottom topographies are considered here to study the influence of bottom topography on the free-surface profile. The effects of the Froude number and the arbitrary bottom topography on the free-surface profile are demonstrated in graphical forms for the subcritical flow. Further, the nonlinear results are validated with the results available in the literature and compared with the results obtained by using linear theory. (C) 2015 Elsevier Inc. All rights reserved.

Streaming covariance selection with applications to adaptive querying in sensor networks

Sensor networks can be naturally represented as graphical models, where the edge set encodes the presence of sparsity in the correlation structure between sensors. Such graphical representations can be valuable for information mining purposes as well as for optimizing bandwidth and battery usage with minimal loss of estimation accuracy. We use a computationally efficient technique for estimating sparse graphical models which fits a sparse linear regression locally at each node of the graph via the Lasso estimator. Using a recently suggested online, temporally adaptive implementation of the Lasso, we propose an algorithm for streaming graphical model selection over sensor networks. With battery consumption minimization applications in mind, we use this algorithm as the basis of an adaptive querying scheme. We discuss implementation issues in the context of environmental monitoring using sensor networks, where the objective is short-term forecasting of local wind direction. The algorithm is tested against real UK weather data and conclusions are drawn about certain tradeoffs inherent in decentralized sensor networks data analysis. © 2010 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

Sequential decision making in general state space models

Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical solutions and has to resort to approximation. In this thesis, we have investigated problems where Sequential Monte Carlo (SMC) methods can be combined with a gradient based search to provide solutions to online optimisation problems. We summarise the main contributions of the thesis as follows. Chapter 4 focuses on solving the sensor scheduling problem when cast as a controlled Hidden Markov Model. We consider the case in which the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. In sensor scheduling, our aim is to minimise the variance of the estimation error of the hidden state with respect to the action sequence. We present a novel SMC method that uses a stochastic gradient algorithm to find optimal actions. This is in contrast to existing works in the literature that only solve approximations to the original problem. In Chapter 5 we presented how an SMC can be used to solve a risk sensitive control problem. We adopt the use of the Feynman-Kac representation of a controlled Markov chain flow and exploit the properties of the logarithmic Lyapunov exponent, which lead to a policy gradient solution for the parameterised problem. The resulting SMC algorithm follows a similar structure with the Recursive Maximum Likelihood(RML) algorithm for online parameter estimation. In Chapters 6, 7 and 8, dynamic Graphical models were combined with with state space models for the purpose of online decentralised inference. We have concentrated more on the distributed parameter estimation problem using two Maximum Likelihood techniques, namely Recursive Maximum Likelihood (RML) and Expectation Maximization (EM). The resulting algorithms can be interpreted as an extension of the Belief Propagation (BP) algorithm to compute likelihood gradients. In order to design an SMC algorithm, in Chapter 8 uses a nonparametric approximations for Belief Propagation. The algorithms were successfully applied to solve the sensor localisation problem for sensor networks of small and medium size.