Abstract: The continued interest in the use of distributed generation in recent years is leading to the growth in number of distributed generators connected to distribution networks. Steady state voltage rise resulting from the connection of these generators can be a major obstacle to their connection at lower voltage levels. The present electric distribution network is designed to keep the customer voltage within tolerance limit. This may require a reduction in connectable generation capacity, under utilization of appropriate generation sites. Thus distribution network operators need a proper voltage regulation method to allow the significant integration of distributed generation systems to existing network. In this work a voltage rise problem in a typical distribution system has been studied. A method for voltage regulation of distribution system with multiple DG system by coordinated operation distributed generator, capacitor and OLTC has been developed. A sensitivity based analysis has been carried out to determine the priority for individual generators in multiple DG environment. The effectiveness of the developed method has been evaluated under various cases through simulation results.
Abstract: In this paper we introduce the notion of protein interaction
network. This is a graph whose vertices are the protein-s
amino acids and whose edges are the interactions between them.
Using a graph theory approach, we identify a number of properties of
these networks. We compare them to the general small-world network
model and we analyze their hierarchical structure.
Abstract: This paper undertakes the problem of optimal
capacitor placement in a distribution system. The problem is how to
optimally determine the locations to install capacitors, the types and
sizes of capacitors to he installed and, during each load level,the
control settings of these capacitors in order that a desired objective
function is minimized while the load constraints,network constraints
and operational constraints (e.g. voltage profile) at different load
levels are satisfied. The problem is formulated as a combinatorial
optimization problem with a nondifferentiable objective function.
Four solution mythologies based on algorithms (GA),tabu search
(TS), and hybrid GA-SA algorithms are presented.The solution
methodologies are preceded by a sensitivity analysis to select the
candidate capacitor installation locations.
Abstract: This paper describes a method to improve the robustness of a face recognition system based on the combination of two compensating classifiers. The face images are preprocessed by the appearance-based statistical approaches such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA). LDA features of the face image are taken as the input of the Radial Basis Function Network (RBFN). The proposed approach has been tested on the ORL database. The experimental results show that the LDA+RBFN algorithm has achieved a recognition rate of 93.5%
Abstract: This paper addresses the problems encountered by conventional distance relays when protecting double-circuit transmission lines. The problems arise principally as a result of the mutual coupling between the two circuits under different fault conditions; this mutual coupling is highly nonlinear in nature. An adaptive protection scheme is proposed for such lines based on application of artificial neural network (ANN). ANN has the ability to classify the nonlinear relationship between measured signals by identifying different patterns of the associated signals. One of the key points of the present work is that only current signals measured at local end have been used to detect and classify the faults in the double circuit transmission line with double end infeed. The adaptive protection scheme is tested under a specific fault type, but varying fault location, fault resistance, fault inception angle and with remote end infeed. An improved performance is experienced once the neural network is trained adequately, which performs precisely when faced with different system parameters and conditions. The entire test results clearly show that the fault is detected and classified within a quarter cycle; thus the proposed adaptive protection technique is well suited for double circuit transmission line fault detection & classification. Results of performance studies show that the proposed neural network-based module can improve the performance of conventional fault selection algorithms.
Abstract: The C3 plants are frequently suffering from exposure
to high temperature stress which limits the growth and yield of these
plants. This study seeks to clarify the physiological mechanisms of
heat tolerance in relation to oxidative stress in C3 species. Fifteen C3
species were exposed to prolonged moderately high temperature
stress 36/30°C for 40 days in a growth chamber. Chlorophyll
fluorescence (Fv/Fm) showed great difference among species at 40
days of the stress. The species showed decreases in Fv/Fm and
increases in malondialdehyde (MDA) content under stress condition
as well as negative correlation between Fv/Fm and MDA (r = -0.61*)
at 40 days of the stress. Hydrogen peroxide (H2O2) content before
and after stress in addition to its response under stress showed great
differences among species. The results suggest that the difference in
heat tolerance among C3 species is closely associated with the ability
to suppress oxidative damage but not with the content of reactive
oxygen species (ROS) which is regulated by complex network.
Abstract: We present on the method of inverse coherence matrix for the estimation of network connectivity from multivariate time series of a complex system. In a model system of coupled chaotic oscillators, it is shown that the inverse coherence matrix defined as the inverse of cross coherence matrix is proportional to the network connectivity. Therefore the inverse coherence matrix could be used for the distinction between the directly connected links from indirectly connected links in a complex network. We compare the result of network estimation using the method of the inverse coherence matrix with the results obtained from the coherence matrix and the partial coherence matrix.
Abstract: In this paper a procedure for the split-pipe design of looped water distribution network based on the use of simulated annealing is proposed. Simulated annealing is a heuristic-based search algorithm, motivated by an analogy of physical annealing in solids. It is capable for solving the combinatorial optimization problem. In contrast to the split-pipe design that is derived from a continuous diameter design that has been implemented in conventional optimization techniques, the split-pipe design proposed in this paper is derived from a discrete diameter design where a set of pipe diameters is chosen directly from a specified set of commercial pipes. The optimality and feasibility of the solutions are found to be guaranteed by using the proposed method. The performance of the proposed procedure is demonstrated through solving the three well-known problems of water distribution network taken from the literature. Simulated annealing provides very promising solutions and the lowest-cost solutions are found for all of these test problems. The results obtained from these applications show that simulated annealing is able to handle a combinatorial optimization problem of the least cost design of water distribution network. The technique can be considered as an alternative tool for similar areas of research. Further applications and improvements of the technique are expected as well.
Abstract: Wind power is among the most actively developing distributed generation (DG) technology. Majority of the wind power based DG technologies employ wind turbine induction generators (WTIG) instead of synchronous generators, for the technical advantages like: reduced size, increased robustness, lower cost, and increased electromechanical damping. However, dynamic changes of wind speed make the amount of active/reactive power injected/drawn to a WTIG embedded distribution network highly variable. This paper analyzes the effect of wind speed changes on the active and reactive power penetration to the wind energy embedded distribution network. Four types of wind speed changes namely; constant, linear change, gust change and random change of wind speed are considered in the analysis. The study is carried out by three-phase, non-linear, dynamic simulation of distribution system component models. Results obtained from the investigation are presented and discussed.
Abstract: Previous studies mass evacuation route network does
not fully reflect the step-by-step behavior and evacuees make routing
decisions. Therefore, they do not work as expected when applied to the
evacuation route planning is valid. This article describes where
evacuees may have to make a direction to select all areas were
identified as guiding points to improve evacuation routes network.
This improved route network can be used as a basis for the layout can
be used to guide the signs indicate that provides the required
evacuation direction. This article also describes that combines
simulation and artificial bee colony algorithm to provide the proposed
routing solutions, to plan an integrated routing mode. The improved
network and the model used is the cinema as a case study to assess the
floor. The effectiveness of guidance solution in the total evacuation
time is significant by verification.
Abstract: A self tuning PID control strategy using reinforcement
learning is proposed in this paper to deal with the control of wind
energy conversion systems (WECS). Actor-Critic learning is used to
tune PID parameters in an adaptive way by taking advantage of the
model-free and on-line learning properties of reinforcement learning
effectively. In order to reduce the demand of storage space and to
improve the learning efficiency, a single RBF neural network is used
to approximate the policy function of Actor and the value function of
Critic simultaneously. The inputs of RBF network are the system
error, as well as the first and the second-order differences of error.
The Actor can realize the mapping from the system state to PID
parameters, while the Critic evaluates the outputs of the Actor and
produces TD error. Based on TD error performance index and
gradient descent method, the updating rules of RBF kernel function
and network weights were given. Simulation results show that the
proposed controller is efficient for WECS and it is perfectly
adaptable and strongly robust, which is better than that of a
conventional PID controller.
Abstract: In this paper, a Cooperative Multi-robot for Carrying
Targets (CMCT) algorithm is proposed. The multi-robot team
consists of three robots, one is a supervisor and the others are
workers for carrying boxes in a store of 100×100 m2. Each robot has
a self recharging mechanism. The CMCT minimizes robot-s worked
time for carrying many boxes during day by working in parallel. That
is, the supervisor detects the required variables in the same time
another robots work with previous variables. It works with
straightforward mechanical models by using simple cosine laws. It
detects the robot-s shortest path for reaching the target position
avoiding obstacles by using a proposed CMCT path planning
(CMCT-PP) algorithm. It prevents the collision between robots
during moving. The robots interact in an ad hoc wireless network.
Simulation results show that the proposed system that consists of
CMCT algorithm and its accomplished CMCT-PP algorithm
achieves a high improvement in time and distance while performing
the required tasks over the already existed algorithms.
Abstract: This work proposes a novel market-based air traffic flow control model considering competitive airlines in air traffic network. In the flow model, an agent based framework for resources (link/time pair) pricing is described. Resource agent and auctioneer for groups of resources are also introduced to simulate the flow management in Air Traffic Control (ATC). Secondly, the distributed group pricing algorithm is introduced, which efficiently reflect the competitive nature of the airline industry. Resources in the system are grouped according to the degree of interaction, and each auctioneer adjust s the price of one group of resources respectively until the excess demand of resources becomes zero when the demand and supply of resources of the system changes. Numerical simulation results show the feasibility of solving the air traffic flow control problem using market mechanism and pricing algorithms on the air traffic network.
Abstract: Power loss reduction is one of the main targets in power industry and so in this paper, the problem of finding the optimal configuration of a radial distribution system for loss reduction is considered. Optimal reconfiguration involves the selection of the best set of branches to be opened ,one each from each loop, for reducing resistive line losses , and reliving overloads on feeders by shifting the load to adjacent feeders. However ,since there are many candidate switching combinations in the system ,the feeder reconfiguration is a complicated problem. In this paper a new approach is proposed based on a simple optimum loss calculation by determining optimal trees of the given network. From graph theory a distribution network can be represented with a graph that consists a set of nodes and branches. In fact this problem can be viewed as a problem of determining an optimal tree of the graph which simultaneously ensure radial structure of each candidate topology .In this method the refined genetic algorithm is also set up and some improvements of algorithm are made on chromosome coding. In this paper an implementation of the algorithm presented by [7] is applied by modifying in load flow program and a comparison of this method with the proposed method is employed. In [7] an algorithm is proposed that the choice of the switches to be opened is based on simple heuristic rules. This algorithm reduce the number of load flow runs and also reduce the switching combinations to a fewer number and gives the optimum solution. To demonstrate the validity of these methods computer simulations with PSAT and MATLAB programs are carried out on 33-bus test system. The results show that the performance of the proposed method is better than [7] method and also other methods.
Abstract: Human identification at a distance has recently gained
growing interest from computer vision researchers. Gait recognition
aims essentially to address this problem by identifying people based
on the way they walk [1]. Gait recognition has 3 steps. The first step
is preprocessing, the second step is feature extraction and the third
one is classification. This paper focuses on the classification step that
is essential to increase the CCR (Correct Classification Rate).
Multilayer Perceptron (MLP) is used in this work. Neural Networks
imitate the human brain to perform intelligent tasks [3].They can
represent complicated relationships between input and output and
acquire knowledge about these relationships directly from the data
[2]. In this paper we apply MLP NN for 11 views in our database and
compare the CCR values for these views. Experiments are performed
with the NLPR databases, and the effectiveness of the proposed
method for gait recognition is demonstrated.
Abstract: A traffic light gives security from traffic congestion,reducing the traffic jam, and organizing the traffic flow. Furthermore,increasing congestion level in public road networks is a growingproblem in many countries. Using Intelligent Transportation Systemsto provide emergency vehicles a green light at intersections canreduce driver confusion, reduce conflicts, and improve emergencyresponse times. Nowadays, the technology of wireless sensornetworks can solve many problems and can offer a good managementof the crossroad. In this paper, we develop a new approach based onthe technique of clustering and the graphical possibilistic fusionmodeling. So, the proposed model is elaborated in three phases. Thefirst one consists to decompose the environment into clusters,following by the fusion intra and inter clusters processes. Finally, wewill show some experimental results by simulation that proves theefficiency of our proposed approach.KeywordsTraffic light, Wireless sensor network, Controller,Possibilistic network/Bayesain network.
Abstract: IETF defines mobility support in IPv6, i.e. MIPv6, to
allow nodes to remain reachable while moving around in the IPv6
internet. When a node moves and visits a foreign network, it is still
reachable through the indirect packet forwarding from its home
network. This triangular routing feature provides node mobility but
increases the communication latency between nodes. This deficiency
can be overcome by using a Binding Update (BU) scheme, which let
nodes keep up-to-date IP addresses and communicate with each other
through direct IP routing. To further protect the security of BU, a
Return Routability (RR) procedure was developed. However, it has
been found that RR procedure is vulnerable to many attacks. In this
paper, we will propose a lightweight RR procedure based on
geometric computing. In consideration of the inherent limitation of
computing resources in mobile node, the proposed scheme is
developed to minimize the cost of computations and to eliminate the
overhead of state maintenance during binding updates. Compared with
other CGA-based BU schemes, our scheme is more efficient and
doesn-t need nonce tables in nodes.
Abstract: Due to the complex network architecture, the mobile
adhoc network-s multihop feature gives additional problems to the
users. When the traffic load at each node gets increased, the
additional contention due its traffic pattern might cause the nodes
which are close to destination to starve the nodes more away from the
destination and also the capacity of network is unable to satisfy the
total user-s demand which results in an unfairness problem. In this
paper, we propose to create an algorithm to compute the optimal
MAC-layer bandwidth assigned to each flow in the network. The
bottleneck links contention area determines the fair time share which
is necessary to calculate the maximum allowed transmission rate used
by each flow. To completely utilize the network resources, we
compute two optimal rates namely, the maximum fair share and
minimum fair share. We use the maximum fair share achieved in
order to limit the input rate of those flows which crosses the
bottleneck links contention area when the flows that are not allocated
to the optimal transmission rate and calculate the following highest
fair share. Through simulation results, we show that the proposed
protocol achieves improved fair share and throughput with reduced
delay.
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: The purpose of this study is mainly to predict collision
frequency on the horizontal tangents combined with vertical curves
using artificial neural network methods. The proposed ANN models
are compared with existing regression models. First, the variables
that affect collision frequency were investigated. It was found that
only the annual average daily traffic, section length, access density,
the rate of vertical curvature, smaller curve radius before and after
the tangent were statistically significant according to related
combinations. Second, three statistical models (negative binomial,
zero inflated Poisson and zero inflated negative binomial) were
developed using the significant variables for three alignment
combinations. Third, ANN models are developed by applying the
same variables for each combination. The results clearly show that
the ANN models have the lowest mean square error value than those
of the statistical models. Similarly, the AIC values of the ANN
models are smaller to those of the regression models for all the
combinations. Consequently, the ANN models have better statistical
performances than statistical models for estimating collision
frequency. The ANN models presented in this paper are
recommended for evaluating the safety impacts 3D alignment
elements on horizontal tangents.