|
Journal of Theoretical and
Applied Information Technology December 2006 |
Vol. 3 No. 1 |
Title: |
MODELING AND SIMULATION OF
PARALLEL PROCESSING ARCHITECTURE FOR IMAGE PROCESSING |
Author: |
K.MANJUNATHACHARI, K.SATYAPRASAD |
Source: |
Journal of Theoretical and Applied Information Technology 1-11, 2006 |
Abstract |
Typical real time computer vision tasks require huge amount of
processing power and time for handling real time computer vision
applications. The nature of processing in a typical computer vision
algorithm usually ranges from many small arithmetic operations (Fine
Grain Parallelism) to symbolic operations (Coarse grain parallelism).
The task become more complicate while considering image processing
application due to large data sets and there processing. The existing
processing system responds efficiently under sequential working and
result in efficient output, but results in a slow operating system which
results in a inefficient processing system under high speed image
processing systems. Parallel processing founds to be the only solution
to obtain the require processing speed for handling high-speed image
processing applications. The existing image processing systems support
usually only one suit of operations at once and fail to respond under
multiple tasks. System taking single instruction or multiple instruction
process operates using low level and high-level operations. Generally
SIMD architecture is suitable under low level processing while MIMD
architecture is suitable for high-level processing. This paper explores
on modeling and simulation of parallel Image Processing architecture for
Image Processing applications using Parallel Virtual Machine(PVM) ,
MATLAB external interface API and C language on the Linux operating
system platform. |
|
Full Text |
|
Title: |
CODING GAIN ANALYSIS
OF ORTHOGONAL POLYNOMIAL BASED SPACE-TIME BLOCK CODE |
Author: |
R.Krishnamoorthy,
K.Selvakumar |
Source: |
Journal of Theoretical and Applied Information Technology
12-17, 2006 |
Abstract |
In recent years, wireless communication is
increasingly used in voice and messaging due to the mobility it offers.
There is a growing demand for high data rate wireless communication
because of the possibility of using this for internet and multimedia
applications in the near future. To achieve high data rate
communication, the system has to overcome problems such as multipath
fading and cochannel interference. The channel statistic is
significantly often Rayleigh which makes it difficult for the receiver
to reliably determine the transmitted signal unless some less
attenuated replica of the signal is provided to the receiver. This
technique is called diversity, which can be provided using temporal,
frequency, polarization and spatial resources. However, in many
situations, the wireless channel is neither significantly time variant
nor highly frequency selective. This forces the communication engineers
to consider the possibility of deploying multiple antennas at both the
transmitter and receiver to achieve spatial diversity and also provide
high performance. The space-Time Block code is a technique that can
provide diversity and coding gain. In this paper we propose coding gain
analysis of the orthogonal polynomials based on Space-Time Block Code. |
|
Full Text |
|
Title: |
CBR BASED LEARNING
IN E-AUCTIONS |
Author: |
Saroj
Kaushik and Himanshu Tagra |
Source: |
Journal of Theoretical and Applied Information Technology 18-29, 2006 |
Abstract |
The advent of
e-commerce has brought about a radical change in the process of auctions
that can be achieved by using agents. One of the important capabilities
of agent is learning from the environment. In this paper, the authors
are proposing case based learning for agents in online e-auctions.
Case-based reasoning (CBR) is a problem solving paradigm based on the
principle that similar problems have similar solutions has inherent
learning capability. In auctions, CBR has been proposed to store past
histories of similar auctions with their solutions which helps agent to
learn from past experience. Proposed bidding agent that uses CBR (CBR-agent)
participates in the auction and performs better than those bidders who
have no past knowledge about similar auctions. Empirical evaluation is
done and the performance of CBR-agent is calculated by comparing its
success percentage and average winning price with that of other agents
participating in auctions. |
|
Full Text |
|
Title: |
Object Oriented
Programming Constructs' in VHSIC Hardware Description Language
‘Why & How’ |
Author: |
Deepak Jain |
Source: |
Journal of Theoretical and Applied Information Technology
30-36, 2006 |
Abstract |
Object
Oriented Programming Structure (OOPS) has proved its importance
in software development in terms of advantages like Abstraction,
Encapsulation, Polymorphism, Concurrency, Modularity and
Reusability. Also the Object Oriented codes are found to be more
verifiable & maintainable. Hence they allow reduction in efforts
for development, testing & maintenance of the software. In
current scenario, digital-VLSI design life cycle begins with
modeling using some Hardware Description Language (HDL) followed
by functional verification of the HDL-model by its simulation.
Often, VLSI-developers show interest in getting software that
simulates the functional behavior of the hardware for its
analysis from different points of concern. For the sack of
effort minimization in co-designing of Digital VLSI chips and
their simulating software, it is of interest to introduce
automation in code conversion from HDL to OOPS and vise versa.
Author’s efforts in this direction are summarized in this
document. The outcome of this paper may be developed as a code
converter from C++ to VHDL and vise versa. |
|
Full Text |
|
Title: |
Pipeline Data
Compression and Encryption Techniques in E- Learning environment |
Author: |
A.V.N.Krishna,
A.Vinaya Babu |
Source: |
Journal of Theoretical and Applied Information Technology
37-43, 2006 |
Abstract |
One
of the recent developments in telecommunication industry is the
introduction of communications through Internet. Some of the
applications of internet are easy communications, vast library of
information at one place, electronic business through internet, e
learning modules and so on. E- learning is an important application of
communication through Internet. E Learning is an integrated and
continues approach to build knowledge skills and competencies through
web enabled technologies. Effective e learning is having advantage in
delivering the right content to the right person at the right time.
E learning uses the new or existing network connections connected to
internet. The wide area network maintains a high speed connection to an
internet service provider that local centers can use to connect to the
central LAN from a geographical distance away. Though they offer great
accessibility, every one using the internet can see the traffic that
passes between a local center and central office over these insecure
internet LAN connections.
Considering the fact that different encryption approaches target
different types of computational complexity, it may be interesting to
see if any further improvement can be achieved when different data
encryptions are arranged with compression into a pipeline operation. In
this work some effort has been put to calculate computational
complexities and computational overhead of some encryption algorithms in
e- learning environment. |
|
Full Text |
|
Title: |
ESTIMATION OF RETURN
ON INVESTMENT IN SHARE MARKET THROUGH ANN |
Author: |
K.S.Ravichandran, P.Thirunavukarasu, R. Nallaswamy, R.Babu |
Source: |
Journal of Theoretical and Applied Information Technology
44-54, 2006 |
Abstract |
The stock market is
one of the most popular investing places because of its expected high
profit. Traditionally, technical analysis approach, that predicts stock
prices based on historical prices and volume, basic concepts of trends,
price patterns and oscillators, is commonly used by stock investors to
aid investment decisions. Advanced intelligent techniques, ranging from
pure mathematical models and expert systems to fuzzy logic networks,
have also been used by many financial trading systems for investing and
predicting stock prices. In recent years, most of the researchers have
been concentrating their research work on the future prediction of share
market prices by using Neural Networks. But, in this paper we newly
propose a methodology inwhich the neural network is applied to the
investor’s financial decision making to invest all type of shares
irrespective of the high / low index value of the scripts, in a
continuous time frame work and further it is further extended to obtain
the expected return on investment through the Neural Networks and
finally it is compared with the actual value. The proposed network has
been tested with stock data obtained from the Indian Share Market BSE
Index. Finally, the design, implementation and performance of the
proposed neural network are described. |
|
Full Text |
|
Title: |
TOWARDS ROBUST AND
RELIABLE GROUP COMMUNICATION IN AD HOC MOBILE ENVIRONMENT |
Author: |
M.Chitra, RSD.Wahida
Banu
|
Source: |
Journal of Theoretical and Applied Information Technology
55-62, 2006 |
Abstract |
Robust and reliable group communication plays a major role in developing
distributed mobile application in which unannounced disconnections will
occur frequently due to the mobility of the nodes which take part in
mobile applications. The main objective is to achieve robust and
reliable group communication in mobile ad hoc network based on a
guarantee protocol that always considers the transmitting range,
location, speed and direction of mobile nodes to ensure successful
delivery of the message between the group members by calculating
accurate delivery time. The consistent view of application state within
the group of mobile nodes participating in application execution is
necessary to achieve reliable message delivery. To solve any
inconsistency during the group split or merge operation, when mobile
hosts go out of the transmitting range, message delivery is assured and
decided by guarantee protocol whether to deliver the message or not to
avoid any inconsistent state. The guarantee protocol has been analyzed
extensively to ensure the efficient communication among the
participating hosts despite the high mobility environment and the
mobility induced link failure cause inconsistent data and
unrecoverability. |
|
Full Text |
|
Title: |
COMPLEXITY OF CLASS
AND DEVELOPMENT TIME: A STUDY |
Author: |
KUMAR RAJNISH, VANDANA
BHATTACHERJEE |
Source: |
Journal of Theoretical and Applied Information Technology
63-70, 2006 |
Abstract |
Software development time depends on
various attributes of the software product. In this paper, attempt has
been made to define an empirical relation between software development
time with respect to its dependence on lines of code, variables and
methods. We have attempted to analyze the various dependencies of
development time of a program upon its member functions, instance
variables and the number of non-blank, non-comment lines of code.
Statistical techniques have been used to assign weights to the
independent variables to arrive at the results. |
|
Full Text |
Title: |
Hybrid Controller
based Intelligent Speed Control of Induction Motor
|
Author: |
Vinod Kumar, R.R.Joshi
|
Source: |
Journal of Theoretical and Applied Information Technology
71-75, 2006 |
Abstract |
This paper presents a hybrid system controller, incorporating fuzzy
controller with vector-control method for induction motors. The
vector-control method has been optimized by using fuzzy controller
instead of a simple P-I controller. The presented hybrid controller
combines the benefits of fuzzy logic controller and vector-control in a
single system controller. High quality of the regulation process is
achieved through utilization of the fuzzy logic controller, while
stability of the system during transient processes and a wide range of
operation are assured through application of the vector-control. The
hybrid controller has been validated by applying it to a simulation
model. |
|
Full Text |
Title: |
MANUFACTURING CELL
DESIGN WITH REDUCTION IN SETUP TIME THROUGH GENETIC ALGORITHM |
Author: |
M.
Murugan, V. Selladurai
|
Source: |
Journal of Theoretical and Applied Information Technology
76-97, 2006 |
Abstract |
Cellular manufacturing
emerged as a production strategy capable of solving the problems of
complexity and long manufacturing lead times in batch production. The
fundamental problem in cellular manufacturing is the formation of
product families and machine cells. This paper presents a new approach
for obtaining simultaneous arrangement of part families and machine
cells for cellular manufacturing systems. The main feature of the
proposed method is, the relevant production data such as process
sequences and setup times are taken in to account. It has the ability to
select the best solution among the solutions of compactness, group
technology efficiency and reducing setup time efficiency for each part
before attempting to cluster the machines and parts. The formation of
part family and machine cell has been treated as a maximization problem
according to a defined performance measure ‘b’.
A genetic algorithm has been developed for solving the cell
formation problem considering the reduction in setup time. The
validation has been done based on a real time manufacturing data. This
algorithm is written in the ‘C’ language on Intel Pentium / PIII
compatible system. |
|
Full Text |
|
|
|
|
|