Abstract: In power systems, protective relays must filter their
inputs to remove undesirable quantities and retain signal quantities of
interest. This job must be performed accurate and fast. A new
method for filtering the undesirable components such as DC and
harmonic components associated with the fundamental system
signals. The method is s based on a dynamic filtering algorithm. The
filtering algorithm has many advantages over some other classical
methods. It can be used as dynamic on-line filter without the need of
parameters readjusting as in the case of classic filters. The proposed
filter is tested using different signals. Effects of number of samples
and sampling window size are discussed. Results obtained are
presented and discussed to show the algorithm capabilities.
Abstract: In this paper, a fractional-order FIR differentiator
design method using the differential evolution (DE) algorithm is
presented. In the proposed method, the FIR digital filter is designed to
meet the frequency response of a desired fractal-order differentiator,
which is evaluated in the frequency domain. To verify the design
performance, another design method considered in the time-domain is
also provided. Simulation results reveal the efficiency of the proposed
method.
Abstract: In this paper we present a novel approach for wavelet compression of electrocardiogram (ECG) signals based on the set partitioning in hierarchical trees (SPIHT) coding algorithm. SPIHT algorithm has achieved prominent success in image compression. Here we use a modified version of SPIHT for one dimensional signals. We applied wavelet transform with SPIHT coding algorithm on different records of MIT-BIH database. The results show the high efficiency of this method in ECG compression.
Abstract: A new blind gray-level watermarking scheme is described. In the proposed method, the host image is first divided into 4*4 non-overlapping blocks. For each block, two first AC coefficients of its Hadamard transform are then estimated using DC coefficients of its neighbor blocks. A gray-level watermark is then added into estimated values. Since embedding watermark does not change the DC coefficients, watermark extracting could be done by estimating AC coefficients and comparing them with their actual values. Several experiments are made and results suggest the robustness of the proposed algorithm.
Abstract: When trying to enumerate all BIBD-s for given parameters,
their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore,
constructive enumerations are often carried out by assuming additional
constraints on design-s structure, automorphisms being mostly used ones. It remains a hard task to construct designs with trivial
automorphism group – those with no additional symmetry – although it is believed that most of the BIBD-s belong to that case. In
this paper, very many new designs with parameters 2-(13, 5, 5), 2-(16, 6, 5) and 2-(21, 6, 4) are constructed, assuming an action of an
automorphism of order 3. Even more, it was possible to construct millions of such designs with no non-trivial automorphisms.
Abstract: This paper focuses on reducing the power consumption
of wireless sensor networks. Therefore, a communication protocol
named LEACH (Low-Energy Adaptive Clustering Hierarchy) is modified.
We extend LEACHs stochastic cluster-head selection algorithm
by a modifying the probability of each node to become cluster-head
based on its required energy to transmit to the sink. We present
an efficient energy aware routing algorithm for the wireless sensor
networks. Our contribution consists in rotation selection of clusterheads
considering the remoteness of the nodes to the sink, and then,
the network nodes residual energy. This choice allows a best distribution
of the transmission energy in the network. The cluster-heads
selection algorithm is completely decentralized. Simulation results
show that the energy is significantly reduced compared with the
previous clustering based routing algorithm for the sensor networks.
Abstract: Renewable energy resources are inexhaustible, clean as compared with conventional resources. Also, it is used to supply regions with no grid, no telephone lines, and often with difficult accessibility by common transport. Satellite earth stations which located in remote areas are the most important application of renewable energy. Neural control is a branch of the general field of intelligent control, which is based on the concept of artificial intelligence. This paper presents the mathematical modeling of satellite earth station power system which is required for simulating the system.Aswan is selected to be the site under consideration because it is a rich region with solar energy. The complete power system is simulated using MATLAB–SIMULINK.An artificial neural network (ANN) based model has been developed for the optimum operation of earth station power system. An ANN is trained using a back propagation with Levenberg–Marquardt algorithm. The best validation performance is obtained for minimum mean square error. The regression between the network output and the corresponding target is equal to 96% which means a high accuracy. Neural network controller architecture gives satisfactory results with small number of neurons, hence better in terms of memory and time are required for NNC implementation. The results indicate that the proposed control unit using ANN can be successfully used for controlling the satellite earth station power system.
Abstract: The two cart inverted pendulum system is a good
bench mark for testing the performance of system dynamics and
control engineering principles. Devasia introduced this system to
study the asymptotic tracking problem for nonlinear systems. In this
paper the problem of asymptotic tracking of the two-cart with an
inverted-pendulum system to a sinusoidal reference inputs via
introducing a novel method for solving finite-horizon nonlinear
optimal control problems is presented. In this method, an iterative
method applied to state dependent Riccati equation (SDRE) to obtain
a reliable algorithm. The superiority of this technique has been shown
by simulation and comparison with the nonlinear approach.
Abstract: Tasks of an application program of an embedded system are managed by the scheduler of a real-time operating system
(RTOS). Most RTOSs adopt just fixed priority scheduling, which is not optimal in all cases. Some applications require earliest deadline
first (EDF) scheduling, which is an optimal scheduling algorithm.
In order to develop an efficient real-time embedded system, the
scheduling algorithm of the RTOS should be selectable. The paper presents a method to customize the scheduler using aspectoriented
programming. We define aspects to replace the fixed priority scheduling mechanism of an OSEK OS with an EDF scheduling
mechanism. By using the aspects, we can customize the scheduler
without modifying the original source code. We have applied the
aspects to an OSEK OS and get a customized operating system with
EDF scheduling. The evaluation results show that the overhead of
aspect-oriented programming is small enough.
Abstract: This study aims to segment objects using the K-means
algorithm for texture features. Firstly, the algorithm transforms color
images into gray images. This paper describes a novel technique for
the extraction of texture features in an image. Then, in a group of
similar features, objects and backgrounds are differentiated by using
the K-means algorithm. Finally, this paper proposes a new object
segmentation algorithm using the morphological technique. The
experiments described include the segmentation of single and multiple
objects featured in this paper. The region of an object can be
accurately segmented out. The results can help to perform image
retrieval and analyze features of an object, as are shown in this paper.
Abstract: In this research, we study a control method of a multivehicle
system while considering the limitation of communication
range for each vehicles. When we control networked vehicles with
limitation of communication range, it is important to control the
communication network structure of a multi-vehicle system in order
to keep the network-s connectivity. From this, we especially aim to
control the network structure to the target structure. We formulate
the networked multi-vehicle system with some disturbance and the
communication constraints as a hybrid dynamical system, and then
we study the optimal control problems of the system. It is shown
that the system converge to the objective network structure in finite
time when the system is controlled by the receding horizon method.
Additionally, the optimal control probrems are convertible into the
mixed integer problems and these problems are solvable by some
branch and bound algorithm.
Abstract: Water vapour transport properties of gypsum block
are studied in dependence on relative humidity using inverse analysis
based on genetic algorithm. The computational inverse analysis is
performed for the relative humidity profiles measured along the
longitudinal axis of a rod sample. Within the performed transient
experiment, the studied sample is exposed to two environments with
different relative humidity, whereas the temperature is kept constant.
For the basic gypsum characterisation and for the assessment of input
material parameters necessary for computational application of
genetic algorithm, the basic material properties of gypsum are
measured as well as its thermal and water vapour storage parameters.
On the basis of application of genetic algorithm, the relative
humidity dependent water vapour diffusion coefficient and water
vapour diffusion resistance factor are calculated.
Abstract: This paper presents an efficient emission constrained
economic dispatch algorithm that deals with nonlinear cost function
and constraints. It is then incorporated into the dynamic
programming based hydrothermal coordination program. The
program has been tested on a practical utility system having 32
thermal and 12 hydro generating units. Test results show that a slight
increase in production cost causes a substantial reduction in
emission.
Abstract: To minimize power losses, it is important to
determine the location and size of local generators to be placed in
unbalanced power distribution systems. On account of some inherent
features of unbalanced distribution systems, such as radial structure,
large number of nodes, a wide range of X/R ratios, the conventional
techniques developed for the transmission systems generally fail on
the determination of optimum size and location of distributed
generators (DGs). This paper presents a simple method for
investigating the problem of contemporaneously choosing best
location and size of DG in three-phase unbalanced radial distribution
system (URDS) for power loss minimization and to improve the
voltage profile of the system. Best location of the DG is determined
by using voltage index analysis and size of DG is computed by
variational technique algorithm according to available standard size
of DGs. This paper presents the results of simulations for 25-bus and
IEEE 37- bus Unbalanced Radial Distribution system.
Abstract: In this paper we use exponential particle swarm
optimization (EPSO) to cluster data. Then we compare between
(EPSO) clustering algorithm which depends on exponential variation
for the inertia weight and particle swarm optimization (PSO)
clustering algorithm which depends on linear inertia weight. This
comparison is evaluated on five data sets. The experimental results
show that EPSO clustering algorithm increases the possibility to find
the optimal positions as it decrease the number of failure. Also show
that (EPSO) clustering algorithm has a smaller quantization error
than (PSO) clustering algorithm, i.e. (EPSO) clustering algorithm
more accurate than (PSO) clustering algorithm.
Abstract: Much time series data is generally from continuous dynamic system. Firstly, this paper studies the detection of the nonlinearity of time series from continuous dynamics systems by applying the Phase-randomized surrogate algorithm. Then, the Delay Vector Variance (DVV) method is introduced into nonlinearity test. The results show that under the different sampling conditions, the opposite detection of nonlinearity is obtained via using traditional test statistics methods, which include the third-order autocovariance and the asymmetry due to time reversal. Whereas the DVV method can perform well on determining nonlinear of Lorenz signal. It indicates that the proposed method can describe the continuous dynamics signal effectively.
Abstract: Although backpropagation ANNs generally predict
better than decision trees do for pattern classification problems, they
are often regarded as black boxes, i.e., their predictions cannot be
explained as those of decision trees. In many applications, it is
desirable to extract knowledge from trained ANNs for the users to
gain a better understanding of how the networks solve the problems.
A new rule extraction algorithm, called rule extraction from artificial
neural networks (REANN) is proposed and implemented to extract
symbolic rules from ANNs. A standard three-layer feedforward ANN
is the basis of the algorithm. A four-phase training algorithm is
proposed for backpropagation learning. Explicitness of the extracted
rules is supported by comparing them to the symbolic rules generated
by other methods. Extracted rules are comparable with other methods
in terms of number of rules, average number of conditions for a rule,
and predictive accuracy. Extensive experimental studies on several
benchmarks classification problems, such as breast cancer, iris,
diabetes, and season classification problems, demonstrate the
effectiveness of the proposed approach with good generalization
ability.
Abstract: Due to the high percentage of induction motors in industrial market, there exist a large opportunity for energy savings. Replacement of working induction motors with more efficient ones can be an important resource for energy savings. A calculation of energy savings and payback periods, as a result of such a replacement, based on nameplate motor efficiency or manufacture-s data can lead to large errors [1]. Efficiency of induction motors (IMs) can be extracted using some procedures that use the no-load test results. In the cases that we must estimate the efficiency on-line, some of these procedures can-t be efficient. In some cases the efficiency estimates using the rating values of the motor, but these procedures can have errors due to the different working condition of the motor. In this paper the efficiency of an IM estimated by using the genetic algorithm. The results are compared with the measured values of the torque and power. The results show smaller errors for this procedure compared with the conventional classical procedures, hence the cost of the equipments is reduced and on-line estimation of the efficiency can be made.
Abstract: Power Spectral Density (PSD) of quasi-stationary processes can be efficiently estimated using the short time Fourier series (STFT). In this paper, an algorithm has been proposed that computes the PSD of quasi-stationary process efficiently using offline autoregressive model order estimation algorithm, recursive parameter estimation technique and modified sliding window discrete Fourier Transform algorithm. The main difference in this algorithm and STFT is that the sliding window (SW) and window for spectral estimation (WSA) are separately defined. WSA is updated and its PSD is computed only when change in statistics is detected in the SW. The computational complexity of the proposed algorithm is found to be lesser than that for standard STFT technique.
Abstract: Dorsal hand vein pattern is an emerging biometric which is attracting the attention of researchers, of late. Research is being carried out on existing techniques in the hope of improving them or finding more efficient ones. In this work, Principle Component Analysis (PCA) , which is a successful method, originally applied on face biometric is being modified using Cholesky decomposition and Lanczos algorithm to extract the dorsal hand vein features. This modified technique decreases the number of computation and hence decreases the processing time. The eigenveins were successfully computed and projected onto the vein space. The system was tested on a database of 200 images and using a threshold value of 0.9 to obtain the False Acceptance Rate (FAR) and False Rejection Rate (FRR). This modified algorithm is desirable when developing biometric security system since it significantly decreases the matching time.