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, 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.1, 2015

Personalizing Information Using Users’ Online Social Networks: A Case Study of CiteULike
Danielle Lee*
Page: 1~21

Show / Hide Abstract
This paper aims to assess the feasibility of a new and less-focused type of online sociability (the watching network) as a useful information source for personalized recommendations. In this paper, we recommend scientific articles of interests by using the shared interests between target users and their watching connections. Our recommendations are based on one typical social bookmarking system, CiteULike. The watching network-based recommendations, which use a much smaller size of user data, produces suggestions that are as good as the conventional Collaborative Filtering technique. The results demonstrate that the watching network is a useful information source and a feasible foundation for information personalization. Furthermore, the watching network is substitutable for anonymous peers of the Collaborative Filtering recommendations. This study shows the expandability of social network-based recommendations to the new type of online social networks.
GMM-Based Maghreb Dialect IdentificationSystem
Lachachi Nour-Eddine* and Adla Abdelkader*
Page: 22~38

Show / Hide Abstract
While Modern Standard Arabic is the formal spoken and written language of the Arab world; dialects are the major communication mode for everyday life. Therefore, identifying a speaker’s dialect is critical in the Arabic-speaking world for speech processing tasks, such as automatic speech recognition or identification. In this paper, we examine two approaches that reduce the Universal Background Model (UBM) in the automatic dialect identification system across the five following Arabic Maghreb dialects: Moroccan, Tunisian, and 3 dialects of the western (Oranian), central (Algiersian), and eastern (Constantinian) regions of Algeria. We applied our approaches to the Maghreb dialect detection domain that contains a collection of 10-second utterances and we compared the performance precision gained against the dialect samples from a baseline GMM-UBM system and the ones from our own improved GMM-UBM system that uses a Reduced UBM algorithm. Our experiments show that our approaches significantly improve identification performance over purely acoustic features with an identification rate of 80.49%.
A Real-Time Integrated Hierarchical Temporal Memory Network for the Real-Time Continuous Multi-Interval Prediction of Data Streams
Hyun-Syug Kang*
Page: 39~56

Show / Hide Abstract
Continuous multi-interval prediction (CMIP) is used to continuously predict the trend of a data stream based on various intervals simultaneously. The continuous integrated hierarchical temporal memory (CIHTM) network performs well in CMIP. However, it is not suitable for CMIP in real-time mode, especially when the number of prediction intervals is increased. In this paper, we propose a real-time integrated hierarchical temporal memory (RIHTM) network by introducing a new type of node, which is called a Zeta1FirstSpecializedQueueNode (ZFSQNode), for the real-time continuous multi-interval prediction (RCMIP) of data streams. The ZFSQNode is constructed by using a specialized circular queue (sQUEUE) together with the modules of original hierarchical temporal memory (HTM) nodes. By using a simple structure and the easy operation characteristics of the sQUEUE, entire prediction operations are integrated in the ZFSQNode. In particular, we employed only one ZFSQNode in each level of the RIHTM network during the prediction stage to generate different intervals of prediction results. The RIHTM network efficiently reduces the response time. Our performance evaluation showed that the RIHTM was satisfied to continuously predict the trend of data streams with multi-intervals in the real-time mode.
Selection of the Best Two-Hop AF Wireless Link under Multiple Antenna Schemes over a Fading Channel
Abu Sayed Md. Mostafizur Rahaman*, Md. Imdadul Islam* and M.R. Amin**
Page: 57~75

Show / Hide Abstract
In evaluating the performance of a dual-hop wireless link, the effects of large and small scale fading has to be considered. To overcome this fading effect, several schemes, such as multiple-input multiple-output (MIMO) with orthogonal space time block codes (OSTBC), different combining schemes at the relay and receiving end, and orthogonal frequency division multiplexing (OFDM) are used in both the transmitting and the relay links. In this paper, we first make compare the performance of a two-hop wireless link under a different combination of space diversity in the first and second hop of the amplify-and-forward (AF) case. Our second task in this paper is to incorporate the weak signal of a direct link and then by applying the channel model of two random variables (one for a direct link and another for a relayed link) we get very impressive result at a low signal-to-noise ratio (SNR) that is comparable with other models at a higher SNR. Our third task is to bring other three schemes under a two-hop wireless link: use of transmit antenna selection (TAS) on both link with weak direct link, distributed Alamouti scheme in two-hop link and single relay antenna with OFDM sub- carrier. Finally, all of the schemes mentioned above are compared to select the best possible model. The main finding of the paper is as follows: the use of MIMO on both hops but application TAS on both links with weak direct link and the full rate OFDM with the sub-carrier for an individual link provide a better result as compared to other models.
Viewer’s Affective Feedback for Video Summarization
Majdi Dammak*, Ali Wali* and Adel M. Alimi*
Page: 76~94

Show / Hide Abstract
For different reasons, many viewers like to watch a summary of films without having to waste their time. Traditionally, video film was analyzed manually to provide a summary of it, but this costs an important amount of work time. Therefore, it has become urgent to propose a tool for the automatic video summarization job. The automatic video summarization aims at extracting all of the important moments in which viewers might be interested. All summarization criteria can differ from one video to another. This paper presents how the emotional dimensions issued from real viewers can be used as an important input for computing which part is the most interesting in the total time of a film. Our results, which are based on lab experiments that were carried out, are significant and promising.
A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags
Haejae Jung*
Page: 95~103

Show / Hide Abstract
This paper presents a memory efficient tree based anti-collision protocol to identify memoryless RFID (Radio Frequency Identification) tags that may be attached to products. The proposed deterministic scheme utilizes two bit arrays instead of stack or queue and requires only ?(n) space, which is better than the earlier schemes that use at least O(n2) space, where n is the length of a tag ID in a bit. Also, the size n of each bit array is independent of the number of tags to identify. Our simulation results show that our bit array scheme consumes much less memory space than the earlier schemes utilizing queue or stack.
Penetration Testing and Network Auditing: Linux
Deris Stiawan*, Mohd. Yazid Idris** and Abdul Hanan Abdullah**
Page: 104~115

Show / Hide Abstract
Along with the evolution of Internet and its new emerging services, the quantity and impact of attacks have been continuously increasing. Currently, the technical capability to attack has tended to decrease. On the contrary, performances of hacking tools are evolving, growing, simple, comprehensive, and accessible to the public. In this work, network penetration testing and auditing of the Redhat operating system (OS) are highlighted as one of the most popular OS for Internet applications. Some types of attacks are from a different side and new attack method have been attempted, such as: scanning for reconnaissance, guessing the password, gaining privileged access, and flooding the victim machine to decrease availability. Some analyses in network auditing and forensic from victim server are also presented in this paper. Our proposed system aims confirmed as hackable or not and we expect for it to be used as a reference for practitioners to protect their systems from cyber-attacks.
Energy Consumption Scheduling in a Smart Grid Including Renewable Energya Smart Grid Including Renewable Energy
Nadia Boumkheld*, **, Mounir Ghogho**, *** and Mohammed El Koutbi*
Page: 116~124

Show / Hide Abstract
Smart grids propose new solutions for electricity consumers as a means to help them use energy in an efficient way. In this paper, we consider the demand-side management issue that exists for a group of consumers (houses) that are equipped with renewable energy (wind turbines) and storage units (battery), and we try to find the optimal scheduling for their home appliances, in order to reduce their electricity bills. Our simulation results prove the effectiveness of our approach, as they show a significant reduction in electricity costs when using renewable energy and battery storage.
Fast Device Discovery for Remote Device Management in Lighting Control Networks
Sang-Il Choi*, Sanghun Lee*, Seok-Joo Koh*, Sang-Kyu Lim**, Insu Kim** and Tae-Gyu Kang**
Page: 125~133

Show / Hide Abstract
The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.
Spatial Interpolation of Meteorologic Variables in Vietnam using the Kriging Method
Xuan Thanh Nguyen*, Ba Tung Nguyen*, Khac Phong Do*, Quang Hung Bui*, Thi Nhat Thanh Nguyen*, Van Quynh Vuong** and Thanh Ha Le*
Page: 134~147

Show / Hide Abstract
This paper presents the applications of Kriging spatial interpolation methods for meteorologic variables, including temperature and relative humidity, in regions of Vietnam. Three types of interpolation methods are used, which are as follows: Ordinary Kriging, Universal Kriging, and Universal Kriging plus Digital Elevation model correction. The input meteorologic data was collected from 98 ground weather stations throughout Vietnam and the outputs were interpolated temperature and relative humidity gridded fields, along with their error maps. The experimental results showed that Universal Kriging plus the digital elevation model correction method outperformed the two other methods when applied to temperature. The interpolation effectiveness of Ordinary Kriging and Universal Kriging were almost the same when applied to both temperature and relative humidity.
An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks
Govind P. Gupta*, Manoj Misra* and Kumkum Garg**
Page: 148~164

Show / Hide Abstract
The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.


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. All papers published in the JIPS are also allowed to be freely distributed under the terms of the Creative Commons Attribution Non-Commercial License.

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.