Abstract: Hybridization refers to the crossing breeding of two
plants. Coefficient of Parentage (COP) is used by the plant breeders
to determine the genetic diversity across various varieties so as to
incorporate the useful characters of the two varieties to develop a
new crop variety with particular useful characters. Genetic Diversity
is the prerequisite for any cultivar development program. Genetic
Diversity depends upon the pedigree information of the varieties
based on particular levels. Pedigree refers to the parents of a
particular variety at various levels. This paper discusses the searching
and analyses of different possible pairs of varieties selected on the
basis of morphological characters, Climatic conditions and Nutrients
so as to obtain the most optimal pair that can produce the required
crossbreed variety. An algorithm was developed to determine the
coefficient of parentage (COP) between the selected wheat varieties.
Dummy values were used wherever actual data was not available.
Abstract: The present study aims to evaluating the effect of
rotor solidity - in terms of chord length for a given rotor diameter - on
the performances of a small vertical axis Darrieus wind turbine. The
proposed work focuses on both power production and rotor power
coefficient, considering also the structural constraints deriving from
the centrifugal forces due to rotor angular velocity. Also the
smoothness of the resulting power curves have been investigated, in
order to evaluate the controllability of the corresponding rotor
architectures.
Abstract: Predictions of flow and heat transfer characteristics and shape optimization in internally finned circular tubes have been performed on three-dimensional periodically fully developed turbulent flow and thermal fields. For a trapezoidal fin profile, the effects of fin height h, upper fin widths d1, lower fin widths d2, and helix angle of fin ? on transport phenomena are investigated for the condition of fin number of N = 30. The CFD and mathematical optimization technique are coupled in order to optimize the shape of internally finned tube. The optimal solutions of the design variables (i.e., upper and lower fin widths, fin height and helix angle) are numerically obtained by minimizing the pressure loss and maximizing the heat transfer rate, simultaneously, for the limiting conditions of d1 = 0.5~1.5 mm, d2 = 0.5~1.5 mm, h= 0.5~1.5mm, ? = 10~30 degrees. The fully developed flow and thermal fields are predicted using the finite volume method and the optimization is carried out by means of the multi-objective genetic algorithm that is widely used in the constrained nonlinear optimization problem.
Abstract: This paper aims to present a survey of object
recognition/classification methods based on image moments. We
review various types of moments (geometric moments, complex
moments) and moment-based invariants with respect to various
image degradations and distortions (rotation, scaling, affine
transform, image blurring, etc.) which can be used as shape
descriptors for classification. We explain a general theory how to
construct these invariants and show also a few of them in explicit
forms. We review efficient numerical algorithms that can be used
for moment computation and demonstrate practical examples of
using moment invariants in real applications.
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: Case-Based Reasoning (CBR) is one of machine
learning algorithms for problem solving and learning that caught a lot
of attention over the last few years. In general, CBR is composed of
four main phases: retrieve the most similar case or cases, reuse the
case to solve the problem, revise or adapt the proposed solution, and
retain the learned cases before returning them to the case base for
learning purpose. Unfortunately, in many cases, this retain process
causes the uncontrolled case base growth. The problem affects
competence and performance of CBR systems. This paper proposes
competence-based maintenance method based on deletion policy
strategy for CBR. There are three main steps in this method. Step 1,
formulate problems. Step 2, determine coverage and reachability set
based on coverage value. Step 3, reduce case base size. The results
obtained show that this proposed method performs better than the
existing methods currently discussed in literature.
Abstract: In a handwriting recognition problem, characters can
be represented using chain codes. The main problem in representing
characters using chain code is optimizing the length of the chain
code. This paper proposes to use randomized algorithm to minimize
the length of Freeman Chain Codes (FCC) generated from isolated
handwritten characters. Feedforward neural network is used in the
classification stage to recognize the image characters. Our test results
show that by applying the proposed model, we reached a relatively
high accuracy for the problem of isolated handwritten when tested on
NIST database.
Abstract: In this paper we proposed a novel method to acquire
the ROI (Region of interest) of unsupervised and touch-less palmprint
captured from a web camera in real-time. We use Viola-Jones
approach and skin model to get the target area in real time. Then an
innovative course-to-fine approach to detect the key points on the hand
is described. A new algorithm is used to find the candidate key points
coarsely and quickly. In finely stage, we verify the hand key points
with the shape context descriptor. To make the user much comfortable,
it can process the hand image with different poses, even the hand is
closed. Experiments show promising result by using the proposed
method in various conditions.
Abstract: The aim of this work was to detect genetic variability among the set of 40 castor genotypes using 8 RAPD markers. Amplification of genomic DNA of 40 genotypes, using RAPD analysis, yielded in 66 fragments, with an average of 8.25 polymorphic fragments per primer. Number of amplified fragments ranged from 3 to 13, with the size of amplicons ranging from 100 to 1200 bp. Values of the polymorphic information content (PIC) value ranged from 0.556 to 0.895 with an average of 0.784 and diversity index (DI) value ranged from 0.621 to 0.896 with an average of 0.798. The dendrogram based on hierarchical cluster analysis using UPGMA algorithm was prepared and analyzed genotypes were grouped into two main clusters and only two genotypes could not be distinguished. Knowledge on the genetic diversity of castor can be used for future breeding programs for increased oil production for industrial uses.
Abstract: Given a simple connected unweighted undirected graph G = (V (G), E(G)) with |V (G)| = n and |E(G)| = m, we present a new algorithm for the all-pairs shortest-path (APSP) problem. The running time of our algorithm is in O(n2 log n). This bound is an improvement over previous best known O(n2.376) time bound of Raimund Seidel (1995) for general graphs. The algorithm presented does not rely on fast matrix multiplication. Our algorithm with slight modifications, enables us to compute the APSP problem for unweighted directed graph in time O(n2 log n), improving a previous best known O(n2.575) time bound of Uri Zwick (2002).
Abstract: Among neural models the Support Vector Machine
(SVM) solutions are attracting increasing attention, mostly because
they eliminate certain crucial questions involved by neural network
construction. The main drawback of standard SVM is its high
computational complexity, therefore recently a new technique, the
Least Squares SVM (LS–SVM) has been introduced. In this paper we
present an extended view of the Least Squares Support Vector
Regression (LS–SVR), which enables us to develop new
formulations and algorithms to this regression technique. Based on
manipulating the linear equation set -which embodies all information
about the regression in the learning process- some new methods are
introduced to simplify the formulations, speed up the calculations
and/or provide better results.
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: Due to heavy energy constraints in WSNs clustering is
an efficient way to manage the energy in sensors. There are many
methods already proposed in the area of clustering and research is
still going on to make clustering more energy efficient. In our paper
we are proposing a minimum spanning tree based clustering using
divide and conquer approach. The MST based clustering was first
proposed in 1970’s for large databases. Here we are taking divide and
conquer approach and implementing it for wireless sensor networks
with the constraints attached to the sensor networks. This Divide and
conquer approach is implemented in a way that we don’t have to
construct the whole MST before clustering but we just find the edge
which will be the part of the MST to a corresponding graph and
divide the graph in clusters there itself if that edge from the graph can
be removed judging on certain constraints and hence saving lot of
computation.
Abstract: This paper presents a numerical approach for the static
and dynamic analysis of hydrodynamic radial journal bearings. In the
first part, the effect of shaft and housing deformability on pressure
distribution within oil film is investigated. An iterative algorithm that
couples Reynolds equation with a plane finite elements (FE)
structural model is solved. Viscosity-to-pressure dependency (Vogel-
Barus equation) is also included. The deformed lubrication gap and
the overall stress state are obtained. Numerical results are presented
with reference to a typical journal bearing configuration at two
different inlet oil temperatures. Obtained results show the great
influence of bearing components structural deformation on oil
pressure distribution, compared with results for ideally rigid
components. In the second part, a numerical approach based on
perturbation method is used to compute stiffness and damping
matrices, which characterize the journal bearing dynamic behavior.
Abstract: In this paper, a frequency-variation based method has
been proposed for transistor parameter estimation in a commonemitter
transistor amplifier circuit. We design an algorithm to estimate
the transistor parameters, based on noisy measurements of the output
voltage when the input voltage is a sine wave of variable frequency
and constant amplitude. The common emitter amplifier circuit has
been modelled using the transistor Ebers-Moll equations and the
perturbation technique has been used for separating the linear and
nonlinear parts of the Ebers-Moll equations. This model of the amplifier
has been used to determine the amplitude of the output sinusoid as
a function of the frequency and the parameter vector. Then, applying
the proposed method to the frequency components, the transistor
parameters have been estimated. As compared to the conventional
time-domain least squares method, the proposed method requires
much less data storage and it results in more accurate parameter
estimation, as it exploits the information in the time and frequency
domain, simultaneously. The proposed method can be utilized for
parameter estimation of an analog device in its operating range of
frequencies, as it uses data collected from different frequencies output
signals for parameter estimation.
Abstract: Markov games are a generalization of Markov
decision process to a multi-agent setting. Two-player zero-sum
Markov game framework offers an effective platform for designing
robust controllers. This paper presents two novel controller design
algorithms that use ideas from game-theory literature to produce
reliable controllers that are able to maintain performance in presence
of noise and parameter variations. 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. Our approach
generates 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
controller architectures attempt to improve controller reliability by a
gradual mixing of algorithmic approaches drawn from the game
theory literature and the Minimax-Q Markov game solution
approach, in a reinforcement-learning framework. We test the
proposed algorithms on a simulated Inverted Pendulum Swing-up
task and compare its performance against standard Q learning.
Abstract: This study investigates the use of genetic algorithms
in information retrieval. The method is shown to be applicable to
three well-known documents collections, where more relevant
documents are presented to users in the genetic modification. In this
paper we present a new fitness function for approximate information
retrieval which is very fast and very flexible, than cosine similarity
fitness function.
Abstract: Over the past decades, automatic face recognition has become a highly active research area, mainly due to the countless application possibilities in both the private as well as the public sector. Numerous algorithms have been proposed in the literature to cope with the problem of face recognition, nevertheless, a group of methods commonly referred to as appearance based have emerged as the dominant solution to the face recognition problem. Many comparative studies concerned with the performance of appearance based methods have already been presented in the literature, not rarely with inconclusive and often with contradictory results. No consent has been reached within the scientific community regarding the relative ranking of the efficiency of appearance based methods for the face recognition task, let alone regarding their susceptibility to appearance changes induced by various environmental factors. To tackle these open issues, this paper assess the performance of the three dominant appearance based methods: principal component analysis, linear discriminant analysis and independent component analysis, and compares them on equal footing (i.e., with the same preprocessing procedure, with optimized parameters for the best possible performance, etc.) in face verification experiments on the publicly available XM2VTS database. In addition to the comparative analysis on the XM2VTS database, ten degraded versions of the database are also employed in the experiments to evaluate the susceptibility of the appearance based methods on various image degradations which can occur in "real-life" operating conditions. Our experimental results suggest that linear discriminant analysis ensures the most consistent verification rates across the tested databases.
Abstract: We present a discussion of three adaptive filtering
algorithms well known for their one-step termination property, in
terms of their relationship with the minimal residual method. These
algorithms are the normalized least mean square (NLMS), Affine
Projection algorithm (APA) and the recursive least squares algorithm
(RLS). The NLMS is shown to be a result of the orthogonality
condition imposed on the instantaneous approximation of the Wiener
equation, while APA and RLS algorithm result from orthogonality
condition in multi-dimensional minimal residual formulation. Further
analysis of the minimal residual formulation for the RLS leads to
a triangular system which also possesses the one-step termination
property (in exact arithmetic)
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.