Abstract: A considerable progress has been achieved in transient
stability analysis (TSA) with various FACTS controllers. But, all
these controllers are associated with single transmission line. This
paper is intended to discuss a new approach i.e. a multi-line FACTS
controller which is interline power flow controller (IPFC) for TSA of
a multi-machine power system network. A mathematical model of
IPFC, termed as power injection model (PIM) presented and this
model is incorporated in Newton-Raphson (NR) power flow
algorithm. Then, the reduced admittance matrix of a multi-machine
power system network for a three phase fault without and with IPFC
is obtained which is required to draw the machine swing curves. A
general approach based on L-index has also been discussed to find
the best location of IPFC to reduce the proximity to instability of a
power system. Numerical results are carried out on two test systems
namely, 6-bus and 11-bus systems. A program in MATLAB has
been written to plot the variation of generator rotor angle and speed
difference curves without and with IPFC for TSA and also a simple
approach has been presented to evaluate critical clearing time for test
systems. The results obtained without and with IPFC are compared
and discussed.
Abstract: In this paper, we present an algorithm for computing a
Schur factorization of a real nonsymmetric matrix with ordered diagonal
blocks such that upper left blocks contains the largest magnitude
eigenvalues. Especially in case of multiple eigenvalues, when matrix
is non diagonalizable, we construct an invariant subspaces with few
additional tricks which are heuristic and numerical results shows the
stability and accuracy of the algorithm.
Abstract: This paper presents the theoretical background and
the real implementation of an automated computer system to
introduce machine vision in flower, fruit and vegetable processing
for recollection, cutting, packaging, classification, or fumigation
tasks. The considerations and implementation issues presented in this
work can be applied to a wide range of varieties of flowers, fruits and
vegetables, although some of them are especially relevant due to the
great amount of units that are manipulated and processed each year
over the world. The computer vision algorithms developed in this
work are shown in detail, and can be easily extended to other
applications. A special attention is given to the electromagnetic
compatibility in order to avoid noisy images. Furthermore, real
experimentation has been carried out in order to validate the
developed application. In particular, the tests show that the method
has good robustness and high success percentage in the object
characterization.
Abstract: This paper proposes an auto-classification algorithm
of Web pages using Data mining techniques. We consider the
problem of discovering association rules between terms in a set of
Web pages belonging to a category in a search engine database, and
present an auto-classification algorithm for solving this problem that
are fundamentally based on Apriori algorithm. The proposed
technique has two phases. The first phase is a training phase where
human experts determines the categories of different Web pages, and
the supervised Data mining algorithm will combine these categories
with appropriate weighted index terms according to the highest
supported rules among the most frequent words. The second phase is
the categorization phase where a web crawler will crawl through the
World Wide Web to build a database categorized according to the
result of the data mining approach. This database contains URLs and
their categories.
Abstract: QoS Routing aims to find paths between senders and
receivers satisfying the QoS requirements of the application which
efficiently using the network resources and underlying routing
algorithm to be able to find low-cost paths that satisfy given QoS
constraints. The problem of finding least-cost routing is known to be
NP-hard or complete and some algorithms have been proposed to
find a near optimal solution. But these heuristics or algorithms either
impose relationships among the link metrics to reduce the complexity
of the problem which may limit the general applicability of the
heuristic, or are too costly in terms of execution time to be applicable
to large networks. In this paper, we concentrate an algorithm that
finds a near-optimal solution fast and we named this algorithm as
optimized Delay Constrained Routing (ODCR), which uses an
adaptive path weight function together with an additional constraint
imposed on the path cost, to restrict search space and hence ODCR
finds near optimal solution in much quicker time.
Abstract: Skyline extraction in mountainous images can be used
for navigation of vehicles or UAV(unmanned air vehicles), but it is
very hard to extract skyline shape because of clutters like clouds, sea
lines and field borders in images. We developed the edge-based
skyline extraction algorithm using a proposed multistage edge filtering
(MEF) technique. In this method, characteristics of clutters in the
image are first defined and then the lines classified as clutters are
eliminated by stages using the proposed MEF technique. After this
processing, we select the last line using skyline measures among the
remained lines. This proposed algorithm is robust under severe
environments with clutters and has even good performance for
infrared sensor images with a low resolution. We tested this proposed
algorithm for images obtained in the field by an infrared camera and
confirmed that the proposed algorithm produced a better performance
and faster processing time than conventional algorithms.
Abstract: This paper sets forth the possibility and importance about applying Data Mining in Web logs mining and shows some problems in the conventional searching engines. Then it offers an improved algorithm based on the original AprioriAll algorithm which has been used in Web logs mining widely. The new algorithm adds the property of the User ID during the every step of producing the candidate set and every step of scanning the database by which to decide whether an item in the candidate set should be put into the large set which will be used to produce next candidate set. At the meantime, in order to reduce the number of the database scanning, the new algorithm, by using the property of the Apriori algorithm, limits the size of the candidate set in time whenever it is produced. Test results show the improved algorithm has a more lower complexity of time and space, better restrain noise and fit the capacity of memory.
Abstract: The brain MR imaging-based clinical research and analysis system were specifically built and the development for a large-scale data was targeted. We used the general clinical data available for building large-scale data. Registration period for the selection of the lesion ROI and the region growing algorithm was used and the Mesh-warp algorithm for matching was implemented. The accuracy of the matching errors was modified individually. Also, the large ROI research data can accumulate by our developed compression method. In this way, the correctly decision criteria to the research result was suggested. The experimental groups were age, sex, MR type, patient ID and smoking which can easily be queries. The result data was visualized of the overlapped images by a color table. Its data was calculated by the statistical package. The evaluation for the utilization of this system in the chronic ischemic damage in the area has done from patients with the acute cerebral infarction. This is the cause of neurologic disability index location in the center portion of the lateral ventricle facing. The corona radiate was found in the position. Finally, the system reliability was measured both inter-user and intra-user registering correlation.
Abstract: The evolutionary design of electronic circuits, or
evolvable hardware, is a discipline that allows the user to
automatically obtain the desired circuit design. The circuit
configuration is under the control of evolutionary algorithms. Several
researchers have used evolvable hardware to design electrical
circuits. Every time that one particular algorithm is selected to carry
out the evolution, it is necessary that all its parameters, such as
mutation rate, population size, selection mechanisms etc. are tuned in
order to achieve the best results during the evolution process. This
paper investigates the abilities of evolution strategy to evolve digital
logic circuits based on programmable logic array structures when
different mutation rates are used. Several mutation rates (fixed and
variable) are analyzed and compared with each other to outline the
most appropriate choice to be used during the evolution of
combinational logic circuits. The experimental results outlined in this
paper are important as they could be used by every researcher who
might need to use the evolutionary algorithm to design digital logic
circuits.
Abstract: This paper presents an adaptive differentiator
of sequential data based on the adaptive control theory. The
algorithm is applied to detect moving objects by estimating a
temporal gradient of sequential data at a specified pixel. We
adopt two nonlinear intensity functions to reduce the influence
of noises. The derivatives of the nonlinear intensity functions
are estimated by an adaptive observer with σ-modification
update law.
Abstract: Various intelligences and inspirations have been
adopted into the iterative searching process called as meta-heuristics.
They intelligently perform the exploration and exploitation in the
solution domain space aiming to efficiently seek near optimal
solutions. In this work, the bee algorithm, inspired by the natural
foraging behaviour of honey bees, was adapted to find the near
optimal solutions of the transportation management system, dynamic
multi-zone dispatching. This problem prepares for an uncertainty and
changing customers- demand. In striving to remain competitive,
transportation system should therefore be flexible in order to cope
with the changes of customers- demand in terms of in-bound and outbound
goods and technological innovations. To remain higher service
level but lower cost management via the minimal imbalance scenario,
the rearrangement penalty of the area, in each zone, including time
periods are also included. However, the performance of the algorithm
depends on the appropriate parameters- setting and need to be
determined and analysed before its implementation. BEE parameters
are determined through the linear constrained response surface
optimisation or LCRSOM and weighted centroid modified simplex
methods or WCMSM. Experimental results were analysed in terms
of best solutions found so far, mean and standard deviation on the
imbalance values including the convergence of the solutions
obtained. It was found that the results obtained from the LCRSOM
were better than those using the WCMSM. However, the average
execution time of experimental run using the LCRSOM was longer
than those using the WCMSM. Finally a recommendation of proper
level settings of BEE parameters for some selected problem sizes is
given as a guideline for future applications.
Abstract: Multiplication algorithms have considerable effect on
processors performance. A new high-speed, low-power
multiplication algorithm has been presented using modified Dadda
tree structure. Three important modifications have been implemented
in inner product generation step, inner product reduction step and
final addition step. Optimized algorithms have to be used into basic
computation components, such as multiplication algorithms. In this
paper, we proposed a new algorithm to reduce power, delay, and
transistor count of a multiplication algorithm implemented using low
power modified counter. This work presents a novel design for
Dadda multiplication algorithms. The proposed multiplication
algorithm includes structured parts, which have important effect on
inner product reduction tree. In this paper, a 1.3V, 64-bit carry hybrid
adder is presented for fast, low voltage applications. The new 64-bit
adder uses a new circuit to implement the proposed carry hybrid
adder. The new adder using 80 nm CMOS technology has been
implemented on 700 MHz clock frequency. The proposed
multiplication algorithm has achieved 14 percent improvement in
transistor count, 13 percent reduction in delay and 12 percent
modification in power consumption in compared with conventional
designs.
Abstract: A novel three-phase active power filter (APF) circuit with photovoltaic (PV) system to improve the quality of service and to reduce the capacity of energy storage capacitor is presented. The energy balance concept and sampling technique were used to simplify the calculation algorithm for the required utility source current and to control the voltage of the energy storage capacitor. The feasibility was verified by using the Pspice simulations and experiments. When the APF mode was used during non-operational period, not only the utilization rate, power factor and power quality could be improved, but also the capacity of energy storage capacitor could sparing. As the results, the advantages of the APF circuit are simplicity of control circuits, low cost, and good transient response.
Abstract: In this paper, we propose a selective mutation method
for improving the performances of genetic algorithms. In selective
mutation, individuals are first ranked and then additionally mutated
one bit in a part of their strings which is selected corresponding to
their ranks. This selective mutation helps genetic algorithms to fast
approach the global optimum and to quickly escape local optima.
This results in increasing the performances of genetic algorithms.
We measured the effects of selective mutation with four function
optimization problems. It was found from extensive experiments that
the selective mutation can significantly enhance the performances of
genetic algorithms.
Abstract: This paper presents a speed sensorless direct torque
control scheme using space vector modulation (DTC-SVM) for
permanent magnet synchronous motor (PMSM) drive based a Model
Reference Adaptive System (MRAS) algorithm and stator resistance
estimator. The MRAS is utilized to estimate speed and stator
resistance and compensate the effects of parameter variation on stator
resistance, which makes flux and torque estimation more accurate
and insensitive to parameter variation. In other hand the use of SVM
method reduces the torque ripple while achieving a good dynamic
response. Simulation results are presented and show the effectiveness
of the proposed method.
Abstract: The Ant Colony Optimization (ACO) is a metaheuristic inspired by the behavior of real ants in their search for the shortest paths to food sources. It has recently attracted a lot of attention and has been successfully applied to a number of different optimization problems. Due to the importance of the feature selection problem and the potential of ACO, this paper presents a novel method that utilizes the ACO algorithm to implement a feature subset search procedure. Initial results obtained using the classification of speech segments are very promising.
Abstract: Information on weed distribution within the field is
necessary to implement spatially variable herbicide application.
Since hand labor is costly, an automated weed control system could be
feasible. This paper deals with the development of an algorithm for
real time specific weed recognition system based on Histogram
Analysis of an image that is used for the weed classification. This
algorithm is specifically developed to classify images into broad and
narrow class for real-time selective herbicide application. The
developed system has been tested on weeds in the lab, which have
shown that the system to be very effectiveness in weed identification.
Further the results show a very reliable performance on images of
weeds taken under varying field conditions. The analysis of the results
shows over 95 percent classification accuracy over 140 sample images
(broad and narrow) with 70 samples from each category of weeds.
Abstract: One of the methods for detecting the target position
error in the laser tracking systems is using Four Quadrant (4Q)
detectors. If the coordinates of the target center is yielded through the
usual relations of the detector outputs, the results will be nonlinear,
dependent on the shape, target size and its position on the detector
screen. In this paper we have designed an algorithm with using
neural network that coordinates of the target center in laser tracking
systems is calculated by using detector outputs obtained from visual
modeling. With this method, the results except from the part related
to the detector intrinsic limitation, are linear and dependent from the
shape and target size.
Abstract: In this paper, a field oriented control (FOC) induction motor drive is presented. In order to eliminate the speed sensor, an adaptation algorithm for tuning the rotor speed is proposed. Based on the Model Reference Adaptive System (MRAS) scheme, the rotor speed is tuned to obtain an exact FOC induction motor drive. The reference and adjustable models, developed in stationary stator reference frame, are used in the MRAS scheme to estimate induction rotor speed from measured terminal voltages and currents. The Integral Proportional (IP) gains speed controller are tuned by a modern approach that is the Particle Swarm Optimization (PSO) algorithm in order to optimize the parameters of the IP controller. The use of PSO as an optimization algorithm makes the drive robust, with faster dynamic response, higher accuracy and insensitive to load variation. The proposed algorithm has been tested by numerical simulation, showing the capability of driving load.
Abstract: An algorithm for learning an overcomplete dictionary
using a Cauchy mixture model for sparse decomposition of an underdetermined
mixing system is introduced. The mixture density
function is derived from a ratio sample of the observed mixture
signals where 1) there are at least two but not necessarily more
mixture signals observed, 2) the source signals are statistically
independent and 3) the sources are sparse. The basis vectors of the
dictionary are learned via the optimization of the location parameters
of the Cauchy mixture components, which is shown to be more
accurate and robust than the conventional data mining methods
usually employed for this task. Using a well known sparse
decomposition algorithm, we extract three speech signals from two
mixtures based on the estimated dictionary. Further tests with
additive Gaussian noise are used to demonstrate the proposed
algorithm-s robustness to outliers.