Применение технологии CUDA для моделирования миграционных процессов на основе клеточных автоматов
Contemporary state of the competitive intransitivity hypothesis is considered. Intransitive competition among species occurs when, for example, species A outcompetes species B, B outcompetes C, and C outcompetes A (sometimes written as A > B > C > A). In the first part of the article, a summary of the studies of competitive intransitivity is given. Examples of really existing intransitive loops are discussed, as well as simulation models that provide a theoretical explanation for these processes. Pro hac vice, sufficient potential diversity of community, species interactions carried out in relatively stable limited space that can be reclaimed, and a penalty for the acquisition of competitive ability are prerequisite. In the second part, the hypothesis of competitive intransitivity is compared with neutral theory and niche theory. The results are believed to make some generalizations possible which could stimulate deeper understanding of the species coexistence phenomenon.
The number of papers addressing the forecasting of the infectious disease morbidity is rapidly growing due to accumulation of available statistical data. This article surveys the major approaches for the short-term and the long-term morbidity forecasting. Their limitations and the practical application possibilities are pointed out. The paper presents the conventional time series analysis methods — regression and autoregressive models; machine learning-based approaches — Bayesian networks and artificial neural networks; case-based reasoning; filtration-based techniques. The most known mathematical models of infectious diseases are mentioned: classical equation-based models (deterministic and stochastic), modern simulation models (network and agent-based).
Resource-driven automata (RDA) are finite automata, sitting in the nodes of a finite system net and asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). RDAs themselves may be resources for each other, thus allowing the highly flexible structure of the model. It was proved earlier, that RDA-nets are expressively equivalent to Petri nets. In this paper the new formalism of cellular RDAs is introduced. Cellular RDAs are RDA-nets with an infinite regularly structured system net. We build a hierarchy of cellular RDA classes on the basis of restrictions on the underlying grid. The expressive power of several major classes of 1-dimensional grids is studied.