• 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 Korean Association of Information Education
• /
• v.20 no.4
• /
• pp.401-408
• /
• 2016

CS Unplugged education is emphasized as the component of the basic principles of Elementary SW education. This document produced by two other Timbell presents the contents in a variety of topics about computer science. One of the main components is the finite Automata, and this requires the development of educational materials for teaching our situation. So We'll present the finite Automata learning materials for elementary school classes. Learning model that we have presented is a process of self-directed and activity-based learning. For verification of this experiment was the validation of the expert group and was concluded that adequate through the analysis of the diagnostic tests.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.638-642
• /
• 2001

In this paper we propose a noise reduction algorithm which based on cellular automata with the local median rule. It is supposed that there is no information about the features of the image that must be improved. The proposed method behavior is to locally increase or decrease the gray level differences of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. We have found that the automata present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuss the advantage and efficiency.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1400-1411
• /
• 2004

There are many cases that many XML documents have different DTDs in spite of having a similar structure and being logically same kind of document. For this reason, It occurs a problem that these XML documents have different database schema and are stored in different databases. So, in this paper, we propose an algorithm that unifies DTDs of these XML documents using the finite automata and the tree structure. The finite automata is suitable for representing repetition operators and connectors of DTD, and is a simple representation method for DTD. By using the finite automata, we are able to reduce the complexity of algorithm. And we apply a proposed algorithm to unify DTDs of science journals.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.132-137
• /
• 2015

A real-time system is a system wherein the behavior of the system depends not only on the input but also on the timing of the input. Timed automata is a widely used model for real-time system modeling and analysis. Model-based testing is employed to check whether the system under test (SUT) works according to the model specifications by using test cases generated from models that represent software requirements. In this paper, a case study was performed applying the timed automata based testing tools, UPPAAL-TRON, UPPAAL-COVER and SYMBOLRT, to the same system. Comparison of the testing approaches and tools is then made based on the results of the case study.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.2
• /
• pp.343-348
• /
• 2001

In this paper we propose a noise reduction algorithm which based on cellular automata with the local median rule. It is supposed that there is no information about the features of the image that must be improved. The proposed method behavior is to locally increase or decrease the gray level differences of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. We have found that the automata present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuss the advantage and efficiency.

• 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.