Abstract: Traditional principal components analysis (PCA)
techniques for face recognition are based on batch-mode training
using a pre-available image set. Real world applications require that
the training set be dynamic of evolving nature where within the
framework of continuous learning, new training images are
continuously added to the original set; this would trigger a costly
continuous re-computation of the eigen space representation via
repeating an entire batch-based training that includes the old and new
images. Incremental PCA methods allow adding new images and
updating the PCA representation. In this paper, two incremental
PCA approaches, CCIPCA and IPCA, are examined and compared.
Besides, different learning and testing strategies are proposed and
applied to the two algorithms. The results suggest that batch PCA is
inferior to both incremental approaches, and that all CCIPCAs are
practically equivalent.
Abstract: Cosmic showers, from their places of origin in space,
after entering earth generate secondary particles called Extensive Air
Shower (EAS). Detection and analysis of EAS and similar High
Energy Particle Showers involve a plethora of experimental setups
with certain constraints for which soft-computational tools like
Artificial Neural Network (ANN)s can be adopted. The optimality
of ANN classifiers can be enhanced further by the use of Multiple
Classifier System (MCS) and certain data - dimension reduction
techniques. This work describes the performance of certain data
dimension reduction techniques like Principal Component Analysis
(PCA), Independent Component Analysis (ICA) and Self Organizing
Map (SOM) approximators for application with an MCS formed
using Multi Layer Perceptron (MLP), Recurrent Neural Network
(RNN) and Probabilistic Neural Network (PNN). The data inputs are
obtained from an array of detectors placed in a circular arrangement
resembling a practical detector grid which have a higher dimension
and greater correlation among themselves. The PCA, ICA and SOM
blocks reduce the correlation and generate a form suitable for real
time practical applications for prediction of primary energy and
location of EAS from density values captured using detectors in a
circular grid.
Abstract: In recent years, fast neural networks for object/face detection have been introduced based on cross correlation in the frequency domain between the input matrix and the hidden weights of neural networks. In our previous papers [3,4], fast neural networks for certain code detection was introduced. It was proved in [10] that for fast neural networks to give the same correct results as conventional neural networks, both the weights of neural networks and the input matrix must be symmetric. This condition made those fast neural networks slower than conventional neural networks. Another symmetric form for the input matrix was introduced in [1-9] to speed up the operation of these fast neural networks. Here, corrections for the cross correlation equations (given in [13,15,16]) to compensate for the symmetry condition are presented. After these corrections, it is proved mathematically that the number of computation steps required for fast neural networks is less than that needed by classical neural networks. Furthermore, there is no need for converting the input data into symmetric form. Moreover, such new idea is applied to increase the speed of neural networks in case of processing complex values. Simulation results after these corrections using MATLAB confirm the theoretical computations.
Abstract: In this paper, we present a maintenance model of a
two-unit series system with economic dependence. Unit#1 which is
considered to be more expensive and more important, is subject to
condition monitoring (CM) at equidistant, discrete time epochs and
unit#2, which is not subject to CM has a general lifetime distribution.
The multivariate observation vectors obtained through condition
monitoring carry partial information about the hidden state of unit#1,
which can be in a healthy or a warning state while operating. Only the
failure state is assumed to be observable for both units. The objective
is to find an optimal opportunistic maintenance policy minimizing
the long-run expected average cost per unit time. The problem
is formulated and solved in the partially observable semi-Markov
decision process framework. An effective computational algorithm
for finding the optimal policy and the minimum average cost is
developed, illustrated by a numerical example.
Abstract: This paper presents a new technique for detection of
human faces within color images. The approach relies on image
segmentation based on skin color, features extracted from the two-dimensional
discrete cosine transform (DCT), and self-organizing
maps (SOM). After candidate skin regions are extracted, feature
vectors are constructed using DCT coefficients computed from those
regions. A supervised SOM training session is used to cluster feature
vectors into groups, and to assign “face" or “non-face" labels to those
clusters. Evaluation was performed using a new image database of
286 images, containing 1027 faces. After training, our detection
technique achieved a detection rate of 77.94% during subsequent
tests, with a false positive rate of 5.14%. To our knowledge, the
proposed technique is the first to combine DCT-based feature
extraction with a SOM for detecting human faces within color
images. It is also one of a few attempts to combine a feature-invariant
approach, such as color-based skin segmentation, together with
appearance-based face detection. The main advantage of the new
technique is its low computational requirements, in terms of both
processing speed and memory utilization.
Abstract: In the upstream we place a piece of ring and rotate
it with 83Hz, 166Hz, 333Hz,and 666H to find the effect of the
periodic distortion.In the experiment this type of the perturbation
will not allow since the mechanical failure of any parts of the
equipment in the upstream will destroy the blade system. This type of
study will be only possible by CFD. We use two pumps NS32
(ENSAM) and three blades pump (Tamagawa Univ). The benchmark
computations were performed without perturbation parts, and confirm
the computational results well agreement in head-flow rate. We
obtained the pressure fluctuation growth rate that is representing the
global instability of the turbo-system. The fluctuating torque
components were 0.01Nm(5000rpm), 0.1Nm(10000rmp),
0.04Nm(20000rmp), 0.15Nm( 40000rmp) respectively. Only for
10000rpm(166Hz) the output toque was random, and it implies that it
creates unsteady flow by separations on the blades, and will reduce the
pressure loss significantly
Abstract: Reinforced concrete crash barriers used in road traffic
must meet a number of criteria. Crash barriers are laid lengthwise,
one behind another, and joined using specially designed steel locks.
While developing BSV reinforced concrete crash barriers (type
ŽPSV), experiments and calculations aimed to optimize the shape of
a newly designed lock and the reinforcement quantity and
distribution in a crash barrier were carried out. The tension carrying
capacity of two parallelly joined locks was solved experimentally.
Based on the performed experiments, adjustments of nonlinear
properties of steel were performed in the calculations. The obtained
results served as a basis to optimize the lock design using a
computational model that takes into account the plastic behaviour of
steel and the influence of the surrounding concrete [6]. The response
to the vehicle impact has been analyzed using a specially elaborated
complex computational model, comprising both the nonlinear model
of the damping wall or crash barrier and the detailed model of the
vehicle [7].
Abstract: The Maximum Weighted Independent Set (MWIS)
problem is a classic graph optimization NP-hard problem. Given an
undirected graph G = (V, E) and weighting function defined on the
vertex set, the MWIS problem is to find a vertex set S V whose total
weight is maximum subject to no two vertices in S are adjacent. This
paper presents a novel approach to approximate the MWIS of a graph
using minimum weighted vertex cover of the graph. Computational
experiments are designed and conducted to study the performance
of our proposed algorithm. Extensive simulation results show that
the proposed algorithm can yield better solutions than other existing
algorithms found in the literature for solving the MWIS.
Abstract: The physical methods for RNA secondary structure prediction are time consuming and expensive, thus methods for computational prediction will be a proper alternative. Various algorithms have been used for RNA structure prediction including dynamic programming and metaheuristic algorithms. Musician's behaviorinspired harmony search is a recently developed metaheuristic algorithm which has been successful in a wide variety of complex optimization problems. This paper proposes a harmony search algorithm (HSRNAFold) to find RNA secondary structure with minimum free energy and similar to the native structure. HSRNAFold is compared with dynamic programming benchmark mfold and metaheuristic algorithms (RnaPredict, SetPSO and HelixPSO). The results showed that HSRNAFold is comparable to mfold and better than metaheuristics in finding the minimum free energies and the number of correct base pairs.
Abstract: In this paper, we consider the control of time delay system
by Proportional-Integral (PI) controller. By Using the Hermite-
Biehler theorem, which is applicable to quasi-polynomials, we seek
a stability region of the controller for first order delay systems. The
essence of this work resides in the extension of this approach to
second order delay system, in the determination of its stability region
and the computation of the PI optimum parameters. We have used
the genetic algorithms to lead the complexity of the optimization
problem.
Abstract: This paper is focused on issues of process modeling
and two model based control strategies of a fed-batch sugar
crystallization process applying the concept of artificial neural
networks (ANNs). The control objective is to force the operation into
following optimal supersaturation trajectory. It is achieved by
manipulating the feed flow rate of sugar liquor/syrup, considered as
the control input. The control task is rather challenging due to the
strong nonlinearity of the process dynamics and variations in the
crystallization kinetics. Two control alternatives are considered –
model predictive control (MPC) and feedback linearizing control
(FLC). Adequate ANN process models are first built as part of the
controller structures. MPC algorithm outperforms the FLC approach
with respect to satisfactory reference tracking and smooth control
action. However, the MPC is computationally much more involved
since it requires an online numerical optimization, while for the FLC
an analytical control solution was determined.
Abstract: Mostly the real life signals are time varying in nature. For proper characterization of such signals, time-frequency representation is required. The STFT (short-time Fourier transform) is a classical tool used for this purpose. The limitation of the STFT is its fixed time-frequency resolution. Thus, an enhanced version of the STFT, which is based on the cross-level sampling, is devised. It can adapt the sampling frequency and the window function length by following the input signal local variations. Therefore, it provides an adaptive resolution time-frequency representation of the input. The computational complexity of the proposed STFT is deduced and compared to the classical one. The results show a significant gain of the computational efficiency and hence of the processing power. The processing error of the proposed technique is also discussed.
Abstract: Assessment for image quality traditionally needs its
original image as a reference. The conventional method for assessment
like Mean Square Error (MSE) or Peak Signal to Noise Ratio (PSNR)
is invalid when there is no reference. In this paper, we present a new
No-Reference (NR) assessment of image quality using blur and noise.
The recent camera applications provide high quality images by help of
digital Image Signal Processor (ISP). Since the images taken by the
high performance of digital camera have few blocking and ringing
artifacts, we only focus on the blur and noise for predicting the
objective image quality. The experimental results show that the
proposed assessment method gives high correlation with subjective
Difference Mean Opinion Score (DMOS). Furthermore, the proposed
method provides very low computational load in spatial domain and
similar extraction of characteristics to human perceptional assessment.
Abstract: One of the most growing areas in the embedded community is multimedia devices. Multimedia devices incorporate a number of complicated functions for their operation, like motion estimation. A multitude of different implementations have been proposed to reduce motion estimation complexity, such as spiral search. We have studied the implementations of spiral search and identified areas of improvement. We propose a modified spiral search algorithm, with lower computational complexity compared to the original spiral search. We have implemented our algorithm on an embedded ARM based architecture, with custom memory hierarchy. The resulting system yields energy consumption reduction up to 64% and performance increase up to 77%, with a small penalty of 2.3 dB, in average, of video quality compared with the original spiral search algorithm.
Abstract: The cellular network is one of the emerging areas of
communication, in which the mobile nodes act as member for one
base station. The cluster based communication is now an emerging
area of wireless cellular multimedia networks. The cluster renders
fast communication and also a convenient way to work with
connectivity. In our scheme we have proposed an optimization
technique for the fuzzy cluster nodes, by categorizing the group
members into three categories like long refreshable member, medium
refreshable member and short refreshable member. By considering
long refreshable nodes as static nodes, we compute the new
membership values for the other nodes in the cluster. We compare
their previous and present membership value with the threshold value
to categorize them into three different members. By which, we
optimize the nodes in the fuzzy clusters. The simulation results show
that there is reduction in the cluster computational time and
iterational time after optimization.
Abstract: By means of Contractor Iteration Method, we solve and visualize the Lane-Emden(-Fowler) equation Δu + up = 0, in Ω, u = 0, on ∂Ω. It is shown that the present method converges quadratically as Newton’s method and the computation of Contractor Iteration Method is cheaper than the Newton’s method.
Abstract: Spray chilling using air-mist nozzles has received
much attention in the food processing industry because of the
benefits it has shown over forced air convection. These benefits
include an increase in the heat transfer coefficient and a reduction in
the water loss by the product during cooling. However, few studies
have simulated the heat transfer and aerodynamics phenomena of the
air-mist chilling process for optimal operating conditions. The study
provides insight into the optimal conditions for spray impaction, heat
transfer efficiency and control of surface flooding. A computational
fluid dynamics model using a two-phase flow composed of water
droplets injected with air is developed to simulate the air-mist
chilling of food products. The model takes into consideration
droplet-to-surface interaction, water-film accumulation and surface
runoff. The results of this study lead to a better understanding of the
heat transfer enhancement, water conservation, and to a clear
direction for the optimal design of air-mist chilling systems that can
be used in commercial applications in the food and meat processing
industries.
Abstract: Nowadays there are many methods for representing
knowledge such as semantic network, neural network, and conceptual
graphs. Nonetheless, these methods are not sufficiently efficient
when applied to perform and deduce on knowledge domains about
supporting in general education such as algebra, analysis or plane
geometry. This leads to the introduction of computational network
which is a useful tool for representation knowledge base, especially
for computational knowledge, especially knowledge domain about
general education. However, when dealing with a practical problem,
we often do not immediately find a new solution, but we search
related problems which have been solved before and then proposing
an appropriate solution for the problem. Besides that, when finding
related problems, we have to determine whether the result of them
can be used to solve the practical problem or not. In this paper, the
extension model of computational network has been presented. In this
model, Sample Problems, which are related problems, will be used
like the experience of human about practical problem, simulate the
way of human thinking, and give the good solution for the practical
problem faster and more effectively. This extension model is applied
to construct an automatic system for solving algebraic problems in
middle school.
Abstract: All climate models agree that the temperature in
Greece will increase in the range of 1° to 2°C by the year 2030 and
mean sea level in Mediterranean is expected to rise at the rate of 5
cm/decade. The aim of the present paper is the estimation of the
coastline displacement driven by the climate change and sea level
rise. In order to achieve that, all known statistical and non-statistical
computational methods are employed on some Greek coastal areas.
Furthermore, Kalman filtering techniques are for the first time
introduced, formulated and tested. Based on all the above, shoreline
change signals and noises are computed and an inter-comparison
between the different methods can be deduced to help evaluating
which method is most promising as far as the retrieve of shoreline
change rate is concerned.
Abstract: Conceptualization strengthens intelligent systems in generalization skill, effective knowledge representation, real-time inference, and managing uncertain and indefinite situations in addition to facilitating knowledge communication for learning agents situated in real world. Concept learning introduces a way of abstraction by which the continuous state is formed as entities called concepts which are connected to the action space and thus, they illustrate somehow the complex action space. Of computational concept learning approaches, action-based conceptualization is favored because of its simplicity and mirror neuron foundations in neuroscience. In this paper, a new biologically inspired concept learning approach based on the probabilistic framework is proposed. This approach exploits and extends the mirror neuron-s role in conceptualization for a reinforcement learning agent in nondeterministic environments. In the proposed method, instead of building a huge numerical knowledge, the concepts are learnt gradually from rewards through interaction with the environment. Moreover the probabilistic formation of the concepts is employed to deal with uncertain and dynamic nature of real problems in addition to the ability of generalization. These characteristics as a whole distinguish the proposed learning algorithm from both a pure classification algorithm and typical reinforcement learning. Simulation results show advantages of the proposed framework in terms of convergence speed as well as generalization and asymptotic behavior because of utilizing both success and failures attempts through received rewards. Experimental results, on the other hand, show the applicability and effectiveness of the proposed method in continuous and noisy environments for a real robotic task such as maze as well as the benefits of implementing an incremental learning scenario in artificial agents.