• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.890-895
• /
• 2000

본 논문에서는 인공신경망을 이용한 자모 검증을 HMM 기반 온라인 한글인식 시스템에 적용하는 방법론을 제시한다. 본 시스템에서 각각의 자모는 한 개의 HMM 모델과 한 개의 인공신경망 검증기를 갖는다. 자모 검증기는 HMM 네트웍이 생성한 자모 후보 가정을 입력으로 받은 후, 이 가정의 타당성에 대한 사후 확률을 출력한다. 이 사후 확률은 Viterbi 탐색시 탐색 경로에 반영된다. 기존 HMM 시스템의 국소적 특징의 한계를 보완하기 위하여, 한글 자모의 기본획 분석에서 얻어진 구조적, 전역적 특징이 자모 검증기에 사용되었다. 한글 낱자인식에 대한 실험 결과 HMM 기반 인식기에 자모 검증기를 도입함으로서 38.5%의 인식 오류를 줄일 수 있었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1259-1270
• /
• 2019

The upper bound of differential characteristic probability is mainly used to determine the number of rounds when constructing a block cipher. As the number of rounds affects the performance of block cipher, it is critical to evaluate the tight upper bound in the constructing process. In order to calculate the upper bound of differential characteristic probability, the previous searching methods for minimum number of active S-boxes constructed constraint equations for non-linear operations and linear operations, independently. However, in the case of BOGI design strategy, where linear operation is dependent on non-linear operation, the previous methods may present the less tight upper bound. In this paper, we exploit the properties of BOGI strategy to propose a new method to evaluate a tighter upper bound of differential characteristic probability than previous ones. Additionally, we mathematically proved the validity of our method. Our proposed method was applied to GIFT-64 and GIFT-128, which are based on BOGI strategy, and the upper bounds of differential characteristic probability were derived until 9 round. Previously, the upper bounds of differential characteristic probability for 7-round GIFT-64 and 9-round GIFT-128 were 2^-18.395 and 2^-26.885, respectively, while we show that the upper bounds of differential characteristic probability are more tight as 2^-19.81 and 2^-28.3, respectively.

• School Mathematics
• /
• v.16 no.1
• /
• pp.19-37
• /
• 2014

This study investigated the degree of understanding pre-service teachers' random variable concept, based on the attention and the importance for developing pre-service teachers' ability on statistical reasoning in statistics education. To accomplish this, the subject of this study was 70 pre-service teachers belonged to three universities respectively. The teachers were given to 7 tasks on random variable and requested to solve them in 40 minutes. The tasks consisted of three contents in large; 1) one was on the definition of random variables, 2) the other was on the understanding of random variables in different/diverse conditions, and 3) another was on problem solving relevant to random variable concept. The findings are as follows. First, while 20% of pre-service teachers understood the definition of random variable correctly, most teachers could not distinguish between random variable and variable or probability. Second, there was a significant difference in understanding random variables in different/diverse conditions. Namely, the degree of understanding on the continuous random variable was superior to that of discrete random variable and also the degree of understanding on the equal distribution was superior to that of unequality distribution. Third, three types of problems relevant to random variable concept dealt with in this study were finding a sample space and an elementary event, and finding a probability value. In result, the teachers responded to the problem on finding a probability value most correctly and on the contrary to this, they had the mot difficulty in solving the problem on finding a sample space.

• The Korean Journal of Applied Statistics
• /
• v.31 no.6
• /
• pp.801-810
• /
• 2018

Diffusion is a random process used to model financial and physical phenomena. When we construct statistical models for repeatedly observed diffusion processes, the idea of random effects needs to be considered. In this research, we introduce random parameters for an Ornstein-Uhlenbeck diffusion model and geometric Brownian motion diffusion model. In order to apply the maximum likelihood estimation method, we tried to build likelihoods in closed-forms, by assuming appropriate distributions for random effects. We applied the random effect models to data consisting of Dow Jones Industrial Average indices recorded daily over 27 years from 1991 to 2017.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.580-585
• /
• 2006

본 논문에서는 대학생들의 프로그래밍 과제물이나 프로그래밍 경진대회에 제출된 프로그램과 같이 동일한 기능을 요구받는 프로그램 소스 집합들에서 표절 행위가 있었는지를 탐색하는 새로운 알고리즘을 제시한다. 본 논문에서는 프로그램의 소스 집합에서 추출된 키워드들의 빈도수에 기반한 로그 확률값을 가중치로 하는 적응적(adaptive) 유사도 행렬을 만들어 이를 기반으로 주어진 프로그램의 유사구간을 탐색하는 지역정렬(local alignment) 방법을 소개한다. 우리는 10여개 이상의 프로그래밍 대회에 제출된 실제 프로그램으로 본 방법론을 실험하였다. 실험결과 이 방법은 이전의 고정적 유사도 행렬(일치 +1, 불일치 -1, 갭(gap)을 이용한 일치 -2)에 의한 유사구간 탐색에 비하여 여러 장점이 있음을 알 수 있었으며, 보다 다양한 표절탐색 목적으로 제시한 적응적 유사도 행렬이 응용될 수 있음을 알 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.539-542
• /
• 2009

해군에서는 소나를 이용하여 수중 표적을 효과적으로 탐색하기 위한 소나운용전술을 개발하기 위해 노력하고 있다. 효율적인 소나운용전술 개발을 위해서는 먼저 다양한 운영전술에 대한 효과도를 분석할 수 있는 시뮬레이션 시스템이 필요하다. 시뮬레이션 시스템은 해양환경 정보, 자함 정보, 소나 정보, 그리고 수중표적의 정보를 매개변수로 입력받아 운용전술에 대한 시뮬레이션을 수행하며, 시뮬레이션의 진행에 따른 다양한 정보를 제공할 수 있어야 한다. 본 연구에서는 다양한 환경에서 수중표적에 대한 함정의 최적 탐색 전략을 평가할 수 있는 탐색효과도 분석용 시뮬레이션 시스템을 설계 개발하였다. 시뮬레이션 시스템은 다양한 형태의 해양상태를 반영할 수 있도록 소나방정식 및 탐지확률곡선을 이용하여 개발되었으며, 표적의 실제적인 행동패턴을 고려하여 여러 가지 형태의 기동 패턴을 시스템에 묘사하였다. 개발된 시스템은 앞으로 수중표적에 대한 효율적인 소나운용전술을 개발하고 발전시키는데 유용하게 사용될 수 있을 것으로 판단된다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.921-928
• /
• 2004

This paper proposed dynamic adaptive model based on discrete probability distribution function and user profile in web based HyperMedia educational systems. This modelsrepresents application domain to weighted direction graph of dynamic adaptive objects andmodeling user actions using dynamically approach method structured on discrete probability function. Proposed probabilitic analysis can use that presenting potential attribute to useractions that are tracing search actions of user in WebMedia structure. This approach methodscan allocate dynamically appropriate profiles to user.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.630-637
• /
• 2018

Harmony search (HS) is a recently developed metaheuristic optimization algorithm. HS is inspired by the process of musical improvisation and repeatedly searches for the optimal solution using three operations: random selection, memory recall (or harmony memory consideration), and pitch adjustment. HS has been applied by many researchers in various fields. The increasing complexity of real-world optimization problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms and HS are required. We propose an improved clustering harmony search (ICHS) that uses a clustering technique to group solutions in harmony memory based on their objective function values. The proposed ICHS performs modified harmony memory consideration in which decision variables of solutions in a high-ranked cluster have higher probability of being selected than those in a low-ranked cluster. The ICHS is demonstrated in various optimization problems, including mathematical benchmark functions and water distribution system pipe design problems. The results show that the proposed ICHS outperforms other improved versions of HS.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

• Journal of Korean Port Research
• /
• v.13 no.1
• /
• pp.27-40
• /
• 1999

This study aims to apply and examine the stochastic approach for empty container repositioning and leasing problem. For this a case study has been carried out on actual data such as various cost components and traffic flow. The results reveal that the proposed methodology produces more realistic results than the conventional deterministic approaches. It is also found that the results are significantly affected by the accuracy of demand and supply forecast.