A modified ant colony optimization algorithm modeled on tabu-search methods

An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.

Aggregation-based decomposition for multi-divisional models

The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to such a divisionally organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information provided by the divisions.

An implementation of modified scatter search algorithm to transmission expansion planning

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

The improvement in grinding of inlet engine valves by the adoption of the most effective cuting fluid type

In this paper is presented an experimental research in which the grinding of seating surfaces of inlet engine valves was improved by the adoption of the most effective cutting fluid type, matching the new requirements of cutting fluid application. Four different types of cutting fluids (straight oil and three different types of soluble oils) were analyzed. As qualitative and quantitative evaluation parameters of the performance of the cutting fluids, the roughness, the grinding wheel wear, the cutting force and the workpiece residual stress were determined. As a conclusion, the straight oil was the cutting fluid that presented the best results in all of the parameters analyzed. Copyright © 2000 Society of Automotive Engineers, Inc.

PMUs optimized allocation using a tabu search algorithm for fault location in electric power distribution system

Phasor Measurement Units (PMUs) optimized allocation allows control, monitoring and accurate operation of electric power distribution systems, improving reliability and service quality. Good quality and considerable results are obtained for transmission systems using fault location techniques based on voltage measurements. Based on these techniques and performing PMUs optimized allocation it is possible to develop an electric power distribution system fault locator, which provides accurate results. The PMUs allocation problem presents combinatorial features related to devices number that can be allocated, and also probably places for allocation. Tabu search algorithm is the proposed technique to carry out PMUs allocation. This technique applied in a 141 buses real-life distribution urban feeder improved significantly the fault location results. © 2004 IEEE.

Search for the flavor-changing neutral current decay Bs 0 → μ+ μ- pp̄ Collisions at √s = 1.96 TeV with the DO Detector

We present the results of a search for the flavor-changing neutral current decay Bs 0 → μ+ μ-. using a data set with integrated luminosity of 240 pb-1 of pp̄ collisions at √s = 1.96 TeV collected with the D0 detector in run II of the Fermilab Tevatron collider. We find the upper limit on the branching fraction to be B(Bs 0 → μ+ π-) ≤ 5.0 × 10-7 at the 95% C.L. assuming no contributions from the decay Bd 0 → μ+ μ- in the signal region. This limit is the most stringent upper bound on the branching fraction Bs 0 → μ+ μ- to date. © 2005 The American Physical Society.

Search for squarks and gluinos in events with jets and missing transverse energy in p(p)over-bar collisions at root s-=1.96 TeV

The results of a search for squarks and gluinos using data from p over(p, ̄) collisions recorded at a center-of-mass energy of 1.96 TeV by the DØ detector at the Fermilab Tevatron Collider are reported. The topologies analyzed consist of acoplanar-jet and multijet events with large missing transverse energy. No evidence for the production of squarks or gluinos was found in a data sample of 310 pb-1. Lower limits of 325 and 241 GeV were derived at the 95% C.L. on the squark and gluino masses, respectively, within the framework of minimal supergravity with tan β = 3, A0 = 0, and μ < 0. © 2006 Elsevier B.V. All rights reserved.

Amphibian secretions for drug discovery studies: A search for new antiparasitic and antifungal compounds

The antiparasitic and antifungal activities of nine amphibian skin secretions were studied in different in vitro models. Seven secretions presented a considerable antiprotozoan activity and one showed promising results against Candida sp. These results can be the basis for the development of new drugs, especially for neglected parasitic diseases. © 2007 Bentham Science Publishers Ltd.

Search for decay of a fermiophobic higgs boson hf→ y y with the D0 detector at s=1.96a TeV

We report the results of a search for a narrow resonance decaying into two photons in 1.1fb-1 of data collected by the D0 experiment at the Fermilab Tevatron Collider during the period 20022006. We find no evidence for such a resonance and set a lower limit on the mass of a fermiophobic Higgs boson of mhf>100GeV at the 95% C.L. This exclusion limit exceeds those obtained in previous searches at the Fermilab Tevatron and covers a significant region of the parameter space B(hf→I I ) vs mhf which was not accessible at the CERN Large Electron-Positron Collider. © 2008 The American Physical Society.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem

This paper proposes a tabu search approach to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). It is a real-world problem, often found in soft drink companies, where the production process has two integrated levels with decisions concerning raw material storage and soft drink bottling. Lot sizing and scheduling of raw materials in tanks and products in bottling lines must be simultaneously determined. Real data provided by a soft drink company is used to make comparisons with a previous genetic algorithm. Computational results have demonstrated that tabu search outperformed genetic algorithm in all instances. Copyright 2011 ACM.

Search for neutral minimal supersymmetric standard model Higgs bosons decaying to tau pairs produced in association with b quarks in pp̄ collisions at √s=1.96TeV

We report results from a search for neutral Higgs bosons produced in association with b quarks using data recorded by the D0 experiment at the Fermilab Tevatron Collider and corresponding to an integrated luminosity of 7.3fb-1. This production mode can be enhanced in several extensions of the standard model (SM) such as in its minimal supersymmetric extension (MSSM) at high tan β. We search for Higgs bosons decaying to tau pairs with one tau decaying to a muon and neutrinos and the other to hadrons. The data are found to be consistent with SM expectations, and we set upper limits on the cross section times branching ratio in the Higgs boson mass range from 90 to 320GeV/c2. We interpret our result in the MSSM parameter space, excluding tan β values down to 25 for Higgs boson masses below 170GeV/c2. © 2011 American Physical Society.

Search for supersymmetry in pp collisions at √s = 7 TeV in events with a single lepton, jets, and missing transverse momentum

Results are reported from a search for physics beyond the standard model in proton-proton collisions at a center-of-mass energy of 7TeV, focusing on the signature with a single, isolated, high-transverse-momentum lepton (electron or muon), energetic jets, and large missing transverse momentum. The data sample comprises an integrated luminosity of 36 pb-1, recorded by the CMS experiment at the LHC. The search is motivated by models of new physics, including supersymmetry. The observed event yields are consistent with standard model backgrounds predicted using control samples obtained from the data. The characteristics of the event sample are consistent with those expected for the production of tt̄ and W+jets events. The results are interpreted in terms of limits on the parameter space for the constrained minimal supersymmetric extension of the standard model.

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

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.