A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

The Q-D algorithm for transforming series expansions into a corresponding continued fraction: an extension to cope with zero coefficients

An algorithm for deriving a continued fraction that corresponds to two series expansions simultaneously, when there are zero coefficients in one or both series, is given. It is based on using the Q-D algorithm to derive the corresponding fraction for two related series, and then transforming it into the required continued fraction. Two examples are given. (C) 2003 Elsevier B.V. All rights reserved.

Efficient robust optimization based on polynomial chaos and tabu search algorithm

The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.

Using genetic algorithm to design protein sequence

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

Relaxation algorithm to hyperbolic states in Gross-Pitaevskii equation

A new version of the relaxation algorithm is proposed in order to obtain the stationary ground-state solutions of nonlinear Schrodinger-type equations, including the hyperbolic solutions. In a first example, the method is applied to the three-dimensional Gross-Pitaevskii equation, describing a condensed atomic system with attractive two-body interaction in a non-symmetrical trap, to obtain results for the unstable branch. Next, the approach is also shown to be very reliable and easy to be implemented in a non-symmetrical case that we have bifurcation, with nonlinear cubic and quintic terms. (c) 2006 Elsevier B.V. All rights reserved.

Algorithm for probing the unitarity of topologically massive models

An uncomplicated and easy handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the unitarity of both topologically massive higher-derivative electromagnetism (TMHDE) and topologically massive higher-derivative gravity (TMHDG). The novel and amazing features of these effective field models are also discussed.

Jet momentum dependence of jet quenching in PbPb collisions at root s(NN)=2.76 TeV

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

Shape, transverse size, and charged-hadron multiplicity of jets 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.

HAEMONCHUS PLACEI IN CALVES - EFFECTS OF DIETARY-PROTEIN AND MULTIPLE EXPERIMENTAL-INFECTION ON WORM ESTABLISHMENT AND PATHOGENESIS

An experiment was conducted to examine the influence of dietary protein and immunisation on parasite establishment and pathogenesis of Haemonchus placei in calves. Four groups of 4-6-month-old worm-free calves (n=4) were given a low protein diet (LP) containing 213 g crude protein (CP) per head per day or a high-protein diet (HP) containing 469 g per head per day CP. Five weeks later, calves in one of the two groups of each dietary treatment were given 50 000 H. placei infective larvae (L(3)). Twenty-five days later, infection in these groups was terminated by dosing with oxfendazole, This immunisation process was repeated 4 days later. Four days after termination of the second immunisation all calves were challenged with 100 000 L(3). Five weeks later, all calves were slaughtered for abomasal worm counts. Worm establishment was lower in the immunised groups; however, only the HP-I group showed a significant reduction (P < 0.05). All calves gained weight during the first 13 week period, and after challenge the non-immunised groups lost weight, independent of the level of protein in the diet (P < 0.05), Packed cell volume values for all treatments only dropped after challenge (P < 0.05) and the HP-immunised group presented values significantly higher when compared with the other treatments, All calves were hypoproteinaemic and hypoalbuminaemic at the end of the experiment, regardless of the treatment. Immunised calves showed a normocytic normochromic anaemia, while the non-immunised groups presented a microcytic normochromic anaemia.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Commensal worm traces and possible juvenile thalassinidean burrows associated with Ophiomorpha nodosa, Pleistocene, southern Brazil

The Pleistocene Chui Formation at Osorio (Rio Grande do Sul, Brazil) consists of coastal marine and eolian sands, the former containing abundant and well-preserved Ophiomorpha nodosa burrow systems. Detailed ichnological study has revealed interesting features associated with them. Small-sized Ophiomorpha, here assigned to a new ichnospecies, O. puerilis, are interpreted as possible burrows of juvenile thalassinidean crustaceans probably belonging to the same species as the producers of larger O. nodosa. Additionally, helicoidal burrows with thick, concentrically laminated linings are associated with the walls of O. nodosa. They are assigned to the new ichnospecies Cylindrichnus helix, and they are interpreted as dwellings of commensal annelid worms. The association of these three icbnospecies constitutes a fossil example of the role of thalassinideans as ecosystem engineers able to modify their environment and to create new space and resources usable by other organisms. (c) 2005 Elsevier B.V. All rights reserved.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.