Abstract: An algorithm is a well-defined procedure that takes
some input in the form of some values, processes them and gives the
desired output. It forms the basis of many other algorithms such as
searching, pattern matching, digital filters etc., and other applications
have been found in database systems, data statistics and processing,
data communications and pattern matching. This paper introduces
algorithmic “Enhanced Bidirectional Selection” sort which is
bidirectional, stable. It is said to be bidirectional as it selects two
values smallest from the front and largest from the rear and assigns
them to their appropriate locations thus reducing the number of
passes by half the total number of elements as compared to selection
sort.
Abstract: In this paper, Least Mean Square (LMS) adaptive
noise reduction algorithm is proposed to enhance the speech signal
from the noisy speech. In this, the speech signal is enhanced by
varying the step size as the function of the input signal. Objective and
subjective measures are made under various noises for the proposed
and existing algorithms. From the experimental results, it is seen that
the proposed LMS adaptive noise reduction algorithm reduces Mean
square Error (MSE) and Log Spectral Distance (LSD) as compared to
that of the earlier methods under various noise conditions with
different input SNR levels. In addition, the proposed algorithm
increases the Peak Signal to Noise Ratio (PSNR) and Segmental SNR
improvement (ΔSNRseg) values; improves the Mean Opinion Score
(MOS) as compared to that of the various existing LMS adaptive
noise reduction algorithms. From these experimental results, it is
observed that the proposed LMS adaptive noise reduction algorithm
reduces the speech distortion and residual noise as compared to that
of the existing methods.
Abstract: Artificial Immune Systems (AIS), inspired by the
human immune system, are algorithms and mechanisms which are
self-adaptive and self-learning classifiers capable of recognizing and
classifying by learning, long-term memory and association. Unlike
other human system inspired techniques like genetic algorithms and
neural networks, AIS includes a range of algorithms modeling on
different immune mechanism of the body. In this paper, a mechanism
of a human immune system based on apoptosis is adopted to build an
Intrusion Detection System (IDS) to protect computer networks.
Features are selected from network traffic using Fisher Score. Based
on the selected features, the record/connection is classified as either
an attack or normal traffic by the proposed methodology. Simulation
results demonstrates that the proposed AIS based on apoptosis
performs better than existing AIS for intrusion detection.
Abstract: Existing methods of data mining cannot be applied on
spatial data because they require spatial specificity consideration, as
spatial relationships.
This paper focuses on the classification with decision trees, which
are one of the data mining techniques. We propose an extension of
the C4.5 algorithm for spatial data, based on two different approaches
Join materialization and Querying on the fly the different tables.
Similar works have been done on these two main approaches, the
first - Join materialization - favors the processing time in spite of
memory space, whereas the second - Querying on the fly different
tables- promotes memory space despite of the processing time.
The modified C4.5 algorithm requires three entries tables: a target
table, a neighbor table, and a spatial index join that contains the
possible spatial relationship among the objects in the target table and
those in the neighbor table. Thus, the proposed algorithms are applied
to a spatial data pattern in the accidentology domain.
A comparative study of our approach with other works of
classification by spatial decision trees will be detailed.
Abstract: The objective of the Economic Dispatch(ED) Problems
of electric power generation is to schedule the committed generating
units outputs so as to meet the required load demand at minimum
operating cost while satisfying all units and system equality and
inequality constraints. This paper presents a new method of ED
problems utilizing the Max-Min Ant System Optimization.
Historically, traditional optimizations techniques have been used,
such as linear and non-linear programming, but within the past
decade the focus has shifted on the utilization of Evolutionary
Algorithms, as an example Genetic Algorithms, Simulated Annealing
and recently Ant Colony Optimization (ACO). In this paper we
introduce the Max-Min Ant System based version of the Ant System.
This algorithm encourages local searching around the best solution
found in each iteration. To show its efficiency and effectiveness, the
proposed Max-Min Ant System is applied to sample ED problems
composed of 4 generators. Comparison to conventional genetic
algorithms is presented.
Abstract: Time and cost are the main goals of the construction
project management. The first schedule developed may not be a
suitable schedule for beginning or completing the project to achieve
the target completion time at a minimum total cost. In general, there
are trade-offs between time and cost (TCT) to complete the activities
of a project. This research presents genetic algorithms (GAs) multiobjective
model for project scheduling considering different
scenarios such as least cost, least time, and target time.
Abstract: Microarray technology is universally used in the study
of disease diagnosis using gene expression levels. The main
shortcoming of gene expression data is that it includes thousands of
genes and a small number of samples. Abundant methods and
techniques have been proposed for tumor classification using
microarray gene expression data. Feature or gene selection methods
can be used to mine the genes that directly involve in the
classification and to eliminate irrelevant genes. In this paper
statistical measures like T-Statistics, Signal-to-Noise Ratio (SNR)
and F-Statistics are used to rank the genes. The ranked genes are used
for further classification. Particle Swarm Optimization (PSO)
algorithm and Shuffled Frog Leaping (SFL) algorithm are used to
find the significant genes from the top-m ranked genes. The Naïve
Bayes Classifier (NBC) is used to classify the samples based on the
significant genes. The proposed work is applied on Lung and Ovarian
datasets. The experimental results show that the proposed method
achieves 100% accuracy in all the three datasets and the results are
compared with previous works.
Abstract: In our paper we describe the security capabilities of
data collection. Data are collected with probes located in the near and
distant surroundings of the company. Considering the numerous
obstacles e.g. forests, hills, urban areas, the data collection is realized
in several ways. The collection of data uses connection via wireless
communication, LAN network, GSM network and in certain areas
data are collected by using vehicles. In order to ensure the connection
to the server most of the probes have ability to communicate in
several ways. Collected data are archived and subsequently used in
supervisory applications.
To ensure the collection of the required data, it is necessary to
propose algorithms that will allow the probes to select suitable
communication channel.
Abstract: Segmentation is one of the essential tasks in image
processing. Thresholding is one of the simplest techniques for
performing image segmentation. Multilevel thresholding is a simple
and effective technique. The primary objective of bi-level or
multilevel thresholding for image segmentation is to determine a best
thresholding value. To achieve multilevel thresholding various
techniques has been proposed. A study of some nature inspired
metaheuristic algorithms for multilevel thresholding for image
segmentation is conducted. Here, we study about Particle swarm
optimization (PSO) algorithm, artificial bee colony optimization
(ABC), Ant colony optimization (ACO) algorithm and Cuckoo
search (CS) algorithm.
Abstract: WiMAX is a telecommunications technology and it is
specified by the Institute of Electrical and Electronics Engineers Inc.,
as the IEEE 802.16 standard. The goal of this technology is to
provide a wireless data over long distances in a variety of ways. IEEE
802.16 is a recent standard for mobile communication. In this paper,
we provide an overview of various key management algorithms to
provide security for WiMAX.
Abstract: The success of any retail business is predisposed by its
swift response and its knack in understanding the constraints and the
requirements of customers. In this paper a conceptual design model
of an automated customer-friendly supermarket has been proposed.
In this model a 10-sided, space benefited, regular polygon shaped
gravity shelves have been designed for goods storage and effective
customer-specific algorithms have been built-in for quick automatic
delivery of the randomly listed goods. The algorithm is developed
with two main objectives, viz., delivery time and priority. For
meeting these objectives the randomly listed items are reorganized
according to the critical-path of the robotic arm specific to the
identified shop and its layout and the items are categorized according
to the demand, shape, size, similarity and nature of the product for an
efficient pick-up, packing and delivery process. We conjectured that
the proposed automated supermarket model reduces business
operating costs with much customer satisfaction warranting a winwin
situation.
Abstract: This paper aims at introducing finite automata theory,
the different ways to describe regular languages and create a program
to implement the subset construction algorithms to convert
nondeterministic finite automata (NFA) to deterministic finite
automata (DFA). This program is written in c++ programming
language. The program reads FA 5tuples from text file and then
classifies it into either DFA or NFA. For DFA, the program will read
the string w and decide whether it is acceptable or not. If accepted, the
program will save the tracking path and point it out. On the other hand,
when the automation is NFA, the program will change the Automation
to DFA so that it is easy to track and it can decide whether the w exists
in the regular language or not.
Abstract: This research proposes a novel reconstruction protocol
for restoring missing surfaces and low-quality edges and shapes in
photos of artifacts at historical sites. The protocol starts with the
extraction of a cloud of points. This extraction process is based on
four subordinate algorithms, which differ in the robustness and
amount of resultant. Moreover, they use different -but
complementary- accuracy to some related features and to the way
they build a quality mesh. The performance of our proposed protocol
is compared with other state-of-the-art algorithms and toolkits. The
statistical analysis shows that our algorithm significantly outperforms
its rivals in the resultant quality of its object files used to reconstruct
the desired model.
Abstract: In this study, a comparative analysis of the approaches
associated with the use of neural network algorithms for effective
solution of a complex inverse problem – the problem of identifying
and determining the individual concentrations of inorganic salts in
multicomponent aqueous solutions by the spectra of Raman
scattering of light – is performed. It is shown that application of
artificial neural networks provides the average accuracy of
determination of concentration of each salt no worse than 0.025 M.
The results of comparative analysis of input data compression
methods are presented. It is demonstrated that use of uniform
aggregation of input features allows decreasing the error of
determination of individual concentrations of components by 16-18%
on the average.
Abstract: This paper presents a new meta-heuristic bio-inspired
optimization algorithm which is called Cuttlefish Algorithm (CFA).
The algorithm mimics the mechanism of color changing behavior of
the cuttlefish to solve numerical global optimization problems. The
colors and patterns of the cuttlefish are produced by reflected light
from three different layers of cells. The proposed algorithm considers
mainly two processes: reflection and visibility. Reflection process
simulates light reflection mechanism used by these layers, while
visibility process simulates visibility of matching patterns of the
cuttlefish. To show the effectiveness of the algorithm, it is tested with
some other popular bio-inspired optimization algorithms such as
Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and
Bees Algorithm (BA) that have been previously proposed in the
literature. Simulations and obtained results indicate that the proposed
CFA is superior when compared with these algorithms.
Abstract: In this paper the issue of dimensionality reduction is
investigated in finger vein recognition systems using kernel Principal
Component Analysis (KPCA). One aspect of KPCA is to find the
most appropriate kernel function on finger vein recognition as there
are several kernel functions which can be used within PCA-based
algorithms. In this paper, however, another side of PCA-based
algorithms -particularly KPCA- is investigated. The aspect of
dimension of feature vector in PCA-based algorithms is of
importance especially when it comes to the real-world applications
and usage of such algorithms. It means that a fixed dimension of
feature vector has to be set to reduce the dimension of the input and
output data and extract the features from them. Then a classifier is
performed to classify the data and make the final decision. We
analyze KPCA (Polynomial, Gaussian, and Laplacian) in details in
this paper and investigate the optimal feature extraction dimension in
finger vein recognition using KPCA.
Abstract: The emergence of the Semantic Web technology
increases day by day due to the rapid growth of multiple web pages.
Many standard formats are available to store the semantic web data.
The most popular format is the Resource Description Framework
(RDF). Querying large RDF graphs becomes a tedious procedure
with a vast increase in the amount of data. The problem of query
optimization becomes an issue in querying large RDF graphs.
Choosing the best query plan reduces the amount of query execution
time. To address this problem, nature inspired algorithms can be used
as an alternative to the traditional query optimization techniques. In
this research, the optimal query plan is generated by the proposed
SAPSO algorithm which is a hybrid of Simulated Annealing (SA)
and Particle Swarm Optimization (PSO) algorithms. The proposed
SAPSO algorithm has the ability to find the local optimistic result
and it avoids the problem of local minimum. Experiments were
performed on different datasets by changing the number of predicates
and the amount of data. The proposed algorithm gives improved
results compared to existing algorithms in terms of query execution
time.
Abstract: Recently GPS data is used in a lot of studies to
automatically reconstruct travel patterns for trip survey. The aim is to
minimize the use of questionnaire surveys and travel diaries so as to
reduce their negative effects. In this paper data acquired from GPS and
accelerometer embedded in smart phones is utilized to predict the
mode of transportation used by the phone carrier. For prediction,
Support Vector Machine (SVM) and Adaptive boosting (AdaBoost)
are employed. Moreover a unique method to improve the prediction
results from these algorithms is also proposed. Results suggest that the
prediction accuracy of AdaBoost after improvement is relatively better
than the rest.
Abstract: Artificial Neural Networks (ANN) trained using backpropagation
(BP) algorithm are commonly used for modeling
material behavior associated with non-linear, complex or unknown
interactions among the material constituents. Despite multidisciplinary
applications of back-propagation neural networks
(BPNN), the BP algorithm possesses the inherent drawback of
getting trapped in local minima and slowly converging to a global
optimum. The paper present a hybrid artificial neural networks and
genetic algorithm approach for modeling slump of ready mix
concrete based on its design mix constituents. Genetic algorithms
(GA) global search is employed for evolving the initial weights and
biases for training of neural networks, which are further fine tuned
using the BP algorithm. The study showed that, hybrid ANN-GA
model provided consistent predictions in comparison to commonly
used BPNN model. In comparison to BPNN model, the hybrid ANNGA
model was able to reach the desired performance goal quickly.
Apart from the modeling slump of ready mix concrete, the synaptic
weights of neural networks were harnessed for analyzing the relative
importance of concrete design mix constituents on the slump value.
The sand and water constituents of the concrete design mix were
found to exhibit maximum importance on the concrete slump value.
Abstract: An extensive amount of work has been done in data
clustering research under the unsupervised learning technique in Data
Mining during the past two decades. Moreover, several approaches
and methods have been emerged focusing on clustering diverse data
types, features of cluster models and similarity rates of clusters.
However, none of the single clustering algorithm exemplifies its best
nature in extracting efficient clusters. Consequently, in order to
rectify this issue, a new challenging technique called Cluster
Ensemble method was bloomed. This new approach tends to be the
alternative method for the cluster analysis problem. The main
objective of the Cluster Ensemble is to aggregate the diverse
clustering solutions in such a way to attain accuracy and also to
improve the eminence the individual clustering algorithms. Due to
the massive and rapid development of new methods in the globe of
data mining, it is highly mandatory to scrutinize a vital analysis of
existing techniques and the future novelty. This paper shows the
comparative analysis of different cluster ensemble methods along
with their methodologies and salient features. Henceforth this
unambiguous analysis will be very useful for the society of clustering
experts and also helps in deciding the most appropriate one to resolve
the problem in hand.