|
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
December 2011 | Vol. 34 No.1 |
Paper ID: |
14190
-JATIT |
Title: |
MEAN AND STANDARD DEVIATION FEATURES OF
COLOR HISTOGRAMUSING LAPLACIAN FILTER FOR CONTENT-BASED IMAGE RETRIEVAL |
Author: |
FAZAL-E-MALIK |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 001 - 007 Vol 34. No. 1 -- 2011 |
Abstract |
Due to the development and improvement in
internet with high speed for the last few years andthe availability of a large
digital image collection, efficient image retrieval systems are required.
Retrievalcan be text-based and content-based. In content-based, which is also
called Content-Based Image retrieval(CBIR), low level features of images are
extracted such as color, texture and shape. These features areused in similarity
measurement to retrieve relevant images from an image database. A CBIR algorithm
isproposed which is based on the color histogram using Laplacian filter to
reduce the noise and provides anenhanced image with more detail informations.
Color histogram of the filtered image is divided into bins.Mean and standard
deviation are calculated for pixels in each bin to get feature vector which is
used forimage retrieval. After various experiments with user queries, results
show the good retrieval of images byalgorithm. |
Keywords |
Content-Based Image Retrieval (CBIR),
Feature Vector, LaplacianFilter, Histogram |
Full Text |
|
Paper ID: |
14803
-JATIT |
Title: |
WEB VIRTUAL BALL GAME “POK-TA-POK” |
Author: |
M. C. MARCO ANTONIO, GONZÁLEZ, M. C.
MARTHA ROSA CORDERO, JORGE BENJAMÍN SILVA GONZÁLEZ |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 008 - 013 Vol 34. No. 1 -- 2011 |
Abstract |
The next pages describes the development
of the web virtual ball game “Pok-Ta-Pok”, the followed methods and the achieved
results on the developing of a system capable to recreate the ballgame matches
for two players in a local web, making use of actual techniques in game
development such as 3D modeling, texturing, skeletal animation, artificial
intelligence algorithms, programming techniques on GPU to effect addition and
videogame controls. |
Keywords |
Design Of Learning, Educational Systems,
Video Game, Ball Game, Mayan Civilization, Culture, Learning System,
Entertainment. |
Full Text |
|
Paper ID: |
14237
-JATIT |
Title: |
DESIGN OF POWER TRANSFORMER FOR SINUSOIDAL
AND NONSINUSOIDAL CURRENT CONDITIONS |
Author: |
MUHAMMAD MOKHZAINI, SYAFRUDIN MASRI,
MOHAMAD KAMAROL |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 014 - 021 Vol 34. No. 1 -- 2011 |
Abstract |
Harmonics in current has become an
apparent and important consideration in designing a power transformer. This is
due to the fact that the loads now have become nonlinear in character. These new
generations of loads are invented to assist various functions in homes,
factories, offices, and factories. However they created distortions at the
current shape thus causing terrible consequences toward power transformers. Most
of transformers are designed, manufactured, and calibrated using only sinusoidal
shape current. Thus the existence of harmonics clearly upset the operation
parameters such as the increased losses the transformer experienced. This paper
tends to look into designing a power transformer that considers harmonics in
current. Steps in designing a particular transformer are shown to emphasis the
areas needed to be change whenever the current consist harmonics. An initial
design is made with only sinusoidal current while the second design would
consider harmonic components in current, up until the 11th order. Some
recommendations on enlarging size of the core dimension is made at the end of
the paper. |
Keywords |
Core Dimensions, Current Harmonics,
Nonlinear Load, Total Harmonic Distortion, Power Transformer Loss |
Full Text |
|
Paper ID: |
14364
-JATIT |
Title: |
FUZZY ARTMAPNEURAL NETWORK ACHITECTURE FOR
WEATHER FORECASTING |
Author: |
A.C. SUBHAJINI, T. SANTHANAM |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 022 - 028 Vol 34. No. 1 -- 2011 |
Abstract |
Accurate weather forecasting plays a vital
role for planning day to day activities. Neural network has been use in numerous
meteorological applications including weather forecasting. A neural network
model has been developed for weather forecasting, based on various factors
obtained from meteorological experts. The back propagation neural network,
radial basis function neural network, Generalized Regression Neural Networks and
Fuzzy ARTMAP architectureare used in this study to test the performance in order
to investigate which technique for weather forecasting most effective. The
results indicate that proposed Fuzzy ARTMAP Neural Networks is better than back
propagation neural network, Radial Basis Function and Regression neural network.
The prediction accuracy of Fuzzy ARTMAP is 97.95%. |
Keywords |
Weather forecasting, Radial Basis
Function, Back Propagation Neural, Network,Regression Neural Networks ,Fuzzy
ARTMAP |
Full Text |
|
Paper ID: |
14446
-JATIT |
Title: |
AN EVALUATION OF K-MEANS BASED ANN USING
FOREST FIRE DATA IN SPATIAL DATA MINING |
Author: |
N.NAGA SARANYA, G.PADMAPRIYA, S.HEMALATHA,
M.HEMALATHA |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 029 - 033 Vol 34. No. 1 -- 2011 |
Abstract |
The explosive growth of spatial data and
extensive utilization of spatial databases [1] emphasize the necessity for the
automated discovery of spatial knowledge. In modern times, spatial data mining
has emerged as an area of huge research. Forest fires are a chief green concern,
causing inexpensive and environmental damage while endangering human lives
across the world. The fast or early detection of forest fires [2] is a essential
element for controlling such phenomenon. The application of remote sensing is at
present a significant method for forest fires monitoring [3], particularly in
vast and remote areas. This paper presents an intelligent system to detect the
presence of forest fires in the forest spatial data using SMO and Artificial
Neural Networks. Extensive experimental assessments on publicly available
spatial data illustrated the efficiency of the proposed system in effectively
detecting forest fires. Finally, since large fires are rare dealings, outlier
detection techniques will also be addressed. |
Keywords |
Spatial Data Mining, Forest Fire Data, SMO,
ANN |
Full Text |
|
Paper ID: |
14493
-JATIT |
Title: |
IMPLICATION OF IMAGE PROCESSING ALGORITHM
IN REMOTE SENSING AND GIS APPLICATIONS |
Author: |
MUBEENA PATHAN, K.JUSOFF, M. S. ALIAS, Y.
RAZALI, Q. BARKATULLAH |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 034 - 041 Vol 34. No. 1 -- 2011 |
Abstract |
An algorithm solves the complex problems
more efficiently and consistently. The traditional ways of solving the problems,
have been replaced, by several new algorithms. The selection of an appropriate
algorithm for any given chore is an imperative issue because different
algorithms are based on the different concepts. One problem can be solved in
more than one way; in this regards many alternative algorithms are developed
with computational proficiency. This review presents evaluation and utilization
of different algorithms such as Simple Recursive Algorithm, Backtracking
Algorithm, Divide and Conquer Algorithm, Dynamic Algorithm, Branch and Bound
Algorithm, Brute Force Algorithm and Randomized Algorithm. This paper generally
analyzed and branch out algorithms to perceive their limitations and
delimitation. This review emphasizes the effects and consumption of different
algorithms in different image processing applications. Minimum Spanning Tree
(MST), the most functional algorithm, described exclusively by the undirected
graph in which all nodes are connected. Greedy algorithms expresses as a simple
solution algorithm that choose a local optimum solution at each step to achieve
a global optimum. We considered the drawbacks and advantage various algorithms
and concluded that Greedy algorithm is comparatively better than other
algorithms regarding the optimal solution. |
Keywords |
Minimum Spanning Tree, Prim’s Algorithm,
Kruskal Algorithm, Greedy Algorithm. |
Full Text |
|
Paper ID: |
14317
-JATIT |
Title: |
BIONOMIC ALGORITHM FOR SHORTEST PATH FIRST |
Author: |
AZAM KHAN, SAIRA BEG, FARAZ AHSAN, SAJJAD
MOHSIN |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 042 - 049 Vol 34. No. 1 -- 2011 |
Abstract |
In this paper we propose the idea of using
Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very
important issue associated with many other tasks like network routing and
graph/map analysis etc. Different techniques have been used for solving the SPF
problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic
Algorithm, Tabu Search etc. The choice of algorithm for any specific problem
depends upon the complex tradeoffs between complexity, performance etc. Our aim
is to use type 3 heuristics algorithm for SPF. Simulations are carried out for
BA algorithm and Dijkstra algorithm using MATLAB. |
Keywords |
Shortest Path Algorithm (SPF), Bionomic
Algorithm (BA) |
Full Text |
|
Paper ID: |
14534
-JATIT |
Title: |
AUTONOMIC SERVICE COMPOSITION THROUGH
CONTEXT ORIENTATION APPROACH |
Author: |
JUNAID AHSENALI CHAUDHRY, SAQIB ALI,
MD ASRI BINNGADI, ABDUL HANAN ABDULLAH |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 050 - 056 Vol 34. No. 1 -- 2011 |
Abstract |
In this paper we present a novel service
composition scheme for ubiquitous environments. As in a ubiquitous system there
are many heterogeneous devices connected to each other in various topologies and
one type of application that gives optimal performance on one node can perform
differently from the other nodes. Our scheme addresses this issue through a
dynamic service composition scheme that considers constrains on a local node and
generates an application with near optimal performance with respect to its
context. We simulate the scheme in our project environment consisting of hybrid
mesh. The overall objective is to propose an efficient mechanism to meet the
optimization demands at software level. |
Keywords |
Autonomic Computing, Service Composition,
Component based development, Autonomic Control Systems, Ubiquitous Systems |
Full Text |
|
Paper ID: |
14569
-JATIT |
Title: |
MULTICORE PARALLEL LOOSELY COUPLED
FRAMEWORK FOR PROCESSING MOBILE OBJECTS |
Author: |
JAWDAT ALSHAER, IBRAHIM AL-OQILY, SULIEMAN
BANI-AHMAD, ADNAN ALRABEE |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 057 - 064 Vol 34. No. 1 -- 2011 |
Abstract |
Large numbers of mobile objects and
continuous queries about them characterize mobile object applications. Efficient
and parallel evaluation of queries about mobile objects that continuously move
is important for achieving acceptable response times. In such applications, the
traditional approaches suffer from the need for parallel updates processing and
real time querying and visualization. This results in poor performance in such
critical systems. The emerging multicore and manycore microprocessing
technologies have the potential to offer scalable performance improvement. How
to explore the multicore resources to speed up mobile objects applications is
thus a natural question but also a huge challenge for Moving Objects
Applications (MOA). In this paper, we propose and evaluate a methodology to
explore parallelism via multi-threading, transactional loosely coupled
methodology design, and to implement it on multicore processors for Moving
Objects Applications. We apply the proposed methodology of the loosely coupled
strategy, which has been identified as the key strategy in many design
optimizations for different data dependency types, to time-constrained location
applications. A parallel framework and its implementation on multicore
processors for the proposed strategy have been developed based on multi-threaded
concepts. Experiments of using loosely coupled multithreaded parallelization to
produce mobile objects parallel query processing and visualization showed clear
improvement in terms of speed and efficiency. |
Keywords |
Mobile Objects, Parallel Programming,
Spatial Temporal, Loosely Coupled Parallel Processing, Multicore Applications |
Full Text |
|
Paper ID: |
14652
-JATIT |
Title: |
IMPLEMENTATION OF AN INTELLIGENT
SURVEILLANCE SYSTEM FOR ELDERLY |
Author: |
S. KHAWANDI, B. DAYA, P. CHAUVET |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 065 - 070 Vol 34. No. 1 -- 2011 |
Abstract |
One of three adults 65 or older falls
every year. Injuries sustained among the elderly because of falls are a major
problem worldwide. Demographic predictions of population aged 65 and over
suggest the need for telemedicine applications in the eldercare domain. In this
paper, we propose an intelligent surveillance system that monitors human
activities with a particular interest of the problem of fall detection. To make
the motion detection and object tracking fully automatic and robust under
different illumination conditions, combination of best-fit approximated ellipse
around the face and temporal changes of head position, would provide a useful
cue for detection of different behaviors. The system identifies the face,
collects data such as speed of movement, and triggers an alarm on the
determination of fall event. Reliable recognition rate of experimental results
underlines satisfactory performance of our system. |
Keywords |
Intelligent System, Elderly Surveillance,
Fall Detection, Face Detection, Webcam |
Full Text |
|
Paper ID: |
14656
-JATIT |
Title: |
ARCHITECTURE AND FUNCTIONAL STRUCTURE OF
TRANSMISSION CONTROL PROTOCOL OVER VARIOUS NETWORKS APPLICATIONS |
Author: |
GHASSAN A. ABED, MAHAMOD ISMAIL, KASMIRAN
JUMARI |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 071 - 079 Vol 34. No. 1 -- 2011 |
Abstract |
The communication functions and
applications divided into layers, and each device or terminal has a assigned
’stack’ in these layers, where that permit each layer to speak and address the
corresponding stack in other layers. That is one of the benefits of layering:
the ability to change a layer without requiring other layers to change as well,
as long as the service and semantics provided by the layer remain intact. The
fourth layer in layered model is transport layer where the protocols can provide
a tight connection between any two hosts or more than two. Also it provides
explicit of data transferring between end terminals or users, and that will help
the upper layers from any involvement to provide reliable and cost-effective in
transferring data in links, even it will control the reliability of a given
links. Transmission Control Protocol (TCP) is a basic communication language,
and a connection oriented protocol tied with transport layer consists of
collection of rules and procedures to control communication between links. TCP
offers important features of flow control, reliability, congestion control, and
connection management. This article provide full-overview to the network
layering based on Open Systems Interconnection (OSI) model and explains the
architecture and the functional structure of TCP over transport layer and
analyzes the factors and parameters that effect on TCP behavior and performance. |
Keywords |
TCP, OSI model, Network Layers, RTT. |
Full Text |
|
Paper ID: |
14567
-JATIT |
Title: |
USING MULTIBOOT TECHNIQUE TO CREATE A
MULTIPLE EMBEDDED DESIGNED SYSTEMS |
Author: |
M. R. KHALIL , S. A. MOHAMMED |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 080 - 087 Vol 34. No. 1 -- 2011 |
Abstract |
The research aims to save two
configurations of two embedded designed systems in Intel Strata Flash Parallel
NOR PROM available on Spartan-3E Starter kit in order to increase the
capabilities of the XC3S500E FPGAs slice. Multiboot methodology is adopted to
perform the goal of the work. Embedded development kit(EDK) prepared by Xilinx
company is employed to develop two different embedded systems. Picoblaze
microcontroller is used for the purpose of programming the Intel Strata Flash
PROM. Integrated software environments, Xilinx ISE, is used to instantiate
STARTUP_SPARTAN3E component for the verification of Multiboot techniques. |
Keywords |
Soft-Core Processor, Multiboot,
Configuration, STARTUP_SPARTAN3E. |
Full Text |
|
Paper ID: |
14760
-JATIT |
Title: |
AN OVERVIEW OF PREPROCESSING OF WEB LOG
FILES FOR WEB USAGE MINING |
Author: |
C.P. SUMATHI, R. PADMAJA VALLI , T.
SANTHANAM |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 088 - 095 Vol 34. No. 1 -- 2011 |
Abstract |
With the Internet usage gaining popularity
and the steady growth of users, the World Wide Web has become a huge repository
of data and serves as an important platform for the dissemination of
information. The users’ accesses to Web sites are stored inWeb server
logs.However, the data stored in the log files do not present an accurate
picture of the users’ accesses to the Web site. Hence, preprocessing of the Web
log data is an essential and pre-requisite phase before it can be used for
knowledge-discovery or mining tasks. The preprocessed Web data can then be
suitable for thediscovery and analysis of useful information referred to as Web
mining. Web usage mining, a classification of Web mining, is the application of
data mining techniques to discover usage patterns from clickstream and
associated data stored in one or more Web servers.This paper presents an
overview of the various steps involved in the preprocessing stage. |
Keywords |
Web Server, Data Cleaning, User
Identification, Session Identification, Path Completion |
Full Text |
|
Paper ID: |
14635
-JATIT |
Title: |
ENTROPY ANALYSIS FOR ACHIEVING HIGH
COMPRESSION RATIO |
Author: |
S.SARAVANAN, R.VIJAY SAI, R.SILAMBAMUTHAN,
E.DEEPA, G.ELAKKIYA, HAR NARAYAN UPADHYAY |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 096 - 099 Vol 34. No. 1 -- 2011 |
Abstract |
Deciding test data volume is a major
challenge in present System on Chip (SoC) design. Compaction of test data volume
results in high compression ratio. Entropy analysis plays a vital role in such
cases. Entropy is measurement of the amount of information contained in the data
set. Entropy calculations tell the need of how much test data vector that can be
compressed. This paper is based on finding entropy calculations to achieve
maximum test data compression. Further, entropy study for unspecified bits
(don’t care bits) and complement method are also explored which result in high
compression ratio. Entropy analysis for different symbol length partitioning is
done. For the fixed-length symbol, one fill and zero fill algorithm is applied
for unspecified bits, reducing the entropy. The proposed method is successfully
tested on ISCAS89 which achieves maximum compression ratio |
Keywords |
Entropy Analysis, Unspecified Bit, One And
Zero Fill Techniques, Test Data Compression |
Full Text |
|
Paper ID: |
14577
-JATIT |
Title: |
CLASSIFICATION OF IMAGES USING JACCARD
CO-EFFICIENT AND HIGHER-ORDER CO-OCCURENCES |
Author: |
K. ANURADHA, 2 N. SAIRAM |
Source: |
Journal of Theoretical and Applied
Information Technology
pp 100 - 105 Vol 34. No. 1 -- 2011 |
Abstract |
In this paper, we propose a clustering
algorithm to deal with the medical image categorization. The algorithm
implements an approach, which accepts a set of medical images as categorical
input. The categorical inputs are compared with the given pool of images and the
result is given in the form of boolean points. The Jaccard co-efficient
similarity method does the classification by identifying the neighbors. The
higher order co-occurrences with χ-sim Algorithm[2], which has been used for
text categorization is implemented for identifying the similarity between
images. The proposed approach is tested on images of different sets |
Keywords |
Image Categorization, Clustering,
Higher-Order Co-Occurrence |
Full Text |
|
|
|