Soil carbon balance in a tropical grassland: Estimation of soil respiration and its partitioning using a semi-empirical model

In savannah and tropical grasslands, which account for 60% of grasslands worldwide, a large share of ecosystem carbon is located below ground due to high root:shoot ratios. Temporal variations in soil CO2 efflux (R-S) were investigated in a grassland of coastal Congo over two years. The objectives were (1) to identify the main factors controlling seasonal variations in R-S and (2) to develop a semi-empirical model describing R-S and including a heterotrophic component (R-H) and an autotrophic component (R-A). Plant above-ground activity was found to exert strong control over soil respiration since 71% of seasonal R-S variability was explained by the quantity of photosynthetically active radiation absorbed (APAR) by the grass canopy. We tested an additive model including a parameter enabling R-S partitioning into R-A and R-H. Assumptions underlying this model were that R-A mainly depended on the amount of photosynthates allocated below ground and that microbial and root activity was mostly controlled by soil temperature and soil moisture. The model provided a reasonably good prediction of seasonal variations in R-S (R-2 = 0.85) which varied between 5.4 mu mol m(-2) s(-1) in the wet season and 0.9 mu mol m(-2) s(-1) at the end of the dry season. The model was subsequently used to obtain annual estimates of R-S, R-A and R-H. In accordance with results reported for other tropical grasslands, we estimated that R-H accounted for 44% of R-S, which represented a flux similar to the amount of carbon brought annually to the soil from below-ground litter production. Overall, this study opens up prospects for simulating the carbon budget of tropical grasslands on a large scale using remotely sensed data. (C) 2012 Elsevier B.V. All rights reserved.

Monte Carlo Semi-Empirical Model for Si(Li) X-Ray Detector: Differences between Nominal and Fitted Parameters.

A detailed characterization of a X-ray Si(Li) detector was performed to obtain the energy dependence of efficiency in the photon energy range of 6.4 - 59.5 keV. which was measured and reproduced by Monte Carlo (MC) simulations. Significant discrepancies between MC and experimental values were found when lhe manufacturer parameters of lhe detector were used in lhe simulation. A complete Computerized Tomagraphy (CT) detector scan allowed to find the correct crystal dimensions and position inside the capsule. The computed efficiencies with the resulting detector model differed with the measured values no more than 10% in most of the energy range.

Experimental study on vortex-induced motions of a semi-submersible platform with four square columns, Part I: Effects of current incidence angle and hull appendages

An experimental study on Vortex-Induced Motion (VIM) of the semi-submersible platform concept with four square columns is presented. Model tests were carried out to check the influence of different headings and hull appendages (riser supports located at the pontoons; fairleads and the mooring stretches located vertically at the external column faces; and hard pipes located vertically at the internal column faces). The results comprise in-line, transverse and yaw motions, as well as combined motions in the XY plane, drag and lift forces and spectral analysis. The main results showed that VIM in the transverse direction occurred in a range of reduced velocity 4.0 up to 14.0 with amplitude peaks around reduced velocities around 7.0 and 8.0. The largest transverse amplitudes obtained were around 40% of the column width for 30 degrees and 45 degrees incidences. Another important result observed was a considerable yaw motion oscillation, in which a synchronization region could be identified as a resonance phenomenon. The largest yaw motions were verified for the 0 degrees incidence and the maxima amplitudes around 4.5 degrees. The hull appendages located at columns had the greatest influence on the VIM response of the semi-submersible. (C) 2012 Elsevier Ltd. All rights reserved.

Compact groups of galaxies selected by stellar mass: the 2MASS compact group catalogue

We present a photometric catalogue of compact groups of galaxies (p2MCGs) automatically extracted from the Two-Micron All Sky Survey (2MASS) extended source catalogue. A total of 262 p2MCGs are identified, following the criteria defined by Hickson, of which 230 survive visual inspection (given occasional galaxy fragmentation and blends in the 2MASS parent catalogue). Only one quarter of these 230 groups were previously known compact groups (CGs). Among the 144 p2MCGs that have all their galaxies with known redshifts, 85 (59?per cent) have four or more accordant galaxies. This v2MCG sample of velocity-filtered p2MCGs constitutes the largest sample of CGs (with N = 4) catalogued to date, with both well-defined selection criteria and velocity filtering, and is the first CG sample selected by stellar mass. It is fairly complete up to Kgroup similar to 9 and radial velocity of similar to 6000?km?s-1. We compared the properties of the 78 v2MCGs with median velocities greater than 3000?km?s-1 with the properties of other CG samples, as well as those (mvCGs) extracted from the semi-analytical model (SAM) of Guo et al. run on the high-resolution Millennium-II simulation. This mvCG sample is similar (i.e. with 2/3 of physically dense CGs) to those we had previously extracted on three other SAMs run on the Millennium simulation with 125 times worse spatial and mass resolutions. The space density of v2MCGs within 6000?km?s-1 is 8.0 X 10-5?h3?Mpc-3, i.e. four times that of the Hickson sample [Hickson Compact Group (HCG)] up to the same distance and with the same criteria used in this work, but still 40?per cent less than that of mvCGs. The v2MCG constitutes the first group catalogue to show a statistically large firstsecond ranked galaxy magnitude gap according to TremaineRichstone statistics, as expected if the first ranked group members tend to be the products of galaxy mergers, and as confirmed in the mvCGs. The v2MCG is also the first observed sample to show that first-ranked galaxies tend to be centrally located, again consistent with the predictions obtained from mvCGs. We found no significant correlation of group apparent elongation and velocity dispersion in the quartets among the v2MCGs, and the velocity dispersions of apparently round quartets are not significantly larger than those of chain-like ones, in contrast to what has been previously reported in HCGs. By virtue of its automatic selection with the popular Hickson criteria, its size, its selection on stellar mass, and its statistical signs of mergers and centrally located brightest galaxies, the v2MCG catalogue appears to be the laboratory of choice to study physically dense groups of four or more galaxies of comparable luminosity.

Records of migration in the exoplanet configurations

When compared to our Solar System, many exoplanet systems exhibit quite unusual planet configurations; some of these are hot Jupiters, which orbit their central stars with periods of a few days, others are resonant systems composed of two or more planets with commensurable orbital periods. It has been suggested that these configurations can be the result of a migration processes originated by tidal interactions of the planets with disks and central stars. The process known as planet migration occurs due to dissipative forces which affect the planetary semi-major axes and cause the planets to move towards to, or away from, the central star. In this talk, we present possible signatures of planet migration in the distribution of the hot Jupiters and resonant exoplanet pairs. For this task, we develop a semi-analytical model to describe the evolution of the migrating planetary pair, based on the fundamental concepts of conservative and dissipative dynamics of the three-body problem. Our approach is based on an analysis of the energy and the orbital angular momentum exchange between the two-planet system and an external medium; thus no specific kind of dissipative forces needs to be invoked. We show that, under assumption that dissipation is weak and slow, the evolutionary routes of the migrating planets are traced by the stationary solutions of the conservative problem (Birkhoff, Dynamical systems, 1966). The ultimate convergence and the evolution of the system along one of these modes of motion are determined uniquely by the condition that the dissipation rate is sufficiently smaller than the roper frequencies of the system. We show that it is possible to reassemble the starting configurations and migration history of the systems on the basis of their final states, and consequently to constrain the parameters of the physical processes involved.

Particle Competition and Cooperation in Networks for Semi-Supervised Learning

Semi-supervised learning is one of the important topics in machine learning, concerning with pattern classification where only a small subset of data is labeled. In this paper, a new network-based (or graph-based) semi-supervised classification model is proposed. It employs a combined random-greedy walk of particles, with competition and cooperation mechanisms, to propagate class labels to the whole network. Due to the competition mechanism, the proposed model has a local label spreading fashion, i.e., each particle only visits a portion of nodes potentially belonging to it, while it is not allowed to visit those nodes definitely occupied by particles of other classes. In this way, a "divide-and-conquer" effect is naturally embedded in the model. As a result, the proposed model can achieve a good classification rate while exhibiting low computational complexity order in comparison to other network-based semi-supervised algorithms. Computer simulations carried out for synthetic and real-world data sets provide a numeric quantification of the performance of the method.

Integrodifference model for blowfly invasion

We propose a stage-structured integrodifference model for blowflies' growth and dispersion taking into account the density dependence of fertility and survival rates and the non-overlap of generations. We assume a discrete-time, stage-structured, model. The spatial dynamics is introduced by means of a redistribution kernel. We treat one and two dimensional cases, the latter on the semi-plane, with a reflexive boundary. We analytically show that the upper bound for the invasion front speed is the same as in the one-dimensional case. Using laboratory data for fertility and survival parameters and dispersal data of a single generation from a capture-recapture experiment in South Africa, we obtain an estimate for the velocity of invasion of blowflies of the species Chrysomya albiceps. This model predicts a speed of invasion which was compared to actual observational data for the invasion of the focal species in the Neotropics. Good agreement was found between model and observations.

Semi-supervised learning guided by the modularity measure in complex networks

Semi-supervised learning techniques have gained increasing attention in the machine learning community, as a result of two main factors: (1) the available data is exponentially increasing; (2) the task of data labeling is cumbersome and expensive, involving human experts in the process. In this paper, we propose a network-based semi-supervised learning method inspired by the modularity greedy algorithm, which was originally applied for unsupervised learning. Changes have been made in the process of modularity maximization in a way to adapt the model to propagate labels throughout the network. Furthermore, a network reduction technique is introduced, as well as an extensive analysis of its impact on the network. Computer simulations are performed for artificial and real-world databases, providing a numerical quantitative basis for the performance of the proposed method.

Semi-supervised dimensionality reduction based on partial least squares for visual analysis of high dimensional data

Dimensionality reduction is employed for visual data analysis as a way to obtaining reduced spaces for high dimensional data or to mapping data directly into 2D or 3D spaces. Although techniques have evolved to improve data segregation on reduced or visual spaces, they have limited capabilities for adjusting the results according to user's knowledge. In this paper, we propose a novel approach to handling both dimensionality reduction and visualization of high dimensional data, taking into account user's input. It employs Partial Least Squares (PLS), a statistical tool to perform retrieval of latent spaces focusing on the discriminability of the data. The method employs a training set for building a highly precise model that can then be applied to a much larger data set very effectively. The reduced data set can be exhibited using various existing visualization techniques. The training data is important to code user's knowledge into the loop. However, this work also devises a strategy for calculating PLS reduced spaces when no training data is available. The approach produces increasingly precise visual mappings as the user feeds back his or her knowledge and is capable of working with small and unbalanced training sets.

Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provade a very Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that interferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is construtive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynominal-time algorithm for SQPn. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.