THE ROLE OF THE SUPERIOR COLLICULUS IN PREDATORY HUNTING

Combining the results of behavioral, neuronal immediate early gene activation, lesion and neuroanatomical experiments, we have presently investigated the role of the superior colliculus (SC) in predatory hunting. First, we have shown that insect hunting is associated with a characteristic large increase in Fos expression in the lateral part of the intermediate gray layer of the SC (Wig). Next, we have shown that animals with bilateral NMDA lesions of the lateral parts of the SC presented a significant delay in starting to chase the prey and longer periods engaged in other activities than predatory hunting. They also showed a clear deficit to orient themselves toward the moving prey and lost the stereotyped sequence of actions seen for capturing, holding and killing the prey. Our Phaseolus vulgaris-leucoagglutinin analysis revealed that the lateral SCig, besides providing the well-documented descending crossed pathway to premotor sites in brainstem and spinal cord, projects to a number of midbrain and diencephalic sites likely to influence key functions in the context of the predatory behavior, such as general levels of arousal, motivational level to hunt or forage, behavioral planning, appropriate selection of the basal ganglia motor plan to hunt, and motor output of the primary motor cortex. In contrast to the lateral SC lesions, medial SC lesions produced a small deficit in predatory hunting, and compared to what we have seen for the lateral SCig, the medial SCig has a very limited set of projections to thalamic sites related to the control of motor planning or motor output, and provides conspicuous inputs to brainstem sites involved in organizing a wide range of anti-predatory defensive responses. Overall, the present results served to clarify how the different functional domains in the SC may mediate the decision to pursue and hunt a prey or escape from a predator. (C) 2010 IBRO. Published by 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.