• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11b
• /
• pp.295-299
• /
• 2000

We have developed bio-system derived algorithm: Leaf Cellular Automata(LCA). LCA are one form of cellular automata. LCA are reffered to activity of a leaf. LCA have four layers: the "CO$_2$ Layer", the "Stoma Layer", the "Starch Layer" and the "Water Layer". In order to evaluate this optimization algorithm, we used a pattern matching problem.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.521-523
• /
• 2003

본 논문에서는 프로그램 가능한 셀룰라 오토마타(Programmable Cellular Automata, PCA)를 이용한 곱셈기를 제안한다. 본 논문에서 제안한 구조는 연산 후 늘어나는 원소의 수를 제한하기 위하여 이용되는 기약다항식(irreducible polynomial)으로서 All One Polynomial(AOP)을 사용하며, 주기적 경계 셀룰라 오토마타(Periodic Boundary Cellular Automata, PBCA)의 구조적인 특성을 사용함으로써 정규성을 높이고 하드웨어 복잡도와 시간 복잡도를 줄일 수 있는 장점을 가지고 있다. 제안된 곱셈기는 시간적. 공간적인 면에서 아주 간단히 구성되어 지수연산을 위한 하드웨어 설계나 오류 수정 코드(error correcting code)의 연산에 효율적으로 이용될 수 있을 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.923-926
• /
• 2001

침입 탐지 기법에 있어서 finite automata 를 통해 정상 행위를 프로파일링 하는 연구들이 많이 진행되어 왔으나, 자동으로 간결한 형태의 오토마타를 생성하는 것이 매우 어려웠다. 이 논문에서는 많은 침입 탐지 기법의 데이터 소스로 사용되고 있는 시스템 콜을 이용하여 자동으로 finite automata 를 생성하고, 여기에 언어 압축 알고리즘을 이용하여 오토마타를 압축하고 일반화 시킴으로써 다양한 프로세스의 행위들을 프로파일링 하도록 하였다. 제안된 알고리즘을 통해 모델링한 후 정상 행위와 비정상 행위를 가지고 실험을 한 결과 이들 사이에는 많은 수치적인 차이가 있음을 발견하였고, 이 결과를 바탕으로 침입을 탐지하는 것도 충분히 가능함을 알 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.665-673
• /
• 2002

In this paper, we introduce cellular automata and propose a new block cipher algorithm based on cellular automata. For the evaluation of performance and security, we compare the results of the proposed algorithm with them of the standard block ciphers such as DES, Rijndael regarding on avalanche effects and processing time, and analyze the differential cryptanalysis for a reduction version of the proposed algorithm. In addition, we perform the statistical tests in FIPS PUB 140-2(Federal Information Processing Standards Publication 140-2) for the output bit sequences of proposed algorithm to guarantee the randomness property.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.224-229
• /
• 2011

Cellular Automata is a discrete dynamical system that can be completely described in terms of local relation. For any given image, the system can save its features as well as increase or decrease the brightness of it locally through consideration of optimized transition in succession. These transitions in succession satisfy the function "Lyapunov" and have sequential movements. This study suggests the way of noise reduction for each image with the use of the Sequential Cellular Automata system. The mentioned transition in succession gives stable results with high-convergence performance to random noises and PSNR (Peak Signal-to-Noise Ratio) using histograms and MSE (Mean Square Error) for verification of effectiveness.

• Journal of International Society for Simulation Surgery
• /
• v.4 no.1
• /
• pp.21-23
• /
• 2017

Purpose In this paper, we proposed alternate neighborhood system and reverse spread-direction approach for accurate and fast cellular automata-based image segmentation method. Materials and Methods On the basis of a simple but effective interactive image segmentation technique based on a cellular automaton, we propose an efficient algorithm by using Moore and designed neighborhood system alternately and reversing the direction of the reference pixels for spreading out to the surrounding pixels. Results In our experiments, the GrabCut database were used for evaluation. According to our experimental results, the proposed method allows cellular automata-based image segmentation method to faster while maintaining the segmentation quality. Conclusion Our results proved that proposed method improved accuracy and reduced computation time, and also could be applied to a large range of applications.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1234-1239
• /
• 1990

In this paper, we propose a new type of decentralized learning automata for the control finite state Markov chains with unknown transition probabilities and rewards. In our scheme a .betha.-type learning automaton is associated with each state in which two or more actions(desisions) are available. In this decentralized learning automata system, each learning automaton operates, requiring only local information, to improve its performance under local environment. From simulation results, it is shown that the decentralized learning automata will converge to the optimal policy that produces the most highly total expected reward with discounting in all initiall states.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.752-757
• /
• 2000

The recursive formulae, which can self-reproduce the state transition graphs, of one-dimensional cellular automata rule 15 with two states (0 and 1) and four different boundary conditions were founded by categorical access. The categorical access makes the evolution process for cellular automata be expressed easily since it enables the mapping of automata between different domains.

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

Recently, the research on intelligence of computer has actively been under way in various areas and gradually extended to adapt to uncertain and complex environments. In this paper, we propose the MVL-Neural Valued Logic. Also, we verify that the MVL-Automata can be implemented to Neural Network and the MVL-Neural Network Model can be a simulator by MVL-Automata. Therefore, we propose that the MVL-Neural Network Model can be widely used in such area, as intelligent system or modeling of brain. In particular, the MVL-Neural Network is expected to be used as core technology of next generation computer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1136-1140
• /
• 2010

Esterel is an imperative synchronous language and its formal semantic based on finite state machine makes it easy to perform program analyses using automata. In this paper, we propose a syntax-driven automata generation rule. Because our rule intuitively expresses syntactic structure, it is very useful for other program analyses.