Journal of Information Processing Systems

The Journal of Information Processing Systems (JIPS) 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.

ISSN: 1976-913X (Print), ISSN: 2092-805X (Online)

JIPS
[Dec. 12, 2016] Call for papers about Special sections scheduled in 2017 are registered. Please refer to here for details.
[Oct. 1, 2016] Call for papers about a new special issue titled "Smart Standards, Algorithms and Frameworks for Interoperability in Internet of Things" is now registered. Please refer to here for details.
[Aug. 20, 2016] Since August 20, 2016, the JIPS has started to manage two fast tracks as well as the regular track, and authors has been required to pay the publication charge. Please refer to the details on the author information page.
[Aug. 1, 2016] Since August 2016, the JIPS has been indexed in "Emerging Sources Citation Index (ESCI)", a new Web of Science index managed by Thomson Reuters, launched in late 2015 for journals that have passed an initial evaluation for inclusion in SCI/SCIE/AHCI/SSCI indexes. Indexing in the ESCI will improve the visibility of the JIPS and provide a mark of quality. This achievement is good for all authors of the JIPS. For more information about ESCI, please see the ESCI fact sheet file.

Latest Publications

Journal of Information Processing Systems, Vol. 13, No.3, 2017

New Approaches to Advanced Network and Image Processing
Jong Hyuk Park
Page: 429~434, Vol. 13, No.3, 2017
10.3745/JIPS.00.0005
Keywords:
Show / Hide Abstract
The Journal of Information Processing Systems (JIPS) publishes a broad array of subjects related to information communication technology across prevalent and advanced fields including system, network, architecture, algorithm, application, security, and so forth. As the official international journal published by the Korean Information Processing Society and a prominent, multidisciplinary journal throughout the world, JIPS is being indexed in ESCI, SCOPUS, EI COMPENDEX, DOI, DBLP, EBSCO, Google Scholar, and CrossRef. The purpose of JIPS is to provide a prominent, influential forum wherein researchers and professionals gather to promote, share, and discuss all major research issues and developments. Published theoretical and practical articles have contributed to related research areas by presenting new techniques, concepts, or analyses, featuring experience reports, experiments involving the implementation and application of new theories, and tutorials on state-of-the-art technologies related to information processing systems. The subjects covered by this journal include, but are not limited to, topics related to computer systems and theories, multimedia systems and graphics, communication systems and security, and software systems and applications


Granular Bidirectional and Multidirectional Associative Memories: Towards a Collaborative Buildup of Granular Mappings
Witold Pedrycz
Page: 435~447, Vol. 13, No.3, 2017
10.3745/JIPS.02.0058
Keywords: Allocation of Information Granularity and Optimization, Bidirectional Associative Memory, Collaborative Clustering, Granular Computing, Multi-directional Associative Memory, Prototypes
Show / Hide Abstract
Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one- directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so- called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.


Blind Image Quality Assessment on Gaussian Blur Images
Liping Wang, Chengyou Wang and Xiao Zhou
Page: 448~463, Vol. 13, No.3, 2017
10.3745/JIPS.02.0059
Keywords: Blind Image Quality Assessment (BIQA), Gaussian Blur Image, Saliency Map, Structure Tensor, Structural Similarity (SSIM)
Show / Hide Abstract
Multimedia is a ubiquitous and indispensable part of our daily life and learning such as audio, image, and video. Objective and subjective quality evaluations play an important role in various multimedia applications. Blind image quality assessment (BIQA) is used to indicate the perceptual quality of a distorted image, while its reference image is not considered and used. Blur is one of the common image distortions. In this paper, we propose a novel BIQA index for Gaussian blur distortion based on the fact that images with different blur degree will have different changes through the same blur. We describe this discrimination from three aspects: color, edge, and structure. For color, we adopt color histogram; for edge, we use edge intensity map, and saliency map is used as the weighting function to be consistent with human visual system (HVS); for structure, we use structure tensor and structural similarity (SSIM) index. Numerous experiments based on four benchmark databases show that our proposed index is highly consistent with the subjective quality assessment.


Content-Based Image Retrieval Using Combined Color and Texture Features Extracted by Multi-resolution Multi-direction Filtering
Hee-Hyung Bu, Nam-Chul Kim, Chae-Joo Moon and Jong-Hwa Kim
Page: 464~475, Vol. 13, No.3, 2017
10.3745/JIPS.02.0060
Keywords: Color and Texture Feature, Content-Based Image Retrieval, HSV Color Space, Multi-resolution Multi-direction Filtering
Show / Hide Abstract
In this paper, we present a new texture image retrieval method which combines color and texture features extracted from images by a set of multi-resolution multi-direction (MRMD) filters. The MRMD filter set chosen is simple and can be separable to low and high frequency information, and provides efficient multi- resolution and multi-direction analysis. The color space used is HSV color space separable to hue, saturation, and value components, which are easily analyzed as showing characteristics similar to the human visual system. This experiment is conducted by comparing precision vs. recall of retrieval and feature vector dimensions. Images for experiments include Corel DB and VisTex DB; Corel_MR DB and VisTex_MR DB, which are transformed from the aforementioned two DBs to have multi-resolution images; and Corel_MD DB and VisTex_MD DB, transformed from the two DBs to have multi-direction images. According to the experimental results, the proposed method improves upon the existing methods in aspects of precision and recall of retrieval, and also reduces feature vector dimensions.


NDynamic Framework for Secure VM Migration over Cloud Computing
Suresh B. Rathod and V. Krishna Reddy
Page: 476~490, Vol. 13, No.3, 2017
10.3745/JIPS.01.0015
Keywords: Cloud Computing, Datacenter (DC), Host Controller, Physical Host, Virtual Machine (VM)
Show / Hide Abstract
In the centralized cloud controlled environment, the decision-making and monitoring play crucial role where in the host controller (HC) manages the resources across hosts in data center (DC). HC does virtual machine (VM) and physical hosts management. The VM management includes VM creation, monitoring, and migration. If HC down,the services hosted by various hosts in DC can’t be accessed outside the DC. Decentralized VM management avoids centralized failure by considering one of the hosts from DC as HC that helps in maintaining DC in running state. Each host in DC has many VM’s with the threshold limit beyond which it can’t provide service.To maintain threshold , the host’s in DC does VM migration across various hosts. The data in migration is in the form of plaintext, the intruder can analyze packet movement and can control hosts traffic. The incorporation of security mechanism on hosts in DC helps protecting data in migration. This paper discusses an approach for dynamic HC selection, VM selection and secure VM migration over cloud environment.


A Fast Ground Segmentation Method for 3D Point Cloud
Phuong Chu, Seoungjae Cho, Sungdae Sim, Kiho Kwak and Kyungeun Cho
Page: 491~499, Vol. 13, No.3, 2017
10.3745/JIPS.02.0061
Keywords: 3D Point Cloud, Ground Segmentation, Light Detection and Ranging, Start-Ground Point, Threshold Point
Show / Hide Abstract
In this study, we proposed a new approach to segment ground and nonground points gained from a 3D laser range sensor. The primary aim of this research was to provide a fast and effective method for ground segmentation. In each frame, we divide the point cloud into small groups. All threshold points and start- ground points in each group are then analyzed. To determine threshold points we depend on three features: gradient, lost threshold points, and abnormalities in the distance between the sensor and a particular threshold point. After a threshold point is determined, a start-ground point is then identified by considering the height difference between two consecutive points. All points from a start-ground point to the next threshold point are ground points. Other points are nonground. This process is then repeated until all points are labelled


An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks
Liquan Zhao and Nan Chen
Page: 500~517, Vol. 13, No.3, 2017
10.3745/JIPS.03.0072
Keywords: Energy Consumption, Heterogeneous Wireless Sensor Networks, Stable Election Protocol, Zone-Based
Show / Hide Abstract
In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets


Development of a CUBRID-Based Distributed Parallel Query Processing System
Hyeong-Il Kim, HyeonSik Yang, Min Yoon and Jae-Woo Chang
Page: 518~532, Vol. 13, No.3, 2017
10.3745/JIPS.01.0016
Keywords: CUBRID, Distributed Parallel Environment, Query Processing
Show / Hide Abstract
Due to the rapid growth of the amount of data, research on bigdata processing has been highlighted. For bigdata processing, CUBRID Shard is able to support query processing in parallel way by dividing the database into a number of CUBRID servers. However, CUBRID Shard can answer a user’s query only when the query is required to gain accesses to a single CUBRID server, instead of multiple ones. To solve the problem, in this paper we propose a CUBRID based distributed parallel query processing system that can answer a user’s query in parallel and distributed manner. Finally, through the performance evaluation, we show that our proposed system provides 2–3 times better performance on query processing time than the existing CUBRID Shard


Improvement of OPW-TR Algorithm for Compressing GPS Trajectory Data
Qingbin Meng, Xiaoqiang Yu, Chunlong Yao, Xu Li, Peng Li and Xin Zhao
Page: 533~545, Vol. 13, No.3, 2017
10.3745/JIPS.03.0073
Keywords: ASED, GPS Trajectory, SED, Trajectory Compression
Show / Hide Abstract
Massive volumes of GPS trajectory data bring challenges to storage and processing. These issues can be addressed by compression algorithm which can reduce the size of the trajectory data. A key requirement for GPS trajectory compression algorithm is to reduce the size of the trajectory data while minimizing the loss of information. Synchronized Euclidean distance (SED) as an important error measure is adopted by most of the existing algorithms. In order to further reduce the SED error, an improved algorithm for open window time ratio (OPW-TR) called local optimum open window time ratio (LO-OPW-TR) is proposed. In order to make SED error smaller, the anchor points are selected by calculating point’s accumulated synchronized Euclidean distance (ASED). A variety of error metrics are used for the algorithm evaluation. The experimental results show that the errors of our algorithm are smaller than the existing algorithms in terms of SED and speed errors under the same compression ratio


Multicast Tree Construction with User-Experienced Quality for Multimedia Mobile Networks
Hoejung Jung and Namgi Kim
Page: 546~558, Vol. 13, No.3, 2017
10.3745/JIPS.01.0017
Keywords: GTM, Mobile Network, Multicast Tree Construction, SDN
Show / Hide Abstract
The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of link- changed users while only slightly adding to the network-cost overhead.


Cyberbullying and a Mobile Game App? An Initial Perspective on an Alternative Solution
Manmeet Mahinderjit Singh, Ping Jie Ng, Kar Ming Yap, Mohd Heikal Husin and Nurul Hashimah Ahamed Hassain Malim
Page: 559~572, Vol. 13, No.3, 2017
10.3745/JIPS.04.0033
Keywords: Cyberbullying, Digital Etiquette, Intrusion Detection System, Mobile Application, Social Network
Show / Hide Abstract
Cyberbullying has been an emerging issue in recent years where research has revealed that users generally spend an increasing amount of time in social networks and forums to keep connected with each other. However, issue arises when cyberbullies are able to reach their victims through these social media platforms. There are different types of cyberbullying and like traditional bullying; it causes victims to feel overly self- conscious, increases their tendency to self-harm and generally affects their mental state negatively. Such situations occur due to security issues such as user anonymity and the lack of content restrictions in some social networks or web forums. In this paper, we highlight the existing solutions, which are Intrusion Prevention System and Intrusion Detection System from a number of researchers. However, even with such solutions, cyberbullying acts still occurs at an alarming rate. As such, we proposed an alternative solution that aims to prevent cyberbullying activities at a younger age, e.g., young children. The application would provide an alternative method to preventing cyberbullying activities among the younger generations in the future


Query with SUM Aggregate Function on Encrypted Floating-Point Numbers in Cloud
Taipeng Zhu, Xianxia Zou and Jiuhui Pan
Page: 573~589, Vol. 13, No.3, 2017
10.3745/JIPS.04.0034
Keywords: Coding Scheme, DoubleListTree, Encryption, Floating-Point Numbers, Summation
Show / Hide Abstract
Cloud computing is an attractive solution that can provide low cost storage and powerful processing capabilities for government agencies or enterprises of small and medium size. Yet the confidentiality of information should be considered by any organization migrating to cloud, which makes the research on relational database system based on encryption schemes to preserve the integrity and confidentiality of data in cloud be an interesting subject. So far there have been various solutions for realizing SQL queries on encrypted data in cloud without decryption in advance, where generally homomorphic encryption algorithm is applied to support queries with aggregate functions or numerical computation. But the existing homomorphic encryption algorithms cannot encrypt floating-point numbers. So in this paper, we present a mechanism to enable the trusted party to encrypt the floating-points by homomorphic encryption algorithm and partial trusty server to perform summation on their ciphertexts without revealing the data itself. In the first step, we encode floating-point numbers to hide the decimal points and the positive or negative signs. Then, the codes of floating-point numbers are encrypted by homomorphic encryption algorithm and stored as sequences in cloud. Finally, we use the data structure of DoubleListTree to implement the aggregate function of SUM and later do some extra processes to accomplish the summation


Fire Detection Using Multi-Channel Information and Gray Level Co-occurrence Matrix Image Features
Jae-Hyun Jun, Min-Jun Kim, Yong-Suk Jang and Sung-Ho Kim
Page: 590~598, Vol. 13, No.3, 2017
10.3745/JIPS.02.0062
Keywords: Color Features, Fire Detection, Texture Features
Show / Hide Abstract
Recently, there has been an increase in the number of hazardous events, such as fire accidents. Monitoring systems that rely on human resources depend on people; hence, the performance of the system can be degraded when human operators are fatigued or tensed. It is easy to use fire alarm boxes; however, these are frequently activated by external factors such as temperature and humidity. We propose an approach to fire detection using an image processing technique. In this paper, we propose a fire detection method using multi- channel information and gray level co-occurrence matrix (GLCM) image features. Multi-channels consist of RGB, YCbCr, and HSV color spaces. The flame color and smoke texture information are used to detect the flames and smoke, respectively. The experimental results show that the proposed method performs better than the previous method in terms of accuracy of fire detection


Copyright Protection for Digital Image by Watermarking Technique
Suhad A. Ali, Majid Jabbar Jawad and Mohammed Abdullah Naser
Page: 599~617, Vol. 13, No.3, 2017
10.3745/JIPS.03.0074
Keywords: Digital Watermarking, Discrete Cosine Transform (DCT), Normalized Correlation (NC), PSNR
Show / Hide Abstract
Due to the rapid growth and expansion of the Internet, the digital multimedia such as image, audio and video are available for everyone. Anyone can make unauthorized copying for any digital product. Accordingly, the owner of these products cannot protect his ownership. Unfortunately, this situation will restrict any improvement which can be done on the digital media production in the future. Some procedures have been proposed to protect these products such as cryptography and watermarking techniques. Watermarking means embedding a message such as text, the image is called watermark, yet, in a host such as a text, an image, an audio, or a video, it is called a cover. Watermarking can provide and ensure security, data authentication and copyright protection for the digital media. In this paper, a new watermarking method of still image is proposed for the purpose of copyright protection. The procedure of embedding watermark is done in a transform domain. The discrete cosine transform (DCT) is exploited in the proposed method, where the watermark is embedded in the selected coefficients according to several criteria. With this procedure, the deterioration on the image is minimized to achieve high invisibility. Unlike the traditional techniques, in this paper, a new method is suggested for selecting the best blocks of DCT coefficients. After selecting the best DCT coefficients blocks, the best coefficients in the selected blocks are selected as a host in which the watermark bit is embedded. The coefficients selection is done depending on a weighting function method, where this function exploits the values and locations of the selected coefficients for choosing them. The experimental results proved that the proposed method has produced good imperceptibility and robustness for different types of attacks


HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks
Shunyi Gan, Jipeng Zhou and Kaimin Wei
Page: 618~629, Vol. 13, No.3, 2017
10.3745/JIPS.03.0075
Keywords: Delivery Cost, DTNs, History Node, Multiple Probability, Spray-and-Wait
Show / Hide Abstract
Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the “multi-hop forwarding” are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.


Achievable Rate Analysis for Opportunistic Non-orthogonal Multiple Access-Based Cooperative Relaying Systems
In-Ho Lee and Howon Lee
Page: 630~642, Vol. 13, No.3, 2017
10.3745/JIPS.03.0076
Keywords: Achievable Rate Analysis, Decode-and-Forward Relaying, Non-orthogonal Multiple Access, Opportunistic Transmission, Rayleigh Fading Channels, Superposition Coding
Show / Hide Abstract
In this paper, we propose the opportunistic non-orthogonal multiple access (NOMA)-based cooperative relaying system (CRS) with channel state information (CSI) available at the source, where CSI for the source- to-destination and source-to-relay links is used for opportunistic transmission. Using the CSI, for opportunistic transmission, the source instantaneously chooses between the direct transmission and the cooperative NOMA transmission. We provide an asymptotic expression for the average achievable rate of the opportunistic NOMA-based CRS under Rayleigh fading channels. We verify the asymptotic analysis through Monte Carlo simulations, and compare the average achievable rates of the opportunistic NOMA-based CRS and the conventional one for various channel powers and power allocation coefficients used for NOMA


Featured Papers

Survey on 3D Surface Reconstruction
Alireza Khatamian and Hamid R. Arabnia
Pages: 338~357, Vol. 12, No.3, 2016
10.3745/JIPS.01.0010

Keywords: Explicit Surfaces, Implicit Surfaces, Point Cloud, Surface Reconstruction
Show / Hide Abstract

A Comprehensive Review of Emerging Computational Methods for Gene Identification
Ning Yu, Zeng Yu, Bing Li, Feng Gu and Yi Pan
Pages: 1~34, Vol. 12, No.1, 2016
10.3745/JIPS.04.0023

Keywords: Cloud Computing, Comparative Methods, Deep Learning, Fourier Transform, Gene Identification, Gene Prediction, Hidden Markov Model, Machine Learning, Protein-Coding Region, Support Vector Machine
Show / Hide Abstract

On the Performance of Oracle Grid Engine Queuing System for Computing Intensive Applications
Vladi Kolici, Albert Herrero and Fatos Xhafa
Pages: 491~502, Vol. 10, No.4, 2014
10.3745/JIPS.01.0004
Keywords: Benchmarking, Cloud Computing, Computing Intensive Applications, Genetic Algorithms, Grid Computing, Oracle Grid Engine, Scheduling, Simulation
Show / Hide Abstract

Training-Free Fuzzy Logic Based Human Activity Recognition
Eunju Kim and Sumi Helal
Pages: 335~354, Vol. 10, No.3, 2014
10.3745/JIPS.04.0005
Keywords: Activity Semantic Knowledge, Fuzzy Logic, Human Activity Recognition, Multi-Layer Neural Network
Show / Hide Abstract

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
Pages: 1~22, Vol. 10, No.1, 2014
10.3745/JIPS.2014.10.1.001
Keywords: Multi-source, Multi-modal Event Detection, Law Enforcement, Criminal Activity, Surveillance, Security, Safety
Show / Hide Abstract

The Confinement Problem: 40 Years Later
Alex Crowell, Beng Heng Ng, Earlence Fernandes and Atul Prakash
Pages: 189~204, Vol. 9, No.2, 2013
10.3745/JIPS.2013.9.2.189
Keywords: Confinement Problem, Covert Channels, Virtualization, Isolation, Taint Tracking
Show / Hide Abstract

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
Pages: 191~212, Vol. 8, No.2, 2012
10.3745/JIPS.2012.8.2.191
Keywords: Weak es timators, User's Profiling, Time Varying Preferences
Show / Hide Abstract

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
Pages: 1~20, Vol. 8, No.1, 2012
10.3745/JIPS.2012.8.1.001
Keywords: IEEE 802.11a, Indoor Test Bed, Link Quality, Wireless Mesh Networks
Show / Hide Abstract

A Survey of RFID Deployment and Security Issues
Amit Grover and Hal Berghel
Pages: 561~580, Vol. 7, No.4, 2011
10.3745/JIPS.2011.7.4.561
Keywords: RFID, RFID Standards, RFID Protocols, RFID Security, EPC structure, RFID Applications, RFID Classification
Show / Hide Abstract

The Principle of Justifiable Granularity and an Optimization of Information Granularity Allocation as Fundamentals of Granular Computing
Witold Pedrycz
Pages: 397~412, Vol. 7, No.3, 2011
10.3745/JIPS.2011.7.3.397
Keywords: Information Granularity, Principle of Justifiable Granularity, Knowledge Management, Optimal Granularity Allocation
Show / Hide Abstract

CASPER: Congestion Aware Selection of Path with Efficient Routing in Multimedia Networks
Mohammad S. Obaidat, Sanjay K. Dhurandher and Khushboo Diwakar
Pages: 241~260, Vol. 7, No.2, 2011
10.3745/JIPS.2011.7.2.241
Keywords: Routing, Multimedia Networks, Congestion-aware Selection, MANET, CASPER, Performance Evaluation
Show / Hide Abstract

An Efficient Broadcast Technique for Vehicular Networks
Ai Hua Ho, Yao H. Ho, Kien A. Hua, Roy Villafane and Han-Chieh Chao
Pages: 221~240, Vol. 7, No.2, 2011
10.3745/JIPS.2011.7.2.221
Keywords: V2V Communication Protocols, Vehicular Network, Ad Hoc Network, Broadcast, Broadcasting Storm, Routing
Show / Hide Abstract

Security Properties of Domain Extenders for Cryptographic Hash Functions
Elena Andreeva, Bart Mennink and Bart Preneel
Pages: 453~480, Vol. 6, No.4, 2010
10.3745/JIPS.2010.6.4.453
Keywords: Hash Functions, Domain Extenders, Security Properties
Show / Hide Abstract

Hiding Secret Data in an Image Using Codeword Imitation
Zhi-Hui Wang, Chin-Chen Chang and Pei-Yu Tsai
Pages: 435~452, Vol. 6, No.4, 2010
10.3745/JIPS.2010.6.4.435
Keywords: Data Hiding, Steganography, Vector Quantization
Show / Hide Abstract

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
Pages: 269~294, Vol. 6, No.3, 2010
10.3745/JIPS.2010.6.3.269
Keywords: Sensor Network, Security, Energy Efficiency, Routing, Dynamic Trust Factor
Show / Hide Abstract

Challenges to Next Generation Services in IP Multimedia Subsystem
Kai-Di Chang, Chi-Yuan Chen, Jiann-Liang Chen and Han-Chieh Chao
Pages: 129~146, Vol. 6, No.2, 2010
10.3745/JIPS.2010.6.2.129
Keywords: IP Multimedia Subsystems, Peer-to-Peer, Web Services, SCIM
Show / Hide Abstract

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
Pages: 1~20, Vol. 6, No.1, 2010
10.3745/JIPS.2010.6.1.001
Keywords: Operations Support System (OSS), New Generation Operations Systems and Software (NGOSS), enhanced Telecom Operations Map (eTOM), Internet Protocol Television (IPTV), IP-Virtual Private Network (IP-VPN)
Show / Hide Abstract

Providing Efficient Secured Mobile IPv6 by SAG and Robust Header Compression
Tin-Yu Wu, Han-Chieh Chao and Chi-Hsiang Lo
Pages: 117~130, Vol. 5, No.3, 2009
10.3745/JIPS.2009.5.3. 117
Keywords: SAG, RoHC, MIPv6, Handoff Latency, Early Binding Update
Show / Hide Abstract

A Survey of Face Recognition Techniques
Rabia Jafri and Hamid R Arabnia
Pages: 41~68, Vol. 5, No.2, 2009
10.3745/JIPS.2009.5.2.041
Keywords: Face Recognition, Person Identification, Biometrics
Show / Hide Abstract

PUBLICATION ETHICS

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.

OPEN ACCESS

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 (http://www.jips-k.org) 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 (http://creativecommons.org/licenses/by-nc/3.0/) 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.

Contact Information

JIPS Secretary: Ms. Joo-yeon Lee
Email: joo@kips.or.kr
Phone: +82-2-2077-1414, Fax: +82-2-2077-1472