Abstract: Web service composition combines available services
to provide new functionality. Given the number of available
services with similar functionalities and different non functional
aspects (QoS), the problem of finding a QoS-optimal web service
composition is considered as an optimization problem belonging to
NP-hard class. Thus, an optimal solution cannot be found by exact
algorithms within a reasonable time. In this paper, a meta-heuristic
bio-inspired is presented to address the QoS aware web service
composition; it is based on Elephant Herding Optimization (EHO)
algorithm, which is inspired by the herding behavior of elephant
group. EHO is characterized by a process of dividing and combining
the population to sub populations (clan); this process allows the
exchange of information between local searches to move toward
a global optimum. However, with Applying others evolutionary
algorithms the problem of early stagnancy in a local optimum
cannot be avoided. Compared with PSO, the results of experimental
evaluation show that our proposition significantly outperforms the
existing algorithm with better performance of the fitness value and a
fast convergence.
Abstract: In this paper, a spatial multiple-kernel fuzzy C-means (SMKFCM) algorithm is introduced for segmentation problem. A linear combination of multiples kernels with spatial information is used in the kernel FCM (KFCM) and the updating rules for the linear coefficients of the composite kernels are derived as well. Fuzzy cmeans (FCM) based techniques have been widely used in medical image segmentation problem due to their simplicity and fast convergence. The proposed SMKFCM algorithm provides us a new flexible vehicle to fuse different pixel information in medical image segmentation and detection of MR images. To evaluate the robustness of the proposed segmentation algorithm in noisy environment, we add noise in medical brain tumor MR images and calculated the success rate and segmentation accuracy. From the experimental results it is clear that the proposed algorithm has better performance than those of other FCM based techniques for noisy medical MR images.
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: Recent experimental evidences have shown that because
of a fast convergence and a nice accuracy, neural networks training
via extended kalman filter (EKF) method is widely applied. However,
as to an uncertainty of the system dynamics or modeling error, the
performance of the method is unreliable. In order to overcome this
problem in this paper, a new finite impulse response (FIR) filter based
learning algorithm is proposed to train radial basis function neural
networks (RBFN) for nonlinear function approximation. Compared
to the EKF training method, the proposed FIR filter training method
is more robust to those environmental conditions. Furthermore , the
number of centers will be considered since it affects the performance
of approximation.
Abstract: Process planning and production scheduling play
important roles in manufacturing systems. In this paper a multiobjective
mixed integer linear programming model is presented for
the integrated planning and scheduling of multi-product. The aim is
to find a set of high-quality trade-off solutions. This is a
combinatorial optimization problem with substantially large solution
space, suggesting that it is highly difficult to find the best solutions
with the exact search method. To account for it, a PSO-based
algorithm is proposed by fully utilizing the capability of the
exploration search and fast convergence. To fit the continuous PSO
in the discrete modeled problem, a solution representation is used in
the algorithm. The numerical experiments have been performed to
demonstrate the effectiveness of the proposed algorithm.
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: This work proposes a recursive weighted ELS
algorithm for system identification by applying numerically robust
orthogonal Householder transformations. The properties of the
proposed algorithm show it obtains acceptable results in a noisy
environment: fast convergence and asymptotically unbiased
estimates. Comparative analysis with others robust methods well
known from literature are also presented.
Abstract: This paper presents the use of Legendre pseudospectral
method for the optimization of finite-thrust orbital transfer for
spacecrafts. In order to get an accurate solution, the System-s
dynamics equations were normalized through a dimensionless method.
The Legendre pseudospectral method is based on interpolating
functions on Legendre-Gauss-Lobatto (LGL) quadrature nodes. This
is used to transform the optimal control problem into a constrained
parameter optimization problem. The developed novel optimization
algorithm can be used to solve similar optimization problems of
spacecraft finite-thrust orbital transfer. The results of a numerical
simulation verified the validity of the proposed optimization method.
The simulation results reveal that pseudospectral optimization method
is a promising method for real-time trajectory optimization and
provides good accuracy and fast convergence.
Abstract: This paper present the implementation of a new ordering strategy on Successive Overrelaxation scheme on two dimensional boundary value problems. The strategy involve two directions alternatingly; from top and bottom of the solution domain. The method shows to significantly reduce the iteration number to converge. Four numerical experiments were carried out to examine the performance of the new strategy.
Abstract: This paper introduces a new variable step-size APA with decorrelation of AR input process is based on the MSD analysis. To achieve a fast convergence rate and a small steady-state estimation error, he proposed algorithm uses variable step size that is determined by minimising the MSD. In addition, experimental results show that the proposed algorithm is achieved better performance than the other algorithms.