• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.327-336
• /
• 2003

Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1999.08a
• /
• pp.173-176
• /
• 1999

인터넷 환경에서는 정보자원을 식별하기 위한 기호로서 URL을 사용하고 있다. 그러나 URL은 자원이 위치한 장소를 지시하기 때문에 자원의 위치가 변경될 경우에는 접근하지 못한다는 단점이 있다. 본 논문에서는 이러한 URL의 단점을 보완하기 위한 대안으로서 URN을 이용하여 국내 학위논문을 고유하게 식별하고 검색하기 위한 방안에 대해 연구하였다.

• 한국문헌정보학회 학술발표논집
• /
• 2004.04a
• /
• pp.61-89
• /
• 2004

지식정보자원의 급속한 증가에 따른 정보문제를 보다 효율적으로 해결하기 위해 다양한 기능을 갖춘 검색엔진들이 개발되고 있다. 메타검색은 다른 웹 검색서비스보다 더 포괄적인 검색을 수행할 뿐만 아니라 더욱 안정된 검색 기술로써, 다양한 검색 정보원들에 대한 검색결과를 시스템이 통합하여 제공하기 때문에 검색에 소요되는 시간과 노력이 덜 든다는 점에서 효율적이고 사용하기 용이한 장점이 있다(Selberg 1999). 그러나 이러한 메타검색의 장점에도 불구하고 기존의 연구에서는 많은 이용자들이 각 데이터베이스를 통합하여 검색하는 것보다 개별적으로 검색하고 그 결과를 스스로 통합하는 분리 인터페이스를 더 선호하고 검색결과에 더 만족하였으며, 검색 효율성도 더 높은 것으로 나타나고 있다.(박소연 1999). (중략)

• The Korean Journal of Archival Studies
• /
• no.19
• /
• pp.57-102
• /
• 2009

Recently, distribution of record via web and coefficient of utilization are increase. so, Archival information service using website becomes essential part of record center. The main point of archival information service by website is making record information retrieval easy. It has need of matching user's request and representation of record resources correctly to making archival information retrieval easy. Archivist and record manager have used various information representation tools from taxonomy to recent thesaurus, still, the accuracy of information retrieval has not solved. This study constructed record retrieval system based on Topic Map by modeling record resources which focusing on description metadata of the records to improve this problem. The target user of the system is general web users and its range is limited to the president related sources in the National Archives Portal Service. The procedure is as follows; 1) Design an ontology model for archival information service based on topic map which focusing on description metadata of the records. 2) Buildpractical record retrieval system with topic map that received information source list, which extracted from the National Archives Portal Service, by editor. 3) Check and assess features of record retrieval system based on topic map through user interface. Through the practice, relevance navigation to other record sources by semantic inference of description metadata is confirmed. And also, records could be built up as knowledge with result of scattered archival sources.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2005.08a
• /
• pp.279-284
• /
• 2005

본 연구는 분산자원 활용을 위한 Z39.50 프로토콜, ZING SRW/SRU 프로토콜, OAI 프로토콜, ZING Update 프로토콜의 개발 배경, 특징을 살펴보고, 검색과 갱신 각 기능별로 프로토콜을 비교·분석하였다. 본 연구는 분산자원을 활용하려는 도서관 및 정보서비스기관에 기초 정보를 제공하고, 각 기관에서 분산자원을 이용하여 구축하고자 하는 서비스의 대상, 종류, 환경에 적합한 프로토콜을 선택할 수 있도록 하기 위함이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1039-1042
• /
• 2003

최근 인터넷의 급속한 성장과 초고속 통신망의 구축으로 인하여 다양한 멀티미디언 서비스들이 제공되고 있다. 그러나 현재 대부분의 멀티미디어 서비스들은 클라이언트/서버 모델을 기반으로 구축되어 있기 때문에, 중앙 서버로의 과도한 부하가 집중되는 문제점을 가지고 있다. 본 논문에서는 수수 P2P 환경으로 구축된 멀티미디어 서비스 환경에서의 자원 검색 기법을 제안한다. 제안 기법은 고정 에이전트를 기반으로 자원 검색을 수행하여 기존의 순수 P2P 환경에서의 검색 기법으로 인한 문제점을 해결한다. 또한, 시나리오를 통하여 본 논문에서 제안하는 알고리즘의 구체적인 동작과정을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.1288-1289
• /
• 2012

분산 시스템과 관련하여 P2P 기술은 분산 환경에서 자원을 보유한 개인은 효율적으로 다른 사용자들과 자원을 공유하는 측면에서 활용도 높은 분야이다. 그러나 P2P 시스템은 자원 검색, 전송, 재전송 작업이 이뤄질 때마다 네트워크 트래픽이 과다하게 발생되는 단점을 갖고 있다. 이러한 문제를 해결하여 P2P 시스템의 성능 향상을 목표로 하는 연구가 많은 부분 진행되고 있다. 이러한 성능 향상의 다양한 방향성 가운데 사용자 입장에서의 사용성 개선 측면이 최근 중요한 부분으로 대두되고 있는데 본 연구에서는 사용성을 개선하기 위한 P2P 그룹 관리 검색 알고리즘을 제안한다.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.19-33
• /
• 2013

In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.160-162
• /
• 2002

서열 시퀀싱을 통해 등장하는 원시 데이터들을 대상으로 유사한 서열과 기능 예측에 사용되는 모티프 데이터베이스들은 원시 데이터 생성 속도가 빠르게 증가함에 따라 그 중요성 또한 나날이 증가하고 있다. 그러나, 이러한 모티프 데이터베이스들은 서로 독자적으로 개발되고 발전되어 왔기 때문에 각각 서로 다른 형식의 데이터를 사용하고 있어 이에 대한 검색결과도 데이터베이스마다 서로 이질적인 형태로 제공하고 있다. 그러므로 사용자는 각 데이터베이스에서 사용하는 데이터 구조들에 대한 전반적 지식을 습득해야 할 뿐만 아니라 중복된 반복 검색 작업을 하여야 한다. 따라서, 이 논문에서는 이러한 문제 해결을 위해 독립적인 모티프 데이터베이스들의 자원을 분해하고, 합병하는 과정을 거쳐 하나의 통합된 모티프 데이터베이스를 구축하였다. 또한 데이터베이스의 각 엔트리당 단백질의 3차 구조 정보, 분류 정보, 샘플 정보의 지원을 가능케 하여 기존 검색 조건을 개선하였다. 이 데이터베이스 구축으로서 사용자는 모티프 데이터베이스 검색에 대한 streamline적인 검색이 가능할 뿐만 아니라 기존의 통합된 데이터베이스에서 지원되지 못한 구조 정보, 분류 정보 검색을 가능케 하였다.