• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.352-354
• /
• 2001

생물학적 서열의 구조 검색은 생물학적 특성을 예측하는데 많은 도움을 주며, 서열에서 나타나는 구조의 패턴은 촘스키의 형식 언어로 기술 가능하다. 본 논문에서는 문맥무관문법의 확장된 표기법인 DCG를 이용하여 구조 검색을 위한 구조 패턴의 생성 규칙을 정의하였다. 또한 구조 검색의 효율향상을 위하여 구조와 관련한 제한(constraint)을 정의하였고 이를 제한 논리 프로그래밍 언어로 구현하였다. 구현된 구조 검색 엔진은 웹 인터페이스를 통하여 접근할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.547-549
• /
• 2001

웹 기반 시스템의 테스팅에 대한 정확성과 신뢰성을 향상시키는 것은 시스템의 질을 향상시킬 수 있고 시스템 개발 및 유지보수에 대한 비용을 현저히 줄일 수 있다. 본 논문에서는 웹 로그 분석을 통하여 테스팅 환경 설정에 필요한 정보와 사용자들에 대한 패턴 정보를 추출하였다. 그리고 웹 컨텐츠 분석을 통하여 링크 정보와 데이터베이스에 대한 접근 또는 사용자 입력을 요구하는 모듈에 대한 정보를 추출하였다. 추출한 정보를 이용하여 테스팅을 위한 시나리오 문서인 테스트 스크립트를 생성함으로써 실세계에 근접한 테스트 시뮬레이션을 구현하는 방법을 제시하였다.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.77-83
• /
• 2015

Frequent pattern mining, which is one of the major areas actively studied in data mining, is a method for extracting useful pattern information hidden from large data sets or databases. Moreover, frequent pattern mining approaches have been actively employed in a variety of application fields because the results obtained from them can allow us to analyze various, important characteristics within databases more easily and automatically. However, traditional frequent pattern mining methods, which simply extract all of the possible frequent patterns such that each of their support values is not smaller than a user-given minimum support threshold, have the following problems. First, traditional approaches have to generate a numerous number of patterns according to the features of a given database and the degree of threshold settings, and the number can also increase in geometrical progression. In addition, such works also cause waste of runtime and memory resources. Furthermore, the pattern results excessively generated from the methods also lead to troubles of pattern analysis for the mining results. In order to solve such issues of previous traditional frequent pattern mining approaches, the concept of representative pattern mining and its various related works have been proposed. In contrast to the traditional ones that find all the possible frequent patterns from databases, representative pattern mining approaches selectively extract a smaller number of patterns that represent general frequent patterns. In this paper, we describe details and characteristics of pattern condensing techniques that consider the maximality or closure property of generated frequent patterns, and conduct comparison and analysis for the techniques. Given a frequent pattern, satisfying the maximality for the pattern signifies that all of the possible super sets of the pattern must have smaller support values than a user-specific minimum support threshold; meanwhile, satisfying the closure property for the pattern means that there is no superset of which the support is equal to that of the pattern with respect to all the possible super sets. By mining maximal frequent patterns or closed frequent ones, we can achieve effective pattern compression and also perform mining operations with much smaller time and space resources. In addition, compressed patterns can be converted into the original frequent pattern forms again if necessary; especially, the closed frequent pattern notation has the ability to convert representative patterns into the original ones again without any information loss. That is, we can obtain a complete set of original frequent patterns from closed frequent ones. Although the maximal frequent pattern notation does not guarantee a complete recovery rate in the process of pattern conversion, it has an advantage that can extract a smaller number of representative patterns more quickly compared to the closed frequent pattern notation. In this paper, we show the performance results and characteristics of the aforementioned techniques in terms of pattern generation, runtime, and memory usage by conducting performance evaluation with respect to various real data sets collected from the real world. For more exact comparison, we also employ the algorithms implementing these techniques on the same platform and Implementation level.

• Journal of Energy Engineering
• /
• v.5 no.2
• /
• pp.183-192
• /
• 1996

This paper presents a numerical model of the optimal operation pattern of the CHP system built for duel-purpose of power generation and district heat production. The model can be differently formulated in accordance with the view of planner: society, electric utility or district-heating company. Here, the operation pattern of the system components and the effect of heat price are of major interest in the study. From the case study, it was found that the optimal use of auxiliary heating equipment is very important to achieve the minimum societal cost. And, the multi-step heat pricing scheme is desirable to induce the voluntary behavior of both companies towards the societal optimal pattern.

• Annual Conference of KIPS
• /
• 2002.11a
• /
• pp.611-614
• /
• 2002

문서 자동 요약은 입력된 문서에 대해 컴퓨터가 자동으로 요약을 생성하는 과정을 의미한다. 즉, 컴퓨터가 문서의 기본적인 내용을 유지하면서 문서의 복잡도 즉 문서의 길이를 줄이는 작업이다. 효율적인 정보 접근을 제공함과 동시에 정보 과적재를 해결하기 위한 하나의 방법으로 문서 자동요약에 관한 연구가 활발히 진행되고 있다. 본 논문의 목적은 어휘 연관성 정보를 이용하여 한국어 문서를 자동으로 요약하는 효율적이며 효과적인 모형을 개발하는 것이다. 제안한 방법에서는 신문기사와 같은 특정 부류에 국한되는 단어간의 어휘연관성을 이용하여 명사-명사 공기패턴과 명사-동사 공기패턴을 구축하여 문서요약에 이용한다. 크게 불용어 처리 단계, 공기패턴 구축 단계, 문장 중요도 계산 단계, 요약 생성단계의 네 단계로 나누어 요약을 생성한다. 30% 중요문장 추출된 신문기사를 대상으로 평가한 결과 명사-명사 공기패턴과 빈도만을 이용한 방법보다 명사-동사 공기패턴을 이용한 방법이 좋은 결과를 가져 왔다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.31-33
• /
• 2005

GPS및 PDA의 발달로 인해서 위치 기반 서비스(LBS), 차량항법장치(CNS), 지리정보시스템(GIS)등 공간 데이터를 다루는 응용프로그램들이 급속하게 보급되었다. 이러한 응용프로그램은 높이 균등 색인 기법을 사용하여 원하는 데이터에 대한 색인을 제공하였다. 그러나 모든 공간 객체는 서로 상이한 접근 빈도를 가지고 있음에도 불구하고 기존의 공간색인 기법은 접근 빈도를 고려하지 못하는 단점을 가지고 있었다. 또한 기존의 빈도수만을 고려한 공간 객체의 색인 방법은 접근 빈도에 따른 편향성(skewed)은 제공하지만 공간 객체에 대한 지역성을 반영하지 못한다. 본 논문에서는 밀집되어 있는 공간 객체의 접근 빈도를 반영해서 편향된 색인 트리를 생성하는 기법을 제안한다. 이형 클러스터링으로 분포되어 있는 전체 영역에 대해서 Zahn의 클러스터링 알고리즘을 변형시켜서 다단계 세부영역을 구분한다. 이렇게 구간된 세부영역에 대해서 거리적 인접성과 접근 빈도수의 합을 이용해서 색인 트리를 생성한다. 다단계로 구성된 전체영역에 대해서 하향식 방식으로 편향된 색인 트리를 생성함으로써, 접근 빈도가 높은 공간 객체에 대해서 빠른 탐색이 가능하게 한다.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.101-108
• /
• 2006

Developing a network game that is serviced on the internet requires a lot of work, time and manpower. Therefore, it is important to design a game in such a way so that existing design codes could be used. The database for the multi-player network game is accessed from many clients. To manage the resource effectively, it is required to design the APIs to be minimized the database access and to be dealt with the related data efficiently. For this, it is needed to apply the object-oriented design for the related software modules. In the paper, we propose the design patterns of GoF to implement the APIs thatis needed to deal with the database resource. The database design through the analysis of some game's GUI has the advantage to create the optimized schema set more quickly, because it minimize the review step and the modification step of the database design generally. In addition, we apply to the design patterns of GoF for the APIs design of the server-side database. These reduce the times of the program call between the game server and the database server. These also make easily the maintenance for the already developed APIs, and it makes easily the addition of new APIs.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.12
• /
• pp.1036-1043
• /
• 2016

In this paper, an analysis about the elevation angle accuracy degradation of an APAR(Airport Precision Approach Radar) due to the multi-path effect using a phased array antenna was performed. An APAR installed around a runway of airport will be continuously affected in a runway surface of the fixed environment. In this paper, an analysis about the elevation angle accuracy degradation of APAR due to the multi-path effect of runway surface was conducted through a calculation of monopluse slope and sum/difference beam pattern analysis of array antenna. Also, a difference pattern for monopulse to minimize this degradation was optimized in an appropriate configuration to improve a elevation angle accuracy. Finally, a degree of improvement of elevation angle accuracy was confirmed by calculating a monopulse slope including the ground reflection after applying optimized difference patterns of array antenna.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.93-104
• /
• 2009

Modular implementation of a feature is a first step toward feature-oriented product line engineering, which develops and then utilizes core assets to configure products in terms of features. Aspect-oriented programming provides effective mechanisms for improving the modularity of feature implementations. However, as features in general are not independent of each other, changes in the implementation of one feature may cause changes to or side effects in the implementation of other features. Moreover, since the time at which a feature is incorporated into products, called feature binding time, may be various from compile time through load time to run time, a feature may have to be implemented differently depending on when the feature is bound into a product. To make each feature implementation module as independent as possible, this paper proposes aspectual implementation patterns that can effectively separate feature dependencies as well as feature binding time from feature implementation modules. These patterns enable flexible composition of feature implementation modules without affecting other modules according to feature selection. The approaches are demonstrated and evaluated based on a product line of scientific calculator applications.