We consider the sum of dichromatic polynomials over non-separable rooted planar maps, an interesting special case of which is the enumeration of such maps. We present some known results and derive new ones. The general problem is equivalent to the q-state Potts model randomized over such maps. Like the regular ferromagnetic lattice models, it has a first-order transition when q is greater than ...

In this paper, an image encryption algorithm based on DNA random coding and random operation combined with chaotic map is proposed. In order to produce sequences with more chaotic characteristics, a new spatiotemporal chaotic system is proposed by employing the Tent-Sine system (TSS) in the coupled map lattice (CML). SHA-256 hash of the plain image is used to generate secret keys. The Lorenz Ma...

in this paper proposes a fuzzy multi-objective hybrid genetic and bee colony optimization algorithm(ga-bco) to find the optimal restoration of loads of power distribution network under fault.restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. to improve the efficiency of restoration and facilitate theactivity...

Phase synchronized states can emerge in the collective behavior of an ensemble of chaotic coupled map lattices, due to a mean field interaction. This type of interaction is responsible for synchronized chaotic global activity of the lattices, while the local activity of each map remains unsynchronized. The resulting collective dynamics is called “weak synchronization.” The transition to such a ...

in this paper, an efficient and comprehensive hybrid intelligent technique for the optimal placement of phasor measurement units (pmus) is proposed to minimize the number of pmu installation subjected to full network observability. three main purposes of pmus output synchronous measurements are monitoring, control, and protection of power system. we have combined binary imperialistic competitio...

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...

This contribution presents the results of an investigation on deterministic spatiotemporal chaos control by means of evolutionary algorithms. Three evolutionary algorithms are used for chaos control: differential evolution, self-organizing migrating algorithm and genetic algorithm. Models of spatiotemporal chaos, so called coupled map lattices, are used. The main aim of this investigation was t...

in this paper, landscape allocation using genetic algorithm (laga), a spatial multi-objective land use optimization software is introduced. the software helps in searching for optimal land use when multiple objectives such as suitability, area, cohesion and edge density indices are simultaneously involved. laga is a flexible and easy to use genetic algorithm-based software for optimizing the sp...

Genetic algorithms methods utilize the same optimization procedures as natural genetic evolution, in which a population is gradually improved by selection. We have developed a genetic algorithm search procedure suitable for use in protein folding simulations. A population of conformations of the polypeptide chain is maintained, and conformations are changed by mutation, in the form of conventio...

This paper demonstrates dynamical system models of genetic algorithms that exhibit cycling and chaotic behavior. The genetic algorithm is a binary-representation genetic algorithm with truncation selection and a density-dependent mutation. The density dependent mutation has a separate mutation rate for each bit position which is a function of the level of convergence at that bit position. Densi...