DNA Simulation of Genetic Algorithms: Fitness Computation

* This work has been partially supported by Spanish Project TIC2003-9319-c03-03 “Neural Networks and Networks of Evolutionary Processors”.

Evaluation of Pareto/D/1/k Queue by Simulation

The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to evaluate steady-state performance measures of Pareto/D/1/k queues. Some limited analytical derivation for queue models has been proposed in the literature, but their solutions are often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general queueing system must be developed. Despite certain limitations, simulation algorithms provide a mechanism to obtain insight and good numerical approximation to parameters of queues. In this work, we give an overview of some of these methods and compare them with our simulation approach, which are suited to solve queues with Generalized-Pareto interarrival time distributions. The paper discusses the properties and use of the Pareto distribution. We propose a real time trace simulation model for estimating the steady-state probability showing the tail-raising effect, loss probability, delay of the Pareto/D/1/k queue and make a comparison with M/D/1/k. The background on Internet traffic will help to do the evaluation correctly. This model can be used to study the long- tailed queueing systems. We close the paper with some general comments and offer thoughts about future work.

A DNA Codification for Genetic Algorithms Simulation

In this paper we propose a model of encoding data into DNA strands so that this data can be used in the simulation of a genetic algorithm based on molecular operations. DNA computing is an impressive computational model that needs algorithms to work properly and efficiently. The first problem when trying to apply an algorithm in DNA computing must be how to codify the data that the algorithm will use. In a genetic algorithm the first objective must be to codify the genes, which are the main data. A concrete encoding of the genes in a single DNA strand is presented and we discuss what this codification is suitable for. Previous work on DNA coding defined bond-free languages which several properties assuring the stability of any DNA word of such a language. We prove that a bond-free language is necessary but not sufficient to codify a gene giving the correct codification.

Grid and Simulation of Digital Communication Systems

The purpose of this paper is to turn researchers' attention to the use of grid computing for simulating digital communications and its large potential for decreasing significantly the duration of the experiments and for improving the statistical representativeness and reliability of the obtained results.

Numerical Analysis of Chemical Reactions by Monte Carlo Simulation

Добри Данков, Владимир Русинов, Мария Велинова, Жасмина Петрова - Изследвана е химическа реакция чрез два начина за моделиране на вероятността за химическа реакция използвайки Direct Simulation Monte Carlo метод. Изследван е порядъка на разликите при температурите и концентрациите чрез тези начини. Когато активността на химическата реакция намалява, намаляват и разликите между концентрациите и температурите получени по двата начина. Ключови думи: Механика на флуидите, Кинетична теория, Разреден газ, DSMC

A System for Simulation and Estimation of Branching Processes

A computer code system for simulation and estimation of branching processes is proposed. Using the system, samples for some models with or without migration are generated. Over these samples we compare some properties of various estimators.

Comparison between Numerical and Simulation Methods for Age-dependent Branching Models with Immigration

2000 Mathematics Subject Classification: primary: 60J80, 60J85, secondary: 62M09, 92D40