• Journal of Korea Technology Innovation Society
• /
• v.16 no.1
• /
• pp.1-19
• /
• 2013

A myriad of information production channels and medium including internet, social media, and multi media channels emerged, often with conflicting interests, disseminate unwanted and inaccurate information which could result in sudden severe public relations damage to the global companies with world class products if not dealt with in the professional way. Properly crafted and managed public relations thus should become the integral part of all organizations. In particular online public relations leadership becomes even more important to public organizations responsible for national branding and interests and to private sectors expanding into the global markets. The research aims to increase global competitiveness of the pubic and exporters by presenting the online leadership strategy 101. For this purpose, locally produced web sites are analysed both from technical and global marketing perspectives. From the research all web sites were classified into three types of ghost, wreck, and moron. The 2012 research showed that 99% was moron, followed by 67% wreck and 1% ghost. The research presents must strategies for global public relations and marketing. They include strategic planning, public relation training, white hat search engine optimization, web standards, web accessibility, mobile web site and the inbound marketing strategies.

• Information Systems Review
• /
• v.20 no.1
• /
• pp.1-16
• /
• 2018

The development and generalization of the Internet increased the popularity of food delivery service applications in Korea. The food delivery market based on online-to-offline service is growing rapidly. This study compares the usability of Korean food delivery service application between that of Chinese food delivery service application. This study suggests improvement points for Korean food delivery service applications. To conduct this study, we explore the status of various food delivery service applications and conduct interviews and surveys based on the honeycomb model developed by Peter Morville. This study obtained the following results. First, all restaurants participating in the Korean food delivery service must be able to accept order through the application. Second, the shopping cart function must be able to accept order of all restaurants simultaneously. Third, when users look for menu recommendation, their purchase history and shopping cart functions should appear at the first page of the website. Users should be able to perceive the improved usability of the website using those functions. Fourth, when the search window is fixed on the top of each page, users should be able to find the information they need. Fifth, the application must allow users to find the exact location of the delivery person and the estimated delivery time. Finally, the restaurants'address should be disclosed and fast delivery time should be confirmed to enhance users'trust on the application. This study contributes to academia and industry by suggesting useful insight into food delivery service applications and improving the point of food delivery service application in Korea.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.479-487
• /
• 2016

In a Web 2.0 context, users are exposed to numerous smart devices and services that allow real-time interaction between users (or consumers) and developers (or producers). For the provisioning of new user-created services based on user's context, the data management of service creation experiences becomes a non-trivial task. This article introduces a data model for service creation and then proposes a service creation management architecture which enables new service creation using the data model, the management of the service creation data, and the semantic service discovery across internal/external service repositories. The article also explains the use of the proposed architecture with two different scenarios: home and mobile environments. The proposed architecture for service creation data management offers consistent and seamless handling of the service creation data throughout its usage lifecycle.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.71-77
• /
• 2017

There has been a recent spate in the usage of mobile device equipped GPS sensors, such as smart phones. This trend enables the posting of geo-tagged messages (i.e., multimedia messages with GPS locations) on social media such as Twitter and Facebook, and the volume of such spatial data is rapidly growing. However, the relationships between the location and content of messages are not always explicitly shown in such geo-tagged messages. Thus, the need arises to reorganize search results to find the relationship between keywords and the spatial distribution of messages. We find the smallest minimum bounding rectangle (MBR) that embedding k or more points in order to find the most dense rectangle of data, and it can be usefully used in the location search system. In this paper, we suggest efficient algorithms to discover a group of 2-Dimensional spatial data with a close distance, such as MBR. The efficiency of our proposed algorithms with synthetic and real data sets is confirmed experimentally.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• Journal of Korean Library and Information Science Society
• /
• v.46 no.1
• /
• pp.177-202
• /
• 2015

This research was conducted to evaluate whether knowledge and information resources produced in four educational institutions function as a knowledge management system in the institutions, and to suggest a proposed plan for the foundation of the national knowledge management system. Knowledge and information resources available on the institutes' websites were classified as 'knowledge and information resources of result', 'knowledge and information resources of process', and 'knowledge and information resources of communication'. The application of metadata and the configuration of the search system were examined by content analysis method. From the result, 8 ways to improve the management of knowledge and information resources have been found; the development of standardized metadata and classification scheme, high recognition that the website is a counter for external distribution of knowledge and information resources, various searching skills and the provision of knowledge maps available, provision of linked information for original information acquisition, awareness of the agency managers and homepage managers to the homepages as knowledge management systems, segmentation of appropriate data size unit in a mobile environment work, an organic linkage function of the internal electronic approval system and the homepage have been proposed.

• The Journal of Society for e-Business Studies
• /
• v.17 no.3
• /
• pp.129-147
• /
• 2012

In this paper, we research on the personal information protection system in smart-phone based on mobile environment. This paper proposes the enhanced personal location privacy mechanism in location-based service environment of a smart phone operating system(iOS, Android) for the relevant regulations on location-based protection and utilization. Also, the result verified that possibility on a self-control mechanism of the personal information protection system's subject in the window platform throughout the experiment. Therefore, this study have drew a method that user positively can cope with a protection of personal location information by having a user's self-control method in the system under development or done by illegal location-based service providers and illegal application developer.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.187-195
• /
• 2008

In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.