Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Penna model" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Population structure in the Penna model
Autorzy:
Sitarz, M.
Powiązania:
https://bibliotekanauki.pl/articles/1954644.pdf
Data publikacji:
2003
Wydawca:
Politechnika Gdańska
Tematy:
biological agein
Penna model
bit-string model
population structure
Opis:
Numerical simulations of growing population, based on the Penna model, are presented. We consider biological ageing as a result of the accumulation of mutations in the genotype. We present an example of simulated population structure and compare it with that of a real population. We also discuss the role of bad mutations threshold parameter T in the Penna model, to reproduce a smooth transition from the oversimplified logistic model (T --> ∞) to the Penna model.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2003, 7, 2; 263-269
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the evolution of migrating population with two competing species
Autorzy:
Magdoń-Maksymowicz, M.
Maksymowicz, A.
Powiązania:
https://bibliotekanauki.pl/articles/305345.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
computer simulation
population evolution
migration
Penna model
genetic mutations
Opis:
A computer experiment study of population evolution and its dynamics is presented for two competing species (A and B) which share two habitats (1 and 2) of a limited environmental capacity. The Penna model of biological aging, based on the concept of defective mutation accumulation, was adopted for migrating population. In this paper, we assume and concentrate on the case when only one species (A) is mobile. For isolated habitats and for any initial population, we get at equilibrium spatial population distribution (A, B) in which A occupies location ’1’ only, while B-species is the ultimate winner in ’2’. This is achieved by suitable choice of model parameters so habitat ’1’ is more attractive for species ’A’ while location ’2’ is more advantageous to ’B’. However, population distribution begins to differ when migration between habitats is allowed. Initially stable distribution (A, B), becomes (A, A&B) with a mixed stationary population in location ’2’. For a higher migration rate, initial (A, B) distribution goes to (A, A) distribution, in which A species is dominant also in a less friendly habitat ’2’. However, a further increase in migration rate brings sequence (A, B)b(B, B). In short, for sufficiently high mobility of A-species, they eliminate themselves. Other scenarios not discussed here were also studied. They offer a rich variety of different sequences of population distribution regarding their size as well as other characteristics.
Źródło:
Computer Science; 2013, 14 (4); 615-627
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Penna model of population evolution
Autorzy:
Magdoń-Maksymowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/1941717.pdf
Data publikacji:
2000
Wydawca:
Politechnika Gdańska
Tematy:
population evolution
biological ageining
Penna model
bad mutations
migration process
logistic equation
Gompertz law
Opis:
Computer studies of population evolution are presented. Numerical calculations are based on the Penna model. This model accounts for mutation load of individuals resulting in non-trivial age (a) dependence of the mortality rate q(a) which may be compared with empirical data. The Penna model is also very flexible for suitable modifications of the population evolution process such as hunting, genetic death, migration etc. Here we present some examples of the population growth for different evolution rules. Calculations require about 100 MB memory for 10/sup 6/ population which is necessary to get reliable statistics. The typical running time for 3000 iteration steps is several hours for a HP S2000 machine.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2000, 4, 1; 5-18
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies