Image processing algorithm for the identification of Martian dust devil tracks in MOC and HiRISE images

This paper presents a method for automatic identification of dust devils tracks in MOC NA and HiRISE images of Mars. The method is based on Mathematical Morphology and is able to successfully process those images despite their difference in spatial resolution or size of the scene. A dataset of 200 images from the surface of Mars representative of the diversity of those track features was considered for developing, testing and evaluating our method, confronting the outputs with reference images made manually. Analysis showed a mean accuracy of about 92%. We also give some examples on how to use the results to get information about dust devils, namelly mean width, main direction of movement and coverage per scene. (c) 2012 Elsevier Ltd. All rights reserved.

A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A new algorithm for Reverse Monte Carlo simulations

We present a new algorithm for Reverse Monte Carlo (RMC) simulations of liquids. During the simulations, we calculate energy, excess chemical potentials, bond-angle distributions and three-body correlations. This allows us to test the quality and physical meaning of RMC-generated results and its limitations. It also indicates the possibility to explore orientational correlations from simple scattering experiments. The new technique has been applied to bulk hard-sphere and Lennard-Jones systems and compared to standard Metropolis Monte Carlo results. (C) 1998 American Institute of Physics.

About the Use of the HdHr Algorithm Group in Integrating the Movement Equation with Nonlinear Terms

This work summarizes the HdHr group of Hermitian integration algorithms for dynamic structural analysis applications. It proposes a procedure for their use when nonlinear terms are present in the equilibrium equation. The simple pendulum problem is solved as a first example and the numerical results are discussed. Directions to be pursued in future research are also mentioned. Copyright (C) 2009 H.M. Bottura and A. C. Rigitano.

Exact solution for a fermion in the background of a scalar inversely linear potential

The problem of a fermion subject to a general scalar potential in a two-dimensional world is mapped into a Sturm-Liouville problem for nonzero eigenenergies. The searching for possible bounded solutions is done in the circumstance of power-law potentials. The normalizable zero-eigenmode solutions are also searched. For the specific case of an inversely linear potential, which gives rise to an effective Kratzer potential, exact bounded solutions are found in closed form. The behaviour of the upper and lower components of the Dirac spinor is discussed in detail and some unusual results are revealed. (C) 2004 Elsevier B.V. All rights reserved.

Some exact solutions of the Dirac equation

Exact analytic solutions are found to the Dirac equation for a combination of Lorentz scalar and vector Coulombic potentials with additional non-Coulombic parts. An appropriate linear combination of Lorentz scalar and vector non-Coulombic potentials, with the scalar part dominating, can be chosen to give exact analytic Dirac wave functions.

Exact closed-form solutions of the Dirac equation for a class of effective Morse potentials

Exact bounded solutions for a fermion subject to exponential scalar potential in 1 + 1 dimensions are found in closed form. We discuss the existence of zero modes which are related to the ultrarelativistic limit of the Dirac equation and are responsible for the induction of a fractional fermion number on the vacuum.

Dirac equation exact solutions for generalized asymmetrical Hartmann potentials

In this work we solve the Dirac equation by constructing the exact bound state solutions for a mixing of vector and scalar generalized Hartmann potentials. This is done provided the vector potential is equal to or minus the scalar potential. The cases of some quasi-exactly solvable and Morse-like potentials are briefly commented. (c) 2006 Elsevier B.V. All rights reserved.

Exact closed-form solutions of the Dirac equation with a scalar exponential potential

The problem of a fermion subject to a general scalar potential in a two-dimensional world for nonzero eigenenergies is mapped into a Sturm-Liouville problem for the upper component of the Dirac spinor. In the specific circumstance of an exponential potential, we have an effective Morse potential which reveals itself as an essentially relativistic problem. Exact bound solutions are found in closed form for this problem. The behaviour of the upper and lower components of the Dirac spinor is discussed in detail, particularly the existence of zero modes. (c) 2005 Elsevier B.v. All rights reserved.

Extended class of exact twistons and crystalline polyethylene

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand capacity. The problem is well known to be NP-hard and has many practical applications. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the CCCP. This method identifies promising regions of the search space by generating solutions with a metaheuristic, such as Genetic Algorithm, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of CS. (C) 2010 Elsevier Ltd. All rights reserved.

Economic-statistical design of the (X)over-bar chart used to control a wandering process mean using genetic algorithm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)