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

Paper ID:	14213 -JATIT
Title:	NONLINEAR ADAPTIVE BACKSTEPPING CONTROL OF PERMANENT MAGNET SYNCHRONOUS MOTOR (PMSM)
Author:	A. LAGRIOUI, H. MAHMOUDI
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	In this paper, a nonlinear adaptive speed controller for a permanent magnet synchronous motor (PMSM) based on a newly developed adaptive backstepping approach is presented. The exact, input-output feedback linearization control law is first introduced without any uncertainties in the system. However, in real applications, the parameter uncertainties such as the stator resistance and the rotor flux linquage and load torque disturbance have to be considered. In this case, the exact input-output feedback linearization approach is not very effective, because it is based on the exact cancellation of the nonlinearity. To compensate the uncertainties and the load torque disturbance, the input-output feedback linearization approach is first used to compensate the nonlinearities in the nominal system. Then, nonlinear adaptive backstepping control law and parameter uncertainties, and load torque disturbance adaptation laws, are derived systematically by using adaptive backstepping technique. The simulation results clearly show that the proposed adaptive scheme can track the speed reference s the signal generated by a reference model, successfully, and that scheme is robust to the parameter uncertainties and load torque disturbance.
Keywords	Feedback input-output linearization – Adaptive Backstepping control, Permanent Magnet Synchronous Motor (PMSM)
Full Text

Paper ID:	14807 -JATIT
Title:	NEUROMUSCLESCHELETIC ILLNESS IN MOVEMENT ISSUES FOR CEREBRAL PARALYSIS DETECTION SYSTEM
Author:	M. en C. Martha Rosa Cordero López, M. en C. Marco Antonio Dorantes González
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	The present project has a social focus, which pretends develop a system (hardware and software) capable to achieve a valuation of the neuromusclescheletic children’s march, which is cerebral paralysis. This valuation will be done by several images, representing the march of the studied subject in a graphic way, to be compared with a normal march patron that will be evaluated by an expert who will determinate a proper treatment, witch will inhibit the low extremities’ dominating muscles to improve the subject march.
Keywords	Databases, Webcam, Software Engineering, Graphic Treatment, Pattern Recognition, Cerebral Paralysis, Neuromusclescheletic Illness.
Full Text

Paper ID:	14115 -JATIT
Title:	ACTIONABLE FILTERING THEMES IN EXECUTIVE INFORMATION SYSTEMS FOR MANAGING INFORMATION OVERLOAD
Author:	SAMEER DUTTA
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	Executives are subjected to relentless onslaught of information. Many strategies have been suggested in the past to negotiate the torrents of information flows confronting executives. This paper recommends modifying the structure of information flows reaching the executives as an effective strategy to manage information overload. Such a strategy will enhance the actionability of the decisions taken by the executives who use information inflows as inputs to such decision making. Autonomous software agents can be used for the purpose of building more effective information inflow structures.
Keywords	Information Overload, Autonomous Agents, Executive Information Systems
Full Text

Paper ID:	14171 -JATIT
Title:	AN EFFICIENT COST FUNCTION FOR IMPERIALIST COMPETITIVE ALGORITHM TO FIND BEST CLUSTERS
Author:	MOJGAN GHANAVATI, MOHAMAD REZA GHOLAMIAN, BEHROUZ MINAEI, MEHRAN DAVOUDI
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	Cluster analysis is one of the attractive data mining techniques that have been used in many fields. One of the popular types of clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings. K-means is dependent on the initial state and convergence to local optima in some of the large problems. In order to these shortcomings, in an unsupervised clustering the number of clusters needs to be fixed by a human analyst too. In order to overcome local optima problem and for determining the number of clusters, lots of studies done in clustering. In this paper we use a new search heuristic called “Imperialist Competitive Algorithm ” to find the best clusters with best numbers of clustering. In this algorithm we assume each clustering solution with special clusters number as a country and use a new cost function to calculate the clustering cost in each step. We compared proposed algorithm with other heuristics algorithm in clustering, such as traditional K-means, IGKA, CSO and GA-PSO by implementing them on several well-known datasets. Our findings show that the proposed algorithm works better than the others according to cost function and standard deviation.
Keywords	Clustering; Meta-heuristic; K-means; Imperialist Competitive Algorithm
Full Text

Paper ID:	14211 -JATIT
Title:	INDIRECT SLIDING MODE CONTROL OF A PERMANENT MAGNET SYNCHRONOUS MACHINE: FPGA-BASED IMPLEMENTATION WITH MATLAB & SIMULINK SIMULATION
Author:	BADRE BOSSOUFI, MOHAMMED KARIM, SILVIU IONITA, AHMED LAGRIOUI, HASSAN MAHMOUDI
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	These last thirty years were outstanding by the revolution of technology possibilities in the field of digital electronics and this, as much as within context of programmable solutions like (Microcontroller, DSP,…etc), than of reconfigurable solutions (CPLD, FPGA). Among all these possibilities, Field Programmable Gate Array (FPGA devises) is a good compromise between the advantage of the flexibility of a configurability solution, high frequency and the efficiency of a particular architecture with a high integration density. In this paper is presents a detailed description of the structure by Indirect Sliding Mode of Permanent Magnet Synchronous Machine PMSM. Experimental results carried from a prototyping platform are given to illustrate the efficiency and the benefits of the proposed approach and the various stages of implementation of this structure in FPGA.
Keywords	FPGA, Indirect Sliding Mode Control, Permanent Magnet Synchronous Machine (PMSM), Power System Control, Systems Generator, Reusability, PWM.
Full Text

Paper ID:	14292 -JATIT
Title:	RECURSIVE RELATION FOR COUNTING THE COMPLEXITY OF BUTTERFLY MAP
Author:	DOUNIA LOTFI, 2MOHAMED EL MARRAKI, 3ABDULHAFID MODABISH
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	Graph theory is used to represent a communication network by expressing its linkage structure, the vertices represent objects and the pairs called edges or represent the interconnections between objects. The exact geometric positions of vertices or the lengths of the edges are not important. The purpose of this paper is to find a recursive relation counting the number of spanning tree in Butterfly map that illustrate a connection problem suggested by Erdös and Rényi in 1962: Let there be given a country with n cities, n large, so that a direct air connection between two cities would require two busy airports. Considering the capacity limits of the airport, what is the number of flights that would get a passenger from any one city to another so that he needs change planes not more than once? Many results of this problem were given in the past [1], [4]
Keywords	Graph, Map, Spanning Trees, Complexity
Full Text

Paper ID:	14195 -JATIT
Title:	PERFORMANCE COMPARISON OF RANDOM NUMBER GENERATION TECHNIQUES TO MINIMIZE THE REDUNDANCY FOR RETRIEVAL OF DATABASE RECORDS
Author:	T. SANTHANAM, K. MEENAKSHI SUNDARAM, M. SAROJA, C.P. SUMATHI
Source:	Journal of Theoretical and Applied Information Technology Vol 29. No. 1 -- 2011
Abstract	The major process in the education methodology is organizing and conducting the examination. Administration of the question paper setting is an important task in the objective-type examination system. While setting the objective type question paper, the highlighted problems are the lack of expertise, the time, and the questions redundancy. Generally, during the retrieval of records from an objective type question bank redundancy may occur even for the large size databank as well as smaller size databank. To solve this problem, a methodology is required to retrieve records from a database without redundancy. This paper discusses the impact of mid-square, mid-product and constant multiplier techniques for random number generation, to retrieve records from the question bank with minimal redundancy as far as possible. To retrieve records from a database, a modified approach is identified and applied to generate random numbers. Also, this paper justifies the role of suggested approach, which performs reasonably better than the actual techniques reported in the literature for records retrieval process even for a smaller size database.
Keywords	Minimizing Redundancy, Record Retrieval, Objective Type Question Bank, Mid-Square Technique, Mid-Product Technique, Constant Multiplier Technique
Full Text