Combined search for the quarks of a sequential fourth generation

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

A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection

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

Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm

Optimised placement of control and protective devices in distribution networks allows for a better operation and improvement of the reliability indices of the system. Control devices (used to reconfigure the feeders) are placed in distribution networks to obtain an optimal operation strategy to facilitate power supply restoration in the case of a contingency. Protective devices (used to isolate faults) are placed in distribution systems to improve the reliability and continuity of the power supply, significantly reducing the impacts that a fault can have in terms of customer outages, and the time needed for fault location and system restoration. This paper presents a novel technique to optimally place both control and protective devices in the same optimisation process on radial distribution feeders. The problem is modelled through mixed integer non-linear programming (MINLP) with real and binary variables. The reactive tabu search algorithm (RTS) is proposed to solve this problem. Results and optimised strategies for placing control and protective devices considering a practical feeder are presented. (c) 2007 Elsevier B.V. All rights reserved.

Efficient heuristic algorithm used for optimal capacitor placement in distribution systems

An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.

Search for narrow resonances in dilepton mass spectra in pp collisions at root s=7 TeV CMS Collaboration

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

Search for high-mass resonances decaying into tau-lepton pairs in pp collisions at root s=7 TeV

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

Measurement of W+W- production and search for the Higgs boson in pp collisions at root s=7 TeV

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

Search for a heavy neutral gauge boson in the dielectron channel with 5.4 fb(-1) of p(p)over-bar collisions at root s=1.96 TeV

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

Search for a W ' boson decaying to a muon and a neutrino in pp collisions at root s=7 TeV

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

Search for Resonant WW and WZ Production in p(p)over-bar Collisions at root s=1.96 TeV

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

Search for a W ' or Techni-rho Decaying into WZ in pp Collisions at root s=7 TeV

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

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

TIME-OPTIMAL GEOMAGNETIC ATTITUDE MANEUVERS OF AN AXISYMMETRICAL SPINNING SATELLITE

A formulation used to determine the time-optimal geomagnetic attitude maneuvers subject to dynamic and geometric constraints is proposed in this paper. This was obtained by a direct search procedure based on a control function parametrization method, using linear programming to obtain numerical suboptimal solutions by linear perturbation. Due to its characteristics it can be used in small computers and to generate computer programs of general application. The dynamic modeling, the magnetic torque model and the suboptimal control procedure are presented. Simulation runs have verified the feasibility of the formulation thus derived and have shown a notable improvement in performance.

Bayesian L-optimal exact design of experiments for biological kinetic models

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