Development of diagnostic and prognostic algorithms from vacuum circuit breaker restrike review and its validation proposal

The CIGRE WGs A3.20 and A3.24 identify the requirements of simulation tools to predict various stresses during the development and operational phases of medium voltage vacuum circuit breaker (VCB) testing. This paper reviews the modelling methodology [13], VCB models and tools to identify future research. It will include the application of the VCB model for the impending failure of a VCB using electro-magnetic-transient-program with diagnostic and prognostic algorithm development. The methodology developed for a VCB degradation model is to modify the dielectric equation to cover a restriking period of more than 1 millimetre.

Discovering the best feature extraction and selection algorithms for spontaneous facial expression recognition

Feature extraction and selection are critical processes in developing facial expression recognition (FER) systems. While many algorithms have been proposed for these processes, direct comparison between texture, geometry and their fusion, as well as between multiple selection algorithms has not been found for spontaneous FER. This paper addresses this issue by proposing a unified framework for a comparative study on the widely used texture (LBP, Gabor and SIFT) and geometric (FAP) features, using Adaboost, mRMR and SVM feature selection algorithms. Our experiments on the Feedtum and NVIE databases demonstrate the benefits of fusing geometric and texture features, where SIFT+FAP shows the best performance, while mRMR outperforms Adaboost and SVM. In terms of computational time, LBP and Gabor perform better than SIFT. The optimal combination of SIFT+FAP+mRMR also exhibits a state-of-the-art performance.

Efficient articulated trajectory reconstruction using dynamic programming and filters

This paper considers the problem of reconstructing the motion of a 3D articulated tree from 2D point correspondences subject to some temporal prior. Hitherto, smooth motion has been encouraged using a trajectory basis, yielding a hard combinatorial problem with time complexity growing exponentially in the number of frames. Branch and bound strategies have previously attempted to curb this complexity whilst maintaining global optimality. However, they provide no guarantee of being more efficient than exhaustive search. Inspired by recent work which reconstructs general trajectories using compact high-pass filters, we develop a dynamic programming approach which scales linearly in the number of frames, leveraging the intrinsically local nature of filter interactions. Extension to affine projection enables reconstruction without estimating cameras.

Managing and learning with multiple models: Objectives and optimization algorithms

The quality of environmental decisions should be gauged according to managers' objectives. Management objectives generally seek to maximize quantifiable measures of system benefit, for instance population growth rate. Reaching these goals often requires a certain degree of learning about the system. Learning can occur by using management action in combination with a monitoring system. Furthermore, actions can be chosen strategically to obtain specific kinds of information. Formal decision making tools can choose actions to favor such learning in two ways: implicitly via the optimization algorithm that is used when there is a management objective (for instance, when using adaptive management), or explicitly by quantifying knowledge and using it as the fundamental project objective, an approach new to conservation.This paper outlines three conservation project objectives - a pure management objective, a pure learning objective, and an objective that is a weighted mixture of these two. We use eight optimization algorithms to choose actions that meet project objectives and illustrate them in a simulated conservation project. The algorithms provide a taxonomy of decision making tools in conservation management when there is uncertainty surrounding competing models of system function. The algorithms build upon each other such that their differences are highlighted and practitioners may see where their decision making tools can be improved. © 2010 Elsevier Ltd.

A Bayesian Framework for the Assessment of Vision-based Weed and Fruit Detection and Classification Algorithms

This paper proposes new metrics and a performance-assessment framework for vision-based weed and fruit detection and classification algorithms. In order to compare algorithms, and make a decision on which one to use fora particular application, it is necessary to take into account that the performance obtained in a series of tests is subject to uncertainty. Such characterisation of uncertainty seems not to be captured by the performance metrics currently reported in the literature. Therefore, we pose the problem as a general problem of scientific inference, which arises out of incomplete information, and propose as a metric of performance the(posterior) predictive probabilities that the algorithms will provide a correct outcome for target and background detection. We detail the framework through which these predicted probabilities can be obtained, which is Bayesian in nature. As an illustration example, we apply the framework to the assessment of performance of four algorithms that could potentially be used in the detection of capsicums (peppers).

Phosphorus nutrition and tolerance of cotton to water stress: II. Water relations, free and bound water and leaf expansion rate

In previous experiments, increased leaf-Phosphorus (P) content with increasing P supply enhanced the individual leaf expansion and water content of fresh cotton leaves in a severely drying soil. In this paper, we report on the bulk water content of leaves and its components, free and bound water, along with other measures of plant water status, in expanding cotton leaves of various ages in a drying soil with different P concentrations. The bound water in living tissue is more likely to play a major role in tolerance to abiotic stresses by maintaining the structural integrity and/or cell wall extensibility of the leaves, whilst an increased amount of free water might be able to enhance solute accumulation, leading to better osmotic adjustment and tolerance to water stress, and maintenance of the volumes of sub-cellular compartments for expansive leaf growth. There were strong correlations between leaf-P%, leaf water (total, free and bound water) and leaf expansion rate (LER) under water stress conditions in a severely drying soil. Increased soil-P enhanced the uptake of P from a drying soil, leading to increased supply of osmotically active inorganic solutes to the cells in growing leaves. This appears to have led to the accumulation of free water and more bound water, ultimately leading to increased leaf expansion rates as compared to plants in low P soil under similar water stress conditions. The greater amount of bound and free water in the high-P plants was not necessarily associated with changes in cell turgor, and appears to have maintained the cell-wall properties and extensibility under water stressed conditions in soils that are nutritionally P-deficient.

A time minimising transportation problem with quality dependent time

The usual assumption made in time minimising transportation problem is that the time for transporting a positive amount in a route is independent of the actual amount transported in that route. In this paper we make a more general and natural assumption that the time depends on the actual amount transported. We assume that the time function for each route is an increasing piecewise constant function. Four algorithms - (1) a threshold algorithm, (2) an upper bounding technique, (3) a primal dual approach, and (4) a branch and bound algorithm - are presented to solve the given problem. A method is also given to compute the minimum bottle-neck shipment corresponding to the optimal time. A numerical example is solved illustrating the algorithms presented in this paper.

Implementation of placement and routing algorithms for computer aided design of printed circuit boards

The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.

Open-pit block sequencing optimization: A mathematical model and solution technique

This study presents a comprehensive mathematical formulation model for a short-term open-pit mine block sequencing problem, which considers nearly all relevant technical aspects in open-pit mining. The proposed model aims to obtain the optimum extraction sequences of the original-size (smallest) blocks over short time intervals and in the presence of real-life constraints, including precedence relationship, machine capacity, grade requirements, processing demands and stockpile management. A hybrid branch-and-bound and simulated annealing algorithm is developed to solve the problem. Computational experiments show that the proposed methodology is a promising way to provide quantitative recommendations for mine planning and scheduling engineers.

Free-to-bound and bound exciton transitions at isoelectronic impurities: GaP(Zn,O)

We show, for sufficiently high temperatures and sufficiently weak majority-carrier binding energies, that the dominant radiative transition at an isoelectronic acceptor (donor) in p-type (n-type) material consists of the recombination of singly trapped minority carriers (bound by central-cell forces) with free majority carriers attracted by a Coulomb interaction. There are two reasons why the radiative recombination rate of the free-to-bound process is greater than the bound exciton process, which dominates at lower temperatures: (i) The population of free majority-carrier states greatly exceeds that of exciton states at higher temperatures, and (ii) the oscillator strength of the free-to-bound transition is greatly enhanced by the Coulomb attraction between the free carrier and the charged isoelectronic impurity. This enhancement is important for isoelectronic centers and is easily calculable from existing exciton models. We show that the free carrier attracted by a Coulomb interaction can be viewed as a continuum excited state of the bound exciton. When we apply the results of our calculations to the GaP(Zn, O) system, we find that the major part of the room-temperature luminescence from nearest-neighbor isoelectronic Zn-O complexes results from free-to-bound recombination and not exciton recombination as has been thought previously. Recent experiments on impulse excitation of luminescence in GaP(Zn, O) are reevaluated in the light of our calculations and are shown to be consistent with a strong free-to-bound transition. For deep isoelectronic centers with weakly bound majority carriers, we predict an overwhelming dominance of the free-to-bound process at 300°K.

Information theory, inference, and learning algorithms

Fun and exciting textbook on the mathematics underpinning the most dynamic areas of modern science and engineering.