• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.199-206
• /
• 2006

Sequential pattern mining is an important data mining task with broad applications. However, conventional methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivial patterns but fail to find interesting patterns shared by many sequences. In this paper, to overcome these problems, we propose the theme of approximate sequential pattern mining roughly defined as identifying patterns approximately shared by many sequences. The proposed method works in two steps: one is to cluster target sequences by their similarities and the other is to find consensus patterns that ire similar to the sequences in each cluster directly through multiple alignment. For this purpose, a novel structure called weighted sequence is presented to compress the alignment result, and the longest consensus pattern that represents each cluster is generated from its weighted sequence. Finally, the effectiveness of the proposed method is verified by a set of experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.29-36
• /
• 2009

Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, is an important data mining problem with broad applications. Since a sequential pattern in DNA sequences can be a motif, we studied to find sequential patterns in DNA sequences. Most previously proposed mining algorithms follow the exact matching with a sequential pattern definition. They are not able to work in noisy environments and inaccurate data in practice. Theses problems occurs frequently in DNA sequences which is a biological data. We investigated approximate matching method to deal with those cases. Our idea is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call approximated pattern. The existing PrefixSpan algorithm can successfully find sequential patterns in a long sequence. We improved the PrefixSpan algorithm to find approximate sequential patterns. The experimental results showed that the number of repeats from the proposed method was 5 times more than that of PrefixSpan when the pattern length is 4.

• Computational Structural Engineering
• /
• v.11 no.3
• /
• pp.241-252
• /
• 1998

본 논문은 신경망 근사 해석 모델의 원형을 스터브 거더의 거동 해석에 적용하고, 이 과정 중에 발생한 문제점을 파악하여 해결책을 제시함으로써, 앞서 개발한 원형 모델을 스터브 거더 시스템에 적합하도록 발전시키는데 목적이 있다. 스터브 거더의 해석 변수는 주어진 시간 내에 시뮬레이션이 가능하게 7개, 해석 결과값은 탄성 처짐뿐만 아니라 응력까지 고려하여 총 4개의 결과값을 동시에 고려하고, 학습 패턴 수는 총 143개를 사용하였다. 근사해석의 정확도를 향상시키고 학습의 수렴성을 보장하기 위하여 다양한 시뮬레이션을 수행하여 은닉층 뉴런 수, 학습 패턴 그리고 최대 에러의 관계를 규명하고, 이 결과를 바탕으로 신경망 근사 해석 모델 개발 단계를 수정하여 제안하였다.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.197-209
• /
• 2002

If we reduce the number of vertexes to decrease bit rate in polygon-based shape coding, the distortion of approximated contour increases rapidly. On the other hand, if we reduce the distortion, the number of vertexes increases rapidly and many bits are required to encode the vertexes. To improve this problem, in this paper we propose the approximation vertex search method. The encoder in the proposed method searches the type of distortion patterns that is the most similar to the shape which polygon edge and contour segment form and then encodes it. And then, the decoder mathematically finds the approximated vertexes from decoded distortion pattern information. Therefore, the proposed algorithm results in encoding many vertexes at a low bit rate and having the smoother shape than conventional method. As shown in computer simulation, the proposed method has less distortion than conventional method. It costs less bit rate by $10{\sim}20%$ than conventional algorithm in same distortion.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.39-47
• /
• 2006

The evaluation of MDx family hash functions such as MD5 is difficult because the design background or a generalized model is unknown. In this paper, an approximated model is proposed to generalize hash functions. The diffusion of a input difference is tested by an approximated model for MD5. The results show that MD5 does not provide perfect diffusion, so MD5 is weak against some attacks. We propose a multiple chaining pattern which provides perfect diffusion in approximated model of hash function without extra calculation or memory. And We show the probability of differential characteristics of our proposal.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.285-288
• /
• 2000

본 논문은 시간영역에서 희소어레이의 패턴을 원하는 패턴과 실제 희소어레이의 패턴간의 오차의 계수적 자승치를 Taylor 급수 근사와 미세탐색을 이용하여 최소화하여 빔패턴을 최적화하는 방법을 제시한다. 센서의 간격이 어레이 중심에 관하여 비대칭인 경우에 대하여 어레이 공간의 주어진 영역의 오차함수에 성능 향상을 위하여 계수를 적용한다. 미세탐색을 이용함으로써 계수 최소 방법의 성능이 주 빔 부근의 측면롭에 관련하여 향상되는 것이 판명되었다.

• Journal of KIISE:Software and Applications
• /
• v.28 no.7
• /
• pp.511-523
• /
• 2001

필기 한글의 문자나 단어 인식에 있어 패턴을 구성하는 획 성분을 추출하는 작업은 매우 중요하다. 세선화와 직선근사에 기반한 고전적인 방법은 원래 패턴을 크게 왜곡한다는 단점을 가지고 있다. 우리는 이러한 문제점을 해결하기 위하여 한글 패턴에 적합한 모양 분해 알고리즘을 제안한다. 한글 패턴은 T-접점과 B-접점이라는 두가지 모양 특징을 중심으로 분할할 수 있다고 관찰에 근거하여 알고리즘을 설계하였다. 또한 세 개 이상의 획이 복잡한 형태로 만나는 결합 지점을 강전하게 처리하는 방법도 제시한다. 제안한 알고리즘을 PE92 데이터베이스에 적용한 결과를 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.9
• /
• pp.785-795
• /
• 1990

For the far field radiation pattern of a microstrip array antenna which is conformed to a cylindrical surface and forms an arc array, an approximate analysis method using FOURIER TRANSFORM is presented. In this method, the conformal array antenna is projected on the effective aperture plane and assumed to be an aperiodic array with nonlinear phase tilt. The effective aperture plane includes four end-points of each arc on the cylindrical surface. When the effective aperture ratio which is normalized to the planar type is from 1.0 to 0.9, it is confirmed that this approximate method is valid. To the array on the effective aperture plane, it is assumed that the phase tilt is due to the distance between aperture plne and curvature surface. Specially, when the radius of arc is more than 5 times to its length, the FOURIER TRANSFORM METHOD could be used with only varying scale factors. The results of calculating by approximate method are good agreement with the results of COORDINATE TRANSFORM METHOD and experimentally measured value in the range of -40dB. And, the difference of half power angle is less than 5 degrees when the effective aperture ratio moer than 0.9.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2007.05a
• /
• pp.109-113
• /
• 2007

본 논문은 칼라 패턴의 감성 평가를 위해 러프 집합 이론이 효과적으로 사용될 수 있음을 보여준다. 우리는 주어진 랜덤 칼라 패턴을 보여주고 사람들로 하여금 감성 평가를 하게 하여 수집된 심리학적 실험 데이터를 기반으로 VPRS(Variable Precision Rough Set) 이론을 적용, 관련 규칙들을 추출하였다. 이러한 규칙들은 벽지 등의 컬러 패턴들에 대한 근사적인 감성 평가 뿐만 아니라, 이미지 속성 공간을 언어적 이미지 스케일로 표현된 감성 공간으로 매핑 시키기 위한 적응 퍼지 시스템 등의 초기 조건으로도 사용할 수도 있다.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.567-572
• /
• 2004

In this research, a stable walking pattern generation method for a biped robot is presented. A biped robot is considered as constrained multibody system by several kinematic joints. The proposed method is based on the optimized polynomial approximation of the trunk motion along the moving direction. Foot motions can be designed according to the ground condition and walking speed. To minimize the deviation from the desired ZMP, the trunk motion is generated by the fifth order polynomial approximation. Walking simulation for a virtual biped robot is performed to demonstrate the effectiveness and validity of the proposed method. The method can be applied to the biped robot for stable walking pattern generation.