Planejamento da expansão de sistemas de transmissão usando a metaheurística de busca em vizinhança variável

Pós-graduação em Engenharia Elétrica - FEIS

Relax and cut: limitantes duais para o problema do caixeiro viajante

Pós-graduação em Matemática - IBILCE

String-averaging expectation-maximization for maximum likelihood estimation in emission tomography

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

Study of pK Values and Effective Dielectric Constants of Ionizable Residues in Pentapeptides and in Staphylococcal Nuclease (SNase) Using a Mean-Field Approach

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

Methods and results of a search for gravitational waves associated with gamma-ray bursts using the GEO 600, LIGO, and Virgo detectors

In this paper we report on a search for short-duration gravitational wave bursts in the frequency range 64 Hz-1792 Hz associated with gamma-ray bursts (GRBs), using data from GEO 600 and one of the LIGO or Virgo detectors. We introduce the method of a linear search grid to analyze GRB events with large sky localization uncertainties, for example the localizations provided by the Fermi Gamma-ray Burst Monitor (GBM). Coherent searches for gravitational waves (GWs) can be computationally intensive when the GRB sky position is not well localized, due to the corrections required for the difference in arrival time between detectors. Using a linear search grid we are able to reduce the computational cost of the analysis by a factor of O(10) for GBM events. Furthermore, we demonstrate that our analysis pipeline can improve upon the sky localization of GRBs detected by the GBM, if a high-frequency GW signal is observed in coincidence. We use the method of the linear grid in a search for GWs associated with 129 GRBs observed satellite-based gamma-ray experiments between 2006 and 2011. The GRBs in our sample had not been previously analyzed for GW counterparts. A fraction of our GRB events are analyzed using data from GEO 600 while the detector was using squeezed-light states to improve its sensitivity; this is the first search for GWs using data from a squeezed-light interferometric observatory. We find no evidence for GW signals, either with any individual GRB in this sample or with the population as a whole. For each GRB we place lower bounds on the distance to the progenitor, under an assumption of a fixed GW emission energy of 10(-2)M circle dot c(2), with a median exclusion distance of 0.8 Mpc for emission at 500 Hz and 0.3 Mpc at 1 kHz. The reduced computational cost associated with a linear search grid will enable rapid searches for GWs associated with Fermi GBM events once the advanced LIGO and Virgo detectors begin operation.

Effect of the length of alkyl side chains in the electronic structure of conjugated polymers

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

Estudo químico quântico relativístico das propriedades eletrônicas e estruturais dos compostos Aun(n=1-5), AuOn-e AuSn - (n=1-2) e AuH

Pós-graduação em Ciência e Tecnologia de Materiais - FC

Aplicação do algoritmo Rough Sets em um Data Warehouse

This Project aims to develop methods for data classification in a Data Warehouse for decision-making purposes. We also have as another goal the reduction of an attribute set in a Data Warehouse, in which a given reduced set is capable of keeping the same properties of the original one. Once we achieve a reduced set, we have a smaller computational cost of processing, we are able to identify non-relevant attributes to certain kinds of situations, and finally we are also able to recognize patterns in the database that will help us to take decisions. In order to achieve these main objectives, it will be implemented the Rough Sets algorithm. We chose PostgreSQL as our data base management system due to its efficiency, consolidation and finally, it’s an open-source system (free distribution)

Resolução do problema de sequenciamento de múltiplas linhas de montagem de modelos mistos em ambiente de produção enxuta

This work deals with the sequencing of Multi-Mixed-Model Assembly Lines in a lean manufacturing environment, where an operational structure where several kanbans support several mixed-model assembly lines, so that all assembly lines can receive parts or sub-assemblies from all suppliers. To optimize this system, the sequencing seeks to minimize the distance between the real consumption and the constant ideal consumption of parts or subassemblies, thereby reducing the scaling of kanbans and intermediate stocks. To solve the sequencing problems, the method Clustering Search was applied along with the metaheuristics Variable Neighborhood Search, Simulation Annealing and Iterative Local Search. Instances from the literature and generated instances were tested, thus allowing comparing the methods to each other and with other methods presented in the literature. The performance of the Clustering Search with Iterated Local Search stands out by the quality and robustness of their solutions, and mainly for its efficiency, whereas it converges to better results at a lower computational cost

A new approach to the electronic structure of two dimensional disordered alloys

We propose a novel method to calculate the electronic Density of States (DOS) of a two dimensional disordered binary alloy. The method is highly reliable and numerically efficient, and Short Range Order (SRO) correlations can be included with no extra computational cost. The approach devised rests on one dimensional calculations and is applied to very long stripes of finite width, the bulk regime being achieved with a relatively small number of chains in the disordered case. Our approach is exact for the pure case and predicts the correct DOS structure in important limits, such as the segregated, random, and ordered alloy regimes. We also suggest important extensions of the present work. © 1995.

Transcrição cooperativa de genes ribossomais em Escherichia coli usando um modelo estocástico e dependente de sequência

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

Análise de junta aparafusada de biela automotiva

Pós-graduação em Engenharia Mecânica - FEG

Modelos lineares generalizados bayesianos para dados longitudinais

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

A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier

In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of big data classification problems. The research on this area ranges from Graphics Processing Units-based implementations to mathematical optimizations, being the main drawback of the former approaches to be dependent on the graphic video card. Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset. The experiments have shown that the approach proposed can be faster than the traditional one in five public datasets, being also as accurate as the original OPF. (C) 2014 Elsevier B. V. All rights reserved.

Pareto Frontier for the time-energy cost vector to an Earth-Moon transfer orbit using the patched-conic approximation

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