Resource-dependent livelihoods and the natural resource base

The natural resource base, terrestrial and marine, provides rural households in lower-income countries with income, food, shelter, and medicines, which are variously gathered and hunted in common lands and waters. These resources may be actively managed, whether by the government or local community; or may be de facto open access, with little effort by governments to prevent what may be de jure illegal extraction. This paper provides an appraisal of the literature that encompasses the direct value of wild resources to rural households; the extent to which these resources mitigate poverty and inequality; and the importance of the institutional context. The literature is increasingly addressing competing demands on the resource base both to support nearby livelihoods, and to enhance ecosystem services such as biodiversity; and how initiatives such as community-based payments for ecosystem services are changing how people interact with the resource base.

Nested diets: a novel pattern of individual-level resource use

Many generalist populations may actually be composed of relatively specialist individuals. This `individual specialization` may have important ecological and evolutionary implications. Although this phenomenon has been documented in more than one hundred taxa, it is still unclear how individuals within a population actually partition resources. Here we applied several methods based on network theory to investigate the intrapopulation patterns of resource use in the gracile mouse opossum Gracilinanus microtarsus. We found evidence of significant individual specialization in this species and that the diets of specialists are nested within the diets of generalists. This novel pattern is consistent with a recently proposed model of optimal foraging and implies strong asymmetry in the interactions among individuals of a population.

Resource defense polygyny shifts to female defense polygyny over the course of the reproductive season of a Neotropical harvestman

Although studies classify the polygynous mating system of a given species into female defense polygyny (FDP) or resource defense polygyny (RDP), the boundary between these two categories is often slight. Males of some species may even shift between these two types of polygyny in response to temporal variation in social and environmental conditions. Here, we examine the mating system of the Neotropical harvestman Acutisoma proximum and, in order to assess if mate acquisition in males corresponds to FDP or RDP, we tested four contrasting predictions derived from the mating system theory. At the beginning of the reproductive season, males fight with other males for the possession of territories on the vegetation where females will later oviposit, as expected in RDP. Females present a marked preference for specific host plant species, and males establish their territories in areas where these host plants are specially abundant, which is also expected in RDP. Later in the reproductive season, males reduce their patrolling activity and focus on defending individual females that are ovipositing inside their territories, as what occurs in FDP. This is the first described case of an arachnid that exhibits a shift in mating system over the reproductive season, revealing that we should be cautious when defining the mating system of a species based on few observations concentrated in a brief period.

The nested assembly of individual-resource networks

P>1. Much of the current understanding of ecological systems is based on theory that does not explicitly take into account individual variation within natural populations. However, individuals may show substantial variation in resource use. This variation in turn may be translated into topological properties of networks that depict interactions among individuals and the food resources they consume (individual-resource networks). 2. Different models derived from optimal diet theory (ODT) predict highly distinct patterns of trophic interactions at the individual level that should translate into distinct network topologies. As a consequence, individual-resource networks can be useful tools in revealing the incidence of different patterns of resource use by individuals and suggesting their mechanistic basis. 3. In the present study, using data from several dietary studies, we assembled individual-resource networks of 10 vertebrate species, previously reported to show interindividual diet variation, and used a network-based approach to investigate their structure. 4. We found significant nestedness, but no modularity, in all empirical networks, indicating that (i) these populations are composed of both opportunistic and selective individuals and (ii) the diets of the latter are ordered as predictable subsets of the diets of the more opportunistic individuals. 5. Nested patterns are a common feature of species networks, and our results extend its generality to trophic interactions at the individual level. This pattern is consistent with a recently proposed ODT model, in which individuals show similar rank preferences but differ in their acceptance rate for alternative resources. Our findings therefore suggest a common mechanism underlying interindividual variation in resource use in disparate taxa.

Sexual System, Sex Ratio, and Group Living in the Shrimp Thor amboinensis (De Man): Relevance to Resource-Monopolization and Sex-Allocation Theories

The sexual system of the symbiotic shrimp Thor amboinensis is described, along with observations on sex ratio and host-use pattern of different populations. We used a comprehensive approach to elucidate the previously unknown sexual system of this shrimp. Dissections, scanning electron microscopy, size-frequency distribution analysis, and laboratory observations demonstrated that T amboinensis is a protandric hermaphrodite: shrimp first mature as males and change into females later in life. Thor amboinensis inhabited the large and structurally heterogeneous sea anemone Stichoclactyla helianthus in large groups (up to 11 individuals) more frequently than expected by chance alone. Groups exhibited no particularly complex social structure and showed male-biased sex ratios more frequently than expected by chance alone. The adult sex ratio was male-biased in the four separate populations studied, one of them being thousands of kilometers apart from the others. This study supports predictions central to theories of resource monopolization and sex allocation. Dissections demonstrated that unusually large males were parasitized by an undescribed species of isopod (family Entoniscidae). Infestation rates were similarly low in both sexes (approximate to 11%-12%). The available information suggests that T. amboinensis uses pure search promiscuity as a mating system. This hypothesis needs to be formally tested with mating behavior observations and field measurements on the movement pattern of both sexes of the species. Further detailed studies on the lifestyle and sexual system of all the species within this genus and the development of a molecular phylogeny are necessary to elucidate the evolutionary history of gender expression in the genus Thor.

A novel approach for distributed application scheduling based on prediction of communication events

The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. This, however, required new methods for process scheduling and distribution, considering the network latency, communication cost, heterogeneous environments and distributed computing constraints. An efficient distribution of processes over such environments requires an adequate scheduling strategy, as the cost of inefficient process allocation is unacceptably high. Therefore, a knowledge and prediction of application behavior is essential to perform effective scheduling. In this paper, we overview the evolution of scheduling approaches, focusing on distributed environments. We also evaluate the current approaches for process behavior extraction and prediction, aiming at selecting an adequate technique for online prediction of application execution. Based on this evaluation, we propose a novel model for application behavior prediction, considering chaotic properties of such behavior and the automatic detection of critical execution points. The proposed model is applied and evaluated for process scheduling in cluster and grid computing environments. The obtained results demonstrate that prediction of the process behavior is essential for efficient scheduling in large-scale and heterogeneous distributed environments, outperforming conventional scheduling policies by a factor of 10, and even more in some cases. Furthermore, the proposed approach proves to be efficient for online predictions due to its low computational cost and good precision. (C) 2009 Elsevier B.V. All rights reserved.

Prediction of dynamical, nonlinear, and unstable process behavior

Process scheduling techniques consider the current load situation to allocate computing resources. Those techniques make approximations such as the average of communication, processing, and memory access to improve the process scheduling, although processes may present different behaviors during their whole execution. They may start with high communication requirements and later just processing. By discovering how processes behave over time, we believe it is possible to improve the resource allocation. This has motivated this paper which adopts chaos theory concepts and nonlinear prediction techniques in order to model and predict process behavior. Results confirm the radial basis function technique which presents good predictions and also low processing demands show what is essential in a real distributed environment.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry`s own practice. (c) 2006 Elsevier Ltd. All rights reserved.

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

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.

Application execution management on the InteGrade opportunistic grid middleware

The InteGrade project is a multi-university effort to build a novel grid computing middleware based on the opportunistic use of resources belonging to user workstations. The InteGrade middleware currently enables the execution of sequential, bag-of-tasks, and parallel applications that follow the BSP or the MPI programming models. This article presents the lessons learned over the last five years of the InteGrade development and describes the solutions achieved concerning the support for robust application execution. The contributions cover the related fields of application scheduling, execution management, and fault tolerance. We present our solutions, describing their implementation principles and evaluation through the analysis of several experimental results. (C) 2010 Elsevier Inc. All rights reserved.