The Ideal Storage Cellular Automaton Model

نویسندگان

  • Andreas W. M. Dress
  • Wim Hordijk
  • Lin Wei
  • Peter Serocka
چکیده

We have implemented and investigated a spatial extension of the original ideal storage model by embedding it in a 2D cellular automaton with a diffusion-like coupling between neighboring cells. The resulting ideal storage cellular automaton model (ISCAM) generates many interesting spatio-temporal patterns, in particular spiral waves that grow and “compete” with each other. We study this dynamical behavior both mathematically and computationally, and compare it with similar patterns observed in actual chemical processes. Remarkably, it turned out that one can use such CA for modeling all sorts of complex processes, from phase transition in binary mixtures to using them as a metaphor for cancer onset caused by only one short pulse of ’tissue dis-organzation’ (changing e.g. for only one single time step the diffusion coefficient) as hypothesized in recent papers questioning the current gene/genome centric view on cancer onset by AO Ping et al.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

Cloud modeling of quasi - order groups on general fuzzy automata

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

متن کامل

Res Publica: The Universal Model of Computation

We proffer a model of computation that encompasses a broad variety of contemporary generic models, such as cellular automata—including dynamic ones, and abstract state machines— incorporating, as they do, interaction and parallelism. We ponder what it means for such an intertwined system to be effective and note that the suggested framework is ideal for representing continuous-time and asynchro...

متن کامل

SOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA

We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

متن کامل

A Self-Organizing Channel Assignment Algorithm: A Cellular Learning Automata Approach

Introduction of micro-cellular networks offer a potential increase in capacity of cellular networks, but they create problems in management of the cellular networks. A solution to these problems is self-organizing channel assignment algorithm with distributed control. In this paper, ''le first introduce the model of cellular learning automata in which learning automata are used to adjust the st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010