		FeedBack \| Contact Us \| Links \| Site Map

Welcome to Journal of Theoretical and Applied Information Technology

Submit Paper / Call for Papers

Journal receives papers in continuous flow and we will consider articles from a wide range of Information Technology disciplines encompassing the most basic research to the most innovative technologies. Please submit your papers electronically to our submission system at http://jatit.org/submit_paper.php in an MSWord, Pdf or compatible format so that they may be evaluated for publication in the upcoming issue. This journal uses a blinded review process; please remember to include all your personal identifiable information in the manuscript before submitting it for review, we will edit the necessary information at our side. Submissions to JATIT should be full research / review papers (properly indicated below main title).

Journal of Theoretical and Applied Information Technology February 2012 | Vol. 36 No.1

Paper ID:	14564 -JATIT
Title:	A STEGANOGRAPHY ALGORITHM FOR HIDING IMAGE IN IMAGE BY IMPROVED LSB SUBSTITUTION BY MINIMIZE DETECTION
Author:	VIJAY KUMAR SHARMA ,2VISHAL SHRIVASTAVA
Source:	Journal of Theoretical and Applied Information Technology pp 001 - 008 Vol 36. No. 1 -- 2012
Abstract	Steganography is a branch of information hiding. It allows the people to communicate secretly. As increasingly more material becomes available electronically, the influence of steganography on our lives will continue to grow. Many confidential information were leaked to a rival firm using steganographic tools that hid the information in music and picture files. The application of steganography is an important motivation for feature selection. In recent years, many successful steganography methods have been proposed. They challenge by steganalysis. Steganalysis (type of attack on steganography Algorithm) Algorithm which detects the stego-message by the statistic analysis of pixel values[1][2], To ensure the security against the steganalysis attack, a new steganographic algorithm for 8bit(grayscale) or 24 bit (colour image) is presented in this paper, based on Logical operation. Algorithm embedded MSB of secret image in to LSB of cover image. in this n LSB of cover image ,from a byte is replaced by n MSB of secret image. the image quality of the stego-image can be greatly improved with low extra computational complexity. The worst case mean-square-error between the stego-image and the cover-image is derived. Experimental results show that the stego-image is visually indistinguishable from the original cover-image when n<=4, because of better PSNR which is achieved by this technique. It comes under the assumption that if the feature is visible, the point of attack is evident, thus the goal here is always to cover up the very existence of the embedded data.
Keywords	LSB Steganography, MSB, PSNR, Logic Gate
Full Text

Paper ID:	14689 -JATIT
Title:	COLLISION-FREE FAULT TOLERANT MULTISTAGE INTERCONNECTION NETWORKS BASED ON WAVELENGTH DIVISION MULTIPLEXING
Author:	MOHAMMED AMER ARAFAH
Source:	Journal of Theoretical and Applied Information Technology pp 009 - 017 Vol 36. No. 1 -- 2012
Abstract	In this paper, the performance of the extra stage Omega (ESO) networks based on wavelength division with limited number of buffers and wavelength converters was analyzed. Since the ESO networks suffer from the problem of internal blocking, therefore, the goal is to minimize the dropping probability by utilizing the available buffers and wavelength converters in the central controller of these networks. The advantage of ESO over the Omega networks is that there is a redundant path from any source to any destination. Having an additional path gives packets more flexibility, thus reducing the probability of packet buffering or dropping.
Keywords	Multistage Interconnection Networks, Omega Networks, Internal Blocking, Buffering, Wavelength Conversion, Wavelength Division Multiplexing
Full Text

Paper ID:	14745 -JATIT
Title:	APPLICATION OF K-NEAREST NEIGHBOUR PREDICTOR FOR CLASSIFYING TRUST OF B2C CUSTOMERS
Author:	MEHRBAKHSH NILASHI, KARAMOLLAH BAGHERIFARD, OTHMAN IBRAHIM, NASIM JANAHMADI, BAHMAN PANJALIZADEH, MOUSA BARISAMI
Source:	Journal of Theoretical and Applied Information Technology pp 018 - 025 Vol 36. No. 1 -- 2012
Abstract	K-nearest neighbor (k-NN) classification is one of the most fundamental classification methods and should be one of the first choices for a classification study when there is little or no prior knowledge about the distribution of the data. In addition, nearest neighbor analysis is a method for classifying cases based on their similarity to other cases. In this paper using k-NN method some factors that affect on customer trust in online transactions, were classified. Raw data gathered from customers when they were buying as customer in B2C websites. One questionnaire was developed and data was gathered from online customers. After organizing data, k-NN method was applied and desired results were obtained. Results showed that in which positions customer can trust to B2C websites and which factors are more significant. Accordingly, in this paper k-NN enable us to predict role of factors on trust level in five levels.
Keywords	K-NN, Trust, B2C, Security, Customer
Full Text

Paper ID:	14757 -JATIT
Title:	AN ELLIPTIC CURVE ARITHMETIC IN THE NORMAL BASIS OF GF(2^5) TO USE IN ECC
Author:	A.R.RISHIVARMAN B. PARTHASARATHY M.THIAGARAJAN
Source:	Journal of Theoretical and Applied Information Technology pp 026 - 040 Vol 36. No. 1 -- 2012
Abstract	Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffe and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups. The resulting public – key systems provide relatively small block size, high speed, and high security. This paper explores an efficient performance of GF(25) in the normal basis representation and an elliptic curve cryptosystems using a non-super singular curve over the field; so this scheme is of less computation cost which is valuable in applications with limited memory, communications bandwidth or computing power.
Keywords	Secret Sharing, Elliptic Curve Cryptography (ECC), GF(25), Irreducible Polynomial, ECDLP
Full Text

Paper ID:	14776 -JATIT
Title:	A COMPARITIVE STUDY OF DIFFERENT DATA MINING CLASSIFICATION TECHNIQUES FOR CANCER MOLECULAR PATTERN DISCOVERY
Author:	I. JULIE, Dr. E. KIRUBAKARAN
Source:	Journal of Theoretical and Applied Information Technology pp 041 - 047 Vol 36. No. 1 -- 2012
Abstract	The most important application of Microarray for gene expression analysis is used to discover or classify the unknown tissue samples with the help of known tissue samples. Several general purpose Data Mining Classification Techniques have been proposed recently and studied to predict/identify the cancer patterns. In this research work, we have focused and studied a few Classification Techniques such as Support Vector Machine (SVM), Nearest Neighbor Classifier (k-NN), ICS4, Non-Parallel Plane Proximal Classifier (NPPC), NPPC-SVM, Margin-based Feature Elimination-SVM (MFE-SVM). The performance of these classifiers in terms of Minimum Threshold Level to predict/identify the Cancer Pattern, Execution Time, Training Time, Memory Usage and Memory Utilization have been analyzed. This research work has applied these Classification Techniques to 10 publicly available datasets, and compared how these Classification Techniques performed in class prediction of test datasets. From our experimental study, it is observed that for different Cancer Patterns, the threshold levels are different to predict the Cancer Pattern by various Classifiers. It is also revealed that the execution time to predict the cancer patterns are different for different Classifiers. That is overall this work has revealed that although it is obvious that Threshold level based Selection method improves both the memory utilization and execution time but finding the best Classifier for Cancer Prediction is still complicated and the performance and efficiency of Classifier in terms of Execution Time and Memory Utilization is vary in each case.
Keywords	Microarray, Pattern Recognition, SVM, k-NN, ICS4, NPPC, NPPC-SVM, MFE-SVM
Full Text

Paper ID:	14779 -JATIT
Title:	BUS PRIORITY RANKING VIA STABILITY INDEX TRACING AND EVOLUTIONARY PROGRAMMING
Author:	Z. HAMID, I. MUSIRIN, M. M. OTHMAN, M. N. A. RAHIM
Source:	Journal of Theoretical and Applied Information Technology pp 048 - 059 Vol 36. No. 1 -- 2012
Abstract	There are various methods applied for indicating the most sensitive bus for any corrective and preventive actions like power scheduling at generation site and shunt element placement such as capacitor bank and FACTS devices at load site. The methods can be sensitivity analysis, optimization method, stability index based ranking and lastly the method that is rarely applied, termed as power tracing. Currently, the usage of power tracing technique is majorly limited to the field of transmission service pricing although there are various methods that have been developed by researchers. By virtue of that, this paper promotes a new technique for identifying the most suitable generator bus to be performed power scheduling and the best load bus for shunt element installation by means of Fast Voltage Stability Index Tracing (FVSI-T) via Evolutionary Programming (EP). Validation on IEEE 14-Bus and 57-Bus reliability test system (RTS) revealed that the proposed method has great capability to be applied into real system.
Keywords	EP, FVSI-T, Power Scheduling, Shunt Element Placement
Full Text

Paper ID:	14780 -JATIT
Title:	A ROAD MAP TO REGRESSION TESTING OF SERVICE-ORIENTED ARCHITECTURE (SOA) BASED APPLICATIONS
Author:	RAJANI KANTA MOHANTY, BINOD KUMAR PATTANAYAK, BHAGABAT PUTHAL, DURGA PRASAD MOHAPATRA
Source:	Journal of Theoretical and Applied Information Technology pp 060 - 065 Vol 36. No. 1 -- 2012
Abstract	Modular approach to application software development has become significantly popular among the enterprises. However, Service-Oriented Architecture (SOA)-based applications represent the majority of modular application software. The major concerns of developers of these applications are oriented around the reliability and fault-free implementation, which necessitate proper testing of the application. Testing of SOA-based application plays a critical role in ensuring a successful deployment of applications. Testing strategies of such applications like unit testing, integration testing and system testing may somehow resemble to that of traditional application software. However, regression testing of SOA-based applications, which can be conducted during the maintenance phase, may present several challenges. To begin with, in this research paper, we attempt to explore a road map to regression testing of SOA-based applications.
Keywords	Software, Service, SOA, Testing, Regression Testing
Full Text

Paper ID:	14781 -JATIT
Title:	ROLE OF PARTITIONING BASED CLUSTERING ALGORITHMS IN CLASSIFYING MULTI-SOURCE PARTIAL DISCHARGE PATTERNS USING PROBABILISTIC NEURAL NETWORK AND ITS ADAPTIVE VERSION– A REVIEW
Author:	S. VENKATESH, S. GOPAL, S. JAYALALITHA
Source:	Journal of Theoretical and Applied Information Technology pp 066 - 084 Vol 36. No. 1 -- 2012
Abstract	Notwithstanding developments in design, processing and quality control techniques, flaws in insulation of electrical power apparatus such as blow-holes, cavities, surface imperfections, etc are unavoidable. Manufacturers and utilities employ a variety of prognostic tools to assess the condition of insulation amongst which Partial Discharge (PD) measurement has become an indispensable non-intrusive technique. Since discrimination of PD is a fundamental yet an indispensable prerequisite for diagnosis and since multiple PD sources are frequently encountered in practice, such studies have grabbed the attention of researchers. In view of the fact that PD is inherently a complex non-Markovian process and a majority of modern PD measurement systems acquire data for a substantial duration, the database is large leading to a plethora of complications during classification such as ill-conditioning, over-fitting etc. Though an array of intelligent and scientific computational techniques such as Neural Networks (NN), Hidden Markov Models, Wavelet Transformation etc have been utilized for single and overlapped PD sources with a fair degree of success, the inability to develop a comprehensive and validated scheme for identification continues to be elusive. In this research, exhaustive studies have been carried out on benchmark models that replicate single and multiple PD sources with a focus on three major aspects during classification which utilizes PNN versions that employ a variety of partition based clustering techniques namely algorithms based on distance and similarity, square error and density function. The first aspect focuses on ascertaining the ability of non-clustering based PNN versions in handling large ill-conditioned datasets during training in comparison with the various partitioning based algorithms. The second is on the analysis of the ability of square-error, distance and density based clustering techniques in providing frugal sets of representative centers during training. The third facet is to ascertain the role played by the preprocessing techniques in dealing with issues related to the curse of dimensionality during classification. Further, exhaustive analysis is carried out to determine the role played by the free parameter (variance parameter) in distinguishing various classes of PD, number of iterations and its impact on computational cost during the training phase in NNs which utilize the clustering algorithms and the choice of the number of codebook vectors in classifying the patterns.
Keywords	Neural Network (NN), Probabilistic Neural Network (PNN), Adaptive Probabilistic Neural Network (APNN), Learning Vector Quantization (LVQ), Expectation Maximization (EM)
Full Text

Paper ID:	14784 -JATIT
Title:	MOBILE NETWORKS MIGRATION TOWARDS NGN
Author:	H. BELAOUD, A. HABBANI, J.EL ABBADI
Source:	Journal of Theoretical and Applied Information Technology pp 085 - 091 Vol 36. No. 1 -- 2012
Abstract	One of the challenging tasks of an established mobile network operator in migration to NGN structures is complete the 2G network migration to UMTS R4 architecture. The present article concerns the mobile network migration towards the NGN .Our contribution consists of three parts. At first, we studied the existing network architecture and the 2G TMSC equipment to migrate as well as its various features. Afterward we proposed a migration scenario adapted to the various network constraints and which answer the need of the operator. Finally we realized a dimensioning study to determine the number of necessary equipments in the process of migration.
Keywords	Next Generation Network (NGN), Universal Mobile Telecommunications System (UMTS), Second generation (2G), transit Mobile Switching Center (TMSC)
Full Text

Paper ID:	14791 -JATIT
Title:	A SURVEY OF FACE RECOGNITION ON FEATURE EXTRACTION PROCESS OF DIMENSIONALITY REDUCTION TECHNIQUES
Author:	S.CHITRA, Dr.G.BALAKRISHNAN
Source:	Journal of Theoretical and Applied Information Technology pp 092 - 100 Vol 36. No. 1 -- 2012
Abstract	Face Recognition is one of the most successful challenging applications in the field of computer vision and pattern recognition. Generally there are two types of recognitions such as intrusive recognition means that the user aware about the recognition i.e., Palm print recognition; the users have to place their palm in the scanner, where as face recognition is non-intrusive, with out user cooperation it can able to recognize the person as authenticated person or not. The applications of face recognition are time attendance system, visitor management system and access control system, etc. the face recognition gives efficient performance under the controlled environment. But still we have the unsolved problems in real time applications. The dimensionality reduction is a most important task in the field of face recognition. In this paper, it proposed all the recent emerging techniques of feature extraction process in the dimensionality reduction.
Keywords	Face Recognition, Dimensionality Reduction, Feature Extraction, Feature Selection, Linear Methods, And Non Linear Methods
Full Text

Paper ID:	14802 -JATIT
Title:	E-STRATEGY FORMULATION: A NEW APPROACH BASED ON A LAYERED MODEL
Author:	NAJIB BELKHAYAT ZOUKKARI, ABDELAZIZ DOUKKALI, BOUBKER REGRAGUI
Source:	Journal of Theoretical and Applied Information Technology pp 101 - 112 Vol 36. No. 1 -- 2012
Abstract	E-Strategy is the process used to evaluate and develop the Information and Communication Technologies (ICT) integration in a country. This process is composed of three phases: the diagnostic phase named e-Readiness is used to evaluate the ICT infrastructure and its use in a country, e-Strategy formulation phase carries out the definition of how to develop the e-Readiness of the country, the implementation of this e-Strategy is the third phase of the process. Several approaches are used for e-Readiness but the lack of indicators measures (data) limits its development. Also, there is a lack of e-Strategy formulation approaches. We propose in this paper: 1) a new classification of the e-Readiness indicators inspired from the IS (Information Systems) urbanization model; 2) a mathematical model based on this new classification with the aim to cover some of standard approaches limits. This model should lead to a framework for the formulation of the e-Strategy and present a state model that can use the data analysis tools for dynamic systems like filtering mechanisms to cover the lack of data problem.
Keywords	E-Readiness – E-Strategy – Urbanization – Impactability – State model
Full Text

Paper ID:	14805 -JATIT
Title:	A NEW BINDING CACHE MANAGEMENT POLICY FOR NEMO AND MIPV6
Author:	SAMER SAMI HASAN, ROSILAH HASSAN, FAISAL ELHADI ABDALLA
Source:	Journal of Theoretical and Applied Information Technology pp 113 - 117 Vol 36. No. 1 -- 2012
Abstract	Internet access requirements within the heterogeneous environments are increasing rapidly; especially in mobile environments, also the ubiquitous mobile users and services proliferated in a wide range, such as users in trains, planes and buses. Network Mobility (NEMO) basic support protocol is an extension from Mobile IPv6 (MIPv6) protocol stated by IETF to handle the mobility on a set of mobile nodes. But this NEMO suffers from a number of limitations like the handoff latency and the optimized path especially when number of mobile nodes increased; to reduce the over loaded signaling a new mechanism is proposed to solve the drop link problem inside the Correspondent node, due to the limited binding cache size that may be substantially insufficient to bind a new entries. This paper present the new mechanism named as Distributed Alternative Binding Cache mechanism (DABC), to reduce the packet loss in MIPv6 network environments and also reduce the signaling overheads resulted from deleted links. Network simulator NS-2 has been used to evaluate this mechanism and compare it with the original NEMO.
Keywords	Network Mobility (NEMO), Mobile IPv6 (MIPv6), Distributed Alternative Binding Cache Mechanism (DABC), Binding Cache, NS-2
Full Text

Paper ID:	14825 -JATIT
Title:	FRAMEWORK OF CHEMICAL INVENTORY MANAGEMENT SYSTEM BASED ON ETHNOGRAPHIC RESEARCH
Author:	JUHANA SALIM, ZAIHA NADIAH ZAINAL ABIDIN, HAZILAH MOHD AMIN, ONN AZRAAI PUADE, NOR AZAN MAT ZIN, SALMIJAH SURIF, 7OSMAN HASSAN
Source:	Journal of Theoretical and Applied Information Technology pp 118 - 128 Vol 36. No. 1 -- 2012
Abstract	Managing chemical products is a challenge in both chemical industry and academic institutions as the huge amount of chemicals resulted in problems of management, monitoring and stock control of chemicals Despite the fact that chemical inventory can be maintained using a number of software developed by several companies around the world, many tend to concentrate on the basic classification of chemicals for the purpose of systematic storage and retrieval of the chemicals to meet the requirements of users. This study aims to investigate and identify the proactive management of chemicals in order to design a framework for chemical inventory management system (CIMS) that would help improve chemical management by including networking, operating and notification facilities of the stock. The study was conducted in two stages. The first stage focused on designing a framework for the development of a CIMS based on ethnographic study at the Faculty of Science and Technology, Universiti Kebangsaan Malaysia. The second stage involved the development of a web-based CIMS prototype. Ethnographic study was conducted to identify the routines and workflow involved in the management of chemicals. Data was collected through observations, document analysis and interviews with professors, science officers, information system experts, lecturers and students. Based on the analysis of data collected from the ethnographic study, the CIMS framework is designed. In the framework, the key elements identified were metadata from Material Safety Data Sheet (MSDS), acquisition, classification and storage of chemicals. To ensure that stock control can be maintained efficiently, web-based alarm and notification technology are integrated in the CIMS framework. Based on the framework, the CIMS prototype was developed using the Spiral Mode. The result showed that prototype is able to accommodate the process of chemical request and stock control efficiently. The alarm and notification technique used is found effective in monitoring chemicals where the stock level falls below the predetermined minimal level.
Keywords	Chemical Inventory Management System, Material Safety Data Sheet (MSDS), Notification Technique, Ethnography Study
Full Text

Paper ID:	14827 -JATIT
Title:	ANALYSIS OF PROPAGATION CHARACTERISTICS IN PHOTONIC CRYSTAL FIBER STRUCTURE FOR LARGE NEGATIVE DISPERSION
Author:	S.REVATHI, Dr.SRINIVASA RAO INBATHINI
Source:	Journal of Theoretical and Applied Information Technology pp 129 - 133 Vol 36. No. 1 -- 2012
Abstract	A photonic crystal fiber is a special class of fiber which is made of a single material and having air holes in the cladding. All the propagation characteristics such as the effective index mode, confinement loss, effective area, dispersion, mode field diameter, splice loss, bending loss are studied by varying the structural parameters. To achieve the light propagation with low confinement loss, high nonlinearity, large negative dispersion, the proposed. Photonic crystal fiber structure is modeled using COMSOL 3.2a simulation software and MATLAB 7 tool. The propagation characteristics are thus analyzed.
Keywords	Photonic Crystal Fiber PCF, Micro-Structured Fiber MF
Full Text

Paper ID:	14841 -JATIT
Title:	A REVIEW OF AD HOC ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
Author:	G. RAJKUMAR, Dr. K. DURAISAMY
Source:	Journal of Theoretical and Applied Information Technology pp 134 - 144 Vol 36. No. 1 -- 2012
Abstract	A mobile ad hoc network is networks which utilizes multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Efficient dynamic routing is a challenge in such a network. On-demand routing protocol is widely developed in ad hoc networks because of its effectiveness and efficiency. In this paper, the significance of Ad hoc On-Demand Distance Vector (AODV) routing protocol, Load Balancing AODV, Modified AODV, Adaptive Secure AODV have been reviewed. The simulated parameters such as packet delivery ratio, throughput, end to end delay, routing overload and energy were taken in to consideration. The simulated results showed that the AODV protocol enhances the packet delivery ratio, throughput, decreases the routing overload and end to end delay.
Keywords	Load Balancing(LB) AODV , Vector Routing Protocol (VRP), Ad Hoc On- Demand Trusted- Path Distance Vector (AOTDV) Routing Protocol
Full Text

Paper ID:	14846 -JATIT
Title:	OFFLINE CANDIDATE HAND GESTURE SELECTION AND TRAJECTORY DETERMINATION FOR CONTINUOUS ETHIOPIAN SIGN LANGUAGE
Author:	ABADI TSEGAY, Dr. KUMUDHA RAIMOND
Source:	Journal of Theoretical and Applied Information Technology pp 145 - 153 Vol 35. No. 1 -- 2012
Abstract	A lot of effort has been invested in developing alphabet recognition and continuous sign language translation systems for many sign languages around the world. In this regard, little attention has been given to Ethiopian sign language (EthSL). However, an Ethiopian Manual Alphabet (EMA) recognition system has been developed in 2010. For a recognition system that can recognize continuous gestures from video which can be used as a translation system, a methodology that selects candidate gestures from sequence of video frames and determines hand movement trajectories is required. In this paper, a system that extracts candidate gestures for EMA and determines hand movement trajectories is proposed. The system has two separate parts namely Candidate Gesture Selection (CGS) and Hand Movement Trajectory Determination (HMTD). The CGS combines two metrics namely speed profile of continuous gestures for block division (BD) and Modified Hausdorff Distance (MHD) measure for gesture shape comparison and has an accuracy of 80.72%. The HMTD is done by considering the centroid of each hand gesture from frame to frame and using angle history, x-direction and y-direction of lines between successive centroids. A qualitative evaluation of the CGS is found to be 94.81%. The HMTD has an accuracy of 88.31%. The overall system performance is 71.88%.
Keywords	EMA, Candidate Gesture Selection, Trajectory Determination, Modified Hausdorff Distance
Full Text