Effects of recovery type after a judo combat on blood lactate removal and on performance in an intermittent anaerobic task

Aim. The objective of this study was to verify the effects of active (AR) and passive recovery (PR) after a judo match on blood lactate removal and on performance in an anaerobic intermittent task (4 bouts of upper body Wingate tests with 3-min interval between bouts; 4WT).Methods. The sample was constituted by 17 male judo players of different competitive levels: A) National (Brazil) and International medallists (n. 5). B) State (São Paulo) medallists (n. 7). Q City (São Paulo) medallists (n. 5). The subjects were submitted to: 1) a treadmill test for determination of VO2peak and velocity at anaerobic threshold (VAT); 2) body composition; 3) a 5-min judo combat, 15-min of AR or PR followed by 4WT.Results. The groups did not differ with respect to: body weight, VO2peak, VAT, body fat percentage, blood lactate after combats. No difference was observed in performance between AR and PR, despite a lower blood lactate after combat (10 and 15 min) during AR compared to PR. Groups A and B performed better in the high-intensity intermittent exercise compared to athletes with lower competitive level (C).Conclusion. The ability to maintain power output during intermittent anaerobic exercises can discriminate properly judo players of different levels. Lactate removal was improved with AR when compared to PR but AR did not improve performance in a subsequent intermittent anaerobic exercise.

The influence of visual stimuli in ethnobotanical data collection using the listing task method

The listing task, a method used in social and behavioral sciences, is frequently used in ethnobotanical research to constructfolk taxonomies and select relevant itemsfor subsequent research. The objective of the present study was to determine whether visual stimuli are associated with responses to the theme plants or if context influences the answers. Interviews were conducted with 400 women in Rio Claro, São Paulo, Brazil, in four different locations: three with a visible presence of plants (a plant store, a supermarket, and a public plaza) and one with no plants (a street corner in the center of the city). The women were asked to name plants. Analysis indicates that visual stimuli influenced responses and that this is more marked in the plant store than in the other locations. The plants cited most often-roses, orchids, ferns, violets, and daisies-were, with little variation, the same in all the locales studied.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Lagrangian heuristic for a class of the generalized assignment problems

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

A transactional runtime system for the Cell/BE architecture

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Static converter: didactic support software

Teaching a course of special electric loads in a continuing education program to power engineers is a difficult task because they are not familiarized with switching topology circuits. Normally, in a typical program, many hours are dedicated to explain the thyristors switching sequence and to draw the converter currents and terminal voltages waveforms for different operative conditions. This work presents teaching support software in order to optimize the time spent in this task and, mainly to benefit the assimilation of the proposed subjects, studying the static converter under different non-ideal operative conditions.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Design of microirrigation systems in sloping lands using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

The effect of trail length on task partitioning in three Acromyrmex species (Hymenoptera: Formicidae)

By comparing the behavior of three Acromyrmex (Hymenoptera, Formicidae) species during foraging on artificial trails of different lengths, we observed the occurrence of task partitioning and its relation to the food distance from the nest. Task partitioning was verified by leaf cache formation along the trail and leaf direct transferring among workers. There was significant difference between the number of leaf fragments carried directly to the fungus chamber and those transferred direct or indirectly, via cache, depending upon the trail length. Task partitioning could be a strategy used by leaf-cutting ants that allows the workers to use food sources far from their nests.