Stochastic field processes in the mathematical modelling of damped transmission line vibrations

Wind-excited vibrations in the frequency range of 10 to 50 Hz due to vortex shedding often cause fatigue failures in the cables of overhead transmission lines. Damping devices, such as the Stockbridge dampers, have been in use for a long time for supressing these vibrations. The dampers are conveniently modelled by means of their driving point impedance, measured in the lab over the frequency range under consideration. The cables can be modelled as strings with additional small bending stiffness. The main problem in modelling the vibrations does however lay in the aerodynamic forces, which usually are approximated by the forces acting on a rigid cylinder in planar flow. In the present paper, the wind forces are represented by stochastic processes with arbitrary crosscorrelation in space; the case of a Kármán vortex street on a rigid cylinder in planar flow is contained as a limit case in this approach. The authors believe that this new view of the problem may yield useful results, particularly also concerning the reliability of the lines and the probability of fatigue damages. © 1987.

Vertex operators and Jordan fields

The construction of Lie algebras in terms of Jordan algebra generators is discussed. The key to the construction is the triality relation already incorporated into matrix products. A generalisation to Kac-Moody algebras in terms of vertex operators is proposed and may provide a clue for the construction of new representations of Kac-Moody algebras in terms of Jordan fields. © 1988.

On the structure of quantum phase space

The space of labels characterizing the elements of Schwinger's basis for unitary quantum operators is endowed with a structure of symplectic type. This structure is embodied in a certain algebraic cocycle, whose main features are inherited by the symplectic form of classical phase space. In consequence, the label space may be taken as the quantum phase space: It plays, in the quantum case, the same role played by phase space in classical mechanics, some differences coming inevitably from its nonlinear character. © 1990 American Institute of Physics.

Tau-functions and dressing transformations for zero-curvature affine integrable equations

The solutions of a large class of hierarchies of zero-curvature equations that includes Toda- and KdV-type hierarchies are investigated. All these hierarchies are constructed from affine (twisted or untwisted) Kac-Moody algebras g. Their common feature is that they have some special vacuum solutions corresponding to Lax operators lying in some Abelian (up to the central term) subalgebra of g; in some interesting cases such subalgebras are of the Heisenberg type. Using the dressing transformation method, the solutions in the orbit of those vacuum solutions are constructed in a uniform way. Then, the generalized tau-functions for those hierarchies are defined as an alternative set of variables corresponding to certain matrix elements evaluated in the integrable highest-weight representations of g. Such definition of tau-functions applies for any level of the representation, and it is independent of its realization (vertex operator or not). The particular important cases of generalized mKdV and KdV hierarchies as well as the Abelian and non-Abelian affine Toda theories are discussed in detail. © 1997 American Institute of Physics.

Theoretical approaches to forensic entomology: II. Mathematical model of larval development

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Exact solvability of potentials with spatially dependent effective masses

We discuss the relationship between exact solvability of the Schroedinger equation, due to a spatially dependent mass, and the ordering ambiguity. Some examples show that, even in this case, one can find exact solutions. Furthermore, it is demonstrated that operators with linear dependence on the momentum are nonambiguous. (C) 2000 Elsevier Science B.V.

Generalized ladder operators for shape-invariant potentials

A general form for ladder operators is used to construct a method to solve bound-state Schrödinger equations. The characteristics of supersymmetry and shape invariance of the system are the start point of the approach. To show the elegance and the utility of the method we use it to obtain energy spectra and eigenfunctions for the one-dimensional harmonic oscillator and Morse potentials and for the radial harmonic oscillator and Coulomb potentials.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Detecção de pistas de aeroporto em imagens orbitais utilizando morfologia matemática

The Brazilian Cartography presents great deficiency in cartographic products updating. This form, Remote Sensins techniques together Digital Processing Images - DPI, are contributing to improve this problem. The Mathematical Morphology theory was used in this work. The principal function was the pruning operator. With its were extracted the interest features that can be used in cartographic process updating. The obtained results are positives and showed the use potential of mathematical morphology theory in cartography, mainly in updating.

Mathematical optimisation techniques applied to power system operation and planning

Nowadays, power system operation becomes more complex because of the critical operating conditions resulting from the requirements of a market-driven operation. In this context, efficient methods for optimisation of power system operation and planning become critical to satisfy the operational (technical), financial and economic demands. Therefore, the detailed analysis of modern optimisation techniques as well as their application to the power system problems represent a relevant issue from the scientific and technological points of view. This paper presents a brief overview of the developments on modern mathematical optimisation methods applied to power system operation and planning. Copyright © 2007 Inderscience Enterprises Ltd.

Morphological routine proposal to extraction of highways in digital images of high resolution

This research proposes to apply techniques of Mathematics Morphology to extract highways in digital images of high resolution, targeting the upgrade of cartographic products. Remote Sensing data and Mathematical Morphological techniques were integrated in the process of extraction. Mathematical Morphology's objective is to improve and extract the relevant information of the visual image. In order to test the proposed approach some morphological operators related to preprocess, were applied to the original images. Routines were implemented in the MATLAB environment. Results indicated good performances by the implemented operators. The integration of the technologies aimed to implement the semiautomatic extraction of highways with the purpose to use them in processes of cartographic updating.

Mathematical decomposition technique applied to the probabilistic power flow problem

In this paper a framework based on the decomposition of the first-order optimality conditions is described and applied to solve the Probabilistic Power Flow (PPF) problem in a coordinated but decentralized way in the context of multi-area power systems. The purpose of the decomposition framework is to solve the problem through a process of solving smaller subproblems, associated with each area of the power system, iteratively. This strategy allows the probabilistic analysis of the variables of interest, in a particular area, without explicit knowledge of network data of the other interconnected areas, being only necessary to exchange border information related to the tie-lines between areas. An efficient method for probabilistic analysis, considering uncertainty in n system loads, is applied. The proposal is to use a particular case of the point estimate method, known as Two-Point Estimate Method (TPM), rather than the traditional approach based on Monte Carlo simulation. The main feature of the TPM is that it only requires resolve 2n power flows for to obtain the behavior of any random variable. An iterative coordination algorithm between areas is also presented. This algorithm solves the Multi-Area PPF problem in a decentralized way, ensures the independent operation of each area and integrates the decomposition framework and the TPM appropriately. The IEEE RTS-96 system is used in order to show the operation and effectiveness of the proposed approach and the Monte Carlo simulations are used to validation of the results. © 2011 IEEE.

A study on automatic methods based on mathematical morphology for Martian dust devil tracks detection

This paper presents three methods for automatic detection of dust devils tracks in images of Mars. The methods are mainly based on Mathematical Morphology and results of their performance are analyzed and compared. A dataset of 21 images from the surface of Mars representative of the diversity of those track features were considered for developing, testing and evaluating our methods, confronting their outputs with ground truth images made manually. Methods 1 and 3, based on closing top-hat and path closing top-hat, respectively, showed similar mean accuracies around 90% but the time of processing was much greater for method 1 than for method 3. Method 2, based on radial closing, was the fastest but showed worse mean accuracy. Thus, this was the tiebreak factor. © 2011 Springer-Verlag.