Search schemes for random optimization algorithms that preserve the asymptotic distribution

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Ximelagatran versus warfarin for prophylaxis of venous thromboembolism in major orthopedic surgery: systematic review of randomized controlled trials

INTRODUÇÃO: O ximelagatrano foi recentemente estudada para profilaxia do tromboembolismo venoso (TEV). OBJETIVO: Avaliar se o ximelagatrano comparado com a varfarina melhora a profilaxia do TEV em pacientes submetidos à cirurgia ortopédica do joelho. FONTE DE DADOS: Estudos randomizados identificados por pesquisa eletrônica na literatura médica, até 2006, cujos dados foram compilados no programa Review Manager, versão 4.2.5. RESULTADOS: Foram incluídos três estudos randomizados bem conduzidos envolvendo 4.914 participantes. Foram definidos dois sub-grupos com dosagens diferentes de ximelagatrano (24 mg and 36 mg, duas vezes ao dia). O tratamento com ximelagatrano mostrou freqüência significantemente menor de TEV que o tratamento com varfarina, mas somente na dosagem de 36-mg [risco relativo, RR 0.72 ([intervalo de confiança, IC, 95% 0.64, 0.81), p < 0.00001]. A freqüência de TEV no sub-grupo de 24-mg foi similar a da varfarina [RR 0.86 (IC 95% 0.73, 1.01), p = 0.06]. Para TEV maior, embolia pulmonar, sangramento e sangramento maior não houve diferença entre varfarina e a ximelagatrano. Ao final do tratamento, a elevação da alanino-aminotransferase (ALT) foi menos freqüente no sub-grupo de 24 mg de ximelagatrano que no grupo da varfarina [RR 0.33 (IC 95% 0.12, 0.91) p = 0.03], mas no período de acompanhamento essa elevação foi maior com 36 mg de ximelagatrano [RR 6.97 (IC 95% 1.26, 38.50) p = 0.03]. CONCLUSÃO: O ximelagatrano foi mais efetivo que a varfarina quando usado em dosagens maiores (36 mg, 2 vezes ao dia), mas às expensas de aumento de enzimas hepáticas no período de acompanhamento.

Using Amino Acid Correlation and Community Detection Algorithms to Identify Functional Determinants in Protein Families

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

Use of genetic algorithms and solvation potential to study peptides structure

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains and implicit solvation potential are used to optimize the tertiary structure of peptides. We starting from the known PDB structure of its backbone which is kept fixed while the side chains allowed adopting the conformations present in the rotamer library. It was used rotamer library independent of backbone and a implicit solvation potential. The structure of Mastoporan-X was predicted using several force fields with a growing complexity; we started it with a field where the only present interaction was Lennard-Jones. We added the Coulombian term and we considered the solvation effects through a term proportional to the solvent accessible area. This paper present good and interesting results obtained using the potential with solvation term and rotamer library. Hence, the algorithm (called YODA) presented here can be a good tool to the prediction problem. (c) 2007 Elsevier B.V. All rights reserved.

ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.

On the dissimilarity between the algorithms for computing the symmetric energy-momentum tensor in ordinary field theory and general relativity

The recipe used to compute the symmetric energy-momentum tensor in the framework of ordinary field theory bears little resemblance to that used in the context of general relativity, if any. We show that if one stal ts fi om the field equations instead of the Lagrangian density, one obtains a unified algorithm for computing the symmetric energy-momentum tensor in the sense that it can be used for both usual field theory and general relativity.

Relationship between diet and anticoagulant response to warfarin - A factor analysis

Background Diet composition is one of the factors that may contribute to intraindividual variability in the anticoagulant response to warfarin. Aim of the study To determine the associations between food pattern and anticoagulant response to warfarin in a group of Brazilian patients with vascular disease. Methods Recent and usual food intakes were assessed in 115 patients receiving warfarin; and corresponding plasma phylloquinone (vitamin K-1), serum triglyceride concentrations, prothrombin time (PT), and International Normalized Ratio (INR) were determined. A factor analysis was used to examine the association of specific foods and biochemical variables with anticoagulant data. Results Mean age was 59 +/- 15 years. Inadequate anticoagulation, defined as values of INR 2 or 3, was found in 48% of the patients. Soybean oil and kidney beans were the primary food sources of phylloquinone intake. Factor analysis yielded four separate factors, explaining 56.4% of the total variance in the data set. The factor analysis revealed that intakes of kidney beans and soybean oil, 24-h recall of phylloquinone intake, PT and INR loaded significantly on factor 1. Triglycerides, PT, INR, plasma phylloquinone, and duration of anticoagulation therapy loaded on factor 3. Conclusion Fluctuations in phylloquinone intake, particularly from kidney beans, and plasma phylloquinone concentrations were associated with variation in measures of anticoagulation (PT and INR) in a Brazilian group of patients with vascular disease.

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

A cost optimization-based design of precast concrete floors using genetic algorithms

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.