Global perturbation of the marine Ca isotopic composition in the aftermath of the Marinoan global glaciation

Ca isotopic compositions of Marinoan post-glacial carbonate successions in Brazil and NW Canada were measured Both basal dolostones display delta(44/40)Ca values between 1 and 0 7 parts per thousand overlying limestones show a negative Ca isotope excursion to values around 0 1 parts per thousand and delta(44/40)Ca values rapidly increase up-section to near 2 0 parts per thousand In the Brazilian successions those high delta(44/40)Ca values rapidly decrease and stabilize to values between 0 6 and 0 9 parts per thousand These Ca isotope secular variation trends are unlike those of Sturtian post-glacial carbonate successions but similar to those of Marinoan post-glacial carbonate successions in Namibia suggesting that the perturbation of the marine Ca cycle was global This recommends Ca isotope stratigraphy as a tool to correlate Neoproterozoic post-glacial carbonate successions worldwide While the lowermost and uppermost strata have delta(44/40)Ca values typical of Phanerozoic carbonates the extremes 0 1 and 2 0 parts per thousand have not been thus far reported for other marine carbonates These extreme values suggest a short-lived non-actualistic perturbation in the marine Ca cycle Simple box modelling of the Marinoan post-glacial marine Ca cycle can reproduce the extreme values only by postulating a two-step process with Ca input initially exceeding Ca removal trough carbonate precipitation followed by precipitation overtaking a decreased Ca Input (C) 2010 Elsevier B V All rights reserved

Geology and geochronology of the Betara region in south-southeastern Brazil: Evidence for possible Statherian (1.80-1.75 Ga) and Calymmian (1.50-1.45 Ga) extension events

The results of geological mapping, chemical analysis and radiometric dating of metabasic rocks of Betara Formation, and mapping and dating of those present in the Betara basement nucleus together with mylonitic granodiorite and syenogranite are reported here. U-Pb analysis of bulk zircon fractions from the metabasic rocks of the basement nucleus yielded a Statherian age of 1790 +/- 22 Ma, while the metabasic rocks from the upper part of the Betara Formation yielded a Calymmian age between 1500 and 1450 Ma. This age is a minimum for the deposition of the Betara Formation. The older metabasic rocks are associated with post-tectonic, possibly anorogenic syenogranite, while the younger ones are gabbro or very porphyritic ankaramite whose REE patterns are consistent with crystallization from an N-MORB parent magma. The observations and data point to the probable events associated with extensional processes of the end of Paleoproterozoic and early Mesoproterozoic. Similar registers of Statherian (1.80-1.75 Ga) and Calymmian (1.50-1.45 Ga) extensional events are recorded in other parts of the South American and African continents. The Neoproterozoic witnessed the formation and junction of the tectonic slices which formed the Apiai domain during the assemblage of western Gondwana. (C) 2010 International Association for Gondwana Research. Published by Elsevier B.V. All rights reserved.

THE SOUTHERN BRAZILIAN SHELF: GENERAL CHARACTERISTICS, QUATERNARY EVOLUTION AND SEDIMENT DISTRIBUTION

Extending from latitude 34 degrees S to 22 degrees S the Southern Brazilian shelf constitutes the only part of the Brazilian shelf with a subtropical to temperate environment. The studies on the different geological aspects of the area began in the 1960`s and have recently been reassessed after studies related to the determination of the Economic Exclusive Zone. In terms of morphology, the Southern Brazilian shelf may be divided into three sectors, the Sao Paulo Bight, the Florianopolis-Mostardas Sector and the Rio Grande Cone, characterized by conspicuous differences in terms of geological determining factors, bathymetry, declivities and the presence of canyons and channels. Despite the existence of hundreds of radiocarbon datings the sea level changes curve of southern Brazil during the Last Glacial Cycle is still a matter of debate. A recent controversy on the Middle and late Holocene sea level changes curve raised the question of the amplitude of the oscillations which occurred in the period. Also, a few but relatively consistent radiocarbon datings suggest the occurrence of a high sea level during Isotope Stage 3. In terms of sedimentary cover the Southern Brazilian shelf exhibits a very strong hydrodynamic control, both latitudinal and bathymetrical. The sector southward from 25 degrees S is characterized by the influence of the plume of water carrying sediments originating from the Rio de La Plata. Actually its presence is conspicuous up to 28 degrees S, with the area between this latitude and 25 degrees S constituting a transitional zone. In terms of bathymetry the outer shelf is marked by the ""floor-polisher"" effect of the Brazil Current, which is responsible for the maintenance of a relict facies in areas deeper than 100 meters.

Scheduling Grid Applications with Software Requirements

The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. One way to provide such environments is to use virtualization on demand. This paper presents two schedulers based on integer linear programming which schedule virtual machines (VMs) in grid resources and tasks on these VMs. The schedulers differ from previous work by the joint scheduling of tasks and VMs and by considering the impact of the available bandwidth on the quality of the schedule. Experiments show the efficacy of the schedulers in scenarios with different network configurations.

Structural matching of 2D electrophoresis gels using deformed graphs

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential analysis between pairs of images to study changes in protein content. It is thus necessary to register two images by finding spot correspondences. Although it may seem a simple task, generally, the manual processing of this kind of images is very cumbersome, especially when strong variations between corresponding sets of spots are expected (e.g. strong non-linear deformations and outliers). In order to solve this problem, this paper proposes a new quadratic assignment formulation together with a correspondence estimation algorithm based on graph matching which takes into account the structural information between the detected spots. Each image is represented by a graph and the task is to find a maximum common subgraph. Successful experimental results using real data are presented, including an extensive comparative performance evaluation with ground-truth data. (C) 2010 Elsevier B.V. All rights reserved.

Multiple camera people detection and tracking using support integration

This paper proposes a method to locate and track people by combining evidence from multiple cameras using the homography constraint. The proposed method use foreground pixels from simple background subtraction to compute evidence of the location of people on a reference ground plane. The algorithm computes the amount of support that basically corresponds to the ""foreground mass"" above each pixel. Therefore, pixels that correspond to ground points have more support. The support is normalized to compensate for perspective effects and accumulated on the reference plane for all camera views. The detection of people on the reference plane becomes a search for regions of local maxima in the accumulator. Many false positives are filtered by checking the visibility consistency of the detected candidates against all camera views. The remaining candidates are tracked using Kalman filters and appearance models. Experimental results using challenging data from PETS`06 show good performance of the method in the presence of severe occlusion. Ground truth data also confirms the robustness of the method. (C) 2010 Elsevier B.V. All rights reserved.

Repetition-free longest common subsequence

We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard. (C) 2009 Elsevier B.V. All rights reserved.

Formalization of an architectural model for exception handling coordination based on CA action concepts

Architectures based on Coordinated Atomic action (CA action) concepts have been used to build concurrent fault-tolerant systems. This conceptual model combines concurrent exception handling with action nesting to provide a general mechanism for both enclosing interactions among system components and coordinating forward error recovery measures. This article presents an architectural model to guide the formal specification of concurrent fault-tolerant systems. This architecture provides built-in Communicating Sequential Processes (CSPs) and predefined channels to coordinate exception handling of the user-defined components. Hence some safety properties concerning action scoping and concurrent exception handling can be proved by using the FDR (Failure Divergence Refinement) verification tool. As a result, a formal and general architecture supporting software fault tolerance is ready to be used and proved as users define components with normal and exceptional behaviors. (C) 2010 Elsevier B.V. All rights reserved.

Performance results of running parallel applications on the InteGrade

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of running parallel applications with communication among processors on the InteGrade grid. As costly communication on a grid can be prohibitive, we explore the so-called systolic or wavefront paradigm to design the parallel algorithms in which no global communication is used. To evaluate the InteGrade middleware we considered three parallel algorithms that solve the matrix chain product problem, the 0-1 Knapsack Problem, and the local sequence alignment problem, respectively. We show that these three applications running under the InteGrade middleware and MPI take slightly more time than the same applications running on a cluster with only LAM-MPI support. The results can be considered promising and the time difference between the two is not substantial. The overhead of the InteGrade middleware is acceptable, in view of the benefits obtained to facilitate the use of grid computing by the user. These benefits include job submission, checkpointing, security, job migration, etc. Copyright (C) 2009 John Wiley & Sons, Ltd.

An Information Theory framework for two-stage binary image operator design

The design of translation invariant and locally defined binary image operators over large windows is made difficult by decreased statistical precision and increased training time. We present a complete framework for the application of stacked design, a recently proposed technique to create two-stage operators that circumvents that difficulty. We propose a novel algorithm, based on Information Theory, to find groups of pixels that should be used together to predict the Output Value. We employ this algorithm to automate the process of creating a set of first-level operators that are later combined in a global operator. We also propose a principled way to guide this combination, by using feature selection and model comparison. Experimental results Show that the proposed framework leads to better results than single stage design. (C) 2009 Elsevier B.V. All rights reserved.

On AGM for Non-Classical Logics

The AGM theory of belief revision provides a formal framework to represent the dynamics of epistemic states. In this framework, the beliefs of the agent are usually represented as logical formulas while the change operations are constrained by rationality postulates. In the original proposal, the logic underlying the reasoning was supposed to be supraclassical, among other properties. In this paper, we present some of the existing work in adapting the AGM theory for non-classical logics and discuss their interconnections and what is still missing for each approach.

On cohomologies and extensions of cyclic groups

Cohomology groups H(s)(Z(n), Z(m)) are studied to describe all groups up to isomorphism which are (central) extensions of the cyclic group Z(n) by the Z(n)-module Z(m). Further, for each such a group the number of non-equivalent extensions is determined. (C) 2011 Elsevier B.V. All rights reserved.

Coincidence Wecken homotopies versus Wecken homotopies relative to a fixed homotopy in one of the maps

We study the 1-parameter Wecken problem versus the restricted Wecken problem, for coincidence free pairs of maps between surfaces. For this we use properties of the function space between two surfaces and of the pure braid group on two strings of a surface. When the target surface is either the 2-sphere or the torus it is known that the two problems are the same. We classify most pairs of homotopy classes of maps according to the answer of the two problems are either the same or different when the target is either projective space or the Klein bottle. Some partial results are given for surfaces of negative Euler characteristic. (C) 2010 Elsevier B.V. All rights reserved.

Equivariant Nielsen root theory for G-maps

Let X be a compact Hausdorff space, Y be a connected topological manifold, f : X -> Y be a map between closed manifolds and a is an element of Y. The vanishing of the Nielsen root number N(f; a) implies that f is homotopic to a root free map h, i.e., h similar to f and h(-1) (a) = empty set. In this paper, we prove an equivariant analog of this result for G-maps between G-spaces where G is a finite group. (C) 2010 Elsevier B.V. All rights reserved.

The influence of ARIMA-GARCH parameters in feed forward neural networks prediction

The objective of this article is to find out the influence of the parameters of the ARIMA-GARCH models in the prediction of artificial neural networks (ANN) of the feed forward type, trained with the Levenberg-Marquardt algorithm, through Monte Carlo simulations. The paper presents a study of the relationship between ANN performance and ARIMA-GARCH model parameters, i.e. the fact that depending on the stationarity and other parameters of the time series, the ANN structure should be selected differently. Neural networks have been widely used to predict time series and their capacity for dealing with non-linearities is a normally outstanding advantage. However, the values of the parameters of the models of generalized autoregressive conditional heteroscedasticity have an influence on ANN prediction performance. The combination of the values of the GARCH parameters with the ARIMA autoregressive terms also implies in ANN performance variation. Combining the parameters of the ARIMA-GARCH models and changing the ANN`s topologies, we used the Theil inequality coefficient to measure the prediction of the feed forward ANN.