Climate perspective on the large-scale circulation associated with the transition of the first South Atlantic hurricane

The landfall of Cyclone Catarina on the Brazilian coast in March 2004 became known as the first documented hurricane in the South Atlantic Ocean, promoting a new view oil how large-scale features can contribute to tropical transition. The aim of this paper is to put the large-scale circulation associated with Catarina`s transition in climate perspective. This is discussed in the light of a robust pattern of spatial correlations between thermodynamic and dynamic variables of importance for hurricane formation. A discussion on how transition mechanisms respond to the present-day circulation is presented. These associations help in understanding why Catarina was formed in a region previously thought to be hurricane-free. Catarina developed over a large-scale area of thermodynamically favourable air/sea temperature contrast. This aspect explains the paradox that such a rare system developed when the sea surface temperature was slightly below average. But, although thermodynamics played an important role, it is apparent that Catarina would not have formed without the key dynamic interplay triggered by a high latitude blocking. The blocking was associated with an extreme positive phase of the Southern Annular Mode (SAM) both hemispherically and locally, and the nearby area where Catarina developed is found to be more cyclonic during the positive phase of the SAM. A conceptual model is developed and a `South Atlantic index` is introduced as a useful diagnostic of potential conditions leading to tropical transition in the area, where large-scale indices indicate trends towards more favourable atmospheric conditions for tropical cyclone formation. Copyright (c) 2008 Royal Meteorological Society

Dynamic portrait of the planetary 2/1 mean-motion resonance - I. Systems with a more massive outer planet

We analyse the global structure of the phase space of the planar planetary 2/1 mean-motion resonance in cases where the outer planet is more massive than its inner companion. Inside the resonant domain, we show the existence of two families of periodic orbits, one associated to the librational motion of resonant angle (sigma-family) and the other related to the circulatory motion of the difference in longitudes of pericentre (Delta pi-family). The well-known apsidal corotation resonances (ACR) appear as intersections between both families. A complex web of secondary resonances is also detected for low eccentricities, whose strengths and positions are dependent on the individual masses and spatial scale of the system. The construction of dynamical maps for various values of the total angular momentum shows the evolution of the families of stable motion with the eccentricities, identifying possible configurations suitable for exoplanetary systems. For low-moderate eccentricities, several different stable modes exist outside the ACR. For larger eccentricities, however, all stable solutions are associated to oscillations around the stationary solutions. Finally, we present a possible link between these stable families and the process of resonance capture, identifying the most probable routes from the secular region to the resonant domain, and discussing how the final resonant configuration may be affected by the extension of the chaotic layer around the resonance region.

An incremental space to visualize dynamic data sets

In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We have developed an inherently incremental technique (incBoard) that maintains a coherent disposition of elements from a dynamic multidimensional data set on a 2D grid as the set changes. Here, we introduce a novel layout that uses pairwise similarity from grid neighbors, as defined in incBoard, to reposition elements on the visual space, free from constraints imposed by the grid. The board continues to be updated and can be displayed alongside the new space. As similar items are placed together, while dissimilar neighbors are moved apart, it supports users in the identification of clusters and subsets of related elements. Densely populated areas identified in the incSpace can be efficiently explored with the corresponding incBoard visualization, which is not susceptible to occlusion. The solution remains inherently incremental and maintains a coherent disposition of elements, even for fully renewed sets. The algorithm considers relative positions for the initial placement of elements, and raw dissimilarity to fine tune the visualization. It has low computational cost, with complexity depending only on the size of the currently viewed subset, V. Thus, a data set of size N can be sequentially displayed in O(N) time, reaching O(N (2)) only if the complete set is simultaneously displayed.

A new scale-invariant ratio and finite-size scaling for the stochastic susceptible-infected-recovered model

The critical behavior of the stochastic susceptible-infected-recovered model on a square lattice is obtained by numerical simulations and finite-size scaling. The order parameter as well as the distribution in the number of recovered individuals is determined as a function of the infection rate for several values of the system size. The analysis around criticality is obtained by exploring the close relationship between the present model and standard percolation theory. The quantity UP, equal to the ratio U between the second moment and the squared first moment of the size distribution multiplied by the order parameter P, is shown to have, for a square system, a universal value 1.0167(1) that is the same for site and bond percolation, confirming further that the SIR model is also in the percolation class.

Shape classification using complex network and Multi-scale Fractal Dimension

Shape provides one of the most relevant information about an object. This makes shape one of the most important visual attributes used to characterize objects. This paper introduces a novel approach for shape characterization, which combines modeling shape into a complex network and the analysis of its complexity in a dynamic evolution context. Descriptors computed through this approach show to be efficient in shape characterization, incorporating many characteristics, such as scale and rotation invariant. Experiments using two different shape databases (an artificial shapes database and a leaf shape database) are presented in order to evaluate the method. and its results are compared to traditional shape analysis methods found in literature. (C) 2009 Published by Elsevier B.V.

Resilience of protein-protein interaction networks as determined by their large-scale topological features

The relationship between the structure and function of biological networks constitutes a fundamental issue in systems biology. Particularly, the structure of protein-protein interaction networks is related to important biological functions. In this work, we investigated how such a resilience is determined by the large scale features of the respective networks. Four species are taken into account, namely yeast Saccharomyces cerevisiae, worm Caenorhabditis elegans, fly Drosophila melanogaster and Homo sapiens. We adopted two entropy-related measurements (degree entropy and dynamic entropy) in order to quantify the overall degree of robustness of these networks. We verified that while they exhibit similar structural variations under random node removal, they differ significantly when subjected to intentional attacks (hub removal). As a matter of fact, more complex species tended to exhibit more robust networks. More specifically, we quantified how six important measurements of the networks topology (namely clustering coefficient, average degree of neighbors, average shortest path length, diameter, assortativity coefficient, and slope of the power law degree distribution) correlated with the two entropy measurements. Our results revealed that the fraction of hubs and the average neighbor degree contribute significantly for the resilience of networks. In addition, the topological analysis of the removed hubs indicated that the presence of alternative paths between the proteins connected to hubs tend to reinforce resilience. The performed analysis helps to understand how resilience is underlain in networks and can be applied to the development of protein network models.

Columnar joints in the Patino Formation sandstones, Eastern Paraguay: a dynamic interaction between dyke intrusion, quartz dissolution and cooling-induced fractures

The Patino Formation sandstones, which crop out in Aregua neighborhood in Eastern Paraguay and show columnar joints near the contact zone with a nephelinite dyke, have as their main characteristics the high proportion of syntaxial quartz overgrowth and a porosity originated from different processes, initially by dissolution and later by partial filling and fracturing. Features like the presence of floating grains in the syntaxial cement, the transitional interpenetrative contact between the silica-rich cement and grains as well as the intense fracture porosity are strong indications that the cement has been formed by dissolution and reprecipitation of quartz from the framework under the effect of thermal expansion followed by rapid contraction. The increase of the silica-rich cement towards the dyke in association with the orthogonal disposition of the columns relative to dyke walls are indicative that the igneous body may represent the main heat source for the interstitial aqueous solutions previously existing in the sediments. At macroscopic scale, the increasing of internal tensions in the sandstones is responsible for the nucleation of polygons, leading to the individualization of prisms, which are interconnected by a system of joints, formed firstly on isotherm surfaces of low temperature and later on successive adjacent planes towards the dyke heat source.

A multi-GPU algorithm for large-scale neuronal networks

Large-scale simulations of parts of the brain using detailed neuronal models to improve our understanding of brain functions are becoming a reality with the usage of supercomputers and large clusters. However, the high acquisition and maintenance cost of these computers, including the physical space, air conditioning, and electrical power, limits the number of simulations of this kind that scientists can perform. Modern commodity graphical cards, based on the CUDA platform, contain graphical processing units (GPUs) composed of hundreds of processors that can simultaneously execute thousands of threads and thus constitute a low-cost solution for many high-performance computing applications. In this work, we present a CUDA algorithm that enables the execution, on multiple GPUs, of simulations of large-scale networks composed of biologically realistic Hodgkin-Huxley neurons. The algorithm represents each neuron as a CUDA thread, which solves the set of coupled differential equations that model each neuron. Communication among neurons located in different GPUs is coordinated by the CPU. We obtained speedups of 40 for the simulation of 200k neurons that received random external input and speedups of 9 for a network with 200k neurons and 20M neuronal connections, in a single computer with two graphic boards with two GPUs each, when compared with a modern quad-core CPU. Copyright (C) 2010 John Wiley & Sons, Ltd.

An algorithm for automatic checking of exercises in a dynamic geometry system: iGeom

One of the key issues in e-learning environments is the possibility of creating and evaluating exercises. However, the lack of tools supporting the authoring and automatic checking of exercises for specifics topics (e.g., geometry) drastically reduces advantages in the use of e-learning environments on a larger scale, as usually happens in Brazil. This paper describes an algorithm, and a tool based on it, designed for the authoring and automatic checking of geometry exercises. The algorithm dynamically compares the distances between the geometric objects of the student`s solution and the template`s solution, provided by the author of the exercise. Each solution is a geometric construction which is considered a function receiving geometric objects (input) and returning other geometric objects (output). Thus, for a given problem, if we know one function (construction) that solves the problem, we can compare it to any other function to check whether they are equivalent or not. Two functions are equivalent if, and only if, they have the same output when the same input is applied. If the student`s solution is equivalent to the template`s solution, then we consider the student`s solution as a correct solution. Our software utility provides both authoring and checking tools to work directly on the Internet, together with learning management systems. These tools are implemented using the dynamic geometry software, iGeom, which has been used in a geometry course since 2004 and has a successful track record in the classroom. Empowered with these new features, iGeom simplifies teachers` tasks, solves non-trivial problems in student solutions and helps to increase student motivation by providing feedback in real time. (c) 2008 Elsevier Ltd. All rights reserved.