|
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
August 2010 | Vol. 18. No.1 |
Paper ID: |
1395 -JATIT-2K10 |
Title: |
AN APPROACH OF DYNAMIC FILTER FOR WEATHER
ENVIRONMENT DEPENDENT ON TIME |
Author: |
WA’EL JUM’AH AL-ZYADAT, RODZIAH BINTI ATAN |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
In
general dynamic filter has difficulty to execute the process because the Input
/Output rapid change and its link-time directly almost work is synchronized
within received data, the effectiveness for the results its and evaluations for
all functions to process compatible usability, the structure designed for
approach is Full Life Cycle Object-Oriented Testing (FLOOT) which aims the
domain for weather its special environment which means high data sets is needed
to support for end-user to predict the results in addition FLOOT give validity
forward and backward processes and able to correct any error if discovered.
Through experiments, we show our approach improves the performance of filtering
information in two types of recognizes errors systems adopting the re-process
data and visualization, respectively. In this paper will provide approach to
resolve impact environment to data stream and enhancement filtering process
interaction. |
Keywords |
Data
filtering, Enhanced Data, Clustering, Error Detecting, Full Life Cycle
Object-Oriented Testing (FLOOT) |
Full
Text |
|
Paper ID: |
1398 -JATIT-2K10 |
Title: |
WIENER INDEX OF PLANAR MAPS |
Author: |
M. EL MARRAKI, A. MODABISH |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
In trees with n vertices, the Wiener index
of tree is minimized by stars and maximized by paths, both uniquely. In this
paper, we give an inequality similar in the case of planar maps |
Keywords |
Wiener index, maps, trees |
Full
Text |
|
Paper ID: |
1401 -JATIT-2K10 |
Title: |
FISH RECOGNITION BASED ON ROBUST FEATURES
EXTRACTION FROM COLOR TEXTURE MEASUREMENTS USING BACK-PROPAGATION CLASSIFIER |
Author: |
MUTASEM KHALIL ALSMADI, KHAIRUDDIN BIN
OMAR, SHAHRUL AZMAN NOAH, IBRAHIM ALMARASHDEH |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Problem statement: image recognition is a
challenging problem researchers had been research into this area for so long
especially in the recent years, due to distortion, noise, segmentation errors,
overlap, and occlusion of objects in digital images. In our study, there are
many fields concern with pattern recognition, for example, fingerprint
verification, face recognition, iris discrimination, chromosome shape
discrimination, optical character recognition, texture discrimination, and
speech recognition, the subject of pattern recognition appears. A system for
recognizing isolated pattern of interest may be as an approach for dealing with
such application. Scientists and engineers with interests in image processing
and pattern recognition have developed various approaches to deal with digital
image recognition problems such as, neural network, contour matching and
statistics.
Approach: in this work, our aim is to recognize an isolated pattern of interest
in the image based on the combination between robust features extraction. Where
depend on color texture measurements that are extracted by gray level
co-occurrence matrix.
Result: We presented a system prototype for dealing with such problem. The
system started by acquiring an image containing pattern of fish, then the image
segmentation is performed relying on color texture measurements. Our system has
been applied on 20 different fish families, each family has a different number
of fish types, and our sample consists of distinct 610 of fish images. These
images are divided into two datasets: 500 training images, and 110 testing
images. An overall accuracy is obtained using back-propagation classifier was
84% on the test dataset used.
Conclusion: We developed a classifier for fish images recognition. We
efficiently have chosen a image segmentation method to fit our demands. Our
classifier successfully design and implement a decision which performed
efficiently without any problems. Eventually, the classifier is able to
categorize the given fish into its cluster and categorize the clustered fish
into its poison or non-poison fish, and categorizes the poison and non-poison
fish into its family. |
Keywords |
Neural network, ANN, image
segmentation, gray level co-occurrence matrix, color texture, digital image
recognition, and feed forward back propagation classifier, poison and non-poison
fish |
Full
Text |
|
Paper ID: |
1406 -JATIT-2K10 |
Title: |
SECURITY PROBLEMS AND THEIR UPSHOTS IN
ROUTING PROTOCOLS OF DHT BASED OVERLAY NETWORKS |
Author: |
ANIL SAROLIYA, VISHAL SHRIVASTAVA |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Distributed hash tables (DHTs) are a very
interesting research topic in the area of P2P overlay networks; such networks
are becoming very popular in applications like file sharing. The purpose of the
Distributed Hash Table is providing the way to search the resources (especially
files) within a P2P network. A DHT protocol typically provides a single function
to the P2P application: provide a key and find the node (or may be nodes) which
is liable for such key [1][3]. All other functions (such as actually retrieving
the resource or storing the resource on the node responsible for it) are
provided by higher layers of the P2P application. In such paper our target is to
find the security issues and resolve them on existing routing protocols of such
networks. The Chord [4] (a DHT protocol) is chosen as the target protocol for
various reasons it will be covered in this paper. |
Keywords |
peer-to-peer overlay
networks, distributed hash tables, routing, security |
Full
Text |
|
Paper ID: |
1394 -JATIT-2K10 |
Title: |
THE GRANULARITY APPROACH OF LEARNING
OBJECTS TO SUPPORT ADAPTABILITY IN ADAPTIVE LEARNING SYSTEMS |
Author: |
BATTOU AMAL, EL MEZOUARY ALI, CHERKAOUI
CHIHAB, MAMMASS DRISS |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
The main goal of this paper is to examine
the fine granularity of learning content and its impact of the adaptability
process in Adaptive Learning Systems (ALS). For that purpose, we present the
concept and the essence of learning objects. Then, we approach some content
models by clarifying the adopted levels of granularity and/or aggregation. After
that, we discuss the fine-grained as a fundamental characteristic to reach the
adaptability and individualization required in ALS. Finally, we propose our own
model of learning objects by underlining the levels of granularity considered
and by presenting a use case of its ability to meet the properties associated
with fine-grained and adaptability. |
Keywords |
Adaptability, Learning
Content, Adaptive Learning Systems, learning object, granularity, learning
content |
Full
Text |
|
Paper ID: |
1370 -JATIT-2K10 |
Title: |
EFFICIENT COLOUR IMAGE SEGMENTATION USING
MULTI-ELITIST- EXPONENTIAL PARTICLE SWARM OPTIMIZATION |
Author: |
K.M.MURUGESAN, Dr. S. PALANISWAMI |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Multi-Elitist Particle Swarm Optimization
Algorithm (MEPSO) for Image cluster classification and segmentation was proposed
in [2]. It employs a kernel-induced similarity measure instead of the
conventional sum-of-squares distance. Use of the kernel function makes it
possible to cluster data that is linearly non-separable in the original input
space into homogeneous groups in a transformed high-dimensional feature space.
This particle representation scheme has been adopted for selecting the optimal
number of clusters from several possible choices. In [3] we proposed exponential
particle swarm optimization (EPSO). EPSO has a great impact on global and local
exploration it is supposed to bring out the search behaviour quickly and
intelligently as it avoid the particles from stagnation of local optima by
varying inertia weight exponentially, so that the movement of the particles will
be faster and distant from each other. The aim of the above two enhanced
Particle swarm techniques were to produce a fuzzy system for color
classification and image segmentation with least number of rules and minimum
error rate. The enhanced PSO techniques are used to find optimal fuzzy rules and
membership functions. The best fuzzy rule is selected for image segmentation.
The enhanced PSO techniques give best rule set than standard PSO.In this paper
we combined both the technique to produce better result than the two individual
techniques. We call this PSO as MEEPSO (Multi elitist exponential particle swarm
optimization).We implement and evaluate the effectiveness of this new enhanced
PSO techniques and prove that the proposed PSO technique is better than existing
two enhanced PSO techniques. |
Keywords |
PSO, EPSO, MEPSO, MEEPSO,
Colour, fitness, Classification, Fuzzy Logic, Image Segmentation, fitness,
global best, local best |
Full
Text |
|
Paper ID: |
-JATIT-2K10 |
Title: |
A STEGANOGRAPHY SCHEMA AND
ERROR-CORRECTING CODES |
Author: |
M. B. Ould MEDENI, El Mamoun SOUIDI |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
The idea of "Matrix encoding" was
introduced in steganography by Crandall in 1998 [6]. The implementation was then
proposed by Westfeld with steganography algorithm F5 [1]. The objective is to
transmit a message within an image, but with the constraint of minimizing the
number of changed coefficients of this image. In this paper, a new construction
of steganography protocol is considered, which is an extension of the error
correcting code and steganography construction. The proposed method consists of
use the Majority logic decoding introduced in [5], for embedding the message in
the cover image, the extraction function is always based on syndrome coding. An
asymptoticly tight bound on the performance of embedding schemes is given. |
Keywords |
Steganography, Error
correcting code, Majority logic decoding average distortion, matrix encoding,
embeding efficient. |
Full
Text |
|
Paper ID: |
1096 -JATIT-2K10 |
Title: |
DEVELOPMENT OF AND USABILITY FINDINGS FOR
A WEB-BASED OSTEOARTHRITIS GUIDE |
Author: |
GITESH K. RAIKUNDALIA, JOANNE TROPEA,
CHRISTOPHER A. BAIN, JIM BLACK, CAROLINE BRAND |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Osteoarthritis (OA) of the knee and hip
causes significant loss of quality of life due to pain, reduced mobility and
limited ability to perform usual daily activities. OA is a chronic, debilitating
condition that affects up to 18 percent of those aged 65 years and over. The
traditional approach to treating this condition has been to involve a number of
different healthcare providers, such as specialist doctors, general
practitioners, nurses, physiotherapists, dieticians, etc. In addition to
healthcare provider care, a patient education and OA self-management system (in
the form of a web guide) could possibly also assist sufferers to manage their
condition.
This paper describes the OA web guide we have developed. It covers the
functionality of the system using the various user interfaces of the guide. A
usability experiment was performed with OA experts and end-users to determine
the effectiveness of the system and to learn how to improve such a system. The
paper also describes the usability experiment and conveys our findings from the
experiment. |
Keywords |
Osteoarthritis, Web guide,
usability experiment, heuristic evaluation, patient education |
Full
Text |
|
Paper ID: |
1338 -JATIT-2K10 |
Title: |
RECTANGULAR MICROSTRIP PATCH ANTENNA ON
LIQUID CRYSTAL POLYMER SUBSTRATE |
Author: |
B.T.P.MADHAV, PROF. VGKM PISIPATI, K V L
BHAVANI, P.SREEKANTH, P. RAKESH KUMAR |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Patch antennas are one of the most
attractive antennas for integrated RF front end systems due to their
compatibility with microwave integrated circuits. To fulfill the demand of
integrated RF front end systems, a design of microstrip patch antenna with
optimum performance at 12 GHz is investigated. It is also investigated how the
performance properties of a microstrip patch antenna are affected by varying the
dielectric constant of substrate and width to length ratio of the patch. In this
present work a liquid crystal polymer substrate with dielectric constant of 3.1
is taken and the total simulation is done using the software Ansoft-HFSS. |
Keywords |
Microstrip patch, LCP
Substrate |
Full
Text |
|
Paper ID: |
1405 -JATIT-2K10 |
Title: |
AN IMPLEMENTATION OF WEB PERSONALIZATION
USING WEB MINING TECHNIQUES |
Author: |
A.JEBARAJ RATNAKUMAR |
Source: |
Journal of Theoretical and Applied
Information Technology
Vol 18. No. 1 -- 2010 |
Abstract |
Web mining is the application of data
mining techniques to extract knowledge from Web. Web mining has been explored to
a vast degree and different techniques have been proposed for a variety of
applications that includes Web Search, Classification and Personalization etc.
Most research on Web mining has been from a ‘data-centric’ point of view. In
this paper, we highlight the significance of studying the evolving nature of the
Web personalization. Web usage mining is used to discover interesting user
navigation patterns and can be applied to many real-world problems, such as
improving Web sites/pages, making additional topic or product recommendations,
user/customer behavior studies, etc. A Web usage mining system performs five
major tasks: i) data gathering, ii) data preparation, iii) navigation pattern
discovery, iv) pattern analysis and visualization, and v) pattern applications.
Each task is explained in detail and its related technologies are introduced.
The Web mining research is a converging research area from several research
communities, such as Databases, Information Retrieval and Artificial
Intelligence. In this paper we implement how Web mining techniques can be apply
for the Customization i.e Web personalization. |
Keywords |
Usage Mining, Navigation
Patterns, Pattern Analysis, Content Mining, Structure Mining |
Full
Text |
|
|
|