Abstract: An Upgraded Cuckoo Search Algorithm is proposed here to solve optimization problems based on the improvements made in the earlier versions of Cuckoo Search Algorithm. Short comings of the earlier versions like slow convergence, trap in local optima improved in the proposed version by random initialization of solution by suggesting an Improved Lambda Iteration Relaxation method, Random Gaussian Distribution Walk to improve local search and further proposing Greedy Selection to accelerate to optimized solution quickly and by “Study Nearby Strategy” to improve global search performance by avoiding trapping to local optima. It is further proposed to generate better solution by Crossover Operation. The proposed strategy used in algorithm shows superiority in terms of high convergence speed over several classical algorithms. Three standard algorithms were tested on a 6-generator standard test system and the results are presented which clearly demonstrate its superiority over other established algorithms. The algorithm is also capable of handling higher unit systems.
Abstract: This paper investigates MIMO (Multiple-Input
Multiple-Output) adaptive filtering techniques for the application
of supervised source separation in the context of convolutive
mixtures. From the observation that there is correlation among the
signals of the different mixtures, an improvement in the NSAF
(Normalized Subband Adaptive Filter) algorithm is proposed in
order to accelerate its convergence rate. Simulation results with
mixtures of speech signals in reverberant environments show the
superior performance of the proposed algorithm with respect to the
performances of the NLMS (Normalized Least-Mean-Square) and
conventional NSAF, considering both the convergence speed and
SIR (Signal-to-Interference Ratio) after convergence.
Abstract: The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.
Abstract: Image segmentation and color identification is an
important process used in various emerging fields like intelligent
robotics. A method is proposed for the manipulator to grasp and place
the color object into correct location. The existing methods such as
PSO, has problems like accelerating the convergence speed and
converging to a local minimum leading to sub optimal performance.
To improve the performance, we are using watershed algorithm and
for color identification, we are using EPSO. EPSO method is used to
reduce the probability of being stuck in the local minimum. The
proposed method offers the particles a more powerful global
exploration capability. EPSO methods can determine the particles
stuck in the local minimum and can also enhance learning speed as
the particle movement will be faster.
Abstract: This paper describes a new efficient blind source separation method; in this method we uses a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence.
Abstract: In this communication, we have made an attempt to design multiplier-less low-pass finite impulse response (FIR) filter with the aid of various mutation strategies of Differential Evolution (DE) algorithm. Impulse response coefficient of the designed FIR filter has been represented as sums or differences of powers of two. Performance of the proposed filter has been evaluated in terms of its frequency response and associated hardware cost. Supremacy of our approach has been substantiated by comparing our result with many of the existing multiplier-less filter design algorithms of recent interest. It has also been demonstrated that DE-optimized filter outperforms Genetic Algorithm (GA) based design by a large margin. Hardware efficiency of our algorithm has further been validated by implementing those filters on a Field Programmable Gate Array (FPGA) chip.
Abstract: In this paper, an optimal design of linear phase digital
high pass finite impulse response (FIR) filter using Particle Swarm
Optimization with Constriction Factor and Inertia Weight Approach
(PSO-CFIWA) has been presented. In the design process, the filter
length, pass band and stop band frequencies, feasible pass band and
stop band ripple sizes are specified. FIR filter design is a multi-modal
optimization problem. The conventional gradient based optimization
techniques are not efficient for digital filter design. Given the filter
specifications to be realized, the PSO-CFIWA algorithm generates a
set of optimal filter coefficients and tries to meet the ideal frequency
response characteristic. In this paper, for the given problem, the
designs of the optimal FIR high pass filters of different orders have
been performed. The simulation results have been compared to those
obtained by the well accepted algorithms such as Parks and
McClellan algorithm (PM), genetic algorithm (GA). The results
justify that the proposed optimal filter design approach using PSOCFIWA
outperforms PM and GA, not only in the accuracy of the
designed filter but also in the convergence speed and solution
quality.
Abstract: The effect of different combinations of response
feedback on the performance of active control system on nonlinear
frames has been studied in this paper. To this end different feedback
combinations including displacement, velocity, acceleration and full
response feedback have been utilized in controlling the response of
an eight story bilinear hysteretic frame which has been subjected to a
white noise excitation and controlled by eight actuators which could
fully control the frame. For active control of nonlinear frame
Newmark nonlinear instantaneous optimal control algorithm has been
used which a diagonal matrix has been selected for weighting
matrices in performance index. For optimal design of active control
system while the objective has been to reduce the maximum drift to
below the yielding level, Distributed Genetic Algorithm (DGA) has
been used to determine the proper set of weighting matrices. The
criteria to assess the effect of each combination of response feedback
have been the minimum required control force to reduce the
maximum drift to below the yielding drift. The results of numerical
simulation show that the performance of active control system is
dependent on the type of response feedback where the velocity
feedback is more effective in designing optimal control system in
comparison with displacement and acceleration feedback. Also using
full feedback of response in controller design leads to minimum
control force amongst other combinations. Also the distributed
genetic algorithm shows acceptable convergence speed in solving the
optimization problem of designing active control systems.
Abstract: The genetic algorithm (GA) based solution techniques
are found suitable for optimization because of their ability of
simultaneous multidimensional search. Many GA-variants have been
tried in the past to solve optimal power flow (OPF), one of the
nonlinear problems of electric power system. The issues like
convergence speed and accuracy of the optimal solution obtained
after number of generations using GA techniques and handling
system constraints in OPF are subjects of discussion. The results
obtained for GA-Fuzzy OPF on various power systems have shown
faster convergence and lesser generation costs as compared to other
approaches. This paper presents an enhanced GA-Fuzzy OPF (EGAOPF)
using penalty factors to handle line flow constraints and load
bus voltage limits for both normal network and contingency case
with congestion. In addition to crossover and mutation rate
adaptation scheme that adapts crossover and mutation probabilities
for each generation based on fitness values of previous generations, a
block swap operator is also incorporated in proposed EGA-OPF. The
line flow limits and load bus voltage magnitude limits are handled by
incorporating line overflow and load voltage penalty factors
respectively in each chromosome fitness function. The effects of
different penalty factors settings are also analyzed under contingent
state.
Abstract: In the context of spectrum surveillance, a new method
to recover the code of spread spectrum signal is presented, while the
receiver has no knowledge of the transmitter-s spreading sequence. In
our previous paper, we used Genetic algorithm (GA), to recover
spreading code. Although genetic algorithms (GAs) are well known
for their robustness in solving complex optimization problems, but
nonetheless, by increasing the length of the code, we will often lead
to an unacceptable slow convergence speed. To solve this problem we
introduce Particle Swarm Optimization (PSO) into code estimation in
spread spectrum communication system. In searching process for
code estimation, the PSO algorithm has the merits of rapid
convergence to the global optimum, without being trapped in local
suboptimum, and good robustness to noise. In this paper we describe
how to implement PSO as a component of a searching algorithm in
code estimation. Swarm intelligence boasts a number of advantages
due to the use of mobile agents. Some of them are: Scalability, Fault
tolerance, Adaptation, Speed, Modularity, Autonomy, and
Parallelism. These properties make swarm intelligence very attractive
for spread spectrum code estimation. They also make swarm
intelligence suitable for a variety of other kinds of channels. Our
results compare between swarm-based algorithms and Genetic
algorithms, and also show PSO algorithm performance in code
estimation process.
Abstract: In wireless communication system, a Decision Feedback Equalizer (DFE) to cancel the intersymbol interference (ISI) is required. In this paper, an exact convergence analysis of the (DFE) adapted by the Least Mean Square (LMS) algorithm during the training phase is derived by taking into account the finite alphabet context of data transmission. This allows us to determine the shortest training sequence that allows to reach a given Mean Square Error (MSE). With the intention of avoiding the problem of ill-convergence, the paper proposes an initialization strategy for the blind decision directed (DD) algorithm. This then yields a semi-blind DFE with high speed and good convergence.
Abstract: Conceptualization strengthens intelligent systems in generalization skill, effective knowledge representation, real-time inference, and managing uncertain and indefinite situations in addition to facilitating knowledge communication for learning agents situated in real world. Concept learning introduces a way of abstraction by which the continuous state is formed as entities called concepts which are connected to the action space and thus, they illustrate somehow the complex action space. Of computational concept learning approaches, action-based conceptualization is favored because of its simplicity and mirror neuron foundations in neuroscience. In this paper, a new biologically inspired concept learning approach based on the probabilistic framework is proposed. This approach exploits and extends the mirror neuron-s role in conceptualization for a reinforcement learning agent in nondeterministic environments. In the proposed method, instead of building a huge numerical knowledge, the concepts are learnt gradually from rewards through interaction with the environment. Moreover the probabilistic formation of the concepts is employed to deal with uncertain and dynamic nature of real problems in addition to the ability of generalization. These characteristics as a whole distinguish the proposed learning algorithm from both a pure classification algorithm and typical reinforcement learning. Simulation results show advantages of the proposed framework in terms of convergence speed as well as generalization and asymptotic behavior because of utilizing both success and failures attempts through received rewards. Experimental results, on the other hand, show the applicability and effectiveness of the proposed method in continuous and noisy environments for a real robotic task such as maze as well as the benefits of implementing an incremental learning scenario in artificial agents.
Abstract: Among many different methods that are used for
optimizing different engineering problems mathematical (numerical)
optimization techniques are very important because they can easily
be used and are consistent with most of engineering problems. Many
studies and researches are done on stability analysis of three
dimensional (3D) slopes and the relating probable slip surfaces and
determination of factors of safety, but in most of them force
equilibrium equations, as in simplified 2D methods, are considered
only in two directions. In other words for decreasing mathematical
calculations and also for simplifying purposes the force equilibrium
equation in 3rd direction is omitted. This point is considered in just a
few numbers of previous studies and most of them have only given a
factor of safety and they haven-t made enough effort to find the most
probable slip surface. In this study shapes of the slip surfaces are
modeled, and safety factors are calculated considering the force
equilibrium equations in all three directions, and also the moment
equilibrium equation is satisfied in the slip direction, and using
nonlinear programming techniques the shape of the most probable
slip surface is determined. The model which is used in this study is a
3D model that is composed of three upper surfaces which can cover
all defined and probable slip surfaces. In this research the meshing
process is done in a way that all elements are prismatic with
quadrilateral cross sections, and the safety factor is defined on this
quadrilateral surface in the base of the element which is a part of the
whole slip surface. The method that is used in this study to find the
most probable slip surface is the non-linear programming method in
which the objective function that must get optimized is the factor of
safety that is a function of the soil properties and the coordinates of
the nodes on the probable slip surface. The main reason for using
non-linear programming method in this research is its quick
convergence to the desired responses. The final results show a good
compatibility with the previously used classical and 2D methods and
also show a reasonable convergence speed.
Abstract: Adaptive echo cancellers with two-path algorithm are
applied to avoid the false adaptation during the double-talk situation.
In the two-path algorithm, several transfer logic solutions have been
proposed to control the filter update. This paper presents an improved
transfer logic solution. It improves the convergence speed of the
two-path algorithm, and allows the reduction of the memory elements
and computational complexity. Results of simulations show the
improved performance of the proposed solution.
Abstract: The backpropagation algorithm in general employs quadratic error function. In fact, most of the problems that involve minimization employ the Quadratic error function. With alternative error functions the performance of the optimization scheme can be improved. The new error functions help in suppressing the ill-effects of the outliers and have shown good performance to noise. In this paper we have tried to evaluate and compare the relative performance of complex valued neural network using different error functions. During first simulation for complex XOR gate it is observed that some error functions like Absolute error, Cauchy error function can replace Quadratic error function. In the second simulation it is observed that for some error functions the performance of the complex valued neural network depends on the architecture of the network whereas with few other error functions convergence speed of the network is independent of architecture of the neural network.
Abstract: In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge faster towards the optimal solution of a problem. This new genetic operator is called ''intuition'' operator. Generally speaking, one can claim that this operator is a way to include any heuristic or any other local knowledge, concerning the problem, that cannot be embedded in the fitness function. Simulation results show that the use of this operator increases significantly the performance of the classic Genetic Algorithm by increasing the convergence speed of its population.
Abstract: Artificial Bee Colony (ABC) algorithm is a relatively new swarm intelligence technique for clustering. It produces higher
quality clusters compared to other population-based algorithms but with poor energy efficiency, cluster quality consistency and typically slower in convergence speed. Inspired by energy saving foraging behavior of natural honey bees this paper presents a Quality and Quantity Aware Artificial Bee Colony (Q2ABC) algorithm to improve quality of cluster identification, energy efficiency and convergence speed of the original ABC. To evaluate the performance of Q2ABC algorithm, experiments were conducted on a suite of ten benchmark UCI datasets. The results demonstrate Q2ABC outperformed ABC and K-means algorithm in the quality of clusters delivered.
Abstract: An additive fuzzy system comprising m rules with
n inputs and p outputs in each rule has at least t m(2n + 2 p + 1)
parameters needing to be tuned. The system consists of a large
number of if-then fuzzy rules and takes a long time to tune its
parameters especially in the case of a large amount of training data
samples. In this paper, a new learning strategy is investigated to cope
with this obstacle. Parameters that tend toward constant values at the
learning process are initially fixed and they are not tuned till the end
of the learning time. Experiments based on applications of the
additive fuzzy system in function approximation demonstrate that the
proposed approach reduces the learning time and hence improves
convergence speed considerably.
Abstract: In this work, a Modified Functional Link Artificial
Neural Network (M-FLANN) is proposed which is simpler than a
Multilayer Perceptron (MLP) and improves upon the universal
approximation capability of Functional Link Artificial Neural
Network (FLANN). MLP and its variants: Direct Linear Feedthrough
Artificial Neural Network (DLFANN), FLANN and
M-FLANN have been implemented to model a simulated Water Bath
System and a Continually Stirred Tank Heater (CSTH). Their
convergence speed and generalization ability have been compared.
The networks have been tested for their interpolation and
extrapolation capability using noise-free and noisy data. The results
show that M-FLANN which is computationally cheap, performs
better and has greater generalization ability than other networks
considered in the work.
Abstract: In this paper, an improved ant colony optimization
(ACO) algorithm is proposed to enhance the performance of global
optimum search. The strategy of the proposed algorithm has the
capability of fuzzy pheromone updating, adaptive parameter tuning,
and mechanism resetting. The proposed method is utilized to tune the
parameters of the fuzzy controller for a real beam and ball system.
Simulation and experimental results indicate that better performance
can be achieved compared to the conventional ACO algorithms in the
aspect of convergence speed and accuracy.