• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.540-552
• /
• 2004

We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.197-206
• /
• 2009

The medical information system is an effective medical diagnosis assistance system which offers an environment in which medial images and diagnosis information can be shared. However, this system can only stored and transmitted information without other functions. To resolve this problem and to enhance the efficiency of diagnostic activities, a medical image classification and retrieval system is necessary. The medical image classification and retrieval system can improve efficiency in a medical diagnosis by providing disease-related images and can be useful in various medical practices by checking diverse cases. However, it is difficult to understand the meanings contained in images because the existing image classification and retrieval system has handled superficial information only. Therefore, a medical image classification system which can classify medical images by analyzing the relation among the elements of the image as well as the superficial information has been required. In this paper, we propose the method for learning and classification of brain MRI, in which the superficial information as well as the spatial information extracted from images are used. The superficial information of images, which is color, shape, etc., is called low-level image information and the logical information of the image is called high-level image information. In extracting both low-level and high-level image information in this paper, the anatomical names and structure of the brain have been used. The low-level information is used to give an anatomical name in brain images and the high-level image information is extracted by analyzing the relation among the anatomical parts. Each information is used in learning and classification. In an experiment, the MRI of the brain including disease have been used.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.207-218
• /
• 2012

In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. In particular, the rise of the Semantic Web and linked open data leads to personalization issues where skyline queries cannot be applied easily. We addressed the special challenges presented by linked open data in previous work; and now further extend this work, with a heuristic workflow to boost efficiency. This is necessary; because the new view on linked open data dominance has serious implications for the efficiency of the actual skyline computation, since transitivity of the dominance relationships is no longer granted. Therefore, our contributions in this paper can be summarized as: we present an intuitive skyline query paradigm to deal with linked open data; we provide an effective dominance definition, and establish its theoretical properties; we develop innovative skyline algorithms to deal with the resulting challenges; and we design efficient heuristics for the case of predicate equivalences that may often happen in linked open data. We extensively evaluate our new algorithms with respect to performance, and the enriched skyline semantics.

• Journal of Information Science Theory and Practice
• /
• v.6 no.2
• /
• pp.62-70
• /
• 2018

One of the characteristics of academic writing is the inclusion of citations and references. As the development of reference styles used for international scholarly communication has mostly been led by Western academic societies, the reference styles developed in Western nations do not reflect the characteristics of Korean names. As a result, it is hard to distinguish Korean authors through citations based on Western reference styles, which in turn decreases the retrieval efficiency of relevant authors and ultimately the efficiency of scholarly communication. This paper intends to analyze author name disambiguation of Korean authors indicated according to Western reference styles. It aims to suggest the necessity for enhancing name disambiguation of Korean authors and revision of reference styles. Its ultimate goal is to increase the efficiency of scholarly communication through the improvement of name disambiguation of Korean authors. For this purpose, this study collected and analyzed name data of Korean researchers and compared name disambiguation of authors by reference style. Based on research results, this study confirmed a necessity for revising reference styles to improve name disambiguation of authors and suggested a necessity for research into the improvement of plans for revision.

• Journal of Navigation and Port Research
• /
• v.33 no.7
• /
• pp.477-482
• /
• 2009

In this paper the order picking problem in warehouses is considered, a topic which has received considerable attention from the international academic body in recent years. The order picking problem deals with the retrieval of order items from prespecified locations in the warehouse, and its objective is usually the minimization of travel time or travel distance. Hence, a well-thought order picking policy in combination with an appropriate storage policy will enhance warehouse efficiency and reduce operational costs. This paper starts with a literature overview summarizing approaches to routing order pickers, assigning stock-keeping units to pick locations and designing warehouse layouts. Since the layout design might affect both storage and routing policies, the three factors are interdependent with respect to order picking performance. To test these interdependencies, a simulation experiment was set up, involving two types of warehouse layout, four types of storage policy, five well-known heuristics and five sizes of order picking list. Our results illustrate that from the point of view of order picking distance minimization it is recommended to equip the warehouse with a third cross aisle, although this comes at the cost of a certain space loss. Additionally, we propose a set of most appropriate matches between order picking heuristics and storage policies. Finally, we give some directions for further research and recommend an integrated approach involving all factors that affect warehouse efficiency.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.53-60
• /
• 2018

This study describes a spatial web object retrieval system using Spark, an in - memory based distributed processing system. Development of social networks has created massive amounts of spatial web objects, and retrieval and analysis of data is difficult by using exist spatial web object retrieval systems. Recently, development of distributed processing systems supports the ability to analyze and retrieve large amounts of data quickly. Therefore, a method is promoted to search a large-capacity spatial web object by using the distributed processing system. Data is processed in block units, and one of these blocks is converted to RDD and processed in Spark. Regarding the discussed method, we propose a system in which each RDD consists of spatial web object index for the included data, dividing the entire spatial region into non-overlapping spatial regions, and allocating one divided region to one RDD. We propose a system that can efficiently use the distributed processing system by dividing space and increasing efficiency of searching the divided space. Additionally by comparing QP-tree with R-tree, we confirm that the proposed system is better for searching the spatial web objects; QP-tree builds index with both spatial and words information while R-tree build index only with spatial information.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.62-73
• /
• 2000

In this paper, we propose a criteria which can be applied to classify conventional color feature based Content Based Image Retrieval (CBIR) methods with its application areas, and a new image retrieval method which can represent sufficient spatial information in the image and is powerful in invariant searching to translation, rotation and enlargement transform. As the conventional color feature based CBIR methods can not sufficiently include the spatial information in the image, in general, they have drawbacks, which are weak to the translation or rotation, enlargement transform. To solve it, they have represented the spatial information by partitioning the image. Retrieval efficiency, however, is decreased rapidly as increasing the number of the feature vectors. We classify conventional methods to ones using 1st order relations and ones using 2nd order relations as their color object relation, and propose a new method using 3rd order relation of color objects which is good for the translation, rotation and enlargement transform. It makes quantized 24 buckets and selects 3 high scored histogram buckets and calculates 3 mean positions of pixels in 3 buckets and 3 angles. Then, it uses them as feature vectors of a given image. Experiments show that the proposed method is especially good at enlarged images and effective for its small calculation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.1-8
• /
• 2011

Controlling industrial vehicle operated by human in warehouse was not simple since the information transfer for controlling the vehicle was not easy. However, as the technology for the WMS (Warehouse Management System) has been advanced and the PDA (Personal Digital Assistant) has come into wide use in a workplace, the control of man-operated vehicle became less difficult as do to AGVS (Automated Guided Vehicle System). This study examines the ways to improve the efficiency of warehouse operation through introducing rule of task assignment for the vehicles, particularly forklift. This study, basically, refer to AGV operation policy because a great number of studies for AGV dispatching rule have been done and the mechanism for the controlling vehicles is very similar. The workers in field prefer to simple dispatching rules such as Shortest Retrieval Time First (SRTF), Shortest Travel Time First (STTF), and Longest Waiting Time First (LWTF). However, these rules have potential disadvantage. Thus, several rules made up by combining rules mentioned above are introduced and these new rules use threshold value or evaluation formula. The effectiveness of these new rules are tested by simulation and the results are compared. This study proposes favorable dispatching rules for forklift in warehouse for the efficiency of the vehicle operation and stability of service level.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.192-198
• /
• 2008

It is difficult to get relevant information on vast Web data. Search engines summarize and store Web information and show the ranked lists based on user queries affected by relative importance and user-adaptation. But these have limitation with showing user-intended information at the top priority. User intention is presented in general within query itself. In this paper, we propose the selective rankup methodology of user-intended search results based on weighting internal contiguity in query terms. With experimental results, we can find user-intended results with 75.8% probability using this simple method only, and efficiency of rerank proposed outperforms ordinary case by $13{\sim}20%$.

• Journal of Korean Library and Information Science Society
• /
• v.22
• /
• pp.61-93
• /
• 1995

This paper discussed which of the three basic entries of serials that changed their titles-earliest, latest, or successive entry cataloging-is the most efficient, informative, and economical in a manual and an online environment. The results of the study are as follow: 1. Earliest entry cataloging or as an alternative, successive entry cataloging advocated by Cutter in 1976 was replaced in ALA Cataloging Rules by latest entry cataloging and with AACR1 and AACR2, latest entry cataloging was replaced by successive entry cataloging again. 2. Entry method of serial cataloging should be determined in consideration of goals of catalog, efficiency of catalog retrieval, theoretical and practical standpoint of entry methods, average cataloging time and cost, the state of adaption. 3. In a card catalog environment, if the numbering and class number of the serial that title proper changed into initials itself continue and the title history must not be too complicated, the serial is desirable to entry under the latest title. Except for above case, successive entry cataloging enables serials to be more quickly and economically made available to users than with either earliest or latest entry cataloging. 4. In an automated catalog environment, successive entry cataloging has more potential of satisfying and impairs the efficiency of both accessing and processing a library's serials collection. However, when initial cataloging by MARC format is done, careful screen design and complex programming will be needed. And subfield containing the local record number should be added to the programming means to link the various records together, i.e., 780 (preceding title) and 785 (succeeding title) fields for all related titles.