Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Information Processing Systems
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 10, Issue 4 - Dec 2014
Volume 10, Issue 3 - Sep 2014
Volume 10, Issue 2 - Jun 2014
Volume 10, Issue 1 - Mar 2014
Selecting the target year
On the Performance of Oracle Grid Engine Queuing System for Computing Intensive Applications
Kolici, Vladi ; Herrero, Albert ; Xhafa, Fatos ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 491~502
DOI : 10.3745/JIPS.01.0004
In this paper we present some research results on computing intensive applications using modern high performance architectures and from the perspective of high computational needs. Computing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications distinguish for their demanding needs for CPU computing, independently of the amount of data associated with the problem instance. Among computing intensive applications, there are applications based on simulations, aiming to maximize system resources for processing large computations for simulation. In this research work, we consider an application that simulates scheduling and resource allocation in a Grid computing system using Genetic Algorithms. In such application, a rather large number of simulations is needed to extract meaningful statistical results about the behavior of the simulation results. We study the performance of Oracle Grid Engine for such application running in a Cluster of high computing capacities. Several scenarios were generated to measure the response time and queuing time under different workloads and number of nodes in the cluster.
Graphemes Segmentation for Arabic Online Handwriting Modeling
Boubaker, Houcine ; Tagougui, Najiba ; El Abed, Haikal ; Kherallah, Monji ; Alimi, Adel M. ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 503~522
DOI : 10.3745/JIPS.02.0006
In the cursive handwriting recognition process, script trajectory segmentation and modeling represent an important task for large or open lexicon context that becomes more complicated in multi-writer applications. In this paper, we will present a developed system of Arabic online handwriting modeling based on graphemes segmentation and the extraction of its geometric features. The main contribution consists of adapting the Fourier descriptors to model the open trajectory of the segmented graphemes. To segment the trajectory of the handwriting, the system proceeds by first detecting its baseline by checking combined geometric and logic conditions. Then, the detected baseline is used as a topologic reference for the extraction of particular points that delimit the graphemes` trajectories. Each segmented grapheme is then represented by a set of relevant geometric features that include the vector of the Fourier descriptors for trajectory shape modeling, normalized metric parameters that model the grapheme dimensions, its position in respect to the baseline, and codes for the description of its associated diacritics.
The Accuracy of the Non-continuous I Test for One-Dimensional Arrays with References Created by Induction Variables
Zhang, Qing ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 523~542
DOI : 10.3745/JIPS.01.0005
One-dimensional arrays with subscripts formed by induction variables in real programs appear quite frequently. For most famous data dependence testing methods, checking if integer-valued solutions exist for one-dimensional arrays with references created by induction variable is very difficult. The I test, which is a refined combination of the GCD and Banerjee tests, is an efficient and precise data dependence testing technique to compute if integer-valued solutions exist for one-dimensional arrays with constant bounds and single increments. In this paper, the non-continuous I test, which is an extension of the I test, is proposed to figure out whether there are integer-valued solutions for one-dimensional arrays with constant bounds and non-sing ularincrements or not. Experiments with the benchmarks that have been cited from Livermore and Vector Loop, reveal that there are definitive results for 67 pairs of one-dimensional arrays that were tested.
Design and Implementation of a Content Model for m-Learning
Shon, Jin Gon ; Kim, Byoung Wook ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 543~554
DOI : 10.3745/JIPS.04.0010
It is difficult for mobile learners to maintain a high level of concentration when learning content for more than an hour while they are on the move. Despite the attention span issue, many m-learning systems still provide their mobile learners with the same content once used in e-learning systems. This has called for an investigation to identify the suitable characteristics of the m-learning environment. With this in mind, we have conducted a survey in hopes of determining the requirements for developing more suitable m-learning content. Based on the results of the survey, we have developed a content model comprised of two types: a segment type and a supplement type. In addition, we have implemented a prototype system of the content model for Apple iPhones and Android smartphones in order to investigate a feasibility study of the model application.
Multimodal Biometric Using a Hierarchical Fusion of a Person`s Face, Voice, and Online Signature
Elmir, Youssef ; Elberrichi, Zakaria ; Adjoudj, Reda ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 555~567
DOI : 10.3745/JIPS.02.0007
Biometric performance improvement is a challenging task. In this paper, a hierarchical strategy fusion based on multimodal biometric system is presented. This strategy relies on a combination of several biometric traits using a multi-level biometric fusion hierarchy. The multi-level biometric fusion includes a pre-classification fusion with optimal feature selection and a post-classification fusion that is based on the similarity of the maximum of matching scores. The proposed solution enhances biometric recognition performances based on suitable feature selection and reduction, such as principal component analysis (PCA) and linear discriminant analysis (LDA), as much as not all of the feature vectors components support the performance improvement degree.
Performance Evaluation of the WiMAX Network under a Complete Partitioned User Group with a Traffic Shaping Algorithm
Akhter, Jesmin ; Islam, Md. Imdadul ; Amin, M.R. ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 568~580
DOI : 10.3745/JIPS.03.0016
To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.
An Unified Representation of Context Knowledge Base for Mobile Context-Aware System
Jeong, Jang-Seop ; Bang, Dae-Wook ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 581~588
DOI : 10.3745/JIPS.01.0002
To facilitate the implementation of a wide variety of context-aware applications based on mobile devices, general-purpose context-aware framework that applications can use by calling is needed. The context-aware framework is a middleware that performs the sensing, reasoning, and retrieving based on the knowledge base. The knowledge base must systematically represent the information required on the behavior of the context-aware framework, such as context information and reasoning information. It must also provide functions for storage and retrieval. To date, previous research on the representation of the context information have been carried out, but studies on the unified representation of the knowledge base has seen little progress. This study defines the knowledge base as the unified context information, and proposes the UniOWL, which can do a good job of representing it. UniOWL is based on OWL and represents the information that is necessary for the operation of the context-aware framework. Therefore, UniOWL greatly facilitates the implementation of the knowledge base on a context-aware framework.
An Efficient Color Edge Detection Using the Mahalanobis Distance
Khongkraphan, Kittiya ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 589~601
DOI : 10.3745/JIPS.02.0010
The performance of edge detection often relies on its ability to correctly determine the dissimilarities of connected pixels. For grayscale images, the dissimilarity of two pixels is estimated by a scalar difference of their intensities and for color images, this is done by using the vector difference (color distance) of the three-color components. The Euclidean distance in the RGB color space typically measures a color distance. However, the RGB space is not suitable for edge detection since its color components do not coincide with the information human perception uses to separate objects from backgrounds. In this paper, we propose a novel method for color edge detection by taking advantage of the HSV color space and the Mahalanobis distance. The HSV space models colors in a manner similar to human perception. The Mahalanobis distance independently considers the hue, saturation, and lightness and gives them different degrees of contribution for the measurement of color distances. Therefore, our method is robust against the change of lightness as compared to previous approaches. Furthermore, we will introduce a noise-resistant technique for determining image gradients. Various experiments on simulated and real-world images show that our approach outperforms several existing methods, especially when the images vary in lightness or are corrupted by noise.
Traffic Analysis of a Cognitive Radio Network Based on the Concept of Medium Access Probability
Khan, Risala T. ; Islam, Md. Imdadul ; Amin, M.R. ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 602~617
DOI : 10.3745/JIPS.03.0019
The performance of a cognitive radio network (CRN) solely depends on how precisely the secondary users can sense the presence or absence of primary users. The incorporation of a spatial false alarm makes deriving the probability of a correct decision a cumbersome task. Previous literature performed this task for the case of a received signal under a Normal probability density function case. In this paper we enhance the previous work, including the impact of carrier frequency, the gain of antennas on both sides, and antenna heights so as to observe the robustness against noise and interference and to make the correct decision of detection. Three small scale fading channels: Rayleigh, Normal, and Weibull were considered to get the real scenario of a CRN in an urban area. The incorporation of a maximal-ratio combining and selection combing with a variation of the number of received antennas have also been studied in order to achieve the correct decision of spectral sensing, so as to serve the cognitive users. Finally, we applied the above concept to a traffic model of the CRN, which we based on a two-dimensional state transition chain.
A Step towards User Privacy while Using Location-Based Services
Abbas, Fizza ; Oh, Heekuck ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 618~627
DOI : 10.3745/JIPS.01.0003
Nowadays mobile users are using a popular service called Location-Based Services (LBS). LBS is very helpful for a mobile user in finding various Point of Interests (POIs) in their vicinity. To get these services, users must provide their personal information, such as user identity or current location, which severely risks the location privacy of the user. Many researchers are developing schemes that enable a user to use these LBS services anonymously, but these approaches have some limitations (i.e., either the privacy prevention mechanism is weak or the cost of the solution is too much). As such, we are presenting a robust scheme for mobile users that allows them to use LBS anonymously. Our scheme involves a client side application that interacts with an untrusted LBS server to find the nearest POI for a service required by a user. The scheme is not only efficient in its approach, but is also very practical with respect to the computations that are done on a client`s resource constrained device. With our scheme, not only can a client anonymously use LBS without any use of a trusted third party, but also a server`s database is completely secure from the client. We performed experiments by developing and testing an Android-based client side smartphone application to support our argument.
Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches
Cao, Qi ; Fujita, Satoshi ;
Journal of Information Processing Systems, volume 10, issue 4, 2014, Pages 628~645
DOI : 10.3745/JIPS.03.0020
In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users` preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.