8,671 research outputs found
Recommended from our members
Incremental evolution of cellular automata for random number generation
Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA (CCA) can generate better random sequences than conventional one-dimensional (1-d) CA and compete with two-dimensional (2-d) CA. Yet the structural complexity of CCA is higher than that of 1-d PCA. It would be good if CCA can attain good randomness quality with the least structural complexity. In this paper, we evolve PCA/CCA to their lowest complexity level using genetic algorithms (GAs). Meanwhile, the randomness quality and output efficiency of PCA/CCA are also evolved. The evolution process involves two algorithms a multi-objective genetic algorithm (MOGA) and an algorithm for incremental evolution. A set of PCA/CCA are evolved and compared in randomness, complexity, and efficiency. The results show that without any spacing, CCA could generate good random number sequences that could pass DIEHARD. And, to obtain the same randomness quality, the structural complexity of CCA is not higher than that of 1-d CA. Furthermore, the methodology developed could be used to evolve other CA or serve as a yardstick to compare different types of CA
A comparative study of multi objective optimization algorithms for a cellular automata model
Cellular Automata (CA) models can represent dynamic systems which are discrete in space and time that reflects the effect of intrinsic parameters where individual events are considered to occur from randomness. A CA model of two agents' chemical kinetics has been optimized earlier using NSGA-II based on Evolutionary Algorithm (EA). But the stochastic nature of the CA model along with its high sensitivity on the model parameters requires extensive investigation using different optimization algorithms. For this purpose, in the current study, four more recently developed and popular optimization algorithms based on EA, called NSGA-IIr, NSGA-IIa, AbYSS and MOEA/D, have been considered for investigation based on various performance measuring parameters. The study also compares the performances of the algorithms for different computational efforts with an objective to minimize the required number of objective function evaluations. Simulation results and Friedman rank statistical test show NSGA-IIa and NSGA-IIr as the best choices to optimize the CA stochastic model across any number of objective function evaluations. Though the choice of optimization algorithm does not change with function evaluations, higher function evaluations improve the pseudo-pareto front for the CA optimization problem. Such results will facilitate the use of stochastic CA models to represent complex (bio)-chemical networks
Recommended from our members
Evolving cellular automata to generate nonlinear sequences with desirable properties
This paper presents a new chromosomal representation and associated genetic operators for the evolution of highly nonlinear cellular automata that generate pseudorandom number sequences with desirable properties ensured. This chromosomal representation reduces the computational complexity of genetic operators to evolve valid solutions while facilitating fitness evaluation based on the DIEHARD statistical tests
- …