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

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

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.147-154
• /
• 2023

Network intrusion refers to any unauthorized penetration or activity on a computer network. This upsets the confidentiality, integrity, and availability of the network system. One of the major threats to any system's availability is a Denial-of-Service (DoS) attack, which is intended to deny a legitimate user access to resources. Therefore, due to the complexity of DoS attacks, it is increasingly important to abstract and describe these attacks in a way that will be effectively detected. The automaton theory is used in this paper to implement a SYN Flood detection system based on Time-Dependent Finite Automata (TDFA).

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.483-497
• /
• 2024

Isometric array grammar is one of the simplest model to generate picture languages, since both sides of its production rule have the same shape. In this paper, we have introduced isometric fuzzy regular array grammars to generate isometric fuzzy regular array languages and discussed its closure properties. Also, the relation between isometric fuzzy regular array grammar and boustrophedon fuzzy finite automata has been discussed. Moreover, we study the relation between two dimensional fuzzy regular grammars with returning fuzzy finite automata and boustrophedon fuzzy finite automata. Further, the hierarchy results of these three classes of languages have been discussed.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.367-376
• /
• 2002

XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval and document management. In this paper, we propose a new methodology for computing similarity considering XML semantics - meanings of the elements and nested structures of XML documents. We generate extended-element vectors, using thesaurus, to normalize synonyms, compound words, and abbreviations and build similarity matrix using them. And then we compute similarity between XML elements. We also discover and minimize XML structure using automata(NFA(Nondeterministic Finite Automata) and DFA(Deterministic Finite automata). We compute similarity between XML structures using similarity matrix between elements and minimized XML structures. Our methodology considering XML semantics shows 100% accuracy in identifying the category of real documents from on-line bookstore.

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

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.1
• /
• pp.33-44
• /
• 2012

A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The applications of the proposed network are addressed in the encoding, identification, and extraction of finite state automata. Simulation results show that the identification of finite state automata using the proposed network, trained by the hybrid greedy simulated annealing with a modified error function in the learning stage, exhibits generally better performance than other conventional identification schemes.

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

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

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