نتایج جستجو برای: genetic algorithm and lattice map

تعداد نتایج: 17004553  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1375

in chapter one we will describe definitions and preliminary results to provide the global context of our own results to be presented in detail in the subsequent chapters in chapter two we consider degree-one maps of the circle and we study their rotation set. our main result in this chapter says that if the map is topologically mixing then its rotation interval is nontrivial (that is, not reduc...

ژورنال: علوم آب و خاک 2000
ارزانی, احمد , رامئه, ولی ‌اله , رضایی, عبدالمجید ,

Diallel crosses of six breeding inbred lines of corn (Zea mays L.) were used to estimate combining abilities, heterosis and some other genetic parameters for yield and some of its components. Parents, 15 F1 crosses and 4 filler genotypes, were evaluated in a 5×5 simple lattice design. For all the traits studied, except seed length, the efficiency of lattice design was less than one. Therefore...

Journal: :iranian journal of biotechnology 2013
hesamedin torabi dashti fatemeh zare-mirakabad nima aghaeepour hayedeh ahrabian abbas nowzari-dalini

background: rna molecules play many important regulatory, catalytic and structuralroles in the cell, and rna secondary structure prediction with pseudoknots is one themost important problems in biology. an rna pseudoknot is an element of the rna secondary structure in which bases of a single-stranded loop pair with complementary basesoutside the loop. modeling these nested structures (pseudokno...

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

Reactive power dispatch for voltage profile modification has been of interest Abstract to powerr utilities. Usually local bus voltages can be altered by changing generator voltages, reactive shunts, ULTC transformers and SVCs. Determination of optimum values for control parameters, however, is not simple for modern power system networks. Heuristic and rather intelligent algorithms have to be so...

Journal: :I. J. Bifurcation and Chaos 2000
Diego Maza Stefano Boccaletti Héctor Mancini

We describe the emergence of phase clustering and collective behaviors in an ensemble of chaotic coupled map lattices, due to a mean field interaction. This kind of interaction is responsible for the appearence of a collective state, wherein the mean field evolution of each lattice undergoes a periodic behavior in space. We analyze the transition to such a state in an ensemble of one-dimensiona...

2004
York Dobyns Harald Atmanspacher

Two-dimensional coupled map lattices display, in a specific parameter range, a stable phase (quasi-) periodic in both space and time. With small changes to the model parameters, this stable phase develops spontaneous eruptions of nonperiodic behavior. Although this behavior itself appears irregular, it can be characterized in a systematic fashion. In particular, parameter-independent features o...

1994
André LAMBERT

In relation to spatiotemporal intermittency, as it can be observed in coupled map lattices, we study the stability of different wavelengths in competition. Introducing a two dimensional map, we compare its dynamics with the one of the whole lattice. We conclude a good agreement between the two. The reduced model also allows to introduce an order parameter which combines the diffusion parameter ...

2009
Gregory Gutin Daniel Karapetyan

The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose a memetic algorithm for MAP that is a combination of a genetic algorithm with a local search procedure. The main contr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید