• Journal of Korean Library and Information Science Society
• /
• v.45 no.3
• /
• pp.415-440
• /
• 2014

This study intends to make a comprehensive inquiry into the meaning and limitations of Discovery, and to explore how to make full use of Discovery in library cataloging. To this end, first discussed is the meaning of Discovery, which has a variety definitions. For the quality evaluation, 5 criteria were developed on the basis of literature review. Then this study conducted the quality evaluation on the basis of previously developed 5 criteria and usefulness of Discovery in library catalogs is thoroughly discussed. Based on these, the final discussion includes strategies for Korean LIS scholars and library practitioners to consider when applying Discovery as an integrated search tool.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.363-366
• /
• 2014

OMG 그룹에서 제안하고 있는 DDS(Data Distribution Service) 미들웨어에서 디스커버리 프로토콜은 미들웨어 간의 상호 운용성 지원을 위한 기본 요소이다. DDS 미들웨어가 적용되는 대부분의 환경에서는 다수의 노드에서 생성된 참여자를 찾기 위해 한꺼번에 많은 수의 디스커버리 정보가 교환되기 때문에 노드 및 네트워크의 성능에 많은 영향을 미친다. 본 논문에서는 DDS 미들웨어 개발 후에 시험이 되어야 하는 디스커버리 기능의 검증과 성능 측정을 위한 응용을 설계하고 이를 구현하였다. 디스커버리 시험 응용은 디스커버리 시험 전체를 관리하는 제어 응용, DDS 미들웨어를 통하여 DDS 개체를 생성하고 이들간의 정보교환을 담당하는 DDS 응용, 그리고 DDS 응용을 통제하고 실행 결과를 수집하여 제어 응용으로 전송하는 데몬 서버로 구성된다. 구현된 디스커버리 시험 응용은 디스커버리 기능 검증 및 성능 정보의 수집을 프로세서 간의 통신을 통하여 효과적으로 수행한다. 또한, DDS 응용의 동작 권한을 제어 응용이 위치한 노드에 집중시킴으로써 많은 수의 노드에서 시험이 필요한 환경에 적합하도록 설계되었다.

• Journal of the Korean Society for Library and Information Science
• /
• v.50 no.1
• /
• pp.493-511
• /
• 2016

Discovery is an emerging concept to enhance the search capabilities of library resources with the Next Generation Library Catalog. This paper defined the Discovery feature based on the information search behavior, and then derived the elements that make up its function. After that, the 11 regional representatives libraries' OPACs and 3 Internet bookstores are evaluated and compared against Search & Discovery capabilities. As a result, the Internet bookstores were superior to the libraries' OPACs for all the elements that make up the Discovery functions. This study verified that the public libraries OPACs are still concentrating on known item search, and it is hard for the users to meet a serendipity which is gained through the Discovery functions.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.25-35
• /
• 2020

In the Korean litigation system, structural maldistribution of evidence still remains a conundrum. Numerous solutions have been discussed so far and, today, few people deny the need for adopting a system similar to the discovery procedure in the United States. In the intellectual property (IP) domain, a wide range of legislative attempts have been made to improve the litigation system, especially for patent litigation. However, the adoption of discovery in copyright litigation is seldom discussed, despite the fact that copyright infringement lawsuits increasingly involve highly technical issues, especially in case of copyrightable computer programs. The lack of discussion on discovery adoption forms a stark contrast with the active attempts to adapt and adopt discovery procedure for patent litigation. In copyright infringement lawsuits, especially for copyrighted computer programs, securing evidence takes on crucial importance. However, in reality, there are numerous obstacles. Some lawsuits proceed even without properly securing the infringed work. To address this issue, the current litigation system needs to be improved by adopting a procedure similar to discovery. This paper reviews what solutions are being utilized today, and how we should approach the issue.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.728-731
• /
• 2012

최근 분산 임베디드 시스템에서 실시간 데이터 교환에 대한 요구가 증가하면서 발간/구독(Publish/Subscribe) 기반의 데이터 중심 통신 미들웨어인 DDS(Data Distribution Service)에 대한 활용 분야가 증가하고 있다. 국방 분야의 시스템과 같은 고신뢰성을 요구하는 환경에서는 시스템 개발에 앞서, DDS 통신에 동적으로 참여하게 하는 디스커버리 과정의 안정적인 성능 검증을 요구한다. 성능 검증 및 신뢰성 있는 시스템 개발을 위해 실제 시스템과 유사한 환경에서 DDS의 디스커버리 사전시험(Prototype)을 수행하는 데, 이 때 많은 시간과 비용을 소요하게 된다. 본 논문에서는 DDS의 표준 프로토콜인 RTPS(Real-Time Publish-Subscribe)에서 필수로 요구하는 SDP(Simple Discovery Protocol)를 이용하여 디스커버리 시간을 추정할 수 있는 계산식을 제안한다. 계산식은 참여자(Participant) 수를 이용한 연결 쌍(pair)의 수식과 단말개체(Endpoints) 수를 이용한 가중치(weight) 수식을 이용하며, 실제 상용 DDS 미들웨어를 이용하여 유형별로 DDS 디스커버리 시험을 수행한 결과와 비교하여 계산식을 실제로 사용할 수 있음을 보인다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.159-161
• /
• 2015

서비스 디스커버리는 대부분의 분산시스템 및 서비스 지향 아키텍처의 핵심 구성요소다. 실시간 시스템 기반에서 서비스 위치는 자주 변경될 수 있는데, 이 때 서비스 중단 문제가 발생할 수 있다. 이를 방지하기 위해서 동적인 서비스 등록과 서비스 디스커버리 기법이 매우 중요하다. 본 논문은 서비스 중단 문제를 해결할 수 있는 몇 가지 오픈 소스 솔루션들을 소개한다. 각 솔루션들은 레지스트리 타입에 따라 크게 범용 레지스트리와 단일 목적용 레지스트리로 나눌 수 있다. 각 솔루션들의 기능을 서로 비교함으로써 사용자로 하여금 자신의 요구사항에 적합한 솔루션을 선택하는데 도움이 되고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.908-917
• /
• 2013

In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1521-1531
• /
• 2015

According to the service attributes, D2D communications establish 1-1, or 1-n channels and require the differentiated device discovery technology. This paper proposes a sector-based device discovery mechanism for 1-n D2D communication scenario in LTE-Advanced networks that a disaster happened. Our proposal is a mechanism that can extend the coverage in a disaster situation which a number of devices(survivors) need to be discovered in a short time. In the single cell environment, a larger discovery coverage can be obtained, and in the multi-cell, it is possible to mitigate the interference with adjacent links due to sector-based coverage control. Through a set of simulations, we have confirmed that our proposal has better performance in the number of devices discovered and the interference than the legacy broadcast device discover mechanism.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.123-128
• /
• 2009

In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.947-954
• /
• 2009

In mobile ad hoc networks, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery protocol that is combined a dht-based service discovery scheme and a P2P caching-based information spreading scheme. Proposed scheme store key information in hashed zone and search services using it's information. To search quickly a service, it use its physical neighbors information which collected by 1-hop hello message between a node and its physical neighbors. We do not use a central look up server and do not rely on flooding. Hence, it uniquely balanced all node's load in mobile ad hoc networks and reduced the number of messages exchanged, network load and response time. The simulation results show that our protocol outperforms DHT-based and flooding protocols.