Resolução do problema de fluxo de potência ótimo pela meta-heurística algoritmo dos fogos de artifício de busca dinâmica com mutação de covariância

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

Search for supersymmetry with gauge-mediated breaking in diphoton events at D0

We report the results of a search for supersymmetry (SUSY) with gauge-mediated breaking in the missing transverse energy distribution of inclusive diphoton events using 263 pb(-1) of data collected by the D0 experiment at the Fermilab Tevatron Collider in 2002-2004. No excess is observed above the background expected from standard model processes, and lower limits on the masses of the lightest neutralino and chargino of about 108 and 195 GeV, respectively, are set at the 95% confidence level. These are the most stringent limits to date for models with gauge-mediated SUSY breaking with a short-lived neutralino as the next-to-lightest SUSY particle.

Gastric adenocarcinoma and Helicobacter pylori: Correlation with p53 mutation and p27 immunoexpression

Introduction: Helicobacter pylori infection is an established risk factor for gastric cancer development, but the exact underlying mechanism still remains obscure. The inactivation of tumor suppressor genes such as p53 and p27(KIP1) is a hypothesized mechanism, although there is no consensus regarding the influence of H. pylori cagA(+) in the development of these genetic alterations. Goals: To verify the relationship among H. pylori infection, p53 mutations and p27(Kip1) Protein (p27) expression in gastric adenocarcinomas (GA) seventy-four tissues were assayed by PCR for H. pylori and cagA presence. Mutational analysis of p53 gene was performed by single-strand conformation polymorphism (SSCP). Seventy tissues were analyzed by an immunohistochemical method for p27 expression. Results: From the samples examined, 95% (70/74) were H. pylori positive, 63% cagA(+). Altered p53 electrophoretic mobility was found in 72% of cases and significantly more frequent in the presence of cagA. Considerable reduction in p27 expression (19%) was found with a tendency for association between cagA(+) and p27(-), although the results were not statistically significant. Concomitant alterations of both suppressor genes were detected in 60% of cases. In the cases cagA(+), 66.7% of them had these concomitant alterations. Conclusions: The data suggest that H. pylori cagA(+) contributes to p53 alteration and indicate that concomitant gene inactivation, with reduced p27 expression, may be a mechanism in which H. pylori can promote the development and progression of gastric cancer. (C) 2010 Elsevier Ltd. All rights reserved.

Search for events with Leptonic jets and missing transverse energy in pp̄ collisions at √s=1.96TeV

We present the first search for pair production of isolated jets of charged leptons in association with a large imbalance in transverse energy in pp̄ collisions using 5.8fb⊃-1 of integrated luminosity collected by the D0 detector at the Fermilab Tevatron Collider. No excess is observed above the standard model background, and the result is used to set upper limits on the production cross section of pairs of supersymmetric chargino and neutralino particles as a function of dark-photon mass, where the dark photon is produced in the decay of the lightest supersymmetric particle. © 2010 The American Physical Society.

Measurement of the Bs0→μ+μ- branching fraction and search for B0→μ+μ- with the CMS experiment

Results are presented from a search for the rare decays Bs0→μ+μ- and B0→μ+μ - in pp collisions at √s=7 and 8 TeV, with data samples corresponding to integrated luminosities of 5 and 20 fb-1, respectively, collected by the CMS experiment at the LHC. An unbinned maximum-likelihood fit to the dimuon invariant mass distribution gives a branching fraction B(Bs0→μ+μ-)=(3.0-0.9+1.0) ×10-9, where the uncertainty includes both statistical and systematic contributions. An excess of Bs0→μ+μ- events with respect to background is observed with a significance of 4.3 standard deviations. For the decay B0→μ+μ- an upper limit of B(B0→μ+μ-)<1.1×10 -9 at the 95% confidence level is determined. Both results are in agreement with the expectations from the standard model. © 2013 CERN. Published by the American Physical Society under the terms of the.

Global optimization using a genetic algorithm with hierarchically structured population

This paper applies a genetic algorithm with hierarchically structured population to solve unconstrained optimization problems. The population has individuals distributed in several overlapping clusters, each one with a leader and a variable number of support individuals. The hierarchy establishes that leaders must be fitter than its supporters with the topological organization of the clusters following a tree. Computational tests evaluate different population structures, population sizes and crossover operators for better algorithm performance. A set of known benchmark test problems is solved and the results found are compared with those obtained from other methods described in the literature, namely, two genetic algorithms, a simulated annealing, a differential evolution and a particle swarm optimization. The results indicate that the method employed is capable of achieving better performance than the previous approaches in regard as the two criteria usually employed for comparisons: the number of function evaluations and rate of success. The method also has a superior performance if the number of problems solved is taken into account. (C) 2013 Elsevier B.V. All rights reserved.

Measurement of the ratio of inclusive jet cross sections using the anti-k(T) algorithm with radius parameters R=0.5 and 0.7 in pp collisions at root s=7 TeV

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

Search for supersymmetry with razor variables in pp collisions at root s=7 TeV

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

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

Search for supersymmetry in pp collisions at 7 TeV in events with jets and missing transverse energy

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

Search for Supersymmetry at the LHC in Events with Jets and Missing Transverse Energy

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

Optimum-Path Forest pruning parameter estimation through Harmony Search

Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.

Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and optimize. This approach is evaluated over sets of benchmark instances and compared to methods from literature. Computational results indicate competitive results applying the proposed method when compared with other literature approaches. © 2013 IEEE.

Planejamento de sistemas de distribuição de energia elétrica de média tensão através de um algoritmo de busca dispersa

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

Novo algoritimo genético para problemas de cobertura de conjuntos

The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.