Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 13, Issue 6 - Dec 2012
Volume 13, Issue 5 - Oct 2012
Volume 13, Issue 4 - Aug 2012
Volume 13, Issue 3 - Jun 2012
Volume 13, Issue 2 - Apr 2012
Volume 13, Issue 1 - Feb 2012
Selecting the target year
Estimation of Willingness To Pay for Mobile Data Service
Ko, Chang-Youl ; Lee, Sang-Woo ; Park, Joon-Ho ; Jeong, Nae-Yang ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 1~11
DOI : 10.7472/jksii.2012.13.2.1
The purpose of this paper is to estimate `willingness to pay` for mobile data service by using contingent valuation method with double bounded dichotomous choice question. The findings are as follows.: First, the willingness to pay of mobile data service is considerably lower than current retail price. Second, the perceived degree of mobile data service such as awareness and benefit recognition is positively related to the willingness to pay of mobile data service. Our results suggest that active promotion and strengthening of the content of mobile data service are needed in order to enhance the profitability of mobile operators. The analysis results will be used to set the mobile operator`s pricing strategy and to build up a successful communication policies in the mobile ecosystem.
A Computational Complexity Reduction Scheme for SLM Based OFDM Communication Systems
Cho, Soo-Bum ; Hyun, Kwang-Min ; Park, Sang-Kyu ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 13~20
DOI : 10.7472/jksii.2012.13.2.13
SLM (Selected Mapping) is an efficient PAPR (Peak-to-Average Power Ratio) reduction scheme without transmitted signal distortion in OFDM (Orthogonal Frequency Division Multiplexing) systems. However, enormous IFFTs (Inverse Fast Fourier Transforms) are needed to generate sufficient candidate OFDM signals, which cause the SLM to become quite complex. In this paper, we propose a new SLM scheme that replaces the IFFT operations with a conversion of the first candidate OFDM signal. The proposed scheme significantly reduces computational complexity, while it shows almost the same PAPR performance as the conventional SLM scheme.
A Framework of N-Screen Session Manager based N-Screen Service using Cloud Computing in Thin-Client Environment
Alsaffar, Aymen Abdullah ; Song, Biao ; Hassan, Mohammad Mehedi ; Huh, Eui-Nam ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 21~32
DOI : 10.7472/jksii.2012.13.2.21
We develop architecture of a virtual aggregation gateway (VAG) which enables composite application streaming based on N-Screen-as-a-Service (NaaS) using cloud computing in thin-client environment. We also discuss the problem of server computing burden in large scale multi-client case for screens sharing with composite application streaming over the internet. In particular, we propose an efficient Framework of N-Screen Session Manager which manages all media signaling that are necessary to deliver demanded contents. Furthermore, it will provides user with playback multimedia contents method (TV Drama, Ads, and Dialog etc) which is not considered in other research papers. The objectives of proposing N-Screen Session Manager are to (1) manage session status of all communication sessions (2) manage handling of received request and replies (3) allow users to playback multimedia contents anytime with variety of devices for screen sharing and (4) allow users to transfer an ongoing communication session from one device to another. Furthermore, we discuss the major security issues that occur in Session Initiation Protocol as well as minimizing delay resulted from session initiations (playback or transfer session).
The Implementation of Application Services Using CSCFs of Management
Lee, Jae-Oh ; Cho, Jae-Hyoung ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 33~40
DOI : 10.7472/jksii.2012.13.2.33
Recently, according to increasing the network traffic in the IMS, the role of Network Management System (NMS) is very important because of limited network resource. NMS can perform two kinds of routing ways with the capability of static or dynamic routing. The way of A dynamic routing is more efficient than static routing one because it can make the flow of traffic changeful among nodes in the IMS. Therefore, in this paper, we suggest a management function of NMS, using a dynamic routing algorithm for managing the CSCFs in the IMS. And then we analyze the algorithm by measuring the performance of PoC, one of the prominent application services to be deployed in the IMS.
Performance Analysis of TCAM-based Jumping Window Algorithm for Snort 2.9.0
Lee, Sung-Yun ; Ryu, Ki-Yeol ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 41~49
DOI : 10.7472/jksii.2012.13.2.41
Wireless network support and extended mobile network environment with exponential growth of smart phone users allow us to utilize the network anytime or anywhere. Malicious attacks such as distributed DOS, internet worm, e-mail virus and so on through high-speed networks increase and the number of patterns is dramatically increasing accordingly by increasing network traffic due to this internet technology development. To detect the patterns in intrusion detection systems, an existing research proposed an efficient algorithm called the jumping window algorithm and analyzed approximately 2,000 patterns in Snort 2.1.0, the most famous intrusion detection system. using the algorithm. However, it is inappropriate from the number of TCAM lookups and TCAM memory efficiency to use the result proposed in the research in current environment (Snort 2.9.0) that has longer patterns and a lot of patterns because the jumping window algorithm is affected by the number of patterns and pattern length. In this paper, we simulate the number of TCAM lookups and the required TCAM size in the jumping window with approximately 8,100 patterns from Snort-2.9.0 rules, and then analyse the simulation result. While Snort 2.1.0 requires 16-byte window and 9Mb TCAM size to show the most effective performance as proposed in the previous research, in this paper we suggest 16-byte window and 4 18Mb-TCAMs which are cascaded in Snort 2.9.0 environment.
Design and Implementation of A Context-Aware Authentication Security Service Based on u-Hospital Environments
Jeong, Chang-Won ; Choi, Jae-Hyeong ; Joo, Su-Chong ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 51~57
DOI : 10.7472/jksii.2012.13.2.51
The warming up of the recent competition in the smart phone industry followed by rapid increase of open platforms and app stores have led the mobile terminals to adopt the general purpose operating system. The mobile device utilizing this OS is vulnerable to mobile malignant code which is highly transferable. As a result, the scale of mobile attack and harm increase. However, compared to the malicious code and virus which keep increasing, the elements for security to prevent are insufficient. Therefore, this paper describe about the Context Aware Service that eliminates the potentially risky elements on the smart phone service, which could threaten the usability of the service including invasion of personal information. The proposed system prevents from disclosure of personal information by giving the procedure of information, and realizes the service that is able to change the sequence of identifying the users` information to prepare for emergency.
Study on Improvement of Weil Pairing IBE for Secret Document Distribution
Choi, Cheong-Hyeon ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 59~71
DOI : 10.7472/jksii.2012.13.2.59
PKI-based public key scheme is outstanding in terms of authenticity and privacy. Nevertheless its application brings big burden due to the certificate/key management. It is difficult to apply it to limited computing devices in WSN because of its high encryption complexity. The Bilinear Pairing emerged from the original IBE to eliminate the certificate, is a future significant cryptosystem as based on the DDH(Decisional DH) algorithm which is significant in terms of computation and secure enough for authentication, as well as secure and faster. The practical EC Weil Pairing presents that its encryption algorithm is simple and it satisfies IND/NM security constraints against CCA. The Random Oracle Model based IBE PKG is appropriate to the structure of our target system with one secret file server in the operational perspective. Our work proposes modification of the Weil Pairing as proper to the closed network for secret file distribution. First we proposed the improved one computing both encryption and message/user authentication as fast as O(DES) level, in which our scheme satisfies privacy, authenticity and integrity. Secondly as using the public key ID as effective as PKI, our improved IBE variant reduces the key exposure risk.
A Workflow-based Social Network Intelligence Discovery Algorithm
Kim, Kwang-Hoon ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 73~86
DOI : 10.7472/jksii.2012.13.2.73
This paper theoretically derives an algorithm to discover a new type of social networks from workflow models, which is termed workflow-based social network intelligence. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict from workflow models and their execution histories. So, this paper proposes an algorithm, which is termed ICN-based workflow-based social network intelligence discovery algorithm, to be classified into the type of discovery techniques, which are able to discover workflow-based social network intelligence that are formed among workflow performers through a series of workflow models and their executions, In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to generate its corresponding workflow-based social network intelligence.
Agent`s Activities based Intention Recognition Computing
Kim, Jin-Ok ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 87~98
DOI : 10.7472/jksii.2012.13.2.87
Understanding agent`s intent is an essential component of the human-computer interaction of ubiquitous computing. Because correct inference of subject`s intention in ubiquitous computing system helps particularly to understand situations that involve collaboration among multiple agents or detection of situations that can pose a particular activity. This paper, inspired by people have a mechanism for interpreting one another`s actions and for inferring the intentions and goals that underlie action, proposes an approach that allows a computing system to quickly recognize the intent of agents based on experience data acquired through prior capabilities of activities recognition. To proceed intention recognition, proposed method uses formulations of Hidden Markov Models (HMM) to model a system`s prior experience and agents` action change, then makes for system infer intents in advance before the agent`s actions are finalized while taking the perspective of the agent whose intent should be recognized. Quantitative validation of experimental results, while presenting an accurate rate, an early detection rate and a correct duration rate with detecting the intent of several people performing various activities, shows that proposed research contributes to implement effective intent recognition system.
A Collaborative Framework for Discovering the Organizational Structure of Social Networks Using NER Based on NLP
Elijorde, Frank I. ; Yang, Hyun-Ho ; Lee, Jae-Wan ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 99~108
DOI : 10.7472/jksii.2012.13.2.99
Many methods had been developed to improve the accuracy of extracting information from a vast amount of data. This paper combined a number of natural language processing methods such as NER (named entity recognition), sentence extraction, and part of speech tagging to carry out text analysis. The data source is comprised of texts obtained from the web using a domain-specific data extraction agent. A framework for the extraction of information from unstructured data was developed using the aforementioned natural language processing methods. We simulated the performance of our work in the extraction and analysis of texts for the detection of organizational structures. Simulation shows that our study outperformed other NER classifiers such as MUC and CoNLL on information extraction.
A Workflow-based Affiliation Network Knowledge Discovery Algorithm
Kim, Kwang-Hoon ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 109~118
DOI : 10.7472/jksii.2012.13.2.109
This paper theoretically derives an algorithm to discover a new type of workflow-based knowledge from workflow models, which is termed workflow-based affiliation network knowledge. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict a series of workflow-based knowledge from workflow models and their execution histories. So, this paper proposes a knowledge discovery algorithm which is able to discover workflow-based affiliation networks that represent the association and participation relationships between activities and performers defined in ICN-based workflow models. In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to derive its corresponding workflow-based affiliation network knowledge.
The Empirical Study on the Motivations for e-Learning Service Usage of Smart Device Users
Lee, Jong-Man ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 119~126
DOI : 10.7472/jksii.2012.13.2.119
The purpose of this study is to test the motivations for e-Learning service usage of smart device users. To do this, empirical data were collected by conducting a field survey with 382 smart-device based e-learners, and structural equation model was used for the purpose of analyzing the data acquired by the survey. A structural equation model was designed and constructed by such factors like usefulness, enjoyment, word-of-mouse(WOM) effect, and social interaction on e-Learning usage intention. In addition, social interaction has an influence on WOM effect. The results of the analysis are summarized as follows; first, usefulness, enjoyment, and WOM have direct effects on e-Learning usage intention. Second, social interaction not only has direct influence on e-Learning usage intention but also has indirect influence carried by WOM effect. The findings have significant implications which the study inquires into the factors for e-Learning usage motivations of smart-device based e-learners.
A study on longitudinal differences in website user`s trust factors
Shin, Kil-Hwan ; Jeong, Cheon-Su ; Lee, Choon-Yeul ;
Journal of Internet Computing and Services, volume 13, issue 2, 2012, Pages 127~136
DOI : 10.7472/jksii.2012.13.2.127
IT industry is rapidly changing technologies and trends are leading the field. Website also typical of these areas in the field of IT as a sector, technological advances faster, depending on the nature of the IT industry and the emergence of new services, changes in a variety of platforms, and is rapidly rising. In addition, a website containing information in accordance with the social situation changes and exposure of the agenda and vary greatly. Therefore, these changes in terms of B2C websites that can make a difference in the reliability factor looks. From this perspective, in this study to compare data before and after 10 years on the reliability factor by conducting longitudinal studies, most are not addressed in previous studies due to time differences website users to change the reliability of the analyzed factors.