Water beetles in mountainous regions in southeastern Brazil

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

Molecular detection of in-vivo microbial contamination of metallic orthodontic brackets by checkerboard DNA-DNA hybridization

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

Avaliação do meio ambiente de Santa Gertrudes - SP e propostas para uma agenda local

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

Identificação de ilhas de calor na área urbana de Ilha Solteira - SP através da utilização de geotecnologias

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

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

A Study of Different Subsequence Elimination Strategies for the Soft Drink Production Planning

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

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

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

Integrating species life-history traits and patterns of deforestation in amphibian conservation planning

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

An implementation of modified scatter search algorithm to transmission expansion planning

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

Strategies to model scheduling decisions to plan the soft drink production process

In this paper we present a mixed integer model that integrates lot sizing and lot scheduling decisions for the production planning of a soft drink company. The main contribution of the paper is to present a model that differ from others in the literature for the constraints related to the scheduling decisions. The proposed strategy is compared to other strategies presented in the literature.

Nutritional strategies of physically active subjects with muscle dysmorphia

Background: The aim of this study was to identify dietary strategies for physically active individuals with muscle dysmorphia based on a systematic literature review. Method. References were included if the study population consisted of adults over 18 years old who were physically active in fitness centers. We identified reports through an electronic search ofScielo, Lilacs and Medline using the following keywords: muscle dysmorphia, vigorexia, distorted body image, and exercise. We found eight articles in Scielo, 17 in Medline and 12 in Lilacs. Among the total number of 37 articles, only 17 were eligible for inclusion in this review. Results: The results indicated that the feeding strategies used by physically active individuals with muscle dysmorphia did not include planning or the supervision of a nutritionist. Diet included high protein and low fat foods and the ingestion of dietary and ergogenic supplements to reduce weight. Conclusion: Physically active subjects with muscle dysmorphia could benefit from the help of nutritional professionals to evaluate energy estimation, guide the diet and its distribution in macronutrient and consider the principle of nutrition to functional recovery of the digestive process, promote liver detoxification, balance and guide to organic adequate intake of supplemental nutrients and other substances. © 2013 Contesini et al.; licensee BioMed Central Ltd.

Environment and dispersal paths override life strategies and residence time in determining regional patterns of invasion by alien plants

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.