Abstract: Automatic reading of handwritten cheque is a computationally
complex process and it plays an important role in financial
risk management. Machine vision and learning provide a viable
solution to this problem. Research effort has mostly been focused
on recognizing diverse pitches of cheques and demand drafts with an
identical outline. However most of these methods employ templatematching
to localize the pitches and such schemes could potentially
fail when applied to different types of outline maintained by the
bank. In this paper, the so-called outline problem is resolved by
a cheque information tree (CIT), which generalizes the localizing
method to extract active-region-of-entities. In addition, the weight
based density plot (WBDP) is performed to isolate text entities and
read complete pitches. Recognition is based on texture features using
neural classifiers. Legal amount is subsequently recognized by both
texture and perceptual features. A post-processing phase is invoked
to detect the incorrect readings by Type-2 grammar using the Turing
machine. The performance of the proposed system was evaluated
using cheque and demand drafts of 22 different banks. The test data
consists of a collection of 1540 leafs obtained from 10 different
account holders from each bank. Results show that this approach
can easily be deployed without significant design amendments.
Abstract: Mobile devices, which are progressively surrounded
in our everyday life, have created a new paradigm where they
interconnect, interact and collaborate with each other. This network
can be used for flexible and secure coordinated sharing. On the other
hand Grid computing provides dependable, consistent, pervasive, and
inexpensive access to high-end computational capabilities. In this
paper, efforts are made to map the concepts of Grid on Ad-Hoc
networks because both exhibit similar kind of characteristics like
Scalability, Dynamism and Heterogeneity. In this context we
propose “Mobile Ad-Hoc Services Grid – MASGRID".
Abstract: In this paper, we propose a direct method based on the
real Schur factorization for solving the projected Sylvester equation
with relatively small size. The algebraic formula of the solution of
the projected continuous-time Sylvester equation is presented. The
computational cost of the direct method is estimated. Numerical
experiments show that this direct method has high accuracy.
Abstract: This paper mainly studies the analyses of parameters
in the intersection collision avoidance (ICA) system based on the radar
sensors. The parameters include the positioning errors, the repeat
period of the radar sensor, the conditions of potential collisions of two
cross-path vehicles, etc. The analyses of the parameters can provide
the requirements, limitations, or specifications of this ICA system. In
these analyses, the positioning errors will be increased as the measured
vehicle approach the intersection. In addition, it is not necessary to
implement the radar sensor in higher position since the positioning
sensitivities become serious as the height of the radar sensor increases.
A concept of the safety buffer distances for front and rear of the
measured vehicle is also proposed. The conditions for potential
collisions of two cross-path vehicles are also presented to facilitate the
computation algorithm.
Abstract: Article presents the geometry and structure
reconstruction procedure of the aircraft model for flatter research
(based on the I22-IRYDA aircraft). For reconstruction the Reverse
Engineering techniques and advanced surface modeling CAD tools
are used. Authors discuss all stages of data acquisition process,
computation and analysis of measured data. For acquisition the three
dimensional structured light scanner was used. In the further sections,
details of reconstruction process are present. Geometry
reconstruction procedure transform measured input data (points
cloud) into the three dimensional parametric computer model
(NURBS solid model) which is compatible with CAD systems.
Parallel to the geometry of the aircraft, the internal structure
(structural model) are extracted and modeled. In last chapter the
evaluation of obtained models are discussed.
Abstract: This work deals with modeling and simulation of SO2 removal in a ceramic membrane by means of FEM. A mass transfer model was developed to predict the performance of SO2 absorption in a chemical solvent. The model was based on solving conservation equations for gas component in the membrane. Computational fluid dynamics (CFD) of mass and momentum were used to solve the model equations. The simulations aimed to obtain the distribution of gas concentration in the absorption process. The effect of the operating parameters on the efficiency of the ceramic membrane was evaluated. The modeling findings showed that the gas phase velocity has significant effect on the removal of gas whereas the liquid phase does not affect the SO2 removal significantly. It is also indicated that the main mass transfer resistance is placed in the membrane and gas phase because of high tortuosity of the ceramic membrane.
Abstract: From a set of shifted, blurred, and decimated image , super-resolution image reconstruction can get a high-resolution image. So it has become an active research branch in the field of image restoration. In general, super-resolution image restoration is an ill-posed problem. Prior knowledge about the image can be combined to make the problem well-posed, which contributes to some regularization methods. In the regularization methods at present, however, regularization parameter was selected by experience in some cases and other techniques have too heavy computation cost for computing the parameter. In this paper, we construct a new super-resolution algorithm by transforming the solving of the System stem Є=An into the solving of the equations X+A*X-1A=I , and propose an inverse iterative method.
Abstract: Quality of Service (QoS) Routing aims to find path between source and destination satisfying the QoS requirements which efficiently using the network resources and underlying routing algorithm and to fmd low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. We present a Optimized Multi- Constrained Routing (OMCR) algorithm for the computation of constrained paths for QoS routing in computer networks. OMCR applies distance vector to construct a shortest path for each destination with reference to a given optimization metric, from which a set of feasible paths are derived at each node. OMCR is able to fmd feasible paths as well as optimize the utilization of network resources. OMCR operates with the hop-by-hop, connectionless routing model in IP Internet and does not create any loops while fmding the feasible paths. Nodes running OMCR not necessarily maintaining global view of network state such as topology, resource information and routing updates are sent only to neighboring nodes whereas its counterpart link-state routing method depend on complete network state for constrained path computation and that incurs excessive communication overhead.
Abstract: In digital signal processing it is important to
approximate multi-dimensional data by the method called rank
reduction, in which we reduce the rank of multi-dimensional data from
higher to lower. For 2-dimennsional data, singular value
decomposition (SVD) is one of the most known rank reduction
techniques. Additional, outer product expansion expanded from SVD
was proposed and implemented for multi-dimensional data, which has
been widely applied to image processing and pattern recognition.
However, the multi-dimensional outer product expansion has behavior
of great computation complex and has not orthogonally between the
expansion terms. Therefore we have proposed an alterative method,
Third-order Orthogonal Tensor Product Expansion short for 3-OTPE.
3-OTPE uses the power method instead of nonlinear optimization
method for decreasing at computing time. At the same time the group
of B. D. Lathauwer proposed Higher-Order SVD (HOSVD) that is
also developed with SVD extensions for multi-dimensional data.
3-OTPE and HOSVD are similarly on the rank reduction of
multi-dimensional data. Using these two methods we can obtain
computation results respectively, some ones are the same while some
ones are slight different. In this paper, we compare 3-OTPE to
HOSVD in accuracy of calculation and computing time of resolution,
and clarify the difference between these two methods.
Abstract: As the enormous amount of on-line text grows on the
World-Wide Web, the development of methods for automatically
summarizing this text becomes more important. The primary goal of
this research is to create an efficient tool that is able to summarize
large documents automatically. We propose an Evolving
connectionist System that is adaptive, incremental learning and
knowledge representation system that evolves its structure and
functionality. In this paper, we propose a novel approach for Part of
Speech disambiguation using a recurrent neural network, a paradigm
capable of dealing with sequential data. We observed that
connectionist approach to text summarization has a natural way of
learning grammatical structures through experience. Experimental
results show that our approach achieves acceptable performance.
Abstract: Feature selection study is gaining importance due to its contribution to save classification cost in terms of time and computation load. In search of essential features, one of the methods to search the features is via the decision tree. Decision tree act as an intermediate feature space inducer in order to choose essential features. In decision tree-based feature selection, some studies used decision tree as a feature ranker with a direct threshold measure, while others remain the decision tree but utilized pruning condition that act as a threshold mechanism to choose features. This paper proposed threshold measure using Manhattan Hierarchical Cluster distance to be utilized in feature ranking in order to choose relevant features as part of the feature selection process. The result is promising, and this method can be improved in the future by including test cases of a higher number of attributes.
Abstract: Simultaneous transient conduction and radiation heat
transfer with heat generation is investigated. Analysis is carried out
for both steady and unsteady situations. two-dimensional gray
cylindrical enclosure with an absorbing, emitting, and isotropically
scattering medium is considered. Enclosure boundaries are assumed
at specified temperatures. The heat generation rate is considered
uniform and constant throughout the medium. The lattice Boltzmann
method (LBM) was used to solve the energy equation of a transient
conduction-radiation heat transfer problem. The control volume finite
element method (CVFEM) was used to compute the radiative
information. To study the compatibility of the LBM for the energy
equation and the CVFEM for the radiative transfer equation, transient
conduction and radiation heat transfer problems in 2-D cylindrical
geometries were considered. In order to establish the suitability of the
LBM, the energy equation of the present problem was also solved
using the the finite difference method (FDM) of the computational
fluid dynamics. The CVFEM used in the radiative heat transfer was
employed to compute the radiative information required for the
solution of the energy equation using the LBM or the FDM (of the
CFD). To study the compatibility and suitability of the LBM for the
solution of energy equation and the CVFEM for the radiative
information, results were analyzed for the effects of various
parameters such as the boundary emissivity. The results of the LBMCVFEM
combination were found to be in excellent agreement with
the FDM-CVFEM combination. The number of iterations and the
steady state temperature in both of the combinations were found
comparable. Results are found for situations with and without heat
generation. Heat generation is found to have significant bearing on
temperature distribution.
Abstract: We present a simplified equalization technique for a
π/4 differential quadrature phase shift keying ( π/4 -DQPSK) modulated
signal in a multipath fading environment. The proposed equalizer is
realized as a fractionally spaced adaptive decision feedback equalizer
(FS-ADFE), employing exponential step-size least mean square
(LMS) algorithm as the adaptation technique. The main advantage of
the scheme stems from the usage of exponential step-size LMS algorithm
in the equalizer, which achieves similar convergence behavior
as that of a recursive least squares (RLS) algorithm with significantly
reduced computational complexity. To investigate the finite-precision
performance of the proposed equalizer along with the π/4 -DQPSK
modem, the entire system is evaluated on a 16-bit fixed point digital
signal processor (DSP) environment. The proposed scheme is found
to be attractive even for those cases where equalization is to be
performed within a restricted number of training samples.
Abstract: In this paper, we propose a reversible watermarking
scheme based on histogram shifting (HS) to embed watermark bits
into the H.264/AVC standard videos by modifying the last nonzero
level in the context adaptive variable length coding (CAVLC) domain.
The proposed method collects all of the last nonzero coefficients (or
called last level coefficient) of 4×4 sub-macro blocks in a macro
block and utilizes predictions for the current last level from the
neighbor block-s last levels to embed watermark bits. The feature of
the proposed method is low computational and has the ability of
reversible recovery. The experimental results have demonstrated that
our proposed scheme has acceptable degradation on video quality and
output bit-rate for most test videos.
Abstract: This paper presents a new classification algorithm using colour and texture for obstacle detection. Colour information is computationally cheap to learn and process. However in many cases, colour alone does not provide enough information for classification. Texture information can improve classification performance but usually comes at an expensive cost. Our algorithm uses both colour and texture features but texture is only needed when colour is unreliable. During the training stage, texture features are learned specifically to improve the performance of a colour classifier. The algorithm learns a set of simple texture features and only the most effective features are used in the classification stage. Therefore our algorithm has a very good classification rate while is still fast enough to run on a limited computer platform. The proposed algorithm was tested with a challenging outdoor image set. Test result shows the algorithm achieves a much better trade-off between classification performance and efficiency than a typical colour classifier.
Abstract: In this paper we present a computational model for pronominal anaphora resolution in Turkish. The model is based on Hobbs’ Naїve Algorithm [4, 5, 6], which exploits only the surface syntax of sentences in a given text.
Abstract: A computationally simple approach of model order
reduction for single input single output (SISO) and linear timeinvariant
discrete systems modeled in frequency domain is proposed
in this paper. Denominator of the reduced order model is determined
using fuzzy C-means clustering while the numerator parameters are
found by matching time moments and Markov parameters of high
order system.
Abstract: Empirical force fields and density functional theory
(DFT) was used to study the binding energies and structures of
methylamine on the surface of activated carbons (ACs). This is a first
step in studying the adsorption of alkyl amines on the surface of
functionalized ACs. The force fields used were Dreiding (DFF),
Universal (UFF) and Compass (CFF) models. The generalized
gradient approximation with Perdew Wang 91 (PW91) functional
was used for DFT calculations. In addition to obtaining the aminecarboxylic
acid adsorption energies, the results were used to establish
reliability of the empirical models for these systems. CFF predicted a
binding energy of -9.227 (kcal/mol) which agreed with PW91 at -
13.17 (kcal/mol), compared to DFF 0 (kcal/mol) and UFF -0.72
(kcal/mol). However, the CFF binding energies for the amine to ester
and ketone disagreed with PW91 results. The structures obtained
from all models agreed with PW91 results.
Abstract: The security of computer networks plays a strategic
role in modern computer systems. Intrusion Detection Systems (IDS)
act as the 'second line of defense' placed inside a protected
network, looking for known or potential threats in network traffic
and/or audit data recorded by hosts. We developed an Intrusion
Detection System using LAMSTAR neural network to learn patterns
of normal and intrusive activities, to classify observed system
activities and compared the performance of LAMSTAR IDS with
other classification techniques using 5 classes of KDDCup99 data.
LAMSAR IDS gives better performance at the cost of high
Computational complexity, Training time and Testing time, when
compared to other classification techniques (Binary Tree classifier,
RBF classifier, Gaussian Mixture classifier). we further reduced the
Computational Complexity of LAMSTAR IDS by reducing the
dimension of the data using principal component analysis which in
turn reduces the training and testing time with almost the same
performance.
Abstract: The deterministic quantum transfer-matrix (QTM)
technique and its mathematical background are presented. This
important tool in computational physics can be applied to a class of
the real physical low-dimensional magnetic systems described by the
Heisenberg hamiltonian which includes the macroscopic molecularbased
spin chains, small size magnetic clusters embedded in some
supramolecules and other interesting compounds. Using QTM, the
spin degrees of freedom are accurately taken into account, yielding
the thermodynamical functions at finite temperatures.
In order to test the application for the susceptibility calculations to
run in the parallel environment, the speed-up and efficiency of
parallelization are analyzed on our platform SGI Origin 3800 with
p = 128 processor units. Using Message Parallel Interface (MPI)
system libraries we find the efficiency of the code of 94% for
p = 128 that makes our application highly scalable.