Abstract: Ultra-wide band (UWB) communication is one of
the most promising technologies for high data rate wireless networks
for short range applications. This paper proposes a blind channel
estimation method namely IMM (Interactive Multiple Model) Based
Kalman algorithm for UWB OFDM systems. IMM based Kalman
filter is proposed to estimate frequency selective time varying
channel. In the proposed method, two Kalman filters are concurrently
estimate the channel parameters. The first Kalman filter namely
Static Model Filter (SMF) gives accurate result when the user is static
while the second Kalman filter namely the Dynamic Model Filter
(DMF) gives accurate result when the receiver is in moving state. The
static transition matrix in SMF is assumed as an Identity matrix
where as in DMF, it is computed using Yule-Walker equations. The
resultant filter estimate is computed as a weighted sum of individual
filter estimates. The proposed method is compared with other existing
channel estimation methods.
Abstract: A proposed small-signal model parameters for a pseudomorphic high electron mobility transistor (PHEMT) is presented. Both extrinsic and intrinsic circuit elements of a smallsignal model are determined using genetic algorithm (GA) as a stochastic global search and optimization tool. The parameters extraction of the small-signal model is performed on 200-μm gate width AlGaAs/InGaAs PHEMT. The equivalent circuit elements for a proposed 18 elements model are determined directly from the measured S- parameters. The GA is used to extract the parameters of the proposed small-signal model from 0.5 up to 18 GHz.
Abstract: This paper presents a robust vehicle detection approach using Haar-like feature. It is possible to get a strong edge feature from this Haar-like feature. Therefore it is very effective to remove the shadow of a vehicle on the road. And we can detect the boundary of vehicles accurately. In the paper, the vehicle detection algorithm can be divided into two main steps. One is hypothesis generation, and the other is hypothesis verification. In the first step, it determines vehicle candidates using features such as a shadow, intensity, and vertical edge. And in the second step, it determines whether the candidate is a vehicle or not by using the symmetry of vehicle edge features. In this research, we can get the detection rate over 15 frames per second on our embedded system.
Abstract: This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.
Abstract: In this paper we consider a nonlinear feedback control
called augmented automatic choosing control (AACC) for nonlinear
systems with constrained input using weighted gradient optimization
automatic choosing functions. Constant term which arises from
linearization of a given nonlinear system is treated as a coefficient of
a stable zero dynamics. Parameters of the control are suboptimally
selected by maximizing the stable region in the sense of Lyapunov
with the aid of a genetic algorithm. This approach is applied to a
field excitation control problem of power system to demonstrate the
splendidness of the AACC. Simulation results show that the new
controller can improve performance remarkably well.
Abstract: Several methods are available for weight and shape
optimization of structures, among which Evolutionary Structural
Optimization (ESO) is one of the most widely used methods. In ESO,
however, the optimization criterion is completely case-dependent.
Moreover, only the improving solutions are accepted during the
search. In this paper a Simulated Annealing (SA) algorithm is used
for structural optimization problem. This algorithm differs from other
random search methods by accepting non-improving solutions. The
implementation of SA algorithm is done through reducing the
number of finite element analyses (function evaluations).
Computational results show that SA can efficiently and effectively
solve such optimization problems within short search time.
Abstract: This paper presents an exact pruning algorithm with
adaptive pruning interval for general dynamic neural networks
(GDNN). GDNNs are artificial neural networks with internal dynamics.
All layers have feedback connections with time delays to the
same and to all other layers. The structure of the plant is unknown, so
the identification process is started with a larger network architecture
than necessary. During parameter optimization with the Levenberg-
Marquardt (LM) algorithm irrelevant weights of the dynamic neural
network are deleted in order to find a model for the plant as
simple as possible. The weights to be pruned are found by direct
evaluation of the training data within a sliding time window. The
influence of pruning on the identification system depends on the
network architecture at pruning time and the selected weight to be
deleted. As the architecture of the model is changed drastically during
the identification and pruning process, it is suggested to adapt the
pruning interval online. Two system identification examples show
the architecture selection ability of the proposed pruning approach.
Abstract: Today, node-disjoint routing becomes inessential
technique in communication of packets among various nodes in
networks. Meanwhile AODV (Ad Hoc On-demand Multipath
Distance Vector) creates single-path route between a pair of source
and destination nodes. Some researches has done so far to make
multipath node-disjoint routing based on AODV protocol. But
however their overhead and end-to-end delay are relatively high,
while the detail of their code is not available too. This paper proposes
a new approach of multipath node-disjoint routing based on AODV
protocol. Then the algorithm of analytical model is presented. The
extensive results of this algorithm will be presented in the next paper.
Abstract: Researchers have been applying artificial/ computational intelligence (AI/CI) methods to computer games. In this research field, further researchesare required to compare AI/CI methods with respect to each game application. In thispaper, we report our experimental result on the comparison of evolution strategy, genetic algorithm and their hybrids, applied to evolving controller agents for MarioAI. GA revealed its advantage in our experiment, whereas the expected ability of ES in exploiting (fine-tuning) solutions was not clearly observed. The blend crossover operator and the mutation operator of GA might contribute well to explore the vast search space.
Abstract: In this paper we use the property of co-occurrence
matrix in finding parallel lines in binary pictures for fingerprint
identification. In our proposed algorithm, we reduce the noise by
filtering the fingerprint images and then transfer the fingerprint
images to binary images using a proper threshold. Next, we divide
the binary images into some regions having parallel lines in the same
direction. The lines in each region have a specific angle that can be
used for comparison. This method is simple, performs the
comparison step quickly and has a good resistance in the presence of
the noise.
Abstract: The paper suggests for the first time the use of dynamic programming techniques for optimal risk reduction in the railway industry. It is shown that by using the concept ‘amount of removed risk by a risk reduction option’, the problem related to optimal allocation of a fixed budget to achieve a maximum risk reduction in the railway industry can be reduced to an optimisation problem from dynamic programming. For n risk reduction options and size of the available risk reduction budget B (expressed as integer number), the worst-case running time of the proposed algorithm is O (n x (B+1)), which makes the proposed method a very efficient tool
for solving the optimal risk reduction problem in the railway industry.
Abstract: Saturated hydraulic conductivity is one of the soil
hydraulic properties which is widely used in environmental studies
especially subsurface ground water. Since, its direct measurement is
time consuming and therefore costly, indirect methods such as
pedotransfer functions have been developed based on multiple linear
regression equations and neural networks model in order to estimate
saturated hydraulic conductivity from readily available soil
properties e.g. sand, silt, and clay contents, bulk density, and organic
matter. The objective of this study was to develop neural networks
(NNs) model to estimate saturated hydraulic conductivity from
available parameters such as sand and clay contents, bulk density,
van Genuchten retention model parameters (i.e. r
θ , α , and n) as well
as effective porosity. We used two methods to calculate effective
porosity: : (1) eff s FC φ =θ -θ , and (2) inf φ =θ -θ eff s , in which s
θ is
saturated water content, FC θ is water content retained at -33 kPa
matric potential, and inf θ is water content at the inflection point.
Total of 311 soil samples from the UNSODA database was divided
into three groups as 187 for the training, 62 for the validation (to
avoid over training), and 62 for the test of NNs model. A commercial
neural network toolbox of MATLAB software with a multi-layer
perceptron model and back propagation algorithm were used for the
training procedure. The statistical parameters such as correlation
coefficient (R2), and mean square error (MSE) were also used to
evaluate the developed NNs model. The best number of neurons in
the middle layer of NNs model for methods (1) and (2) were
calculated 44 and 6, respectively. The R2 and MSE values of the test
phase were determined for method (1), 0.94 and 0.0016, and for
method (2), 0.98 and 0.00065, respectively, which shows that method
(2) estimates saturated hydraulic conductivity better than method (1).
Abstract: In this paper, we introduce an effective strategy for
subgoal division and ordering based upon recursive subgoals and
combine this strategy with a genetic-based planning approach. This
strategy can be applied to domains with conjunctive goals. The main
idea is to recursively decompose a goal into a set of serializable
subgoals and to specify a strict ordering among the subgoals.
Empirical results show that the recursive subgoal strategy reduces the
size of the search space and improves the quality of solutions to
planning problems.
Abstract: In this paper, the structural genetic algorithm is used to optimize the neural network to control the joint movements of robotic arm. The robotic arm has also been modeled in 3D and simulated in real-time in MATLAB. It is found that Neural Networks provide a simple and effective way to control the robot tasks. Computer simulation examples are given to illustrate the significance of this method. By combining Genetic Algorithm optimization method and Neural Networks for the given robotic arm with 5 D.O.F. the obtained the results shown that the base joint movements overshooting time without controller was about 0.5 seconds, while with Neural Network controller (optimized with Genetic Algorithm) was about 0.2 seconds, and the population size of 150 gave best results.
Abstract: Many multimedia communication applications require a
source to transmit messages to multiple destinations subject to quality
of service (QoS) delay constraint. To support delay constrained
multicast communications, computer networks need to guarantee an
upper bound end-to-end delay from the source node to each of
the destination nodes. This is known as multicast delay problem.
On the other hand, if the same message fails to arrive at each
destination node at the same time, there may arise inconsistency and
unfairness problem among users. This is related to multicast delayvariation
problem. The problem to find a minimum cost multicast
tree with delay and delay-variation constraints has been proven to
be NP-Complete. In this paper, we propose an efficient heuristic
algorithm, namely, Economic Delay and Delay-Variation Bounded
Multicast (EDVBM) algorithm, based on a novel heuristic function,
to construct an economic delay and delay-variation bounded multicast
tree. A noteworthy feature of this algorithm is that it has very high
probability of finding the optimal solution in polynomial time with
low computational complexity.
Abstract: Visual attention allows user to select the most relevant
information to ongoing behaviour. This paper presents a study on; i)
the performance of people measurements, ii) accurateness of people
measurement of the peaks that correspond to chemical quantities
from the Magnetic Resonance Spectroscopy (MRS) graphs and iii)
affects of people measurements to the algorithm-based diagnosis.
Participant-s eye-movement was recorded using eye-tracker tool
(Eyelink II). This experiment involves three participants for
examining 20 MRS graphs to estimate the peaks of chemical
quantities which indicate the abnormalities associated with
Cerebellar Tumours (CT). The status of each MRS is verified by
using decision algorithm. Analysis involves determination of
humans-s eye movement pattern in measuring the peak of
spectrograms, scan path and determining the relationship of
distributions of fixation durations with the accuracy of measurement.
In particular, the eye-tracking data revealed which aspects of the
spectrogram received more visual attention and in what order they
were viewed. This preliminary investigation provides a proof of
concept for use of the eye tracking technology as the basis for
expanded CT diagnosis.
Abstract: Markov games can be effectively used to design
controllers for nonlinear systems. The paper presents two novel
controller design algorithms by incorporating ideas from gametheory
literature that address safety and consistency issues of the
'learned' control strategy. A more widely used approach for
controller design is the H∞ optimal control, which suffers from high
computational demand and at times, may be infeasible. We generate
an optimal control policy for the agent (controller) via a simple
Linear Program enabling the controller to learn about the unknown
environment. The controller is facing an unknown environment and
in our formulation this environment corresponds to the behavior rules
of the noise modeled as the opponent. Proposed approaches aim to
achieve 'safe-consistent' and 'safe-universally consistent' controller
behavior by hybridizing 'min-max', 'fictitious play' and 'cautious
fictitious play' approaches drawn from game theory. We empirically
evaluate the approaches on a simulated Inverted Pendulum swing-up
task and compare its performance against standard Q learning.
Abstract: Variational methods for optical flow estimation are
known for their excellent performance. The method proposed by Brox
et al. [5] exemplifies the strength of that framework. It combines
several concepts into single energy functional that is then minimized
according to clear numerical procedure. In this paper we propose
a modification of that algorithm starting from the spatiotemporal
gradient constancy assumption. The numerical scheme allows to
establish the connection between our model and the CLG(H) method
introduced in [18]. Experimental evaluation carried out on synthetic
sequences shows the significant superiority of the spatial variant of
the proposed method. The comparison between methods for the realworld
sequence is also enclosed.
Abstract: This work presents a methodology for the design and
manufacture of propellers oriented to the experimental verification of
theoretical results based on the combined model. The design process
begins by using algorithms in Matlab which output data contain the
coordinates of the points that define the blade airfoils, in this case the
NACA 6512 airfoil was used. The modeling for the propeller blade
was made in NX7, through the imported files in Matlab and with the
help of surfaces. Later, the hub and the clamps were also modeled.
Finally, NX 7 also made possible to create post-processed files to the
required machine. It is possible to find the block of numbers with G
& M codes about the type of driver on the machine. The file
extension is .ptp. These files made possible to manufacture the blade,
and the hub of the propeller.
Abstract: A strip domain decomposition parallel algorithm for fast direct Poisson solver is presented on a 3D Cartesian staggered grid. The parallel algorithm follows the principles of sequential algorithm for fast direct Poisson solver. Both Dirichlet and Neumann boundary conditions are addressed. Several test cases are likewise addressed in order to shed light on accuracy and efficiency in the strip domain parallelization algorithm. Actually the current implementation shows a very high efficiency when dealing with a large grid mesh up to 3.6 * 109 under massive parallel approach, which explicitly demonstrates that the proposed algorithm is ready for massive parallel computing.