• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.5 no.1
• /
• pp.85-105
• /
• 1981

Information is an essential factor leading the rapid progress which is one of the distinguished characteristics in modem society. As more information is required and as more is supplied by individuals, governmental units, businesses, and educational institutions, the greater will be the requirement for efficient methods of communication. One possibility for improving the information dissemination process is to use computers. The capabilities of such machine are beginning to be used in the process of Information storage, retrieval and dissemination. An important problems, that must be carefully examined is whether one technique for information retrieval is better for worse than another. This paper examines problem of how to evaluate an information retrieval system. One specific approach is a cost accounting model for use in studying how to minimize the cost of operating a mechanized retrieval system. Through the use of cost analysis, the model provides a method for comparative evaluation between systems. The general cost accounting model of the literature retrieval system being designed by this study are given below. 1. The total cost accounting model of the literature retrieval system. The total cost of the literature retrieval system = (the cost per unit of user time X the amount of user time) + ( the cost per unit of system time X the amount of system time) 2. System cost accounting model system cost = (the pre-search system cost per unit of time X time) + (the search system cost per unit of time X time) + (the post search system cost per unit of time X time) 1) Pre-search system cost per unit of time = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 2) Search system cost per unit of time = comparison cost + document representation cost. 3) Post-search system cost per unit of time. = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 3. User cost accounting model Total user cost = [pre-search user cost per unit of time X (time + additional time) ] + [search user cost per unit of time X (time + additional time) ] + [post-search user cost per unit of time X (time + additional time) ].

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1515-1518
• /
• 2003

This paper suggests the condensed two-stage retrieval method for fast image retrieval in the content-based image retrieval system, and proves the validity of the performance. The condensed two-stage retrieval method reduces the overall response time remarkably while it maintains relevance with the conventional exhaustive search method. It is explained by properties of the Cauchy-Schwartz inequality. In experimental result, it turns out that there is an optimal value of condensation ratio which minimizes the overall response time. We analyze the optimal condensation ratio by modeling a similarity computation time mathematically.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.118-125
• /
• 2013

This paper deals with the picking batch size which a bi-directional carousel system can be feasible. The items that customers order are retrieved from the bins of carousel with batch size. The mathematical equations representing rotary travel distance and retrieval lead time to pick a given batch size are derived. Rotary travel distance represents the distance which carousel system rotates to retrieve items in a batch. The bi-directional carousel system rotates to minimize the travel distance in retrieving the items in a batch. Rotary travel distance and retrieval lead time are analyzed for the batch size through the simulation approach. From the simulation, the retrieval batch size that carousel system can be feasible is obtained. A numerical example is shown to explain the solution procedure.

• Journal of Korean Library and Information Science Society
• /
• v.38 no.3
• /
• pp.223-246
• /
• 2007

This study examines the retrieval efficiency of the FRBR-based bibliographic retrieval system. To do this, we built two experimental retrieval systems(a FRBR-based system constructed through FRBRizing algorithms and an OPAC-based retrieval system) using 387 music materials coded in a KORMARC format. Next, we set up six hypotheses and compared these two systems in terms of recall, precision, and retrieval time using 28 participants and a questionnaire with 12 queries. The results show that the average recall value of the FRBR-based system Is higher than that of the OPAC system regardless of query types and the average precision and retrieval time values of manifestation queries of the OPAC system is more efficient that those of the FRBR-based system. This study results can be used to customize digital library interfaces as well as to improve the retrieval efficiency of the bibliographic retrieval system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.171-180
• /
• 2003

A content-based image retrieval(CBIR) system builds the image database using low-level features such as color, shape and texture and provides similar images that user wants to retrieve when the retrieval request occurs. What the user is interest in is a response time in consideration of the building time to build the index database and the response time to obtain the retrieval results from the query image. In a content-based image retrieval system, the similarity computing time comparing a query with images in database takes the most time in whole response time. In this paper, we propose the two-phase search method with the clustering technique of feature vector in order to minimize the similarity computing time. Experimental results show that this two-phase search method is 2-times faster than the conventional full-search method using original features of ail images in image database, while maintaining the same retrieval relevance as the conventional full-search method. And the proposed method is more effective as the number of images increases.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.29-37
• /
• 1995

An Automated Storage/Retrieval Systems(AS/RS) has been gradually emphasized because of the change of production and distribution environment. This paper develops algorithm and Shortest Distance Model that can reduce the traveling time of a stacker crane for efficient operation of AS/RS. In order to reduce the traveling time of a stacker crane, we determine the order processing and then the sequencing of storage/retrieval for each item. Order processing is determined based on the SPT(Shortest Processing Time) concept considering a criterion of retrieval coordinate. The sequencing of storage/retrieval is determined based on the Shortest Distance Model by using a modified SPP(Shortest Path Problem) of network problem. A numerical example is provided to illustrate the developed algorithm and Shortest Distance Model.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.674-679
• /
• 2009

This paper proposes a method of player event retrieval using combination of two functions: detection of player name in speech information and detection of sound event from audio information in golf videos. The system consists of indexing module and retrieval module. At the indexing time audio segmentation and noise reduction are applied to audio stream demultiplexed from the golf videos. The noise-reduced speech is then fed into speech recognizer, which outputs spoken descriptors. The player name and sound event are indexed by the spoken descriptors. At search time, text query is converted into phoneme sequences. The lists of each query term are retrieved through a description matcher to identify full and partial phrase hits. For the retrieval of the player name, this paper compares the results of word-based, phoneme-based, and hybrid approach.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.95-104
• /
• 2009

This paper proposes the noise robust algorithm to detect the starting point of music. Detection of starting point of music is necessary to solve computational-waste problem and retrieval-comparison problem with inconsistent input data in music content based retrieval system. In particular, such detection is even more necessary in time sequential retrieval method that compares data in the sequential order of time in contents based music retrieval system. Whereas it has the long point that the retrieval is fast since it executes simple comparison in the order of time, time sequential retrieval method has the short point that data starting time to be compared should be the same. However, digitalized music cannot guarantee the equity of starting time by bit rate conversion. Therefore, this paper ensured that recognition rate shall not decrease even while executing high speed retrieval by applying time sequential retrieval method through detection of music starting point in the pre-processing stage of retrieval. Starting point detection used minimum wave model that can detect effective sound, and for strength against noise, the noises existing in mute sound were swapped. The proposed algorithm was confirmed to produce about 38% more excellent performance than the results to which starting point detection was not applied, and was verified for the strength against noise.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.159-166
• /
• 2005

The application that the user's contexts are continuously changed over time requires an efficient information retrieval. This paper proposes a new context-differentiated information retrieval method for an efficient ubiquitous service. This enables the rapid retrieval, because of no access to the most detail information at a time. This paper describes the retrieval method, the algorithms and the experimental results.