• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5321-5334
• /
• 2019

Data mining technology is frequently used in identifying the intention of users over a variety of information contexts. Since relevant terms are mainly hidden in text data, it is necessary to extract them. Quantification is required in order to interpret user preference in association with other structured data. This paper proposes rating and comments mining to identify user priority and obtain improved ratings. Structured data (location and rating) and unstructured data (comments) are collected and priority is derived by analyzing statistics and employing TF-IDF. In addition, the improved ratings are generated by applying priority categories based on materialized ratings through Sentiment-Oriented Point-wise Mutual Information (SO-PMI)-based emotion analysis. In this paper, an experiment was carried out by collecting ratings and comments on "place" and by applying them. We confirmed that the proposed mining method is 1.2 times better than the conventional methods that do not reflect priorities and that the performance is improved to almost 2 times when the number to be predicted is small.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2940-2955
• /
• 2012

In this paper, we propose aggregate signcryption for achieving data security in UWSNs. The main challenge of these networks established in sensitive environments is offline sink visiting. Moreover, the sensors must retain collected data for long enough time to offload them onto the itinerant sink. Thus, the unattended nature of data collection intervals might offer the adversary the opportunity to apply various attacks without detection. In this paper, employing low order operations (in time and space), we propose a new secure scheme in which various security goals such as confidentiality (through encrypting), authentication and integrity (through signing) are achieved. In addition, the aggregation process of our scheme reduces the space and communication overheads both for sensors and sink, i.e. the proposed technique efficiently enables the sensors and sink to protect, verify and recover all the related data. We further compare our scheme with the best alternative work in the literature.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.8
• /
• pp.361-368
• /
• 2016

While dimension reduction methods on high dimensional data have been widely studied, research on dimension reduction methods for high dimensional streaming data with concept drift is limited. In this paper, we review incremental dimension reduction methods and propose a method to apply dimension reduction efficiently in order to improve classification performance on high dimensional streaming data with concept drift.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2219-2236
• /
• 2017

With cloud storage services, users can handle an enormous amount of data in an efficient manner. However, due to the widespread popularization of cloud storage, users have raised concerns about the integrity of outsourced data, since they no longer possess the data locally. To address these concerns, many auditing schemes have been proposed that allow users to check the integrity of their outsourced data without retrieving it in full. Yuan and Yu proposed a public auditing scheme with a deduplication property where the cloud server does not store the duplicated data between users. In this paper, we analyze the weakness of the Yuan and Yu's scheme as well as present modifications which could improve the security of the scheme. We also define two types of adversaries and prove that our proposed scheme is secure against these adversaries under formal security models.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1047-1056
• /
• 2005

The existing data broadcasting system has the mechanism that the receiving device should download repetitively the entire broadcasting application data until it acquires the whole of the application data. This mechanism takes long time for the download. To solve this problem this paper proposes a scheme that the device effectively downloads the missing parts of broadcasting application data through the return channel and shows the performance evaluations of the proposed scheme with respect to the experiment.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.2
• /
• pp.67-69
• /
• 2006

A load composition rate estimation algorithm is developed for DSM evaluation system. The algorithm has the structure which is composed of data verification and development and can enhance the data quality Also a hourly weighting function is introduced for maintaining load shapes. The load composition rates of specific industrial customers are obtained and the results of case studies show that a reasonable load composition rate is achieved. Additionally qualify function deployment (QFD) is introduced to enhance quality and reliability of data.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.5 no.4
• /
• pp.274-283
• /
• 1981

An inexpensive and very simple microcomputer-aided measurement system has been designed for on-line experiments, which perform simultaneously data acquisition, data recorditing, calculations with the data, and positioning of necessary sensors. Interfacting between the microcomputer and the data acquisition board which consists of A/D converter, analog multiplexer, and sample-and-holder, etc. has been done through IEEE-488 interface port and parallel user port both provided by the PET computer's main logic board. Data and control signals are transfered between devices without handshaking. By utilizing BASIC commands PEEK, POKE, SYS, USR which are offered by PET microcomputer, it is possible to link machine code subroutines into the main BASIC program. This facilitates ease of data transfer, programming, and speedy execution of the program. In addition, an X-Y scanning table has been concected to the system in order to automatically position measuring sensors along a pre-determined path of interest.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2554-2575
• /
• 2020

Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.12
• /
• pp.1675-1682
• /
• 2014

In this paper, we propose a precise time management and time synchronization based on real-time data storage and transmission scheme in design of seismic data acquisition system for urban earthquake disaster preventing system (UEDPS). It is possible to improve the performance of the existing research results through the proposed methods. To evaluate the performances of the proposed methods, we implemented a prototype system(H/W & S/W) and performed some experiments with real seismic data and test equipment generated data as the input.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1491-1499
• /
• 2000

This paper is designed and implemented the data recovery mechanism for 2-D (2-dimensional) bar code system. The data recovery algorithm used the modified Reed-Solomon algorithm and it is implemented into 2-D bar code system. There are 7 types of 2-D bar code system, which are 21x21, 25x25, 41x41, 73x73, 101x101, 177x177. This paper has been experimented that how many data is saved among several 2-D bar code types and how many data re recovered. In the first experiment, the big size 2-D bar code system has many ECC codeword. Therefore, original data cannot be assigned to 2-D bar code system. In the second experiment, even if 35∼40% loss dta for the 2-D bar code system, the 2-D bar code system could have been recovered to original data.