A case study of the direct radiative effect of biomass burning aerosols on precipitation in the Eastern Amazon

Numerical experiments with the Brazilian additions to the Regional Atmospheric Modeling System were performed with two nested grids (50 and 10 km horizontal resolution, respectively) with and without the effect of biomass burning for 8 different situations for 96 h integrations. Only the direct radiative effect of aerosols is considered. The results were analyzed in large areas encompassing the BR163 road (one of the main areas of deforestation in the Amazon). mainly where most of the burning takes place. The precipitation change due to the direct radiative impact of biomass burning is generally negative (i.e., there is a decrease of precipitation). However, there are a few cases with a positive impact. Two opposite forcing mechanisms were explored: (a) the thermodynamic forcing that is generally negative in the sense that the aerosol tends to stabilize the lower atmosphere and (b) the dynamic impact associated with the low level horizontal pressure gradients produced by the aerosol plumes. In order to understand the non-linear relationship between the two effects, experiments were performed with 4-fold emissions. In these cases, the dynamic effect overcomes the stabilization produced by the radiative forcing and precipitation increase is observed in comparison with the control experiment. This study suggests that. in general, the biomass burning radiative forcing decreases the precipitation. However, very large concentrations of aerosols may lead to an increase of precipitation due to the dynamical forcing associated with the horizontal pressure gradients. (C) 2009 Elsevier B.V. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

Iterative strong coupling of dimensionally heterogeneous models

In this article we address decomposition strategies especially tailored to perform strong coupling of dimensionally heterogeneous models, under the hypothesis that one wants to solve each submodel separately and implement the interaction between subdomains by boundary conditions alone. The novel methodology takes full advantage of the small number of interface unknowns in this kind of problems. Existing algorithms can be viewed as variants of the `natural` staggered algorithm in which each domain transfers function values to the other, and receives fluxes (or forces), and vice versa. This natural algorithm is known as Dirichlet-to-Neumann in the Domain Decomposition literature. Essentially, we propose a framework in which this algorithm is equivalent to applying Gauss-Seidel iterations to a suitably defined (linear or nonlinear) system of equations. It is then immediate to switch to other iterative solvers such as GMRES or other Krylov-based method. which we assess through numerical experiments showing the significant gain that can be achieved. indeed. the benefit is that an extremely flexible, automatic coupling strategy can be developed, which in addition leads to iterative procedures that are parameter-free and rapidly converging. Further, in linear problems they have the finite termination property. Copyright (C) 2009 John Wiley & Sons, Ltd.

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed form of Spectral Projected Gradient iterations. Intercalated with these projected steps, internal iterations restricted to faces of the polytope are performed, which enhance the efficiency of the algorithm. Convergence proofs are given and numerical experiments are included and commented. Software supporting this paper is available through the Tango Project web page: http://www.ime.usp.br/similar to egbirgin/tango/.

A discontinuous-Galerkin-based immersed boundary method with non-homogeneous boundary conditions and its application to elasticity

We propose a discontinuous-Galerkin-based immersed boundary method for elasticity problems. The resulting numerical scheme does not require boundary fitting meshes and avoids boundary locking by switching the elements intersected by the boundary to a discontinuous Galerkin approximation. Special emphasis is placed on the construction of a method that retains an optimal convergence rate in the presence of non-homogeneous essential and natural boundary conditions. The role of each one of the approximations introduced is illustrated by analyzing an analog problem in one spatial dimension. Finally, extensive two- and three-dimensional numerical experiments on linear and nonlinear elasticity problems verify that the proposed method leads to optimal convergence rates under combinations of essential and natural boundary conditions. (C) 2009 Elsevier B.V. All rights reserved.

A discontinuous-Galerkin-based immersed boundary method

A numerical method to approximate partial differential equations on meshes that do not conform to the domain boundaries is introduced. The proposed method is conceptually simple and free of user-defined parameters. Starting with a conforming finite element mesh, the key ingredient is to switch those elements intersected by the Dirichlet boundary to a discontinuous-Galerkin approximation and impose the Dirichlet boundary conditions strongly. By virtue of relaxing the continuity constraint at those elements. boundary locking is avoided and optimal-order convergence is achieved. This is shown through numerical experiments in reaction-diffusion problems. Copyright (c) 2008 John Wiley & Sons, Ltd.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

Global minimization using an Augmented Lagrangian method with variable lower-level constraints

A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the epsilon(k)-global minimization of the Augmented Lagrangian with simple constraints, where epsilon(k) -> epsilon. Global convergence to an epsilon-global minimizer of the original problem is proved. The subproblems are solved using the alpha BB method. Numerical experiments are presented.

Outer Trust-Region Method for Constrained Optimization

Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an outer trust-region (OTR) modification of A is the result of adding a trust-region constraint to each subproblem. The trust-region size is adaptively updated according to the behavior of crucial variables. The new subproblems should not be more complex than the original ones, and the convergence properties of the OTR algorithm should be the same as those of Algorithm A. In the present work, the OTR approach is exploited in connection with the ""greediness phenomenon"" of nonlinear programming. Convergence results for an OTR version of an augmented Lagrangian method for nonconvex constrained optimization are proved, and numerical experiments are presented.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Accurate velocity reconstruction for Discontinuous Galerkin approximations of two-phase porous media flows

We consider Discontinuous Galerkin approximations of two-phase, immiscible porous media flows in the global pressure/fractional flow formulation with capillary pressure. A sequential approach is used with a backward Euler step for the saturation equation, equal-order interpolation for the pressure and the saturation, and without any limiters. An accurate total velocity field is recovered from the global pressure equation to be used in the saturation equation. Numerical experiments show the advantages of the proposed reconstruction. To cite this article: A. Ern et al., C R. Acad. Sci. Paris, Ser. 1347 (2009). (C) 2009 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.

THE CO-INFLUENCE OF THE SEA BREEZE AND THE COASTAL UPWELLING AT CABO FRIO: A NUMERICAL INVESTIGATION USING COUPLED MODELS

A coupled atmospheric-oceanic model was used to investigate whether there is a positive feedback between the coastal upwelling and the sea breeze at Cabo Frio - RJ (Brazil). Two experiments were performed to ascertain the influence of the sea breeze on the coastal upwelling: the first one used the coupled model forced with synoptic NE winds of 8 m s(-1) and the sign of the sea breeze circulation was set by the atmospheric model; the second experiment used only the oceanic model with constant 8 m s(-1) NE winds. Then, to study the influence of the coastal upwelling on the sea breeze, two more experiments were performed: one using a coastal upwelling representative SST initial field and the other one using a constant and homogeneous SST field of 26 degrees C. Finally, two more experiments were conducted to verify the influence of the topography and the spatial distribution of the sea surface temperature on the previous results. The results showed that the sea breeze can intensify the coastal upwelling, but the coastal upwelling does not intensify the sea breeze circulation, suggesting that there is no positive feedback between these two phenomena at Cabo Frio.

Open Circuit Interaction of Formic Acid with Oxidized Pt Surfaces: Experiments, Modeling, and Simulations

We report in this work the study of the interaction between formic acid and an oxidized platinum surface under open circuit conditions. The investigation was carried out with the aid of in situ infrared spectroscopy, and results analyzed in terms of a mathematical model and numerical simulations. It has been found that during the first seconds of the interaction a small amount of CO(2) is produced and absolutely no adsorbed CO was observed. A sudden drop in potential then follows, which is accompanied by a steep increase first of CO(2) production and then by adsorbed CO. The steep transient was rationalized in terms of an autocatalytic production of free platinum sites which enhances the overall rate of reaction. Modeling and simulation showed nearly quantitative agreement with the experimental observations and provided further insight into some experimentally inaccessible variables such as surface free sites. Finally, based on the understanding provided from the combined experimental and theoretical approach, we discuss the general aspects influencing the open circuit transient.