Abstract: The development of the signal compression
algorithms is having compressive progress. These algorithms are
continuously improved by new tools and aim to reduce, an average,
the number of bits necessary to the signal representation by means of
minimizing the reconstruction error. The following article proposes
the compression of Arabic speech signal by a hybrid method
combining the wavelet transform and the linear prediction. The
adopted approach rests, on one hand, on the original signal
decomposition by ways of analysis filters, which is followed by the
compression stage, and on the other hand, on the application of the
order 5, as well as, the compression signal coefficients. The aim of
this approach is the estimation of the predicted error, which will be
coded and transmitted. The decoding operation is then used to
reconstitute the original signal. Thus, the adequate choice of the
bench of filters is useful to the transform in necessary to increase the
compression rate and induce an impercevable distortion from an
auditive point of view.
Abstract: Web usage mining algorithms have been widely
utilized for modeling user web navigation behavior. In this study we
advance a model for mining of user-s navigation pattern. The model
makes user model based on expectation-maximization (EM)
algorithm.An EM algorithm is used in statistics for finding maximum
likelihood estimates of parameters in probabilistic models, where the
model depends on unobserved latent variables. The experimental
results represent that by decreasing the number of clusters, the log
likelihood converges toward lower values and probability of the
largest cluster will be decreased while the number of the clusters
increases in each treatment.
Abstract: This paper proposes a new decision making approch
based on quantitative possibilistic influence diagrams which are
extension of standard influence diagrams in the possibilistic framework.
We will in particular treat the case where several expert
opinions relative to value nodes are available. An initial expert assigns
confidence degrees to other experts and fixes a similarity threshold
that provided possibility distributions should respect. To illustrate our
approach an evaluation algorithm for these multi-source possibilistic
influence diagrams will also be proposed.
Abstract: Detection of incipient abnormal events is important to
improve safety and reliability of machine operations and reduce losses
caused by failures. Improper set-ups or aligning of parts often leads to
severe problems in many machines. The construction of prediction
models for predicting faulty conditions is quite essential in making
decisions on when to perform machine maintenance. This paper
presents a multivariate calibration monitoring approach based on the
statistical analysis of machine measurement data. The calibration
model is used to predict two faulty conditions from historical reference
data. This approach utilizes genetic algorithms (GA) based variable
selection, and we evaluate the predictive performance of several
prediction methods using real data. The results shows that the
calibration model based on supervised probabilistic principal
component analysis (SPPCA) yielded best performance in this work.
By adopting a proper variable selection scheme in calibration models,
the prediction performance can be improved by excluding
non-informative variables from their model building steps.
Abstract: This article proposes an Ant Colony Optimization
(ACO) metaheuristic to minimize total makespan for scheduling a set
of jobs and assign workers for uniformly related parallel machines.
An algorithm based on ACO has been developed and coded on a
computer program Matlab®, to solve this problem. The paper
explains various steps to apply Ant Colony approach to the problem
of minimizing makespan for the worker assignment & jobs
scheduling problem in a parallel machine model and is aimed at
evaluating the strength of ACO as compared to other conventional
approaches. One data set containing 100 problems (12 Jobs, 03
machines and 10 workers) which is available on internet, has been
taken and solved through this ACO algorithm. The results of our
ACO based algorithm has shown drastically improved results,
especially, in terms of negligible computational effort of CPU, to
reach the optimal solution. In our case, the time taken to solve all 100
problems is even lesser than the average time taken to solve one
problem in the data set by other conventional approaches like GA
algorithm and SPT-A/LMC heuristics.
Abstract: In this paper, novel techniques in increasing the accuracy
and speed of convergence of a Feed forward Back propagation
Artificial Neural Network (FFBPNN) with polynomial activation
function reported in literature is presented. These technique was
subsequently used to determine the coefficients of Autoregressive
Moving Average (ARMA) and Autoregressive (AR) system. The
results obtained by introducing sequential and batch method of weight
initialization, batch method of weight and coefficient update, adaptive
momentum and learning rate technique gives more accurate result
and significant reduction in convergence time when compared t the
traditional method of back propagation algorithm, thereby making
FFBPNN an appropriate technique for online ARMA coefficient
determination.
Abstract: Single biometric modality recognition is not able to meet the high performance supplies in most cases with its application become more and more broadly. Multimodal biometrics identification represents an emerging trend recently. This paper investigates a novel algorithm based on fusion of both fingerprint and fingervein biometrics. For both biometric recognition, we employ the Monogenic Local Binary Pattern (MonoLBP). This operator integrate the orginal LBP (Local Binary Pattern ) with both other rotation invariant measures: local phase and local surface type. Experimental results confirm that a weighted sum based proposed fusion achieves excellent identification performances opposite unimodal biometric systems. The AUC of proposed approach based on combining the two modalities has very close to unity (0.93).
Abstract: This paper presents performance comparison of three estimation techniques used for peak load forecasting in power systems. The three optimum estimation techniques are, genetic algorithms (GA), least error squares (LS) and, least absolute value filtering (LAVF). The problem is formulated as an estimation problem. Different forecasting models are considered. Actual recorded data is used to perform the study. The performance of the above three optimal estimation techniques is examined. Advantages of each algorithms are reported and discussed.
Abstract: Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.
Abstract: This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution.
Abstract: Falls are the primary cause of accidents in people over
the age of 65, and frequently lead to serious injuries. Since the early
detection of falls is an important step to alert and protect the aging
population, a variety of research on detecting falls was carried out
including the use of accelerators, gyroscopes and tilt sensors. In
exiting studies, falls were detected using an accelerometer with
errors. In this study, the proposed method for detecting falls was to
use two accelerometers to reject wrong falls detection. As falls are
accompanied by the acceleration of gravity and rotational motion, the
falls in this study were detected by using the z-axial acceleration
differences between two sites. The falls were detected by calculating
the difference between the analyses of accelerometers placed on two
different positions on the chest of the subject. The parameters of the
maximum difference of accelerations (diff_Z) and the integration of
accelerations in a defined region (Sum_diff_Z) were used to form the
fall detection algorithm. The falls and the activities of daily living
(ADL) could be distinguished by using the proposed parameters
without errors in spite of the impact and the change in the positions
of the accelerometers. By comparing each of the axial accelerations,
the directions of falls and the condition of the subject afterwards
could be determined.In this study, by using two accelerometers
without errors attached to two sites to detect falls, the usefulness of
the proposed fall detection algorithm parameters, diff_Z and
Sum_diff_Z, were confirmed.
Abstract: As wireless sensor networks are energy constraint networks
so energy efficiency of sensor nodes is the main design issue.
Clustering of nodes is an energy efficient approach. It prolongs the
lifetime of wireless sensor networks by avoiding long distance communication.
Clustering algorithms operate in rounds. Performance of
clustering algorithm depends upon the round time. A large round
time consumes more energy of cluster heads while a small round
time causes frequent re-clustering. So existing clustering algorithms
apply a trade off to round time and calculate it from the initial
parameters of networks. But it is not appropriate to use initial
parameters based round time value throughout the network lifetime
because wireless sensor networks are dynamic in nature (nodes can be
added to the network or some nodes go out of energy). In this paper
a variable round time approach is proposed that calculates round
time depending upon the number of active nodes remaining in the
field. The proposed approach makes the clustering algorithm adaptive
to network dynamics. For simulation the approach is implemented
with LEACH in NS-2 and the results show that there is 6% increase
in network lifetime, 7% increase in 50% node death time and 5%
improvement over the data units gathered at the base station.
Abstract: Gasoline Octane Number is the standard measure of
the anti-knock properties of a motor in platforming processes, that is
one of the important unit operations for oil refineries and can be
determined with online measurement or use CFR (Cooperative Fuel
Research) engines. Online measurements of the Octane number can
be done using direct octane number analyzers, that it is too
expensive, so we have to find feasible analyzer, like ANFIS
estimators.
ANFIS is the systems that neural network incorporated in fuzzy
systems, using data automatically by learning algorithms of NNs.
ANFIS constructs an input-output mapping based both on human
knowledge and on generated input-output data pairs.
In this research, 31 industrial data sets are used (21 data for training
and the rest of the data used for generalization). Results show that,
according to this simulation, hybrid method training algorithm in
ANFIS has good agreements between industrial data and simulated
results.
Abstract: In recent years, environment regulation forcing
manufactures to consider recovery activity of end-of- life products
and/or return products for refurbishing, recycling,
remanufacturing/repair and disposal in supply chain management. In
this paper, a mathematical model is formulated for single product
production-inventory system considering remanufacturing/reuse of
return products and rate of return products follows a demand like
function, dependent on purchasing price and acceptance quality level.
It is useful in decision making to determine whether to go for
remanufacturing or disposal of returned products along with newly
produced products to satisfy a stationary demand. In addition, a
modified genetic algorithm approach is proposed, inspired by particle
swarm optimization method. Numerical analysis of the case study is
carried out to validate the model.
Abstract: In this paper, a clustering algorithm named KHarmonic
means (KHM) was employed in the training of Radial
Basis Function Networks (RBFNs). KHM organized the data in
clusters and determined the centres of the basis function. The popular
clustering algorithms, namely K-means (KM) and Fuzzy c-means
(FCM), are highly dependent on the initial identification of elements
that represent the cluster well. In KHM, the problem can be avoided.
This leads to improvement in the classification performance when
compared to other clustering algorithms. A comparison of the
classification accuracy was performed between KM, FCM and KHM.
The classification performance is based on the benchmark data sets:
Iris Plant, Diabetes and Breast Cancer. RBFN training with the KHM
algorithm shows better accuracy in classification problem.
Abstract: This paper presents a semi-supervised learning algorithm called Iterative-Cross Training (ICT) to solve the Web pages classification problems. We apply Inductive logic programming (ILP) as a strong learner in ICT. The objective of this research is to evaluate the potential of the strong learner in order to boost the performance of the weak learner of ICT. We compare the result with the supervised Naive Bayes, which is the well-known algorithm for the text classification problem. The performance of our learning algorithm is also compare with other semi-supervised learning algorithms which are Co-Training and EM. The experimental results show that ICT algorithm outperforms those algorithms and the performance of the weak learner can be enhanced by ILP system.
Abstract: With the advantage of wireless network technology,
there are a variety of mobile applications which make the issue of
wireless sensor networks as a popular research area in recent years.
As the wireless sensor network nodes move arbitrarily with the
topology fast change feature, mobile nodes are often confronted with
the void issue which will initiate packet losing, retransmitting,
rerouting, additional transmission cost and power consumption.
When transmitting packets, we would not predict void problem
occurring in advance. Thus, how to improve geographic routing with
void avoidance in wireless networks becomes an important issue. In
this paper, we proposed a greedy geographical void routing algorithm
to solve the void problem for wireless sensor networks. We use the
information of source node and void area to draw two tangents to
form a fan range of the existence void which can announce voidavoiding
message. Then we use source and destination nodes to draw
a line with an angle of the fan range to select the next forwarding
neighbor node for routing. In a dynamic wireless sensor network
environment, the proposed greedy void avoiding algorithm can be
more time-saving and more efficient to forward packets, and improve
current geographical void problem of wireless sensor networks.
Abstract: This paper undertakes the problem of optimal
capacitor placement in a distribution system. The problem is how to
optimally determine the locations to install capacitors, the types and
sizes of capacitors to he installed and, during each load level,the
control settings of these capacitors in order that a desired objective
function is minimized while the load constraints,network constraints
and operational constraints (e.g. voltage profile) at different load
levels are satisfied. The problem is formulated as a combinatorial
optimization problem with a nondifferentiable objective function.
Four solution mythologies based on algorithms (GA),tabu search
(TS), and hybrid GA-SA algorithms are presented.The solution
methodologies are preceded by a sensitivity analysis to select the
candidate capacitor installation locations.
Abstract: This paper presents an idea to improve the efficiency
of security checks in airports through the active tracking and
monitoring of passengers and staff using OFDM modulation
technique and Finger print authentication. The details of the
passenger are multiplexed using OFDM .To authenticate the
passenger, the fingerprint along with important identification
information is collected. The details of the passenger can be
transmitted after necessary modulation, and received using various
transceivers placed within the premises of the airport, and checked at
the appropriate check points, thereby increasing the efficiency of
checking. OFDM has been employed for spectral efficiency.
Abstract: In the present study, position estimation of switched reluctance motor (SRM) has been achieved on the basis of the artificial neural networks (ANNs). The ANNs can estimate the rotor position without using an extra rotor position sensor by measuring the phase flux linkages and phase currents. Flux linkage-phase current-rotor position data set and supervised backpropagation learning algorithm are used in training of the ANN based position estimator. A 4-phase SRM have been used to verify the accuracy and feasibility of the proposed position estimator. Simulation results show that the proposed position estimator gives precise and accurate position estimations for both under the low and high level reference speeds of the SRM