• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 추계학술대회
• /
• pp.353-355
• /
• 2015

SNOMED CT 브라우저는 SNOMED CT 의학 용어 체계에 포함된 용어들을 검색하는 검색 브라우저이다. 이 용어들은 서로 다양한 관계를 통해 구조화되어 있는 특징이 있는데 기존의 브라우저들은 그 구조를 이용하지 않고 단지 문자열 매칭에 의한 결과 목록만을 제시하는 문제가 있다. 본 논문에서는 검색 결과를 서브그래프 형태로 표시함으로써 용어의 구조 검색을 가능하게 하는 브라우저 시스템을 제안하고 이를 구현하였다. 구현된 시스템은 문자열 기반 검색, 트리 기반 검색 결과 구조화, 컨셉 조회 히스토리 등의 기능을 포함하는 특징이 있다.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• Journal of Information Technology Applications and Management
• /
• 제13권4호
• /
• pp.121-140
• /
• 2006

UDDI (Universal Discovery Description and Integration) Registry is used for Web Services registration and search. UDDI offers the search result to the keyword-based query. UDDI supports WSDL registration but it does not supports WSDL search. So it is required that contents based search and ranking using name and description in UDDI registration information and WSDL. This paper proposes a retrieval engine considering contents of services registered in the UDDI and WSDL. It uses Vector Space Model for similarity comparison between contents of those. UDDI registry information hierarchy and WSDL hierarchy are considered during searching process. This engine suppports two discovery methods. One is Keyword-based search and the other is template-based search supporting ranking for user's query. Template-based search offers how service interfaces correspond to the query for WSDL documents. Proposed retrieval engine can offer search result more accurately than one which UDDI offers and it can retrieve WSDL which is registered in UDDI in detail.

• 산업경영시스템학회지
• /
• 제25권2호
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• Journal of Information Science Theory and Practice
• /
• 제10권4호
• /
• pp.3-22
• /
• 2022

This paper provides an overview of the emergence of resource discovery systems and services, along with their advantages, best practices, and current landscapes. It outlines some of the key services and functionalities of a comprehensive discovery model suitable for academic libraries in developing countries. The proposed model (VuFind as a discovery tool) performs like other existing web-scale resource discovery systems, both commercial and open-source, and is capable of providing information resources from different sources in a single-window search interface. The objective of the paper is to provide seamless access to globally distributed subscribed as well as open access resources through its discovery interface, based on a unified index. This model uses Koha, DSpace, and Greenstone as back-ends and VuFind as a discovery layer in the front-end and has also integrated many enhanced search features like Bento-box search, Geodetic search, and full-text search (using Apache Tika). The goal of this paper is to provide the academic community with a one-stop shop for better utilising and integrating heterogeneous bibliographic data sources with VuFind (https://vufind.org/vufind).

• 디지털융복합연구
• /
• 제17권1호
• /
• pp.209-217
• /
• 2019

본 논문에서는 시맨틱 검색 수행을 위해 검색 도메인에 알맞은 온톨로지를 이용, 구축하고 정보에 관한 검색, 변환, 통합, 공유가 가능한 검색 엔진을 구현하여 검색 시스템의 기반을 마련하는 것을 목적으로 하였다. 기존 방식에서 벗어나 온톨로지를 활용하여 계층 관계를 추론하고, 그 계층을 근거로 개체를 추론한 다음 속성을 추출하여 사용자가 원하는 자료와 관련있는 분야를 검색하는 것이다. 이러한 방식으로 정보를 검색할 수 있도록 정보검색 시스템을 '자격증'과 관련된 키워드를 입력하여 구현하였다. 구현된 시스템은 온톨로지에서 각 속성들의 의미와 관계를 정리하여 일반인 정보검색을 사용자가 빠르고 쉽게, 정확한 검색을 할 수 있도록 하였다. 또한, 구현 결과를 2개의 다른 검색엔진과 비교하였다. 비교한 검색엔진은 대표적인 검색엔진인 '네이버'와 '다음'이다. 시맨틱 웹을 이용한 검색을 수행하기 위해 검색 도메인에 맞는 온톨로지를 이용하여 구축한 본 연구의 검색 엔진은 상당히 우수한 결과를 보여주는 것으로 평가되었다. 그러나 검색 엔진의 정확성과 신뢰성을 높이고 좀 더 포괄적인 범주의 검색어 포함하기 위해서는 더욱 정형화된 온톨로지가 필요하다고 사료된다.

• Journal of the Korean Statistical Society
• /
• 제17권2호
• /
• pp.134-145
• /
• 1988

The basic conditions for a parallel-flats fraction to be a search design of Resolution III.2 have been developed in Um (1980, 1981, 1983, 1984). In this paper, a series of resolution III.2 search designs for $3^n, n=4, 5, 6$, are presented.

• 산업경영시스템학회지
• /
• 제18권35호
• /
• pp.107-114
• /
• 1995

This paper proposes the Tabu Search algorithm to minimize mean tardiness in the parallel machine scheduling problem. The algorithm reduces the computation time by employing restricted neighborhood and produces an efficient solution in this problem.

• 한국컴퓨터정보학회논문지
• /
• 제11권1호
• /
• pp.129-138
• /
• 2006

지금까지 maximal covering문제를 해결하기 위해 다양한 기법들이 적용되어 왔다. 타부 탐색 역시 그 중의 하나이다. 그러나 기존 연구에서는 타부 탐색을 비롯한 언덕오르기 탐색이나 시뮬레이티드 어닐링과 같은 이웃해 탐색 기법들에 대한 종합적인 분석과 성능 향상을 위한 노력이 부족하였다. 본 논문에서는 다양한 실험과 분석을 통해 이웃해 탐색 기법들의 성능을 향상시키기 위한 방안을 소개한다. 기본적으로 모든 이웃해 탐색 기법들은 k-exchange 이웃해 생성 방법을 사용하고 있으며 다양한 파라미터 설정에 따라 각 기법의 성능이 어떻게 달라지는가를 분석하였다. 실험 결과 단순 언덕오르기 탐색과 시뮬레이티드 어닐링이 다른 기법들에 비해 훨씬 우수한 탐색 성능을 보였으며, 일반적인 경우와는 달리 단순 언덕오르기 탐색이 시뮬레이티드 어닐링과 비슷한 성능을 보임을 확인하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.