Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks

This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.

Information Filtering and Array Algorithms for Discrete-Time Markovian Jump Linear Systems

This technical note develops information filter and array algorithms for a linear minimum mean square error estimator of discrete-time Markovian jump linear systems. A numerical example for a two-mode Markovian jump linear system, to show the advantage of using array algorithms to filter this class of systems, is provided.

A Taxonomy for Locality Algorithms on Peer-to-Peer Networks

The continuous growth of peer-to-peer networks has made them responsible for a considerable portion of the current Internet traffic. For this reason, improvements in P2P network resources usage are of central importance. One effective approach for addressing this issue is the deployment of locality algorithms, which allow the system to optimize the peers` selection policy for different network situations and, thus, maximize performance. To date, several locality algorithms have been proposed for use in P2P networks. However, they usually adopt heterogeneous criteria for measuring the proximity between peers, which hinders a coherent comparison between the different solutions. In this paper, we develop a thoroughly review of popular locality algorithms, based on three main characteristics: the adopted network architecture, distance metric, and resulting peer selection algorithm. As result of this study, we propose a novel and generic taxonomy for locality algorithms in peer-to-peer networks, aiming to enable a better and more coherent evaluation of any individual locality algorithm.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Design and Characterization of a Biomimetic Piezoelectric Pump Inspired on Group Fish Swimming Effect

Flow pumps are important tools in several engineering areas, such as in the fields of bioengineering and thermal management solutions for electronic devices. Nowadays, many of the new flow pump principles are based on the use of piezoelectric actuators, which present some advantages such as miniaturization potential and lower noise generation. In previous work, authors presented a study of a novel pump configuration based on placing an oscillating bimorph piezoelectric actuator in water to generate flow. It was concluded that this oscillatory behavior (such as fish swimming) yields vortex interaction, generating flow rate due to the action and reaction principle. Thus, following this idea the objective of this work is to explore this oscillatory principle by studying the interaction among generated vortex from two bimorph piezoelectric actuators oscillating inside the same pump channel, which is similar to the interaction of vortex generated by frontal fish and posterior ones when they swim together in a group formation. It is shown that parallel-series configurations of bimorph piezoelectric actuators inside the same pump channel provide higher flow rates and pressure for liquid pumping than simple parallel-series arrangements of corresponding single piezoelectric pumps, respectively. The scope of this work includes structural simulations of bimorph piezoelectric actuators, fluid flow simulations, and prototype construction for result validation.

Optimization of the Topology of Electric Energy Distribution Networks by Using Algorithm Inspired on Ant Behaviors

An algorithm inspired on ant behavior is developed in order to find out the topology of an electric energy distribution network with minimum power loss. The algorithm performance is investigated in hypothetical and actual circuits. When applied in an actual distribution system of a region of the State of Sao Paulo (Brazil), the solution found by the algorithm presents loss lower than the topology built by the concessionary company.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Nickel adsorption in two Oxisols and an Alfisol as affected by pH, nature of the electrolyte, and ionic strength of soil solution

Background, aim, and scope The retention of potentially toxic metals in highly weathered soils can follow different pathways that variably affect their mobility and availability in the soil-water-plant system. This study aimed to evaluate the effects of pH, nature of electrolyte, and ionic strength of the solution on nickel (Ni) adsorption by two acric Oxisols and a less weathered Alfisol. Materials and methods The effect of pH on Ni adsorption was evaluated in surface and subsurface samples from a clayey textured Anionic `Rhodic` Acrudox ( RA), a sandy-clayey textured Anionic `Xantic` Acrudox (XA), and a heavy clayey textured Rhodic Kandiudalf (RK). All soil samples were equilibrated with the same concentration of Ni solution (5.0 mg L(-1)) and two electrolyte solutions (CaCl(2) or NaCl) with different ionic strengths (IS) (1.0, 0.1 and 0.01 mol L(-1)). The pH of each sample set varied from 3 to 10 in order to obtain sorption envelopes. Results and discussion Ni adsorption increased as the pH increased, reaching its maximum of nearly pH 6. The adsorption was highest in Alfisol, followed by RA and XA. Competition between Ni(2+) and Ca(2+) was higher than that between Ni(2+) and Na(+) in all soil samples, as shown by the higher percentage of Ni adsorption at pH 5. At pH values below the intersection point of the three ionic strength curves (zero point of salt effect), Ni adsorption was generally higher in the more concentrated solution (highest IS), probably due to the neutralization of positive charges of soil colloids by Cl(-) ions and consequent adsorption of Ni(2+). Above this point, Ni adsorption was higher in the more diluted solution (lowest ionic strength), due to the higher negative potential at the colloid surfaces and the lower ionic competition for exchange sites in soil colloids. Conclusions The effect of ionic strength was lower in the Oxisols than in the Alfisol. The main mechanism that controlled Ni adsorption in the soils was the ionic exchange, since the adsorption of ionic species varied according to the variation of pH values. The ionic competition revealed the importance of electrolyte composition and ionic strength on Ni adsorption in soils from the humid tropics. Recommendations and perspectives The presence of NaCl or CaCl(2) in different ionic strengths affects the availability of heavy metals in contaminated soils. Therefore, the study of heavy metal dynamics in highly weathered soils must consider this behavior, especially in soils with large amounts of acric components.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Nature-based tourism and the valuation of its environmental resources: Economic and other aspects

Nature-based tourism has grown in importance in recent decades, and strong links have been established between it and ecotourism. This reflects rising incomes, greater levels of educational attainment and changing values, especially in the Western world. Nature-based tourism is quite varied. Different types of such tourism are identified and their consequences for sustainability of their resource-base are briefly considered. The development and management of nature-based tourism involves many economic aspects, several of which are discussed. For example, one must consider the economics of reserving or protecting land for this type of tourism. What economic factors should be taken into account? Economists stress the importance of taking into account the opportunity costs involved in such a decision. This concept is explained. However, determining the net economic value of an area used for tourism is not straightforward. Techniques for doing this, such as the travel cost method and stated value methods, are introduced. Natural areas reserved for tourism may have economic value not only for tourism but also jointly for other purposes, such as conserving wildlife, maintaining hydrological cycles and so on. These other purposes, should be taken into account when considering the use of land for nature-based tourism. According to one economic point of view, land should be used in a way that maximises its total economic value. While this approach has its merits, it does not take into account the distribution of benefits from land use and its local impacts on income and employment. These can be quite important politically and for nature conservation, and are discussed. Finally, there is some discussion of whether fees charged to tourists for access to environmental resources should discriminate between domestic tourists and foreigners.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.