• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.55-60
• /
• 2007

The purpose of this study is to evaluate the temporal land cover change by gradual urbanization of Gyeongan-cheon watershed. This study used the five land use of Landsat TM satellite images(l987, 1991, 2001, 2004) which were classified by maximum likelihood method. The five land use maps examine its accuracy by error matrix and administrative district statistics. This study analyze land use patterns in the past using time.series Landsat satellite images, and predict 2004 year land use using a CA-Markov combined CA(Cellular Automata) and Markov process, and examine its appropriateness. Finally, predict 2030, 2060 year land use maps by CA-Markov model were constructed from the classified images.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.52-59
• /
• 2002

This paper introduces FSM, statistical FSM and NFA that are used for assigning behaviors of NPCs in computer games. We propose a new method for remedy of the weakness of previous studies. We use the method of inferencing stochastic grammars to generate NPCs behaviors. Using this method we can generate a lot of MPCs or Computer Players behaviors automatically and the games will be more enjoyable.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.783-798
• /
• 1999

Nondeterministic finite Rabin-Scott's automata without initial and final states (2 $\omega$-FA) are considered. In this paper they are used to define so called sets of obstruction used also in various alge-braic systems and to consider similar problems for the formal languages theory. Thus we define sets of obstructions of languages(or, rather, 2$\omega$-languages) of such automata. We obtain that each 2$\omega$-language defined by 2 $\omega$-FA has the set of obstruction being a regular language. And vice versa for each regular language L(containing no proper subword of its another word) there exists a 2$\omega$ -FA having L as the set of obstructions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2258-2274
• /
• 2020

In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses ⌈(1-ε)m)⌉ processors, where ε, m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.670-678
• /
• 2005

A Cellular Automaton(CA) is a dynamical system in which space and time are discrete, the state of each cell is unite and is updated by local interaction. Since the characteristics of CA is diffusion and local interaction, CA is used by crypto-systems and VLSI structure. In this study, we proposed a hash function based on the concept of 2-dimensional cellular automata and analyzed the proposed hash function.

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.747-756
• /
• 1999

In ring theory it is well-known that a ring R is (von Neumann) regular if and only if all right R-modules are flat. But the analogous statement for this result does not hold for a monoid S. Hence, in sense of S-acts, Liu (]10]) showed that, as a weak analogue of this result, a monoid S is regular if and only if all left S-acts satisfying condition (E) ([6]) are flat. Moreover, Bulmann-Fleming ([6]) showed that x is a regular element of a monoid S iff the cyclic right S-act S/p(x, x2) is flat. In this paper, we show that the analogue of this result can be held for automata and them characterize regular semigroups by flat automata.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.191-197
• /
• 2002

In this paper, we propose a stream cipher using a cellular automata. For the security evaluation, we use the statistical tests suggested on the report of FIPS PUB 140-2 and additionally, we apply entropy test, linear complexity test and auto-correlation test which are popular statistical tests for the output sequences of stream ciphers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.247-250
• /
• 2003

This paper describes the extraction method for brain region using cellular automata from the brain MR image. In the first removing the background from the brain MR image, and then extracting the brain region by applying the cellular automata rule obtained from histogram analysis information. The results on some experimental results showed that the PSNR is 42.11(dB) on image quality and also the correlation factor is estimated 98.46%. The result of this study can be used as the auto-diagnostics system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3397-3413
• /
• 2016

Considering that the layered cellular automata (LCA) are naturally fit for representing image data in various applications, a novel reverse iterative image encryption scheme based on LCA is proposed. Specifically, the plain image is set as the final configuration of an 8-layer CA, and some sequences derived from a random sequence are set as the pre-final configuration, which ensure that the same plain image will never be encrypted in the same way when encrypted many times. Then, this LCA is backward evolved by following some reversible two order rules, which are generated with the aid of a newly defined T-shaped neighborhood. The cipher image is obtained from the recovered initial configuration. Several analyses and experimental results show that the proposed scheme possesses a high security level and executive performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.12
• /
• pp.198-204
• /
• 2003

The bone fracture healing is simulated by using one of the complex system rules, named cellular automata method. It is assumed that each cell has property of Bone, Cartilage or Fibrous connective tissue. Nine local rules are adopted to change the property of each cell against the mechanical stimulus, which consists of the strain energy density, and the existence of bone in the surroundings. Two dimensional sheep metatarsal model is considered and the bone fracture healing is simulated. The simulation results agree well with those obtained by using fuzzy logic model and experimental data. The cellular automata method found to be one of the simulation methods to express the bone fracture healing. The cellular automata method is expected to be effective in representing biological phenomenon.