• Journal of the Korean Institute of Gas
• /
• v.22 no.6
• /
• pp.136-143
• /
• 2018

Cellular automata have been applied to simulations in many fields such as astrophysics, social phenomena, fire spread, and evacuation. Using cellular automata, this study develops a model for consequence analysis of the dispersion of hazardous chemicals, which is required for risk assessments of and emergency responses for frequent chemical accidents. Unlike in cases of detailed plant safety design, real-time accident responses require fast and iterative calculations to reduce the uncertainty of the distribution of damage within the affected area. EPA ALOHA and KORA of National Institute of Chemical Safety have been popular choices for these analyses. However, this study proposes an initiative to supplement the model and code continuously and is different in its development of free software, specialized for small and medium enterprises. Compared to the full-scale computational fluid dynamics (CFD), which requires large amounts of computation time, the relative accuracy loss is compromised, and the convenience of the general user is improved. Using Python open-source libraries as well as meteorological information linkage, it is made possible to expand and update the functions continuously. Users can easily obtain the results by simply inputting the layout of the plant and the materials used. Accuracy is verified against full-scale CFD simulations, and it will be distributed as open source software, supporting GPU-accelerated computing for fast computation.

• Journal of Korea Water Resources Association
• /
• v.57 no.3
• /
• pp.165-179
• /
• 2024

It is crucial to have a comprehensive understanding of inundation and water cycle in urban areas for mitigating flood risks and sustainable water resources management. In this study, we developed a Cellular Automata-based integrated Water cycle model (CAW). A comparative analysis with physics-based and conventional cellular automata-based models was performed in an urban watershed in Portland, USA, to evaluate the adequacy of spatiotemporal inundation simulation in the context of a high-resolution setup. A high similarity was found in the maximum inundation maps by CAW and Weighted Cellular Automata 2 Dimension (WCA2D) model presumably due to the same diffuse wave assumption, showing an average Root-Mean-Square-Error (RMSE) value of 1.3 cm and high scores of binary pattern indices (HR 0.91, FAR 0.02, CSI 0.90). Furthermore, through multiple simulation experiments estimating the effects of land cover and soil conditions on inundation and infiltration, as the impermeability rate increased by 41%, the infiltration decreased by 54% (4.16 mm/m²) while the maximum inundation depth increased by 10% (2.19 mm/m²). It was expected that high-resolution integrated inundation and water cycle analysis considering various land cover and soil conditions in urban areas would be feasible using CAW.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.158-163
• /
• 1998

This paper is our first attempt to construct a information processing system such as the living creatures' brain based on artificial life technique. In this paper, we propose a method of constructing neural networks using bio-inspired emergent and evolutionary concept, Ontogeny of living things is realized by cellular automata model and Phylogeny that is living things adaptation ability themselves to given environment, are realized by evolutionary algorithms. Proposing evolving cellular automata neural systems are calledin a word ECANS. A basic component of ECANS is 'cell' which is modeled on chaotic neuron with complex characteristics, In our system, the states of cell are classified into eight by method of connection neighborhood cells. When a problem is given, ECANS adapt itself to the problem by evolutionary method. For fixed cells transition rule, the structure of neural network is adapted by change of initial cell' arrangement. This initial cell is to become a network b developmental process. The effectiveness and the capability of proposed scheme are verified by applying it to pattern classification and robot control problem.

• Journal of Advanced Navigation Technology
• /
• v.20 no.6
• /
• pp.631-637
• /
• 2016

Quantum cellular automata (QCA) are one of the alternative technologies that can overcome the limits of complementary metal-oxide-semiconductor (CMOS) scaling. It consists of nano-scale cells and demands very low power consumption. Various circuits on QCA have been researched until these days, and in the middle of the researches, exclusive-OR (XOR) gates are used as error detection and recover. Typical XOR logic gates have a lack of scalable, many clock zones and crossover designs so that they are difficult to implement. In order to overcome these disadvantages, this paper proposes XOR design using majority gate reduced clock zone. The proposed design is compared and analysed to previous designs and is verified the performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.112-117
• /
• 2004

In this paper, we propose a suitable multiplication architecture for cellular automata in a finite field $GF(2^m)$. Proposed least significant bit first multiplier is based on irreducible all one Polynomial, and has a latency of (m+1) and a critical path of $ 1-D_{AND}＋1-D{XOR}$.Specially it is efficient for implementing VLSI architecture and has potential for use as a basic architecture for division, exponentiation and inverses since it is a parallel structure with regularity and modularity. Moreover our architecture can be used as a basic architecture for well-known public-key information service in $GF(2^m)$ such as Diffie-Hellman key exchange protocol, Digital Signature Algorithm and ElGamal cryptosystem.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.139-141
• /
• 2006

Quantum-dot Cellular Automata (QCA) is one of the most promising next generation nano-electronic devices which will inherit the throne of CMOS which is the domineering implementation technology of large scale low power digital systems. In late 1990s, the basic operations of the QCA cell were already demonstrated on a hardware implementation. Also, design tools and simulators were developed. Nevertheless, its design technology is not quite ready for ultra large scale designs. This paper proposes a new approach which enables the QCA designs to inherit the verification methodologies and tools of CMOS designs, as well. First, a set of disciplinary rules strictly restrict the cell arrangement not to deviate from the predefined structures but to guarantee the deterministic digital behaviors. After the gate and interconnect structures of the QCA design are identified, the signal integrity requirements including the input path balancing of majority gates, and the prevention of the noise amplification are checked. And then the digital logic is extracted and stored in the OpenAccess common engineering database which provides a connection to a large pool of CMOS design verification tools. Towards validating the proposed approach, we designed a 2-bit QCA adder. The digital logic is extracted, translated into the Verilog net list, and then simulated using a commercial software.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1099-1104
• /
• 2009

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. While studying the models of systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and becomes to difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we analyze the properties of GF($2^p$) multiplue attractor cellular automata(GF($2^p$) MACA) C and give a method of synthesis of C which is a special class of hierarchical cellular automata proposed as an alternative to solve the problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2576-2589
• /
• 2017

Co-saliency detection is a task of detecting same or similar objects in multi-scene, and has been an important preprocessing step for multi-scene image processing. However existing methods lack efficiency to match similar areas from different images. In addition, they are confined to single image detection without a unified framework to calculate co-saliency. In this paper, we propose a novel model called Superpixel Matching-Cellular Automata (SMCA). We use Hausdorff distance adjacent superpixel sets instead of single superpixel since the feature matching accuracy of single superpixel is poor. We further introduce Cellular Automata to exploit the intrinsic relevance of similar regions through interactions with neighbors in multi-scene. Extensive evaluations show that the SMCA model achieves leading performance compared to state-of-the-art methods on both efficiency and accuracy.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.3
• /
• pp.211-219
• /
• 2002

In this paper, a new architecture that can simultaneously process modular multiplication and squaring on GF(2$^{m}$ ) in m clock cycles by using the cellular automata is presented. This can be used efficiently for the design of the modular exponentiation on the finite field which is the basic computation in most public key crypto systems such as Diffie-Hellman key exchange, EIGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.29-42
• /
• 2006

This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.