• Title/Summary/Keyword: cellular-automata

Search Result 331, Processing Time 0.069 seconds

A study on the Urban Growth Model of Gimhae City Using Cellular Automata (셀룰라 오토마타를 이용한 김해시의 도시성장모형에 관한 연구 - 1987~2001년을 중심으로 -)

  • Lee, Sung Ho;Yun, Jeong Mi;Seo, Kyung Chon;Nam, Kwang Woo;Park, Sang Chul
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.7 no.3
    • /
    • pp.118-125
    • /
    • 2004
  • The purpose of this study is to decide an appropriate neighborhood and a transition rule of cellular automata by analyzing the past growth process of urban areas in Gimhae. With cellular automata which can manage the change based on the dynamic model and time, this study analyzes the urban growth of Gimhae from 1987 to 2001. Also, through the simulation of different types for neighborhood and transition rules, we can find the appropriate neighborhood and the transition rule for Gimhae. In conclusion, the forecast of physical urban growth pattern is more accurate under conditions when the number of matrixes for the neighborhood is small, the shape of the neighborhood is rectangular, "${\alpha}$" value, which control the pace of urban growth, is low and the transition possibility ($P_{ij}$) is high.

  • PDF

A Study on Design of Evolving Hardware using Field Programmable Gate Array (FPGA를 이용한 진화형 하드웨어 설계 및 구현에 관한 연구)

  • 반창봉;곽상영;이동욱;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.5
    • /
    • pp.426-432
    • /
    • 2001
  • This paper is implementation of cellular automata neural network system using evolving hardware concept. This system is a living creatures'brain based on artificial life techniques. Cellular automata neural network system is based on the development and the evolution, in other words, it is modeled on the ontogeny and phylogney of natural living things. The phylogenetic mechanism are fundamentally non-deterministic, with the mutation and recombination rate providing a major source of diversity. Ontogeny is deterministic and local physics. Cellular automata is developed from initial cells, and evaluated in given environment. And genetic algorithms take a part in adaptation process. In this paper we implement this system using evolving hardware concept. Evolving hardware is reconfigurable hardware whose configuration si under the control of an evolutionary algorithm. We design genetic algorithm process for evolutionary algorithm and cells in cellular automata neural network for the construction of reconfigurable system. The effectiveness of the proposed system if verified by applying it to Exclusive-OR.

  • PDF

Complemented Maximum-Length Cellular Automata Applied on Video Encryption (비디오 암호화를 위한 여원 최대길이 셀룰라 오토마타)

  • Li, Gao-Yong;Cho, Sung-Jin;Kim, Seok-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.13-18
    • /
    • 2017
  • With the advancement of internet technology, the importance of data protection is gaining more attention. As a possible data protection solution, we propose a novel video encryption method using complemented maximum-length cellular automata (C-MLCA). The first step for encryption is to use 90/150 CA rule to generate a transition matrix T of a C-MLCA state followed by a 2D C-MLCA basis image. Then, we divide the video into multiple frames. Once, we perform exclusive-OR operation with the split frames and the 2D basis image, the final encrypted video can be obtained. By altering values of pixel, the fundamental information in visualizing image data, the proposed method provides improved security. Moreover, we carry out some computational experiments to further evaluate our method where the results confirm its feasibility.

Cryptanalysis of Two Block Ciphers based on Cellular Automata (셀룰러 오토마타 기반 블록 암호에 대한 안전성 분석)

  • Ryu, Han-Seong;Lee, Je-Sang;Lee, Chang-Hoon;Hong, Seok-Hie
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1111-1120
    • /
    • 2008
  • Cellular automata(CA) is often applied to design cryptosystems because it has good diffusion and local interaction effects. Recently, a 128-bit CA-based block cipher, called CAB1, and a 64-bit reversible CA-based block cipher, called CAB2, were proposed in KMMS'02 and CEC'04, respectively. In this paper, we introduce cryptanalytic results on CAB1 and CAB2. Firstly, we propose a differential attack on CAB1, which requires $2^{31.41}$ chosen plaintexts with about $2^{13.41}$ encryptions. Secondly, we show that CAB2 has a security of 184 bits using the statistical weakness. Note that the designers of CAB2 insist that it has a security of 224 bits. These are the first known cryptanalytic results on them.

  • PDF

Design of Programmable Quantum-Dot Cell Structure Using QCA Clocking Based D Flip-Flop (QCA 클록킹 방식의 D 플립플롭을 이용한 프로그램 가능한 양자점 셀 구조의 설계)

  • Shin, Sang-Ho;Jeon, Jun-Cheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.6
    • /
    • pp.33-41
    • /
    • 2014
  • In this paper, we propose a D flip-flop based on quantum-dot cellular automata(QCA) clocking and design a programmable quantum-dot cell(QPCA) structure using the proposed D flip-flop. Previous D flip-flops on QCA are that input should be set to an arbitrary value, and wasted output values exist because it was utilized to duplicate by clock pulse and QCA clocking. In order to eliminate these defects, we propose a D flip-flop structure using binary wire and clocking technique on QCA. QPCA structure consists of wire control logic, rule control logic, D flip-flop and XOR logic gate. In experiment, we perform the simulation of QPCA structure using QCADesigner. As the result, we confirm the efficiency of the proposed structure.

Cellular-Automata Based Node Scheduling Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 셀룰러 오토마타 기반의 노드 스케줄링 제어)

  • Byun, Heejung;Shon, Sugook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.708-714
    • /
    • 2014
  • Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

Analysis of Pseudorandom Sequences Generated by Maximum Length Complemented Cellular Automata (최대길이 여원 CA 기반의 의사랜덤수열 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.1001-1008
    • /
    • 2019
  • A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

XOR Gate Based Quantum-Dot Cellular Automata T Flip-flop Using Cell Interaction (셀 간 상호작용을 이용한 XOR 게이트 기반의 양자점 셀룰러 오토마타 T 플립플롭)

  • Yu, Chan-Young;Jeon, Jun-Cheol
    • The Journal of the Convergence on Culture Technology
    • /
    • v.7 no.1
    • /
    • pp.558-563
    • /
    • 2021
  • Quantum-Dot Cellular Automata is a next-generation nanocircular design technology that is drawing attention from many research organizations not only because it is possible to design efficient circuits by overcoming the physical size limitations of existing CMOS circuits, but also because of its energy-efficient features. In this paper, one of the existing digital circuits, T flip-flop circuit, is proposed using QCA. The previously proposed T flip-flops are designed based on the majority gate, so the circuits are complex and have long delays. Therefore, the design of the XOR gate-based T flip-flop using cell interaction reduces circuit complexity and minimizes latency. The proposed circuit is simulated using QCADesigner, and the performance is compared and analyzed with the existing proposed circuits.

Multi-layer Structure Based QCA Half Adder Design Using XOR Gate (XOR 게이트를 이용한 다층구조의 QCA 반가산기 설계)

  • Nam, Ji-hyun;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.3
    • /
    • pp.291-300
    • /
    • 2017
  • Quantum-dot cellular automata(QCA) is a computing model designed to be similar to cellular automata, and an alternative technology for next generation using high performance and low power consumption. QCA is undergoing various studies with recent experimental results, and it is one of the paradigms of transistors that can solve device density and interconnection problems as nano-unit materials. An XOR gate is a gate that operates so that the result is true when either one of the logic is true. The proposed XOR gate consists of five layers. The first layer consists of OR gates, the third and fifth layers consist of AND gates, and the second and fourth layers are designed as passages in the middle. The half adder consists of an XOR gate and an AND gate. The proposed half adder is designed by adding two cells to the proposed XOR gate. The proposed half adder consists of fewer cells, total area, and clock than the conventional half adder.

A Study on Analysis of Landslide Disaster Area using Cellular Automata: An Application to Umyeonsan, Seocho-Gu, Seoul, Korea (셀룰러 오토마타를 이용한 산사태 재난지역 분석에 관한 연구 - 서울특별시 서초구 우면산을 대상으로-)

  • Yoon, Dong-Hyeon;Koh, Jun-Hwan
    • Spatial Information Research
    • /
    • v.20 no.1
    • /
    • pp.9-18
    • /
    • 2012
  • South Korea has many landslides caused by heavy rains during summer time recently and the landslides continue to cause damages in many places. These landslides occur repeatedly each year, and the frequency of landslides is expected to increase in the coming future due to dramatic global climate change. In Korea, 81.5% of the population is living in urban areas and about 1,055 million people are living in Seoul. In 2011, the landslide that occurred in Seocho-dong killed 18 people and about 9% of Seoul's area is under the same land conditions as Seocho-dong. Even the size of landslide occurred in a city is small, but it is more likely to cause a big disaster because of a greater population density in the city. So far, the effort has been made to identify landslide vulnerability and causes, but now, the new dem and arises for the prediction study about the areal extent of disaster area in case of landslides. In this study, the diffusion model of the landslide disaster area was established based on Cellular Automata(CA) to analyze the physical diffusion forms of landslide. This study compared the accuracy with the Seocho-dong landslide case, which occurred in July 2011, applying the SCIDDICA model and the CAESAR model. The SCIDDICA model involves the following variables, such as the movement rules and the topographical obstacles, and the CAESAR model is also applied to this process to simulate the changes of deposition and erosion.