|
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
June 2015 | Vol. 76 No.1 |
Title: |
GRAPH BASED TEXT REPRESENTATION FOR DOCUMENT CLUSTERING |
Author: |
ASMA KHAZAAL ABDULSAHIB, SITI SAKIRA KAMARUDDIN |
Abstract: |
Advances in digital technology and the World Wide Web has led to the increase of
digital documents that are used for various purposes such as publishing and
digital library. This phenomenon raises awareness for the requirement of
effective techniques that can help during the search and retrieval of text. One
of the most needed tasks is clustering, which categorizes documents
automatically into meaningful groups. Clustering is an important task in data
mining and machine learning. The accuracy of clustering depends tightly on the
selection of the text representation method. Traditional methods of text
representation model documents as bags of words using term-frequency index
document frequency (TFIDF). This method ignores the relationship and meanings of
words in the document. As a result the sparsity and semantic problem that is
prevalent in textual document are not resolved. In this study, the problem of
sparsity and semantic is reduced by proposing a graph based text representation
method, namely dependency graph with the aim of improving the accuracy of
document clustering. The dependency graph representation scheme is created
through an accumulation of syntactic and semantic analysis. A sample of 20 news
groups, dataset was used in this study. The text documents undergo
pre-processing and syntactic parsing in order to identify the sentence
structure. Then the semantic of words are modeled using dependency graph. The
produced dependency graph is then used in the process of cluster analysis.
K-means clustering technique was used in this study. The dependency graph based
clustering result were compared with the popular text representation method,
i.e. TFIDF and Ontology based text representation. The result shows that the
dependency graph outperforms both TFIDF and Ontology based text representation.
The findings proved that the proposed text representation method leads to more
accurate document clustering results. |
Keywords: |
Text Representation Schemes, Dependency Graph, Document Clustering, Sparsity
Problem,Semantic Problem. |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
USER SEGMENT OF KOREAN WIDE AREA GLOBAL NAVIGATION SATELLITE SYSTEM |
Author: |
SAYED CHHATTAN SHAH |
Abstract: |
Korean wide area differential global navigation satellite system augments global
navigation satellite system by broadcasting additional signals from
geostationary satellites and providing differential correction messages and
integrity data for the GNSS satellites. It includes a network of wide area
reference stations, wide area master station, ground earth station and
geostationary satellites. Wide area reference stations are widely dispersed GNSS
data collection sites that monitor and process satellite data to determine
satellite orbit and clock drift plus delays caused by atmosphere and ionosphere.
This information is then transmitted to wide area master station which creates
and broadcasts correction messages through geostationary satellites. The user
segment receives and applies correction messages to improve position accuracy
and reliability. This study presents a flexible and robust software design and
data processing algorithms of user segment of Korean wide area differential
global navigation satellite system. The user segment software performs numerous
functions such as calculation of ionosphere and troposphere delays, processing
of correction messages, and data quality monitoring. It implements numerous
tropospheric, ionospheric and position models, supports RINEX and BINEX data
exchange formats, and is designed to work in real time and post processing
modes. It can also be used in precision and non-precision approach modes. The
software is divided into several layers such as Data Processing and
Visualization, and can be easily extended to support various interfaces such as
web interface and mobile device interface. The current version processes global
positioning system and wide area differential global navigation satellite system
data but can be easily extended to support various global navigation satellite
systems such as GLONASS and Galileo. |
Keywords: |
Global Navigation Satellite System, Global Positioning Systems, GPS Augmentation
System |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
A COMPARATIVE EVALUATION OF INTRUSION DETECTION TECHNIQUES IN WIRELESS SENSOR
NETWORK |
Author: |
YOUSEF EL MOURABIT , AHMED TOUMANARI, ANOUAR BOUIRDEN, NADIA EL MOUSSAID |
Abstract: |
Wireless Sensor Network (WSN) are composed of low cost sensor nodes and usually
deploy in open and unprotected area, which make security the major challenge in
this kind of network, due to their characteristics WSN is vulnerable to various
types of attacks and intrusions, where it require security mechanisms to defend
against these attacks. Intrusion detection system (IDS) is one of the principal
and efficient defensive methods against intrusion and attacks in WSN. This paper
presents a comparative evaluation of the most performant intrusion detection
techniques in IDS systems for WSNs and identifying their features. For each
technique, the main principal and the related functionality are briefly
introduced, discussed, and compared, based on the operational advantages and
inconveniences. To implement and measure the performance of these techniques we
prepare our dataset, based on KDD'99, after normalizing our dataset, we
determined normal class and 4 types of attacks, and used the most relevant
attributes for the classification process, by applying CfsSubsetEval with
BestFirst approach. Finally a set of principles are concluded, which have to be
satisfied in future research of implementing IDS for WSNs, in order to help
researchers in the selection of IDS for WSNs, recommendations of promising
proposed IDSs are provided with future directions for this research. |
Keywords: |
Wireless sensor network, Intrusion detection system, Classification, KDD’99 |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
MALAY TEXT FEATURES FOR AUTOMATIC NEWS HEADLINE GENERATION |
Author: |
MOHD SABRI HASAN, SHAHRUL AZMAN MOHD NOAH, NAZLENA MOHAMAD ALI |
Abstract: |
The diversity of natural language for meaning representation in documents is one
of the causes of information overload in information retrieval. Headline
generation is an automatic text summarization technique that can reduce or
address such a problem. This research discusses an experimental study on the
determination of Malay language characteristics from news genre documents. A
Malay news corpus comprising 140 news documents was chosen from the BERNAMA news
archive. The selection criteria were limited to hard news, a word count of 50 to
250 words, published between 2007 and 2012, and with news genres of economy,
crime, education, or sports only. Three Malay linguistic experts were selected
to produce a reference headline for each news document manually. Experiment
results identify three characteristics. First, the first two sentences of a news
document are suitable candidates for the most important sentences; second,
sentences that contain an acronym definition also have the potential to become
the most important sentences; and third, the ideal length of a headline is six
words. Considering these characteristics will generate intelligent headlines for
Malay news. |
Keywords: |
Headline Generation, Text Summarization, Malay News |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
NOVEL PRINTED MONOPOLE TRAPEZOIDAL NOTCH ANTENNA WITH S-BAND REJECTION |
Author: |
B T P MADHAV, 2HARISH KAZA, THANNERU KARTHEEK, VIDYULLATHA LAKSHMI KAZA,
SREERAMINENI PRASANTH, K S SANJAY CHANDRA SIKAKOLLU, MANEESH THAMMISHETTI,
ALUVALA SRINIVAS, K V L BHAVANI |
Abstract: |
A compact coplanar waveguide fed trapezoidal monopole antenna and a notch band
monopole antenna are presented in this paper. Notch Band is obtained between 3-4
GHz, which covers S- band of WiMAX applications. The notch band antenna is
obtained by etching U- slot on the radiating element of the monopole antenna.
The proposed antenna is printed on Rogers RT- Duroid 5880 substrate material
with dielectric constant 2.2 and loss tangent 0.0009. The overall dimension of
the notch band antenna is around 51 x 45 x 1.6 mm. Initially Trapezoidal Notch
band monopole antenna is constructed from the basic design of trapezoidal
monopole wideband antenna and the corresponding antenna parameters and Radiation
characteristics for both the models are analyzed and presented in detail in this
article. |
Keywords: |
Compact Antenna, S- Band, Trapezoidal Wideband Antenna, Trapezoidal Notch
Antenna, Wimax. |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
DESIGN OF NETWORK ARCHITECTURE FOR INTRUSION DETECTION USING SPANNING TREE
MULTICLASS CLASSIFIER IN MANET |
Author: |
V. UMA DEVI, C. CHANDRASEKAR |
Abstract: |
Security in mobile ad-hoc network plays a strategic role to ensure high level of
protection without any intrusions in computer networks. Most of the intrusions
in mobile ad-hoc network are traced and detected by collecting traffic
information and classified according to different classification algorithms.
With individual traffic classifiers design, packet delay is expected to surely
go up with overhead cost rate. These classification processes hosted on mobile
ad-hoc network failed to develop multiclass classifier system under varied
conditions and minimized the efficiency on detecting intrusions in network
architecture. To present mobile ad-hoc network architecture, with
multi-classifier intrusion detection system, a mechanism called, Tuning Spanning
Tree Multiclass Classifier (TSTMC) is proposed in this paper. The TSTMC
mechanism works with multiple classification process in MANET to detect the
intruded distribution nodes. First, Multiclass Neural Shannon’s Entropy based
approach analyzes the network traffic properties based on the count of source
destination pair, packet type, packet size and payload. After analyzing the
traffic rate on MANET, the result are used in the next step to construct
spanning tree network architecture. Secondly, the spanning tree is constructed
with Tuning Tutte polynomial operations where the internal and external traffic
over mobile ad-hoc network is classified. Tuning Tutte polynomial operation is
used effectively to detect the abnormal activities through tuning spanning tree.
Analysis is accomplished for different parameters, including the maximum node
velocity and the average multiclass error rate they experience, node density and
their true positive rate on detecting abnormal activities, packet delay and
classification sensitivity rate. Simulations using NS2 were used to measure the
performance of the mechanism to compare it with the performance of two other
intrusion models for mobile ad-hoc networks, namely, GP and SSUM. The measured
results signify the effectiveness of the proposed mechanism in terms of achieved
multiclass error rate, classification sensitivity and low packet delay. |
Keywords: |
Multiclass Neural Shannon’s Entropy, Mobile Ad-hoc Network, Tuning Spanning
Tree, Intrusion Detection, Tutte Polynomial, Abnormal Activities |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
ANALYSIS OF MODERN ATTACKS ON ANTIVIRUSES |
Author: |
SILNOV DMITRY SERGEEVICH, TARAKANOV OLEG VLADIMIROVICH |
Abstract: |
Modern malware (viruses, worms, and Trojan horses) are increasingly applying
integrated approach inherently and combining multiple technologies to counter
the actions of antivirus software and information security tools. Lack of
specific classification of directions of counteraction and their approaches
creates no clear idea of the degree of threat. This leads to solutions that
cannot fully eliminate a threat. This article considers the first ever case of
classifying counteraction methods to antivirus actions. The classification
presented identified two main approaches of influencing antivirus actions:
targeted and non-targeted attack. After analysing the methods, we classified
false positive virus alarms based on which it is shown that false positives are
systemic in nature. |
Keywords: |
Antivirus, False Positive, Viruses, Retroviruses, False Negative |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
ALL ABOUT SOFTWARE REUSABILITY: A SYSTEMATIC LITERATURE REVIEW |
Author: |
SIHAM YOUNOUSSI, OUNSA ROUDIES |
Abstract: |
Software reusability is an attribute in which software or its module is reused
with very little or no modification. For any organization, improving the
business performance means performing their software development. Software
reusability offers great potential of significant gains for an organization, by
reducing cost and effort, and accelerating the Time to Market of software
products. This paper presents a literature review of various software
reusability concepts. It presents some definitions and benefits of software
reusability, approaches to be adopted to perform reusability, reusability levels
in software life cycle, to reusability, maturity models and attributes affecting
potentiality of software to be reused. |
Keywords: |
Software Reusability Approaches, Software Reusability Benefits, Software
Reusability Levels, Software Maturity Models for Reuse, Software Reusability
Attributes |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
GENERALIZED DISCRETE FOURIER TRANSFORM BASED IMPROVEMENT OF PARTIAL TRANSMIT
SEQUENCE SCHEME TO REDUCE PAPR IN OFDM SYSTEMS |
Author: |
AHMED M. ELSHIRKASI, MOHAMMAD UMAR SIDDIQI, MOHAMED HADI HABAEBI |
Abstract: |
Future applications of communication systems require higher data rates and more
mobility. Orthogonal frequency division multiplexing (OFDM) can achieve these
goals due to it is ability to reach high bit rates over fading channels as well
as its efficient utilization of the bandwidth. However, the transmitted signal
of OFDM suffers from high peak to average power ratio (PAPR). Such signals
require high power amplifier (HPA) of large dynamic range to amplify the whole
transmitted signal without distorting it. This paper gives the results of a
study on the effect of applying the nonlinear phase of generalized discrete
Fourier transform (GDFT) theory on the performance of partial transmit sequence
(PTS) which is one of proposed techniques to mitigate high PAPR of OFDM signal.
This has been done by modifying the phase of data symbols in each OFDM block
before PTS is applied. Simulation results show that the proposed scheme requires
half the number of sub-blocks to achieve the same amount of PAPR reduction
compared with the original PTS scheme. |
Keywords: |
Generalized Discrete Fourier Transform, OFDM, PAPR, CCDF, PTS |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
META PHYSICAL ALGORITHMIC REPRESENTATION FOR FLAWLESS CLUSTERING |
Author: |
K. MOHANA PRASAD , DR. R. SABITHA |
Abstract: |
Data mining is defined as analyzing data from a large database .The task
performed by data mining is clustering, which are used for grouping the data
objects to form a new class .The two algorithms of clustering is MH-means
(modified harmonic means ) and GSA(gravitational search algorithm).MH-means is
the algorithm with some random based centroid for desired clusters. In this
algorithm every data object are assigned to the closest centroid. It is used to
calculate the mean value of data objects within the clusters , so that they
reach an optimal solution. MH-meansis an iterative process. GSA is based on
interaction of masses in universe through Newtonian Gravity law. The role of GSA
is to identify the problem in space. By combining the MH-means and GSA
algorithms the performance is increased. Along with this combination a new
method Standard Dataset is also used. The standard dataset are used for
increasing the convergence speed of the proposed methods. |
Keywords: |
Clusters ,Centroid, Gravity Law ,GSA , MH-means. |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
IMAGE SEGMENTATION USING A HYBRID CLUSTERING TECHNIQUE AND MEAN SHIFT FOR
AUTOMATED DETECTION ACUTE LEUKAEMIA BLOOD CELLS IMAGES |
Author: |
FARAH H. A. JABAR, WAIDAH ISMAIL , ROSALINA A.SALAM , ROSLINE HASSAN |
Abstract: |
Clustering is one of the most common automated segmentation techniques used in
the fields of bioinformatics applications specifically for the microscopic image
processing usage. Recently many scientists have performed tremendous research in
helping the haematologists in the issue of segmenting the leukocytes region from
the blood cells microscopic images in the early of prognosis. During the post
processing, image filtering can cause some discrepancies on the processed image
which may lead to insignificant result. This research aims to segment the blood
cell microscopic images of patients suffering from acute leukaemia. In this
research we are using three clustering techniques which are (Fuzzy C-Means (FCM),
Classic K-Means (CKM) and Enhanced K-Means (EKM) then we performed filtering
techniques which are Mean-shift Filtering (MSF) and Seeded Region Growing (SRG).
We tested individual clustering, from the results it show Enhanced K-Means gives
the best result. We performed hybrid between EKM and MSF gave a better result
from other comparison. The integrated clustering techniques have produced
tremendous output images with minimal filtering process to remove the background
scene. |
Keywords: |
Image Segmentation; Enhanced K-Means, Meanshift, Leukaemia Cells |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
THE MODERATING EFFECT OF WEB SERVICE ON THE RELATIONSHIP BETWEEN BUSINESS
ANALYTICS AND SUPPLY CHAIN PERFORMANCE |
Author: |
BIJAN GANJI JAMEHSHOORAN , AWALUDDIN. M. SHAHAROUN , HABIBAH NOREHAN HARON |
Abstract: |
In recent years, supply chain performance measurement has received much
attention from researchers and practitioners. Effective supply chain performance
through supply chain antecedents such as business analytics has become a
potentially valuable way of securing competitive advantage and improving supply
chain performance. Many organizations have begun to recognize that supply chain
management is the key to building a sustainable competitive advantage for their
products or services in an increasingly crowded marketplace. Despite the fact
that, determining supply chain performance through its antecedents is considered
as a unique methodology, theoretical and comprehensive studies on supply chain
performance through the methodology is few and far between. This study addressed
the lack of the empirical studies by developing a comprehensive model to examine
the effect of plan analyse, source analyse, make analyse and delivery analyse on
supply chain performance considering moderating effect of WS on the
relationships. A quantitative methodology using a cross-sectional survey method
was used to investigate the relationship between variables. Data were collected
from automotive companies in Iran. The overall response rate was 86.72%. The
relationships between variables were examined using structural equation
modelling (SEM) technique and partial least squares (PLS) software was used to
examine the proposed hypotheses. The results revealed there is a significant and
positive relationship between four areas of business analytics namely plan
analyse, source analyse, make analyse and delivery analyse and supply chain
performance. Moreover, the results indicated that the aforementioned
relationship is moderated by WS. The study combined resource- based theory,
resource dependence theories to develop a new theoretical framework to
demonstrate the importance of the four areas of SCOR approach businesses
analytic; in improving supply chain performance. Moreover, the study has
provided a new platform to effectively improve supply chain performance. |
Keywords: |
Supply Chain Performance (SCP),Business Analytics (BA),Supply Chain Operations
Reference (SCOR) model, information system (IS), plan analyse (PA), source
analyse (SA),make analyse (MA) and delivery analyse (DA). |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
IMPROVEMENT OF SHORTEST-PATH ALGORITHMS USING SUBGRAPHS' HEURISTICS |
Author: |
FAISAL KHAMAYSEH, NABIL ARMAN |
Abstract: |
Given a graph G=(V,E,w), where V and E are finite set of vertices and edges
respectively, is a directed weighted graph with weights denoted by w(e)>0 for
each edge e ∈E. P(s,t) is the shortest path between the given vertices <s> and
<t> containing the least sum of edge weights on the path from <s> to <t>.
Properties of the graph representation, using different matrix structures to
represent the graph in normal flow and reverse representations, are considered.
Based on these structures, a new algorithm determines the candidate subgraphs
and prunes every subgraph that is either unreachable from the given source
vertex <s> or does not lead to the given destination<t>, benefiting from the
rich information inherent in the matrix and reverse matrix structure
representations of the graph. The experiments were conducted using our heuristic
and the conventional shortest path finding, namely Dijkstra’s algorithm.
Practical results are given showing considerable improvements of the proposed
algorithm in performance. This improves the shortest path algorithm
significantly. |
Keywords: |
Shortest Path, Pruning, Graph Algorithms, Candidate Subgraphs, Heuristics |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
AN AUGMENTED DYNAMIC ROUND ROBIN CPU SCHEDULING ALGORITHM |
Author: |
N SRINIVASU , A.S.V. BALAKRISHNA , R. DURGA LAKSHMI |
Abstract: |
The Round Robin (RR) CPU scheduling algorithm is a fair scheduling algorithm
that gives equal time quantum to all processes. The choice of the time quantum
is critical as it affects the algorithm’s performance. This paper proposes a new
algorithm that enhanced on the Improved Round Robin CPU (IRR) scheduling
algorithm. The proposed algorithm was implemented and benchmarked against basic
round robin algorithms available in the literature. The proposed algorithm
compared with the basic round robin algorithms, produces minimal average waiting
time (AWT), average turnaround time (ATAT), and number of context switches (NCS).
From the obtained results we observed that proposed algorithm met better
scheduling criterion than the basic round robin scheduling algorithm. |
Keywords: |
Scheduling Criteria, Scheduling Algorithms, Round Robin, Time Quantum, Waiting
Time, Context Switches. |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
Title: |
INTEGRATION AND IMPLIMENTATION SYSTEM-ON-A-PROGRAMMABLE-CHIP (SOPC) IN FPGA |
Author: |
A.ZEMMOURI , MOHAMMED ALAREQI, R.ELGOURI, M.BENBRAHIM, L.HLOU |
Abstract: |
The real-time hardware application is developed around a FPGA hardware
architecture that includes embedded processor MicroBlaze on the field
programmable gate array (FPGA).This paper introduces a design of a Micro Blaze
soft-core processor system that can be running the output pins (XGI Expansion
Headers Protocol) as such as clock generator to feed external circuits. The
designed processor system is programmed in C language to manage, and specify the
number of clock generators selected. It focuses on implementation XGI Expansion
Headers Protocol and an interface RS232 serial communication on a Xilinx FPGA,
which allows bidirectional data transfer with an external application.
The aim of the paper is twofold. Firstly, to synthesize a processor on Xilinx
FPGA chip and then to control of Expansion Headers inputs / outputs of the board
through implementation code compiled in C language on the MicroBlaze processor.
This implementation has been simulated using ISE Simulator (ISim) software tools
and the design to be implemented targeting Virtex5 (XUPV5-LX110T). |
Keywords: |
Processor Microblaze, FPGA, EDK, SDK, RS232, UART, XGI Expansion Headers
Protocol. |
Source: |
Journal of Theoretical and Applied Information Technology
10th June 2015 -- Vol. 76. No. 1 -- 2015 |
Full
Text |
|
|
|