• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.132-139
• /
• 2004

A range $Top-\kappa$ query returns top k records in order of a measure attribute within a specified region on multi-dimensional data, and it is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm for answering the query via selective traverse of a Hierarchical Max R-Tree(HMR-tree). It is possible to execute the query by accessing only a small part of the leaf nodes in the query region, and the query performance is nearly constant regardless of the size of the query region. The algorithm manages the priority queue efficiently to reduce cost of handling the queue and the proposed HMR-tree can guarantee the same fan-out as the original R-tree.

• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.3
• /
• pp.235-257
• /
• 2011

In this study, we proposed the FRAD concept model of authority data schema for author, organization and journal titles included in the academic papers. Academic information includes author names, affiliations, publishers, journals and conferences. They are used as access points, and there are multiple relationships among these entities. It is expected that the use of authority data for academic information based on FRAD conceptual model could improve more accurate retrieval of information, systematic management of academic information, and various forms of knowledge representation. In this study, our entity-relationship authority data will be linked to the document, and included the several properties and relationship to identify the object.

• Journal of Information Management
• /
• v.42 no.1
• /
• pp.47-62
• /
• 2011

While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

• Journal of Korean Society of Archives and Records Management
• /
• v.18 no.3
• /
• pp.125-143
• /
• 2018

This study is a record of the process of jointly designing the records classification scheme and the retention schedule for archival appraisal, which are vital in records management. A total of 8 institutes participated voluntarily and redesigned the retention schedule, which consists of 16 common functions, 66 tasks, and 381 files for about 4 months. The process consists of reviewing the regulations related to the records management of the participating organizations, determining the hierarchy and scope of the retention schedule, deriving 16 common functions as well as the unit task for each function, and constructing the file of each task. In situations wherein it is difficult to expect the government-led policy and strategy specific to the research institute and the research records management, the retention schedule designed jointly by the records managers of the scientific and technological field serves as a useful records management tool. This collaborative effort between records managers of similar agency records will also be significant in jointly coping with the new policy and innovation plans in the future.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.137-145
• /
• 2010

Digital vessel have to accurate and efficient mange the digital data from various sensors in the digital vessel. But, In sensor network, it is difficult to transmit and analyze the entire stream data depending on limited networks, power and processor. Therefore it is suitable to use alternative stream data processing after classifying the continuous stream data. In this paper, We propose efficient processing method that arrange some sensors (temperature, humidity, lighting, voice) and process query based on sliding window for efficient input stream and pre-clustering using multiple Support Vector Machine(SVM) algorithm and manage hash table to summarized information. Processing performance improve as store and search and memory using hash table and usage reduced so maintain hash table in memory. We obtained to efficient result that accuracy rate and processing performance of proposal method using 35,912 data sets.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.703-709
• /
• 2017

Outsourcing databases is to offload storage and computationally intensive tasks to the third party server. Therefore, data owners can manage big data, and handle queries from clients, without building a costly infrastructure. However, because of the insecurity of network systems, the third-party server may be untrusted, thus the query results from the server may be tampered with. This problem has motivated significant research efforts on authenticating various queries such as range query, kNN query, function query, etc. Although aggregation queries play a key role in analyzing big data, authenticating aggregation queries has not been extensively studied, and the previous works are not efficient for data with high dimension or a large number of distinct values. In this paper, we propose the AMR-tree that is a data structure, applied to authenticate aggregation queries. We also propose an efficient proof construction method and a verification method with the AMR-tree. Furthermore, we validate the performance of the proposed algorithm by conducting various experiments through changing parameters such as the number of distinct values, the number of records, and the dimension of data.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.65-82
• /
• 2008

The purposes of this study are to explore FRBR utilities such as work clustering and expression clustering and problems of application of the FRBR by developing work and expression clustering algorithm and implementing it into cataloging system, and to suggest new cataloging rules for FRBR and guideline of MARC description to improve FRBR work clustering. FRBR was suggested by necessitation of collocation function of bibliographic records according to increase of searching materials and multi-version materials, but FRBRization has some problems such as imperfect conversion of bibliographic records to FRBR records and inappropriateness of current cataloging rules for FRBR. Bibliographic records must be processed by FRBR algorithm to construct FRBRized system, but bibliographic records and current cataloging rules couldn't perfectly support FRBRization. Therefore cataloging rules and guidelines of MARC description for FRBR are needed. For constructing FRBRized cataloging system in Korea, it is needed to find problems and solution through FRBR practical application such as developing FRBR algorithm and applying it to cataloging records.

• Journal of the Korea Society for Simulation
• /
• v.29 no.2
• /
• pp.73-81
• /
• 2020

HCCL stands for Heterogenous Container Class Library. HCCL is a library that allows heterogeneous types of data to be stored in a container as a single record and to be constructed as a list of the records to be stored in database. With HCCL, encryption/decryption can be done based on the unified data type. Recently, IoT sensor which is embedded in smartphone enables developers to provide various convenient services to users. However, it is also true that infringement of personal information may occur in the process of transmitting sensor information to API and users need to be prepared for this situation in some sense. In this study, we developed a data model that enhances existing security using SEED cryptographic algorithms while managing information of sensors based on HCCL. Due to the fact that the Android environment does not provide permission management function for sensors, this study decided whether or not to encrypt sensor information based on the user's choice so that the user can determine the creation and storage of safe data. For verification of this work, we have presented the performance evaluation by comparing with the situation of storing the sensor data in plaintext.

• Journal of Korean Society of Archives and Records Management
• /
• v.18 no.2
• /
• pp.1-28
• /
• 2018

Because archaeological artifacts are often destroyed during physical excavation, the data archaeologists gather in the field is rich with research potential. Few in Korea have paid attention to digital archives for archaeological data or argued for their development. This paper considers the significance and necessity of archaeological data and digital archives for its preservation and access. It also raises awareness of the need to develop a Korean national archaeological data digital archive. The paper first overviews the nature of the archaeological discipline, data, and digital archives. Then it investigates well-known, global cases involving digital archiving of archaeological data. Based on these foundations, the paper discusses principal and prior challenges to developing a Korean national archaeological data digital archive.

• Journal of Korean Library and Information Science Society
• /
• v.49 no.4
• /
• pp.93-117
• /
• 2018

KORMARC format for holdings data is a standard for expressing and exchanging holdings information-who they have, what copies are owned, where they are held, etc. As the need of resource sharing grows, such holdings information that informs the user to the availability and the location of a bibliographic item is becoming increasingly important. However the KORMARC format for holdings data has been used much less than KORMARC for bibliographic and authority data, and has attracted little attention from Korean libraries. Under these circumstances, this study intends (1) to analyze various standards for holdings information including MARC21 format for Holdings data (update No.26) and its applications, (2) to investigate the types of holdings data and description regulations used in Korean libraries and bibliographic utilities, and (3) to suggest the revision of existing KORMARC format for holdings data.