In our JIPS digital library, you can find 1) Full Text (XML), 2) Pub Reader Text (XML),      and 3) ePub file for each manuscript published since 2015.
From submission to final decision: less than 6 months !


 Vol. 11 (2015)
 Vol. 10 (2014)
 Vol. 9 (2013)
 Vol. 8 (2012)
 Vol. 7 (2011)
 Vol. 6 (2010)
 Vol. 5 (2009)
 Vol. 4 (2008)
 Vol. 3 (2007)
 Vol. 2 (2006)
 Vol. 1 (2005)


Journal Cover


All publications of JIPS are indexed in SCOPUS, DOI, EI COMPENDEX, DBLP, EBSCO, Google and Google scholar.










JIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).
The Journal of Information Processing Systems (ISSN: 1976-913X(Print), ISSN: 2092-805X(Online)) is the official international journal of the Korea Information Processing Society. As information processing systems are progressing at a rapid pace, the Korea Information Processing Society is committed to providing researchers and other professionals with the academic information and resources they need to keep abreast with ongoing developments. The JIPS aims to be a premier source that enables researchers and professionals all over the world to promote, share, and discuss all major research issues and developments in the field of information processing systems and other related fields.

On the Performance of Oracle Grid Engine Queuing System for Computing Intensive Applications
Vladi Kolici, Albert Herrero and Fatos Xhafa Vol. 10, No.4, 2014

Training-Free Fuzzy Logic Based Human Activity Recognition
Eunju Kim and Sumi Helal Vol. 10, No.3, 2014

Janus - Multi Source Event Detection and Collection System for Effective Surveillance of Criminal Activity
Cyrus Shahabi, Seon Ho Kim, Luciano Nocera, Giorgos Constantinou, Ying Lu, Yinghao Cai, Gérard Medioni, Ramakant Nevatia and Farnoush Banaei-Kashani Vol. 10, No.1, 2014

The Confinement Problem: 40 Years Later
Alex Crowell, Beng Heng Ng, Earlence Fernandes and Atul Prakash Vol. 9, No.2, 2013

An Adaptive Approach to Learning the Preferences of Users in a Social Network Using Weak Estimators
B. John Oommen, Anis Yazidi and Ole-Christoffer Granmo Vol. 8, No.2, 2012

Indoor Link Quality Comparison of IEEE 802.11a Channels in a Multi-radio Mesh Network Testbed
Asitha U Bandaranayake, Vaibhav Pandit and Dharma P. Agrawal Vol. 8, No.1, 2012

A Survey of RFID Deployment and Security Issues
Amit Grover and Hal Berghel Vol. 7, No.4, 2011

The Principle of Justifiable Granularity and an Optimization of Information Granularity Allocation as Fundamentals of Granular Computing
Witold Pedrycz Vol. 7, No.3, 2011

CASPER: Congestion Aware Selection of Path with Efficient Routing in Multimedia Networks
Mohammad S. Obaidat, Sanjay K. Dhurandher and Khushboo Diwakar Vol. 7, No.2, 2011

An Efficient Broadcast Technique for Vehicular Networks
Ai Hua Ho, Yao H. Ho, Kien A. Hua, Roy Villafane and Han-Chieh Chao Vol. 7, No.2, 2010

Security Properties of Domain Extenders for Cryptographic Hash Functions
Elena Andreeva, Bart Mennink and Bart Preneel Vol. 6, No.4, 2010

Hiding Secret Data in an Image Using Codeword Imitation
Zhi-Hui Wang, Chin-Chen Chang and Pei-Yu Tsai Vol. 6, No.4, 2010

DEESR: Dynamic Energy Efficient and Secure Routing Protocol for Wireless Sensor Networks in Urban Environments
Mohammad S. Obaidat, Sanjay K. Dhurandher, Deepank Gupta, Nidhi Gupta and Anupriya Asthana Vol. 6, No.3, 2010

Challenges to Next Generation Services in IP Multimedia Subsystem
Kai-Di Chang, Chi-Yuan Chen, Jiann-Liang Chen and Han-Chieh Chao Vol. 6, No.2, 2010

TOSS: Telecom Operations Support Systems for Broadband Services
Yuan-Kai Chen, Chang-Ping Hsu, Chung-Hua Hu, Rong-Syh Lin, Yi-Bing Lin, Jian-Zhi Lyu, Wudy Wu and Heychyi Young Vol. 6, No.1, 2010

Providing Efficient Secured Mobile IPv6 by SAG and Robust Header Compression
Tin-Yu Wu, Han-Chieh Chao and Chi-Hsiang Lo Vol. 5, No.3, 2009

A Survey of Face Recognition Techniques
Rabia Jafri and Hamid R Arabnia Vol. 5, No.2, 2009


Journal of Information Processing Systems, Vol. 11, No.3, 2015

A Dataset of Online Handwritten Assamese Characters
Udayan Baruah and Shyamanta M. Hazarika
Page: 325~341

Show / Hide Abstract
This paper describes the Tezpur University dataset of online handwritten Assamese characters. The online data acquisition process involves the capturing of data as the text is written on a digitizer with an electronic pen. A sensor picks up the pen-tip movements, as well as pen-up/pen-down switching. The dataset contains 8,235 isolated online handwritten Assamese characters. Preliminary results on the classification of online handwritten Assamese characters using the above dataset are presented in this paper. The use of the support vector machine classifier and the classification accuracy for three different feature vectors are explored in our research.
Sparse Channel Estimation of Single Carrier Frequency Division Multiple Access Based on Compressive Sensing
Yuan-Hong Zhong, Zhi-Yong Huang, Bin Zhu and Hua Wu
Page: 342~353

Show / Hide Abstract
It is widely accepted that single carrier frequency division multiple access (SC-FDMA) is an excellent candidate for broadband wireless systems. Channel estimation is one of the key challenges in SC-FDMA, since accurate channel estimation can significantly improve equalization at the receiver and, consequently, enhance the communication performances. In this paper, we study the application of compressive sensing for sparse channel estimation in a SC-FDMA system. By skillfully designing pilots, their patterns, and taking advantages of the sparsity of the channel impulse response, the proposed system realizes channel estimation at a low cost. Simulation results show that it can achieve significantly improved performance in a frequency selective fading sparse channel with fewer pilots.
A Review of Fixed-Complexity Vector Perturbation for MU-MIMO
Manar Mohaisen
Page: 354~369

Show / Hide Abstract
Recently, there has been an increasing demand of high data rates services, where several multiuser multiple- input multiple-output (MU-MIMO) techniques were introduced to meet these demands. Among these tech- niques, vector perturbation combined with linear precoding techniques, such as zero-forcing and minimum mean-square error, have been proven to be efficient in reducing the transmit power and hence, perform close to the optimum algorithm. In this paper, we review several fixed-complexity vector perturbation techniques and investigate their performance under both perfect and imperfect channel knowledge at the transmitter. Also, we investigate the combination of block diagonalization with vector perturbation outline its merits.
Simple Pyramid RAM-Based Neural Network Architecture for Localization of Swarm Robots
Siti Nurmaini and Ahmad Zarkasi
Page: 370~388

Show / Hide Abstract
The localization of multi-agents, such as people, animals, or robots, is a requirement to accomplish several tasks. Especially in the case of multi-robotic applications, localization is the process for determining the positions of robots and targets in an unknown environment. Many sensors like GPS, lasers, and cameras are utilized in the localization process. However, these sensors produce a large amount of computational resources to process complex algorithms, because the process requires environmental mapping. Currently, combination multi-robots or swarm robots and sensor networks, as mobile sensor nodes have been widely available in indoor and outdoor environments. They allow for a type of efficient global localization that demands a relatively low amount of computational resources and for the independence of specific environmental features. However, the inherent instability in the wireless signal does not allow for it to be directly used for very accurate position estimations and making difficulty associated with conducting the localization processes of swarm robotics system. Furthermore, these swarm systems are usually highly decentralized, which makes it hard to synthesize and access global maps, it can be decrease its flexibility. In this paper, a simple pyramid RAM-based Neural Network architecture is proposed to improve the localization process of mobile sensor nodes in indoor environments. Our approach uses the capabilities of learning and generalization to reduce the effect of incorrect information and increases the accuracy of the agent’s position. The results show that by using simple pyramid RAM-base Neural Network approach, produces low computational resources, a fast response for processing every changing in environmental situation and mobile sensor nodes have the ability to finish several tasks especially in localization processes in real time.
A Column-Aware Index Management Using Flash Memory for Read-Intensive Databases
Si-Woo Byun and Seok-Woo Jang
Page: 389~405

Show / Hide Abstract
Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce a column-oriented database model based on flash memory and then propose a new column-aware flash indexing scheme for the high-speed column-oriented data warehouse systems. Our index management scheme, which uses an enhanced B+-Tree, achieves superior search performance by indexing an embedded segment and packing an unused space in internal and leaf nodes. Based on the performance results of two test databases, we concluded that the column-aware flash index management outperforms the traditional scheme in the respect of the mixed operation throughput and its response time.
Robust and Reversible Image Watermarking Scheme Using Combined DCT-DWT-SVD Transforms
Souad Bekkouch and Kamel Mohamed Faraoun
Page: 406~420

Show / Hide Abstract
We present a secure and robust image watermarking scheme that uses combined reversible DWT-DCT-SVD transformations to increase integrity, authentication, and confidentiality. The proposed scheme uses two different kinds of watermarking images: a reversible watermark, W1, which is used for verification (ensuring integrity and authentication aspects); and a second one, W2, which is defined by a logo image that provides confidentiality. Our proposed scheme is shown to be robust, while its performances are evaluated with respect to the peak signal-to-noise ratio (PSNR), signal-to-noise ratio (SNR), normalized cross-correlation (NCC), and running time. The robustness of the scheme is also evaluated against different attacks, including a compression attack and Salt & Pepper attack.
Classification of Textured Images Based on Discrete Wavelet Transform and Information Fusion
Chaimae Anibou, Mohammed Nabil Saidi and Driss Aboutajdine
Page: 421~437

Show / Hide Abstract
This paper aims to present a supervised classification algorithm based on data fusion for the segmentation of the textured images. The feature extraction method we used is based on discrete wavelet transform (DWT). In the segmentation stage, the estimated feature vector of each pixel is sent to the support vector machine (SVM) classifier for initial labeling. To obtain a more accurate segmentation result, two strategies based on infor- mation fusion were used. We first integrated decision-level fusion strategies by combining decisions made by the SVM classifier within a sliding window. In the second strategy, the fuzzy set theory and rules based on probability theory were used to combine the scores obtained by SVM over a sliding window. Finally, the per- formance of the proposed segmentation algorithm was demonstrated on a variety of synthetic and real images and showed that the proposed data fusion method improved the classification accuracy compared to applying a SVM classifier. The results revealed that the overall accuracies of SVM classification of textured images is 88%, while our fusion methodology obtained an accuracy of up to 96%, depending on the size of the data base.
A Lightweight and Effective Music Score Recognition on Mobile Phones
Tam Nguyen and Gueesang Lee
Page: 438~449

Show / Hide Abstract
Recognition systems for scanned or printed music scores that have been implemented on personal computers have received attention from numerous scientists and have achieved significant results over many years. A modern trend with music scores being captured and played directly on mobile devices has become more interesting to researchers. The limitation of resources and the effects of illumination, distortion, and inclination on input images are still challenges to these recognition systems. In this paper, we introduce a novel approach for recognizing music scores captured by mobile cameras. To reduce the complexity, as well as the computational time of the system, we grouped all of the symbols extracted from music scores into ten main classes. We then applied each major class to SVM to classify the musical symbols separately. The experimental results showed that our proposed method could be applied to real time applications and that its performance is competitive with other methods.
Comparative Study of Various Persian Stemmers in the Field of Information Retrieval
Fatemeh Momenipour Moghadam and MohammadReza Keyvanpour
Page: 450~464

Show / Hide Abstract
In linguistics, stemming is the operation of reducing words to their more general form, which is called the ‘stem’. Stemming is an important step in information retrieval systems, natural language processing, and text mining. Information retrieval systems are evaluated by metrics like precision and recall and the fundamental superiority of an information retrieval system over another one is measured by them. Stemmers decrease the indexed file, increase the speed of information retrieval systems, and improve the performance of these sys- tems by boosting precision and recall. There are few Persian stemmers and most of them work based on mor- phological rules. In this paper we carefully study Persian stemmers, which are classified into three main clas- ses: structural stemmers, lookup table stemmers, and statistical stemmers. We describe the algorithms of each class carefully and present the weaknesses and strengths of each Persian stemmer. We also propose some metrics to compare and evaluate each stemmer by them.
An Enhanced Message Priority Mechanism in IEEE 802.11p Based Vehicular Networks
Chang Liu, Sang-Hwa Chung, Han-You Jeong and Ik-Joo Jung
Page: 465~482

Show / Hide Abstract
IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.
Performance Comparison of HEVC and H.264/AVC Standards in Broadcasting Environments
Maheshi B. Dissanayake and Dilanga L. B. Abeyrathna
Page: 483~494

Show / Hide Abstract
High Efficiency Video Coding (HEVC) is the most recent video codec standard of the ITU-T Video Coding Experts Group and the ISO/IEC Moving Picture Experts Group. The main goal of this newly introduced standard is for catering to high-resolution video in low bandwidth environments with a higher compression ratio. This paper provides a performance comparison between HEVC and H.264/AVC video compression standards in terms of objective quality, delay, and complexity in the broadcasting environment. The experimental investigation was carried out using six test sequences in the random access configuration of the HEVC test model (HM), the HEVC reference software. This was also carried out in similar configuration settings of the Joint Scalable Video Module (JSVM), the official scalable H.264/AVC reference implementation, running on a single layer mode. According to the results obtained, the HM achieves more than double the compression ratio compared to that of JSVM and delivers the same video quality at half the bitrate. Yet, the HM encodes two times slower (at most) than JSVM. Hence, it can be concluded that the application scenarios of HM and JSVM should be judiciously selected considering the availability of system resources. For instance, HM is not suitable for low delay applications, but it can be used effectively in low bandwidth environments.


Since 2005, all papers published in the JIPS are subjected to a peer review and upon acceptance are immediately made permanently available free of charge for everyone worldwide to read and download from the journal’s homepage ( without any subscription fee or personal registration. This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

The KIPS waives paper processing charges for submissions from international authors as well as society members. This waiver policy supports and encourages the publication of quality papers, making the journal an international forum for the exchange of different ideas and experiences.


With regard to ethical standards, the JIPS takes plagiarism very seriously and thoroughly checks all articles. The JIPS defines research ethics as securing objectivity and accuracy in the execution of research and the conclusion of results without any unintentional errors resulting from negligence or incorrect knowledge, etc. and without any intentional misconduct such as falsification, plagiarism, etc. When an author submits a paper to the JIPS online submission and peer-review system, he/she should also upload the separate file "author check list" which contains a statement that all his/her research has been performed in accordance with ethical standards.

Among the JIPS editorial board members, there are four associate manuscript editors who support the JIPS by dealing with any ethical problems associated with the publication process and give advice on how to handle cases of suspected research and publication misconduct. When the JIPS managing editor looks over submitted papers and checks that they are suitable for further processing, the managing editor also routes them to the CrossCheck service provided by iTenticate. Based on the results provided by the CrossCheck service, the JIPS associate manuscript editors inform the JIPS editor-in-chief of any plagiarism that is detected in a paper. Then, the JIPS editor-in-chief communicates such detection to the author(s) while rejecting the paper.


Ever since information processing became one of the most important industries in the country, computing professionals have encountered a growing number of challenges. Along with scholars and colleagues in related fields, they have gathered together at a variety of forums and meetings over the last few decades to share their knowledge and experiences, and the outcomes of their research. These exchanges led to the founding of the Korea Information Processing Society (KIPS) on January 15, 1993. The KIPS was registered as an incorporated association under the Ministry of Science, ICT and Future Planning under the government of the Republic of Korea. The main purpose of the KIPS organization is to improve our society by achieving the highest capability possible in the domain of information technology. As such, it focuses on close collaboration with the nation’s industry, academic, and research communities to foster technological innovation, to enhance its members' careers, and to promote the advanced information processing industry.

JIPS Secretary: Joo-yeon Lee (

copyright 1002ho Yongsungbiztel 314-1 2ga Hankangro Yongsan-gu, Seoul, 140-750 Republic of Korea
Phone: +82-2-2077-1414 Fax: +82-2-2077-1472. Copyright © 2005-2015 KIPS all rights reserved.