|
Management
of Urban Development Using Neural Networks with OD Matrix
-- A K Ojha and Dushmanta Mallick
In
this paper, we have made an attempt to estimate the urban
Orientation Distribution (OD) matrix for solving the complexity
of the Urban transport network using the mathematical model
for real data. The Hopfield Neural Network (HNN) was used
to solve the travelling salesman problem, and the model was
tested with artificial data which performed reasonably well.
The paper concentrates on the estimation of trip matrices
from link volume counts.
©
2008 IUP . All Rights Reserved.
A
Novel High Security Message Authentication Code MACJER-320
and its Performance Evaluation
--
Sheena Mathew and K Poulose Jacob
This
paper describes MACJER-320, a new Message Authentication Code
(MAC) and evaluates its performance in comparison with a popular
one, the keyed-Hash Message Authentication Code (HMAC). Both
the MACs are based on hash functions, i.e., their security
by and large depends on the strength of the underlying hash
function. MACJER-320 uses JERIM-320, a 320-bit hash function,
while HMAC uses a 160-bit hash function, the Secure Hash Algorithm
(SHA-1). JERIM-320 is designed to operate on four parallel
lines of message processing, resulting in higher degree of
security than serial iterative hash functions like SHA-1.
The performance evaluation of the two methods has been done
by using practical implementation step computation methods.
©
2008 IUP . All Rights Reserved.
The
New Semantic Similarity Measure using Ontology and Corpus
-- P Selvi and N P Gopalan
Semantic
similarity techniques help in determining how much two concepts
or terms are similar according to a given knowledge base.
This paper proposes a method for measuring semantic similarity/distance
between terms. This measure not only combines strengths but
also complements weaknesses of the existing measures that
use knowledge base as the primary source. The proposed measure
uses a new feature of common specificity (CommSpec) besides
the path length feature. The CommSpec feature is derived from
(1) information content of concepts; and (2) information content
of the knowledge base given a corpus. We evaluated the proposed
measure with a benchmark test set of term pairs scored for
similarity by human experts. The experimental results demonstrated
that the proposed similarity measure is effective and outperforms
the existing measures. The proposed semantic similarity measure
gives the best correlation (0.874) with human scores compared
to the existing measures.
©
2008 IUP . All Rights Reserved.
Finite-State
Automata Based Classification of News Segments
--
Ankush Mittal and Sumit Gupta
The
goal of Content-Based Retrieval (CBR) is to provide quick
access to relevant content stored in multimedia digital libraries
that contain enormous video data. Most video CBR systems retrieve
shots, or a collection of shots, based on user input. Thus,
the tools for retrieving segments of a video program are not
explored fully, though they form a meaningful utility for
a CBR user. Parsing video programs into program segments is
useful in retrieval of individual segments and video summarization.
Many video classes show structure in them that can be effectively
modeled using Finite-State Automata (FSA). In this paper,
we present a FSA-based system that extracts contextual structure
from news video database. Each video segment such as newscaster
sequence, weather sequence, etc., becomes a node in FSA. The
transition is fired from one node to another node, based on
arc conditions, which can be easily obtained by employing
statistical methods on classified data. Modeling with FSA
avoids the use of complex rule-based system. Experimental
results presented with FSA approach for more than 8 hours
of video data show an accuracy of 88% in recognizing the components
of news video.
©
2008 IUP . All Rights Reserved.
An
Efficient All Spanning Tree Generation Algorithm
--
Sanjay Kumar Pal and Samar Sen Sarma
This
paper considers the generation of all spanning trees for a
simple symmetric and connected graph. Since the possible number
of spanning trees for a graph is exponential, the problem
is inherently of exponential time complexity. The algorithm
proposed in this paper reduces the time complexity compared
to the existing algorithms. The goal is to design an algorithm
that is simple and elegant.
©
2008 IUP . All Rights Reserved.
Technological
Research Challenges in Realizing Adaptive E-Learning
--
Aasim Zafar and Nesar Ahmad
The
ever increasing presence of Internet, rapid advancements in
ICT and recent developments in learning technology have resulted
in the transition of technology-supported distance education
from e-learning to mobile learning. The advent and popularization
of ubiquitous computing and mobile devices have redefined
the concept of e-learning by providing learners with a variety
of options of interacting with e-learning systems. This paper
discusses e-learning activities and outlines technological
research challenges that need to be addressed for the successful
development of e-learning facilities capable of meeting the
needs of users.
©
2008 IUP . All Rights Reserved.
|
