Boa colocação da equação quase-geostrófica em Lp-fraco

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

Radial sign-changing solutions to biharmonic nonlinear Schrodinger equations

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

Boa colocação da equação do calor semilinear em L^p-fraco

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.

The diagnostic value of Gram stain for initial identification of the etiologic agent of peritonitis in CAPD patients

Objective: To evaluate the effectiveness of the Gram stain in the initial diagnosis of the etiologic agent of peritonitis in continuous ambulatory peritoneal dialysis (CAPD). Design: Retrospective study analyzing the sensitivity (S), specificity (SS), positive predictive value (+PV), and negative predictive value (-PV) of the Gram stain relating to the results of cultures in 149 episodes of peritonitis in CAPD. The data were analyzed in two studies. In the first, only the cases with detection of a single agent by Gram stain were taken (Study 1). In the second, only the cases with two agents in Gram stain were evaluated (Study 2). Setting: Dialysis Unit and Laboratory of Microbiology of a tertiary medical center. Patients: Sixty-three patients on regular CAPD who presented one or more episodes of peritonitis from May 1992 to May 1995. Results: The positivity of Gram stain was 93.2% and the sensitivity was 95.7%. The values of S, SS, +PV, and -PV were respectively: 94.9%, 53.5%, 68.3%, and 90.9% for gram-positive cocci and 83.3%, 98.8%, 95.2%, and 95.6% for gram-negative bacilli. The association of gram-positive cocci plus gram-negative bacilli were predictive of growth of both in 6.8%, growth of gram-positive cocci in 13.7%, and growth of gram-negative bacilli in 72.5%. Conclusions: The Gram stain is a method of great value in the initial diagnosis of the etiologic agent of peritonitis in CAPD, especially for gram-negative bacilli.

Artificial neural networks: A novel approach to analysing the nutritional ecology of a blowfly species, Chrysomya megacephala

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

Phase Transition in Dynamical Systems: Defining Classes of Universality for Two-Dimensional Hamiltonian Mappings via Critical Exponents

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Tolerance to the air exposition test of Hoplias lacerdae larvae and juvenile during its initial development

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

Lap number properties for p-Laplacian problems investigated by Lyapunov methods

In this work we consider a one-dimensional quasilinear parabolic equation and we prove that the lap number of any solution cannot increase through orbits as the time passes if the initial data is a continuous function. We deal with the lap number functional as a Lyapunov function, and apply lap number properties to reach an understanding on the asymptotic behavior of a particular problem. (c) 2006 Published by Elsevier Ltd.

An alternative approach to solve convergence problems in the backpropagation algorithm

The multilayer perceptron network has become one of the most used in the solution of a wide variety of problems. The training process is based on the supervised method where the inputs are presented to the neural network and the output is compared with a desired value. However, the algorithm presents convergence problems when the desired output of the network has small slope in the discrete time samples or the output is a quasi-constant value. The proposal of this paper is presenting an alternative approach to solve this convergence problem with a pre-conditioning method of the desired output data set before the training process and a post-conditioning when the generalization results are obtained. Simulations results are presented in order to validate the proposed approach.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Some Initial Conditions for Disposed Satellites of the Systems GPS and Galileo Constellations

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Controlling the Eccentricity of Polar Lunar Orbits with Low-Thrust Propulsion

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)