		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 2011 | Vol. 32 No.1

Paper ID:	14357 -JATIT
Title:	SPANNING TREES RECURSIONS FOR CROSSES MAPS
Author:	DOUNIA LOTFI, MOHAMED EL MARRAKI, DRISS ABOUTAJDINE
Source:	Journal of Theoretical and Applied Information Technology pp 01 - 07 Vol 32. No. 1 -- 2011
Abstract	It is known that Kirchhoff Matrix Theorem computes the number of spanning trees in any graph G by taking a determinant; so far, many works derived a recursive function to calculate the complexity of certain families of maps specially Grid map. In this paper we give the major recursive formula that counts the number of spanning trees in the general case of grid graph, then we propose some spanning trees recursions for families of planar graphs called crosses maps such as the cross grid and the cross ocotogonal map by using the spanning tree theorem and we give a new algorithm to count the complexity of some particular maps such as the kite map.
Keywords	Planar Graph, Map, Complexity, Spanning Tree, Grid Graph
Full Text

Paper ID:	14448 -JATIT
Title:	IMPROVED BICLUSTERING ALGORITHM FOR GENE EXPRESSION DATA
Author:	SADIQ HUSSAIN, PROF. G.C. HAZARIKA
Source:	Journal of Theoretical and Applied Information Technology pp 08 - 14 Vol 32. No. 1 -- 2011
Abstract	Biclustering algorithms simultaneously cluster both rows and columns. These types of algorithms are applied to gene expression data analysis to find a subset of genes that exhibit similar expression pattern under a subset of conditions. Cheng and Church introduced the mean squared residue measure to capture the coherence of a subset of genes over a subset of conditions. They provided a set of heuristic algorithms based primarily on node deletion to find one bicluster or a set of biclusters after masking discovered biclusters with random values. The mean squared residue is a popular measure of bicluster quality. One drawback however is that it is biased toward flat biclusters with low row variance. In this paper, we introduce an improved bicluster score that removes this bias and promotes the discovery the most significant biclusters in the dataset. We employ this score within a new biclustering approach based on the bottom up search strategy. We believe that the bottom-up search approach better models the underlying functional modules of the gene expression dataset.
Keywords	Bicluster, Gene expression Data, Clustering, Pattern Recognition
Full Text

Paper ID:	14455 -JATIT
Title:	GRAY CODE AND HAMMING DISTANCE FOR GRAPH OF Sn(123,132)
Author:	A. JUARNA, A.B. MUTIARA
Source:	Journal of Theoretical and Applied Information Technology pp 15 - 19 Vol 32. No. 1 -- 2011
Abstract	As we noted that an isomorphism between two combinatorial classes is a closeness preserving bijection between those classes, that is, two objects in a class are closed if and only if their images by this bijection are also closed. Often, as in this paper, closeness is expressed in terms of Hamming distance. Isomorphism allows us to find out some properties of a combinatorial class X (or for the graph induced by the class X) if those properties are found in the pre image of the combinatorial class X; some mentioned properties are hamiltonian path, graph diameter, exhaustive and random generation, and ranking and unranking algorithms. Simion and Schmidt showed in 1985 that the cardinality of the set Sn(123,132) length n permutations avoiding the patterns 123 and 132, is 2n-1, but in the other side 2n-1 is the cardinality of the set Bn-1 = {0,1}n-1 of length (n-1) binary strings. Theoretically, it must exist a bijection between Sn(123,132) and Bn-1. In this paper we give a constructive bijection between Bn-1 and Sn(123,132); we show that it is actually an isomorphism and illustrate this by constructing a Gray code for Sn(123,132) from a known similar result for Bn-1.
Keywords	Pattern-Avoiding Permutations; Binary Strings, Constructive Bijection; Hamming Distance; Combinatorial Isomorphism
Full Text

Paper ID:	14443 -JATIT
Title:	A MULTI ROUTING ALGORITHM FOR AD-HOC NETWORKS
Author:	Mehdi Bahrami, Mohammad Bahrami
Source:	Journal of Theoretical and Applied Information Technology pp 20 - 27 Vol 32. No. 1 -- 2011
Abstract	Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. In this network, this topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Each node acting as both a host and a router moves arbitrarily and communicates with others via multiple wireless links. The primary application for ad hoc networks has been for military operations. In this paper we propose new routing algorithms for path energy as an additional metric for routing. The motive behind this effort is to study the effect of the added metric on improving the lifespan of the Ad-Hoc communication network and the corresponding effect on the overall network performance.
Keywords	Ad-Hoc Networks, Network Routing, Route Discovery
Full Text

Paper ID:	14397 -JATIT
Title:	PERFORMANCE EVALUATION OF A CLOUD BASED LOAD BALANCER SEVERING PARETO TRAFFIC
Author:	AYMAN G. FAYOUMI
Source:	Journal of Theoretical and Applied Information Technology pp 28 - 34 Vol 32. No. 1 -- 2011
Abstract	Cloud resources represent an unforeseeable breakthrough in ITC industry. Load balancer is a key element in resource provisioning for high available cloud solutions, and yet its performance depends on the traffic offered load. We develop a discrete event simulation to evaluate the performance with respect to the different load points. The performance metrics were the average waiting time inside the balance as well as the number of tasks. The performance study includes evaluating the chance of immediate serving or rejecting incoming tasks. Pareto traffic was considered for the offered traffic.
Keywords	Cloud Computing, Load Balancer, Pareto Distribution, Self-Similar Traffic, Discrete-Event Simulator
Full Text

Paper ID:	14451 -JATIT
Title:	EVALUATIN OF QoS PARAMETERS ON TCP/IP IN WIRELESS AD HOC NETWORKS
Author:	ALOK KUMAR JAGADEV, BINOD KUMAR PATTANAYAK, AJIT KUMAR NAYAK, MANOJRANJAN NAYAK
Source:	Journal of Theoretical and Applied Information Technology pp 35 - 45 Vol 32. No. 1 -- 2011
Abstract	Wireless ad hoc network is a collection of mobile nodes interconnected by multi-hop communication paths forming a temporary network without the aid of any centralized administration or standard support services regularly available as in conventional networks. The topology of the network changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR) and Ad hoc On-demand Distance Vector (AODV) routing protocols. In this paper, these protocols are evaluated by a set of parameters such as throughput, delay, packet loss, etc., and we analyze the Quality of Service (QoS) parameters from the network perspective looking into two different TCP/IP layers: transport layer and network layer. The impacts of node loads on different QoS metrics in both layers are evaluated too. As the simulation results suggest, AODV demonstrates the best performance even in the networks with moving mobile nodes. The on-demand protocols, AODV and DSR perform better than the table driven DSDV protocol. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility and network size. In transport layer, because of UDP’s connectionless nature, it does not need any confirmation for receiving data, which makes UDP protocol suitable in critical time applications (real time applications) in comparison with other transport layer protocols such as TCP
Keywords	AODV, DSR, DSDV, Delay, Throughput
Full Text

Paper ID:	14450 -JATIT
Title:	A ROBUST MULTISTAGE ALGORITHM FOR CAMERA SELF-CALIBRATION DEALING WITH VARYING INTRINSIC PARAMETERS
Author:	ADNANE EL-ATTAR, MOHAMMED KARIM, HAMID TAIRI, SILVIU IONITA
Source:	Journal of Theoretical and Applied Information Technology pp 46 - 54 Vol 32. No. 1 -- 2011
Abstract	We present a practical algorithm for camera self-calibration dealing with varying parameters. Given a projective reconstruction, we retrieve the calibration matrices for each frame by minimizing a non-linear least square. We firstly start the minimization procedure by a stage of initialization to get a first estimation of the focal lengths, then, we start the estimation of the camera intrinsic parameters in a multistage algorithm, in each stage a parameter is estimated assuming some constraints on the other parameters. In the final stage a refinement of all parameters is done at once to allow them to vary freely. The robustness and accuracy of the algorithm are shown in the experiments on both synthetic and real data.
Keywords	Camera Self-Calibration, Multistage Algorithm, Varying Intrinsic Parameters, Least Square Minimization
Full Text

Paper ID:	14351 -JATIT
Title:	A NOVEL EMBEDDING SCHEME BASED ON WALSH HADAMARD TRANSFORM
Author:	HOUDA JOUHARI, EL MAMOUN SOUIDI
Source:	Journal of Theoretical and Applied Information Technology pp 55 - 60 Vol 32. No. 1 -- 2011
Abstract	The purpose of steganography is to send secret message by embedding data into some innocuous cover objects such as digital images. The data hiding method used until now is the syndrome coding method. In this paper, we present an improved data hiding scheme defined by boolean functions. Using some properties of Boolean functions we construct a new steganographic scheme in which we can hide more information compared to the scheme based on syndrome coding.
Keywords	Walsh Hadamard Transform, Error Correcting Codes, Matrix Encoding, Boolean Functions, Reed Muller Codes, Embeding Efficient
Full Text

Paper ID:	14385 -JATIT
Title:	A SHUNT ACTIVE POWER FILTER CONTROLLED BY FUZZY LOGIC CONTROLLER FOR CURRENT HARMONIC COMPENSATION AND POWER FACTOR IMPROVEMENT
Author:	HAMZA BENTRIA
Source:	Journal of Theoretical and Applied Information Technology pp 61 - 70 Vol 32. No. 1 -- 2011
Abstract	This paper describes work that is being done in the design of a three phase shunt active filter for electrical power quality purposes. This type of filter is able to compensate the harmonic current caused by the non-linear loads. The main objective of this work is the study and the comparison of two types of control algorithms applied on this shunt active filter. These two types of control are the notch filter and the synchronous reference algorithms, they used to generate the references current of the compensator, the last one algorithm is based on two types of voltage controller, the classical controller PI (proportional-integral) and the fuzzy logic controller , they used for the DC voltage regulation. The hysteresis band method is employed to derive the switching signals of the compensator. A series of simulation by MATLAB/SIMULINK environment are presented and discussed in this paper to show the performance and the effectiveness of these control strategies.
Keywords	Shunt active filter, Voltage regulation, hysteresis control, Fuzzy logic controller, PI controller
Full Text

Paper ID:	14400 -JATIT
Title:	SARON MUSIC TRANSCRIPTION USING LPF-CROSS CORRELATION
Author:	YOYON K SUPRAPTO, DIAH PUSPITO WULANDARI, ARIS TJAHJANTO
Source:	Journal of Theoretical and Applied Information Technology pp 71 - 79 Vol 32. No. 1 -- 2011
Abstract	Nowadays, mining of traditional music attracts people’s interests in several aspects since the importance of archiving national heritage is emphasized. Unfortunately, there have been very few researches which analyzed traditional music instruments and their performances. Gamelan, one of Indonesia’s traditional music instruments, has uniqueness in terms of its hand-made construction which in turn induces variations in frequency, amplitude, and resonance. These conditions have detained the exploration and development of gamelan music itself. This research initiates gamelan sound extraction for music transcription as part of traditional music analysis. Spectral density model was constructed to extract the sound of an instrument from the gamelan ensemble performance by using LPF cross correlation (LPF-CC). The extracted sound was analyzed to generate notations. The experiment demonstrates 5-16% note error rate.
Keywords	Saron Time And Frequency Model, LPF Cross-Correlation, Saron Extraction, Music
Full Text

Paper ID:	14417 -JATIT
Title:	PSEUDO GENETIC AND PROBABILISTIC-BASED FEATURE SELECTION METHOD FOR EXTRACTIVE SINGLE DOCUMENT SUMMARIZATION
Author:	ALBARAA ABUOBIEDA M. ALI, NAOMIE SALIM, RIHAB ELTAYEB AHMED, MOHAMMED SALEM BINWAHLAN, LADDA SUANMALI, AHMED HAMZA
Source:	Journal of Theoretical and Applied Information Technology pp 80 - 87 Vol 32. No. 1 -- 2011
Abstract	Text features, as a scoring mechanism, are used to identify the key ideas in a given document to be represented in the text summary. Considering all features within same the level of importance may lead to generate a summary with low quality. In this paper, we present a feature selection method using (pseudo) Genetic probabilistic-based Summarization (PGPSum) model for extractive single document summarization. The proposed method, working as features selection mechanism, is used to extract the weights of features from texts. Then, the weights will be used to tune features’ scores in order to optimize the summarization process. In this way, important sentences will be selected for representing the document summary. The results show that, our PGPSum model outperformed Ms-Word and Copernic summarizers benchmarks by obtaining a similarity ratio closest to human benchmark summary.
Keywords	Summarization, Text Features, Genetic, Probabilistic, Similarity, Sentence Score, Features Weights, Binary Selection
Full Text

Paper ID:	14419 -JATIT
Title:	OBJECT-ORIENTED PROGRAMMING SEMANTICS REPRESENTATION UTILIZING AGENTS
Author:	TEH NORANIS MOHD ARIS
Source:	Journal of Theoretical and Applied Information Technology pp 88 - 98 Vol 32. No. 1 -- 2011
Abstract	Comprehending Object-Oriented Programming (OOP) is not an easy task especially by novice students. The problem occurs during the transition from learning fundamental programming language concept to OOP concept. It is very important to handle this problem from the beginning before novices learn more advanced OOP concepts like encapsulation, inheritance, and polymorphism. Learning programming from source code examples is a common behavior among novices. Novices tend to refer to source codes examples and adapt the source codes to the problem given in their assignments. To cater the problems faced by these novices, a novel agent-based model have been designed to assist them in comprehending OOP concepts through source codes examples. The instructor needs to provide two related source codes that are similar but in different domain. Generally, these source codes go through the preprocessing, comparison, extraction, generate program semantics and classification processes. A formal algorithm that can be applied to any two related Java-based source codes examples is invented to generate the semantics of these source codes. The algorithm requires source codes comparison based on keyword similarity to extract the words that exist in the two related source codes. Three agents namely SemanticAgentGUI, semanticAgent and noviceAgent are designed in the proposed model. The running system shows an OOP semantic knowledge representation by intelligent agents.
Keywords	OOP Semantics, Source Codes Comparison, Keyword Similarity, Extraction, Classification
Full Text

Paper ID:	14439 -JATIT
Title:	POSITION CONTROL OF DC SERVO MOTORS USING SOFT-CORE PROCESSOR ON FPGA TO MOVE ROBOT ARM
Author:	A. Z. MANSOOR, M. R. KHALIL, O. A. JASIM
Source:	Journal of Theoretical and Applied Information Technology pp 99 - 106 Vol 32. No. 1 -- 2011
Abstract	A new method of controlling position of DC Servo motor using PicoBlaze soft-core processor on Field Programmable Gate Array (FPGA) is adopted. The soft processor is used to generate the PWM required to create motor motion and direction. The soft processor hardware system is build using VHDL, while the processor is programmed using assembly language. The type of control board used is XILINX FPGA SPARTAN-3E (XC3S500E). The system performance is debugged using chipscope technique and oscilloscope. The real time operation performance is done with five DC servo motors that are joined for testing motion of the robot arm. The results show that the position of the servo motors set was controlled efficiently.
Keywords	Field Programmable Gate Array (FPGA), Soft-core processor, Very High Speed Integrated Circuit Hardware Description Language (VHDL), Pulse Width Modulation (PWM)
Full Text