• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.111-123
• /
• 2004

A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.181-187
• /
• 1995

한국어 형태소 해석기와 같은 한국어 정보 치리 시스템은 많은 전자 사진 검색 작업을 요구하기 때문에 전자 사전의 성능은 전체 시스템의 성능에 많은 영향을 미친다. 이에 본 논문은 적은 기억 장소를 차지하면서 탐색 속도가 빠른 Finite State Transducer(FST)를 이용한 전자 사전 구조를 제안한다. 제안된 전자 사진은 Deterministic Finite State Automata(DFA)로 표제어를 표현하고 DFA 상태수 최소화 알고리즘으로 모든 위치에 존재하는 중복된 상태를 제거하여 필요한 기억 장소가 적으며, FST를 일차원 배열에 매핑하고 탐색시 이 배열내에서의 상태 전이만으로 탐색을 하기 때문에 탐색 속도가 매우 빠르다. 또한 TRIE 구조에서와 같이 한번의 탐색으로 입력된 단어로 가능한 모든 표제어들을 찾아 줄 수 있다. 실험 결과 표제어 수가 증가하여도 FST를 이용한 전자 사전의 크기는 표제어 수에 비례하여 커지지 않고, 전자 사전 탐색 시간은 표제어 수에 영향을 받지 않으며, 약 237만 단어를 검색하는 실험에서 TRIE나 $B^+-Tree$구조를 사용한 전자 사전보다 빠름을 알 수 있었다.

• Proceedings of the KSR Conference
• /
• 2004.10a
• /
• pp.1241-1246
• /
• 2004

The verification confirms a correspondence between requirements and a specification before implementing. The problem in the formal method verifying a protocol specification using model checking is that the protocol behaviors must be always specified in L TS(Label Transition System). But if Region Automata is applied to the model checking, it is enable to verify whether properties are true on specification specified in I/O FSM(Input/Output Finite State Machine) as well as LTS. In this paper, we verify the correctness of rail signal control protocol type 1 specified in I/O FSM by using model checking method and region automata. This removes many errors and ambiguities of an informal method used in the past and saves down expenditures and times required in the protocol development. Therefore it is expected that there will be an increase in safety, reliability and efficiency in terms of the maintenance of the signaling system by using the proposed verification methods.

• Proceedings of the KOSOMBE Conference
• /
• v.1989 no.05
• /
• pp.19-22
• /
• 1989

This paper represents a syntactic peak detection algorithm which detects peaks in the ECG signal. In the algorithm, the input waveform is linearly approximated by "split-and-merge" method, and then each line segment is symbolized with primitive set. The peeks in the symbolized input waveform are recognized by the finite-state automata, which the deterministic finite-state language is parsed by. This proposed algorithm correctly detects peaks in a normal ECG signal as well as in the abnormal ECG signal such as tachycardia and the contaminated signal with noise.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.3-10
• /
• 1999

This paper describes the development and evaluation of a Korean address input system employing automatic speech recognition technique as user interface for input Korean address. Address consists of cities, provinces and counties. The system works on a window 95 environment of personal computer with built-in soundcard. In the speech recognition part, the Continuous density Hidden Markov Model(CHMM) for making phoneme like units(PLUs) and One Pass Dynamic Programming(OPDP) algorithm is used for recognition. For address recognition, Finite State Automata(FSA) suitable for Korean address structure is constructed. To achieve an acceptable performance against the variation of speakers, microphones, and environmental noises, Maximum a posteriori(MAP) estimation is implemented in adaptation. And to improve the recognition speed, fast search method using variable pruning threshold is newly proposed. In the evaluation tests conducted for the 100 connected words uttered by 3 males the system showed above average 96.0% of recognition accuracy for connected words after adaption and recognition speed within 2 seconds, showing the effectiveness of the system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.383-390
• /
• 2018

Since cellular automata(CA) is superior to LFSR in randomness, it is applied as an alternative of LFSR in various fields. However, constructing CA corresponding to a given polynomial is more difficult than LFSR. Cattell et al. and Cho et al. showed that irreducible polynomials are CA-polynomials. And Cho et al. and Sabater et al. gave a synthesis method of 90/150 CA corresponding to the power of an irreducible polynomial, which is applicable as a shrinking generator. Swan characterizes the parity of the number of irreducible factors of a trinomial over the finite field GF(2). These polynomials are of practical importance when implementing finite field extensions. In this paper, we show that the trinomial $x^{2^n-1}+X+1$ ($n{\geq}2$) are CA-polynomials. Also the trinomial $x^{2^a(2^n-1)}+x^{2^a}+1$ ($n{\geq}2$, $a{\geq}0$) are CA-polynomials.

• Journal of the Korea Society for Simulation
• /
• v.22 no.2
• /
• pp.63-71
• /
• 2013

Developing future weapons systems has become increasingly complicated and costly. There, modeling and simulation techniques have been highly interested in developing the defense systems. Modeling and simulation techniques provide a means to simulate military training, strategies, military doctrines, and weapons acquisition. In this paper, we proposed a small scale engagement scenario generation method for engagement M&S model. Generated scenario is one of critical factors in the field of commander training, operational analysis, and tactical evaluation. The objective of this paper is to develop a scenario generation method for small scale engagement using the FSA(Finite State Automata) and DFS(Depth First Search) algorithm. The proposed method is verified using a one-on-one combat engagement scenario between assault ship and reconnaissance ship. Also, we are visualized using Delta3D$^{TM}$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.1
• /
• pp.114-119
• /
• 1986

In this paper, an algorithm for the on-line recognition of handwritten Hangeul is proposed. The strokes are recognized by the minimum distance parser. The phonemes are separated by the finite-state automata resulted from the state graph of phonemes which are produced by the order of strokes. By simulation result for 3,000 characteristics in practical sentences, the recognition rate of strokes is obtained to be 98.5% and the separation rate of phonemes is obtained to be 92.5%.

• Korean Journal of Computational Design and Engineering
• /
• v.18 no.2
• /
• pp.104-112
• /
• 2013

Computer-based modeling and simulation (M&S) techniques have become an essential component in the development of new weapons systems. M&S techniques provide a means to simulate military training, strategies, military doctrines, and weapons acquisition processes. This paper proposes a small scale engagement scenario generation method. This work also includes a process for scenario generation and visualization. The proposed scenario generation methodology employs the Timed-FSA (finite state automata) and DFS (depth first search) algorithms. The proposed scenario generation method is verified using a one-on-one combat engagement scenario between two submarines. In addition, we suggest a scenario generation process including whole scenario generation and scenario visualization.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1284-1287
• /
• 1987

A method of quantitative electrocardiogram analysis, based on concepts drawn from syntactic pattern recognition theories, is described. The algorithm can be used for removing the Interference noises and base line drift as a filter function, and for reducing the number of points representing the digitized ECG waveform. The Parsing is performed with simple finite state automata inferred by experiments and suitable to be updated during experiment execution. Two parameters are utilized for defining the noise and these make the algorithm flexible. The examples for testing the algorithm is real ECG waveforms with noise. Some experimental results lire presented.