High resolution in situ microsensor measurements of oxygen and temperature at a vesicomyid clam colony in the Japan Deep Sea Trench

Oxygen penetration depth and temperature at the rim of the clam colony was measured with a small deep-sea microprofiler module (Treude et al., 2009), carrying 3 oxygen Clark-type microelectrodes (Revsbech et al., 1980) and one temperature sensor (Pt100, UST Umweltsensorentechnik GmbH, Germany). High-resolution microprofiles across the sediment-water interface were measured with a vertical resolution of 100 µm on a total length of 15 cm. Oxygen electrodes had a linear response to the oxygen concentration in seawater and were calibrated in situ using constant readings in the bottom water (oxygen concentration determined by Winkler titration) and the anoxic parts of the sediment.

Ex situ sulphate reduction rates of sediment at the rim of a vesicomyd clam colony in the Japan Deep Sea Trench (dive 955)

Sediment samples were collected from the rim of a large vesicomyid clam colony in the Japan Deep Sea Trench. Immediately after sample recovery onboard, the sediment core was sub-sampled for ex situ rate measurements. Sulfate reduction were measured ex situ by the whole core injection method with three replicates. We incubated the samples at in situ temperature (1.5°C) for 48 hours with carrier-free 35SO4 (dissolved in water, 50 kBq). Sediment was fixed 20 ml ZnAc solution (20%, w/v) for AOM or SR. Turnover rates were measured as previously described (Kallmeyer et al., 2004).

Ex situ sulphate reduction rates of sediment at the rim of a vesicomyd clam colony in the Japan Deep Sea Trench (dive 957)

Sediment samples were collected from the rim of a large vesicomyid clam colony in the Japan Deep Sea Trench. Immediately after sample recovery onboard, the sediment core was sub-sampled for ex situ rate measurements. Sulfate reduction were measured ex situ by the whole core injection method with three replicates. We incubated the samples at in situ temperature (1.5°C) for 48 hours with carrier-free 35SO4 (dissolved in water, 50 kBq). Sediment was fixed 20 ml ZnAc solution (20%, w/v) for AOM or SR. Turnover rates were measured as previously described (Kallmeyer et al., 2004).

The foundation of the Mexican welfare state and social security reform in the 1990s

Before 1982 Mexico's welfare state regime was a limited conservative one that put priority on the social security of organized labor. But following the country's debt crisis in 1982, this regime changed to a hybrid liberal model. The Ernest Zedillo government (1995-2000) in particular pushed ahead with liberal reform of the social security system. This paper examines the characteristics and the policy making of the social security reforms in the 1990s. The results suggest that underlying these reforms was the restructuring of the economy and the need to cope with the cost of this restructuring. The paper also points out that one of the main factors making possible the rapid execution of the reforms were the weakened political clout of the officialist labor unions due to their steady breakdown during the 1990s and the increase in the monopolistic power of the state vis-a-vis the position of labor during the negotiations on social security reforms.

Self-organizing Routing Algorithm fo Wireless Sensors Networks (WSN) using Ant Colony Optimization (ACO) with Tinyos.

This paper describes the basic tools to work with wireless sensors. TinyOShas a componentbased architecture which enables rapid innovation and implementation while minimizing code size as required by the severe memory constraints inherent in sensor networks. TinyOS's component library includes network protocols, distributed services, sensor drivers, and data acquisition tools ? all of which can be used asia or be further refined for a custom application. TinyOS was originally developed as a research project at the University of California Berkeley, but has since grown to have an international community of developers and users. Some algorithms concerning packet routing are shown. Incar entertainment systems can be based on wireless sensors in order to obtain information from Internet, but routing protocols must be implemented in order to avoid bottleneck problems. Ant Colony algorithms are really useful in such cases, therefore they can be embedded into the sensors to perform such routing task.

Towards the foundation of a global modes concept

A contribution is presented, intended to provide theoretical foundations for the ongoing efforts to employ global instability theory for the analysis of the classic boundary-layer flow, and address the associated issue of appropriate inflow/outflow boundary conditions to close the PDE-based global eigenvalue problem in open flows. Starting from a theoretically clean and numerically simple application, in which results are also known analytically and thus serve as a guidance for the assessment of the performance of the numerical methods employed herein, a sequence of issues is systematically built into the target application, until we arrive at one representative of open systems whose instability is presently addressed by global linear theory applied to open flows, the latter application being neither tractable theoretically nor straightforward to solve by numerical means. Experience gained along the way is documented. It regards quantification of the depar- ture of the numerical solution from the analytical one in the simple problem, the generation of numerical boundary layers at artificially truncated boundaries, no matter how far the latter are placed from the region of highest flow gradients and, ultimately the impracti- cally large number of (direct and adjoint) modes necessary to project an arbitrary initial perturbation and follow its temporal evolution by a global analysis approach, a finding which may question the purported robustness reported in the literature of the recovery of optimal perturbations as part of global analyses yielding under-resolved eigenspectra.

Intensive Metrics for the Study of the Evolution of Open Source Projects: Case Studies from Apache Software Foundation Projects

Based on the empirical evidence that the ratio of email messages in public mailing lists to versioning system commits has remained relatively constant along the history of the Apache Software Foundation (ASF), this paper has as goal to study what can be inferred from such a metric for projects of the ASF. We have found that the metric seems to be an intensive metric as it is independent of the size of the project, its activity, or the number of developers, and remains relatively independent of the technology or functional area of the project. Our analysis provides evidence that the metric is related to the technical effervescence and popularity of project, and as such can be a good candidate to measure its healthy evolution. Other, similar metrics -like the ratio of developer messages to commits and the ratio of issue tracker messages to commits- are studied for several projects as well, in order to see if they have similar characteristics.

Response threshold models, stochastic learning automata and ant colony optimization-based decentralized self-coordination algorithms for heterogeneous multi-tasks distribution in multi-robot systems

In recent decades, there has been an increasing interest in systems comprised of several autonomous mobile robots, and as a result, there has been a substantial amount of development in the eld of Articial Intelligence, especially in Robotics. There are several studies in the literature by some researchers from the scientic community that focus on the creation of intelligent machines and devices capable to imitate the functions and movements of living beings. Multi-Robot Systems (MRS) can often deal with tasks that are dicult, if not impossible, to be accomplished by a single robot. In the context of MRS, one of the main challenges is the need to control, coordinate and synchronize the operation of multiple robots to perform a specic task. This requires the development of new strategies and methods which allow us to obtain the desired system behavior in a formal and concise way. This PhD thesis aims to study the coordination of multi-robot systems, in particular, addresses the problem of the distribution of heterogeneous multi-tasks. The main interest in these systems is to understand how from simple rules inspired by the division of labor in social insects, a group of robots can perform tasks in an organized and coordinated way. We are mainly interested on truly distributed or decentralized solutions in which the robots themselves, autonomously and in an individual manner, select a particular task so that all tasks are optimally distributed. In general, to perform the multi-tasks distribution among a team of robots, they have to synchronize their actions and exchange information. Under this approach we can speak of multi-tasks selection instead of multi-tasks assignment, which means, that the agents or robots select the tasks instead of being assigned a task by a central controller. The key element in these algorithms is the estimation ix of the stimuli and the adaptive update of the thresholds. This means that each robot performs this estimate locally depending on the load or the number of pending tasks to be performed. In addition, it is very interesting the evaluation of the results in function in each approach, comparing the results obtained by the introducing noise in the number of pending loads, with the purpose of simulate the robot's error in estimating the real number of pending tasks. The main contribution of this thesis can be found in the approach based on self-organization and division of labor in social insects. An experimental scenario for the coordination problem among multiple robots, the robustness of the approaches and the generation of dynamic tasks have been presented and discussed. The particular issues studied are: Threshold models: It presents the experiments conducted to test the response threshold model with the objective to analyze the system performance index, for the problem of the distribution of heterogeneous multitasks in multi-robot systems; also has been introduced additive noise in the number of pending loads and has been generated dynamic tasks over time. Learning automata methods: It describes the experiments to test the learning automata-based probabilistic algorithms. The approach was tested to evaluate the system performance index with additive noise and with dynamic tasks generation for the same problem of the distribution of heterogeneous multi-tasks in multi-robot systems. Ant colony optimization: The goal of the experiments presented is to test the ant colony optimization-based deterministic algorithms, to achieve the distribution of heterogeneous multi-tasks in multi-robot systems. In the experiments performed, the system performance index is evaluated by introducing additive noise and dynamic tasks generation over time.

Approximations on minimum weight pseudo-triangulation problem using ant colony optimization

In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. Globally optimal pseudo-triangulations with respect to the weight, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.