• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.495-497
• /
• 2018

복합명사는 둘 이상의 명사가 결합된 명사로, 한국어는 무한한 복합명사 생성이 가능하며 기계번역, 정보검색 등 다양한 분야에서 시스템의 정확도를 향상시키는데 중요한 역할을 한다. 본 논문은 리소스 확장을 이용한 사전 기반 복합명사 분해기[1]의 후속연구로 한국어 복합명사 분해기를 총 2단계에 걸쳐 분해하는 시스템을 제안한다. 먼저 대용량 복합명사 입출력쌍 사전을 구축한 후 1단계 분해를 진행하며, 1단계에서 분해가 실패한 경우 2단계에서 자체 구축한 Unigram사전을 기반으로 복합명사 분해를 진행한다. 실험결과 97.4%의 정확률이 나왔으며 기존의 리소스확장을 이용한 방법론보다 5.6%의 성능향상을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.1165-1168
• /
• 2001

최단경로문제(Shortest Path Problem)는 네트???p에서 하나 혹은 그 이상의 노드들의 쌍 사이에서 가장 짧은 경로, 가장 저렴한 경로 또는 가장 신뢰할 만한 경로를 찾을 때 고려된다. 컴퓨터나 통신망들은 edge-weighted 그래프로 대치될 수 있으며 그렇게 함으로써 최단 경로를 찾아줄 수 있다. 통신 링크는 실제 실패할 수도 있고, 또한 전송될 데이터의 양에 따라 전달되는 시간이 달라지기도 하므로, 가장 신뢰할만한 경로 중에서 가장 빠른 경로(The Quickest Most Reliable Path) 문제와 가장 빠른 경로 중에서 가장 신뢰할만한 경로(The Most Reliable Quickest Path) 문제는 최단경로문제보다 더 현실적이다[1]. 이 논문에서는 그 중 '가장 신뢰할만한 경로 중에서 가장 빠른 경로' 문제를 자바를 사용하여 시각화함으로써 가변 상황에 따라 다른 경로를 찾아주는 과정을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.151-153
• /
• 2003

UDDI는 웹 서비스를 위한 웹 기반 분산 레지스트리의 표준이며, 또한 비즈니스들이 제공하는 웹 서비스에 대한 정보를 등록하고 다른 비즈니스들이 이를 검색하고 이용할 수 있도록 구현한 시스템이다. OASIS(Organization for the Advancement of Structured Information Standards)는 UDDI 서비스에 참여하는 개별 노드들의 레지스트리 변경을 모든 노드에서 인지하고. 노드간의 레지스트리 상태를 일관성 있게 유지시킬 목적으로 UDDI 복제 명세를 제안하였다. 본 논문에서는 OA51S UDDI 복제 명세를 만족하는 그룹통신 기반의 UDDI 레지스트리 설계에 관하여 기술한다. 제안된 시스템은 신뢰성 있는 그룹통신 시스템을 이용하여 일시적인 네트워크 단절이나 프로세스의 실패가 일어나는 상황에서도 UDDI 서비스에 참여하는 개별 노드들의 레지스트리 상태를 일관성 있게 유지할 수 있다.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.209-225
• /
• 2015

Research and development projects in railroad domain are different from those in other domains in terms of their close relationship with laws. Some cases are reported that new technologies from R&D projects could not be industrialized because of relevant laws restricting them. This problem comes from the fact that researchers don't know exactly what laws can affect the result of R&D projects. To deal with this problem, we suggest a model for law retrieval system that can be used by researchers of railroad R&D projects to find related legislation. Input of this system is a research plan describing the main contents of projects. After laws related to the R&D project is provided with their rankings, which are assigned by scores we developed. A ranking of a law means its order of priority to be checked. By using this system, researchers can search the laws that may affect R&D projects throughout all the stages of project cycle. So, using our system model, researchers can get a list of laws to be considered before the project they participate ends. As a result, they can adjust their project direction by checking the law list, avoiding their elaborate projects being useless.

• The Journal of the Korea Contents Association
• /
• v.14 no.7
• /
• pp.125-136
• /
• 2014

The purpose of this study is to derive a implications for and analysis a CrowdFunding cases in order to activate domestic Community Art. First, in the area of culture and art of CrowdFunding platform, search for Community Art' projects were selected examples of success and failure. As a result, differences in sample were compared in five items of Confidence & Information & Communication & Content & Benefit aspect etc,. Additional total analysis result, Genre and Period, clear differences in terms of compensation and Promotion occurred, as well as the need to develop new goods and services compensation was raised. Based on these implications, this study is to be a practical implication to Community Art of difficult to create its own fundraising. On the other hand, we suspect the environment of the domestic previous research related to the evaluation of Community Art is insufficient, and so must be concurrent also study the framework of analysis and systematic evaluation to complement these parts in the future.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.83-91
• /
• 2005

We analyze the performance of an adaptive hybrid search code acquisition algorithm for direct-sequence code division multiple access (DS-CDMA) systems under slowly-moving mobile environments. The code acquisition algorithm is designed to provide the desired feature of constant false alarm rate (CFAR) to cope with nonstationarity of the interference in CDMA forward links. An analytical expression for the mean acquisition time is first derived and the probabilities of detection, miss, and false alarm are then obtained for frequency-selective Rayleigh fading environments. The fading envelope of a received signal is assumed to be constant over the duration of post-detection integration (PDI), considering slow fading environments. Finally, the performance of the designed code acquisition algorithm shall be evaluated numerically to examine the effect of some design parameters such as the sub-window size, size of the PDI, decision threshold, and so on, considering cdma2000 environments.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.80-89
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method that compensates disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do fast data search and maintain search efficiency independent of the number of peers. The peers in a DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in a DHT method should send messages more frequently to keep the routing table updated and reduce the failure of requests. However this results in increasing the overall network traffic. In this paper, we propose a method to reduce the update load of a routing table in the existing DHT by updating it in a reactive way. In the proposed reactive method, a routing table is updated only if a data request is coming whereas it is updated periodically in the existing proactive method. We perform experiments using Chord simulator(I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.84-95
• /
• 2000

In this paper, we propose an integrated indexing method with compound noun segmentation and noun phrase synthesis. Statistical information is used in the compound noun segmentation and natural language processing techniques are carefully utilized in the noun phrase synthesis. Firstly, we choose index terms from simple words through morphological analysis and part-of-speech tagging results. Secondly, noun phrases are automatically synthesized from the syntactic analysis results. If syntactic analysis fails, only morphological analysis and tagging results are applied. Thirdly, we select compound nouns from the tagging results and then segment and re-synthesize them using statistical information. In this way, segmented and synthesized terms are used together as index terms to supplement the single terms. We demonstrate the effectiveness of the proposed integrated indexing method for Korean compound noun processing using KTSET2.0 and KRIST SET which are a standard test collection for Korean information retrieval.

• Journal of the Korean Society for Library and Information Science
• /
• v.46 no.3
• /
• pp.233-250
• /
• 2012

The purpose of this study is to assess the development, current states, and problems of MEDLIS document delivery service. With the analysis of MEDLIS transaction data from 2001 to 2011, we identified continuous usage decrease, unbalanced contribution by type of institution, high dependence on back issues, use differences among subfields of medicine, relatively low success rate, and various reasons for failure. Based on the results, recommendations for the maintenance of union catalog database, technical support for search capability enhancements, establishment of back issue archiving policy, user training and publicity, and membership expansion are suggested to promote the service.