• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.379-389
• /
• 2000

A cellular automaton is well-known for self-organizing and dynamic behavions in the filed of artifial life. This paper addresses a new neuronic architecture called an evolvable celluar classifier which evolves with the genetic rules (chromosomes) in the non-uniform cellular automata. An evolvable cellular classifier is primarily based on cellular programming, but its mechanism is simpler becaise it utilizes only mutations for the main genetic operators and resmbles the Hopfield network. Therefore, the desirable bit-patterns could be obtained through evolutionary processes for just one individual agent, As a rusult, an evolvable hardware is derived which is applicable to clessification of bit-string information.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.883-891
• /
• 1998

This paper proposes a scheme to exploit SIMD parallelism in the simulation of Cellular Automata models. The basic idea is to increase the utilization of an ALU in the underlying computer and to reduce simulation time by exploiting the parallelism. Thus, several cells are packed into a computer word and transit their state together. To show the performance of the proposed simulation scheme, two Cellular Automata models are simulated under three distinct hardware environments. The results show considerably high simulation speed-up for every case. Especially, the simulation speedup with the proposed simulation scheme reaches nearly 20 times in the best case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.485-487
• /
• 2011

우리는 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 셀룰러 오토마타는 간단한 전이 규칙들의 집합을 정의함으로써 비교적 복잡한 자연현상이나 사회현상을 재현해낼 수 있는 특징을 갖고 있다. 우리는 기존에 Eades가 제안했던 하중-기초 그래프 그리기 알고리즘을 기반으로 하여 육각형 격자상에서의 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 제안된 모델은 기존의 알고리즘에 비해 더 효율적인 연산과정을 거치게 되며 보다 대칭적인 그래프를 그려준다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.89.6-89
• /
• 2001

In Vehicle Information and Communication System (VICS), which is an active field of Intelligent Transport System (ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicle´s demand. This paper proposes a sub-optimal route planning mechanism of vehicles in urban areas using the non-network type immune system. Simulation is carried out using a cellular automaton model. This system announces a sub-optimal route to drivers in real time using VICS.

• Journal of KSNVE
• /
• v.10 no.4
• /
• pp.610-614
• /
• 2000

Cellular Automata(CA)s are used as a simple mathematical model to investigate self-organization in statistical mechanics, which are originally introduced by von Neumann and S. Ulam at the end of the 1940s. CAs provide a framework for a large class of discrete models with homogeneous interactions, which are characterized by the following fundamental properties: 1) CAs are dynamical systems in which space and time are discrete. 2) The systems consist of a regular grid of cells. 3) Each cell is characterized by a state taken from a finite set of states and updated synchronously in discrete time steps according to a local, identical interaction rule. 4) The state of a cell is determined by the previous states of a surrounding neighborhood of cells. A cellular automaton has been attracted wide interest in modeling physical phenomena, which are described generally, partial differential equations such as diffusion and wave propagation. This paper describes one and two-dimensional analysis of wave propagation phenomena modeled by CA, where the local interaction rules were derived referring to the Lattice Gas Model reported by Chen et al., and also including finite difference scheme. Modeling processes by using CA are discussed and the simulation results of wave propagation with one wave source are compared with that by finite difference method.

• Advances in Computational Design
• /
• v.3 no.1
• /
• pp.35-47
• /
• 2018

Design of settlement space is a complicated process while reasonable spatial layout bears great significance on the development and resource allocation of a settlement. The study proposes a weighted L-system generation algorithm based on CA (Cellular Automation) model which tags the spatial attributes of cells through changes in their state during the evolution of CA and thus identifies the spatial growth mode of a settlement. The entrance area of the Caidian Botanical and Animal Garden is used a case study for the model. A design method is proposed which starts from the internal logics of spatial generation, explores possibility of spatial rules and realizes the quantitative analysis and dynamic control of the design process. Taking a top-down approach, the design method takes into account the site information, studies the spatial generation mechanism of settlements and further presents a engine for the generation of multiple layout proposals based on different rules. A optimal solution is acquired using GA (Genetic Algorithm) which generates a settlement spatial layout carrying site information and dynamically linked to the surround environment. The study aims to propose a design method to optimize the spatial layout of the complex settlement system based on parametric generation.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.1-16
• /
• 2004

The modelling and simulation of the activation process for the heart system is meaningful to understand special excitatory and conductive system in the heart and to study cardiac functions because the heart activation conducts through this system. This thesis proposes two dimensional cellular automaton(CA) model for the activation process of the myocardium and conducted simulation by means of discrete time and discrete event algorithm. In the model, cells are classified into anatomically similar characteristic parts of the heart and each of cells has a set of cells with preassigned properties. Each cell in this model has state variables to represent the state of the cell and has some state transition rules to change values of state variables executed by state transition function. The state transition rule is simple as follows. First, the myocardium cell at rest stay in passive state. Second, if any one of neighborhood cell in the myocardium cell is active state then the state is change from passive to active state. Third, if cell's state is an active then automatically go to the refractory state after activation phase. Four, if cell's state is refractory then automatically go to the passive state after refractory phase. These state transition is processed repeatedly in all cells through the termination of simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.394-396
• /
• 2012

무선 센서 네트워크는 센서들이 시간적, 공간적 제약을 갖고 있다는 점에서 여타 네트워크들과는 다른 특성을 갖고 있다. 본 연구에서는 무선 센서들을 보다 오랜 시간 동안 보다 넓은 영역을 커버하며 통신 할 수 있도록 하는 알고리즘을 제안한다. 우리는 가중치 기반의 셀룰러 오토마타 모델을 활용하여 효율적인 무선 센서 네트워크 알고리즘을 구현하고 그 실험 결과를 분석하여 제안된 알고리즘의 우수성을 입증하고자 한다.

• Journal of Korea Foundry Society
• /
• v.16 no.6
• /
• pp.550-555
• /
• 1996

A stochastic model, based on the coupling of the finite volume(FV) method for macroscopic heat flow calculation and a two-dimensional cellular automaton(CA) model for treating microstructural evolution was applied-for the prediction of microstructural evolution in squeeze casting. The interfacial heat transfer coefficient at the casting/die interface was evaluated as a function of time using an inverse problem method in order to provide a quantitative simulation of solidification sequences under high pressure. The effects of casting process variables on the formation of solidification grain structures and on the columnar to equiaxed transition of an Al-4.5wt%Cu alloy in squeeze casting were investigated. The calculated solidification grain structures were in good agreement with those obtained experimentally.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.59-68
• /
• 2016

Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.