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 10, Issue 6 - Dec 2009
Volume 10, Issue 5 - Oct 2009
Volume 10, Issue 4 - Aug 2009
Volume 10, Issue 3 - Jun 2009
Volume 10, Issue 2 - Apr 2009
Volume 10, Issue 1 - Feb 2009
Selecting the target year
A Workflow Determinacy Decision Mechanism
Chung, Woo-Jin ; Kim, Kwang-Hoon ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 1~8
The primary tasks of a workflow management system specify workflow models with respect to resource, control-flow, data-flow, functional, and operational perspectives, and to enact their workcases (workflow instances). In terms of enacting workflow models, the essential criterion grading the quality of the system is "how much is the system able to guarantee the correctness of workflow models' enactment?". Particularly, the workflow determinacy problem, which may be caused by the interference of the control-flow and the data-flow specifications, is the most challenging issue in guaranteeing the correctness of the system. We are able to solve the problem by either of the following two approaches-analysis of workflow model and verification of workflow enactment. In the paper, we propose a technique that guarantee the system's correctness through verifying workflow enactment. In other words, the technique is able to detect the conflicts of control-flow and data-flow enactments existing on a workflow model, which causes the system to be non-determinant in enacting workflow models. Finally, by applying the technique to the e-Chautauque workflow management system developed by the authors' research group, we prove that the technique is a feasible solution for the workflow determinacy problem.
An improvement of the learning speed through Improved Reinforcement Learning on Jul-Gonu Game
Shin, Yong-Woo ; Chung, Tae-Choong ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 9~15
It takes quite amount of time to study a board game because there are many game characters and different stages are exist for board games. Also, the opponent is not just a single character that means it is not one on one game, but group vs. group. That is why strategy is needed, and therefore applying optimum learning is a must. This paper used reinforcement learning algorithm for board characters to learn, and so they can move intelligently. If there were equal result that both are considered to be best ones during the course of learning stage, Heuristic which utilizes learning of problem area of Jul-Gonu was used to improve the speed of learning. To compare a normal character to an improved one, a board game was created, and then they fought against each other. As a result, improved character's ability was far more improved on learning speed.
Selecting Minimized Input Features for Detecting Automatic Fall Detection Based on NEWFM
Shin, Dong-Kun ; Lee, Sang-Hong ; Lim, Joon-Shik ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 17~25
This paper presents a methodology for a fall detection using the feature extraction method based on the neural network with weighted fuzzy membership functions (NEWFM). The distributed non-overlap area measurement method selects the minimized number of input features by removing the worst input features one by one. Nineteen number of wavelet transformed coefficients captured by a triaxial accelerometer are selected as minimized features using the non-overlap area distribution measurement method. The proposed methodology shows that sensitivity, specificity, and accuracy are 95%, 97.25%, and 96.125%, respectively.
An adaptive pulse measurement mechanism using ECG sensor node based on Zigbee
Lee, Byung-Mun ; Park, Yeon-Hee ; Lee, Young-Ho ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 27~33
With the upcoming u-healthcare era, a way of measurement for vital sign monitoring of cardiac patients is changing as well. In existing measurement of cardiac patients, various wire in ECG measuring equipment has caused much discomfort and inconvenience. In order to decrease the problem, we are developing an efficient measurement of ECG signal using Wireless sensor network. In this paper, we present a way to reduce amount of data by transmitting ECG data collected from radio electrocardiogram sensor based on Zigbee after calculating cardiac rate. And in order to control the error which can be caused by the different ECG signal intensity each individual can has, we also suggest an adaptive pulse measurement model which can measure heart rate with correcting according to different ECG intensity. To verify the suggested model, sensor application was developed and the data was acquired in TinyOS 2.0 environment and the adaptive pulse measurement model was evaluated through the data from the experiments.
Threat Unification using Multi-Sensor Simulator of Battlefield Helicopter and Its Implementation
Park, Hun-Woo ; Kang, Shin-Bong ; Noh, Sang-Uk ; Jeong, Un-Seob ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 35~49
In electronic warfare settings, battlefield helicopters identify various threats based upon threat data, which are acquired using their multi-sensors of aircraft survivability equipment (ASE). To continually function despite of potential threats and successfully execute their missions, the battlefield helicopters have to repeatedly report threats in simulated battlefield situations. Toward this ends, the paper presents threat unification using multi-sensor simulator and its implementation. The simulator consists of (1) threat attributes generator, which models threats against battlefield helicopters and defines their specific attributes, (2) threat data generator, which generates threats, being similar to real ones, using normal, uniform, and exponential distributions, and (3) graphic display for threat analysis and unification, which shows unified threat information, for example, threat angle and its level. We implement a multi-sensor threat simulator that can be repeatedly operable in various simulated battlefield settings. Further, we report experimental results that, in addition to tangibly modeling the threats to battlefield helicopters, test the capabilities of threat unification using our simulator.
A Reliable 2-mode Authentication Framework for Wireless Sensor Network
Huyen, Nguyen Thi Thanh ; Huh, Eui-Nam ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 51~60
This paper proposes a reliable 2-mode authentication framework for probabilistic key pre-distribution in Wireless Sensor Network (WSN) that guarantees the safe defense against different kinds of attacks: Hello flood attacks, Wormhole attacks, Sinkhole attack, location deployment attacks, and Man in the middle attack. The mechanism storing the trust neighbor IDs reduces the dependence on the cluster head and as the result; it saves the power energy for the authentication process as well as provides peer-to-peer communication.
The Threshold Based Cluster Head Replacement Strategy in Sensor Network Environment
Kook, Joong-Jin ; Ahn, Jae-Hoon ; Hong, Ji-Man ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 61~69
Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.
A Selective Paging Scheme based on Handoff Probability considering Local Environment on HMIPv6
Park, Si-Yong ; Lee, Bong-Hwan ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 71~83
In this paper, we propose a paging scheme considering local environment and moving patterns of mobile hosts on HMIPv6. The proposed paging scheme can adaptively construct a paging domain according to handoff probability of mobile hosts and local environment, and process a paging based on handoff probability stage by stage. For analysis of the proposed paging scheme, we simulate our scheme in two different experiment environments: an open environment like a square and a restricted environment like downtown. In experiment results, the proposed scheme shows superior performance to that of compared scheme all over. Particularly, in case of high call request rate and a restricted environment, the proposed scheme shows better performance.
An Energy-Efficient Transmission Strategy for Wireless Sensor Networks
Phan, Van Ca ; Kim, Jeong-Geun ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 85~94
In this work we propose an energy-efficient transmission strategy for wireless sensor networks that operate in a strict energy-constrained environment. Our transmission algorithm consists of two components: a binary-decision based transmission and a channel-aware backoff adjustment. In the binary-decision based transmission, we obtain the optimum threshold for successful transmission via Markov decision process (MDP) formulation. A channel-aware backoff adjustment, the second component of our proposal, is introduced to favor sensor nodes seeing better channel in terms of transmission priority. Extensive simulations are performed to verify the performance of our proposal over fading wireless channels.
Design of Mobile Agent-based Software Module For Reducing Load of RFID Middleware
Ahn, Yong-Sun ; Ahn, Jin-Ho ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 95~101
As RFID technology has been developed rapidly, its technical potential has it be widely used in many industrial fields. Particularly, in the physical distribution industry, the introduction of RFID has enormously contributed to effectively monitoring locations and information of products in real-time. Also, a significant decline in tag prices and RFID related technical competitiveness enabled each tag to be managed much more minutely by attaching it to an item, not a pallet nor a container. However, if a very large volume of tag data are continuously flowed into a RFID middleware with limited hardware resources, its entire data processing time may become considerably longer. Therefore, specific technologies are in great demand to handle and further to reduce the load of the middleware. In this paper, we proposed a mobile agent-based software module to efficiently reduce the load of the middleware by pre-processing a lot of tag data while items are in transit. Simulation results show that using the proposed software module considerably enhances the speed of processing tag data than otherwise. This behavior increases the tag recognition rate in a certain time limit and improves reliability of RFID middlewares.
Design and Implementation of a Efficient Storage Virtualization System based on Distributed Hash Tables
Kim, Jong-Hyeon ; Lee, Sang-Jun ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 103~112
This paper proposes an efficient storage virtualization system which allows users to view hard disk resources of numerous nodes as a large logical space using distributed hash tables of P2P techniques. The proposed system is developed at device level of Windows operating system and is suitable for users in Intranet environments. This system is developed to be recognized as one hard disk at the Windows explorer for user conveniences and does not need a supplementary client program at the application layer. In addition, it enhances security via cutting off breaches from external networks.
A Colored Workflow Model for Business Process Analysis
Jeong, Woo-Jin ; Kim, Kwang-Hoon ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 113~129
Abstract Corporate activities are composed of numerous working processes and during the working flow, various business processes are being created and completed simultaneously. Enterprise Resources Planning (ERP) makes the working process simple, yet creates more complicated work structure and therefore, there is an absolute need of efficient management for business processes. The workflow literature has been looking for efficient and effective ways of rediscovering and mining workflow intelligence and knowledge from their enactment histories and event logs. As part of studies to analyze and improve the process, the concepts of 'Process Mining', 'Process re-discovery', 'BPR (Business Process Reengineering)' have appeared and the studies for practical implementation are proactively being done. However, these studies normally follow the approach throughout data warehousing for log data of process instances. It is very hard for these approaches to reflect user's intention to the rediscovering and mining activities. The process instances designed based on the consideration of analysis can make groupings effectively and when the analysis demand of user changes within the analysis domain can also reduce the cost of analysis. Therefore, the thesis proposes a special type of workflow model, which is called a colored workflow model, that is extended from the ICN (information control net) modeling methodology by reinforcing the concept of colored token. The colored tokens represent the conceptual types of constraints and criteria that can be used to classifying and grouping the workflow intelligence and knowledge extracted from the corresponding workflow models' enactment histories and event logs. Through the runtime information of process instances, it makes possible to analyze proactive and user-oriented process with the goal of deriving business knowledge from the beginning of process definition.
A Visualization Framework of Information Flows on a Very Large Social Network
Kim, Shin-Gyu ; Yeom, Heon-Y. ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 131~140
Recently, the information visualization research community has given significant attention to graph visualization, especially visualization of social networks. However, visualization of information flows in a very large social network has not been studied in depth. However, information flows are tightly related to the structure of social networks and it shows dynamic behavior of interactions between members of social networks. Thus, we can get much useful information about social networks from information flows. In this paper, we present our research result that enables users to navigate a very large social network in Google Maps' method and to take a look at information flows on the network. To this end, we devise three techniques; (i) mapping a very large social network to a 2-dimensional graph layout, (ii) exploring the graph to all directions with zooming it in/out, and (iii) building an efficient query processing framework. With these methods, we can visualize very large social networks and information flows in a limited display area with a limited computing resources.
A Hierarchical Clustering Technique of XML Documents based on Representative Path
Kim, Woo-Saeng ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 141~150
XML is increasingly important in data exchange and information management. A large amount of efforts have been spent in developing efficient techniques for accessing, querying, and storing XML documents. In this paper, we propose a new method to cluster XML documents efficiently. A new prepresentative path called a virtul path which can represent both the structure and the contents of a XML document is proposed for the feature of a XML document. A method to apply the well known hierarchical clustering techniques to the representative paths to cluster XML documents is also proposed. The experiment shows that the true clusters are formed in a compact shape when a virtual path is used for the feature of a XML document.
The Web Service based Learner Tailoring Adaptive E-Learning System using Item Difficulty
Jeong, Hwa-Young ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 151~157
A lot of E-Learning system is supplying the existent item difficulty based learning information to learner. And learner is doing learning contents according to the fixed learning course. It is difficult for learner to get efficient learning effect. Because learner has to belong to fixed item difficulty and learning course even thought learner has different degree that understand studying in learning course. This research proposed the learner adaptive E-learning system that is able to control the item difficulty and learning course to analyze the understanding degree of learner in learning course. In this result, learner is able to improve learning effect to get rid of fixed learning course using bi-directed learning such as off-line learning.
Factors Influencing the Quality of E-learning Contents Provided by the Universities at the Learners' Perspectives
Jang, Sun-Young ; Roh, Seak-Zoon ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 159~172
The purposes of this study were to identify factors affecting the quality of universities' e-learning contents from the perspectives of learners and to find out specific solutions for improving them. To achieve these goals, research questions were established as follows: 1) What factors were influencing the quality of universities' e-learning contents, and how were learners perceived about each factor(by its importance and satisfaction)? 2) Were there any differences on the learners' perceptions about each factor(by its importance and satisfaction)? 3) What were any specific ways to enhance the quality of universities' e-learning contents? The participants were of 543 university students who took at least one e-learning course and were living in the metropolitan areas(Seoul, Incheon, Gyeonggi). The survey questionnaire was consisted of 38 items developed through the literature review. To analyze the data collected, factor analysis and paired-sample t-test were conducted. The results were as follows: Five identified factors influencing the quality of universities' e-learning contents from the perspectives of learners were instructional strategies, learning contents, usability, evaluation/feedback, and interface design, and all identified factors were statistically significant differences among the learners' perceptions of its importance and satisfaction. The analysis results of importance-satisfaction matrix by each factor showed that 1) learning contents was the factor that current status should be at least continuously maintained, 2) usability, instructional strategies, and evaluation/feedback were the factors that learners' satisfactions still need to be increased although those importances were not relatively high, and 3) interface factor was important, while learners' satisfaction toward it was not much high so that solutions to increase the satisfaction need to be immediately considered. Based on the results, several suggestions to enhance universities' e-learning contents from the learners' perspectives were also recommended.
Image Contrast Enhancement based on Histogram Decomposition and Weighting
Kim, Ma-Ry ; Chung, Min-Gyo ;
Journal of Internet Computing and Services, volume 10, issue 3, 2009, Pages 173~185
This paper proposes two new image contrast enhancement methods, RSWHE (Recursively Separated and Weighted Histogram Equalization) and RSWHS (Recursively Separated and Weighted Histogram Specification). RSWHE is a histogram equalization method based on histogram decomposition and weighting, whereas RSWHS is a histogram specification method based on histogram decomposition and weighting. The two proposed methods work as follows: 1) decompose an input histogram based on the image's mean brightness, 2) compute the probability for the area corresponding to each sub-histogram, 3) modify the sub-histogram by weighting it with the computed probability value, 4) lastly, perform histogram equalization (in the case of RSWHE) or histogram specification (in the case of RSWHS) on the modified sub-histograms independently. Experimental results show that RSWHE and RSWHS outperform other methods in terms of contrast enhancement and mean brightness preservation as well.