• 경영과학
• /
• 제32권4호
• /
• pp.81-96
• /
• 2015

This paper models knowledge diffusion on an inter-organizational network. Based on literatures related to knowledge diffusion, the model considers critical factors that affect diffusion behavior including nodal property, relational property, and environmental property. We examine the relationships among network structure, knowledge search, and diffusion performance. Through a massive simulation runs based on the agent-based model, we find that the average path length of a network decreases a firm's cumulative knowledge stock, whereas the clustering coefficient of a firm has no significant relationship with the firm's knowledge. We also find that there is an interaction effect of network structure and the range of knowledge search on knowledge diffusion. Specifically, in a network of a larger average path length (APL) the marginal effect of search conduct is significantly greater than in that of a smaller APL.

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

본 논문에서는 상용 검색 엔진인 BRS/Search 시스템을 이용하여 XML문서에 대한 구조 기반 검색이 가능하도록 XML문서 검색시스템을 설계하고 구현한다. 본 논문에서 구현한 시스템은 XML문서의 논리적인 구조를 Unix 파일시스템의 디렉토리 구조로 표현한다. 이렇게 표현된 XML 문서를 BRS/Search 시스템의 데이터베이스에 정보의 손실 없이 저장하기 위해 데이터베이스 스키마를 정의하고 내용 검색뿐만 아니라, 구조 검색, 혼합 검색, 애트리뷰트 검색이 가능하도록 BRS/search 시스템에 부가적으로 필요한 ETID 추출기, 구조정보 추출기, 저장 관리기, 질의 처리기를 설계하고 구현한다.

• Asia pacific journal of information systems
• /
• 제1권1호
• /
• pp.87-101
• /
• 1991

The primary purpose of this study was to investigate a robust search methodology that could be used in full-text information retrieval systems. A robust search methodology is one that can be easily used by a variety of users (particularly naive users) and it will give them comparable search performance regardless of their different expertise or interests In order to develop a possibly robust search methodology, a fully functional prototype of a fuzzy knowledge based information retrieval system was developed. Also, an experiment that used this prototype information retreival system was designed to investigate the performance of that search methodology over a small exploratory sample of user queries To probe the relatonships between the possibly robust search performance and the query organization using fuzzy inference logic, the search performance of a shallow query structure was analyzes. Consequently the following several noteworthy findings were obtained: 1) the hierachical(tree type) query structure might be a better query organization than the linear type query structure 2) comparing with the complex tree query structure, the simple tree query structure that has at most three levels of query might provide better search performance 3) the fuzzy search methodology that employs a proper levels of cut-off value might provide more efficient search performance than the boolean search methodology. Even though findings could not be statistically verified because the experiments were done using a single replication, it is worth noting however, that the research findings provided valuable information for developing a possibly robust search methodology in full-text information retrieval.

• 정보관리학회지
• /
• 제33권3호
• /
• pp.155-176
• /
• 2016

본 연구는 한국학 연구 논문 텍스트의 의미 구조를 기반으로 하는 메타데이터를 적용한 학술정보시스템을 구축하여 기존 유사 시스템과의 비교를 통해, 텍스트 구조 기반 메타데이터의 활용 가능성을 확인해 보고자 하는 것을 목적으로 한다. 이를 위해 한국학술지인용색인(Korea Citation Index, KCI)에서 일정 기준을 충족하는 한국학 분야 연구 논문 데이터를 대상으로 의미 구조 메타데이터 항목을 적용한 시범적 검색 시스템(Korean Studies Metadata Database, KMD)을 구축하였으며, 동일한 검색 키워드를 적용하여 기존의 KCI 시스템과 비교했을 때 어떤 특징과 차이점을 갖는지 비교해 보았다. 연구 결과, KMD 시스템이 KCI에 비해 이용자의 검색 의도에 맞는 결과를 보다 효율적으로 보여주는 것으로 확인되었다. 즉 검색하고자 하는 키워드의 조합이나 조건식이 기존 시스템과 동일하더라도 검색 결과를 통해 최종적으로 연구 진행과 관련해 찾고자 하는 연구 목적, 연구의 대상 데이터나 시공간적 배경 등에 따른 검색 결과를 다양하게 보여줄 수 있는 것으로 나타났다.

• Nuclear Engineering and Technology
• /
• 제52권3호
• /
• pp.544-551
• /
• 2020

Reactor control is a standout amongst the most vital issues in the nuclear power plant. In this paper, the optimal design of variable structure controller (VSC) based on the lightning search algorithm (LSA) is proposed for a nuclear reactor power system. The LSA is a new optimization algorithm. It is used to find the optimal parameters of the VSC instead of the trial and error method or experts of the designer. The proposed algorithm is used for the tuning of the feedback gains and the sliding equation gains of the VSC to prove a good performance. Furthermore, the parameters of the VSC are tuned by the genetic algorithm (GA). Simulation tests are carried out to verify the performance and robustness of the proposed LSA-based VSC compared with GA-based VSC. The results prove the high performance and the superiority of VSC based on LSA compared with VSC based on GA.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제8권5호
• /
• pp.501-509
• /
• 2002

플랫폼에 관계없이 한번 작성된 문서의 정보를 이기종 시스템간 공유하고 다양한 문서 형식을 지원하기 위해 SGML(1508879)이 사용되고 있다. SGML 문서는 내용뿐만 아니라 구조정보를 가지고 있다. SGML 문서가 널리 보급됨에 따라서 구조적 정보를 이용한 데이타베이스의 구축 및 검색 시스템에 대한 필요성이 고조되고 있다. 그러나, 기존의 색인어를 이용한 전문 검색 엔진으로는 문서의 구조정보를 활용할 수 없다. 본 논문에서는 DSSSL 및 HyTime의 문서 모델인 Grove를 변형한 데이타 모델을 이용하여 문서 형식에 독립적이면서, 문서 형식과 내용을 분리하여 저장하는 SGML 문서 저장 시스템을 개발하였다. 구조정보를 손실없이 저장할 수 있도록 객체 지향형 데이타베이스 시스템인 오브젝트 스토어(Object Store)를 이용하였다. 또한 엘리먼트에 대해 관계형 DBMS와 유사한 인덱스 구조를 생성하여 검색 성능을 향상시켰고, 내용기반 검색과 구조기반 검색을 효율적으로 결합한 사용자 인터페이스를 구축하였다.

• 한국문헌정보학회지
• /
• 제48권4호
• /
• pp.5-23
• /
• 2014

This study reports the first step in the Classification-based Search and Knowledge Discovery (CSKD) project, which aims to combine information organization and retrieval approaches for building digital library applications. In this study, we explored the generation and application of a faceted vocabulary as a potential mechanism to enhance knowledge discovery. The faceted vocabulary construction process revealed some heuristics that can be refined in follow-up studies to further automate the creation of faceted classification structure, while our concept search application demonstrated the utility and potential of integrating classification-based approach with retrieval-based approach. Integration of text- and classification-based methods as outlined in this paper combines the strengths of two vastly different approaches to information discovery by constructing and utilizing a flexible information organization scheme from an existing classification structure.

• 통합자연과학논문집
• /
• 제3권3호
• /
• pp.143-147
• /
• 2010

Since it is of great importance to know how a ligand binds to a receptor, there have been a lot of efforts to improve the quality of prediction of docking poses. Earlier efforts were focused on improving search algorithm and scoring function in a docking program resulting in a partial improvement with a lot of variations. Although these are basically very important and essential, more tangible improvements came from the reduction of search space. In a normal docking study, the approximate active site is assumed to be known. After defining active site, scoring functions and search algorithms are used to locate the expected binding pose within this search space. A good search algorithm will sample wisely toward the correct binding pose. By careful study of receptor structure, it was possible to prioritize sub-space in the active site using "receptor-based pharmacophores" or "hot spots". In a sense, these techniques reduce the search space from the beginning. Further improvements were made when the bound ligand structure is available, i.e., the searching could be directed by molecular similarity using ligand information. This could be very helpful to increase the accuracy of binding pose. In addition, if the biological activity data is available, docking program could be improved to the level of being useful in affinity prediction for a series of congeneric ligands. Since the number of co-crystal structures is increasing in protein databank, "Ligand-Guided Docking" to reduce the search space would be more important to improve the accuracy of docking pose prediction and the efficiency of virtual screening. Further improvements in this area would be useful to produce more reliable docking programs.

• 한국정보통신학회논문지
• /
• 제8권8호
• /
• pp.1769-1776
• /
• 2004

효율적인 키워드 추출은 정보검색 시스템에서 중요하지만 많은 키워드 중 적당한 키워드를 결정하기 위한 방법들은 여러 가지가 있다. 그중 단일 키워드만을 검색하는 AC알고리즘을 해결하기 위한 DER구조는 복합키워드 검색이 가능하나 많은 검색시간이 걸린다는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 DER구조의 검색방법을 기반으로 한 독립적인 검색테이블을 확장하여 EDER 구조라는 알고리즘을 구축하였다. 500개의 텍스트 파일을 실험한 결과 키워드의 포스팅 결과가 AC의 DER구조보다 EDER구조가 작았으며, 검색시간 또한 K5에서 DER구조가 0.6초, EDER구조가 0.2초로 더 빠른 검색을 보며주고 있어 제안 방법이 효과적임을 알 수 있었다.

• 대한건축학회논문집:구조계
• /
• 제33권12호
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.