• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.3
• /
• pp.395-404
• /
• 2013

A pattern matching algorithm plays an important role in traffic identification and classification based on predefined patterns for intrusion detection and prevention. As attacks become prevalent and complex, current patterns are written using regular expressions, called regexes, which are expressed into the deterministic finite automata(DFA) due to the guaranteed worst-case performance in pattern matching process. Currently, because of the increased complexity of regex patterns and their large number, memory-efficient DFA from states reduction have become the mainstay of pattern matching process. However, most of the previous works have focused on reducing only the number of states on a single automaton, and thus there still exists a state blowup problem under the large number of patterns. To solve the above problem, we propose a new state compression algorithm that merges states on multiple automata. We show that by merging states with the same input character on multiple automata, the proposed algorithm can lead to a significant reduction of the number of states in the original DFA by as much as 40.0% on average.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.44-53
• /
• 2015

Control flow information is useful in the analysis and comparison of programs. Virtualization-obfuscation hides control structures of the original program by transforming machine instructions into bytecode. Direct examination of the resulting binary reveals only the structure of the interpreter. Recovery of the original instructions requires knowledge of the virtual machine architecture, which is randomly generated and hidden. In this paper, we propose a method to reconstruct original control flow using only traces generated from the obfuscated binary. We consider traces as strings and find an automaton that represents the strings. State transitions in the automaton correspond to the control transfers in the original program. We have shown the effectiveness of our method with commercial obfuscators.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.883-891
• /
• 1998

This paper proposes a scheme to exploit SIMD parallelism in the simulation of Cellular Automata models. The basic idea is to increase the utilization of an ALU in the underlying computer and to reduce simulation time by exploiting the parallelism. Thus, several cells are packed into a computer word and transit their state together. To show the performance of the proposed simulation scheme, two Cellular Automata models are simulated under three distinct hardware environments. The results show considerably high simulation speed-up for every case. Especially, the simulation speedup with the proposed simulation scheme reaches nearly 20 times in the best case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.394-396
• /
• 2012

무선 센서 네트워크는 센서들이 시간적, 공간적 제약을 갖고 있다는 점에서 여타 네트워크들과는 다른 특성을 갖고 있다. 본 연구에서는 무선 센서들을 보다 오랜 시간 동안 보다 넓은 영역을 커버하며 통신 할 수 있도록 하는 알고리즘을 제안한다. 우리는 가중치 기반의 셀룰러 오토마타 모델을 활용하여 효율적인 무선 센서 네트워크 알고리즘을 구현하고 그 실험 결과를 분석하여 제안된 알고리즘의 우수성을 입증하고자 한다.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.99-107
• /
• 2010

This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X, R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approximation space X (i.e., a set X with a reflexive and transitive relation on it), which turns out to be an intuitionistic fuzzy closure operator. This intuitionistic fuzzy closure operator gives rise to two saturated fuzzy topologies on X and it turns out that all the level topologies of one of the fuzzy topology coincide and equal to the topology analogously induced on X by a crisp approximation operator. These observations are then applied to intuitionistic fuzzy automata.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.225-227
• /
• 2018

세계화가 진행되는 요즘, 외국어의 한글 표기 수요가 점차 증가하고 있다. 하지만 현대 한글은 11,172자 밖에 표현할 수 없는 반면 훈민정음은 약 399억 음절을 표현할 수 있다. 하지만 기존 컴퓨터 시스템에서의 훈민정음은 훈민정음 창제원리가 반영되어 있지 않아 약 399억 음절을 온전히 표현할 수 없다. 본 연구의 목적으로 약 399억 음절 입력이 가능한 윈도우용 정음 입력기를 구현하기 위해 기존 연구에 이어 정음 조합 자동 장치를 연구하고 구현하여 이식함에 있다.

• Journal of Korea Foundry Society
• /
• v.16 no.6
• /
• pp.550-555
• /
• 1996

A stochastic model, based on the coupling of the finite volume(FV) method for macroscopic heat flow calculation and a two-dimensional cellular automaton(CA) model for treating microstructural evolution was applied-for the prediction of microstructural evolution in squeeze casting. The interfacial heat transfer coefficient at the casting/die interface was evaluated as a function of time using an inverse problem method in order to provide a quantitative simulation of solidification sequences under high pressure. The effects of casting process variables on the formation of solidification grain structures and on the columnar to equiaxed transition of an Al-4.5wt%Cu alloy in squeeze casting were investigated. The calculated solidification grain structures were in good agreement with those obtained experimentally.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.565-570
• /
• 1998

In a number of earlier papers the study of the structure of semigroups has been approached by means of right congruences. Such n approach seems appropriate since a right congruence is one of the possible analogs of both the right ideal of a ring and the subgroup in a group. Each of these substructures plays a strong role in the study of the structure of their respective systems. in both the ring and the group the internal direct product is nat-urally and effectively defined. however what such an internal direct product should be for two right congruences of a semigroup is not so clear. In this paper we will offer a possible definition and consider some of the consequences of it. We will also extend some of these results to automata.

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

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.3
• /
• pp.1-8
• /
• 1981

In this paper, the recognition method of Hangout patterns with the partial separation for the subpatterns is proposed. First, Hangout patterns are formalized into six formal patterns and their surface structures are discriminated. Second, two to four subpatterns from one form pattern are separated by the new algorithm combined with Index mark and Window. Hangout patterns are recognized with only frontiers of the tree by defining the regular U-tree grammar for the separated subpatterns. Compared with the previous tree grammar , this grammar reduces the production rules to 1/3 and simplifies automaton processing and has more flexiblity. By the simulation result for 1,600 characters of Hangeul patterns, separation rate of subpatterns (24 or 44) is obtained 99.1% and recognition rate is obtained 100 %.