		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
October 2013 | Vol. 56 No.2

Title:	THE DETERMINANTS FOR USER’S INTENTION TO USE IRAQI SCHOOL SERVICES PORTAL
Author:	SHAYMAA MUDHAFAR DAKHEEL, AHMAD SUHAIMI BAHARUDIN, KAMAL MOHAMMED ALHENDAWI
Abstract:	The purpose of this paper is to explore the determinants for the user intention to use to web portals in Iraqi schools. Iraqi Schools portal provides a welcoming place whereby private schools can establish their information, activities, rule, regulation, and make a promotion of its business to Iraqi community. Further, it provides a new, secure and effective communication channel through SMS messaging and online information exchange. A survey of 171 questionnaires is conducted in order to explore the determinants that could influence the user’s intention to use the Iraqi school portal. The results show that the user’s intention to use Iraqi school portal is relatively high. Also, the results indicated that there are three variables influence the user’s intention to use, namely, perceived ease of use, attitude and subjective norm. Therefore, the proposed model will add to the empirical studies in the field of Web portal development and Web based system as a whole.
Keywords:	Web Portal System (WPS), Service portal, User’s intention to use, Information System (IS), Iraqi Schools Services (ISS), Perceived ease of use (PEU).
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	AN EFFICIENT EXEMPLAR BASED IMAGE INPAINTING USING MULTIDIRECTIONAL CONTOURLET TRANSFORM
Author:	K.SANGEETHA, DR.P.SENGOTTUVELAN
Abstract:	Problem statement: This paper proposes an exemplar based image inpainting using contourlet trans-form. It is a new multiscale and multidirectional image representation which effectively captures the edges and contours of images. Approach: The contourlet transform is an extension of wavelet transform in two dimensions, combines Laplacian Pyramid (LP) with a Directional Filter Bank (DFB). The Laplacian pyramid is used to capture the point discontinuities, and is then followed by a Directional Filter Bank to link point discontinuities into linear structures. The image inpainting, also known as image completion, is such a kind of art that modifies an image or video with the available information outside the region to be inpainted in an undetectable way by the ordinary observers. Results: The wavelet inpainting is the existing method in which problem of filling missing data of inpainting will occur. Compare to existing methods, contourlet transform is more effective one. The Contourlet transform has better performance in representing edges than wavelets, therefore well-suited for multi-scale edge enhancement.Conclusion: Experimental results indicate that the proposed algorithm can fill large inpainting regions with good visual quality, presenting results comparable to or better than other approaches for image inpainting.
Keywords:	Contourlet Transform, Laplacian Transform, Exemplar Based, Image Inpainting.
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	INFRASTRUCTURAL PHASES OF AUTOMATED SERVICE IDENTIFICATION FRAMEWORK (ASIF)
Author:	ALI TAEI ZADEH, MURIATI MUKHTAR, SHAHNORBANUN SAHRAN
Abstract:	Although service-oriented architecture has been discussed extensively, its modeling phase has not reached maturity. Modeling activities relies on their infrastructural preparation steps such controlling method and input types determination that will form the service orientation characteristics. However, discussing and determining appropriate inputs in a clear and step-by-step form is still in its infancy., small and medium enterprises (SMEs) have not obtained SOA benefits due to the absence of a method with appropriate guidelines which are compatible with their limitations. This paper presents a review of possible input types and presents a road map and guidelines to select appropriate inputs for SOA modeling’s based on firms capabilities as infrastructural steps of ASIF. In addition, the SOA committee justification and its responsibilities are also presented.
Keywords:	SOA, Service Identification Method, BPMN, business goals, UML
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	EXTRACTING INFORMATION FROM CITESEER’S TEXTUAL DATA
Author:	DALIBOR FIALA
Abstract:	This article deals with CiteSeer, a free online digital library and search engine of mainly computer science research papers. First, it discusses CiteSeer’s features and structure and then it presents what useful information on publications and author collaborations can be extracted from its textual data. We show the basic properties of both the publication citation and author citation graph. Moreover, several parameters based on the structure of the collaboration graph of authors are discussed and their main statistical properties are shown.
Keywords:	CiteSeer, Publications, Citations, Researchers, Collaboration
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	PERFORMANCE ANALYSIS OF GENETIC ALGORITHM BASED UNICAST AND MULTICAST ROUTING OPTIMIZATION MODEL FOR MOBILE ADHOC NETWORKS
Author:	A.VIJAYALAKSHMI, Dr.P. RAMAMOORTHY
Abstract:	Wireless Mobile devices are designed to work in co-operative manner in Mobile Ad Hoc Networks (MANETs). These devices are connected via wireless link to communicate with each other. In MANET, transmission failure occurs due to several reasons, such as node mobility, channel collision and abnormal channel conditions. Even though several routing schemes are available to handle these problems, robust and novel solution is needed to provide better communication among large scale wireless devices. The solution must have capability to handle poor channel condition and connectivity failures in both unicast and multicast transmission. Genetic Optimization Based Routing (GOBR) protocol is developed to outperform during bad channel conditions and high mobility situations and to handle communication failure. GOBR provides unique, methodology to establish unicast and multicast communication based connectivity and resource availability of wireless devices. Simulation results attain better performance for GOBR compare to Adhoc On-Demand Distance Vector Routing Protocol (AODV) and Multicast operation of Ad-hoc On-demand Distance Vector routing protocol (MAODV) in both unicast and multicast transmission.
Keywords:	MANET, GA, RDP, RDR and Tree and Load Balancing.
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	A STUDY ON COOPERATION ENFORCEMENT BETWEEN NODES IN MOBILE AD HOC NETWORKS
Author:	NOR EFFENDY OTHMAN, STEFAN WEBER, ROSILAH HASSAN
Abstract:	Traditional infrastructure-based networks are formed around an infrastructure of static, dedicated components that connect the individual end points such as desktop computers and servers. The exponential rise in the number of wireless communication devices will render the provision of infrastructure-based solutions infeasible and researchers have been investigating the provision of alternative communication structures in the form of mobile ad hoc networks (MANETs). A MANET is a collection of low-resourced mobile nodes that communicate over wireless links without the need of fixed infrastructure. The network operates in distributed fashion, where all networking functions including route discovery and packet delivery are executed by the nodes themselves. Nodes in a MANET rely on multi-hop communication to communicate with nodes outside their transmission ranges. However, this can only be realized if all these nodes are willing to cooperate with each other i.e. are not reluctant to forward others’ packets. In self-organized MANETs such as civilian MANETs, each node acts as its own authority and may not share common goals with other nodes. Moreover, nodes in such networks are self-interested and tempted to drop others’ packets to preserve of their own limited resources e.g. battery power and computational capability. Such selfishness and non-cooperative behavior can make it impossible to achieve multi-hop communication and have a negative effect on the overall network performance. A large number of studies have proposed different cooperation enforcement mechanisms for MANETs. In this review paper, we discuss the rationale of cooperation enforcement in MANETs and the characteristics of a cooperation enforcement model. We also review different types of existing approaches to cooperation enforcement in MANETs and analyze them in order to provide justification for moving towards tag-based approach in enforcing cooperation between nodes in MANETs. Then we introduce the concepts found in tag-based cooperation and review existing tag-based approaches.
Keywords:	MANET, Cooperation, Selfish Nodes, Packets Forwarding, Tag-based Cooperation
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	IMAGE RETRIEVAL BASED ON BLOCK COLOR AVERAGING
Author:	C.VASANTHANAYAKI, R.MALINI
Abstract:	Although color averaging techniques are widely used in content based image retrieval system because of its computational simplicity and effective retrieval, color averaging technique still suffer in identification of different objects which share the same average color information. To overcome this limitation of color averaging technique, a new technique based on block color averaging is proposed. The proposed technique involves dividing the image to equal sized blocks. The local mean of each block is extracted for feature vector generation. The distance between the features of query image and the features of database images is computed using Euclidean distance. The proposed block color averaging technique is tested on an indexed image database and compared with existing color averaging technique. Experimental results show that the proposed block color averaging technique performs better compared to existing color averaging technique with high precision and recall rate.
Keywords:	Color Averaging, Block Size, Block Color Averaging, Euclidean Distance, Retrieval Efficiency
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	A COMMON OPERATOR ARCHITECTURE FOR DISCRETE WAVELET TRANSFORM AND CONVOLUTIONAL ENCODER
Author:	V.RAJESH AND V.PALANISAMY
Abstract:	In Software defined radio system, the transform coding is performed by data compression and encryption techniques. In this paper, a parameterization approach is considered to represent a transform coding technique, this was formulated and represented over Discrete Wavelet Transform (DWT) and convolutional coding. Thus, a flexible multi-standard transform coding system is designed under parameterization approach which explores the architecture to extract the operators to be designed. Here, two different standards for whom the Common Operator is designed are Lattice DWT and Convolutional Encoder, and the hardware complexity for this multi-standard approach is reduced by 32.48% and the power analyzed is lowered by 47.09%.
Keywords:	Common Operator, Parameterization, Discrete Wavelet Transform (DWT), Convolutional Encoder, Lattice
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	TRUST BASED SECURITY MECHANISM FOR SERVICE DISCOVERY IN MANET
Author:	S.PARISELVAM AND R.M.S PARVATHI
Abstract:	Mobile AdHoc Network (MANET) endures wide number of security issues in discovering services. Furthermore, different services require different level of security. For instance commercial applications necessitate less security compare to military applications. Thus, evolving an efficient service discovery mechanism in view of above criteria is a complicated work. In this paper, a trust based security mechanism for service discovery in MANET is proposed. This mechanism computes confidence or trust value for each node considering its interaction and behavior in the network. The trust model designates different protection level for services. Based on this protection level of the services, secure communication is offered. Further, the secure communication channel is established among nodes by sharing secret keys. By simulation results, we show that the proposed mechanism provide better security against attacks with reduced packet drops.
Keywords:	MANET, Trust, Security Mechanism, Service Discovery
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	WEIGHTED METHOD FOR COVERAGE BASED TEST CASE PRIORITIZATION
Author:	PRAKASH N, RANGASWAMY T.R
Abstract:	Software will be modified either to fix errors or to add features. The modified software should be tested with the intent of the modified parts of the software without affecting the other parts of the software. Regression testing is one of the testing techniques to ensure that the modified piece of code without affecting other parts of code. Test case prioritization is a widely used technique to conduct regression testing in effective manner. All existing prioritization techniques aims to prioritize the test cases based on certain coverage criteria. These prioritization techniques take into account any one coverage criteria (single performance goal) such as statement coverage, function coverage, path coverage, branch coverage and fault coverage. There are certain situation single performance goal will not find faults earlier using test case prioritization. So prioritization of test cases, which cover more than one criterion is an open problem. To alleviate this problem, a new weighted method is proposed to prioritize the test cases. In this method the weight is calculated based on the coverage criteria for each test case. The proposed method was empirically studied in three standard applications and the results show that the proposed method is more effective than the existing method.
Keywords:	Weighted Method,. Test Case, Regression Test, Prioritization, Coverage Criteria
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	A SEARCH ALGORITHM ON A RELATIONAL DATASET CONTAINING ALGORITHMS TO FACILITATE REAL TIME CODE GENERATION
Author:	SENTHIL JAYAVEL, S ARUMUGAM, PRATIK SHAH, RAHUL DE
Abstract:	The world of computation originates from 1’s, 0’s and the algorithms that work on sequences of these bits to generate outputs. Over the past half a century the world of computation has seen numerous algorithms and these algorithms have helped us solve our problems. These problems that we face are of a repetitive nature and we use these same algorithms to solve them repeatedly. We tend to always store the data that is essential to us and these algorithms are one of the most essentials things that help us get through day-to-day lives. This paper deals with the construction of a collection of algorithms in a structured relational database pattern to help us store the algorithms in an intuitive way and along with that this paper also deals with a search algorithm that works on this collection to give algorithms as output. These output algorithms can later be put to use in a number of domains as mentioned in the applications section of this paper.
Keywords:	Relational Database, Algorithm, Search, Relevance Factor, Graphs, Weights, Nodes, Edges.
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	INTEGRATION OF A CONTROLLED NATURAL LANGUAGE IN AN INTELLIGENT SYSTEMS PLATFORM
Author:	MOHAMMED NASRI, ADIL KABBAJ, KARIM BOUZOUBAA
Abstract:	Amine Platform is an Integrated Development Environment (IDE) that allows developing many kinds of intelligent systems and agents. The knowledge in Amine is represented using the Conceptual Graph (CG) formalism, which is a powerful formalism for expressing knowledge and writing specifications. The drawback is that CGs are difficult and not obvious for human reading, especially for users that are not familiar with this formalism or for complex situations. Integrating a controlled natural language makes the platform more comfortable (for users), more powerful and helps so to eliminate this weakness. In this paper we present our work on the integration of the controlled natural language ACE in the Amine Platform and we outline the contribution of this integration in the improvement of the interaction between the user and the platform.
Keywords:	Knowledge Representation, Conceptual Graph, Conceptual Structures, Controlled Natural Language, ACE, Natural Language Processing, Amine Platform.
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	AN EFFICIENT OPTIMIZATION BASED LUNG CANCER PRE-DIAGNOSIS SYSTEM WITH AID OF FEED FORWARD BACK PROPAGATION NEURAL NETWORK (FFBNN)
Author:	K.BALACHANDRAN, DR. R. ANITHA
Abstract:	World Health Organization (WHO) reports that worldwide 7.6 million deaths are caused by cancer each year. Uncontrollable cell development in the tissues of the lung is called as lung cancer. These uncontrollable cells restrict the growth of healthy lung tissues. If not treated, this growth can spread beyond the lung in the nearby tissue called metastasis and, form tumors. In order to preserve the life of the people who are suffered by the lung cancer disease, it should be pre-diagonized. So there is a need of pre diagnosis system for lung cancer disease which should provide better results. The proposed lung cancer prediagnosis technique is the combination of FFBNN and ABC. By using the Artificial Bee Colony (ABC) algorithm, the dimensionality of the dataset is reduced in order to reduce the computation complexity. Then the risk factors and the symptoms from the dimensional reduced dataset are given to the FFBNN to accomplish the training process. In order to get higher accuracy in the prediagnosis process, the FFBNN parameters are optimized using ABC algorithm. In the testing process, more data are given to well trained FFBNN-ABC to validate whether the given testing data predict the lung disease perfectly or not.
Keywords:	Artificial Bee Colony (ABC) Algorithm, Feed Forward Back Propagation Neural Network (FFBNN), Risk factor and symptoms, Dimensionality reduction
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	MITIGATION OF SUBSEQUENT REQUEST PROBLEM IN PROBE BASED ADMISSION CONTROL FOR MULTICAST
Author:	I. SATHIK ALI, P. SHEIK ABDUL KHADER
Abstract:	Real-time applications such as multimedia streaming and video conferencing have quite stringent Quality of Service (QoS) requirements from the network, because they are more sensitive to available bandwidth and loss rate than non real-time traffic. To provide scalable and simple Quality of Service (QoS) mechanism for multicast services, Probe-Based Multicast Admission Control (PBMAC) scheme was proposed. PBMAC encounters subsequent request problem which degrades system performance significantly when the network traffic is heavily loaded. In this paper, this problem is investigated and Improved Probe-Based Multicast Admission Control (IPBMAC) scheme is then proposed to overcome this problem. The simulation shows that this improved multicast admission control results in reduction of the bandwidth requirement for probe flows and increase of the available bandwidth.
Keywords:	Multicast, Quality Of Service(Qos), Admission Control, Intserv, Diffserv
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	DESIGN AND PERFORMANCE ANALYSIS OF PRECODED OFDM TRANSCEIVERS FOR COGNITIVE RADIO
Author:	S.K.PADMANABHAN, DR.T.JAYACHANDRA PRASAD
Abstract:	The wireless spectrum being an scanty resource, needs to cater up for stipulated number of devices. But with wireless devices becoming pervasive, the provision of spectrum for such a substantial number seems to be an daunting task. Cognitive radio is a technology which uses the spectrum smartly by either sensing the spectrum hole in order to transmit the data or by sharing the available spectrum among two or more users. Hence cognitive radio is indispensible for the spectrum prerequisites. But the main problem is the phenomenon of cognitive interference. Precoded OFDM (Orthogonal Frequency Division Multiplexing) is found to have eliminate the interference by such a way that it gets cancelled as it is propagated. This work also comprises of the analysis of Throughput using MATLAB.
Keywords:	OFDM, Cognitive Radio, Dynamic Spectrum Usage, Overlay Networks, Precoding
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text

Title:	MINING MOVIE REVIEWS – AN EVALUATION
Author:	R.SATHEESH KUMAR, Dr.S.VIJAYAN
Abstract:	Much research on textual information processing focused on mining and retrieval of factual information, like information retrieval, Web search, text classification, text clustering and related text mining and natural language processing tasks. Opinions are subjective expressions describing people’s sentiments, appraisals/feelings to entities, events and their properties. A definition of opinion is very broad. In this paper, it is proposed to extract the feature set from reviews and the reviews are classified as positive or negative using Naïve Bayes, Ada Boost and Fuzzy Lattice reasoning classifier.
Keywords:	Opinion Mining, Sentiment Analysis, Naïve Bayes, Ada Boost, Fuzzy Lattice Reasoning Classifier
Source:	Journal of Theoretical and Applied Information Technology October 2013 -- Vol. 56. No. 2 -- 2013
Full Text