Orbitally driven east-west antiphasing of South American precipitation

The variations of tropical precipitation are antiphased between the hemispheres on orbital timescales. This antiphasing arises through the alternating strength of incoming solar radiation in the two hemispheres, which affects monsoon intensity and hence the position of the meridional atmospheric circulation of the Hadley cells(1-4). Here we compare an oxygen isotopic record recovered from a speleothem from northeast Brazil for the past 26,000 years with existing reconstructions of precipitation in tropical South America(5-8). During the Holocene, we identify a similar, but zonally oriented, antiphasing of precipitation within the same hemisphere: northeast Brazil experiences humid conditions during low summer insolation and aridity when summer insolation is high, whereas the rest of southern tropical South America shows opposite characteristics. Simulations with a general circulation model that incorporates isotopic variations support this pattern as well as the link to insolation-driven monsoon activity. Our results suggest that convective heating over tropical South America and associated adjustments in large-scale subsidence over northeast Brazil lead to a remote forcing of the South American monsoon, which determines most of the precipitation changes in the region on orbital timescales.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.