• Korean System Dynamics Review
• /
• v.1 no.1
• /
• pp.133-157
• /
• 2000

This paper deals with the social system from the point of system thinking consisting the fundamental construct of system dynamics. The Bertalanffy's general system theory, having been criticized because of its ambiguity, and the complex science theory, emerging system theory, are integrated by using the system thinking which is characterized with three concepts, 'feedback thinking', 'dynamic thinking', 'operational thinking'. In the integration, system thinking suggests the dynamic pattern of the social system have not only an equilibrium status but also complex status. The science of complexity gives an implication to system dynamics the important of the uncertainty and complexity if we interpret the social system as an open system. To show more concrete description, I simulate the cooperation model based on the iterated prisoner dilemma. The simulation results show the diverse patterns of cooperation and betrayal. Especially the sensitivity of initial payoff will cause the chaotic strategic landscapes as the game gose on. These results mean that we should not give the hasty prescription to control social system artificially. Because social system retains the self-organizing force in itself.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.190-194
• /
• 2002

Multiplication in Galois Field GF(2/sup m/) is a primary operation for many applications, particularly for public key cryptography such as Diffie-Hellman key exchange, ElGamal. The current paper presents a new architecture that can process Montgomery multiplication over GF(2/sup m/) in m clock cycles based on cellular automata. It is possible to implement the modular exponentiation, division, inversion /sup 1)/architecture, etc. efficiently based on the Montgomery multiplication proposed in this paper. Since cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.82-86
• /
• 1995

Using electrocardiography is a common method to diagnose heart disease, Modeling and simulation of activation process for the heart system is useful to understand electrocardiography. This paper proposes a two-dimensional cellular automata model for the activation process of the ventricles. The model represents the geometry of the ventricles by the ellipsoidal shape in two dimension. In the model, ventricles are divided into four layers, each of which has a set of cells with preassigned properties. The proposed model takes Into account the local orientation of the myocardial fibers and their distributed velocity, and refractory period. Simulation experiment is performed to measure activation potential for each cell in each layer within the ventricles.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.8
• /
• pp.746-753
• /
• 2001

In this paper, we review the basic concept of Evolvable Hardware first. And we examine genetic algorithm processor and hardware reconfiguration method and implementation. By considering complexity and performance of hardware at the same time, we design genetic algorithm processor using modularization and parallel processing method. And we design frame that has connection structure and logic block on FPGA, and embody reconfigurable hardware that do so that this frame may be reconstructed by RAM. Also we implemented ECANS that information processing system such as living creatures'brain using this hardware reconfiguration method. And we apply ECANS which is implemented using the concept of Evolvable Hardware to time-series prediction problem in order to verify the effectiveness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1047-1054
• /
• 2004

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2183-2185
• /
• 1998

In this paper, we propose a method of designing neural networks using biological inspired developmental and evolutionary concept. The living things are best information processing system in themselves. One individual is developed from a generative cell. And a species of this individual have adapted itself to the environment by evolution. Ontogeny of organism is embodied in cellular automata and phylogeny of species is realized by evolutionary algorithms. The connection among cells is determined by a rule of cellular automata. In order to obtain the best neural networks in the environment, we evolve the arrangement of initial cells. The cell, that is neuron of neural networks, is modeled on chaotic neuron with firing or rest state like biological neuron. A final output of network is measured by frequency of firing state. The effectiveness of the proposed scheme is verified by applying it to navigation problem of robot.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.852-855
• /
• 2005

In this paper we analyze the characterization of reachable states and nonreachable states of 3-neighborhood nonadditive cellular automata. And we propose the effective scheme to identify reachable states and nonreachable states.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.245-248
• /
• 2007

This paper provides some simple recursive formulas generation transition functions of finite cellular automata with triplet local transition functions under two states (0 and 1) and four different boundary conditions (0-0,0-1,1-0,1-1), and classify transition functions into several classes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.250-252
• /
• 2005

사용자의 ID와 패스워드를 인증 기반으로 하고 있는 현재의 컴퓨터 시스템들은 스니퍼나 IP 스푸핑 등을 통해 패스워드 누출에 대한 많은 위험성을 내포하고 있다. 이처럼 패스워드 도용을 이용한 불법 접속 시도 등 각종 위협에서 전산망을 안전하게 운용하기 위해 안전한 사용자 인증 기술의 확보가 필요한데, 이러한 대책들 가운데 주목 받는 기술이 일회용 패스워드이다. 본 논문에서는 병렬성을 가짐으로써 연산 속도가 빠른 셀룰러 오토마타(Cellular Automata, CA)를 이용해 일회용 패스워드를 생성한다. 그리고 사용자와 서버의 상호인증을 위한 인증인자를 생성하는데 CA를 적용하여 효율적인 인증 방식을 제안한다. 또한 제안된 방식이 여러 보안 요구사항에 안전함을 보인다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.406-409
• /
• 2006

In this paper, we analyze reachable/nonreachable state of 3-neighborhood cellular automata and propose give the algorithm finding the predecessor of a reachable state.