Shout and Act: an Algorithm for Digital Objects Preservation Inspired from Rescue Robots

We adapt the Shout and Act algorithm to Digital Objects Preservation where agents explore file systems looking for digital objects to be preserved (victims). When they find something they “shout” so that agent mates can hear it. The louder the shout, the urgent or most important the finding is. Louder shouts can also refer to closeness. We perform several experiments to show that this system works very scalably, showing that heterogeneous teams of agents outperform homogeneous ones over a wide range of tasks complexity. The target at-risk documents are MS Office documents (including an RTF file) with Excel content or in Excel format. Thus, an interesting conclusion from the experiments is that fewer heterogeneous (varying skills) agents can equal the performance of many homogeneous (combined super-skilled) agents, implying significant performance increases with lower overall cost growth. Our results impact the design of Digital Objects Preservation teams: a properly designed combination of heterogeneous teams is cheaper and more scalable when confronted with uncertain maps of digital objects that need to be preserved. A cost pyramid is proposed for engineers to use for modeling the most effective agent combinations

An energy efficient vertical handover decision algorithm

As wireless communications evolve towards heterogeneousnetworks, mobile terminals have been enabled tohandover seamlessly from one network to another. At the sametime, the continuous increase in the terminal power consumptionhas resulted in an ever-decreasing battery lifetime. To that end,the network selection is expected to play a key role on howto minimize the energy consumption, and thus to extend theterminal lifetime. Hitherto, terminals select the network thatprovides the highest received power. However, it has been provedthat this solution does not provide the highest energy efficiency.Thus, this paper proposes an energy efficient vertical handoveralgorithm that selects the most energy efficient network thatminimizes the uplink power consumption. The performance of theproposed algorithm is evaluated through extensive simulationsand it is shown to achieve high energy efficiency gains comparedto the conventional approach.

Evolutionary analysis of mitogenomes from parasitic and free-living flatworms

Mitochondrial genomes (mitogenomes) are useful and relatively accessible sources of molecular data to explore and understand the evolutionary history and relationships of eukaryotic organisms across diverse taxonomic levels. The availability of complete mitogenomes from Platyhelminthes is limited; of the 40 or so published most are from parasitic flatworms (Neodermata). Here, we present the mitogenomes of two free-living flatworms (Tricladida): the complete genome of the freshwater species Crenobia alpina (Planariidae) and a nearly complete genome of the land planarian Obama sp. (Geoplanidae). Moreover, we have reanotated the published mitogenome of the species Dugesia japonica (Dugesiidae). This contribution almost doubles the total number of mtDNAs published for Tricladida, a species-rich group including model organisms and economically important invasive species. We took the opportunity to conduct comparative mitogenomic analyses between available free-living and selected parasitic flatworms in order to gain insights into the putative effect of life cycle on nucleotide composition through mutation and natural selection. Unexpectedly, we did not find any molecular hallmark of a selective relaxation in mitogenomes of parasitic flatworms; on the contrary, three out of the four studied free-living triclad mitogenomes exhibit higher A+T content and selective relaxation levels. Additionally, we provide new and valuable molecular data to develop markers for future phylogenetic studies on planariids and geoplanids.

ContinuousMultimodal Global Optimization with Differential Evolution-Based Methods

Metaheuristic methods have become increasingly popular approaches in solving global optimization problems. From a practical viewpoint, it is often desirable to perform multimodal optimization which, enables the search of more than one optimal solution to the task at hand. Population-based metaheuristic methods offer a natural basis for multimodal optimization. The topic has received increasing interest especially in the evolutionary computation community. Several niching approaches have been suggested to allow multimodal optimization using evolutionary algorithms. Most global optimization approaches, including metaheuristics, contain global and local search phases. The requirement to locate several optima sets additional requirements for the design of algorithms to be effective in both respects in the context of multimodal optimization. In this thesis, several different multimodal optimization algorithms are studied in regard to how their implementation in the global and local search phases affect their performance in different problems. The study concentrates especially on variations of the Differential Evolution algorithm and their capabilities in multimodal optimization. To separate the global and local search search phases, three multimodal optimization algorithms are proposed, two of which hybridize the Differential Evolution with a local search method. As the theoretical background behind the operation of metaheuristics is not generally thoroughly understood, the research relies heavily on experimental studies in finding out the properties of different approaches. To achieve reliable experimental information, the experimental environment must be carefully chosen to contain appropriate and adequately varying problems. The available selection of multimodal test problems is, however, rather limited, and no general framework exists. As a part of this thesis, such a framework for generating tunable test functions for evaluating different methods of multimodal optimization experimentally is provided and used for testing the algorithms. The results demonstrate that an efficient local phase is essential for creating efficient multimodal optimization algorithms. Adding a suitable global phase has the potential to boost the performance significantly, but the weak local phase may invalidate the advantages gained from the global phase.

Lautanauhaohjeen muodostus tavoitekuviosta geneettisellä algoritmilla

Lautanauhatekniikka on monipuolinen menetelmä esimerkiksi kuvioitujen nauhojen kutomiseen, mutta uusien kuvioaiheiden suunnittelu, tai aloittelijalle jo valmiiden ohjeettomien kuviomallien jäljittely, voi helposti käydä työlääksi menetelmän ominaispiirteiden johdosta. Tämän työn tavoitteena oli kehittää ohjelmallinen työkalu auttamaan näissä ongelmissa automatisoimalla kudontaohjeen etsintä käyttäjän laatimalle tavoitekuviolle. Ratkaisumenetelmän perustaksi valittiin geneettinen algoritmi, minkä johdosta työn keskeisintutkimusongelma oli kartoittaa algoritmin perusoperaatioiden parametrien ja tavoitekuvion kompleksisuuden keskinäisiä riippuvuuksia riittävästi toimivien arvosuositusten antamiseen ohjelman tulevassa käytännön käytössä. Työssä ei kehitetty sovellusalueeseen mukautettuja evoluutiooperaatioita, vaan keskityttiin luomaan hyvin tunnetuista elementeistä perusta, jota voi myöhemmin kehittää eteenpäin.

Brain size and evolutionary diversification in birds

The role of behavior in evolution remains controversial, despite that some ideas are over 100 years old. Changes in behavior are generally believed to enhance evolution by exposing individuals to new selective pressures and by facilitating range expansions. However, this hypothesis lacks firm empirical evidence. Moreover, behavioral changes can also inhibit evolution by hiding heritable variation from natural selection. Taking advantage of the complete phylogeny of extant birds, a new species-level measure of past diversification rate and the best existing measures of brain size (n = 1326 species), I show here that relative brain size is associated (albeit weakly) with diversification rates. Assuming that brain relative size reflects behavioral flexibility, an assumption well-supported by evidence, this finding supports the idea that behavior can enhance evolutionary diversification. This view is further supported by the discovery that the most important factor influencing diversification rates is ecological generalism, which is believed to require behavioral flexibility. Thus, behavioral changes that expose animals to a variety of environments can have played an important role in the evolution of birds.

Analysis of metabolites from plants of the Swartzia genus using chemical indexes: evolutionary tendencies

The chemical indexes, suggested by Gottlieb et al., have not been used before regarding evolutionary tendency of species in the Swartzia genus. However, the importance of this work encouraged for an analysis of the Swartzia genus using the metabolites isolated from nine species. The analysis, based on calculated chemical indexes, provided an evolutionary tendency for these plants, which correlates with the classification based on morphological analysis.

The molecular mechanisms and evolutionary significance of plumage colour variation in pied flycatchers (Ficedula hypoleuca)

A common feature of natural populations is that individuals differ in morphology, physiologyand behavior (i.e .phenotype). A thorough understanding of the molecular mechanisms and evolutionary forces behind this phenotypic variation is a prerequisite for understanding evolution.This thesis examines the molecular mechanism and the roles of the different evolutionary forces in plumage colour variation in pied flycatchers (Ficedulahypoleuca). Malepied flycatchers exhibit marked variation in both pigmentary and structural plumage colourand the trait has repeatedly been suggested to be of adaptive significance. An examination of plumage colour variation on reproductive output trevealed that structural colouration, and more specifically the degree of ultraviolet (UV) reflectance had an effect on number of young sired. Paternity analyses of breeding males revealed that males that had been cuckolded by their social mate tended to be less UV reflectant than males that had not been cuckolded.Neither pigment-based norstructural colouration was found to affect the probability of siring young in other nests. Phenotypic differentiation was found to be markedly greater than differentiation at neutralgenetic markers across the pied flycatcher breeding range. Furthermore patterns of differentiationin phenotypes and selectively neutral genes were not uniform. Outlier tests searching for genomic footprints of selection revealed elevated levels of genetic divergence in a gene associated with feather development (and thus potentially structural colouration) and ultraviolet vision. Th eobserved differentiation in allelic frequencies was particularly pronounced in the Spanish piedflycatcher populations. Examining gene expression during feather development indicated that the TYRP1 gene (known to be involved in the production of black pigment) may be relevant in generating phenotypic variation in pied flycatcher plumage. Also, energy homeostasis related genesfeatured prominently among the genes found to be expressed in one extreme phenotype but not the other. This is of particular interest in light of what is known about the pleiotropy ofthe melanocortin system which underlies brown-black pigment production. The melanocortinsystem is also associated with energy homeostasis (among a number of other physiological functions) and thus the results could be pointing to the signalling function of brown-blackplumage. Plumage colour variation in pied flycatchers, both structural and pigmentary, can thus beconcluded to be exhibiting signals of non-neutral evolution. Structural colouration was found to play a role in sexual selection and putative signals of selection were further detected in acandidate gene for this trait. Evidence for non-neutral evolution of pigmentary colouration was also detected. These findings, together with the fact that preliminary evidence for an energy balance associated signalling function for plumage was found, present good starting points for further investigations into the meaning and mechanisms of plumage colour variation in piedflycatchers.

Stress testing and risk evaluation of new capacity payment algorithm proposed by Market Council

In the Russian Wholesale Market, electricity and capacity are traded separately. Capacity is a special good, the sale of which obliges suppliers to keep their generating equipment ready to produce the quantity of electricity indicated by the System Operator. The purpose of the formation of capacity trading was the maintenance of reliable and uninterrupted delivery of electricity in the wholesale market. The price of capacity reflects constant investments in construction, modernization and maintenance of power plants. So, the capacity sale creates favorable conditions to attract investments in the energy sector because it guarantees the investor that his investments will be returned.

Solving Leontief Input-Output Model with Trapezoidal Fuzzy Numbers and Gauss-Seidel Algorithm

In this work a fuzzy linear system is used to solve Leontief input-output model with fuzzy entries. For solving this model, we assume that the consumption matrix from di erent sectors of the economy and demand are known. These assumptions heavily depend on the information obtained from the industries. Hence uncertainties are involved in this information. The aim of this work is to model these uncertainties and to address them by fuzzy entries such as fuzzy numbers and LR-type fuzzy numbers (triangular and trapezoidal). Fuzzy linear system has been developed using fuzzy data and it is solved using Gauss-Seidel algorithm. Numerical examples show the e ciency of this algorithm. The famous example from Prof. Leontief, where he solved the production levels for U.S. economy in 1958, is also further analyzed.

GAMS MINLP Solver comparisons and some improvements to the AlphaECP algorithm

I doktorsavhandlingen undersöks förmågan att lösa hos ett antal lösare för optimeringsproblem och ett antal svårigheter med att göra en rättvis lösarjämförelse avslöjas. Dessutom framläggs några förbättringar som utförts på en av lösarna som heter GAMS/AlphaECP. Optimering innebär, i det här sammanhanget, att finna den bästa möjliga lösningen på ett problem. Den undersökta klassen av problem kan karaktäriseras som svårlöst och förekommer inom ett flertal industriområden. Målet har varit att undersöka om det finns en lösare som är universellt snabbare och hittar lösningar med högre kvalitet än någon av de andra lösarna. Det kommersiella optimeringssystemet GAMS (General Algebraic Modeling System) och omfattande problembibliotek har använts för att jämföra lösare. Förbättringarna som presenterats har utförts på GAMS/AlphaECP lösaren som baserar sig på skärplansmetoden Extended Cutting Plane (ECP). ECP-metoden har utvecklats främst av professor Tapio Westerlund på Anläggnings- och systemteknik vid Åbo Akademi.

Software for calculation of reservoir active capacity with the sequent-peak algorithm

It is presented a software developed with Delphi programming language to compute the reservoir's annual regulated active storage, based on the sequent-peak algorithm. Mathematical models used for that purpose generally require extended hydrological series. Usually, the analysis of those series is performed with spreadsheets or graphical representations. Based on that, it was developed a software for calculation of reservoir active capacity. An example calculation is shown by 30-years (from 1977 to 2009) monthly mean flow historical data, from Corrente River, located at São Francisco River Basin, Brazil. As an additional tool, an interface was developed to manage water resources, helping to manipulate data and to point out information that it would be of interest to the user. Moreover, with that interface irrigation districts where water consumption is higher can be analyzed as a function of specific seasonal water demands situations. From a practical application, it is possible to conclude that the program provides the calculation originally proposed. It was designed to keep information organized and retrievable at any time, and to show simulation on seasonal water demands throughout the year, contributing with the elements of study concerning reservoir projects. This program, with its functionality, is an important tool for decision making in the water resources management.

Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

The determination of the intersection curve between Bézier Surfaces may be seen as the composition of two separated problems: determining initial points and tracing the intersection curve from these points. The Bézier Surface is represented by a parametric function (polynomial with two variables) that maps a point in the tridimensional space from the bidimensional parametric space. In this article, it is proposed an algorithm to determine the initial points of the intersection curve of Bézier Surfaces, based on the solution of polynomial systems with the Projected Polyhedral Method, followed by a method for tracing the intersection curves (Marching Method with differential equations). In order to allow the use of the Projected Polyhedral Method, the equations of the system must be represented in terms of the Bernstein basis, and towards this goal it is proposed a robust and reliable algorithm to exactly transform a multivariable polynomial in terms of power basis to a polynomial written in terms of Bernstein basis .

Numerical Simulation of the Cavitation in the Hydrodynamic Lubrication of Journal Bearings: a Parallel Algorithm

In this paper we present an algorithm for the numerical simulation of the cavitation in the hydrodynamic lubrication of journal bearings. Despite the fact that this physical process is usually modelled as a free boundary problem, we adopted the equivalent variational inequality formulation. We propose a two-level iterative algorithm, where the outer iteration is associated to the penalty method, used to transform the variational inequality into a variational equation, and the inner iteration is associated to the conjugate gradient method, used to solve the linear system generated by applying the finite element method to the variational equation. This inner part was implemented using the element by element strategy, which is easily parallelized. We analyse the behavior of two physical parameters and discuss some numerical results. Also, we analyse some results related to the performance of a parallel implementation of the algorithm.