Abstract: This paper uses the radial basis function neural
network (RBFNN) for system identification of nonlinear systems.
Five nonlinear systems are used to examine the activity of RBFNN in
system modeling of nonlinear systems; the five nonlinear systems are
dual tank system, single tank system, DC motor system, and two
academic models. The feed forward method is considered in this
work for modelling the non-linear dynamic models, where the KMeans
clustering algorithm used in this paper to select the centers of
radial basis function network, because it is reliable, offers fast
convergence and can handle large data sets. The least mean square
method is used to adjust the weights to the output layer, and
Euclidean distance method used to measure the width of the Gaussian
function.
Abstract: In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171].
Abstract: Geographic Profiling has successfully assisted investigations for serial crimes. Considering the multi-cluster feature of serial criminal spots, we propose a Multi-point Centrography model as a natural extension of Single-point Centrography for geographic profiling. K-means clustering is first performed on the data samples and then Single-point Centrography is adopted to derive a probability distribution on each cluster. Finally, a weighted combinations of each distribution is formed to make next-crime spot prediction. Experimental study on real cases demonstrates the effectiveness of our proposed model.
Abstract: It is an important problem to compute the geodesics on
a surface in many fields. To find the geodesics in practice, however,
the traditional discrete algorithms or numerical approaches can only
find a list of discrete points. The first author proposed in 2010 a new,
elegant and accurate method, the geodesic-like method, for
approximating geodesics on a regular surface. This paper will present
by use of this method a computation of the Bezier geodesic-like curves
on spheres.
Abstract: This paper proposes the authentication method using
ESA algorithm instead of using CAVE algorithm in the CDMA
mobile communication systems including IS-95 and CDMA2000 1x.
And, we analyze to apply ESA mechanism on behalf of CAVE
mechanism without the change of message format and air interface in
the existing CDMA systems. If ESA algorithm can be used as the
substitution of CAVE algorithm, security strength of authentication
algorithm is intensified without protocol change. An algorithm
replacement proposed in this paper is not to change an authentication
mechanism, but to configure input of ESA algorithm and to produce
output. Therefore, our proposal can be the compatible to the existing
systems.
Abstract: Eye localization is necessary for face recognition and
related application areas. Most of eye localization algorithms reported
so far still need to be improved about precision and computational
time for successful applications. In this paper, we propose an eye
location method based on multi-scale Gabor feature vectors, which is
more robust with respect to initial points. The eye localization based
on Gabor feature vectors first needs to constructs an Eye Model Bunch
for each eye (left or right eye) which consists of n Gabor jets and
average eye coordinates of each eyes obtained from n model face
images, and then tries to localize eyes in an incoming face image by
utilizing the fact that the true eye coordinates is most likely to be very
close to the position where the Gabor jet will have the best Gabor jet
similarity matching with a Gabor jet in the Eye Model Bunch. Similar
ideas have been already proposed in such as EBGM (Elastic Bunch
Graph Matching). However, the method used in EBGM is known to be
not robust with respect to initial values and may need extensive search
range for achieving the required performance, but extensive search
ranges will cause much more computational burden. In this paper, we
propose a multi-scale approach with a little increased computational
burden where one first tries to localize eyes based on Gabor feature
vectors in a coarse face image obtained from down sampling of the
original face image, and then localize eyes based on Gabor feature
vectors in the original resolution face image by using the eye
coordinates localized in the coarse scaled image as initial points.
Several experiments and comparisons with other eye localization
methods reported in the other papers show the efficiency of our
proposed method.
Abstract: Radio frequency identification (RFID) applications have grown rapidly in many industries, especially in indoor location identification. The advantage of using received signal strength indicator (RSSI) values as an indoor location measurement method is a cost-effective approach without installing extra hardware. Because the accuracy of many positioning schemes using RSSI values is limited by interference factors and the environment, thus it is challenging to use RFID location techniques based on integrating positioning algorithm design. This study proposes the location estimation approach and analyzes a scheme relying on RSSI values to minimize location errors. In addition, this paper examines different factors that affect location accuracy by integrating the backpropagation neural network (BPN) with the LANDMARC algorithm in a training phase and an online phase. First, the training phase computes coordinates obtained from the LANDMARC algorithm, which uses RSSI values and the real coordinates of reference tags as training data for constructing an appropriate BPN architecture and training length. Second, in the online phase, the LANDMARC algorithm calculates the coordinates of tracking tags, which are then used as BPN inputs to obtain location estimates. The results show that the proposed scheme can estimate locations more accurately compared to LANDMARC without extra devices.
Abstract: Nowadays Multilevel inverters are widely using in various applications. Modulation strategy at fundamental switching frequency like, SHEPWM is prominent technique to eliminate lower order of harmonics with less switching losses and better harmonic profile. The equations which are formed by SHE are highly nonlinear transcendental in nature, there may exist single, multiple or even no solutions for a particular MI. However, some loads such as electrical drives, it is required to operate in whole range of MI. In order to solve SHE equations for whole range of MI, intelligent techniques are well suited to solve equations so as to produce lest %THDV. Hence, this paper uses Continuous genetic algorithm for minimising harmonics. This paper also presents wavelet based analysis of harmonics. The developed algorithm is simulated and %THD from FFT analysis and Wavelet analysis are compared. MATLAB programming environment and SIMULINK models are used whenever necessary.
Abstract: In this paper, a Neural Network based predictive
DTC algorithm is proposed .This approach is used as an
alternative to classical approaches .An appropriate riate Feed -
forward network is chosen and based on its value of
derivative electromagnetic torque ; optimal stator voltage
vector is determined to be applied to the induction motor (by
inverter). Moreover, an appropriate torque and flux observer
is proposed.
Abstract: Visualizing “Courses – Pre – Required -
Architecture" on the screen has proven to be useful and helpful for
university actors and specially for students. In fact, these students
can easily identify courses and their pre required, perceive the
courses to follow in the future, and then can choose rapidly the
appropriate course to register in. Given a set of courses and their prerequired,
we present an algorithm for visualization a graph entitled
“Courses-Pre-Required-Graph" that present courses and their prerequired
in order to help students to recognize, lonely, what courses
to take in the future and perceive the contain of all courses that they
will study. Our algorithm using “Force Directed Placement"
technique visualizes the “Courses-Pre-Required-Graph" in such way
that courses are easily identifiable. The time complexity of our
drawing algorithm is O (n2), where n is the number of courses in the
“Courses-Pre-Required-Graph".
Abstract: It is estimated that the total cost of abnormal
conditions to US process industries is around $20 billion dollars in
annual losses. The hydrotreatment (HDT) of diesel fuel in petroleum
refineries is a conversion process that leads to high profitable
economical returns. However, this is a difficult process to control
because it is operated continuously, with high hydrogen pressures
and it is also subject to disturbances in feed properties and catalyst
performance. So, the automatic detection of fault and diagnosis plays
an important role in this context. In this work, a hybrid approach
based on neural networks together with a pos-processing
classification algorithm is used to detect faults in a simulated HDT
unit. Nine classes (8 faults and the normal operation) were correctly
classified using the proposed approach in a maximum time of 5
minutes, based on on-line data process measurements.
Abstract: The reliability of distributed systems and computer
networks have been modeled by a probabilistic network or a graph G.
Computing the residual connectedness reliability (RCR), denoted by
R(G), under the node fault model is very useful, but is an NP-hard
problem. Since it may need exponential time of the network size to
compute the exact value of R(G), it is important to calculate its tight
approximate value, especially its lower bound, at a moderate
calculation time. In this paper, we propose an efficient algorithm for
reliability lower bound of distributed systems with unreliable nodes.
We also applied our algorithm to several typical classes of networks
to evaluate the lower bounds and show the effectiveness of our
algorithm.
Abstract: We describe a work with an evolutionary computing
algorithm for non photo–realistic rendering of a target image. The
renderings are produced by genetic programming. We have used two
different types of strokes: “empty triangle" and “filled triangle" in
color level. We compare both empty and filled triangular strokes to
find which one generates more aesthetic pleasing images. We found
the filled triangular strokes have better fitness and generate more
aesthetic images than empty triangular strokes.
Abstract: This paper presents a tested research concept that
implements a complex evolutionary algorithm, genetic algorithm
(GA), in a multi-microcontroller environment. Parallel Distributed
Genetic Algorithm (PDGA) is employed in adaptive beam forming
technique to reduce power usage of adaptive antenna at WCDMA
base station. Adaptive antenna has dynamic beam that requires more
advanced beam forming algorithm such as genetic algorithm which
requires heavy computation and memory space. Microcontrollers are
low resource platforms that are normally not associated with GAs,
which are typically resource intensive. The aim of this project was to
design a cooperative multiprocessor system by expanding the role of
small scale PIC microcontrollers to optimize WCDMA base station
transmitter power. Implementation results have shown that PDGA
multi-microcontroller system returned optimal transmitted power
compared to conventional GA.
Abstract: A preconditioned Jacobi (PJ) method is provided for solving fuzzy linear systems whose coefficient matrices are crisp Mmatrices and the right-hand side columns are arbitrary fuzzy number vectors. The iterative algorithm is given for the preconditioned Jacobi method. The convergence is analyzed with convergence theorems. Numerical examples are given to illustrate the procedure and show the effectiveness and efficiency of the method.
Abstract: This study presents the application of artificial
neural network for modeling the phenolic compound
migration through vertical soil column. A three layered feed
forward neural network with back propagation training
algorithm was developed using forty eight experimental data
sets obtained from laboratory fixed bed vertical column tests.
The input parameters used in the model were the influent
concentration of phenol(mg/L) on the top end of the soil
column, depth of the soil column (cm), elapsed time after
phenol injection (hr), percentage of clay (%), percentage of
silt (%) in soils. The output of the ANN was the effluent
phenol concentration (mg/L) from the bottom end of the soil
columns. The ANN predicted results were compared with the
experimental results of the laboratory tests and the accuracy of
the ANN model was evaluated.
Abstract: In this paper, a method based on Non-Dominated
Sorting Genetic Algorithm (NSGA) has been presented for the Volt /
Var control in power distribution systems with dispersed generation
(DG). Genetic algorithm approach is used due to its broad
applicability, ease of use and high accuracy. The proposed method is
better suited for volt/var control problems. A multi-objective
optimization problem has been formulated for the volt/var control of
the distribution system. The non-dominated sorting genetic algorithm
based method proposed in this paper, alleviates the problem of tuning
the weighting factors required in solving the multi-objective volt/var
control optimization problems. Based on the simulation studies
carried out on the distribution system, the proposed scheme has been
found to be simple, accurate and easy to apply to solve the multiobjective
volt/var control optimization problem of the distribution
system with dispersed generation.
Abstract: In this paper we present a novel method, which
reduces the computational complexity of abrupt cut detection. We
have proposed fast algorithm, where the similarity of frames within
defined step is evaluated instead of comparing successive frames.
Based on the results of simulation on large video collection, the
proposed fast algorithm is able to achieve 80% reduction of needed
frames comparisons compared to actually used methods without the
shot cut detection accuracy degradation.
Abstract: This paper gives an introduction to Web mining, then
describes Web Structure mining in detail, and explores the data
structure used by the Web. This paper also explores different Page
Rank algorithms and compare those algorithms used for Information
Retrieval. In Web Mining, the basics of Web mining and the Web
mining categories are explained. Different Page Rank based
algorithms like PageRank (PR), WPR (Weighted PageRank), HITS
(Hyperlink-Induced Topic Search), DistanceRank and DirichletRank
algorithms are discussed and compared. PageRanks are calculated for
PageRank and Weighted PageRank algorithms for a given hyperlink
structure. Simulation Program is developed for PageRank algorithm
because PageRank is the only ranking algorithm implemented in the
search engine (Google). The outputs are shown in a table and chart
format.
Abstract: In this paper, we present a robust and secure
algorithm for watermarking, the watermark is first transformed into
the frequency domain using the discrete wavelet transform (DWT).
Then the entire DWT coefficient except the LL (Band) discarded,
these coefficients are permuted and encrypted by specific mixing.
The encrypted coefficients are inserted into the most significant
spectral components of the stego-image using a chaotic system. This
technique makes our watermark non-vulnerable to the attack (like
compression, and geometric distortion) of an active intruder, or due
to noise in the transmission link.