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

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.947-954
• /
• 2001

In this paper, we propose a method for the recognition of various head gestures with automata technique applied to the sequence of facial pose states. Facial regions as detected by using the optimum facial color of I-component in YIQ model and the difference of images adaptively selected. And eye regions are extracted by using Sobel operator, projection, and the geometric location of eyes Hierarchical feature analysis is used to classify facial states, and automata technique is applied to the sequence of facial pose states to recognize 13 gestures: Gaze Upward, Downward, Left ward, Rightward, Forward, Backward Left Wink Right Wink Left Double Wink, Left Double Wink , Right Double Wink Yes, and No As an experimental result with total 1,488 frames acquired from 8 persons, it shows 99.3% extraction rate for facial regions, 95.3% extraction rate for eye regions 94.1% recognition rate for facial states and finally 99.3% recognition rate for head gestures. .

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.69-76
• /
• 2013

In the recent years, cyber attacks by malicious codes called malware has become a social problem. With the explosive appearance and increase of new malware, innumerable disasters caused by metaphoric malware using the existing malicious codes have been reported. To secure more effective detection of malicious codes, in other words, to make a more accurate judgment as to whether suspicious files are malicious or not, this study introduces the malware analysis system, which is based on a profiling technique using the Finite Automata. This new analysis system enables realtime automatic detection of malware with its optimized partial execution method. In this paper, the functions used within a file are expressed by finite automata to find their correlation, and a realtime malware analysis system enabling us to give an immediate judgment as to whether a file is contaminated by malware is suggested.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1556-1564
• /
• 2005

Various optimization techniques are deployed in the compilation process of a source program for improving the program's execution speed and reducing the size of the source code. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree. The objective of this paper is to propose a table-driven code optimizer using the DFA(Deterministic Finite Automata) optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, refuting the pattern selection cost and expediting the pattern search process.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.266-276
• /
• 2013

LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.299-308
• /
• 2009

In this paper, we. present a collision attack on hash function with 2-dimensional cellular automata[1], which is useful for providing authentication on online game. This attack can find a collision message pair with $2^{28}$ computation using property of nonlinear function. We also extend basic attack with probability $2^{-28}$ to improve attack with probability 1 using Wang's analysis technique.

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

• Structural Engineering and Mechanics
• /
• v.16 no.5
• /
• pp.557-580
• /
• 2003

Laminated composite structures find wide range of applications in many branches of technology. They are much suited for weight sensitive structures (like aircraft) where thinner and lighter members made of advanced fiber reinforced composite materials are used. The orientations of fiber direction in layers and number of layers and the thickness of the layers as well as material of composites play a major role in determining the strength and stiffness. Thus the basic design problem is to determine the optimum stacking sequence in terms of laminate thickness, material and fiber orientation. In this paper, a new optimization technique called Cellular Automata (CA) has been combined with Genetic Algorithm (GA) to develop a different search and optimization algorithm, known as Cellular Genetic Algorithm (CGA), which considers the laminate thickness, angle of fiber orientation and the fiber material as discrete variables. This CGA has been successfully applied to obtain the optimal fiber orientation, thickness and material lay-up for multi-layered composite hybrid beams plates and shells subjected to static buckling and dynamic constraints.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.52 no.1
• /
• pp.61-68
• /
• 2010

토지피복은 대부분의 수문 수질 모형의 중요한 매개변수로서, 수자원 변화 예측에 중요한 입력자료로 활용되고 있다. 본 연구에서는 개선된 CA (Cellular Automata)-Markov 기법을 이용하여 충주댐유역의 미래 산림식생변화에 대한 예측을 시도하였다. 예측과정으로 과거의 Landsat TM 영상 (1985, 1990, 1995, 2000)을 이용하여 기법의 정확도 검증 및 산림분포의 변화경향을 파악하고, Landsat 산림은 2000년과 2005년의 NOAA AVHRR NDVI값을 기준으로 침엽수림, 혼효림, 활엽수림의 3종으로 구분한 후, 이를 이용하여 2030년, 2060년, 2090년의 식생변화를 추정하는 방법을 제안하였다. 이 방법의 적용결과, 2000년과 비교하여 2090년의 활엽수림과 혼효림은 각각 14.3 %, 11.6 % 증가하였으며, 침엽수림은 24.9 % 감소하는 것으로 나타났다. 과거의 경향성에 의해 예측을 시도한 본 연구결과는 미래 토지피복 변화에 따른 수문 수질 영향 분석시 지표 조건의 불확실성을 줄이는데 활용될 수 있다고 판단된다.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.49 no.6
• /
• pp.105-114
• /
• 2007

This study is to predict the spatial expansion of urban areas by applying CA(Cellular Automata)-Markov technique considering MCE(multi-criteria evaluation) and MOLA(multi-objective land allocation) of factor analysis. For the 10 administration districts$(3677.3km^2)$ including the whole Anseong-cheon watershed, the past six temporal land use data(1973, 1981, 1985, 1990, 1994, 2000) from Landsat satellite images were prepared. During this period, the urban area increased $233.71km^2$. Using the 36 indices composed of topological characteristics, population and land use change, the final factor map of MOLA was produced through 5 maps of MCE. Using 1990 and 1994 land use data, the 2000 predicted urban area of CA-Markov with factor map showed 0.06% improvement of absolute error comparing with that of CA-Markov without factor map. By the CA-Markov technique considering factor map, the 2030 and 2060 urban area increased $58.94km^2(0.78%)\;and\;60.14km^2(0.81%)$ respectively comparing with 2000 urban area$(313.19km^2)$. The 2030 and 2060 paddy area decreased $93.28km^2(2.54%)\;and\;93.65km^2(2.55%)$ respectively comparing with 2000 paddy area$(1383.23km^2)$.