Abstract: This paper describes about the process of recognition and classification of brain images such as normal and abnormal based on PSO-SVM. Image Classification is becoming more important for medical diagnosis process. In medical area especially for diagnosis the abnormality of the patient is classified, which plays a great role for the doctors to diagnosis the patient according to the severeness of the diseases. In case of DICOM images it is very tough for optimal recognition and early detection of diseases. Our work focuses on recognition and classification of DICOM image based on collective approach of digital image processing. For optimal recognition and classification Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Support Vector Machine (SVM) are used. The collective approach by using PSO-SVM gives high approximation capability and much faster convergence.
Abstract: The equilibrium chemical reactions taken place in a converter reactor of the Khorasan Petrochemical Ammonia plant was studied using the minimization of Gibbs free energy method. In the minimization of the Gibbs free energy function the Davidon– Fletcher–Powell (DFP) optimization procedure using the penalty terms in the well-defined objective function was used. It should be noted that in the DFP procedure along with the corresponding penalty terms the Hessian matrices for the composition of constituents in the Converter reactor can be excluded. This, in fact, can be considered as the main advantage of the DFP optimization procedure. Also the effect of temperature and pressure on the equilibrium composition of the constituents was investigated. The results obtained in this work were compared with the data collected from the converter reactor of the Khorasan Petrochemical Ammonia plant. It was concluded that the results obtained from the method used in this work are in good agreement with the industrial data. Notably, the algorithm developed in this work, in spite of its simplicity, takes the advantage of short computation and convergence time.
Abstract: In this paper, a class of impulsive BAM fuzzy cellular neural networks with distributed delays and reaction-diffusion terms is formulated and investigated. By employing the delay differential inequality and inequality technique developed by Xu et al., some sufficient conditions ensuring the existence, uniqueness and global exponential stability of equilibrium point for impulsive BAM fuzzy cellular neural networks with distributed delays and reaction-diffusion terms are obtained. In particular, the estimate of the exponential convergence rate is also provided, which depends on system parameters, diffusion effect and impulsive disturbed intention. It is believed that these results are significant and useful for the design and applications of BAM fuzzy cellular neural networks. An example is given to show the effectiveness of the results obtained here.
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: For the last years, the variants of the Newton-s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we present a new Newton-s method based on contra harmonic mean with cubically convergent. Numerical examples show that the new method can compete with the classical Newton's method.
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: Cognitive Infocommunications (CogInfoCom) is a new
research direction which has emerged as the synergic convergence
of infocommunications and the cognitive sciences. In this paper,
we provide the definition of CogInfoCom, and propose an architectural
framework for the interaction-oriented design of CogInfoCom
systems. We provide the outlines of an application example of
the interaction-oriented architecture, and briefly discuss its main
characteristics.
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: The main objective of the present paper is to derive an easy numerical technique for the analysis of the free vibration through the stepped regions of plates. Based on the utilities of the step by step integration initial values IV and Finite differences FD methods, the present improved Initial Value Finite Differences (IVFD) technique is achieved. The first initial conditions are formulated in convenient forms for the step by step integrations while the upper and lower edge conditions are expressed in finite difference modes. Also compatibility conditions are created due to the sudden variation of plate thickness. The present method (IVFD) is applied to solve the fourth order partial differential equation of motion for stepped plate across two different panels under the sudden step compatibility in addition to different types of end conditions. The obtained results are examined and the validity of the present method is proved showing excellent efficiency and rapid convergence.
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: Innovations, especially technological, are considered
key-drivers for sustainable economic growth and competitiveness in
the globalised world. As such they should also play an important role
in the process of economical convergence inside the EU.
Unfortunately, the problem of insufficient innovation performance
concerns around half of the EU countries. Poland shows that a lack of
a consistent high-tech financing system constitutes a serious obstacle
for the development of innovative firms. In this article we will
evaluate these questions referring to the example of Ammono S.A., a
Polish company established to develop and commercialise an original
technology for the production of bulk GaN crystals. We will focus on
its efforts to accumulate the financial resources necessary at different
stages of its development. The purpose of this article is to suggest
possible ways to improve the national innovative system, which
would make it more competent in generating high-tech leaders.
Abstract: We present a subband adaptive infinite-impulse response (IIR) filtering method, which is based on a polyphase decomposition of IIR filter. Motivated by the fact that the polyphase structure has benefits in terms of convergence rate and stability, we introduce the polyphase decomposition to subband IIR filtering, i.e., in each subband high order IIR filter is decomposed into polyphase IIR filters with lower order. Computer simulations demonstrate that the proposed method has improved convergence rate over conventional IIR filters.
Abstract: Sinc-collocation scheme is one of the new techniques
used in solving numerical problems involving integral equations. This
method has been shown to be a powerful numerical tool for finding
fast and accurate solutions. So, in this paper, some properties of the
Sinc-collocation method required for our subsequent development
are given and are utilized to reduce integral equation of the first
kind to some algebraic equations. Then convergence with exponential
rate is proved by a theorem to guarantee applicability of numerical
technique. Finally, numerical examples are included to demonstrate
the validity and applicability of the technique.
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: A major part of the flow field involves no complicated
turbulent behavior in many turbulent flows. In this research work, in
order to reduce required memory and CPU time, the flow field was
decomposed into several blocks, each block including its special
turbulence. A two dimensional backward facing step was considered
here. Four combinations of the Prandtl mixing length and standard k-
E models were implemented as well. Computer memory and CPU
time consumption in addition to numerical convergence and accuracy
of the obtained results were mainly investigated. Observations
showed that, a suitable combination of turbulence models in different
blocks led to the results with the same accuracy as the high order
turbulence model for all of the blocks, in addition to the reductions in
memory and CPU time consumption.
Abstract: A Picard-Newton iteration method is studied to accelerate the numerical solution procedure of a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. The Picard-Newton iteration is designed by adding higher-order terms of small quantity to an existing Picard iteration. The discrete functional analysis and inductive hypothesis reasoning techniques are used to overcome difficulties coming from nonlinearity and coupling, and theoretical analysis is made for the convergence and approximation properties of the iteration scheme. The Picard-Newton iteration has a quadratic convergent ratio, and its solution has second order spatial approximation and first order temporal approximation to the exact solution of the original problem. Numerical tests verify the results of the theoretical analysis, and show the Picard-Newton iteration is more efficient than the Picard iteration.
Abstract: In this paper, we present the preconditioned mixed-type
splitting iterative method for solving the linear systems, Ax = b,
where A is a Z-matrix. And we give some comparison theorems
to show that the convergence rate of the preconditioned mixed-type
splitting iterative method is faster than that of the mixed-type splitting
iterative method. Finally, we give a numerical example to illustrate
our results.
Abstract: This research paper designs a unique motion planner
of multiple platoons of nonholonomic car-like robots as a feasible
solution to the lane changing/merging maneuvers. The decentralized
planner with a leaderless approach and a path-guidance principle
derived from the Lyapunov-based control scheme generates collision
free avoidance and safe merging maneuvers from multiple lanes to a
single lane by deploying a split/merge strategy. The fixed obstacles
are the markings and boundaries of the road lanes, while the moving
obstacles are the robots themselves. Real and virtual road lane
markings and the boundaries of road lanes are incorporated into a
workspace to achieve the desired formation and configuration of the
robots. Convergence of the robots to goal configurations and the
repulsion of the robots from specified obstacles are achieved by
suitable attractive and repulsive potential field functions,
respectively. The results can be viewed as a significant contribution
to the avoidance algorithm of the intelligent vehicle systems (IVS).
Computer simulations highlight the effectiveness of the split/merge
strategy and the acceleration-based controllers.
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: The paper presents a new hybridization methodology involving Neural, Fuzzy and Rough Computing. A Rough Sets based approximation technique has been proposed based on a certain Neuro – Fuzzy architecture. A New Rough Neuron composition consisting of a combination of a Lower Bound neuron and a Boundary neuron has also been described. The conventional convergence of error in back propagation has been given away for a new framework based on 'Output Excitation Factor' and an inverse input transfer function. The paper also presents a brief comparison of performances, of the existing Rough Neural Networks and ANFIS architecture against the proposed methodology. It can be observed that the rough approximation based neuro-fuzzy architecture is superior to its counterparts.