Abstract: Economic dispatch (ED) has been considered to be one of the key functions in electric power system operation which can help to build up effective generating management plans. The practical ED problem has non-smooth cost function with nonlinear constraints which make it difficult to be effectively solved. This paper presents a novel heuristic and efficient optimization approach based on the new Bat algorithm (BA) to solve the practical non-smooth economic dispatch problem. The proposed algorithm easily takes care of different constraints. In addition, two newly introduced modifications method is developed to improve the variety of the bat population when increasing the convergence speed simultaneously. The simulation results obtained by the proposed algorithms are compared with the results obtained using other recently develop methods available in the literature.
Abstract: In this paper we propose a mixture of two different
distributions such as Exponential-Gamma, Exponential-Weibull and
Gamma-Weibull to model heterogeneous survival data. Various
properties of the proposed mixture of two different distributions are
discussed. Maximum likelihood estimations of the parameters are
obtained by using the EM algorithm. Illustrative example based on
real data are also given.
Abstract: We study in this paper the effect of the scene
changing on image sequences coding system using Embedded
Zerotree Wavelet (EZW). The scene changing considered here is the
full motion which may occurs. A special image sequence is generated
where the scene changing occurs randomly. Two scenarios are
considered: In the first scenario, the system must provide the
reconstruction quality as best as possible by the management of the
bit rate (BR) while the scene changing occurs. In the second scenario,
the system must keep the bit rate as constant as possible by the
management of the reconstruction quality. The first scenario may be
motivated by the availability of a large band pass transmission
channel where an increase of the bit rate may be possible to keep the
reconstruction quality up to a given threshold. The second scenario
may be concerned by the narrow band pass transmission channel
where an increase of the bit rate is not possible. In this last case,
applications for which the reconstruction quality is not a constraint
may be considered. The simulations are performed with five scales
wavelet decomposition using the 9/7-tap filter bank biorthogonal
wavelet. The entropy coding is performed using a specific defined
binary code book and EZW algorithm. Experimental results are
presented and compared to LEAD H263 EVAL. It is shown that if
the reconstruction quality is the constraint, the system increases the
bit rate to obtain the required quality. In the case where the bit rate
must be constant, the system is unable to provide the required quality
if the scene change occurs; however, the system is able to improve
the quality while the scene changing disappears.
Abstract: Network reconfiguration in distribution system is realized by changing the status of sectionalizing switches to reduce the power loss in the system. This paper presents a new method which applies an artificial bee colony algorithm (ABC) for determining the sectionalizing switch to be operated in order to solve the distribution system loss minimization problem. The ABC algorithm is a new population based metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm. The advantage of ABC algorithm is that it does not require external parameters such as cross over rate and mutation rate as in case of genetic algorithm and differential evolution and it is hard to determine these parameters in prior. The other advantage is that the global search ability in the algorithm is implemented by introducing neighborhood source production mechanism which is a similar to mutation process. To demonstrate the validity of the proposed algorithm, computer simulations are carried out on 14, 33, and 119-bus systems and compared with different approaches available in the literature. The proposed method has outperformed the other methods in terms of the quality of solution and computational efficiency.
Abstract: EDF (Early Deadline First) algorithm is a very important scheduling algorithm for real- time systems . The EDF algorithm assigns priorities to each job according to their absolute deadlines and has good performance when the real-time system is not overloaded. When the real-time system is overloaded, many misdeadlines will be produced. But these misdeadlines are not uniformly distributed, which usually focus on some tasks. In this paper, we present an adaptive fuzzy control scheduling based on EDF algorithm. The improved algorithm can have a rectangular distribution of misdeadline ratios among all real-time tasks when the system is overloaded. To evaluate the effectiveness of the improved algorithm, we have done extensive simulation studies. The simulation results show that the new algorithm is superior to the old algorithm.
Abstract: In the recent past Learning Classifier Systems have
been successfully used for data mining. Learning Classifier System
(LCS) is basically a machine learning technique which combines
evolutionary computing, reinforcement learning, supervised or
unsupervised learning and heuristics to produce adaptive systems. A
LCS learns by interacting with an environment from which it
receives feedback in the form of numerical reward. Learning is
achieved by trying to maximize the amount of reward received. All
LCSs models more or less, comprise four main components; a finite
population of condition–action rules, called classifiers; the
performance component, which governs the interaction with the
environment; the credit assignment component, which distributes the
reward received from the environment to the classifiers accountable
for the rewards obtained; the discovery component, which is
responsible for discovering better rules and improving existing ones
through a genetic algorithm. The concatenate of the production rules
in the LCS form the genotype, and therefore the GA should operate
on a population of classifier systems. This approach is known as the
'Pittsburgh' Classifier Systems. Other LCS that perform their GA at
the rule level within a population are known as 'Mitchigan' Classifier
Systems. The most predominant representation of the discovered
knowledge is the standard production rules (PRs) in the form of IF P
THEN D. The PRs, however, are unable to handle exceptions and do
not exhibit variable precision. The Censored Production Rules
(CPRs), an extension of PRs, were proposed by Michalski and
Winston that exhibit variable precision and supports an efficient
mechanism for handling exceptions. A CPR is an augmented
production rule of the form: IF P THEN D UNLESS C, where
Censor C is an exception to the rule. Such rules are employed in
situations, in which conditional statement IF P THEN D holds
frequently and the assertion C holds rarely. By using a rule of this
type we are free to ignore the exception conditions, when the
resources needed to establish its presence are tight or there is simply
no information available as to whether it holds or not. Thus, the IF P
THEN D part of CPR expresses important information, while the
UNLESS C part acts only as a switch and changes the polarity of D
to ~D. In this paper Pittsburgh style LCSs approach is used for
automated discovery of CPRs. An appropriate encoding scheme is
suggested to represent a chromosome consisting of fixed size set of
CPRs. Suitable genetic operators are designed for the set of CPRs
and individual CPRs and also appropriate fitness function is proposed
that incorporates basic constraints on CPR. Experimental results are
presented to demonstrate the performance of the proposed learning
classifier system.
Abstract: In this paper, two very different optimization
algorithms, Genetic and DIRECT algorithms, are used to history
match a bottomhole pressure response for a reservoir with wellbore
storage and skin with the best possible analytical model. No initial
guesses are available for reservoir parameters. The results show that
the matching process is much faster and more accurate for DIRECT
method in comparison with Genetic algorithm. It is furthermore
concluded that the DIRECT algorithm does not need any initial
guesses, whereas Genetic algorithm needs to be tuned according to
initial guesses.
Abstract: Recently, neural networks have shown good
results for detection of a certain pattern in a given image. In
our previous papers [1-5], a fast algorithm for pattern
detection using neural networks was presented. Such
algorithm was designed based on cross correlation in the
frequency domain between the input image and the weights
of neural networks. Image conversion into symmetric shape
was established so that fast neural networks can give the
same results as conventional neural networks. Another
configuration of symmetry was suggested in [3,4] to improve
the speed up ratio. In this paper, our previous algorithm for
fast neural networks is developed. The frequency domain
cross correlation is modified in order to compensate for the
symmetric condition which is required by the input image.
Two new ideas are introduced to modify the cross correlation
algorithm. Both methods accelerate the speed of the fast
neural networks as there is no need for converting the input
image into symmetric one as previous. Theoretical and
practical results show that both approaches provide faster
speed up ratio than the previous algorithm.
Abstract: The electromagnetic imaging of inhomogeneous
dielectric cylinders buried in a slab medium by transverse electric
(TE) wave illumination is investigated. Dielectric cylinders of
unknown permittivities are buried in second space and scattered a
group of unrelated waves incident from first space where the scattered
field is recorded. By proper arrangement of the various unrelated
incident fields, the difficulties of ill-posedness and nonlinearity are
circumvented, and the permittivity distribution can be reconstructed
through simple matrix operations. The algorithm is based on the
moment method and the unrelated illumination method. Numerical
results are given to demonstrate the capability of the inverse
algorithm. Good reconstruction is obtained even in the presence of
additive Gaussian random noise in measured data. In addition, the
effect of noise on the reconstruction result is also investigated.
Abstract: This paper presents a method for the optimal
allocation of Distributed generation in distribution systems. In this
paper, our aim would be optimal distributed generation allocation for
voltage profile improvement and loss reduction in distribution
network. Genetic Algorithm (GA) was used as the solving tool,
which referring two determined aim; the problem is defined and
objective function is introduced. Considering to fitness values
sensitivity in genetic algorithm process, there is needed to apply load
flow for decision-making. Load flow algorithm is combined
appropriately with GA, till access to acceptable results of this
operation. We used MATPOWER package for load flow algorithm
and composed it with our Genetic Algorithm. The suggested method
is programmed under MATLAB software and applied ETAP
software for evaluating of results correctness. It was implemented on
part of Tehran electricity distributing grid. The resulting operation of
this method on some testing system is illuminated improvement of
voltage profile and loss reduction indexes.
Abstract: In this work, we are interested in developing a speech denoising tool by using a discrete wavelet packet transform (DWPT). This speech denoising tool will be employed for applications of recognition, coding and synthesis. For noise reduction, instead of applying the classical thresholding technique, some wavelet packet nodes are set to zero and the others are thresholded. To estimate the non stationary noise level, we employ the spectral entropy. A comparison of our proposed technique to classical denoising methods based on thresholding and spectral subtraction is made in order to evaluate our approach. The experimental implementation uses speech signals corrupted by two sorts of noise, white and Volvo noises. The obtained results from listening tests show that our proposed technique is better than spectral subtraction. The obtained results from SNR computation show the superiority of our technique when compared to the classical thresholding method using the modified hard thresholding function based on u-law algorithm.
Abstract: Optical network uses a tool for routing which is called
Latin router. These routers use particular algorithms for routing. In this paper, we present algorithm for configuration of optical network that is optimized regarding previous algorithm. We show that by decreasing the number of hops for source-destination in lightpath number of satisfied request is less. Also we had shown that more than
single-hop lightpath relating single-hop lightpath is better.
Abstract: This paper presents a text clustering system developed based on a k-means type subspace clustering algorithm to cluster large, high dimensional and sparse text data. In this algorithm, a new step is added in the k-means clustering process to automatically calculate the weights of keywords in each cluster so that the important words of a cluster can be identified by the weight values. For understanding and interpretation of clustering results, a few keywords that can best represent the semantic topic are extracted from each cluster. Two methods are used to extract the representative words. The candidate words are first selected according to their weights calculated by our new algorithm. Then, the candidates are fed to the WordNet to identify the set of noun words and consolidate the synonymy and hyponymy words. Experimental results have shown that the clustering algorithm is superior to the other subspace clustering algorithms, such as PROCLUS and HARP and kmeans type algorithm, e.g., Bisecting-KMeans. Furthermore, the word extraction method is effective in selection of the words to represent the topics of the clusters.
Abstract: A new approach for the improvement of coding gain
in channel coding using Advanced Encryption Standard (AES) and
Maximum A Posteriori (MAP) algorithm is proposed. This new
approach uses the avalanche effect of block cipher algorithm AES
and soft output values of MAP decoding algorithm. The performance
of proposed approach is evaluated in the presence of Additive White
Gaussian Noise (AWGN). For the verification of proposed approach,
computer simulation results are included.
Abstract: Hexapod Machine Tool (HMT) is a parallel robot
mostly based on Stewart platform. Identification of kinematic
parameters of HMT is an important step of calibration procedure. In
this paper an algorithm is presented for identifying the kinematic
parameters of HMT using inverse kinematics error model. Based on
this algorithm, the calibration procedure is simulated. Measurement
configurations with maximum observability are decided as the first
step of this algorithm for a robust calibration. The errors occurring in
various configurations are illustrated graphically. It has been shown
that the boundaries of the workspace should be searched for the
maximum observability of errors. The importance of using
configurations with sufficient observability in calibrating hexapod
machine tools is verified by trial calibration with two different
groups of randomly selected configurations. One group is selected to
have sufficient observability and the other is in disregard of the
observability criterion. Simulation results confirm the validity of the
proposed identification algorithm.
Abstract: The new idea of this research is application of a new fault detection and isolation (FDI) technique for supervision of sensor networks in transportation system. In measurement systems, it is necessary to detect all types of faults and failures, based on predefined algorithm. Last improvements in artificial neural network studies (ANN) led to using them for some FDI purposes. In this paper, application of new probabilistic neural network features for data approximation and data classification are considered for plausibility check in temperature measurement. For this purpose, two-phase FDI mechanism was considered for residual generation and evaluation.
Abstract: One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we present a Fishnet Based Dispatch Scheme (FiBDS) with energy aware mobility and interest based sensing angle. We propose two algorithms, one is FiBDS centralized algorithm and another is FiBDS distributed algorithm. The centralized algorithm is designed specifically for the non-time critical applications, commonly known as non real-time applications while the distributed algorithm is designed specifically for the time critical applications, commonly known as real-time applications. The proposed dispatch scheme works in a phase-selection manner. In this in each phase a specific constraint is dealt with according to the specified priority and then moved onto the next phase and at the end of each only the best suited nodes for the phase are chosen. Simulation results are presented to verify their effectiveness.
Abstract: Synchronization is a difficult problem in CDMA
satellite communications. Due to the influence of additive noise and
fading in the mobile channel, it is not easy to keep up with the
attenuation and offset. This paper considers a recently proposed
approach to solve the problem of synchronization chaotic Chen
system in CDMA satellite communication in the presence of constant
attenuation and offset. An analytic algorithm that provides closed
form channel and carrier offset estimates is presented. The principle
of this approach is based on adding a compensation block before the
receiver to compensate the distortion of the imperfect channel by
using genetic algorithm.
The resultants presented, show that the receiver is able to recover
rapidly the synchronization with the transmitter.
Abstract: In this paper, we were introduces a skin detection
method using a histogram approximation based on the mean shift
algorithm. The proposed method applies the mean shift procedure to a
histogram of a skin map of the input image, generated by comparison
with standard skin colors in the CbCr color space, and divides the
background from the skin region by selecting the maximum value
according to brightness level. The proposed method detects the skin
region using the mean shift procedure to determine a maximum value
that becomes the dividing point, rather than using a manually selected
threshold value, as in existing techniques. Even when skin color is
contaminated by illumination, the procedure can accurately segment
the skin region and the background region. The proposed method may
be useful in detecting facial regions as a pretreatment for face
recognition in various types of illumination.
Abstract: As the development of digital technology is increasing,
Digital cinema is getting more spread.
However, content copy and attack against the digital cinema becomes
a serious problem. To solve the above security problem, we propose
“Additional Watermarking" for digital cinema delivery system. With
this proposed “Additional watermarking" method, we protect content
copyrights at encoder and user side information at decoder. It realizes
the traceability of the watermark embedded at encoder.
The watermark is embedded into the random-selected frames using
Hash function. Using it, the embedding position is distributed by Hash
Function so that third parties do not break off the watermarking
algorithm.
Finally, our experimental results show that proposed method is much
better than the convenient watermarking techniques in terms of
robustness, image quality and its simple but unbreakable algorithm.