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 12, Issue 6 - Dec 2011
Volume 12, Issue 5 - Oct 2011
Volume 12, Issue 4 - Aug 2011
Volume 12, Issue 3 - Jun 2011
Volume 12, Issue 2 - Apr 2011
Volume 12, Issue 1 - Feb 2011
Selecting the target year
Real-Time Link Throughput Management Algorithms for Generalized PF Scheduling in Wireless Mobile Networks
Joung, Hee-Jin ; Mun, Cheol ; Yook, Jong-Gwan ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 1~9
Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.
Efficient Link Aggregation in Delay-Bandwidth Sensitive Networks
Kwon, So-Ra ; Jeon, Chang-Ho ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 11~19
In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.
Performance of Serial Communication Protocols through Conducting Threads
Kim, Na-Young ; Kim, Hwan ; Kim, Juk-Young ; Kwon, Young-Mi ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 21~28
Recently medical and entertainment applications using conducting textile are suggested, but the data of conducting threads are not characterized, classified and verified. Only the data sheet published by manufacturing companies is available. Thus we need to verify the performances of the threading threads in communication. And we need a guideline if the existing communication protocols can be used for the conducting threads communication or the new specific communication protocols have to be developed for the communication. This paper classifies the characteristics of conducting threads made by domestic and overseas companies. Based on the criteria we classified conducting threads into three classes: class A, class B and class C. Further we carried out experiments to verify the adaptability of existing simple serial communication protocols such as RS232. Six different conducting threads are used in experiments and the length of each thread was 0.5m, 1m, 2m and 3m. The data transmission rate and error rate are collected and analyzed. RS485 is very prone to error due to static electricity from human and environment. So it may not be appropriate as long-distance communication protocol up to 12km which is possible in theory. RS232 shows stable and error-less data transmission ability even though every conducting thread didn’t show transmission capability over RS232. USB protocol shows high data rate transmission but the distance cannot be exceeded over 2m. Additionally, USB requires stable power supply. But if the power is supplied through conducting thread, its function is not.
A Study About User Pattern of Social Bookmarking System
Jo, Hyeon ; Choeh, Joon-Yeon ; Kim, Soung-Hie ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 29~37
Recently, many user-participating web services have been used widely as the evolution of internet web technology has rapidly been developed. Users share various content and opinion on line using a site like ‘Social bookmarking.’ Users can share others’ bookmarking history and create tags while bookmarking web sites; we call it collaborative tagging. In this paper, we studied empirical analysis for widely used social bookmarking and collaborative tagging which the result shows minority of users is actively using the bookmarking and a few sites and tags are used by majority of the users. 24% users tagged 80%, 75% sites and 81% tags were tagged below than 3 times. Types of bookmarking activities were found different by users and early appointed tags get more frequency by majority. We also identified relative proportions of tags on certain sites are becoming convergence gradually. We expect the result of this paper will give opportunities to help further developing social bookmarking system.
Vulnerability Assessment on the Secured USB Keyboard
Lee, Kyung-Roul ; Yim, Kang-Bin ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 39~46
The user authentication on the security applications is one of the most important process. Because character based password is commonly used for user authentication, it is most important to protect the keyboard. Due to the reason, several software solutions for keyboard security have been applied to critical sites. This paper introduces vulnerabilities to the commonly used USB keyboard, implements a sample code using the vulnerabilities and evaluates the possibility for the keyboard data to be stolen in the guarded environment. Through the comparison of the result, a countermeasure to the vulnerabilities is proposed.
Fuzzy Expert System for Detecting Anti-Forensic Activities
Kim, Se-Ryoung ; Kim, Huy-Kang ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 47~61
Recently, the importance of digital forensic has been magnified because of the dramatic increase of cyber crimes and the increasing complexity of the investigation of target systems such as PCs, servers, and database systems. Moreover, some systems have to be investigated with live forensic techniques. However, even though live forensic techniques have been improved, they are still vulnerable to anti-forensic activities when the target systems are remotely accessible by criminals or their accomplices. To solve this problem, we first suggest a layer-based model and the anti-forensic scenarios which can actually be applicable to each layer. Our suggested model, the Anti-Forensic Activites layer-based model, has 5 layers - the physical layer, network layer, OS layer, database application layer and data layer. Each layer has possible anti-forensic scenarios with detailed commands. Second, we propose a fuzzy expert system for effectively detecting anti-forensic activities. Some anti-forensic activities are hardly distinguished from normal activities. So, we use fuzzy logic for handling ambiguous data. We make rule sets with extracted commands and their arguments from pre-defined scenarios and the fuzzy expert system learns the rule sets. With this system, we can detect anti-forensic activities in real time when performing live forensic.
Kernel-level Software instrumentation via Light-weight Dynamic Binary Translation
Lee, Dong-Woo ; Kim, Jee-Hong ; Eom, Young-Ik ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 63~72
Binary translation is a kind of the emulation method which converts a binary code compiled on the particular instruction set architecture to the new binary code that can be run on another one. It has been mostly used for migrating legacy systems to new architecture. In recent, binary translation is used for instrumenting programs without modifying source code, because it enables inserting additional codes dynamically, For general application, there already exists some instrumentation software using binary translation, such as dynamic binary analyzers and virtual machine monitors. On the other hand, in order to be benefited from binary translation in kernel-level, a few issues, which include system performance, memory management, privileged instructions, and synchronization, should be treated. These matters are derived from the structure of the kernel, and the difference between the kernel and user-level application. In this paper, we present a scheme to apply binary translation and dynamic instrumentation on kernel. We implement it on Linux kernel and demonstrate that kernel-level binary translation adds an insignificant overhead to performance of the system.
Relation Extraction based on Composite Kernel combining Pattern Similarity of Predicate-Argument Structure
Jeong, Chang-Hoo ; Choi, Sung-Pil ; Choi, Yun-Soo ; Song, Sa-Kwang ; Chun, Hong-Woo ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 73~85
Lots of valuable textual information is used to extract relations between named entities from literature. Composite kernel approach is proposed in this paper. The composite kernel approach calculates similarities based on the following information:(1) Phrase structure in convolution parse tree kernel that has shown encouraging results. (2) Predicate-argument structure patterns. In other words, the approach deals with syntactic structure as well as semantic structure using a reciprocal method. The proposed approach was evaluated using various types of test collections and it showed the better performance compared with those of previous approach using only information from syntactic structures. In addition, it showed the better performance than those of the state of the art approach.
Video Summarization Using Importance-based Fuzzy One-Class Support Vector Machine
Kim, Ki-Joo ; Choi, Young-Sik ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 87~100
In this paper, we address a video summarization task as generating both visually salient and semantically important video segments. In order to find salient data points, one can use the OC-SVM (One-class Support Vector Machine), which is well known for novelty detection problems. It is, however, hard to incorporate into the OC-SVM process the importance measure of data points, which is crucial for video summarization. In order to integrate the importance of each point in the OC-SVM process, we propose a fuzzy version of OC-SVM. The Importance-based Fuzzy OC-SVM weights data points according to the importance measure of the video segments and then estimates the support of a distribution of the weighted feature vectors. The estimated support vectors form the descriptive segments that best delineate the underlying video content in terms of the importance and salience of video segments. We demonstrate the performance of our algorithm on several synthesized data sets and different types of videos in order to show the efficacy of the proposed algorithm. Experimental results showed that our approach outperformed the well known traditional method.
Car Collision Verification System for the Ubiquitous Parking Management
Mateo, Romeo Mark A. ; Yang, Hyun-Ho ; Lee, Jae-Wan ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 101~111
Most researches in WSN-based parking management system used wireless sensors to monitor the events in a car parking area. However, the problem of car collisions in car parks was not discussed by previous researches. The car position details over time are vital in analyzing a collision event. This paper proposes a collision verification method to detect and to analyze the collision event in the parking area, and then notifies car owners. The detection uses the information from motion sensors for comprehensive details of position and direction of a moving car, and the verification processes an object tracking technique with a fast OBB intersection test. The performance tests show that the location technique is more accurate with additional sensors and the OBB collision test is faster compared to a normal OBB intersection test.
Customized Knowledge Creation Framework using Context- and intensity-based Similarity
Sohn, Mye M. ; Lee, Hyun-Jung ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 113~125
As information resources have become more various and the number of the resources has increased, knowledge customization on the social web has been becoming more difficult. To reduce the burden, we offer a framework for context-based similarity calculation for knowledge customization using ontology on the CBR. Thereby, we newly developed context- and intensity-based similarity calculation methods which are applied to extraction of the most similar case considered semantic similarity and syntactic, and effective creation of the user-tailored knowledge using the selected case. The process is comprised of conversion of unstructured web information into cases, extraction of an appropriate case according to the user requirements, and customization of the knowledge using the selected case. In the experimental section, the effectiveness of the developed similarity methods are compared with other edge-counting similarity methods using two classes which are compared with each other. It shows that our framework leads higher similarity values for conceptually close classes compared with other methods.
Explicating Factors explaining Self-Disclosure in the Usage of Micro-blog
Lee, Sung-Joon ; Kim, Yong-Won ; Lee, Bong Gyou ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 127~136
The current study aims to examine what determinants have influences on voluntary self-disclosure in the usage of micro-blogging. Even though the usages of micro-blogging have increased at an exponential rate in South Korea, it has been not well understood the process in which people voluntarily disclose their self-information. In this regard, we tried to examine self-disclosure process on micro-blogging based on Theory of Planned Behavior (TPB). For this purpose, attitudes towards self-disclosure, subjective norm, and perceived behavioral control were set as the antecedents to self-disclosure behavior. The influences of factors including privacy concern, playfulness, informational motivation for social participation, and relational motivation on the attitude were also investigated. The results of an online survey revealed that attitude toward self-disclosure, subjective norm, and perceived behavioral control anticipated the self-disclosure behavior at a statistically significant level. The attitude was not influenced by privacy concern, informational and relational motivation, but by playfulness. The implications of these results are also discussed.
A Study on the Impacts of SNS Usage on the Relationship and Effectiveness of Local Administration PR: Local Government vs. Residents Perspectives
Seo, Hyun-Sik ; Song, In-Kuk ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 137~158
The study aims to determine whether SNS Usage has significantly influence on local administration PR. With the advance in information and communication technologies, many administrative organizations began to work in public relation to their residents via SNS. Nowadays SNS is transforming practical standpoints from forming public opinion through communication message to forming relationship with their residents. Therefore the needs to identify the relationship of the administrative organizations and their residents are demanded with the needs to investigate impact levels of SNS use on the relationships. While there are many researches to simply identify the features of SNS and to introduce local administration, the research investigating the sequential impacts of SNS use on local adminstration PR does not exist. The study targeted a borough office and its residents and compare those two groups. Findings illustrate that the SNS usage of administrative organizations suffer from the shortage of resident's feedback. Finally the study recommends the various issue developments to strike chord with their residents to utilize SNS use in local governmental organizations.
The effect of auction frequency and transaction volume on auction performance in internet auction
Park, Jong-Han ; Kim, Hyun-Woo ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 159~170
In procurement auctions, auction frequency and transaction volume per auction have been analyzed as important factors in determining auction performance. However, there is no empirical study on the effect of auction frequency and transaction volume in procurement auction. Current studies mainly focus on bidder behavior analysis and new system design in procurement auction. In the study, we analyze the effect of two factors on relative winning price empirically by using real auction data from MRO procurement outsourcing company in Korea. From the results, we find the winning price is lower when the frequency of auction with same item category is lower. The low frequency of auctions means participating bidders have limited information of previous auctions and they bid their best price to win the current auction due to less opportunity of reopening the auction in near future. The larger purchase amounts of MRO items didn’t results in lower winning price, contrary to our hypothesis. The possible reason is that the price of MRO items already reflects the economy of scales and the increased volume per auction do not cause the further discount of MRO items from the auction.
A Study on Creative Cognition of Language based concept Generation of Game Graphics
Huh, Yoon-Jung ;
Journal of Internet Computing and Services, volume 12, issue 5, 2011, Pages 171~179
In this paper it is hypothesized that word stimuli that are presented by Google’s search word, would improve the quality of the design solution, so this research examines the effect of related search word stimuli in concept generation and analyzes the results through the processes of creative cognition. In the process of concept generation, words are given as stimuli which are generated through Google's related search and these search words are given by 5 levels. Google search is based on the collaboration philosophy. People's participation and contribution recreate knowledge and information, so these renewed and related search words update in real time by people are used as stimuli. Two problems are provided with related search words. After the design concept generation the results are analyzed by 3 bases: the usage of related search words and those of frequency, creativity, and Finke's 12 Geneplore model. These are the results of the research. Many levels of related search words are used in design concept generation but especially higher levels which are more related to search words are more used than lower levels. The usage of multi words and conjunction with higher levels and lower levels words are observed in creative results. On the creative cognitive processes, it is more creative when using association and mental transformation with the related search words than using the related search words simply. Creative outputs also use conceptual interpretation, functional inference, and contextual shifting of creative cognitive processes of Finke's 12 Geneplore model.