|
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 2013 | Vol. 58 No.3 |
Title: |
HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL
SEARCH |
Author: |
B.RADHA, Dr. V.SUMATHY |
Abstract: |
With network technology development, Grid Computing satisfies the demand of
scientific community’s computing power. Grid facilitates global computing
infrastructure for user to utilize the services over the network. A robust
multi-objective scheduling algorithm is required to optimize workflow grid
execution. Scheduling is a research area in Grid computing. Grid scheduling’s
objective is to deliver Quality of Service (QoS) to grid users and raise
resource use. Three conflicting objectives like execution time (makespan), total
cost and reliability are considered in this investigation. A Genetic Algorithm
(GA) including an Ant Colony Optimization (ACO) to schedule grids is proposed in
this investigation. The proposed GA with local search proves its effectiveness
in Grid Scheduling. |
Keywords: |
Grid Computing, Grid scheduling, Genetic Algorithm (GA), Ant Colony Optimization
(ACO) |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
FACTORS THAT DETERMINE EELECTRONIC MEDICAL RECORDS USERS SATISFACTION: A CASE OF
INDONESIA |
Author: |
TOGAR ALAM NAPITUPULU, SURYANTO HASOLOAN JULHAM PATRIA |
Abstract: |
The purpose of this study was to find factors that influence the level of user
satisfaction of Elecronic Medical Records (EMR). Several factors were considered
which are: the effectiveness of EMR systems (performance expectancy), ease of
use and learning system of EMR (effort expectancy), the condition of facilities
which facilitate EMR system (facilitating condition), the quality of information
provided by the system (information quality), and culture organization (sharing
knowledge). Three moderate variables were also introduced such as age, period of
employment and expertise in using a computer. The research was carried out by
taking samples from the hospitals that have implemented EMR in the country. The
data obtained then was tested and analyzed using the framework of Structural
Equations Modeling (SEM), to test the hypothesis in two steps, i.e.,
measurements modeling using confirmatory factor analysis (CFA) and structural
modeling, using simultaneous linear regression. The findings of the study
indicated that of the five factors in the test (performance expectancy, effort
expectancy, quality information, facilitating condition, sharing knowledge),
were all have impact on the level of user satisfaction on EMR. Practical
implications of the findings, among others, would be that these important
factors should always be considered as element of strategy in developing better
information systems. |
Keywords: |
Electronic Medical Records, User Satisfaction, SEM |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
AN EXPEDITED TRIPLE KEY BROADCAST AUTHENTICATION SCHEME BASED ON TESLA, ECDH,
AND ECDSA |
Author: |
M. RAMESH KUMAR, SURESH GNANA DHAS |
Abstract: |
Wireless Sensor Networks (WSNs) are prone to various security breaches as they
are placed in hostile environments. Several security and broadcast
authentication mechanisms were proposed for securing the WSN fully via key
exchange mechanisms, handshake protocols, and other routing protocols. But these
existing schemes cannot detect a variety of attacks and are not competent in
terms of detection accuracy, resiliency, memory consumption, and transmission
energy. An expedited triple key broadcast authentication scheme is proposed
based on TESLA (Timed Efficient Stream Loss-tolerant Authentication) protocol,
ECDH (Elliptic Curve Diffie-Hellman) key agreement scheme, and ECDSA (Elliptic
Curve Digital Signature Algorithm). The signature verification process is
accelerated by releasing few intermediate computation results in the WSN by the
sensor nodes. This WSN authentication scheme performs better compared to other
security schemes, in terms of accuracy, detection of attacks, resiliency, memory
consumption, nodal detection, and average of total transmission energy consumed
per node. |
Keywords: |
Elliptic Curve Diffie-Hellman (ECDH), Signature, ECDSA
(Elliptic Curve Digital Signature Algorithm), False positive, Signature, and
Timed Efficient Stream Loss-tolerant Authentication (TESLA) |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
AN IMPLEMENTATION OF WEB CONTENT EXTRACTION USING MINING TECHNIQUES |
Author: |
BADR HSSINA, ABDELKARIM MERBOUHA, HANANE EZZIKOURI, MOHAMMED ERRITALI, , BELAID
BOUIKHALENE |
Abstract: |
The Web has continued to grow up since its inception in volume of information,
in the complexity of its topology, as well as in its diversity of content and
services. This phenomenon was transformed the web in spite of his young age to
an obscure media to take useful information. Today, they are billions of HTML
documents, images and other media files on the Internet.
Taking into account the wide variety of the web, the extraction of interesting
content has become a necessity. Web mining came as a rescue for the above
problem. Web content mining is a subdivision under web mining, which is defined
as “the process of extracting useful information from the text, images and other
forms of content that make up the pages” by eliminating noisy information .This
extraction process can employ automatic techniques and hand-crafted rules. In
this paper, we propose a method for web data extraction that uses hand-crafted
rules developed in Java. |
Keywords: |
Web Mining, Content Extraction, Web Cleaning |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
HYBRID GREEDY – PARTICLE SWARM OPTIMIZATION – GENETIC ALGORITHM AND ITS
CONVERGENCE TO SOLVE MULTIDIMENSIONAL KNAPSACK PROBLEM 0-1 |
Author: |
FIDIA DENY TISNA A., SOBRI ABUSINI, ARI ANDARI |
Abstract: |
In this research, we present a hybrid algorithm called Greedy – Particle Swarm
Optimization – Genetic Algorithm (GPSOGA). This algorithm is based on greedy
process, particle swarm optimization, and some genetic operators. Greedy
algorithm is used as initial population, Particle Swarm Optimization (PSO) as
main algorithm and Genetic Algorithm (GA) as support algorithm. Multidimensional
knapsack problem 0-1 (MKP 0-1) will be used as test problem. To solve MKP 0-1,
GPSOGA divided into 3 variants: GPSOGA (1), GPSOGA (2), and GPSOGA (3) based on
criteria how they choose an initial solution in each algorithm. Then we will see
which variant that is better to solve MKP 0-1, in term of the best solution ever
known, the average of solution in each run, and the average of computational
time. After running program individually, we can see that GPSOGA (3) is more
suitable than GPSOGA (1) and GPSOGA (2) to solve MKP 0-1. Because it can solve
the test problem more accurate, and have better average solution except in Data
2 and Data 3. We also provide convergence analysis to GPSOGA solution. So, it
can be proved that GPSOGA solution is always convergent to global optimum and it
can’t exceed the exact solution in solving MKP 0-1. |
Keywords: |
Genetic Algorithm, Greedy Algorithm, Multidimensional Knapsack Problem 0-1,
Particle Swarm Optimization |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
INTEGRATED DEBIT CUM CREDIT CARD WITH DYNAMIC CARD SELECTION AND CARD LOCKING |
Author: |
S. RAJARAJAN, K.S. SURESH, M. PRABHU |
Abstract: |
Banking cards are widely used for performing various financial transactions. The
usage of cards is considered to be convenient and safe over transactions by cash
payments. There are several types of cards available today and among them, the
debit and credit cards are the most commonly used. Debit cards are provided by
the banks to the account holders in order access the accounts electronically. A
credit card is a payment card issued to the users as a system of payment. Every
credit card holder gets a revolving account with the card issuing bank and
granted with a line of credit. Most of the banks offer both credit cards and
debit cards. Due to the benefits of debit and credit cards, a normal customer
would prefer to have both the cards and selectively use either of the cards for
a transaction. Even though it is beneficial to have both the cards, carrying two
separate cards everywhere is regarded as inconvenient and unsafe. So the
objective our work is to devise a model to integrate two card functionalities
into one card and let the user choose the mode of the card. In our model, the
user may change the card mode using the keypad provided at the backside/front of
the card. A four digit security pin has to be entered for that. User could see
the present mode of the card on a small LCD screen available in the card. When
the card mode is set to ‘lock’, the card gets blocked and any attempt to use the
card will be declined. Unlocking could be done by restoring the mode to debit or
credit. The proposed model of the card incorporates a Processor, ROM, NVRAM, LCD
screen and a keypad. The whole circuit will be powered by battery. Finally a
review of the model is done and the benefits, limitations and future research
possibilities as identified. |
Keywords: |
Bank, Credit card, Debit card, ATM |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
CONTROL OF TRANSFORMERLESS UNINTERRUPTED POWER SUPPLY FOR UNITY POWER FACTOR AND
SINUSOIDAL INDUCTOR CURRENTS |
Author: |
SHAILAJA K , B. UMAMAHESWARI |
Abstract: |
This paper discusses the design of controller for transformerless
uninterruptible power supply (UPS), with simultaneous ac and dc loading. The
objective of the design is to maintain good regulation of the ac and dc voltages
and sinusoidal inductor currents simultaneously. The volt-second balance across
the output filter inductor is used to maintain the current in sinusoidal form
which is the unique contribution of this paper. Complete analytical design
solution is provided for both rectifier and inverter simultaneously.
Implementation of the controller requires simple analog circuits. The proposed
solution is validated through simulation and experimentation. |
Keywords: |
Ac And Dc Load, Carrier Based Modulation, Half Bridge Boost Rectifier,
Transformerless UPS |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
ONLINE INTERNAL FAULT IDENTIFICATION IN TRANSFORMERS BASED ON DIRECTION AND
LOCATION OF MAGNETIZING SIGNATURE PATTERNS |
Author: |
R.SENTHIL KUMAR, K.R.SUGAVANAM N.PRABHAKARAN, V.SENTHIL KUMAR, Dr.N.R.SHANKER |
Abstract: |
The transformers are designed to transmit and distribute electrical power.
Depending on the size of the requirement, replacement costs will be more if any
fault occurs. Performing offline and invasive test also added to the replacement
cost. Hence there is an increasing need to move from traditional schedule based
maintenance programs to condition based maintenance. A large number of
techniques are available for transformer health monitoring however a focused
approach is required for diagnostics. Considering the long service life of a
power transformer and prevalent use of human judgment, there is a need to
structure a knowledge base around expert knowledge while continuing to create
new diagnostic capabilities which can be plugged in. A novel method of online
detection of the faults in the transformer is done by using the spectral
signature of the flux emitted by the transformer during the running condition.
In the flux based transformed fault identification region based fault can be
detected at the earlier stage. From the experimental result it has concluded
that flux based fault detection is efficient method for prefault detection when
compared to the existing method. The flux based fault discrimation in
transformer is more efficient. |
Keywords: |
Electromagnetic Flux, Transformer Faults, Predictive Maintenance, Spectral
Signature, Flux Sensor |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
A NOVEL ELLIPTIC CURVE CRYPTOGRAPHY BASED AODV FOR MOBILE AD-HOC NETWORKS FOR
ENHANCED SECURITY |
Author: |
M JANARDHANA RAJU, Dr.P.SUBBAIAH, V.RAMESH |
Abstract: |
The all-pervading nature of communication networks has paved the way for the
development of wireless and internet applications, making communication possible
all over the world. With the explosion of networks and the huge amount of data
transmitted along, securing the data content is becoming more and more
important. Mobile ad hoc networks are multi hop wireless networks without fixed
infrastructure. So there is a possibility to get several types of attacks
including denial of service attacks, which leads to consume the system resources
like bandwidth, power and memory. To keep away from these vulnerable attacks
researchers proposed many schemes, but still those are possessing massive
threats. Hence there is a necessity of new secure routing mechanism. Hence, we
have introduced a novel secured Elliptic Curve based Ad-hoc On-demand Distance
Vector routing protocol. Here the main advantage with ECC is, it takes less
memory provides great security and flawlessly suitable for low power devices
like mobile nodes. So the performance of the overall system is good compare with
other secure routing mechanisms. |
Keywords: |
Elliptic Curve Cryptography, AODV, RSA, SEAD, SRP |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
A MODEL OF OPENEHR-BASED ELECTRONIC MEDICAL RECORD IN INDONESIA |
Author: |
A.B. MUTIARA, A. MUSLIM, T. OSWARI, R. ASRITA |
Abstract: |
For the realization of the vision and mission of Healthy Indonesia 2015, we need
a health service with a broad and comprehensive scope.To provide health
services, it can be realized by creating an integrated information system
applications such as creating an electronic medical record that has the ability
to process and store patient medical data. The specifications used medical
record is an open specification contained in OpenEHR that includes information
and service model for electronic medical records, demographics, and the
archetype which allows software developers taking the logical structure as a
universal functional interface, so it can facilitate the process of information
by the recipient. It is because of using the interface with appropriate-purposed
data presentation and data on computer screen of the same users. The purpose of
this paper is to create an electronic website for the medical record by using
OpenEHR specifications for easy accessing, processing and storing the medical
records by the actors that play a role in the data processing of medical
records. With this application it is expected to be useful for data processing
and health information gathering, thus to improve the quality of services that
will impact the improved performance of the hospital management. The improved
performance of the hospital management will become a supporter of the vision and
mission Healthy Indonesia 2015. |
Keywords: |
Electronic Medical Records (EMR), Health Information System (HIS), OpenEHR, HL7 |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
QoS ASSURED DYNAMIC BANDWIDTH ALLOCATION IN EPON-LTE NETWORKS |
Author: |
S. RAMYA, N. NAGARAJAN, B. KAARTHICK |
Abstract: |
Ensuring stringent Quality of Service (QoS) requirements is a critical issue in
determining the performance of the network. Added to that, when the network
happen to be converged Ethernet Passive Optical Network (EPON) and Long Term
Evolution (LTE) which is essential for today’s bandwidth-intensive customer
needs, it is still more critical. Hence, allocation of resources to the
end-points is the crucial process in such a converged network. This paper
reports a new scheme for allocating time-slots to the end user services in
converged EPON and LTE networks. And it is enhanced to support QoS by
establishing a mapping mechanism between the LTE bearers and EPON queues.
Simulation results reveal that throughput and other QoS services, such as
jitter, delay excel in the employed scheme than the traditional one. |
Keywords: |
LTE, EPON, Dynamic Bandwidth Allocation, QoS provisioning |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
DATA INTEGRITY IN CLOUD COMPUTING SECURITY |
Author: |
Dr. NEDHAL A. AL-SAIYD, NADA SAIL |
Abstract: |
Cloud computing requires comprehensive security solutions based upon many
aspects of a large and loosely integrated system. The application software and
databases in cloud computing are moved to the centralized large data centers,
where the management of the data and services may not be fully trustworthy.
Threats, vulnerabilities and risks for cloud computing are explained, and then,
we have designed a cloud computing security development lifecycle model to
achieve safety and enable the user to take advantage of this technology as much
as possible of security and face the risks that may be exposed to data. A data
integrity checking algorithm; which eliminates the third party auditing, is
explained to protect static and dynamic data from unauthorized observation,
modification, or interference. |
Keywords: |
Cloud Computing, Cloud Computing Security, Data Integrity, Cloud Threads, Cloud
Risks |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
DESIGN OF DELAY INTERPOLATION BASED DIFFERENTIAL SELF BIASED CLOCK PLLS |
Author: |
J. DHURGA DEVI |
Abstract: |
n the present day tiled and multicore processors, the traditional self biased
PLL is often used with very little modification from its original architecture.
The margins available for timing uncertainties, and hence the jitter constraints
on the clock PLLs, have become progressively more stringent. In most of these
microprocessors, the well proven architecture, the traditional self biased PLL
is still being widely used with hardly any modification. The present scenario
demands modifications in its topology to address the jitter constraints. This
paper modifies the traditional self biased PLL targeting jitter reduction and
proposes a differential self biased PLL incorporating delay interpolation based
VCO that provides a constant swing VCO signal. The proposed PLL with its
constant swing VCO architecture and differential PLL architecture, minimizes the
input referred noise as well as the noise contribution by the VCO itself. While
adopting the delay interpolation principle in the VCO of the traditional self
biased PLL, it is ensured that the salient features like constant damping
factor, constant loop bandwidth to reference frequency ratio, static and dynamic
supply rejection characteristic is met for the entire operating frequency range
of PLL and thus the proposed PLL becomes insensitive to process parameters and
supply voltage variations. With a combination of delay interpolation principle
and self biased scheme the modified VCO operates over a wide frequency range and
hence the proposed PLL exhibits wide capture range. Detailed design followed by
simulations carried out with 0.18μm CMOS process shows jitter improvement of 46%
to 85% over a capture range of 1.7GHz. |
Keywords: |
Adaptive bandwidth PLL, Delay interpolator VCO, Jitter, Microprocessor clock,
Self biased PLL |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
ARE VDTN ROUTING PROTOCOLS SUITABLE FOR DATA COLLECTION IN SMART CITIES: A
PERFORMANCE ASSESSMENT |
Author: |
NABIL BENAMAR, MARIA BENAMAR, SARA AHNANA, FATIMA ZAHRAE SAIYARI, MOULAY DRISS
EL OUADGHIRI, JEAN MARIE BONNIN |
Abstract: |
Vehicular Delay-Tolerant Networks (VDTNs) are composed of mobile nodes
(vehicles) that communicate wirelessly to transfer data between nodes despite
connectivity issues. It enables network connectivity in sparse or partitioned
opportunistic networks, characterized by the low node density where the
vehicular traffic is sparse and direct end-to-end paths between communicating
parties do not always exist. Routing in such environments is challenging due to
the absence, for nodes, of information about the state of the partitioned
network, and because transfer opportunities between nodes are of limited
duration. This paper focuses on the study of the performance of some well-known
VDTN routing protocols in different scenarios to assess their suitability of use
in the case of collecting sensor data in cities. In this paper we study the case
of stationary nodes that represent urban sensor measuring different types of
data, and transmitting collected information to stationary destination nodes,
which are connected to the Internet. The transmission mechanism is performed
through a set of mobile nodes in a VDTN context. We study the impact of
different parameters on the routing protocols performances, using a large set of
simulations and two scenarios. The results show that there is no perfect routing
protocolthat is the best for all scenarios. |
Keywords: |
Vehicular Delay-Tolerant Networks, Routing, Performance Evaluation,ONE |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
ARABIC TERM EXTRACTION USING COMBINED APPROACH ON ISLAMIC DOCUMENT |
Author: |
ALI MASHAAN ABED, SABRINA TIUN, MOHAMMED ALBARED |
Abstract: |
While a wide range of methods has been conducted to English terminology
extraction, relatively few studies have been applied to Arabic terms extraction
in Islamic corpus. In this paper, we present an efficient approach for automatic
extraction of Arabic Terminology (SWTs, MWTs). The approach relies on two main
filtering steps: the linguistic filter, where simple part of speech (POS) tagger
is used to extract candidate MWTs matching given syntactic patterns, and the
statistical filter where several statistical methods (PMI, Kappa, CHI-squire,
T-test, Piatersky- Shapiro and Rank Aggregation) are used to rank candidate MWTs
and we applied IF.IDF to rank the SWTs candidate. Our approach extracted the
bi-gram candidates of MWTs Islamic term from corpus and evaluated the
association measures (STWs and MWTs) by using the n-best evaluation method. |
Keywords: |
Term Extraction, SWTs, MWTs, Association measures, n-best evaluation |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
AN ANALYSIS OF ENERGY MODELS FOR MOBILE AD HOC NETWORKS |
Author: |
N. KUMAR, SURESH GNANA DHAS |
Abstract: |
Energy must be significantly conserved in Mobile Ad hoc Networks (MANETs) by
employing energy models. Majority of the energy models address only the hidden
terminal issue, but result in higher power consumption due to increased
collisions during packet transfer. The proposed energy model for MANET involves
an Energy-efficient Optimized Link State Routing (EE-OLSR) protocol and a path
maintenance scheme. The EE-OLSR energy model is based on a progressive search
for the most energy-efficient path. This model reduces the routing overhead and
path setup delay, and enhances the network lifetime. The existing energy models
for MANET are based on OLSR protocol and DE (Differential Evolution) – OLSR
protocol with features like QoS (Quality of Service) optimization, accuracy of
energy states, distributed clustering, and energy-efficient clustering. The
survey analysis involves the comparison of the proposed EE-OLSR model with the
existing energy models. The EE-OLSR model consumes lesser energy compared to the
existing energy models, with respect to nodal speed, packet size, average
connection arrival rate, number of nodes, grid size and packet inter-arrival
time. |
Keywords: |
Adjacent Cluster (AC), Cluster Head (CH), Immediate Neighbor (IN), Mobile Ad hoc
Network (MANET), Optimized Link State Routing (OLSR), and Topology Control (TC). |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
DESIGN AND ANALYSIS OF LOW POWER HYBRID ADDER |
Author: |
For any digital system, digital signal processing or control system addition is
a core operation. The performance of the resident adders greatly influences
rapid and accurate operation of digital systems. Adders are one of the most
prominent components in digital systems, as they are broadly used in other basic
digital operations such as subtraction, multiplication and division. Improved
the performance of the adder would therefore greatly advance the execution of
operation greatly advance the execution of operations inside a circuit
compromised of such blocks [1]. A comparative analysis on power consumption in
three different adders, each offering different advantages and having tradeoffs
has been performed based on circuit complexity and power consumption. The
pioneer of CMOS traditional adder circuits, which consumes more power when
compared to other two adders. The total number of transistors required for
conventional CMOS adder is 28. Recently, it has been proved that the
multiplexer-based multiplier outperforms the modified Booth multiplier both in
speed and power dissipation by 13% to 26%, due to small internal capacitance
[2]. The performance characteristics of conventional multiplier types which
observed, it is found that the multiplexer-based and Transmission Gate based
multiplication algorithm is more advantageous, especially when the size of the
multiplied numbers is small. The number of transistors required for multiplexer
based adders is 16. A heuristic approach, known as hybrid adder models is
proposed to achieve optimal power savings at smaller geometry sizes. This hybrid
adder model that consumes low power among three adders and the transistors
required are 12. The design is simulated using MOSIS 90nm technology. |
Abstract: |
Full Adder, Hybrid Adder, CMOS, Multiplexer, MOSIS |
Keywords: |
|
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
ENHANCING SECURITY IN CRYPTOGRAPHIC SMART CARDS THROUGH ELLIPTIC CURVE
CRYPTOGRAPHY AND OPTIMIZED MODIFIED MATRIX ENCODING ALGORITHMS |
Author: |
G.PRAKASH, Dr. M.KANNAN |
Abstract: |
Now-a-days Cryptographic smart cards are being used for most of the online
transactions in many fields. But the security and the privacy of usage of these
smart cards have been threatened by various attacks to hack the passwords of the
smart card users. Since, small length passwords are easily accessible to
hackers, users and organizations adapt to longer passwords or to change their
passwords frequently. But the risk of having longer passwords or changing
passwords frequently is that the passwords could be easily forgotten.
Researchers have got this into their main concern and have worked on improving
the security of these Cryptographic smart cards. They have employed several
cryptographic techniques to embed the card holder details and the password into
the smart card. However, those methods invented to improve the smart card
security are not up to the requirements. In this work, we have designed a secure
technique by integrating both Cryptography and Steganography which can be used
for Smart Card Security. Initially, user’s confidential details are encrypted
using the most secure Elliptic Curve Cryptography (ECC) technique and then the
encrypted cipher is embedded into the users photographic image using a novel
proposed steganographic technique named Optimized Modified Matrix Encoding (OMME)
algorithm. While embedding the encrypted user details into the image of the
user, in order to reduce distortion of stego-image, an Optimization algorithm,
Artificial Bee Colony (ABC) technique is used to select the image pixels where
the secret data should be embedded. On the other end, the secret data embedded
into users’ image is extracted and it is de-ciphered. If the match occurs, then
user will be authenticated. This proposed technique increases the level of
security and thus it can be used for the security of smartcards when compared to
existing methodologies, since ECC is more secure than any other cryptographic
algorithm and the modified matrix encoding using ABC algorithm embeds more
number of message bits and simultaneously reduces distortion in stego image. |
Keywords: |
Elliptic Curve Cryptography (ECC), Optimized Modified Matrix Encoding (OMME),
Artificial Bee Colony (ABC) |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
A TECHNIQUE TO USER PROFILING ONTOLOGY MINING AND RELATIONSHIP RANKING |
Author: |
S.VIGNESHWARI, DR. M. ARAMUDHAN |
Abstract: |
Ontologies play a crucial role in emerging fields of web technology like
e-commerce, expert systems and so on. User preferences and user interesting
topics can be captured through User Profiling Ontologies (UPO). The proposed
framework discussed here, is to construct a personalized UPO, based on the
interest of a particular user. The constructed UPO can be much more
strengthened, by establishing relationships among the concepts. Web Ontology
Language (OWL) is a standard ontology language used for knowledge representation
on the web. Using the proposed information gathering model, the similarity
measures between the concepts are identified. Based on the priority of the
similarity measures, strong relationships can be established among the concepts
in the ontology. It is obvious that more relevant results can be produced using
this model, based on precision, recall and weighted harmonic mean. As well as
the time of concept retrieval is also less using this approach of establishing
relationships. This can be implemented by utilizing the OWL properties and the
results are given. |
Keywords: |
Ontology, Preprocessing, Crawler, UPO, Precision, OWL, Object Properties,
Semantic Similarity, Relationships |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
ENHANCED PRIVACY PRESERVATION WITH PERTURBED DATA USING FEATURE SELECTION |
Author: |
V.S. PRAKASH, Dr. A. SHANMUGAM |
Abstract: |
In data mining applications, privacy plays an imperative role. This has
triggered the development of many privacy preserving data mining techniques. To
facilitate privacy preservation in data mining or machine learning algorithms
over horizontally partitioned or vertically partitioned data, many protocols
have been proposed using SMC and various secure building blocks. Our previous
works focused on preserving privacy by adapting individually adaptable
perturbation model, which enables the individuals to choose their own privacy
levels. But the downside is that it does not discover the computational results
for privacy properly. This paper proposed a feature selection with privacy
preservation in multi-partitioned dataset. Data can be sealed for privacy by
perturbation technique as pseudonym name. In multi-partitioned data evaluation,
it creates classification of data and selection of feature for data mining
decision model which construct the structural information of model in this
paper. The purpose of gain ratio method has taken in this paper to enhance the
privacy in multi-partitioned data set. All features don’t require protecting the
confidential data for best model. The data representation for privacy preserving
data mining has taken to increase the data mining technique to construct finest
model without breaking the privacy individuals. An experimental evaluation is
conducted to estimate the performance of the proposed enhanced privacy
preservation with perturbed data using feature selection [EPPDFS] in
multi-partitioned datasets demonstrated by diverse experiments conducted on both
synthetic and real-world data sets. |
Keywords: |
Privacy Preserving, Data Mining, Perturbed Data, Feature Selection |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
STUDENT MODELING IN ADAPTIVE EDUCATIONAL CHAT ROOM |
Author: |
MUNA HANINI, RADWAN TAHBOUB, NEDAL A.M JABARI |
Abstract: |
This paper introduced a viable method for modeling student in adaptive
educational chat room. This is a complementary solution to the discussion rooms
that have been discussed in the virtual classroom AVCM. Adopted this model to
study the behavior of the student during the chat session and find an assessment
of knowledge depending on it. That's where the period of time spent by students
during the chat session is an important element of assessment, which also
includes peer evaluation among students as well as the main component is
analyzing the text of the discussion among the students and search for a set of
specific expressions to determine the level of benefit presented by each student
to another. At the end of the chat session each student will be modeled using
the entries of the set < Ts, P, M, S> where S is the student model =
((3M+2Ts+P))/6. |
Keywords: |
Model, AVCM, Mining, Chat, Discussion |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
INTELLIGENT IRRIGATION WATER REQUIREMENT SYSTEM BASED ON ARTIFICIAL NEURAL
NETWORKS AND PROFIT OPTIMIZATION FOR PLANTING TIME DECISION MAKING OF CROPS IN
LOMBOK ISLAND |
Author: |
MOHAMMAD ISA IRAWAN , SYAHARUDDIN , DARYONO BUDI UTOMO, ALVIDA MUSTIKA RUKMI |
Abstract: |
Cropping pattern is a scheduling for farming time on a certain land in a
definite period (e.g. 1 year), including unfilled area. In arranging crop
planting patterns, hydrological (rainfall), climatological (temperature,
humidity, wind speed, and sunshine), crop (crop coefficient value, productivity
and price) and land area data are required. Therefore, a method that can be
applied to predict the hydro climatological data is needed.
The appropriate method for such prediction is Back Propagation Neural Network (BPNN).
Prediction result of BPNN will be used to determine minimum crop water
requirements, and it will be associated with planting time (age) of each crop
for making cropping pattern. The design of most favorable cropping pattern will
obtain the maximum profit and reduce fail harvest problem, which in turns it can
contribute to national food resilience.
Based on the simulation result, it was known that the BPNN with two hidden
layers is able to predict hydro climatological data such as of rainfall,
temperature, humidity, wind speed, and sunshine data with an average accuracy
rate of 95.72% - 96.61%. Meanwhile, validation of predictions obtained an
average percentage error of 1.12% with an accuracy of 99.76%. The results of the
optimization of the cropping pattern in Lombok in March 2013-February 2014
revealed an accurateness of profit in each district/city in East Lombok, Central
Lombok, West Lombok, North Lombok, and Mataram increased 2.02%, 16.88%, 20, 23%,
21.89%, and 5.58%, respectively. Over all, the increasing average was found to
be 13.3% from the previous year. |
Keywords: |
Crop, Rainfall, Back Propagation Neural Network (BPNN), Optimization |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
COST EFFECTIVE POLY VERNAM CIPHER WITH CACHE OPTIMIZATION |
Author: |
SUNDRAM PRABHADEVI, RAHUL DE, PRATIK SHAH |
Abstract: |
Our digital world provides a means to access mammoths of data and services. Such
a huge responsibility and task does not come without disadvantages, the most
important of which is security and consistency of data and the maintenance of
privacy. The science of cryptology has provided us with many means to minimize
this disadvantage. This paper attempts to provide another such means to minimize
that disadvantage. In this article we present a symmetric key algorithm
targeting to improve the problems related to key stream generation. The security
of the keystream generation of the proposed algorithm is based on Rijndael
forward s – box which is manifest of closure property. The key is a set of
matrices along with a tuple of coordinates, noted during the process of
encryption. Cache optimization technique used eliminates the disk I/O and
ensures maximum memory utilization. The performance of cache, hence the
algorithm is dependent on the processor used. This algorithm is especially
applicable to networks where fast and secure encryption is and decryption of
data is critical. |
Keywords: |
Poly Alphabetic, Vernam Cipher, Key Generation, Symmetric Cryptography, Cache
Optimization |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
RELIABILITY AND INFORMATION SHARING SECURE TRACE-OUT PROTOCOL IN ROUTER BASED
NETWORKS |
Author: |
M HEMA LATHA, P PADMANABHAM, A.GOVARDHAN |
Abstract: |
Dependency upon Communication adaptability to a wide range and digitalization of
network adds a number of devices in the network. These devices operate
throughout every corner of the world as well as different purposes. Huge data
transmission, easy to access and time saving are the applications that are
attracting the users to have a digitized communication system. Wireless
communication systems consist of a number of routers and links. Processing
speed, link failure, control of one router over another router as well extended
delay causing huge problems in transmission. Considering some of the physical
data available and sharing the useful information to the other routers as well
as maintaining a suitable protocol to detect the type of failure gives the work
culture of this paper. This paper enhances the methodology through less use of
bandwidth for error or attack checking. The error is detected as soon as
possible on the network. The work load of error checking is distributed among a
number of devices. |
Keywords: |
Information, Bandwidth, Trace, Routers, Error |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
PERFORMANCE ANALYSIS OF AN ENERGY EFFICIENT CLUSTERING IN WIRELESS SENSOR
NETWORKS |
Author: |
V.CHANDRASEKARAN, Dr.A.SHANMUGAM |
Abstract: |
Wireless sensor networks (WSNs) have gained increasing importance in a variety
of military and civilian applications. The most important issue faced in all
wireless sensor networks is its energy consumption. Innovative techniques that
improve energy efficiency to prolong the network lifetime are highly required.
Clustering is an effective topology control approach in wireless sensor
networks, which can increase network scalability and lifetime. In this paper, we
propose a novel energy efficient clustering approach (E2C) for single-hop
wireless sensor networks, which better suits the periodical data gathering
applications. E2C is a clustering technique in which the network is partitioned
into a group of cluster regions with one cluster head in each cluster region.E2C
uses a new method of election of cluster heads and clusters formation. The
finest value of competition range produces a good distribution of cluster heads.
Further in the cluster formation phase, plain nodes join clusters not only
taking into account its intra-cluster communication cost, but also considering
cluster heads cost of communication to the BS. Simulation results show that E2C
prolongs the network lifetime significantly against the other clustering
protocols such as LEACH, HEED and EECS. |
Keywords: |
Wireless Sensor Networks, Cluster Region, Cluster heads, Energy Efficiency |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
SEMANTIC-BASED MEDICAL RECORDS RETRIEVAL VIA MEDICAL-CONTEXT AWARE QUERY
EXPANSION AND RANKING |
Author: |
NURFADHLINA MOHD SHAREF, HIZMAWATI MADZIN |
Abstract: |
Efficient retrieval of medical records involves contextual understanding of both
the query and the records contents. This will enhance the searching
effectiveness beyond merely keyword matching and is assisted by analyzing its
semantics notion such as by the utilization of the MeSH thesaurus. The query is
annotated and expanded by information from the deep medical contextual
understanding. This is because typically medical records contain medical
terminologies which may not be included in the user query but is important for
accurate search hit. Besides, the terminologies have synonyms which should be
utilized for richer and expanded query. The main contribution of the paper is
the semantic-based retrieval technique by utilizing context-aware query
expansion and search ranking method. Medical domain is chosen as a proof of
concept and a medical record retrieval application was developed. The source of
medical records are obtained from the ImageCLEF 2010 dataset which also houses a
series of evaluation campaign such as photo annotation, robot vision and
Wikipedia retrieval. This paper addresses the following problems: (i)
semantic-based query expansion technique which increase the content awareness
ability, (ii) MeSH-manipulated indexer which entails medical terminologies and
their synonym, (iii) adoption of extended Boolean matching to measure similarity
between query and documents, and (iv) ranking method which prioritizes matched
expanded query size. The results were measured using precision, recall and mean
average precision (MAP) score. Comparing against other approaches, our method
has several achievements including; (i) more efficient access of MeSH thesaurus
through the manipulated indexer compared to its original form; (ii) enrichment
of query expansion using synonym term can improve mean average precision (MAP)
value as opposed to standard query expansion; (iii) our comprehensive ranking
method achieved high recall. According to MAP score we are in the top five run
system amongst submitted run systems in ImageCLEF2010 medical task. |
Keywords: |
Clinical Record Retrieval, Semantic, Query Expansion, Ranking Method |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
Title: |
TOPOLOGY BASED ROUTING PROTOCOLS FOR VANET AND THEIR COMPARISON WITH MANET |
Author: |
KASHIF NASEER QURESHI, ABDUL HANAN ABDULLAH |
Abstract: |
The development in technologies the mobile networks has been rapidly change,
especially Mobile Ad-hoc and Vehicular Ad-Hoc networks. Due to nature of the
fields, the mobile sensor network replaced the fixed sensor network. In these
fields, the topology dynamically changes time by time due to speed and congested
environment because of this routing is a crucial and challenging issue. For
routing a variety of new routing protocols have been developed. In mobile Ad-hoc
networks and Vehicular Ad-Hoc networks the routing protocols are divided into
different categorize. They based on topology, position, and network. We discuss
the topology based efficient routing protocols and some shed on pros and cons
and characteristics and types of these protocols. Moreover, we compare the
protocols performance and nature of work. |
Keywords: |
Mobile Ad-hoc networks (MANET), Vehicular Ad-hoc networks (VANET), Topology,
Proactive, reactive, Hybrid |
Source: |
Journal of Theoretical and Applied Information Technology
December 2013 -- Vol. 58. No. 3 -- 2013 |
Full
Text |
|
|
|