Abstract: Summarizing skills have been introduced to English
syllabus in secondary school in Malaysia to evaluate student-s comprehension for a given text where it requires students to employ several strategies to produce the summary. This paper reports on our effort to develop a computer-based summarization assessment system
that detects the strategies used by the students in producing their
summaries. Sentence decomposition of expert-written summaries is
used to analyze how experts produce their summary sentences. From
the analysis, we identified seven summarizing strategies and their
rules which are then transformed into a set of heuristic rules on how
to determine the summarizing strategies. We developed an algorithm
based on the heuristic rules and performed some experiments to
evaluate and support the technique proposed.
Abstract: An Advance Driver Assistance System (ADAS) is a computer system on board a vehicle which is used to reduce the risk of vehicular accidents by monitoring factors relating to the driver, vehicle and environment and taking some action when a risk is identified. Much work has been done on assessing vehicle and environmental state but there is still comparatively little published work that tackles the problem of driver state. Visual attention is one such driver state. In fact, some researchers claim that lack of attention is the main cause of accidents as factors such as fatigue, alcohol or drug use, distraction and speeding all impair the driver-s capacity to pay attention to the vehicle and road conditions [1]. This seems to imply that the main cause of accidents is inappropriate driver behaviour in cases where the driver is not giving full attention while driving. The work presented in this paper proposes an ADAS system which uses an image based template matching algorithm to detect if a driver is failing to observe particular windscreen cells. This is achieved by dividing the windscreen into 24 uniform cells (4 rows of 6 columns) and matching video images of the driver-s left eye with eye-gesture templates drawn from images of the driver looking at the centre of each windscreen cell. The main contribution of this paper is to assess the accuracy of this approach using Receiver Operating Characteristic analysis. The results of our evaluation give a sensitivity value of 84.3% and a specificity value of 85.0% for the eye-gesture template approach indicating that it may be useful for driver point of regard determinations.
Abstract: Most of the biclustering/projected clustering algorithms are based either on the Euclidean distance or correlation coefficient which capture only linear relationships. However, in many applications, like gene expression data and word-document data, non linear relationships may exist between the objects. Mutual Information between two variables provides a more general criterion to investigate dependencies amongst variables. In this paper, we improve upon our previous algorithm that uses mutual information for biclustering in terms of computation time and also the type of clusters identified. The algorithm is able to find biclusters with mixed relationships and is faster than the previous one. To the best of our knowledge, none of the other existing algorithms for biclustering have used mutual information as a similarity measure. We present the experimental results on synthetic data as well as on the yeast expression data. Biclusters on the yeast data were found to be biologically and statistically significant using GO Tool Box and FuncAssociate.
Abstract: The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
polynomial ring setting.
However, for many important applications in computer science
such as satisfiability and automated verification of hardware and
software, computations are performed in a Boolean ring. In this paper,
we give an algorithm to show that Groebner bases computation is PSPACE
in Boolean rings. We also show that with this discovery,
the Groebner bases method can theoretically be as efficient as
other methods for automated verification of hardware and software.
Additionally, many useful and interesting properties of Groebner
bases including the ability to efficiently convert the bases for different
orders of variables making Groebner bases a promising method in
automated verification.
Abstract: This paper presents a robust proportionalderivative
(PD) based cerebellar model articulation
controller (CMAC) for vertical take-off and landing flight
control systems. Successful on-line training and recalling
process of CMAC accompanying the PD controller is
developed. The advantage of the proposed method is mainly
the robust tracking performance against aerodynamic
parametric variation and external wind gust. The
effectiveness of the proposed algorithm is validated through
the application of a vertical takeoff and landing aircraft
control system.
Abstract: There are two major variants of the Simplex
Algorithm: the revised method and the standard, or tableau method.
Today, all serious implementations are based on the revised method
because it is more efficient for sparse linear programming problems.
Moreover, there are a number of applications that lead to dense linear
problems so our aim in this paper is to present some computational
results on parallel implementation of dense Simplex Method. Our
implementation is implemented on a SMP cluster using C
programming language and the Message Passing Interface MPI.
Preliminary computational results on randomly generated dense
linear programs support our results.
Abstract: this paper focuses on designing of PSS and SVC
controller based on chaos and PSO algorithms to improve the
stability of power system. Single machine infinite bus (SMIB) system
with SVC located at the terminal of generator has been considered to
evaluate the proposed controllers where both SVC and PSS have the
same controller. The coefficients of PSS and SVC controller have
been optimized by chaos and PSO algorithms. Finally the system
with proposed controllers has been simulated for the special
disturbance in input power of generator, and then the dynamic
responses of generator have been presented. The simulation results
showed that the system composed with recommended controller has
outstanding operation in fast damping of oscillations of power system.
Abstract: In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better knowledge of the solution space of the problem. A new operator of 'insertion' is introduced so as to exploit (utilize) the information that has already been collected before the restarting procedure. Finally, numerical experiments comparing the performance of the classic Genetic Algorithm and the Genetic Algorithm with restartings, for some well known test functions, are given.
Abstract: In this article the influence of higher frequency effects
in addition to a special damper design on the electrical behavior of a
synchronous generator main exciter machine is investigated. On the
one hand these machines are often highly stressed by harmonics from
the bridge rectifier thus facing additional eddy current losses. On the
other hand the switching may cause the excitation of dangerous
voltage peaks in resonant circuits formed by the diodes of the
rectifier and the commutation reactance of the machine. Therefore
modern rotating exciters are treated like synchronous generators
usually modeled with a second order equivalent circuit. Hence the
well known Standstill Frequency Response Test (SSFR) method is
applied to a test machine in order to determine parameters for the
simulation. With these results it is clearly shown that higher
frequencies have a strong impact on the conventional equivalent
circuit model. Because of increasing field displacement effects in the
stranded armature winding the sub-transient reactance is even smaller
than the armature leakage at high frequencies. As a matter of fact this
prevents the algorithm to find an equivalent scheme. This issue is
finally solved using Laplace transfer functions fully describing the
transient behavior at the model ports.
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: Nowadays, ontologies are the only widely accepted paradigm for the management of sharable and reusable knowledge in a way that allows its automatic interpretation. They are collaboratively created across the Web and used to index, search and annotate documents. The vast majority of the ontology based approaches, however, focus on indexing texts at document level. Recently, with the advances in ontological engineering, it became clear that information indexing can largely benefit from the use of general purpose ontologies which aid the indexing of documents at word level. This paper presents a concept indexing algorithm, which adds ontology information to words and phrases and allows full text to be searched, browsed and analyzed at different levels of abstraction. This algorithm uses a general purpose ontology, OntoRo, and an ontologically tagged corpus, OntoCorp, both developed for the purpose of this research. OntoRo and OntoCorp are used in a two-stage supervised machine learning process aimed at generating ontology tagging rules. The first experimental tests show a tagging accuracy of 78.91% which is encouraging in terms of the further improvement of the algorithm.
Abstract: Discrimination between different classes of environmental
sounds is the goal of our work. The use of a sound recognition
system can offer concrete potentialities for surveillance and
security applications. The first paper contribution to this research
field is represented by a thorough investigation of the applicability
of state-of-the-art audio features in the domain of environmental
sound recognition. Additionally, a set of novel features obtained by
combining the basic parameters is introduced. The quality of the
features investigated is evaluated by a HMM-based classifier to which
a great interest was done. In fact, we propose to use a Multi-Style
training system based on HMMs: one recognizer is trained on a
database including different levels of background noises and is used
as a universal recognizer for every environment. In order to enhance
the system robustness by reducing the environmental variability, we
explore different adaptation algorithms including Maximum Likelihood
Linear Regression (MLLR), Maximum A Posteriori (MAP)
and the MAP/MLLR algorithm that combines MAP and MLLR.
Experimental evaluation shows that a rather good recognition rate
can be reached, even under important noise degradation conditions
when the system is fed by the convenient set of features.
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: Mobile ad-hoc networks (MANETs) are a form of
wireless networks which do not require a base station for providing
network connectivity. Mobile ad-hoc networks have many
characteristics which distinguish them from other wireless networks
which make routing in such networks a challenging task. Cluster
based routing is one of the routing schemes for MANETs in which
various clusters of mobile nodes are formed with each cluster having
its own clusterhead which is responsible for routing among clusters.
In this paper we have proposed and implemented a distributed
weighted clustering algorithm for MANETs. This approach is based
on combined weight metric that takes into account several system
parameters like the node degree, transmission range, energy and
mobility of the nodes. We have evaluated the performance of
proposed scheme through simulation in various network situations.
Simulation results show that proposed scheme outperforms the
original distributed weighted clustering algorithm (DWCA).
Abstract: To understand working features of a micro combustor,
a computer code has been developed to study combustion of
hydrogen–air mixture in a series of chambers with same shape aspect
ratio but various dimensions from millimeter to micrometer level.
The prepared algorithm and the computer code are capable of
modeling mixture effects in different fluid flows including chemical
reactions, viscous and mass diffusion effects. The effect of various
heat transfer conditions at chamber wall, e.g. adiabatic wall, with
heat loss and heat conduction within the wall, on the combustion is
analyzed. These thermal conditions have strong effects on the
combustion especially when the chamber dimension goes smaller and
the ratio of surface area to volume becomes larger.
Both factors, such as larger heat loss through the chamber wall
and smaller chamber dimension size, may lead to the thermal
quenching of micro-scale combustion. Through such systematic
numerical analysis, a proper operation space for the micro-combustor
is suggested, which may be used as the guideline for microcombustor
design. In addition, the results reported in this paper
illustrate that the numerical simulation can be one of the most
powerful and beneficial tools for the micro-combustor design,
optimization and performance analysis.
Abstract: This paper presents an integrated model that
automatically measures the change of rivers, damage area of bridge
surroundings, and change of vegetation. The proposed model is on the
basis of a neurofuzzy mechanism enhanced by SOM optimization
algorithm, and also includes three functions to deal with river imagery.
High resolution imagery from FORMOSAT-2 satellite taken before
and after the invasion period is adopted. By randomly selecting a
bridge out of 129 destroyed bridges, the recognition results show that
the average width has increased 66%. The ruined segment of the
bridge is located exactly at the most scour region. The vegetation
coverage has also reduced to nearly 90% of the original. The results
yielded from the proposed model demonstrate a pinpoint accuracy rate
at 99.94%. This study brings up a successful tool not only for
large-scale damage assessment but for precise measurement to
disasters.
Abstract: This paper presents a new method for estimating the mean curve of impulse voltage waveforms that are recorded during impulse tests. In practice, these waveforms are distorted by noise, oscillations and overshoot. The problem is formulated as an estimation problem. Estimation of the current signal parameters is achieved using a fast and accurate technique. The method is based on discrete dynamic filtering algorithm (DDF). The main advantage of the proposed technique is its ability in producing the estimates in a very short time and at a very high degree of accuracy. The algorithm uses sets of digital samples of the recorded impulse waveform. The proposed technique has been tested using simulated data of practical waveforms. Effects of number of samples and data window size are studied. Results are reported and discussed.
Abstract: In wireless communication system, a Decision Feedback Equalizer (DFE) to cancel the intersymbol interference (ISI) is required. In this paper, an exact convergence analysis of the (DFE) adapted by the Least Mean Square (LMS) algorithm during the training phase is derived by taking into account the finite alphabet context of data transmission. This allows us to determine the shortest training sequence that allows to reach a given Mean Square Error (MSE). With the intention of avoiding the problem of ill-convergence, the paper proposes an initialization strategy for the blind decision directed (DD) algorithm. This then yields a semi-blind DFE with high speed and good convergence.
Abstract: A robot simulator was developed to measure and
investigate the performance of a robot navigation system based on
the relative position of the robot with respect to random obstacles in
any two dimensional environment. The presented simulator focuses
on investigating the ability of a fuzzy-neural system for object
avoidance. A navigation algorithm is proposed and used to allow
random navigation of a robot among obstacles when the robot faces
an obstacle in the environment. The main features of this simulator
can be used for evaluating the performance of any system that can
provide the position of the robot with respect to obstacles in the
environment. This allows a robot developer to investigate and
analyze the performance of a robot without implementing the
physical robot.