| International journal of Information Technology & Knowledge Management Volume-1, Number-2 |
| Home |
| About us |
| Author Instructions |
| Contact |
| Feedback |
1. A Hybrid of
Artificial Neural Networks and SARIMA
Models for Load Forecasting
Norizan Mohamed[1], Maizah Hura Ahmad [2], Zuhaimy Ismail[3], Khairil Anuar Arshad[4]
[1] Mathematics Department, Faculty Of Science And Technology, Universiti
[2],[3],[4]Department of Mathematics, Faculty Of Science, Universiti Teknologi
norizan@umt.edu.my[1, maizah@mel.fs.utm.my[2], zuhaimyi@yahoo.com[3], khairil@mel.fs.utm.my[4]
Abstract
A Seasonal Autoregressive Integrated Moving Average (SARIMA) is a popular and well known model for
forecasting seasonal time series data. Recently, we applied artificial neural networks (ANNs) in time series forecasting, but in seasonal
series, artificial neural networks (ANNs) did not
perform well. In this paper, a hybrid forecasting model, which combines the seasonal
time series ARIMA (SARIMA) and the multilayer feedforward neural network is proposed to forecast time series with seasonality. The
forecasting performances among these three models, i.e., the SARIMA model, the
multilayer feedforward neural network model and the
hybrid model are compared. Comparing the performances using the root mean
squared error (RMSE), the mean absolute error (MAE) and mean absolute percentage
error (MAPE), we find that the hybrid model outperforms both two single models.
Key words: Load
Forecasting, Artificial Neural Networks; Multilayer Feed-forward Neural
Network; Hybrid Model.
2. Mining Fuzzy Generalized
Association Rules for ER Models
Praveen Arora,
R.K. Chauhan, Ashwani Kush
JaganNath Institute of Mgmt. Sciences,
Department of Computer Science &
Applications, K.U.Kurukshetra,
praveen@jimsindia.org, rkckuk@rediffmail.com, akush20@gmail.com
Abstract
Data
mining techniques can be implemented rapidly on existing software and hardware
platforms. Some algorithms like Extended Apriori and Apriori star exist to discover the relationships between
data attributes upon all levels of fuzzy taxonomic structures that exist in
single table. The purpose of the paper is to address the issue of mining fuzzy
association rules in databases designed using Entity-Relationship (ER) Models
at multiple levels. The study aims to extend the previous developed algorithms
Extended Apriori and Apriori star to discover a new algorithm. The study will help in standardizing
algorithms for finding appropriate results from database tables containing
fuzzy data.
3. An Intelligent Fuzzy
Controlled Handoff for Cellular Systems
Partha Pratim Bhattacharya
Mobile Communication Research Lab, Dept.
of Electronics and Communication Engineering,
Dr. B. C. Roy Engineering College,
Abstract
One major feature of mobile cellular communication system is to
maintain continuous connectivity with active users even when he moves
from one cell to another. This is done by changing channel of one controlling
base station to that of other. The process is called call handoff. In this
paper a fuzzy logic based call handoff initiation process is proposed and its
performance is studied. The algorithm considers the distance from base station,
user velocity and path loss exponent as determining parameters. The algorithm
is found to give satisfactory results.
Key words:
4. Designing some
Imperceptible Data Hiding Methodologies Using Steganographic Techniques
R. K. TIWARI [1], G. SAHOO [2]
[1] Department of Computer Science & Engg.,
[2] Department of Computer Science & Engg. , B.I.T Mesra,
rajeshkrtiwari@yahoo.com, gsahoo@bitmesra.ac.in
Abstract
Data hiding is the process of embedding the secret
data in cover image by making small modification to its pixels. The different
methods of steganography are mostly applied on image files to embed the secret
data. All these methods replace only some parts of the chosen pixels and due to
this only small data can be embedded in cover image otherwise; a large
embedding data changes the cover image originality. So, one has to compromise
either in size of the secret data or in the visual quality of cover image. This
paper presents a new methodology for embedding a large embedding data with very
small changes in respectively small cover image. Based
on this method, we have constructed setgo image
creator and secret data viewer in Microsoft platform.
Key words: Stego-key, User
Classified Multi-valued Code, Reduced ASCII code, Direct Replacement.
5. A Comparative Study Of
The Spectral Response Curves And The Assessment Of Different Land Use And Land Cover Features In A Part Of SUNDERBAN Area, West Bengal, Using Geo-informatics
Parmita Bose[1], S.N.
Mohapatra[2], M.D.Behera[3],Padmini Pani[4]
[1][2]Centre Of Remote Sensing And Gis, School Of Studies In Earth Science, Jiwaji University, Gwalior, M.P.,
India
[3] Scientist, Rrssc (Isro), Kharagpur,W.B.,
[4]Centre For The Study Of Regional
Development, Jnu,
parmita_bose@yahoo.com[1], suraj64@yahoo.com[2], padmini@mail.jnu.ac.in [3], mdbehera@hijli.iitkgp.ernet.in[4]
Abstract
Sundarban, the
largest delta in the world, consists of 10,200 sq km of Mangrove forest, spread
over
Key Words: Delta, Geomorphological,
Spectral, Percentage Reflectance, Radiometric Enhancement, Accuracy Assessment.
6. A Face Identification
System Using Neural Network
SOURABH GUPTA [1], SUNIL KUMAR SINGLA [2]
[1] Electrical & Instrumentation
Engineering Department,
[2] Electrical & Instrumentation
Engineering Department,
sourabh_311@yahoo.co.in [1], sunilksingla2001@yahoo.com [2]
Abstract
Face
is a primary focus of attention in social intercourse, playing a major role in
conveying identity and emotion. Human face recognition plays an important role
in many user authentication applications in the modern world. The face
biometric is widely used in surveillance applications due to its non intrusive
nature. In the present work a neural network based face identification system
has been developed. In the developed system the Gabor filter bank is used to extract the facial features. The system is commenced on
convolving a face image after preprocessing the image at different scales and
orientations. The neural network is used as a classifier in which the weights
of the neurons are updated by supervised learning using Resilient Backpropagation algorithm. The experiments conducted on
Yale database reveals that an accuracy of 90% has been achieved.
Keywords:
Neural Network, Gabor Filter, Convolution.
7. Semi-Automatic Image
Registration
G. P. Saroha[1], R.
K. Chauhan[2], B. S. Chaudhary[3]
[1] Birla Institute Of Applied Sciences, Bhimtal, (Nainital),
[2] Deptt. Of
Computer Applications,
[3] Deptt Of
Earth Sciences,
Gp.Saroha@Gmail.Com
[1], Bsgeokuk@Yahoo.Com [3]
Abstract
Whenever
more than one images of the same area are involved in a study, they must be
co-registered, so that a point in one image can be accurately identified on
other images. The manual method of image registration involve identification of
easily identifiable points, called ground control points (GCPs),
on the images and then computing the transformation parameters based on these GCPs. This process is very tedious and time consuming. We
can take the help of computer in identification of these GCPs or some other thing else like image object, feature, characteristic etc.
instead of using human expertise. Totally elimination of human involvement require
a very robust system which is difficult to program and would require a lot of
computational power; but using human intelligence for supervisory roll to start
the process and finally accept (or reject) some intermediate position, a viable
registration system can be designed. Such a system can be easily implemented on
any modern PC. The present paper investigate the processes involved in image
registration and proposes design of such a system, which is more suitable for
registering satellite images but may be used for medical images also.
Key Words: Image registration, image rectification, multi-modal registration,
non-rigid registration.
8. Roadmap through cob web
of challenges for Computing in MANET
P.K.SURI [1] KAVITA TANEJA[2]
[1] Professor, Deptt. of Computer Science and Applications,
[2]Asst. Prof., M.M.I.C.T & B.M.,
pksuritf25@yahoo.com [1], kavitatane@gmail.com [2]
Abstract
To be able to connect to the
Internet is as a necessity as air and water to survive while keeping pace with
exploding information technology era of today. In view of the increasing demand
for wireless information and data services, providing faster and more reliable
mobile access is becoming an important concern. A mobile ad hoc network (MANET)
is a network formed and functioning without any established infrastructure or
centralized administration and consists of
Key-words: - Mobile ad hoc network (MANET),
9. Modeling of Fault
Prediction in Software Systems
Deepali Gupta
Department Of Computer Science, Gimt,
Deepali_Gupta2000@Yahoo.Com
Abstract
Prediction
of fault-prone modules provides one way to support software quality engineering
through improved scheduling and project control. Methodologies and techniques
for predicting the testing effort, monitoring process costs, and measuring
results can help in increasing efficiency of software testing. Predicting
faults early in the software life cycle can be used to improve software process
control and achieve high software reliability. In the present work, different
machine learning algorithms and neural network techniques are evaluated on two
different real-time software defect datasets. The results show that when all
the prediction techniques are evaluated, then best algorithm for classification
of the software components into faulty/fault-free systems is found to be
Generalized Regression Neural Networks.
Key-Words: - Fault prediction, Software metrics, Software quality,
Machine learning techniques and Neural Network algorithms.
10. Faster Generation of
Association Rules
B. Nath[1], D K
Bhattacharyya[2], A Ghosh[3]
[1] Dept of Computer Science and
Engineering,
[2] Dept of Computer Science and
Engineering,
[3]Machine Intelligence Unit and Center
for Soft Computing Research, Indian Statistical Institute, West Bengal,
bnath@tezu.ernet.in [1], dkb@tezu.ernet.in [2], ash@isical.ac.in [3]
Abstract
Extraction of interesting hidden
information from a large collection of data is termed as data mining.
Association rule mining is a process of data mining where the relationships
among the different attributes are extracted. A number of works have been
carried out in this area. These algorithms work in two phases; frequent set
generation and rule generation. Using a user given parameter minimum support,
the first phase finds out the frequent set. This phase is the most time
consuming one. Hence this phase has attracted a number of researchers for
deriving the frequent sets in an efficient way. The second phase generates the
rules using another user given parameter i.e. minimum confidence. For that it
uses the frequent sets derived by the first phase. Depending on the output of
the first phase this phase may also become time consuming. Moreover if proper
care is not taken then we may miss a number of rules. This paper presents a
technique to generate all possible rules from the given frequent sets based on
the user given minimum confidence.
Keywords: frequent set, association rule, support count,
confidence.
11. Security Challenges In The Stream Control Transmission Protocol: An Overview
Dinesh Kumar, Lecturer
Apeejay Institute of Management, Jalandhar(
dinesh_hiitm@yahoo.co.in
Astract
Many protocol has
been implemented for the data transmission at the transport and the most common
are TCP and UDP. They have their own limitation. To avoid the deficiencies of
these protocol, a new transport layer protocol i.e. stream control transmission
protocol came into existence. This paper overviews the new
features and different security challenges of SCTP protocol.
12. An Image Restoration
Application: Pixel-Digital Watermarking of User Created Images
MILINDKUMAR V.
SARODE, DR. S. A. LADHAKE, DR. PRASHANT
R. DESHMUKH
Department of Computer
Science and Engineering, Jawaharalal Darda Institute of Engineering & Technology, Yavatmal. MS,
Sipna Shikshan Prasarak Mandal`s College of
Engineering, Amravati (MS), INDIA
Department of Computer Sci. & Engg. and Information Technology, Sipna Shikshan Prasarak Mandal`s College of
Engineering, Amravati (MS), INDIA
parthmilindsarode@rediffmail.com,
prdeshmukh@ieee.org
Abstract
The most obvious and first question is what is
``watermarking’’? The process of embedding information into another object or
signal can be termed as watermarking. In other words digital watermarking is a
technique, which allows an individual to add hidden copyright notices, or other
verification messages to digital audio, video, or image signals and documents.
Such hidden message is a group of bits describing information pertaining to the
signal or to the author of the signal (name, place, etc.). The technique takes
its name from watermarking of paper or money as a security measure. Digital
watermarking is not a form of steganography, in which data is hidden in the
message without the end user's knowledge, although some watermarking techniques
have the steganographic feature of not being
perceivable by the human eye. Historically, watermarking has been used to send
``sensitive'' information hidden in another signal. Watermarking has its
applications in image or video copyright protection. Basically WATER MARKING
has its application for ownership protection.
Keywords: Watermarks,
Steganography, Tracking, Embedded watermark, Tracking agent.
13. A Noise Removal
Algorithm for the Restoration of Video Sequences
MILINDKUMAR V.
SARODE, DR. S. A. LADHAKE, DR. PRASHANT
R. DESHMUKH
Department of Computer
Science and Engineering, Jawaharalal Darda Institute of Engineering & Technology, Yavatmal. MS,
Sipna Shikshan Prasarak Mandal`s College of
Engineering, Amravati (MS), INDIA
Department of Computer Sci. & Engg. and Information Technology, Sipna Shikshan Prasarak Mandal`s College of
Engineering, Amravati (MS), INDIA
parthmilindsarode@rediffmail.com,
prdeshmukh@ieee.org
Abstract
Video
transmission is found today in many applications such as surveillance,
video-on-demand, video conferencing, internet etc. The basic communication
problem may be posed as conveying source data with highest possible accuracy. When video sequences are
transmitted from source to destination, it actually gets transmitted frame by
frame. The interference due to
unavoidable energy called noise, degrades the quality
of video during its transmission. So in order to improve the quality of video
sequences at receiver section, optimum reduction of noise is needed. It
consists of three parts, a) Video shot detection b) Key frame detection c) Filtering.
To compare the results of denoising algorithm usage
for video filtering, near noiseless video sequences were used & the
following step taken 1)Addition of artificial noise to
video sequences, 2) Removal of noise from sequences using different denoising algorithms 3) Comparison of processed sequences
with the originals.
Keywords: Impulse
noise, Gaussian noise, Color homogeneity, Eigenvectors, Eigenspace, Spanning.
14. A Framework to Predict
Suitable Period for Mustard Plant Considering Effect of Weather Parameters
Using Factor and Principal Component Analysis
Satyendra Nath Mandal1, J.Pal
Choudhury 2, S.R. Bhadra Chaudhuri3, Dilip De 4
1 Dept. of I.T,
2 Dept. of I.T,
3Dept. of ETE,
4Bidhan Chandra Krishi Viswavidayalay , Kalyani, Nadia(W.B),
satyen_kgec@rediffmail.com1, jnpc193@yahoo.com2 prof_srbc@yahoo.com3,
dilipde.bckv@gmail.com
Abstract
The
plants of different corn are planted in different month within a year. Some are
suitable in summer; some are winter and some rainy season. One common question
is that can plants of all corn are
planted throughout the year? The growth of plant is dependent on environment
parameters like nature of soil, temperature (maximum and minimum), humidity
(maximum and minimum), rainfall, soil moisture and sun rays etc. The nature of
soil is overall West Bengal, India, morel less same. But other parameters vary
from place to place. Using fuzzy logic, artificial neural network and genetic
algorithms has been already tested to predict the growth of shoot length
without considering the effect of environmental parameters [1]. In this paper,
an effort has been made to predict the suitable time period within a year for
mustard plant by considering the total effect of maximum and minimum
temperature, rainfall, maximum and minimum humidity, soil moisture, and sun
shine using the method of factor analysis and principal component analysis for
estimation of growth of shoot length.
Keywords: Environment
parameters, Plant parameter, Factor Analysis, Principal Component Analysis,
Total Effect.
15. License Plate
Recognition System for Indian Vehicles
SHISHIR KUMAR, SHASHANK AGARWAL, KUMAR
SAURABH
Dept. of Computer Science & Engineering
Jaypee Institute of Engineering & Technology , Guna (MP)
dr.shishir@yahoo.com
Abstract
This
work deals with problematic from field of image processing and machine vision
in construction of a license plate recognition system for Indian vehicles
(LPRSIV). This problematic includes mathematical principles and algorithms,
which ensure a process of number plate normalization, processes of proper
characters segmentation, normalization and recognition. Work comparatively
deals with methods achieving invariance of systems towards image skew using homography and various plate conditions. Work also contains
few snapshots as example which will help in understanding the system and its
functions.
Keywords: Projection,
Skew Correction, Homograph, Stroke, Gamma Correction, Correlation.
16. Performance Analysis of
Scalability and Mobility on Routing Protocols in MANETs
Yogesh Chaba *,Yudhvir Singh**,Aarti***
Deptt of CSE, GJU, Hisar
*Yogeshchaba@yahoo.com,
**yudhvirsingh@rediffmail.com, ***aartitandon4@gmail.com,
Abstract
In
this paper, we investigated the effect of routing protocols on performance
(energy consumption and average goodput) within MANETs. We studied different types of ad hoc
routing protocols having different characteristics: reactive vs. proactive,
distance vector vs. link state, and source routing. It is found that AODV as a routing protocol leads
to most accepted protocol and this is confirmed at different mobility
levels. In this paper, we further
analyze the performance using routing protocols by varying scalability &
mobility in MANET.
Keywords: Performance Analysis, Scalability, Mobility, Routing
Protocols, MANETs.
17. Qualifying Fibre Optic Temperature Sensor Using Speckle Metrology
BHASKER GUPTA [1], H
[1] ECE dept, Chitkara Institute of Engineering and Technology,
[2][3] du-2, Central Scientific
Instruments Organisation,
guptabhasker@gmail.com
Abstract
A
distributed temperature sensing approach based on laser speckles in multimode
fibres is characterised. The speckle patterns are intensity distributions of
different modes formed by the interference of the modes from a coherent source. The system design
involves the use of an optical signal transmitter unit, the sensing fibre and a
receiver unit. The receiver unit consists of a camera with a “diffuser glass in
tube arrangement”. A CCD camera housed in the receiver unit receives the
speckle image, which is grabbed by image acquisition hardware and computer for
analysis. The slowly varying perturbation such as temperature is appropriate
for qualifying the sensor. The sensor uses Cu-coated fibre for enhancing the
performance. Two image processing algorithms have been used for
characterisation of two sensing configurations. Results have been generated in
terms of sensitivity, working range, system response time.
Key-words:
- Correlation,
fibre-optic sensors, MSV, response time, sensitivity, sensing configurations,
Speckle patterns, working range.
18. Tutor Generator for
Intelligent Tutoring System
M.Siddappa1, Dr. A.S.Manjunath2,
Dr.H.V.Ramakrishna3
Research Scholar, Dept. of Computer
Science & Engg., Dr. MGR Educational and Research
Institute, Chennai, Tamil Nadu, India
Professor, Dept. of
Computer Science & Engg., Siddaganga Institute of Technology, Tumkur – 572 102.
Additional Rector , Dr. MGR Educational & Research
Institute , Chennai,
msiddu_ssit@rediffmail.com,
asmanju@gmail.com
Abstract
The emergence of Intelligent Tutoring System (ITS)
has opened up new avenues for the use of computers in the field of education. ITSs are able to tackle difficult instructional problems
and extend the usefulness of the computer as an instructional tool. Intelligent Tutoring Systems have proved useful in various domains, but are highly resource intensive to build , the “tutor generators” for assisting users in building ITSs conforming
to two prominent intelligent tutoring paradigms: model-tracing and
constraint-based. This paper presents design of a software tool called
Intelligent Tutor Generators (ITG) for ITS. It is observed that it was easier
to build a generic ITS generator based on the constraint-based paradigm, but the tutor generator based on the
model-tracing paradigm is more feature rich. It can generate applications with
rich user interaction and powerful theory-based remediation capabilities.
Key-Words: ITG, ITS, Paradigm.
19. Implementation of a
Topology Control Algorithm for
SURENDRA S. DALU, M.
K. NASKAR, C. K. SARKAR
Advanced Digital &
Embedded Systems Lab.
{surendradalu, mrinalnaskar, phyhod}@yahoo.co.in
Abstract
Recently mobile ad hoc network (MANET) has attracted great
interest with a variety of real applications. Rigorous research work, mainly on
efficient routing protocol designs has been done and numerous MANET routing
protocols have been developed. While designing the routing protocols it is
assumed that the network is fully connected (i.e. there are no partitions).
Mobility plays an important role in MANET. Relative node movement can break
links and thus change the topology. In this paper we propose a physical
implementation of a topology control algorithm for MANETs using freeway mobility model. The proposed algorithm maintains the topology
without any control message. There is no need to change routing table as
connectivity of the network is maintained all through. Each mobile node is
equipped with a transceiver and a GPS receiver. Each node in a network transmits their coordinate location information
and velocity periodically to its preceding node. After receiving this
information from the following node, if requires, it will modify its own
velocity for maintaining the connectivity/topology with the following node. In this approach each node will
try to maintain the neighborhood topology with its following node. Results
obtained through the experimentation with the prototype developed, demonstrate
that the connectivity and hence the topology of the network is always
maintained.
Key-Words: - Mobile Ad-hoc Network, Topology control, Freeway Mobility
model, Hardware Implementation.
20. Trained Software
Parvinder Singh1, Darshana Hooda2
1 Reader & Chairman Computer Science
& Engineering
2 Lecturer Computer Science & Engineering
Abstract
Software
piracy is major problem in all over the world. A new model is proposed using
trained software to make the software/application trained for a particular
system to avoid this practice. Trained software can be proved very powerful
solution to meet the acute problem of software piracy which causes unbelievable
loss to this promising industry. This model uses system specific information to
train the software to provide 100% security against piracy.
22. Graph Theory Applications
to Software and Assembly Language Programming
Dr. Manoj Duhan1, Dr.
Parvinder Singh2
1Reader & Chairman, Dept. of
Electronics Engineering
2Reader & Chairman, Dept. of Computer
Science & Engineering
Abstract
We are
in a process to study different techniques to compute the cyclomatic complexity of a software or assembly language program. We are having more than
two components in any signal flow graph. We will be able to convert the
software or assembly language program with the help of flow graph components
into the form of algorithm to compute the cyclomatic complexity of a program, which is the slight modification of McCabe’y algorithm. After implementing it to many programs
it is possible to find out the upper limit of the cyclomatic complexity.
23. Strategic Management
Model, Organizing High Value Opportunities with Important Steps Of Research
Manjeet Kaur [1], Dr.
M. K. Jindal [2]
[1] Lecturer, Kendriya Vidyalaya A. D., Dappar, Mohali,
[2] Senior Lecturer,
manjeet.170@rediffmail.com,
manishphd@rediffmail.com
Abstract
Strategic management is an ongoing process
that assesses the business and the industries in which the company is involved;
assesses its competitors and sets goals and strategies to meet all existing and
potential competitors; and then reassesses each strategy annually. It is the art and science of
formulating, implementing and evaluating cross-functional decisions that will
enable an organization to achieve its objectives. It is the process of
specifying the organization's objectives, developing policies and plans to
achieve these objectives, and allocating resources to implement the policies
and plans to achieve the organization's objectives. It is the highest level of
managerial activity, usually formulated by the Board of directors and performed
by the organization's Chief Executive Officer (CEO) and executive team.
Strategic management, therefore, combines the activities of the various
functional areas of a business to achieve organizational objectives. Strategic
management provides overall direction to the enterprise and is closely related
to the field of Organization Studies.
Keywords:strategy evaluation approaches, mission,
marketing strategy, opportunities.
24.
IT Initiatives in the Indian Services Sector
Y Madhuri Srinivas,
Lecturer, Department of Management Studies,
Bhavan’s
madhurimadhuri@sify.com
Abstract
The
Indian services sector is using Information Technology as extensively
as the manufacturing sector to streamline the delivery of services and to optimize
the use of the resources involved in the process. The need of the hour is to
focus on quality, reliability, speed, timely delivery and optimum service
levels. For this, service organizations such as banks, hospitals and logistics
companies are converting loads of data collected through various sources into
integrated state-of-the-art information systems to maximize customer
satisfaction.
Keywords: Core Banking
Systems, Clinical Decision-Support systems
(CDS), Online Analytical Processing (OLAP), Management Information System(MIS).
25. Prediction of
Reliability of Multistage Interconnection Networks by Multi-decomposition
method
R. K. Dash [1], N. K. Barpanda [2] C. R. Tripathy [3]
[1] Department Of Computer Science &
Engineering, Pkace, Bargarh,
[2] Department Of Electronics &
Telecommunication Engineering, Pkace, Bargarh,
[3] Department Of Computer Science &
Engineering And It, Uce, Burla, Sambalpur,
drranjandash@gmail.com[1],
[2] barpanda_nalini@rediffmail.com
Abstract
This
paper introduces a new method based on multi-decomposition for predicting the
exact reliability of fault-tolerant multistage networks. The method is well
supported by an efficient algorithm which runs polynomially.
The proposed method is found to be simple, general and efficient and thus is as
such applicable to all the fault-tolerant multistage interconnection networks.
The proposed method is compared with existing technique to evaluate the
reliability. The results show this method provides a greater accurate
probability when applied on fault-tolerant multistage interconnection networks.
Reliability of some important MINs are evaluated and
compared under the same platform.
Keywords: Probabilistic graph, Reliability, Fault-tolerant,
Interconnection network.
26. Design Issues on Tree
Based Aggregation Algorithms in Wireless Sensor Networks
A. SIVAGAMI [1], K. PAVAI [2], D.
SRIDHARAN [3], S.A.V. SATYA MURTY [4]
[1][2][3] Department of ECE, CEG Campus,
[4] Networking Section, Computer Division,
IGCAR,
siva_psg69@yahoo.co.in [1], pavai_me@yahoo.com [2], sridhar@annauniv.edu [3], satya@igcar.gov.in [4]
Abstract
Wireless Sensor networks (WSN) consists of tiny sensor
nodes which are having limited CPU, memory, battery and communication
capabilities. WSN differs from
conventional wireless networks in several ways such as sensor nodes have severe
energy constraints produces redundant low-rate data traffic, and many-to-one
flows. The end-to-end routing schemes that have been proposed in the literature
for mobile ad-hoc networks are not appropriate under these constraints. Hence,
it is essential to have data-centric technologies that perform in-network
aggregation which gives energy-efficient dissemination. We focus on data
aggregation problems in energy constrained sensor networks. The main goal of
data aggregation algorithms is to gather and aggregate data in an energy
efficient manner so that the network lifetime can be increased. In this paper
we present an elaborate survey on different data aggregation algorithms based
tree architecture and compare them in terms of lifetime, latency and data
accuracy. Also we present the different network issues such as reliability and
security while performing aggregation.
Key Words: Wireless Sensor Networks, Data aggregation, Tree based
algorithms.
27. Designing a Model Driven
Decision Support System for Primary Health Care Managers
[1]
RAJAN VOHRA, [2] NRIPENDRA NARAYAN DAS,[3] MEGHNA
SHARMA
CSE & IT DEPARTMENT, MD UNIVERSITY,
rajanv12@yahoo.com[1],
nripendradas@gmail.com[2], meghnasnet@yahoo.com[3]
Abstract
At
the primary level, all health centers of government have the same number of
doctors, irrespective of the patient load on the center. This research paper
describes a model driven Decision support system, that facilitates load balancing and decentralization. This model can be used by health care
planners in strengthening primary health care services within a geographical
region or district, and in manpower and equipment requirement planning, based
on patient load, instead of fixed administrative guide lines.
Key Words: Model
driven Decision support system; load balancing; primary health care services;
health care planning.
28. Comparative Study of
Relational Database Model and Multi-value Database Model
Meghna Sharma, Assistant Professor [1], Ruchi Sehrawat, Senior Lecturer
[2]
Computer Science & Engineering,
Institute Of Technology & Management,
Computer Science & Engineering,
Institute Of Technology & Management,
meghnasnet@yahoo.com [1], ruchi.sehrawat@gmail.com [2]
Abstract
In the
current business processing management operations, most of the companies and
organizations use Relational (SQL) databases tools which are prevalent, owing
to the IT marketplace being dominated by the big companies like IBM, Oracle,
Microsoft as well as some companies which give open solutions for database
management through relational data model but one more technology coming up
these days at large scale, use the concept of Multivalue database which in many ways is considered more efficient by the supporters of
this concept .We have done the comparative study of these two types of models
,one is relational database and other is Multivalue database.
KeyWords: Cache, Logical Data Model, Multivalue Database, Relational Database.
29. Information Theory Tests
based Performance Evaluation of Cryptographic Techniques
Yudhvir Singh* & Yogesh Chaba**
Deptt of CSE, GJUST, Hisar
*yudhvirsingh@rediffmail.com,
**yogeshchaba@yahoo.com
Abstract
Cryptography
is an emerging technology, which is important for network security. Research on
cryptography is still in its developing stages and considerable research effort
is required. This paper is devoted to the security and attack aspects of
cryptographic techniques. We have discussed the dominant issues of security and
various information theory characteristics of various cipher texts. The
simulation based information theory tests such as Entropy, Floating Frequency,
Histogram, N-Gram, Autocorrelation and Periodicity on cipher text are done. The
simulation based randomness tests such as Frequency Test, Poker Test, Runs Test
and Serial Test on cipher text are done. Finally, we have benchmarked some
well-known cryptographic algorithms in search for the best compromise in
security.
Keywords: Cryptography, Ciphers, Secret Key Cryptography, Security,
Attack, Attacks Analysis and Performance.
30. Web Based CSM
Methodology for Object Oriented Software System
M.ZKurian1, A.S.Manjunath2
1. Research Scholar, Dr. MGR Educational
and Research Institute, Chennai.
2. Professor, Department of Computer
Science and Engineering, Siddaganga Institute of
Technology, Tumkur,
Abstract
This paper is on
Comparative Software Maintenance for Object-Oriented software system. The
Object-Oriented systems have the relationships such as Inheritance,
polymorphism, encapsulation, information-hiding, aggregation and association
combination, which can make the system complicated to maintain. The effects on
the system caused by maintenance activity can ripple through system components
complicating maintenance and testing of the system. A Comparative Software
Maintenance locates potential side effects, ripple effects and other effects of
maintenance. An improved impact analysis procedure that determines impact of
changes to the component level is presented. The result of impact analysis is
applied to determine the component level testing requirements. The CSM
methodology is implemented in Web Based Development Environment using Java Web
Server, Comparative Impact Analysis using Java an OO programming language and JFlex a software lexical analyzer for OO program
maintenance.
Keywords: CSM, Impact
Analysis, Ripple effect, JFlex, Web Based Development
Environment OO System.
31. Enhanced Chaos Based
Spread Spectrum Information Security
A. kumar1, M. K. Ghose2
Department of Computer Sc. & Engg., SMIT,
[kumarsmu@yahoo.com, mkghose2000@yahoo.com
Abstract
An
Enhanced version of chaos based spread spectrum image steganography [1] has
been proposed by incorporating chaos-based encryption, error correction code
and chaotic modulation in spread-spectrum image Steganography. In proposed
method, an enhanced chaos-based
encryption, using an external secret key of 256-bits, and piecewise linear
chaotic map (PWLCM-s) are employed. The initial condition values of PWLCM are
derived using external key. To make encryption more robust, the secret key is
modified after encrypting each block of 256 bits. The pseudo random sequence
derived from PWLCM used for steganography and chaotic modulation.
Findings confirm that the proposed method is secure from various types of
attacks, exhibits good encryption speed and better security performance.
Keywords: Information
Security, Chaos, Steganography, Turbo codes.
32. Store Loyalty Proneness
of Apparel Shopper Segments: A Data Mining Approach
ANIL KAPIL, RUCHI MITTAL, AMIT MITTAL
Professor, MCA Department, MMICT & BM, Mullana,
Senior Lecturer, MCA Deptt.,
MAIMT, Jagadhri,
Associate Professor of Management, MM
University, Mullana,
Abstract
The
primary objective of this article is to demonstrate the impact of using data
mining techniques in an attempt to bring the fields of management and IT much
closer. This article is an empirical research on the application of descriptive
data mining models in the field of shopping behavior in the context of apparel
retailing. This paper uses Cluster Analysis and then explains how they can be
applied to a survey based data for segmenting customers. The results from the
cluster analysis are correlated with the Store Loyalty Proneness of shoppers.
The findings of this research provide some very significant insights into
consumer behavior at the retail level.
Keywords: Data Mining,
Apparel Retailing, Cluster Analysis, and Store Loyalty Proneness.
33. A investigative survey of application of knowledge based system in legal domain
Department
of Computer Applications, Gogte Institute of
Technology, Udyambag,
Department of Statistics, Chh. Shahu Central Institute of Business Education And Research SIBER
Kolhapur – 416004 India
nbbbgm@rediffmail.com, drrvkulkarni@siberindia.co.in
Abstract
Law in a general form prescribes the frame of possible behavior of players in the domain regulated by it. A law can be considered as a set of rules forming a knowledge base and problems arising in the domain of its application should be answered based on it. Knowledge based systems get their power from the expert knowledge that has been coded into facts, rules, heuristics, and procedures. The knowledge is stored in a knowledge base separate from the control and inference components. This makes it possible to add new knowledge or refine existing knowledge without recompiling the control and inference programs. The primary objective of the paper is to survey the research work in incorporation of legal knowledge and reasoning strategies into the automation of the legal tasks, thereby resulting in productive decision making.
34. The Analytical Study of
K-Center Problem Solving Techniques
Rattan Rana, Dr.
Deepak Garg
Computer Science & Engineering Department,
Abstract
Facility location
decisions are a key element in any firm’s overall strategic plan. It is one of
the main issues for contemporary manufacturing and service firms. Specifically,
in the era of global markets and global production, changes in the global
geopolitical environment have made the world truly a global factory, allowing
companies greater flexibility in their location choices. In these situations
the need for special capabilities of choosing the best locations is often far
more important than other cost factors. The k center problem is concerned with the location of k-points (centers) on the network, such that the maximum (weighted)
distance of all the nodes to their respective nearest points is minimized. In
last few decades a number of approaches have been applied to provide an optimum
solution for the k-center problem.
This paper presents a comparative study of different approaches used to solve
the k-center problem.
Keywords: Facility location, Site, k-center, heuristics, greedy, optimizing.
35. Choosing the Best
Heuristic for a NP-problem
Narendhar Maaroju, Deepak Garg
Computer Science and Engineering
Department,
Abstract
Nowadays computers are
used to solve incredibly complex problems. But in order to manage a problem we
should develop an algorithm. Sometimes the human brain is not able to
accomplish this task. Moreover, exact algorithms might need centuries to solve
a formidable problem. In such cases heuristic algorithms that find approximate
solutions but have acceptable time and space complexity play indispensable
role. In present, all known algorithms for NP-complete problems are requiring
time that is exponential in the problem size. Heuristics are a way to improve
time for determining an exact or approximate solution for NP-problems. In our
paper we want to analyze what are the possible heuristics available for
NP-problems and we explain the characteristics and performance of each
heuristic. Finally we analyze efficient heuristic out of all available
heuristics for NP-problem.
Key words: Heuristic,
NP-problems, Hill climbing, Simulated Annealing, Evolutionary Algorithms,
Support Vector Machines, premature convergence.
37. Mining Gene Expression
Data for Association Rules using Mutual Information Based on Entropy
M.ANANDHAVALLI [1] M.K.GHOSE [1]
K.GAUTHAMAN [2]
[1] Department of Computer Science
Engineering, SMIT, Majitar, East Sikkim,
[2] Department of Pharmacognosy,
HPI, Majitar, East Sikkim,
anandhigautham@gmail.com [1]
Abstract
Knowledge discovery from
gene expression databases has become an important research area for biologists
since the growing number of gene sequences was obtained. Using computation
techniques such as data mining to find the association relationship among these
gene data is of great interest and challenging aspect. Extracting information
from large datasets (e.g., from human genome project, gene expression data) is
a well-studied research problem. However, experimental research is time
consuming, and does not use the currently available gene sequence data. Using
data mining techniques, especially association rule techniques, it is getting essential
to find better ways to extract relations (inferences) from them. In this paper,
clustering and mutual information based on entropy has been used to generate
association rules from gene expression data. Our results suggest that
association rule may be well suited to predict the relationships among the
silencer genes.
Keywords:- gene expression data, association rule, entropy, mutual
information.
38. A Plausible inference applied to the
mechanism of semantic web searching