نتایج جستجو برای: lattice gas automata

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

2011
Lei Kristoffer R. Lactuan Joseph Anthony C. Hermocilla Mehrdad Ghaemi Amene Shahrokhi

ABSTRACT The process in which cancer cells invade or grow is very complex. Thus researchers rely on simulation to study and understand this phenomenon. Cellular Pots Model (CPM) and the Lattice-Gas Cellular Automata(LGCA) is one model for cancer cell growth simulation. In this work, we present a Compute Unified Device Architecure(CUDA)-based implementation of CPM combined with LGCA and compare ...

Journal: :Philosophical transactions. Series A, Mathematical, physical, and engineering sciences 2002
David A Meyer

In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas aut...

2005
Eric Harley Lisette de Pillis

Significant work has been done modeling cancerous tumor growth and response to therapy under certain simplifying assumptions, specifically, the assumption of spatial homogeneity. We have chosen a spatially heterogenous model for cancer cell growth using a hybrid Lattice-Gas Cellular Automata method. Cell mitosis, apoptosis, and necrosis are explicitly modeled along with the diffusion of nutrien...

2001
David A. Meyer

I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantum lattice gas automata as examples, I describe possibilities for efficient simulation of quantum and classical systems with a quantum computer. I conclude with a list of research directions. 2001 Physics...

2011
T. Mäki-Marttunen J. Kesseli S. Kauffman O. Yli-Harja M. Nykter

We study the complexity of network dynamics in a couple of very different model classes: The traditional random Boolean networks (RBN) and Frisch-Hasslacher-Pomeau lattice gas automata (FHP). For this we formulate the FHP dynamics as a probabilistic Boolean network (PBN). We use the set complexity of successive network states to assess the complexity of the dynamics. We find that the complexity...

Journal: :RITA 2016
Rogério Luís Rizzi Claudia Brandelero Rizzi Wesley Luciano Kaiser Petterson Vinícius Pramiu

This paper presents a study of computational epidemiological models, focusing models types Susceptible-Infected-Removed, discussing some strategy of solution for computational simulation of the spread of hypothetical communicable diseases. It is shown that models based on cellular automata type Lattice Gas Cellular Automata has likened the solution obtained by multi-agent system, unlike models ...

Journal: :Discrete Applied Mathematics 1984

Journal: :Future Generation Computer Systems 1999

2010
He Junlian Li Mingtian

Mode-I crack propagation in quasi-brittle material such as rock and concrete is studied by a new numerical method, lattice cellular automata. Cellular automaton method is an efficient method that simulates the process of self-organization of the complex system by constructing some simple local rules. It is of the advantage of localization and parallelization. Lattice model can transform a compl...

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

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