• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.378-382
• /
• 2001

The purpose of this study was to develop an expert system supporting the diagnosis of diffuse interstitial lung disease by high resolution computed tomography. CLIPS(C language integrated production system) with rule-based reasoning was used to develop the system. Development of expert system had three stages knowledge acquisition, knowledge representation, and reasoning. Knowledge was obtained and integrated, from tables and figure legends of a representative textbook in the domain of this expert system, High-Resolution CT of the Lung, by Webb WR, Mueller NL, and Naidich DP. The acquired knowledge was analyzed to form a knowledge base. Overlapping knowledge was eliminated, similar pieces of knowledge were combined and professional terms were defined. The most important knowledge of findings was then selected for each disease. After groupings of combined findings were made, disease groups were analyzed sequentially to determine final diagnoses. The system was based upon the input of 69 diseases, 185 findings, 73 conditions, 387 status, and 62 rules. The system was set up to determine the diagnoses of diseases from the combination of findings using forward reasoning. In an empirical trial, the system was applied to support the diagnosis of 40 cases of diffuse interstitial lung diseases. The performance of two doctors with support of the system was compared to that of another two doctors without support of the system. The two doctors with the support of the system made more accurate diagnoses than the doctors without the support of the system. The system is believed to be useful for the diagnosis of rare diseases and for cases with many possible differential diagnoses. In conclusion, an expert system supporting the high resolution computed tomographic diagnosis of diffuse interstitial lung disease was developed and the system is thought to be useful for medical practice.

• 정보과학회 논문지
• /
• 제41권11호
• /
• pp.992-1005
• /
• 2014

상호참조해결은 문서 내에서 선행하는 명사구와 현재 등장한 명사구 간에 같은 개체를 의미하는 지를 결정하는 문제로 정보 추출, 문서분류 및 요약, 질의응답 등에 적용된다. 본 논문은 상호참조해결의 규칙기반 방법 중 가장 성능이 좋은 Stanford의 다 단계 시브(Multi-pass Sieve) 시스템을 한국어에 적용한다. 본 논문에서는 모든 명사구를 멘션(mention)으로 다루고 있으며, Stanford의 다 단계 시브 시스템과는 달리 멘션 추출을 위해 의존 구문 트리를 이용하고, 동적으로 한국어 약어 리스트를 구축한다. 또한 한국어 대명사를 참조하는데 있어 중심화 이론 중 중심의 전이적인 특성을 적용하여 가중치를 부여하는 방법을 제안한다. 실험 결과 F1 값은 MUC 59.0%, B3 59.5%, Ceafe 63.5%, CoNLL(평균) 60.7%의 성능을 보였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1999년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.304-309
• /
• 1999

In this paper, we presents a new disparity map refinement algorithm using statistical characteristics of disparity map and edge information. The proposed algorithm generate a refined disparity map using disparity maps which are obtained from area and feature-based Stereo Matching by selecting a disparity value of edge point based on the statistics of both disparity maps. Experimental results on aerial stereo image show the better results than conventional fusion algorithms in the disparity error. This algorithm can be applied to the reconstruction of building image from the high resolution remote sensing data.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제13권6호
• /
• pp.427-431
• /
• 2007

본 논문에서는 어절별 중의성 해소 규칙과 trigram 통계 정보를 이용하는 혼합형 한국어 품사 태깅 시스템에 대하여 기술한다. 어절별 중의성 해소 규칙은 중의성을 가지는 어절들 각각에 대해 정의된 중의성 해소 규칙으로, 현재 중의성을 가지는 어절의 50%에 대해 작성되어 있다. 본 논문의 태깅 시스템은 먼저 보조용언, 숙어, 관용적 표현 등에 해당하는 공통규칙을 적용하고, 그 후에 어절별 중의성 해소 규칙을 적용한다. 마지막으로 중의성이 해소되지 않은 어절은 각 어절을 중심으로 하는 trigram 통계 정보를 이용하여 중의성을 해소한다. 실험 결과는 본 논문에서 제안하는 어절별 중의성 해소 규칙과 trigram 통계 정보를 혼합하여 중의성을 해소 시키는 방법이 높은 정확률과 넓은 처리 범위를 가지고 있다는 것을 보여준다.

• Asia pacific journal of information systems
• /
• 제11권3호
• /
• pp.149-164
• /
• 2001

In this paper, an adaptive workflow management system, called K-WFMS, is proposed. The K-WFMS integrates database system and knowledge-based system to automate business processes that are executed with complex and various business rules such as task scheduling, role resolution, and exception handling rules. The K-WFMS is adaptable in the sense that it allows its users to change workflow schema in the course of workflow execution as well as it provides rule-based modeling constructs to handle predictable exceptions during workflow modeling. The overall architecture and implementation of K-WFMS are explained, and the change propagation mechanism to maintain validity of workflow model is suggested.

• 한국중재학회지:중재연구
• /
• 제20권2호
• /
• pp.131-149
• /
• 2010

Since the Arbitration Law of China took effect in 1995, arbitration has grown with the economy. At the end of 2009, there were 202 arbitration institutions in China. Among them, China International Economic and Trade Arbitration Commission(CIETAC) has adopted online arbitration and has settled internet domain name disputes since 2001. CIETAC Domain Name Dispute Resolution Center(DNDRC) has accumulated abundant experiences of online arbitration in the field of domain name disputes. Based on those experiences, on 1 May 2009, CIETAC implemented the CIETAC Online Arbitration Rules(Rules') to regulate the resolution of e-business disputes as well as other business disputes. With this background, this article aims to study the status quo, practices and issues of online arbitration conducted by CIETAC. For the purpose of the article, a general picture of online arbitration is outlined first, followed by introducing the steps of the online arbitration procedure. According to the 'Rules', the entire arbitration process is conducted using online communication methods which are cost-effective and efficient. To facilitate the development of online arbitration, legal barriers need to be removed. This article considers main legal issues of online arbitration in China and proposes amendment to Chinese Arbitration Law, in particular, the recognition of the validity of electronic arbitration agreements and awards.

• 인터넷정보학회논문지
• /
• 제2권5호
• /
• pp.49-58
• /
• 2001

Mobile positioning measurement is the most important technology for Location Based Services in the cellular networks. Generally, we are expecting to use GPS to guarantee high accuracy of the mobile position, A CDMA network-based technique for the Mobile Station position calculation needs to be implemented in the cdma2000 network whether the handsets have GPS or not, The most reliable methods of the network-based location technologies are based on the estimation of time of signal traveling between MS and B18 in a network whose coordinates are identified, Other signal parameters such as the power of the received signal and the signal arrival direction cannot be used as main data for a location system because adoption of only the signal parameters will not meet the FCC requirements, In practice, the estimates of the time of signal propagation between MS and BTS always have errors resulting from low-resolution power of measurements and multi path signal propagation, This paper describes the combined network-based location technology in the cdma2000 1× necessary to meet US FCC requirements. The issues of a calibration table and statistic processing based on the pilot strength as well as combined network-based location technologies(TOA/ TDOA) will help to achieve higher location accuracy than specified in the US FCC Rule.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.184-192
• /
• 2001

In this paper we present a remeshing algorithm for irregular meshes with boundaries. The irregular meshes are approximated by regular meshes where the topological regularity is essential for the multiresolutional analysis of the given meshes. Normal meshes are utilized to reduce the necessary data size at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e., normal offset value which is based on the regular rule of a uniform subdivision, while other remeshing schemes use one 3D vector at each vertex. Since the normal offset cannot be properly used for the boundaries of meshes, we use a combined subdivision scheme which resolves a problem of the proposed normal offset method at the boundaries. Finally, we show an example to see the effectiveness of the proposed scheme to reduce the data size of a mesh model.

• 정보처리학회논문지B
• /
• 제11B권2호
• /
• pp.227-232
• /
• 2004

정보 검색 시스템에서 문서의 내용을 대표하는 용어를 추출하거나 정보 추출 및 텍스트 마이닝에서 특정 정보만을 추출하려면 고유명사에 대한 대용어 문제가 해결되어야 한다. 대용어 해소 문제는 인칭 명사에 대한 대명사의 선행사 결정 문제가 대표적이다. 본 논문에서는 한국어에서 문서의 내용을 보다 정확히 분석하기 위해 3인칭 대명사 “그/그녀/그들/그녀들”의 선행사를 결정하는 방법을 제안한다. 일반적으로 3인칭 대명사의 선행사는 현재 문장 또는 이전 문장의 주어인 경우가 많고, 또한 3인칭 대명사가 2회 이상 반복되는 경우가 자주 발생한다. 이러한 특성을 이용하여 현재 문장과 이전 문장에 출현한 인칭 명사들 중에서 선행사로 사용되는 경우를 조사하여 선행사 결정 규칙을 발견하였다. 이 경험 규칙은 3인칭 대명사의 격에 따라 조금씩 달라지기 때문에 대명사의 격에 따라 주격, 목적격, 소유격으로 구분하여 기술하였다. 제안한 방법의 타당성을 검증하기 위하여 신문 기사의 정치 관련 문서에서 대명사의 격에 따라 100개씩 총 300개의 실험 대상을 선정하였으며, 실험 결과로 3인칭 대명사의 선행사 결정 정확도는 재현율이 79.0%, 정확률이 86.8%로 나타났다.

• 대한의용생체공학회:의공학회지
• /
• 제31권6호
• /
• pp.456-463
• /
• 2010

In the present study, we proposed a new subspace scanning algorithm to enhance the spatial resolution of electroencephalography (EEG) and magnetoencephalography(MEG) source localization. Subspace scanning algorithms, represented by the multiple signal classification (MUSIC) algorithm and the first principal vector (FINE) algorithm, have been widely used to localize asynchronous multiple dipolar sources in human cerebral cortex. The conventional MUSIC algorithm used principal component analysis (PCA) to extract the noise vector subspace, thereby having difficulty in discriminating two or more closely-spaced cortical sources. The FINE algorithm addressed the problem by using only a part of the noise vector subspace, but there was no golden rule to determine the number of noise vectors. In the present work, we estimated a non-orthogonal signal vector set using independent component analysis (ICA) instead of using PCA and performed the source scanning process in the signal vector subspace, not in the noise vector subspace. Realistic 2D and 3D computer simulations, which compared the spatial resolutions of various algorithms under different noise levels, showed that the proposed ICA-MUSIC algorithm has the highest spatial resolution, suggesting that it can be a useful tool for practical EEG/MEG source localization.