• Journal of the Korean Home Economics Association
• /
• v.40 no.2
• /
• pp.161-173
• /
• 2002

This study explored the Internet searching values(utilitarian searching value and hedonic searching value) of college student consumers, typed the Internet searching values to four types, and analysed the level of perception to Internet shopping' benefit-risk according to the Internet searching value types. The subjects were 361 college students. We used Cronbach'$\alpha$, multiple regression, one-way ANOVA, and Scheffe' test as statistical analysis. The results were summarized as follows : 1) According to the Internet searching values, college student consumers were classified into 4 types - high utilitarian/high hedonic type, high utilitarian/low hedonic type, low utilitarian/high hedonic type, and low utilitarian/low hedonic type. 2) Both high utilitarian/high hedonic type and low utilitarian/high hedonic type had high level of perception to Internet shopping' benefit-risk.

• Journal of the Korean Home Economics Association
• /
• v.45 no.5
• /
• pp.95-119
• /
• 2007

The purpose of this study was to investigate the shopping values(utilitarian and hedonic values) sought and the risks(economic, functional, socio-psychological, and privacy) perceived by consumers who participate in Internet auctions by determining the factors that affect their shopping values and risk perceptions. Empirical data were collected by an Internet survey of netizens who were interested in and had experience in Internet auctions. Questionnaires were distributed to the subjects through an Internet survey site and at an Internet auction cafe. A total of 300 questionnaires were analyzed. The results showed that consumers showed a slightly greater pursuit of a utilitarian value than a hedonic outcome in their Internet auction practices; however the outcomes pursued by consumers in their teens and twenties tended to be more hedonic than utilitarian. Consumers with a higher level of innovation, self-confidence in purchase, and need for information searching showed a greater pursuit of utilitarian and hedonic outcomes. The group of consumers with a higher expectation for legal protection pursued a more utilitarian outcome, whereas the group of consumers with higher influence from the reference group pursued a more hedonic outcome. The consumers showed that they perceived functional risk as boing most serious, followed by privacy risk, economic risk, and socio-psychological risk. Subjects with higher degrees of innovation, self-confidence in purchase and self-control perceived economic risk as critical. Functional risk was perceived to be highest in the group of consumers with self-control and a need for information searching, whereas socio-psychological risk was perceived to be highest in the group of consumers showing more self-control. Privacy risk was perceived to be highest in the group of consumers with a higher degree of innovation and lowest in both groups of higher and lower affection. Both economic and privacy risks were perceived to be lower in the group of lower pursuit of a hedonic outcome.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1063-1075
• /
• 2012

To locate an object accurately in the wireless sensor networks, the distance measure based on time-delay plays an important role. In this paper, we propose a maximum likelihood (ML) time-delay estimation algorithm in multi-path wireless propagation channel. We get the joint probability density function after sampling the frequency domain response of the multi-path channel, which could be obtained by the vector network analyzer. Based on the ML criterion, the time-delay values of different paths are estimated. Considering the ML function is non-linear with respect to the multi-path time-delays, we first obtain the coarse values of different paths using the subspace fitting algorithm, then take them as an initial point, and finally get the ML time-delay estimation values with the pattern searching optimization method. The simulation results show that although the ML estimation variance could not reach the Cramer-Rao lower bounds (CRLB), its performance is superior to that of subspace fitting algorithm, and could be seen as a fine algorithm.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.99-115
• /
• 2005

Extensible Markup Language (XML) is an Internet standard that is used to express and convert data, In order to find the necessary information out of XML documents, you need a search system for XML documents, In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure, Search metrics take account of the similarity in tag names, tag values, and the structure of tags, After a search, the system displays the ranked results in the order of aggregate similarity, Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents, These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.91-97
• /
• 2009

This paper proposes novel FE-CBIRS that finds best position of a cut to be retrieved based on color feature distribution in digital contents of IPTV. Conventional CBIRS have used a method that utilizes both color and shape information together to classify images, as well as a method that utilizes both feature information of the entire region and feature information of a partial region that is extracted by segmentation for searching. Also, in the algorithm, average, standard deviation and skewness values are used in case of color features for each hue, saturation and intensity values respectively. Furthermore, in case of using partial regions, only a few major colors are used and in case of shape features, the invariant moment is mainly used on the extracted partial regions. Due to these reasons, some problems have been issued in CBIRS in processing time and accuracy so far. Therefore, in order to tackle these problems, this paper proposes the FE-CBIRS that makes searching speed faster by classifying and indexing the extracted color information by each class and by using several cuts that are restricted in range as comparative images.

• KIISE Transactions on Computing Practices
• /
• v.23 no.11
• /
• pp.641-649
• /
• 2017

As Internet of Things devices become pervasive, services improve to better assess the context and to alert other users to deal with emergencies. Such services use Internet of Things devices to detect the context around the user and promptly notify public institutions, hospitals or other parental users in emergencies. Most of these systems analyze an event when the value of the device is unchanged for a period of time or if it detects an abnormal value. However, just monitoring sensor values makes it difficult to accurately understand the context surrounding a user. Also if the device is inactive, it can not identify the context or provide services again. However, understanding the user requirements, services provided through other devices, information sent to other users lets, appropriate actions be taken. This paper, proposes a device search method and system based on a context-aware model that includes user demands. The proposed system analyzes the user's context and demands by using data collected from the internet of things devices. If user devices are inactive, they can recognize other devices by searching for other devices and providing services to users again. Through the proposed method, the user-centric services are provided. This method also analyzes and responds to requirements in various emergencies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.382-403
• /
• 2020

Steganography is the art of concealing the existence of a secret data in a non-secret digital carrier called cover media. While the image of steganography methods is extensively researched, studies on other cover files remain limited. Videos are promising research items for steganography primitives. This study presents an improved approach to video steganography. The improvement is achieved by allowing senders and receivers exchanging secret data without embedding the hidden data in the cover file as in traditional steganography methods. The method is based mainly on searching for exact matches between the secret text and the video frames RGB channel pixel values. Accordingly, a random key-dependent data is generated, and Elliptic Curve Public Key Cryptography is used. The proposed method has an unlimited embedding capacity. The results show that the improved method is secure against traditional steganography attacks since the cover file has no embedded data. Compared to other existing Steganography video systems, the proposed system shows that the method proposed is unlimited in its embedding capacity, system invisibility, and robustness. The system achieves high precision for data recovery in the receiver. The performance of the proposed method is found to be acceptable across different sizes of video files.

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

The reverse skyline query plays an important role in information searching applications. This paper deals with continuous reverse skyline queries in sensor networks, which retrieves reverse skylines as well as the set of nodes that reported them for continuous sampling epochs. Designing an energy-efficient approach to answer continuous reverse skyline queries is non-trivial because the reverse skyline query is not decomposable and a huge number of unqualified nodes need to report their sensor readings. In this paper, we develop a new algorithm that avoids transmission of updates from nodes that cannot influence the reverse skyline. We propose a data mapping scheme to estimate sensor readings and determine their dominance relationships without having to know the true values. We also theoretically analyze the properties for reverse skyline computation, and propose efficient pruning techniques while guaranteeing the correctness of the answer. An extensive experimental evaluation demonstrates the efficiency of our approach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.31-36
• /
• 2009

Bayesian networks are known as the best tools to express and predict the domain knowledge with uncertain environments. However, bayesian learning could be too difficult to do effective and reliable searching. To solve the problems of overtime demand, the nodes should be arranged orderly, so that effective structural learning can be possible. This paper suggests the classification learning model to reduce the errors in the independent condition, in which a lot of variables exist and data can increase the reliability by calculating the each entropy of probabilities depending on each circumstances. Also efficient learning models are suggested to decide the order of nodes, that has lowest entropy by calculating the numerical values of entropy of each node in K2 algorithm. Consequently the model of the most suitably settled Bayesian networks could be constructed as quickly as possible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3050-3063
• /
• 2023

Recommendation systems provide personalized products or services to online users by mining their past preferences. Collaborative filtering is a popular recommendation technique because it is easy to implement. However, with the rapid growth of the number of users in recommendation systems, collaborative filtering suffers from serious scalability and sparsity problems. To address these problems, a novel collaborative filtering recommendation algorithm is proposed. The proposed algorithm partitions the users using affinity propagation clustering, and searches for k nearest neighbors in the partition where active user belongs, which can reduce the range of searching and improve real-time performance. When predicting the ratings of active user's unrated items, mean deviation method is used to impute values for neighbors' missing ratings, thus the sparsity can be decreased and the recommendation quality can be ensured. Experiments based on two different datasets show that the proposed algorithm is excellent both in terms of real-time performance and recommendation quality.