• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1183-1186
• /
• 2002

DNA 의 염기서열 탐색을 위한 유전체학의 다음 세대인 구조유전체학은 유전체 사업으로 인한 인간 게놈지도의 완성과 축적된 생물정보를 이용한 생물정보학의 발달과 함께 급속한 성장을 계속하고 있다. 포스트 게놈 시대를 맞이하여 생명현상에 대한 궁극적인 이해를 위한 노력으로 단백질의 구조와 기능에 대한 연구가 주목을 받게 되었다. 다양한 구조 규명을 위한 도구들과 단백질 정보를 관리하기 위한 데이터베이스 구축에 따른 관련 기술의 발전은, 앞으로 다가올 생물정보의 방대함을 감안할 때, 가치 있는 지식정보를 얻기 위한 데이터 마이닝 기법들을 통해서만 가능하다. 본 논문은 데이터 마이닝의 근간 기술인 연관규칙 마이닝을 응용한 효율적인 서열 연관 규칙 알고리즘을 제안하며, 단백질 구조의 예측을 위한 단백질 서열 및 DNA 서열간의 패턴 비교 및 연관성을 목적으로 한다. 또한, 공간적 시간적 복잡성을 CMS-tree 라는 자료구조를 통해 알고리즘의 확장성 및 병렬화의 기본 알고리즘으로 사용하도록 개발하였다.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05b
• /
• pp.610-615
• /
• 1996

PSA 모델링 및 데이타 관리를 효과적으로 수행하고 PSA 정량화를 자동화할 수 있도록 PSA workstation 을 개발하고 있다. Windows용 고장수목 및 사건수목 편집기, 데이타 관리 모듈 개발등의 PSA모델링 및 관리 모듈이 개발되었고, 또한 최소단절집합 생성 방법 개선, 규칙기반 회복조치 분석 및 고장수목 순환논리 분석 방법 개발등을 통한 PSA 정량화 방법의 개선이 이루어졌다. PSA workstation은 PSA 응용 소프트웨어 개발의 기초로도 사용될 수 있다.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.405-414
• /
• 2011

Korean grammar checkers typically detect context-dependent errors by employing heuristic rules that are manually formulated by a language expert. These rules are appended each time a new error pattern is detected. However, such grammar checkers are not consistent. In order to resolve this shortcoming, we propose new method for generalizing error decision rules to detect the above errors. For this purpose, we use an existing thesaurus KorLex, which is the Korean version of Princeton WordNet. KorLex has hierarchical word senses for nouns, but does not contain any information about the relationships between cases in a sentence. Through the Tree Cut Model and the MDL(minimum description length) model based on information theory, we extract noun classes from KorLex and generalize error decision rules from these noun classes. In order to verify the accuracy of the new method in an experiment, we extracted nouns used as an object of the four predicates usually confused from a large corpus, and subsequently extracted noun classes from these nouns. We found that the number of error decision rules generalized from these noun classes has decreased to about 64.8%. In conclusion, the precision of our grammar checker exceeds that of conventional ones by 6.2%.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.65-82
• /
• 2008

The purposes of this study are to explore FRBR utilities such as work clustering and expression clustering and problems of application of the FRBR by developing work and expression clustering algorithm and implementing it into cataloging system, and to suggest new cataloging rules for FRBR and guideline of MARC description to improve FRBR work clustering. FRBR was suggested by necessitation of collocation function of bibliographic records according to increase of searching materials and multi-version materials, but FRBRization has some problems such as imperfect conversion of bibliographic records to FRBR records and inappropriateness of current cataloging rules for FRBR. Bibliographic records must be processed by FRBR algorithm to construct FRBRized system, but bibliographic records and current cataloging rules couldn't perfectly support FRBRization. Therefore cataloging rules and guidelines of MARC description for FRBR are needed. For constructing FRBRized cataloging system in Korea, it is needed to find problems and solution through FRBR practical application such as developing FRBR algorithm and applying it to cataloging records.

• Journal of the Korean Data Analysis Society
• /
• v.20 no.6
• /
• pp.2865-2872
• /
• 2018

In the field of data mining technique, there are various methods such as association rules, cluster analysis, decision tree, neural network. Among them, association rules are defined by using various association evaluation criteria such as support, confidence, and lift. Agrawal et al. (1993) first proposed this association rule, and since then research has been conducted by many scholars. Recently, studies related to crossover entropy have been published (Park, 2016b). In this paper, we proposed a purely symmetric J measure considering directionality and purity in the previously published J measure, and examined its usefulness by using examples. As a result, it is found that the pure symmetric J measure changes more clearly than the conventional J measure, the symmetric J measure, and the pure crossover entropy measure as the frequency of coincidence increases. The variation of the pure symmetric J measure was also larger depending on the magnitude of the inconsistency, and the presence or absence of the association was more clearly understood.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.107-116
• /
• 2009

Overcrowding in an Emergency Department (ED) of hospital is a common phenomenon. To improve the service quality and system performance of the ED, a task assignment rule for the Registered Nurses (RNs) is proposed in this paper. At each task assignment point, the rule prioritizes all treatment requests based on the urgency which is determined by the multiple attributes such as accomplishment time of treatment task, elapsed time of treatment request, total remain time to patient discharge, and number of remain treatments. The values of partial urgency with a single criterion are determined and then overall urgency is computed to find the most urgent one among current requests with the importance weights assigned to the criteria. Through computer simulation, the performance of the proposed rule is compared with current rule in terms of the length of stay and system throughput in a simplified ED system of the hospital M.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.443-452
• /
• 1995

Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving this claim and the investigation of related issues such as query processing have been hampered by the absence of a formal object-oriented query model. In this paper, we not only define a query model based on aggregation inheritance but also develop semantic rewriting rules which are applied to equivalence preserving rewrite rules in algebraic expression of a query. Analyzing semantically the query model, the query model can be optimized to logically object-oriented query processing. And algebra expresstions of a query can be optimized by applying equivalence preserving rewrite rules.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.25-31
• /
• 2014

Korean grammar checkers typically detect context-dependent errors by employing heuristic rules; these rules are formulated by language experts and consisted of lexical items. Such grammar checkers, unfortunately, show low recall which is detection ratio of errors in the document. In order to resolve this shortcoming, a new error-decision rule-generalization method that utilizes the existing KorLex thesaurus, the Korean version of Princeton WordNet, is proposed. The method extracts noun classes from KorLex and generalizes error-decision rules from them using the Tree Cut Model and information-theory-based MDL (minimum description length).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.488-494
• /
• 2013

For the activeness and autonomy of a sensor network, the efficient migration method of a mobile agent and the consistent naming services are the required components of a sensor network. Accordingly, this paper presented the implementation of backward migration of an active rule mobile agent applying the naming method based on RMI that used the meta_table including the informations about the components of a sensor network. This study implemented based on the extension of the forward migration[12], and the results of the various experiments present the efficacy of mobile agent middleware system and the possibility of constructing efficient sensor network application environment. And, the results of this study are able to enhance the adaptability on dynamic changes of environment in sensor network application development.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.1
• /
• pp.57-62
• /
• 2010

This paper proposes two methods for the construction of job offer and job hunting information in order to supply an environment that can easily connects to job hunting information. First, the database expansion, category rules and ERD(Entity Relation Diagram) are designed for the construction of job hunting site with real example. Second, the prime number labeling rules are designed for the strong intimacy of label rules. Therefore, according to using the systematic and regular rules when we design and construct a database, the consistency and efficiency are improved in the database being constructed and being operated. And the convenience of application program development and operation are easily provided. In addition, the proposed code-expansion rule can be defined and be standardized in the domestic and foreign job offer and job hunting information provision agency.