• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.12 no.1
• /
• pp.43-64
• /
• 2001

The purpose of this study was to measure performance of university libraries, especially investigating the components of service quality and their relationship to the customer satisfaction. The result of the statistical analyses is summarized as follows： The result of 5 point scale study shows the following degree of satisfaction in 55 components： timeliness of circulation, processing of fine. location of library, usefulness of retrieval system, library user education, speed of retrieval. number of terminals, and cleaning. On the other hand, shows the following degree of dissatisfaction in 55 components： speed of civil petitions, hour for program use, result of civil petitions, fixing of library user education, speed of retrieval, method of public relation, waiting time for Internet use, and use of the other library materials. Also. customers’matters of weight and importance was availability. learning facilities, suitable collections, circulation, and system of retrieval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.929-939
• /
• 2010

The growth of multimedia technology forces the development of video detection for large database management and illegal copy detection. To meet this demand, this paper proposes a fast video detection method to apply to a large database. The fast video detection algorithm uses spatial features using the gray value distribution from frames and temporal features using the temporal similarity map. We form the video signature using the extracted spatial feature and temporal feature, and carry out a stepwise matching method. The performance was evaluated by accuracy, extraction and matching time, and signature size using the original videos and their modified versions such as brightness change, lossy compression, text/logo overlay. We show empirical parameter selection and the experimental results for the simple matching method using only spatial feature and compare the results with existing algorithms. According to the experimental results, the proposed method has good performance in accuracy, processing time, and signature size. Therefore, the proposed fast detection algorithm is suitable for video detection with the large database.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.321-326
• /
• 2021

Blockchain is increasing in value as a platform for safe transmission of capital transactions or secure data. In addition, blockchain has the potential as a new platform that can safely store large amounts of data such as videos, music, and photos, and safely manage transaction details and service usage specifications. Since it is not possible to store large-capacity media data in a block, research on the performance of storing sound source information in a block and retrieving the stored sound source data by using the distributed storage system (IPFS) and the hash information of the sound source signature data was conducted. In this paper, we propose a sound source signature indexing method using a bloom filter that can improve the search speed suggested by previous studies. As a result of the experiment, it was confirmed that improved search performance (O(1)) than the existing search performance (O(n)) can be achieved.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.11-18
• /
• 2009

Ajax based on Java Script receives attention as an alternative to ActiveX technology. Most portal sites in korea show a tendency to reopen existing services by combining the technology, because it supports most web browsers, and has the advantages of such a brilliant interface, excellent speed, and traffic reduction through asynchronous interaction. This paper modeled and implemented a multilingual meta-search service using the Ajax and open APIs provided by international famous sites. First, a Korean query is translated into one of the language of 54 countries around the world by Google translation API, and then the translated result is used to search the information of the social web sites such as Flickr, Youtube, Daum, and Naver. Searched results are displayed fast by dynamic loading of portion of the screen using Ajax. Our system can reduce server traffic and per-packet communications charges by preventing redundant transmission of unnecessary information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.

• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.357-365
• /
• 2010

Personalized web search engine provides personalized results to users by query expansion, re-ranking or other methods representing user's intention. The personalized result page includes URL, page title and small text fragment of each web document. which is known as snippet. The snippet is the summary of the document which includes the keywords issued by either user or search engine itself. Users can verify the relevancy of the whole document using only the snippet, easily. The document summary (snippet) is an important information which makes users determine whether or not to click the link to the whole document. Hence, if a search engine generates personalized document summaries, it can provide a more satisfactory search results to users. In this paper, we propose a personalized document summary system for personalized web search engines. The proposed system provides increased degree of satisfaction to users with marginal overhead.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.575-582
• /
• 2008

본 논문은 시맨틱 웹 기술이 어떻게 국가 표준(KS) 정보 검색 서비스 내 정보들을 연계시키고 사용자 접근성을 향상시키는 데 도움을 줄 수 있는지를 실증적으로 보여준다. 기존 표준 정보 검색 서비스는 용어 검색의 유연성이 부족하여 표준 정보에서 사용된 용어와 사용자 용어 간의 괴리를 해소하지 못했으며 표준, 기관, 인력 등 상호 관련성을 가진 개체 정보들을 개별적으로 서비스하였다. 이러한 상황은 사용자의 표준 정보 검색 서비스 접근성을 떨어뜨리는 요인으로 작용한다. 본 연구에서는 유의어, 관련어를 중심으로 한 표준 용어 사전 구축을 통해 사용자 용어와 표준 정보 내 용어 간의 원활한 매칭을 지원하며, 표준 관련 개체들을 온톨로지와 추론을 통해 연계시키는 방안을 제시한다. 개선된 표준 정보 검색 서비스는 개선된 표준 정보 검색 서비스는 개체 중심적 통합 검색 결과 제공 방식으로 관련 정보들을 단일 웹 페이지 내에서 확인할 수 있도록 해준다. 예를 들어, 특정 KS 표준 검색 결과 페이지에서는 기존에 DB 접근이나 검색 엔진을 통해 바로 획득할 수 없었던 정부 표준들, 기관들의 해당 KS 표준 인용 현황, 해당 KS 표준 전문가들, 부합화를 위해 참조된 국제 표준들, 해당 KS 표준 전문가들, 부합화를 위해 참조된 국제 표준들, 해당 KS 표준 전문가 네트워크, 해당 KS 표준 내 표준 용어 사전 정보 등 다양한 관련 정보들을 조합하여 서비스한다. 본 연구를 위해 모델링된 온톨로지와 시맨틱 웹기반 서비스 프레임워크인 OntoFrame 상에서 추론 작업이 표준 정보 적재 시에 전방 추론 (Forward-chaining) 방식으로 수행되었으며, 표준 온톨로지 질의 언어인 SPARQL (SPARQL Protocol and RDF Query Language)을 이용해 일반 검색 서비스 수준의 속도로 서비스될 수 있었다.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.49-53
• /
• 2010

Recently multimedia has been formed, provided, and shared enough not to compare with the past, due to the proliferation of Internet and the development of hardware relating to multimedia. Accordingly to internationally give a proper expression to metadata of multimedia, the standard of MPEG-7 has been established, and researches for image search among various data of multimedia using MPEG-7 are going on. Thus there are meaning-based search. In the former there is a merit that search speed is fast, but technology and accuracy by technical knowledge on the image. In the latter the accuracy of search is decreasing because of not understanding the meaning about image and the internet of users. In this study to solve these problems a search system has been designed by combining the two methods. Also the search and manage image data by handheld devices such as portable PDA or smart phone, a system. Once this is used, multimedia data can be efficiently searched and utilized by handheld devices.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3559-3568
• /
• 1999

The information overload with many information resources is an inevitable problem in modern electronic life. It is more difficult to search some information with user's information needs from an uncontrolled flood of many digital information resources, such as the internet which has been rapidly increased. So, many information retrieval systems have been researched and appeared. In text retrieval systems, they have met with user's information needs. While, in image retrieval systems, they have not properly dealt with user's information needs. In this paper, for resolving this problem, we proposed the intelligent user interface for image retrieval. It is based on HCOS(Human-Computer Symmetry) model which is a layed interaction model between a human and computer. Its' methodology is employed to reduce user's information overhead and semantic gap between user and systems. It is implemented with machine learning algorithms, decision tree and backpropagation neural network, for user adaptation capabilities of intelligent image retrieval system(IIRS).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.143-152
• /
• 2007

In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.