Abstract: In this paper, we discuss the performance of applying
hybrid spiral dynamic bacterial chemotaxis (HSDBC) optimisation
algorithm on an intelligent controller for a differential drive robot. A
unicycle class of differential drive robot is utilised to serve as a basis
application to evaluate the performance of the HSDBC algorithm. A
hybrid fuzzy logic controller is developed and implemented for the
unicycle robot to follow a predefined trajectory. Trajectories of
various frictional profiles and levels were simulated to evaluate the
performance of the robot at different operating conditions. Controller
gains and scaling factors were optimised using HSDBC and the
performance is evaluated in comparison to previously adopted
optimisation algorithms. The HSDBC has proven its feasibility in
achieving a faster convergence toward the optimal gains and resulted
in a superior performance.
Abstract: Power systems are operating under stressed condition
due to continuous increase in demand of load. This can lead to
voltage instability problem when face additional load increase or
contingency. In order to avoid voltage instability suitable size of
reactive power compensation at optimal location in the system is
required which improves the load margin. This work aims at
obtaining optimal size as well as location of compensation in the 39-
bus New England system with the help of Bacteria Foraging and
Genetic algorithms. To reduce the computational time the work
identifies weak candidate buses in the system, and then picks only
two of them to take part in the optimization. The objective function is
based on a recently proposed voltage stability index which takes into
account the weighted average sensitivity index is a simpler and faster
approach than the conventional CPF algorithm. BFOA has been
found to give better results compared to GA.
Abstract: This paper describes the problem of building secure
computational services for encrypted information in the Cloud
Computing without decrypting the encrypted data; therefore, it meets
the yearning of computational encryption algorithmic aspiration
model that could enhance the security of big data for privacy,
confidentiality, availability of the users. The cryptographic model
applied for the computational process of the encrypted data is the
Fully Homomorphic Encryption Scheme. We contribute a theoretical
presentations in a high-level computational processes that are based
on number theory and algebra that can easily be integrated and
leveraged in the Cloud computing with detail theoretic mathematical
concepts to the fully homomorphic encryption models. This
contribution enhances the full implementation of big data analytics
based cryptographic security algorithm.
Abstract: In this paper, performances of shuffled frog leaping
algorithm was investigated on the stealth laser dicing process. Effect
of problem on the performance of the algorithm was based on the
tolerance of meandering data. From the customer specification it
could be less than five microns with the target of zero microns.
Currently, the meandering levels are unsatisfactory when compared
to the customer specification. Firstly, the two-level factorial design
was applied to preliminarily study the statistically significant effects
of five process variables. In this study one influential process variable
is integer. From the experimental results, the new operating condition
from the algorithm was superior when compared to the current
manufacturing condition.
Abstract: We propose a code acquisition scheme called improved
multiple-shift (IMS) for optical code division multiple access
systems, where the optical orthogonal code is used instead of the
pseudo noise code. Although the IMS algorithm has a similar process
to that of the conventional MS algorithm, it has a better code
acquisition performance than the conventional MS algorithm. We
analyze the code acquisition performance of the IMS algorithm and
compare the code acquisition performances of the MS and the IMS
algorithms in single-user and multi-user environments.
Abstract: The aim of this work is to build a model based on
tissue characterization that is able to discriminate pathological and
non-pathological regions from three-phasic CT images. With our
research and based on a feature selection in different phases, we are
trying to design a neural network system with an optimal neuron
number in a hidden layer. Our approach consists of three steps:
feature selection, feature reduction, and classification. For each
region of interest (ROI), 6 distinct sets of texture features are
extracted such as: first order histogram parameters, absolute gradient,
run-length matrix, co-occurrence matrix, autoregressive model, and
wavelet, for a total of 270 texture features. When analyzing more
phases, we show that the injection of liquid cause changes to the high
relevant features in each region. Our results demonstrate that for
detecting HCC tumor phase 3 is the best one in most of the features
that we apply to the classification algorithm. The percentage of
detection between pathology and healthy classes, according to our
method, relates to first order histogram parameters with accuracy of
85% in phase 1, 95% in phase 2, and 95% in phase 3.
Abstract: Nature is a great source of inspiration for solving
complex problems in networks. It helps to find the optimal solution.
Metaheuristic algorithm is one of the nature-inspired algorithm which
helps in solving routing problem in networks. The dynamic features,
changing of topology frequently and limited bandwidth make the
routing, challenging in MANET. Implementation of appropriate
routing algorithms leads to the efficient transmission of data in
mobile ad hoc networks. The algorithms that are inspired by the
principles of naturally-distributed/collective behavior of social
colonies have shown excellence in dealing with complex
optimization problems. Thus some of the bio-inspired metaheuristic
algorithms help to increase the efficiency of routing in ad hoc
networks. This survey work presents the overview of bio-inspired
metaheuristic algorithms which support the efficiency of routing in
mobile ad hoc networks.
Abstract: The inherent skin patterns created at the joints in the
finger exterior are referred as finger knuckle-print. It is exploited to
identify a person in a unique manner because the finger knuckle print
is greatly affluent in textures. In biometric system, the region of
interest is utilized for the feature extraction algorithm. In this paper,
local and global features are extracted separately. Fast Discrete
Orthonormal Stockwell Transform is exploited to extract the local
features. Global feature is attained by escalating the size of Fast
Discrete Orthonormal Stockwell Transform to infinity. Two features
are fused to increase the recognition accuracy. A matching distance is
calculated for both the features individually. Then two distances are
merged mutually to acquire the final matching distance. The
proposed scheme gives the better performance in terms of equal error
rate and correct recognition rate.
Abstract: One image is worth more than thousand words.
Images if analyzed can reveal useful information. Low level image
processing deals with the extraction of specific feature from a single
image. Now the question arises: What technique should be used to
extract patterns of very large and detailed image database? The
answer of the question is: “Image Mining”. Image Mining deals with
the extraction of image data relationship, implicit knowledge, and
another pattern from the collection of images or image database. It is
nothing but the extension of Data Mining. In the following paper, not
only we are going to scrutinize the current techniques of image
mining but also present a new technique for mining images using
Genetic Algorithm.
Abstract: In this paper, the improvement by deconvolution of
the depth resolution in Secondary Ion Mass Spectrometry (SIMS)
analysis is considered. Indeed, we have developed a new Tikhonov-
Miller deconvolution algorithm where a priori model of the solution
is included. This is a denoisy and pre-deconvoluted signal obtained
from: firstly, by the application of wavelet shrinkage algorithm,
secondly by the introduction of the obtained denoisy signal in an
iterative deconvolution algorithm. In particular, we have focused the
light on the effect of the iterations number on the evolution of the
deconvoluted signals. The SIMS profiles are multilayers of Boron in
Silicon matrix.
Abstract: In this paper we consider the rule reduct generation
problem. Rule Reduct Generation (RG) and Modified Rule
Generation (MRG) algorithms, that are used to solve this problem,
are well-known. Alternative to these algorithms, we develop Pruning
Rule Generation (PRG) algorithm. We compare the PRG algorithm
with RG and MRG.
Abstract: This paper presents an evolutionary algorithm for
solving multi-objective optimization problems-based artificial neural
network (ANN). The multi-objective evolutionary algorithm used in
this study is genetic algorithm while ANN used is radial basis
function network (RBFN). The proposed algorithm named memetic
elitist Pareto non-dominated sorting genetic algorithm-based RBFN
(MEPGAN). The proposed algorithm is implemented on medical
diseases problems. The experimental results indicate that the
proposed algorithm is viable, and provides an effective means to
design multi-objective RBFNs with good generalization capability
and compact network structure. This study shows that MEPGAN
generates RBFNs coming with an appropriate balance between
accuracy and simplicity, comparing to the other algorithms found in
literature.
Abstract: The Simulation based VLSI Implementation of
FELICS (Fast Efficient Lossless Image Compression System)
Algorithm is proposed to provide the lossless image compression and
is implemented in simulation oriented VLSI (Very Large Scale
Integrated). To analysis the performance of Lossless image
compression and to reduce the image without losing image quality
and then implemented in VLSI based FELICS algorithm. In FELICS
algorithm, which consists of simplified adjusted binary code for
Image compression and these compression image is converted in
pixel and then implemented in VLSI domain. This parameter is used
to achieve high processing speed and minimize the area and power.
The simplified adjusted binary code reduces the number of arithmetic
operation and achieved high processing speed. The color difference
preprocessing is also proposed to improve coding efficiency with
simple arithmetic operation. Although VLSI based FELICS
Algorithm provides effective solution for hardware architecture
design for regular pipelining data flow parallelism with four stages.
With two level parallelisms, consecutive pixels can be classified into
even and odd samples and the individual hardware engine is
dedicated for each one. This method can be further enhanced by
multilevel parallelisms.
Abstract: Artificial Neural Network (ANN) can be trained using
back propagation (BP). It is the most widely used algorithm for
supervised learning with multi-layered feed-forward networks.
Efficient learning by the BP algorithm is required for many practical
applications. The BP algorithm calculates the weight changes of
artificial neural networks, and a common approach is to use a twoterm
algorithm consisting of a learning rate (LR) and a momentum
factor (MF). The major drawbacks of the two-term BP learning
algorithm are the problems of local minima and slow convergence
speeds, which limit the scope for real-time applications. Recently the
addition of an extra term, called a proportional factor (PF), to the
two-term BP algorithm was proposed. The third increases the speed
of the BP algorithm. However, the PF term also reduces the
convergence of the BP algorithm, and criteria for evaluating
convergence are required to facilitate the application of the three
terms BP algorithm. Although these two seem to be closely related,
as described later, we summarize various improvements to overcome
the drawbacks. Here we compare the different methods of
convergence of the new three-term BP algorithm.
Abstract: In this work, neural networks methods MLP type were
applied to a database from an array of six sensors for the detection of
three toxic gases. The choice of the number of hidden layers and the
weight values are influential on the convergence of the learning
algorithm. We proposed, in this article, a mathematical formula to
determine the optimal number of hidden layers and good weight
values based on the method of back propagation of errors. The results
of this modeling have improved discrimination of these gases and
optimized the computation time. The model presented here has
proven to be an effective application for the fast identification of
toxic gases.
Abstract: Femtocells are regarded as a milestone for next
generation cellular networks. As femtocells are deployed in an
unplanned manner, there is a chance of assigning same resource to
neighboring femtocells. This scenario may induce co-channel
interference and may seriously affect the service quality of
neighboring femtocells. In addition, the dominant transmit power of a
femtocell will induce co-tier interference to neighboring femtocells.
Thus to jointly handle co-tier and co-channel interference, we
propose an interference-free power and resource block allocation
(IFPRBA) algorithm for closely located, closed access femtocells.
Based on neighboring list, inter-femto-base station distance and
uplink noise power, the IFPRBA algorithm assigns non-interfering
power and resource to femtocells. The IFPRBA algorithm also
guarantees the quality of service to femtouser based on the
knowledge of resource requirement, connection type, and the
tolerable delay budget. Simulation result shows that the interference
power experienced in IFPRBA algorithm is below the tolerable
interference power and hence the overall service success ratio, PRB
efficiency and network throughput are maximum when compared to
conventional resource allocation framework for femtocell (RAFF)
algorithm.
Abstract: Red blood cells (RBC) are the most common types of
blood cells and are the most intensively studied in cell biology. The
lack of RBCs is a condition in which the amount of hemoglobin level
is lower than normal and is referred to as “anemia”. Abnormalities in
RBCs will affect the exchange of oxygen. This paper presents a
comparative study for various techniques for classifying the RBCs as
normal or abnormal (anemic) using WEKA. WEKA is an open
source consists of different machine learning algorithms for data
mining applications. The algorithms tested are Radial Basis Function
neural network, Support vector machine, and K-Nearest Neighbors
algorithm. Two sets of combined features were utilized for
classification of blood cells images. The first set, exclusively consist
of geometrical features, was used to identify whether the tested blood
cell has a spherical shape or non-spherical cells. While the second
set, consist mainly of textural features was used to recognize the
types of the spherical cells. We have provided an evaluation based on
applying these classification methods to our RBCs image dataset
which were obtained from Serdang Hospital - Malaysia, and
measuring the accuracy of test results. The best achieved
classification rates are 97%, 98%, and 79% for Support vector
machines, Radial Basis Function neural network, and K-Nearest
Neighbors algorithm respectively.
Abstract: Several of the practical industrial control processes are
multivariable processes. Due to the relation amid the variables
(interaction), delay in the loops, it is very intricate to design a
controller directly for these processes. So first, the interaction of the
variables is analyzed using Relative Normalized Gain Array
(RNGA), which considers the time constant, static gain and delay
time of the processes. Based on the effect of RNGA, relative gain
array (RGA) and NI, the pair (control configuration) of variables to
be controlled by decentralized control is selected. The equivalent
transfer function (ETF) of the process model is estimated as first
order process with delay using the corresponding elements in the
Relative gain array and Relative average residence time array
(RARTA) of the processes. Secondly, a decentralized Proportional-
Integral (PI) controller is designed for each ETF simply using
frequency response specifications. Finally, the performance and
robustness of the algorithm is comparing with existing related
approaches to validate the effectiveness of the projected algorithm.
Abstract: Image spam is a kind of email spam where the spam
text is embedded with an image. It is a new spamming technique
being used by spammers to send their messages to bulk of internet
users. Spam email has become a big problem in the lives of internet
users, causing time consumption and economic losses. The main
objective of this paper is to detect the image spam by using histogram
properties of an image. Though there are many techniques to
automatically detect and avoid this problem, spammers employing
new tricks to bypass those techniques, as a result those techniques are
inefficient to detect the spam mails. In this paper we have proposed a
new method to detect the image spam. Here the image features are
extracted by using RGB histogram, HSV histogram and combination
of both RGB and HSV histogram. Based on the optimized image
feature set classification is done by using k- Nearest Neighbor(k-NN)
algorithm. Experimental result shows that our method has achieved
better accuracy. From the result it is known that combination of RGB
and HSV histogram with k-NN algorithm gives the best accuracy in
spam detection.
Abstract: Now-a-days autonomous mobile robots have found
applications in diverse fields. An autonomous robot system must be
able to behave in an intelligent manner to deal with complex and
changing environment. This work proposes the performance of path
planning and navigation of autonomous mobile robot using
Gravitational Search Algorithm (GSA), Simulated Annealing (SA)
and Particle Swarm optimization (PSO) based intelligent controllers
in an unstructured environment. The approach not only finds a valid
collision free path but also optimal one. The main aim of the work is
to minimize the length of the path and duration of travel from a
starting point to a target while moving in an unknown environment
with obstacles without collision. Finally, a comparison is made
between the three controllers, it is found that the path length and time
duration made by the robot using GSA is better than SA and PSO
based controllers for the same work.