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.

Wannier functions of a one-dimensional photonic crystal with inversion symmetry

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

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.

Inversion in the temperature coefficient of the optical path length close to the glass transition temperature in tellurite glasses

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

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)

Pericentric inversion events in karyotypic distinction of Brazilian lizards of genus Phyllopezus (Squamata, Gekkonidae) detected by chromosomal banding patterns

Cytogenetic investigations based on conventional and differential staining analysis (C-and replication R-banding and Ag-staining) were carried out on eight specimens of Phyllopezus periosus, 17 of P. pollicaris pollicaris, and one of P. pollicaris przewalskii collected from different localities of Brazil. P. periosus and P. p. pollicaris share the same diploid number of 2n = 40 chromosomes, and their karyotypes are very distinctive regarding to the number of biarmed and uniarmed chromosomes. After careful side-by-side comparison of R-banded chromosomes in both taxa, pronounced homology between, at least, eight pairs was revealed. The R-banding patterns allowed us to postulate that karyotype differentiation could be due to pericentric inversion events. P. p. przewalskii (2n = 38) exhibited a very similar karyotype to that found in P. p. pollicaris, except for the presence of one metacentric pair, which probably resulted from a Robertsonian rearrangement. Single and multiple pairs of NOR-bearing chromosomes, showing variation in number and location, were detected among the three forms of Phyllopezus. Similar C-banding patterns were found in P. periosus and P. p. pollicaris. Sex chromosomes were not positively identified.

Cytogenetics of a new species of Paratelmatobius cardosoi group (Anura : Leptodactylidae), with the description of an apparent case of pericentric inversion

The karyotype of a new species of Paratelmatobius from the P cardosoi group is described. As with other Paratelmatobius and Scythrophrys karyotypes, Paratelmatobius sp. (aff. cardosoi) shows a diploid number of 24 chromosomes, in addition to other similarities with the former karyotypes. The Paratelmatobius sp. (aff. cardosoi) karyotype differs from that of P. cardosoi in the morphology of pair 4, the NOR location and the C-bands in pairs 3 and 8 (exclusive to Paratelmatobius sp.) and those of pairs 7 and 9 (exclusive to P. cardosoi). Both karyotypes also differ in the amount of heterochromatin in pair 1. The presence of interstitial heterochromatin in the long arm of pair 1 and the interstitial C-bands in both arms of chromosome 5 are apparently synapomorphic characters of P. cardosoi and Paratelmatobius sp. (aff. cardosoi), since they are absent in the other Paratelmatobius and Scythrophrys karyotypes. In Paratelmatobius sp. (aff. cardosoi), the nucleolus organizer region is on the short arm of a small metacentric chromosome (pair 9), an arrangement similar to the NOR-bearing chromosome pair in the karyotype of P. poecilogaster and in karyotype 11 of Scythrophrys. A conspicuous heteromorphism unrelated to the sex determining mechanism was also observed and probably arose from a pericentric inversion.

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.

Magnetic flux inversion in charged BPS vortices in a Lorentz-violating Maxwell-Higgs framework

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

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.