Resting metabolic rates of two orbweb spiders: A first approach to evolutionary success of ecribellate spiders

Spiders are considered conservative with regard to their resting metabolic rate, presenting the same allometric relation with body mass as the majority of land-arthropods. Nevertheless, web-building is thought to have a great impact on the energetic metabolism, and any modification that affects this complex behavior is expected to have an impact over the daily energetic budget. We analyzed the possibility of the presence of the cribellum having an effect on the allometric relation between resting metabolic rate and body mass for an ecribellate species (Zosis geniculata) and a cribellate one (Metazygia rogenhoferi), and employed a model selection approach to test if these species had the same allometric relationship as other land-arthropods. Our results show that M. rogenhoferi has a higher resting metabolic rate, while Z. geniculata fitted the allometric prediction for land arthropods. This indicates that the absence of the cribellum is associated with a higher resting metabolic rate, thus explaining the higher promptness to activity found for the ecribellate species. If our result proves to be a general rule among spiders, the radiation of Araneoidea could be connected to a more energy-consuming life style. Thus, we briefly outline an alternative model of diversification of Araneoidea that accounts for this possibility. (C) 2011 Elsevier Ltd. All rights reserved.

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. 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.