Abstract: Voltage collapse is instability of heavily loaded electric
power systems that cause to declining voltages and blackout. Power
systems are predicated to become more heavily loaded in the future
decade as the demand for electric power rises while economic and
environmental concerns limit the construction of new transmission
and generation capacity. Heavily loaded power systems are closer to
their stability limits and voltage collapse blackouts will occur if
suitable monitoring and control measures are not taken. To control
transmission lines, it can be used from FACTS devices.
In this paper Harmony search algorithm (HSA) and Genetic
Algorithm (GA) have applied to determine optimal location of
FACTS devices in a power system to improve power system stability.
Three types of FACTS devices (TCPAT, UPFS, and SVC) have been
introduced. Bus under voltage has been solved by controlling reactive
power of shunt compensator. Also a combined series-shunt
compensators has been also used to control transmission power flow
and bus voltage simultaneously.
Different scenarios have been considered. First TCPAT, UPFS, and
SVC are placed solely in transmission lines and indices have been
calculated. Then two types of above controller try to improve
parameters randomly. The last scenario tries to make better voltage
stability index and losses by implementation of three types controller
simultaneously. These scenarios are executed on typical 34-bus test
system and yields efficiency in improvement of voltage profile and
reduction of power losses; it also may permit an increase in power
transfer capacity, maximum loading, and voltage stability margin.
Abstract: This paper presents a new adaptive impedance control
strategy, based on Function Approximation Technique (FAT) to
compensate for unknown non-flat environment shape or time-varying
environment location. The target impedance in the force controllable
direction is modified by incorporating adaptive compensators and the
uncertainties are represented by FAT, allowing the update law to be
derived easily. The force error feedback is utilized in the estimation
and the accurate knowledge of the environment parameters are not
required by the algorithm. It is shown mathematically that the
stability of the controller is guaranteed based on Lyapunov theory.
Simulation results presented to demonstrate the validity of the
proposed controller.
Abstract: This paper presents an improved image segmentation
model with edge preserving regularization based on the
piecewise-smooth Mumford-Shah functional. A level set formulation
is considered for the Mumford-Shah functional minimization in
segmentation, and the corresponding partial difference equations are
solved by the backward Euler discretization. Aiming at encouraging
edge preserving regularization, a new edge indicator function is
introduced at level set frame. In which all the grid points which is used
to locate the level set curve are considered to avoid blurring the edges
and a nonlinear smooth constraint function as regularization term is
applied to smooth the image in the isophote direction instead of the
gradient direction. In implementation, some strategies such as a new
scheme for extension of u+ and u- computation of the grid points and
speedup of the convergence are studied to improve the efficacy of the
algorithm. The resulting algorithm has been implemented and
compared with the previous methods, and has been proved efficiently
by several cases.
Abstract: In this work we evaluate the possibility of predicting
the emotional state of a person based on the EEG. We investigate
the problem of classifying valence from EEG signals during
the presentation of affective pictures, utilizing the "frontal EEG
asymmetry" phenomenon. To distinguish positive and negative
emotions, we applied the Common Spatial Patterns algorithm.
In contrast to our expectations, the affective pictures did not
reliably elicit changes in frontal asymmetry. The classifying task
thereby becomes very hard as reflected by the poor classifier
performance. We suspect that the masking of the source of the
brain activity related to emotions, coming mostly from deeper
structures in the brain, and the insufficient emotional engagement
are among main reasons why it is difficult to predict the emotional
state of a person.
Abstract: The Minimal Residual (MR) is modified for adaptive
filtering application. Three forms of MR based algorithm are
presented: i) the low complexity SPCG, ii) MREDSI, and iii)
MREDSII. The low complexity is a reduced complexity version of a
previously proposed SPCG algorithm. Approximations introduced
reduce the algorithm to an LMS type algorithm, but, maintain the
superior convergence of the SPCG algorithm. Both MREDSI and
MREDSII are MR based methods with Euclidean direction of search.
The choice of Euclidean directions is shown via simulation to give
better misadjustment compared to their gradient search counterparts.
Abstract: This paper introduces a new approach for the performance
analysis of adaptive filter with error saturation nonlinearity in
the presence of impulsive noise. The performance analysis of adaptive
filters includes both transient analysis which shows that how fast
a filter learns and the steady-state analysis gives how well a filter
learns. The recursive expressions for mean-square deviation(MSD)
and excess mean-square error(EMSE) are derived based on weighted
energy conservation arguments which provide the transient behavior
of the adaptive algorithm. The steady-state analysis for co-related
input regressor data is analyzed, so this approach leads to a new
performance results without restricting the input regression data to
be white.
Abstract: In this paper, we consider a new particle filter inspired
by biological evolution. In the standard particle filter, a resampling
scheme is used to decrease the degeneracy phenomenon and improve
estimation performance. Unfortunately, however, it could cause the
undesired the particle deprivation problem, as well. In order to
overcome this problem of the particle filter, we propose a novel
filtering method called the genetic filter. In the proposed filter, we
embed the genetic algorithm into the particle filter and overcome the
problems of the standard particle filter. The validity of the proposed
method is demonstrated by computer simulation.
Abstract: This paper presents a simplified version of Data Envelopment Analysis (DEA) - a conventional approach to evaluating the performance and ranking of competitive objects characterized by two groups of factors acting in opposite directions: inputs and outputs. DEA with a Perfect Object (DEA PO) augments the group of actual objects with a virtual Perfect Object - the one having greatest outputs and smallest inputs. It allows for obtaining an explicit analytical solution and making a step to an absolute efficiency. This paper develops this approach further and introduces a DEA model with Partially Perfect Objects. DEA PPO consecutively eliminates the smallest relative inputs or greatest relative outputs, and applies DEA PO to the reduced collections of indicators. The partial efficiency scores are combined to get the weighted efficiency score. The computational scheme remains simple, like that of DEA PO, but the advantage of the DEA PPO is taking into account all of the inputs and outputs for each actual object. Firm evaluation is considered as an example.
Abstract: The objective of this paper is to estimate realistic
principal extrusion process parameters by means of artificial neural
network. Conventionally, finite element analysis is used to derive
process parameters. However, the finite element analysis of the
extrusion model does not consider the manufacturing process
constraints in its modeling. Therefore, the process parameters
obtained through such an analysis remains highly theoretical.
Alternatively, process development in industrial extrusion is to a
great extent based on trial and error and often involves full-size
experiments, which are both expensive and time-consuming. The
artificial neural network-based estimation of the extrusion process
parameters prior to plant execution helps to make the actual extrusion
operation more efficient because more realistic parameters may be
obtained. And so, it bridges the gap between simulation and real
manufacturing execution system. In this work, a suitable neural
network is designed which is trained using an appropriate learning
algorithm. The network so trained is used to predict the
manufacturing process parameters.
Abstract: The authors present an algorithm for order reduction of linear dynamic systems using the combined advantages of stability equation method and the error minimization by Genetic algorithm. The denominator of the reduced order model is obtained by the stability equation method and the numerator terms of the lower order transfer function are determined by minimizing the integral square error between the transient responses of original and reduced order models using Genetic algorithm. The reduction procedure is simple and computer oriented. It is shown that the algorithm has several advantages, e.g. the reduced order models retain the steady-state value and stability of the original system. The proposed algorithm has also been extended for the order reduction of linear multivariable systems. Two numerical examples are solved to illustrate the superiority of the algorithm over some existing ones including one example of multivariable system.
Abstract: The paper proposes an approach using genetic algorithm for computing the region based image similarity. The image is denoted using a set of segmented regions reflecting color and texture properties of an image. An image is associated with a family of image features corresponding to the regions. The resemblance of two images is then defined as the overall similarity between two families of image features, and quantified by a similarity measure, which integrates properties of all the regions in the images. A genetic algorithm is applied to decide the most plausible matching. The performance of the proposed method is illustrated using examples from an image database of general-purpose images, and is shown to produce good results.
Abstract: Transmission network expansion planning (TNEP) is
a basic part of power system planning that determines where, when
and how many new transmission lines should be added to the
network. Up till now, various methods have been presented to solve
the static transmission network expansion planning (STNEP)
problem. But in all of these methods, transmission expansion
planning considering network adequacy restriction has not been
investigated. Thus, in this paper, STNEP problem is being studied
considering network adequacy restriction using discrete particle
swarm optimization (DPSO) algorithm. The goal of this paper is
obtaining a configuration for network expansion with lowest
expansion cost and a specific adequacy. The proposed idea has been
tested on the Garvers network and compared with the decimal
codification genetic algorithm (DCGA). The results show that the
network will possess maximum efficiency economically. Also, it is
shown that precision and convergence speed of the proposed DPSO
based method for the solution of the STNEP problem is more than
DCGA approach.
Abstract: Several works regarding facial recognition have dealt with methods which identify isolated characteristics of the face or with templates which encompass several regions of it. In this paper a new technique which approaches the problem holistically dispensing with the need to identify geometrical characteristics or regions of the face is introduced. The characterization of a face is achieved by randomly sampling selected attributes of the pixels of its image. From this information we construct a set of data, which correspond to the values of low frequencies, gradient, entropy and another several characteristics of pixel of the image. Generating a set of “p" variables. The multivariate data set with different polynomials minimizing the data fitness error in the minimax sense (L∞ - Norm) is approximated. With the use of a Genetic Algorithm (GA) it is able to circumvent the problem of dimensionality inherent to higher degree polynomial approximations. The GA yields the degree and values of a set of coefficients of the polynomials approximating of the image of a face. By finding a family of characteristic polynomials from several variables (pixel characteristics) for each face (say Fi ) in the data base through a resampling process the system in use, is trained. A face (say F ) is recognized by finding its characteristic polynomials and using an AdaBoost Classifier from F -s polynomials to each of the Fi -s polynomials. The winner is the polynomial family closer to F -s corresponding to target face in data base.
Abstract: In this paper, a new algorithm for generating codebook is proposed for vector quantization (VQ) in image coding. The significant features of the training image vectors are extracted by using the proposed Orthogonal Polynomials based transformation. We propose to generate the codebook by partitioning these feature vectors into a binary tree. Each feature vector at a non-terminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. The binary tree codebook is used for encoding and decoding the feature vectors. In the decoding process the feature vectors are subjected to inverse transformation with the help of basis functions of the proposed Orthogonal Polynomials based transformation to get back the approximated input image training vectors. The results of the proposed coding are compared with the VQ using Discrete Cosine Transform (DCT) and Pairwise Nearest Neighbor (PNN) algorithm. The new algorithm results in a considerable reduction in computation time and provides better reconstructed picture quality.
Abstract: The performance of a sucrose-based H2 production in
a completely stirred tank reactor (CSTR) was modeled by neural
network back-propagation (BP) algorithm. The H2 production was
monitored over a period of 450 days at 35±1 ºC. The proposed model
predicts H2 production rates based on hydraulic retention time
(HRT), recycle ratio, sucrose concentration and degradation, biomass
concentrations, pH, alkalinity, oxidation-reduction potential (ORP),
acids and alcohols concentrations. Artificial neural networks (ANNs)
have an ability to capture non-linear information very efficiently. In
this study, a predictive controller was proposed for management and
operation of large scale H2-fermenting systems. The relevant control
strategies can be activated by this method. BP based ANNs modeling
results was very successful and an excellent match was obtained
between the measured and the predicted rates. The efficient H2
production and system control can be provided by predictive control
method combined with the robust BP based ANN modeling tool.
Abstract: In the present paper, we propose numerical methods for solving the Stein equation AXC - X - D = 0 where the matrix A is large and sparse. Such problems appear in discrete-time control problems, filtering and image restoration. We consider the case where the matrix D is of full rank and the case where D is factored as a product of two matrices. The proposed methods are Krylov subspace methods based on the block Arnoldi algorithm. We give theoretical results and we report some numerical experiments.
Abstract: Scheduling algorithms are used in operating systems
to optimize the usage of processors. One of the most efficient
algorithms for scheduling is Multi-Layer Feedback Queue (MLFQ)
algorithm which uses several queues with different quanta. The most
important weakness of this method is the inability to define the
optimized the number of the queues and quantum of each queue. This
weakness has been improved in IMLFQ scheduling algorithm.
Number of the queues and quantum of each queue affect the response
time directly. In this paper, we review the IMLFQ algorithm for
solving these problems and minimizing the response time. In this
algorithm Recurrent Neural Network has been utilized to find both
the number of queues and the optimized quantum of each queue.
Also in order to prevent any probable faults in processes' response
time computation, a new fault tolerant approach has been presented.
In this approach we use combinational software redundancy to
prevent the any probable faults. The experimental results show that
using the IMLFQ algorithm results in better response time in
comparison with other scheduling algorithms also by using fault
tolerant mechanism we improve IMLFQ performance.
Abstract: A stiffened laminated composite panel (1 m length ×
0.5m width) was optimized for minimum weight and deflection under
several constraints using genetic algorithm. Here, a significant study
on the performance of a penalty function with two kinds of static and
dynamic penalty factors was conducted. The results have shown that
linear dynamic penalty factors are more effective than the static ones.
Also, a specially combined linear-exponential function has shown to
perform more effective than the previously mentioned penalty
functions. This was then resulted in the less sensitivity of the GA to
the amount of penalty factor.
Abstract: This paper describes the implementation and testing
of a multichannel active noise control system (ANCS) based on the
filtered-inverse LMS (FILMS) algorithm. The FILMS algorithm is
derived from the well-known filtered-x LMS (FXLMS) algorithm
with the aim to improve the rate of convergence of the multichannel
FXLMS algorithm and to reduce its computational load. Laboratory
setup and techniques used to implement this system efficiently are
described in this paper. Experiments performed in order to test the
performance of the FILMS algorithm are discussed and the obtained
results presented.
Abstract: This paper presents a novel template-based method to
detect objects of interest from real images by shape matching. To
locate a target object that has a similar shape to a given template
boundary, the proposed method integrates three components: contour
grouping, partial shape matching, and boundary verification. In the
first component, low-level image features, including edges and
corners, are grouped into a set of perceptually salient closed contours
using an extended ratio-contour algorithm. In the second component,
we develop a partial shape matching algorithm to identify the
fractions of detected contours that partly match given template
boundaries. Specifically, we represent template boundaries and
detected contours using landmarks, and apply a greedy algorithm to
search the matched landmark subsequences. For each matched
fraction between a template and a detected contour, we estimate an
affine transform that transforms the whole template into a hypothetic
boundary. In the third component, we provide an efficient algorithm
based on oriented edge lists to determine the target boundary from
the hypothetic boundaries by checking each of them against image
edges. We evaluate the proposed method on recognizing and
localizing 12 template leaves in a data set of real images with clutter
back-grounds, illumination variations, occlusions, and image noises.
The experiments demonstrate the high performance of our proposed
method1.