Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Quadratic effective action for QED in D=2,3 dimensions

We calculate the effective action for quantum electrodynamics (QED) in D=2,3 dimensions at the quadratic approximation in the gauge fields. We analyze the analytic structure of the corresponding nonlocal boson propagators nonperturbatively in k/m. In two dimensions for any nonzero fermion mass, we end up with one massless pole for the gauge boson. We also calculate in D=2 the effective potential between two static charges separated by a distance L and find it to be a linearly increasing function of L in agreement with the bosonized theory (massive sine-Gordon model). In three dimensions we find nonperturbatively in k/m one massive pole in the effective bosonic action leading to screening. Fitting the numerical results we derive a simple expression for the functional dependence of the boson mass upon the dimensionless parameter e2/m. ©2000 The American Physical Society.

Design of microirrigation systems in sloping lands using linear programming

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

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

Ferroelectric SBN thin films grown by an SBN/Bi2O3 PLD sequential process

Ferroelectric SrBi2Nb2O9 (SBN) thin films were prepared by pulsed laser deposition (PLD) on Pt/Ti/SiO2/Si(100) using a sequential deposition process from two SBN and Bi2O3 targets. This route allows for bismuth enrichment of the film composition in order to improve the ferroelectric characteristics. Structural and microstructural characterizations were performed by X-ray diffraction (XRD) and scanning electron microscopy (SEM). The composition of films and targets was determined by energy dispersive X-ray spectrometry (EDX). The deposition temperature, which provided well-crystallized layered perovskite SBN phase films in situ, was found to be 700°C. The results were compared with those obtained for SBN films deposited at 400°C and then crystallized ex situ. For an ex situ annealing temperature of 750°C, a remanent polarization value (Pr) of 23.2 μc/cm2 and a coercive field (Ec) of 112 kV/cm were measured. © 2001 Elsevier Science Ltd. All rights reserved.

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.

Can one cure the nonunitarity of three-dimensional quadratic gravity using a topological Chern-Simons term?

Quadratic gravity in (2+1)D is nonunitarity at the tree level. When a topological Chern-Simons term is added to this theory, the harmless massive scalar mode of the former gives rise to a troublesome massive spin-0 ghost, while the massive spin-2 ghost is replaced by two massive physical particles both of spin-2. Therefore, unlike what it is claimed in the literature, quadratic Chern-Simons gravity in (2+1)D is nonunitary at the tree level. © 2004 Published by Elsevier B.V.

Common architecture for discrete wavelet transform analysis and synthesis with sequential and constant processing elements

This paper adresses the problem on processing biological data such as cardiac beats, audio and ultrasonic range, calculating wavelet coefficients in real time, with processor clock running at frequency of present ASIC's and FPGA. The Paralell Filter Architecture for DWT has been improved, calculating wavelet coefficients in real time with hardware reduced to 60%. The new architecture, which also processes IDWT, is implemented with the Radix-2 or the Booth-Wallace Constant multipliers. Including series memory register banks, one integrated circuit Signal Analyzer, ultrasonic range, is presented.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.

Extração de feições rodoviárias em imagens digitais: Metodologias desenvolvidas pelo GP-F&VC

Several kinds of research in road extraction have been carried out in the last 6 years by the Photogrammetry and Computer Vision Research Group (GPF&VC - Grupo de Pesquisa em Fotogrametria e Visão Computacional). Several semi-automatic road extraction methodologies have been developed, including sequential and optimizatin techniques. The GP-F&VC has also been developing fully automatic methodologies for road extraction. This paper presents an overview of the GP-F&VC research in road extraction from digital images, along with examples of results obtained by the developed methodologies.

Linear quadratic Gaussian control of discrete-time Markov jump linear systems with horizon defined by stopping times

The linear quadratic Gaussian control of discrete-time Markov jump linear systems is addressed in this paper, first for state feedback, and also for dynamic output feedback using state estimation. in the model studied, the problem horizon is defined by a stopping time τ which represents either, the occurrence of a fix number N of failures or repairs (T N), or the occurrence of a crucial failure event (τ δ), after which the system paralyzed. From the constructive method used here a separation principle holds, and the solutions are given in terms of a Kalman filter and a state feedback sequence of controls. The control gains are obtained by recursions from a set of algebraic Riccati equations for the former case or by a coupled set of algebraic Riccati equation for the latter case. Copyright © 2005 IFAC.

Double Higgs production and quadratic divergence cancellation in little Higgs models with T-parity

We analyze double Higgs boson production at the Large Hadron Collider in the context of Little Higgs models. In double Higgs production, the diagrams involved are directly related to those that cause the cancellation of the quadratic divergence of the Higgs self-energy, providing a robust prediction for this class of models. We find that in extensions of this model with the inclusion of a so-called T-parity, there is a significant enhancement in the cross sections as compared to the Standard Model. © SISSA 2006.

Autonomous mobile robots designing for the medical trash collector task

This paper describes the UNESP robotic team in the medical trash collector task, proposed on the 5 rd IEEE Latin American Robots Competition in the LEGO category. We present our understanding of the task and discuss the proposed solution, focusing on the mechanical and computational issues of the robots. The mechanics is based on rigid body capability of transforming rotational into curvilinear movement. With respect to the computational control, the system is modeled as a reactive system with sequential transition of behaviors. A state-machine is proposed to allow this transition, and the synchronization of robotic states is guaranteed by the communication system. The proposed approach has shown itself capable of dealing with the high difficulty degree of this cooperative task. ©2006 IEEE.

Reliability assessment of energy limited systems using sequential montecarlo simulation

This paper explains why the reliability assessment of energy limited systems requires more detailed models for primary generating resources availability, internal and external generating dispatch and customer demand than the ones commonly used for large power systems and presents a methodology based on the full sequential Montecarlo simulation technique with AC power flow for their long term reliability assessment which can properly include these detailed models. By means of a real example, it is shown how the simplified modeling traditionally used for large power systems leads to pessimistic predictions if it is applied to an energy limited system and also that it cannot predict all the load point adequacy problems. © 2006 IEEE.