Full Catalogue 2005 09

Catalogue
of
B.Tech. Project Reports
Batch - 2005-09
Abstracts
Resource Centre
DA-IICT
Gandhinagar - 382007
Introduction
The Resource Centre team is happy to bring out this catalogue listing B. Tech. Projects,
submitted by the 2005-2009 batch students to the Institute. This document covers in all 172
projects submitted by 2005-09 batch students and are listed in alphabetical order under each
year by students surname. Each entry of the project provides the bibliographical details, such
as author (with ID number), title, page numbers, year of submission, supervisor name, call
number, accession number, keywords and abstracts. At the end, author and supervisor
indexes have been provided to enable the user to locate a specific entry in this catalogue.
Hope you will find this document useful. We would be happy to have your comments and
suggestions, if any, to improve this catalogue further.
Updated on: 25/03/2010
Resource Centre Team
Contents
Batch - 2005-2009
1.
Ultra Wide Band Transmission and Receiver Design
By Abhinav Vijay and Kunal Malik

2.
Air for Human Simulator (AFHS) : Graphical Simulation and Physical Study of Inhaled Air
ByAditya
3.
Prakash and Sidharth Kumar

1
Parking Lot Management System

By Ambuj Agarwal
4.
Intelligent Traffic Management - Segregation of Vehicles using Video Images
By Himanshu Agarwal
5.
On Uniquely Diagnosable Fault Sets in Diagnosable Systems
By Ritu Agarwal
6.
-n Junction Solar Cell Simulator - Graphical Simulation and Physics of Solar Cell
By Vineet Aggarwal
7.
Context Aware Semantic Service Discovery

By Ankit Agrawal
8.
Design of Stable Adaptive IIR Notch Filter Using all-pass Lattice Structure
By Manish Agrawal and Ankit Kumar Jain

9.
Detection of Digital Image Manipulation

By Rohin Agrawal
10.
Design and Development of Mobile Intelligent Tutoring Systems
By Anuj Kumar
11.
Health-checking and verification of the DDR3 Subsystem and Survey of clock Domain
Crossing
By V. V.Aravindh
12.
Hybrid Approach to Digital Watermarking Using Independent Component Analysis and Spread
Spectrum
By Arjun Singh
13.
Experimental Evaluation of Dynamic Data Structure for Point Location Problem

By Sumit Bagga
14.
Performance Analysis Tools for ARM

By Sumit Bagla
15.
BREW MP Eclipse Plugin

By Ankit Baphna
16.
Broadband Beamforming
By Puneet Baser and Anik Mundra
17.
Contour Extraction of moving object in a still camera video
By Sangam Batra
18.
Aperture Coupled Microstrip Antenna

By Rohit Bhagya and Pawan Gupta
19.
Polarimetric SAR Data Processing

By P.V. Vijay Bhargava
20.
Parallel Query Optimization for Join Framework of Pig Latin
By Nitesh Bhatia
21.
Predict Neural Networks output more accurately using OpenMP Application Program Interface
(API)
By Avinash Bikualla
22.
PC-Based Tool for Comprehensive Test Application
By Srikanth Reddy Bontha

23.
No-Three-in-Line Problem
By Ravi Teja Boppudi
24.
Optical Character Recognition

By P. Satish Chandra
25.
Acyclic Orientation of Undirected Graphs to Maximize Reachability
By Sakshi Chandra and Somya Agarwal

26.
Bluetooth Security Using Identity Based Encryption
By Vikrant Chaplot
27.
Algorithms for finding a Minimal Dominating Set in a Graph
By Kalyan Cheedi
28.
OLAP Technology for Business Intelligence Analytics System in Retail Enterprises

By B. K Nagarjuna Chitneni
ii
29.
Design Pattern Recognition Using DSM

By Aditya Chittor
30.
Activity and Budget Monitoring System for ATMA
By Kishan Singh Chouhan

31.
Designing CIL Connector To Scyther

By Sidhartha Chauhan
32.
Development and optimization of CMOS Structured ASIC libraries
By B. Aneesha Chowdhary
33.
Hafnium Oxide Gate Dielectrics for Microelectronics Applications
By Pallavi Daggumati
34.
Lifestyle Modificator
By Abhishek Daiya
35.
Robot Motion Planning

By Udaya Bhaskar Dantuluri
36.
A Novel Design for a Current Feedback Amplifier
10
By Apurva Dargar and Ankit Mundra

37.
Improvised filter designs for Performance Enhancement of Depth Estimation using Single
10
Monocular Images
By Das, Aniruddha and Ramnani, Vikas
38.
Mobilizing Community Health Workers to Improve Maternal Health in India
10
By Prabhu Dutta Das

39.
By Akash
40.
11
Vehicle make and model recognition

Dayal
11
A Case Study in System Dynamics

By Rounak Dholakia and Krishna Abhinav
41.
High Performance Implementation of Pulsed OFDM For Ultrawideband Communications
11
By Hima Kireeti Srikanth Dhulipala

42.
Semantic Web for Agriculture Production (SWAP)
11
By Ojas Dubey and Vishal Lalwani

43.
Depth estimation in a Low Depth of Field image
iii
12
By Apuroop Gadde
44.
A Randomized Linear Time Algorithm to find Minimum Spanning Trees
12
By Ramachandra Rao Gadde

45.
On-Line Fair Resource Allocation Scheme in OFDMA Systems Using Cooperative Game
12
Theory
By Rohan Gaddh and Khyati Jain
46.
Development of GSM Protocol through LPC2106 Microcontroller
12
By Amit Garg and Puneet Jindal

47.
Robust Design for M-Banking Client Application on Mobile using Design Patterns
13
By Sagun Garg
48.
13
Semantic Search Engine

By Nitin Gopi
49.
Developing Ontology for Indian Technical Institutes
13
By Gowtham Srinivas P. and Reddy, D. Ravindra Kumar

50.
13
Portfolio Optimization
By Abhas Goyal and Rubish Gupta
51.
An optimized LVQ algorithm for multi-interval discretization of continuous values
14
By Ankush Goyal and Abhinesh Mishra

52.
14
Ontology Matching
By Deep Goyal
53.
Public-Key Cryptography Using Paraunitary Matrices over Fields of Characteristic Two
14
By Gourav Goyal
54.
Formal Analysis of Hierarchical Key Assignment Schemes
14
By Aakar Gupta and Milan Saini

55.
Development of C Simulator for AWG Based Analog & digital Video Interface
15
By Abhishek Gupta
56.
Extending cursor - A New Technique for Enhancing Target Acquisition
15
By Amit Gupta
57.
Coreference Resolution Using Inductive Logic Programming

By Anurag Gupta
iv
15
58.
File system for Real Time Applications with Continuous Media
15
By Divyank Gupta
59.
16
Web Service Discovery and Composition

By Rohit Gupta and Abhishek Somani
60.
Secure Data Transmission Protocol for Distributed Wireless Sensor Networks
16
By Sachin Gupta
61.
A 0.7 Volt High Performance Three Stage OPAMP Using Forward Body Biased Technique
16
By Shekhar Gupta
62.
Crop Estimation Model : Prediction and Simulation
16
By Ravi Grandhi
63.
Algorithm for converting SQL into relational algebra
17
By Ashok Kumar Iraveni

64.
Mash-Maker: An Integrated framework for developing next generation Mashups
17
By Amit Jain and Sumit Pandey

65.
Virtual/Soft token Based Two-factor Authentication
17
By Anurag Jain
66.
DDR2 SDRAM Model Verification Using Palladium and Axis
18
By Anurag Jain
67.
Dynamic Time Warping Based Approach to Dialect Recognition in Indian English
18
By Chaitanya Jain
68.
18
Porting Free RTOS on WildCense

By Manish Jain
69.
Is the attack valid? A Tool for Detecting Erroneous Attacks Found by Scyther
18
By Mohit Jain
70.
19
Service Mashups
By Madan Lal Jat
71.
19
A Proof Technique for Greedy Algorithms

By Anju Jha
72.
19
Face Detection and Recognition

By Harsha Jhunjhunwala
73.
Disk Scheduling Algorithms for Continuous media file systems
20
By Nitesh Jindal
74.
20
Enabling MultiPoint in Educational Tools

By Apurva Joshi
75.
Automated Correction of Faulty Security Protocols
20
By Prachi Joshi
76.
20
Multimedia Content Encryption

By Prakash Josyula
77.
21
Question nswering in Bio Medical Text

By Anshika Kalra
78.
Cross-layer Design for Multimedia streaming in Cluster Based Adaptive Two-hop Wireless
21
Network
By Poornachand Kalyampudi
79.
Performance Analysis of Approximate Nearest Neighbor Searching for k-d and BBD trees
21
By T. Karteek
80.
21
Waste Monitoring System

By Swapnil Khandelwal
81.
A Study on Kalman Filter and Estimation Techniques
22
By Ravin Khanted
82.
Parallel and Dynamic Graph algorithms for Shortest Path Problem
22
By Anil Kishore and Koneru, Tilak

83.
Scheduling in Wireless Fading Systems Using Cross layer Design Approach
22
By Nishanth Koganti
84.
Creation of Test Framework and Testing of WCDMA-AS Air Interface software
22
By Sravani Ratna Konkimalla

85.
Channel Estimation using Pilots in OFDM Systems
22
By Sreekanth Kotapati
86.
Non-homogenous AR (auto-regressive) Model Based prior for Multi-resolution Fusion
23
By R.V.S.Krishna
87.
Vertex coloring Problem and maximal Independent Set Construction

By V. Krishna Teja
vi
23
88.
Evolutionary Algorithms for MultiObjective Optimization
23
By Kashyap Kuchipudi
89.
FPGA Implementation of JPEG2000 Arithmetic Encoder
23
By Lakkaraju Ramesh
90.
A Connector between Scyther and SHRIMP
24
By Lal, Siddhartha
91.
Formal Verification of Security Protocols using ALSP
24
By Suvansh Lal
92.
System Dynamics of IT & BPO Company
24
By Manmeet Singh and Vishav Vikram Kapoor

93.
24
ASIC Design
By Divya Macharla
94.
Development of a Secure Steganographic Technique
25
By Swetha Sri Madhavapeddi

95.
Distributed Vertex Colouring Algorithms based on Greedy Colouring
25
By Ratnesh Malviya
96.
25
Invariant Texture Analysis

By Sudha Praveen Maremanda
97.
Clozer - An Authoring Environment for Creating Interactive Classroom Learning Content
25
By Akhil Mathur
98.
26
Ontology for UG program in CS/IT

By Praveen Meel
99.
Low Power Motion Estimation Circuit Using Adiabatic Logic
26
By Saransh Mehrotra
100.
Analyzing Multiple Regression and Neural Network in Modeling a Dynamic Pattern
26
By Umang Merwana and Jitendra Kumar Pandey

101.
Implementation of Hidden Markov Model for Building a Speaker Dependent Isolated Word
26
Recognizer
By Mayank Mishra
102.
To Define Accurate Channel Capacity by Merging Electromagnetic and Information Theory
vii
27
By Ashish Mittal and Prashant Bajaj

103.
27
Farmer Information System for ATMA

By Ankit Modi
104.
27
Authentication of Digital Images

By Siva Charan Muraharirao
105.
27
Probe Sequences in Hash Tables

By Murthy, R. Satyanarayan
106.
Fragile Domain Watermarking Techniques
28
By Pradeeep Nagireddy
107.
Implementation and Modification of Embedded Zerotree Wavelet Coder for Still Image
28
compression
By Rajendra Prasad Nalamati
108.
28
1V Rail-to-Rail 12-bit Pipelined ADC

By Nallavelli, Ramya and Yenugula, Naveen
109.
Algorithm Evaluation for the weighted Vertex Cover Problem
28
By Amit Nama and Saurabh Mittal

110.
Securing SSL/TLS against Man-in-the-middle Attack
29
By Navkar Samdaria
111.
29
Visualization of OWL Ontology

By Vasavi Kumar Nekkanti
112.
Wasteland Identification & Soil Property Analysis using GIS
29
By Abhinav Nigam and Anuj Srivastava

113.
29
Developing Ontology For Music

By Vikas Nunia and Anukool Tiwari
114.
Qualitative Analysis of C4.5 Decision Tree Induction Algorithm
30
By Varun Rajendra Parimi

115.
Fault Identification In Diagnosable Systems
30
By Nandini Patnaik
116.
Hardware Implementation of Full-Search Block Matching Algorithm

By Satish Pitchikala
viii
30
117.
30
Effect of Frequency Offset on OFDM

By Praveen Kumar and Vinay Kumar Srivastava
118.
31
Low Noise Amplifier Design

By Nikhil Prakash and Saurabh Garg
119.
31
Node Localization in Lunar Environment

By N. S.Prithvi Raj Krishna
120.
Technique to Reduce Vector Generation Time and Resource Requirement
31
By B.K.Priyanka
121.
A Novel MAC Layer Configuration Protocol for CR Based Multihop Wirless Networks
31
By Autul Purohit and Ritika Pareek

122.
Implementation of Rational Wavelets and Filter Design for Speech Recognition
32
By Raj Rishi Purohit,

123.
32
Enhancements to Repository Management

By G. Ram and Saumya Mittal
124.
Miniaturized Microstrip Antenna and Microstrip Array Antenna at 1.4 GHz
32
By Laveen Ramrakhiyani and Nirdesh Kumar

125.
A Kalman filter estimation approach for modeling Time Series data in Stock Market
32
By Pankaj Kumar Rathi and Sparsh Verma

126.
Real Time Scheduling Using Least-Cost-Last Algorithm
33
By G. Ravi Shankar
127.
Text Document Classification Using Finite Mixture Model
33
By P. Vivek Reddy
128.
Analysis of Software Architecture using Dependency Manager
33
By V. S. Goutham Reddy,
129.
Comparative Analysis of Kleins and Modified Kleins Algorithm
34
By Ravi Kiran Rimmanapudi

130.
Fast Approach for Stereo Using Particle Swarm Optimization Technique
34
By Rout, Lipsa Shrabani

131.
34
Settlement of Chharanagar
By Mohit Kumar Rungta and Kapil Shahani
ix
132.
Experimental Study of Connected Dominating Sets for Mobile Ad-Hoc Networks
34
By Rohit Kumar Sahoo and Gaurav Parikh
133.
A Tool for Automatically Generating Security Protocols
34
By P. Sai Teja and Sawant Tandle

134.
Computational Geometry -Witness Set and Guard Set Problem
35
By Sambu Shiva Sai Krishna Prasad

135.
35
Metrics on Protein Structure

By P. Shanmukha Sampath
136.
35
Path Complexity of Programs

By Shubham Saxena
137.
Improving Load-Transient Response of Capacitor less Low Drop out Voltage Regulator
36
By Khaja Ahmad Shaik

138.
Secure Program Execution in Wireless Sensor Networks (WSN)
36
By Amit Sharma
139.
Connected Dominating Set in Wireless Ad-hoc Network
36
By Anshul Sharma and Manish Golcha

140.
Effects of Integrating Digital Visual Materials for Rural Education
36
By Ashish Sharma
141.
Comparison of relative Performance of TEO and VTEO for Emotion Recognition
37
By Gaurav Sharma
142.
Ultra Wideband Low-Noise Amplifier Design
37
By Ruchi Sharma and Kapil Jain

143.
Preserving Edges In Regularized Constrained Least- Squares Image Restoration
37
By Sudhanshu Sharma
144.
38
MIMO-OFDM Channel Equalization

By Shashank Kumar and Varun Raj C.V
145.
Weaknesses and Improvements of E-Mail Protocols
38
By Ajeet Singh Shekhawat

146.
Virtual Tour of the Institute (DA-IICT) Campus

By Praveen Shekhar
38
147.
Face Recognition model using 2D PCA and LDA
38
By Samata Shettigar
148.
On Acyclic Orientation of an Undirected Graph for Maximizing Reachability
39
By Kirti Shrinkhala
149.
Framework for Providing QoS guarantees in Continuous Media Applications
39
By Ankur Singhal
150.
Adaptive SVD update algorithms for Channel Estimation in MIMO Systems
39
By Shruti Singhania
151.
VoIP Security using Dynamic Authentication and Identity-based Technique
39
By Rahul Sinha and Swati Verma

152.
40
Centralized Printing System

By P. V.Soumya
153.
Rapid Performance Benchmarking Methodology of Design Architecture with AXI Crossbar
40
Case Study
By Ankit Srivastava
154.
Generic Mathematical Model to evaluate Full Chip Dynamic Voltage Drop based on
40
Operational Frequency and Utilization

By Nishant Srivastava
155.
40
IP Header Compression
By Saurabh Srivastava
156.
Automatic Identification of Cephalometric Landmarks
41
By Srujan Kumar V. H. N.
157.
41
System Dynamics of a Fresh food Store

By G. S. Neeraj Subramaniyan
158.
41
Shortest Path Algorithm

By P.S.V.SuryaNarayana
159.
Game AI Library for NPC Motions in Mobile Games
41
By Satyajit Swain
160.
An Empirical Investigation of Capital Asset Pricing Model in India

By Ankit Talwar and Anushree Goenka
xi
42
161.
Web-based Application for Querying Institute Ontology
42
By Rajat Taneja and Shobhneet Bhargava

162.
Implementation of Coverage Driven Verification for verifying AHB Bus using Axiom CDF
42
By Rahul Todi
163.
Feature enhancement and Code Quality improvement for Camera Software
42
By Sai Gopal Thota

164.
43
SMG Web Development

By Anupriya S.Tyagi
165.
System Dynamics Model for National Parks
43
By G.Vamshi Krishna
166.
Developing of Web Services Using WS-Engineer
43
By T.Vamsi Krishna
167.
43
Verification Of Graceful Tree Conjecture

By K. Phani Kumar Varma
168.
3D Simulation and Environment Visualization
44
By Varun Varshney
169.
Tata Nano: A Case Study Using System Dynamics
44
By Risav Kumar Verma and Sai Charan Puvvala

170.
Low power NEDA based 1D-DCT Architecture
44
By Harshal Ved
171.
Implementation of Adaptive Filters using Subband and Frequency Domain Techniques
44
By Irukulapati Naga Vishnu Kanth and Seshu Srinivas Balu

172.
Embedding of Binary Trees in Hypercube and Related Graphs
45
By Khushvant Yadav
Author Index
Supervisor Index
46
49
xii
Resource Centre, DA-IICT
B.Tech. Projects 2009
B. Tech Projects
(Abstracts)
2005-2009
Abhinav Vijay (200501091) and Malik, Kunal (200501119)

Ultra Wide Band Transmission and Receiver Design; 5 p.; 2009.
Gupta, Sanjeev
Ultra wide band; UWB; Multiple-mode resonator; Ultra wide band receiver; Advanced design
system; Low noise amplifier.
Abstract: This Report presents the work done in the design of an Ultra Wide Band [1] (UWB) Receiver. In
the process of designing the receiver we have integrated Antenna, Band Pass Filter and Amplifier
into one complete circuit. The preferred designs for the integration are Microstrip antenna[2]
operating at UWB frequency, multiple-mode resonator(MMR) for the filter and three cascaded
Agilent HMMC-5200 series-shunt heterojunction bipolar transistor[3] (HBT) amplifiers for
amplifier module. The layout and simulations of the Microstrip Antenna have been performed using
Agilent Momentum while the schematics and simulations of filter and UWB amplifiers have been
performed using Agilent Advanced Design System (ADS) Schematic. Before implementing the
receiver we implemented a 915 MHz receiver and a UWB Low Noise Amplifier whose schematics,
simulations and results are included herein.
Author:
Title:
Supervisor:
Keywords:
Author: Aditya Prakash (200501013) and Sidharth Kumar (200501014)

Title: Air for Human Simulator (AFHS)- Graphical Simulation and Physical Study of Inhaled Air; 4 p.;
2009.
Supervisor: Jotwani, Naresh and Dutta, Gautam
Keywords: Cardiovascular system; Graphical simulation; Human body; MAYA; Respiratory system; Simulation
of physics.
Abstract: Air for Human Simulator (AFHS) is a unique and novel approach to understand the course of the
inhaled air inside the human body whereby users can easily understand the steps for the
consumption of air inside our body, with the help of 3D graphical modeling and simulation of the
physics. AFHS subsequently concentrates on the 3D modeling and simulation of the cardiovascular
system and the respiratory system, the two systems responsible for the proposed process and
thereby demonstrates there individual and parallel functionalities with the help of 3D models,
simulations and graphs (wherever needed).
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Agarwal, Ambuj (200501065)

Parking Lot Management System; 3 p.; 2009.
Mitra, Suman K.
Piriyakumar, D. Antony Louis, Siemens CT India
Parking lot; Integrated systems; Smart cameras; WiFi network.
Parking Lot Management essentially deals with the placement of parking spaces, ticketing of the
parked vehicle and also managing the empty slots efficiently. Here we discuss a vision based system
that caters to the first two of the above needs integrating it with the security systems. Apart from
these the system allows for a flexible platform to add various features at a later point of time.
Agarwal, Himanshu (200501172)

Intelligent Traffic Management - Segregation of Vehicles using Video Images; 11 p.; 2009.
Mitra, Suman and Roy, Anil K.
Background subtraction; Connected component analysis; Dilation, erosion; Template matching;
Tracking.
Abstract: One of the key aims of any advanced traffic management system is to be able to identify traffic rule
violating vehicles automatically and soonest as well. The current vehicle detection system, such as
license plate detection, identifies vehicles license plate which subsequently may provide only the
address of the vehicle owner using the RTO database. Our project is targeted to develop a new
feature for any citys traffic management system by providing an automatic system capable of taking
real-time input from fixed video camera, segregating two wheeler vehicles. We hope that this
module can then be used for multiple purposes by the City Traffic Commissioner. This report
describes the designed algorithm used to achieve the desired goal.
Author:
Title:
Supervisor:
Keywords:
Agarwal, Ritu (200501082)

On Uniquely Diagnosable Fault Sets in Diagnosable Systems; 5 p.; 2009.
Amin, Ashok T.
Fault set; Hybrid fault set; Intermittently faulty units; Permanently faulty units; Syndrome; Tdiagnosable
Abstract: A self diagnosable system is a system which has the capability of testing its subunits and
determining its faulty units. Various approaches have been developed to identify the set of faulty
units by studying a collection of test results produced by the system. One such approach is to
determine the set of conditions which should be satisfied by a system to have uniquely identifiable
faulty units. This
report deals with a set of such conditions and
1. For the case of symmetric invalidation, it rewrites the proof of necessity and sufficiency of the
conditions so that it is more accessible
2. For the case of symmetric invalidation with permanent faults, it
a. makes explicit a restriction on the size of the fault set and
b. simplifies the conditions and develops an efficient algorithm for their implementation.
Author:
Title:
Supervisor:
Keywords:
Aggarwal, Vineet (200501099)

p-n Junction Solar Cell Simulator - Graphical Simulation and Physics of Solar Cell; 4 p.; 2009.
Jotwani, Naresh and Parikh, Chetan
p-n Junction; Solar cell; MATLAB; Absorption coefficient; Optical intensity; Generation rate;
Current, Power.
Abstract: The solar cell simulator is designed and built for different p-n homojunction solar cell like Silicon,
Gallium Arsenide and Indium Phosphide. Simulator user starts by entering various parameters for
the solar cell. Simulator then calculates various graphs and different values like power, current and
the efficiency of the solar cell with the help of the physics involved in a solar cell. The user can play
the animation to watch and learn the movements of charge carriers.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Agrawal, Ankit (200501173)

Context Aware Semantic Service Discovery; 4 p.; 2009.
Chaudhary, Sanjay
Context; Ontology; Semantics; Service discovery.
This report is a part of an effort to develop a novel context based mechanism to facilitate semantic
service discovery. Context- awareness is considered to be a key problem in designing more adaptive
applications. Context modeling and reasoning are important research area of context-awareness
computing. At the same time huge amount of data leading to inefficient systems raises a demand
for filtering techniques. A study of existing discovery mechanisms has been done.
Agrawal, Manish (200501073) and Jain, Ankit Kumar (200501205)

Design of Stable Adaptive IIR Notch filter using all-pass Lattice Structure; 4 p.; 2009.
C. Vijaykumar
Least mean square (LMS); All-Pass filter; Lattice structure; Notch filter; Finite impulse response
(FIR) filter; Infinite impulse response (IIR) filter; Bit Error Rate (BER).
Abstract: In this paper, the adaptive notch filter is implemented using cascades of second order notch filters,
each of which has been realized using cascades of second order all-pass lattice structure. We have
used LMS adaptive algorithm to make the system adaptive. Further, a comparison is done on the
converging property and coefficient stabilization of the FIR filter using different variants of the
adaptive algorithm Least Mean Square (LMS) vis. Normalized LMS and block LMS used in our
implementation. Computer simulations show the relative performance of the different algorithms
on the basis of bit error rate (BER), coefficient convergence and stabilization and complexity for
the detection of closely-spaced sinusoids and tracking of nonstationary sinusoidal signals.
Author:
Title:
Supervisor:
Keywords:
Agrawal, Rohin (200501187)

Detection of Digital Image Manipulation; 7 p.; 2009.
Roy, Anil K. and Desai, Binita
Image Forensics; Image Manipulation; Least square approximation; Surface normals;
Decorrelation.
Abstract: Manipulation in image has been in practice since centuries. These manipulated images are intended
to alter facts facts of ethics, morality, politics, sex, celebrity or chaos. Image Forensic Science
(Image Forensics) can be used to detect manipulation(s) in a digital image. There are many standard
way to analyze an image for manipulation. We propose a new method that is based on light and its
shade. It measures the direction of light source and uses the light based technique for identification
of any intentional manipulation in the said digital image.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
CoSupervisor:
Keywords:
Abstract:
Anuj Kumar (200501097)

Design and Development of Mobile Intelligent Tutoring Systems; 6 p.; 2009.
Banerjee, Asim
Kam, Matthew, Carnegie Mellon University
Cellphone; Decision Tree; Intelligent Tutors; English as Second Language (ESL)
Learners are a diverse population, varying in their skills, interest and learning process. This paper
presents the design, implementation and evaluation of 2-cellphone based intelligent tutors that have
undergone 2 iterations each. Intelligent Tutors are tutors that can adapt to learners response, and
provide individualized learning thus accounting for their diversity. We have designed 2 such
applications and field-tested them with children. Each applications tutoring system is represented
using a decision tree that helps in understanding softwares response to numerous inputs form the
learner. This paper presents the development of these decision trees based on participatory design
where the applications were modified based on user performance, observation and feedback.
Author: Aravindh, V. V. (200501115)

Title: Health-checking and Verification of the DDR3 Subsystem and Survey of Clock Domain Crossing;
6 p.; 2009.
Supervisor: Dubey, Rahul
On site
Varshney, Sanjeev and Dontam, Ramesh Babu
Supervisors:
Keywords: DDR3 Subsystem; Synthesis; PCTL; Scheduler.
Abstract: This report comprises of the work carried out at ST Microelectronics for the B-Tech project. In
this report, there are details of techniques and issues for synthesis of a given digital design, common
discrepancies observed in a digital design, as exercised in the industry. An overview of the DDR3
subsystem is included. The rationale behind the operation of the DDR3 subsystem and its
verification is included. A literature survey on metastability and solutions for this issue is presented
after the verification process of the DDR3 subsystem.

Author: Arjun Singh (200501201)
Title: Hybrid Approach to Digital Watermarking Using Independent Component Analysis and Spread
Spectrum; 7 p.; 2009.
Supervisor: Mitra, Suman K.
Keywords: Digital Watermarking; Independent Component Analysis; Multiple watermarking; Spread Spectrum
Abstract: An effective way to ensure copyright protection and security of digital images is digital
watermarking. This report compares and analyzes Spread Spectrum and Independent Component
Analysis techniques for watermarking digital images. As both these schemes exhibit complementary
robustness to a large range of attacks, we propose a novel hybrid which is double watermarked
using the two schemes. This hybrid is robust to a wide range of attacks.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Bagga, Sumit (200501038)

Experimental Evaluation of Dynamic Data Structure for Point Location Problem; 2 p.; 2009.
Chatterji, Samaresh
Dynamic Data Structure; External Memory; Planar Subdivision; Point Location
Point Location is a well-known problem in computational geometry with numerous applications in
graphics, geographic information systems, etc. In many of the applications, the data is massive and
has to be stored in external memory. In such situations, I/O performance becomes a critical factor.
It is proposed to experimentally evaluate the dynamic data structure put forward by Arge, Brodal
and Srinivas Rao.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Bagla, Sumit (200501223)

Performance Analysis Tools for ARM; 4 p.; 2009.
Banerjee, Asim
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Reddy, Allam Suresh, Engineer, Staff/Mgr, Qualcomm Corp.

Babylon; LTTng; Performance analysis tool.
To identify set of performance analysis tools for Linux OS based systems on ARM platform. The
focus is to analyze the tools, its granularity and accuracy, and provide support for them on the
Linux kernel to meet the requirements of BSP (Board Support Package) team of Qualcomm India
Ltd., Hyderabad.
Baphna, Ankit (200501220)
BREW MP Eclipse Plugin; 4 p.; 2009.
Banerjee, Asim
Simhadri, Arun Kumar, Engineer, Staff/Manager, Qualcomm India Pvt. Ltd.
Automation, brew; Build; Nmake.
Qualcomm introduces eclipse plugins for BREW MP which aids developers to develop BREW
applications on an open source platform. Main aim of Qualcomm behind these plugins is to give
the developers all the support that is needed to develop and test BREW MP applications on an
open source platform. This requires support on Eclipse IDE as an alternative for Microsofts Visual
Studio, CodeSourcery and RVCT as an alternative for ARM compliers and MinGW make/GCC
make as an alternative for Microsofts nmake to generate various .bid, .bif and .dll files. My project
is to make a template of the makefile that is compatible with CodeSourcery and RVCT toolchain
that uses functionality of MinGW make that can be used by the makefile generator to generate the
makefile needed to build the BREW MP project depending upon the options selected by the user.
Also I need to design the framework to test the BREW MP Eclipse plugin and schema to integrate
those with the build machine.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Baser, Puneet (200501178) and Mundra, Anik (200501231)

Broadband Beamforming; 4 p.; 2009.
C. Vijaykumar
SLC; SONAR; RADAR; ULA; UCA; DOA; MVDR; SVD; CDMA [5]
The report is projected for analyzing propagating waves thereby extracting signal parameters of
interest and detecting source location from where propagating wave is generated. We will be
discussing various narrowband beamforming algorithms followed by implementation and
simulating results of those algorithms. Beamforming is a technique employed for determining the
directions of propagation of several signals moving past an array. Traditionally, Adaptive
beamforming has been employed primarily in sonar and radar systems. It started with the invention
of the intermediate frequency sidelobe canceller (SLC) in 1959 by Howells. The concept of a fully
adaptive array was developed in 1965 by Applebaum [3]. Beamforming has wide applications in
areas of acoustics, SONAR applications and seismology and wireless communication applications
like RADAR applications.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Batra, Sangam (200501043)

Contour Extraction of Moving Object in a Still Camera Video; 5 p.; 2009.
Mitra Suman K.
Background subtraction; Contour; Convex hull; Frame; Gradient vector flow; Initialization; Snake
This report proposes an efficient approach for contour extraction of a moving object in a still
camera video. For the detection and tracking of moving object, an efficient background subtraction
technique proposed by Singh et al. is used. Gradient Vector Flow (GVF) model is used for the
purpose of contour extraction. The problem of manually initializing the contour in every frame is
addressed by automating the process of contour initialization. The automation is done using a fast
and simple technique. Results are shown for different videos towards the end of the report.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Bhagya, Rohit (200501040) and Gupta, Pawan (200501216)

Aperture Coupled Microstrip Antenna; 5 p.; 2009.
Gupta, Sanjeev
Aperture coupled microstrip antenna; Microstrip antenna; Return loss
Microstrip antennas have become immensely popular in recent times owing to their low
manufacturing cost and compactness and are being increasingly employed in microwave systems.
This paper first discusses basics of antenna and aperture coupled microstrip antennas and then goes
on to describe the design of a low cost aperture coupled microstrip antenna having a return loss of 37.8 dB at 1.4 GHz.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Bhargava, P. V. Vijay (200501121)

Polarimetric SAR Data Processing; 4 p.; 2009.
Banerjee, Asim
Polarimetric Radar; Speckle Filtering; Polarimetric Signature Extraction; RADARSAT Data
The European Space Agency developed a tool called PolSARpro to facilitate the accessibility and
exploitation of multi-polarized SAR datasets including those from ESA Third Party Missions
(ALOS PALSAR), Envisat ASAR Alternating Polarization mode products, RADARSAT-2 and
TerraSAR-X. Indian Space Research Organization (ISRO) has similar requirements of indigenously
made tool; fully customized to meet their specific conditions. In this report, I have attempted to
describe the basics of Polarimetry required for understanding the applications of POLSARPRO.
The definitions are followed by brief descriptions of the modules implemented.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Bhatia, Nitesh (20001071)

Parallel Query Optimization for Join Framework of Pig Latin; 4 p.; 2009.
Chaudhary, Sanjay
Pig Latin; Hadoop; Parallel query processing; High-level language.
In present era of Internet dominated market, large scale Parallel-Processing data-flow systems have
attracted attention. Pig Latin is a high-level data-flow language that has been build on Hadoop - an
open source map-reduce implementation. This language provides greater transparency in structure
of program and has opened path for automatic optimization. This report proposes optimization
strategies for Join framework of Pig Latin based on Parallel Query
Processing techniques. Through optimization we believe that this will trigger a mass migration from
low-level programming (like direct Map-Reduce or Dryad) to high-level programming (like Pig
Latin)
Author: Bikualla, Avinash (200501227)

Title: Predict Neural Networks Output more Accurately Using OpenMP Application Program Interface
(API); 4 p.; 2009.
Supervisor: Chaudary, Sanjay
Keywords: Backpropagation algorithm; Data mining; Hyperthreading technology; Message passing interface;
multithreading, Neural networks, OpenMP.
Abstract: One of the tasks of Data mining is to classify and predict the data from a large repository of
databases. By analyzing the data from different domains, useful information can be extracted. A
neural network is an example of data mining classification techniques. Neural networks have to be
trained before they can be used for prediction of data. This requires large repository of
computational power. If they are trained sequentially, it takes a large amount of time; therefore it is
better to implement those using parallel programming techniques. Usage of OpenMP API on Intel
multi-threading architecture will give good results. After implementing this model, we are testing the
performance of this model by comparing the performance of this model in different environments.
Author:
Title:
Supervisor:
On Site
Supervisor:
Keywords:
Bontha, Srikanth Reddy (200501120) and Dasksha Gouri

PC-Based Tool for Comprehensive Test Application; 4 p.; 2009.
Jat, P. M.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Boppudi, Ravi Teja (200501214)

No-Three-in-Line Problem; 4 p.; 2009.
Chatterji, Samaresh
No-Three-in-Line; Jainendra K. Navlakha's Algorithm
In this project, one of the unsolved problems in Mathematics, No-three-in-line problem, is solved
for even squared matrices using Jainendra K. Navlakhas algorithm[1] and the algorithm developed
by me.
Sridhar, Nomula, Engineer, Qualcomm India pvt Ltd., Hyderabad
CTA (Comprehensive Test Application); FTA (Functional Test Area); XML (Extensible Markup
Language); BREW (Binary Runtime Environment for Wireless systems); WM (Windows Mobile).
Abstract: Comprehensive Test Application is an embedded application that resides on the phone and helps in
testing various modules present in the phone.Our project objective is making a desktop application
for Comprehensive Test Application which will reduce the users effort in using Comprehensive
Test Application to a very considerable amount and also improves the efficiency.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Chandra , P. Satish (200501126)

Optical Character Recognition; 5 p.; 2009.
Joshi, Manjunath V.
Bagaria, Venkatesh, Siemens
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chandra, Sakshi (200501101) and Agarwal, Somya (200501186)

Acyclic Orientation of Undirected Graphs to Maximize Reachability; 4 p.; 2009.
Amin, Ashok T.
Acyclic Orientation; Reachability; Undirected graph.
Let G be an undirected graph with n vertices and m edges. (G, R) denotes acyclic directed graph
obtained from undirected graph G by acyclic edge orientation of G. Let r(G, R) denotes the
reachability of (G, R). The problem is to find an acyclic orientation (G, R) of G such that r(G, R) is
maximized.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chaplot, Vikrant (200501057)

Bluetooth Security Using Identity Based Encryption; 4 p.; 2009.
Das, Manik Lal
Bluetooth security; Elliptic curve cryptography; Identity based Encryption; Strand spaces.
The Bluetooth is a wireless technology which is used to transfer voice and data between Bluetooth
enabled devices separated by short distance. Since the medium of transfer is wireless, securing data
becomes utmost important. Most of the security features used in Bluetooth today are based on
symmetric key cryptography having a drawback that the user has to manually enter the secret
passkey into both the communicating devices. In this paper we present one Bluetooth security
protocol based on Identity Based Encryption. It uses the identity of a device to encrypt the data.
Here security relies on Elliptic Curve Discrete Logarithm Problem. We also present a formal proof
of correctness for the proposed protocol using Strand Space Technique.
OCR; MSER; CSER; Pattern Matching; Sauvolas Thresholding and UnionFind

The report consists of different approaches by which a robust machine vision OCR (Optical
Character Recognition) can be implemented. A modular approach, a pattern matching approach
and an approach using MSER (Maximally Stable Extremal Regions) was looked at keeping in mind
the simplicity and speed of the algorithm in order to be able to run on embedded hardware.
Cheedi, Kalyan (200501225)

Algorithms for finding a Minimal Dominating Set in a Graph; 5 p.; 2009.
Chatterji, Samaresh
Maximal independent set (MIS); Minimum connected dominating set (mCDS); Virtual backbone,
ad-hoc networks.
Abstract: The project relates to an application of graph theory in wireless ad-hoc and sensor networks. The
challenge to this field of networks is that the medium and user are mobile or are dynamic in nature.
Motivated by the concept of search in a virtual backbone set up is the solution to the problem of
minimal Dominating set (MDS) which finds applications in routing and connectivity in wireless adhoc networks. Also involved with this problem is the problem of maximal independent set (MIS).
Solution to MIS makes it easier to implement the problem of MDS. The work in the project
includes implementing and comparing two algorithms, which are different in approach, by analyzing
their performance for different cases of connectivity and the number of nodes in the ad-hoc
network.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chitneni, B. K Nagarjuna (200501144)

OLAP Technology for Business Intelligence Analytics System in Retail Enterprises; 4 p.; 2009.
Banerjee, Asim
Online analytical processing (OLAP); Intelligence analytics system; Database model
The relational database model is probably the most frequently used database model today. It has its
strengths, but it doesnt perform very well with complex queries [1] and analysis of very large sets of
data. As computers have grown more potent, resulting in the possibility to store very large data
volumes, the need for efficient analysis and processing of such data sets has emerged. The concept
of Online Analytical Processing (OLAP) was developed to meet this need. Now a days Business
Intelligence applications are powered by OLAP software. OLAP produces a new generation of
analysis and reporting capabilities through customized cubes, where critical business processes in
an enterprise, such as product, month, and number of sales are represented as dimensions in the
cube. OLAP represents a major improvement in reporting and analysis because the cubes import
from existing databases, spreadsheets, data warehouses, and data marts into a far more flexible and
powerful reporting and analysis application. Our Project OLAP Technology for Business
Intelligence Analytics System deals with Analytics module to analysis day to day operations based
on reports chosen by the retailers.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chittor, Aditya (200501129)

Design Pattern Recognition Using DSM; 5 p.; 2009.
Jat, P. M.
Design pattern; Dependency structure matrix.
Design patterns form a very important part in object-oriented programming. Identifying the design
patterns can make repairing, reverse engineering or analyzing the architecture of software much
simpler. A Dependency Structure Matrix (DSM) is used to display all the dependency in the
software in a tabular form. The DSM can be used to analyze and spot the patterns. It is also a
convenient way to represent them. Design patterns are of 3 types: structural, behavioral and
creational patterns. I have developed a tool to identify structural patterns in software source code
(Java only). The tool extracts dependencies from a matrix using conventional static analysis. This
data is then used to identify within the software three standard structural patterns including
Adapter, Proxy and Decorator. An algorithm is developed to efficiently identify the pattern.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chouhan, Kishan Singh (200501028)

Activity and Budget Monitoring System for ATMA; 10 p.; 2009.
Chaudhary, Sanjay
Information system; ATMA; Activity; Monitoring; Reports; Session bean; Web Service.
This Project is intended to develop an information system for ATMA to enhance its capabilities for
effective monitoring of activities and budget. Developed system also enables ATMA authorities to
do queries to the system like compare between two or more activities and generate results as a
report and in a graphically manner too for better analysis. System also provides support for
preparation of ATMAs monthly, half yearly and annual reports. For implementing this system I
have used Enterprise Java Beans architecture. Session beans are responsible for all functionalities
and they can be exposed as Web Services to make this information system worldwide. I have
exposed few session beans as web service as a part of this project.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chauhan, Sidhartha (200501164)

Designing CIL Connector to Scyther; 3 p.; 2009.
Mathuria, Anish M.
CAPSL; CIL; Scyther; Parser; Connector; JAVA.
In this report we shall take a look at the concepts behind building a parser in JAVA and later we
shall go into details on how to build a parser which parsers the CIL input and produces Scythers
tool specific language as output. This parser is the Connector we desire.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Chowdhary, B. Aneesha (200501146)

Development and optimization of CMOS Structured ASIC Libraries; 4 p.; 2009.
Mandal, Shushanta
ASICs; Design; Structured ASICs; Standard cell library
As we all know, a new category of devices - Structured ASICs are increasingly becoming available to
fill in the gap of the programmability spectrum, which consists of FPGAs at one end and the
standard cell ASICs at the other end. Structured ASICs have adopted best features of FPGAs and
standard cell ASICs. They are closer to FPGAs in terms of cost and lesser turn-around design times,
and closer to ASICs in terms of low power and performance. This paper addresses issues related to
development and optimization of CMOS structured ASIC libraries. Challenges and problems
related to development of 65nm and 45nm technology library are addressed. Since technologies are
rapidly changing, the cell library has to be developed from scratch more frequently. Building of
these high performance cell libraries not only reduces time and cost of generation and maintenance
adequately (enabling new technologies to adopt quickly) but reduces design cycle to half.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Daggumati, Pallavi (200501122)

Hafnium Oxide Gate Dielectrics for Microelectronics Applications; 6 p.; 2009.
Mohan, S.
Post deposition annealing; Post metalization annealing; Breakdown voltage; Leakage current.
The project undertaken involves the study of the role of Hafnium Dioxide (A high-K dielectric) as a
replacement for Silicon dioxide in CMOS technology, electrical characterization of the fabricated
MOS capacitors and analysis of experimentally obtained device parameters. HfO2 film has been
deposited by Electron Beam Evaporation. Post Deposition Annealing and Post metallization
annealing of the sample has been done. Capacitance-Voltage analysis, I-V analysis of the sample pre
and post annealing has been performed.
Daiya, Abhishek (200501075)

Lifestyle Modificator; 4 p.; 2009.
Roy, Anil K.
Intermittent Network Aware Mobile Application; Connected Limited Device Configuration; Mobile
Information Device Profile; Resting Energy Expenditure.
Abstract: Lifestyle is the way we live our life; what we eat, how and when we eat, how much we exercise, how
we cope with stressful situations. Lifestyle Modification is a proactive approach towards optimum
health & wellness by bringing about appropriate changes in the way you live to Live Life More.
Today there are lots of resources available over net for providing information about the food we eat
but the way we live today in a fast running world. But this information is not handy as on date. Also
nobody has the time to go through a book, or on the internet to search for contents in our diet. The
need of hour is to provide such information fast and easily. This is the project to build a mobile
application which could provide information easily and keep track of calorie intakes of a person.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Dantuluri, Udaya Bhaskar (200501145)

Robot Motion Planning; 4 p.; 2009.
Chatterji, Samaresh
Robot motion; Motion planning; Probabilistic roadmap method
Robotic Motion planning using probabilistic roadmap method is split into two phases they are the
construction phase and query phase. In construction phase we construct a probabilistic roadmap in
configuration space. This roadmap is a graph where nodes and edges correspond to randomly
chosen configurations in free space and simple collision-free motions between the nodes
respectively. These motions are computed using a local method. In the query phase we use this
roadmap to find shortest paths between different pair of configurations.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Dargar, Apurva (200501175) and Mundra, Ankit (200501219)

A Novel Design for a Current Feedback Amplifier; 6 p.; 2009.
Parikh, Chetan D.
Current feedback amplifier; Current conveyor; Unity gain buffer.
Current Feedback Amplifiers (CFA) are discussed in this report. A detailed analysis of the
complexities involved in designing a Current Feedback Amplifier with a suitable gain at high
frequencies is undertaken. Various modifications made to the distinct stages of a Current Feedback
Amplifier to suit to the specifications are elaborated in this report. Novel Current Feedback
Amplifier architectures, which employ Buffers with low output impedance and Current Conveyors
with very high output impedance are proposed in this report.
Author: Das, Aniruddha (200501052) and Ramnani, Vikas (200501044)

Title: Improvised filter designs for Performance Enhancement of Depth Estimation Using Single
Monocular Images; 10 p.; 2009.
Supervisor: Mitra, Suman K.
Keywords: Computer vision; Depth estimation; Monocular cues; Filter designs.
Abstract: Depth Estimation from Images using monocular cues is a cumbersome process. A number of
methods have been developed for depth prediction. Techniques for depth prediction from static
images include using binocular vision, focus-defocus, stereo vision and single monocular images.
We have discussed the current technique being used in the depth prediction mechanism being used
for depth estimation from single monocular images. A number of filters are used to extract key
image characteristics. The filters used have been applied at multiple scales to take into account local
and global features. The Gaussian model is used for machine training. Here an attempt has been
made to design a filter for a more generic application of Depth Estimation algorithm from Single
Monocular Images, so as to reduce the size of the feature vector being used for machine learning.
We have altered the filters, in place, so as to decrease the size of the feature vector to improvise the
results for constrained environments or provide an equivalent quality of result as in the previous
papers. This paper introduces filters that reduce the complexity of the algorithm required for depth
estimation by reducing the size of the feature vector. The filter presented here has been optimized
for texture gradient feature extraction. This paper also introduces a post prediction fourth degree
equation to improvise the result predicted by the trained Gaussian model.
Author:
Title:
Supervisor:
Co-Advisor:
Keywords:
Abstract:
Das, Prabhu Dutta (200501137)

Mobilizing Community Health Workers to Improve Maternal Health in India; 6 p.; 2009.
Banerjee, Asim
Ramachandran, Divya, PHD Candidate, University of California, Berkeley
Accountability; ASHA; Persuasion; Training.
Using community health workers in preventive health interventions can play a pivotal role,
especially in frontier communities. However, their potential role as health promoters is handicapped
by issues beyond their control. Issues in training, acceptance and accountability restrict their self
efficacy in promoting health information addressing-leading causes for mortality in developing
communities. In this report we discuss the possible mobile-technology intervention for facilitating
persuasive health information aimed at reproductive health. The fact that the phone can be carried
to the client and used for immediate displays makes for an interesting ubiquitous platform. The
platform provides scope not only for building persuasive applications but also for collecting
information which can be mapped to behavioral changes. We discuss design artifacts for one such
application- ASHA SAHAYAK, its working and import.
10
Author:
Title:
Supervisor:
Keywords:
Abstract:
Dayal, Akash (200501048)

Vehicle Make and Model Recognition; 4 p.; 2009.
Raval, Mehul
Hamming distance; Harris-plessey corner detector; Still image camera; Vehicle recognition
With the increasing number of vehicles on the roads a necessity for monitoring the traffic arises. An
aspect of traffic monitoring is to determine the model and make of the vehicles. I propose to
implement a method to recognize vehicles model which is based upon background subtraction,
feature extraction by corner detection and feature matching by a hamming distance based metric
against a standard predefined database.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Dholakia, Rounak (200501078) and Abhinav Krishna (200501087)

A Case Study in System Dynamics; 6 p.; 2009.
Chatterji, Samaresh
System dynamics; Nonlinear dynamics; Feedback control; Simulation software
System Dynamics is grounded in the theory of nonlinear dynamics and feedback control developed
in mathematics, physics, and engineering [1]. It is a very powerful tool to obtain insight into
complex dynamics systems. Even a system which appears to be very simple perfunctorily turns out
to be complex after analysis through this approach. System Dynamics involves interpreting real life
systems into computer simulation models that allow one to see how the structure and decisionmaking policies in a system create its behaviour.
Author: Dhulipala, Hima Kireeti Srikanth ( 200501136)

Title: High Performance Implementation of Pulsed OFDM for Ultrawideband Communications; 6 p.;
2009.
Supervisor: C. Vijaykumar
Keywords: Multiband OFDM modulation; Pulsed OFDM; Raised cosine window function.
Abstract: In this report, we have mainly described an approach to the implementation of the multiband
orthogonal frequency division multiplexing (MB-OFDM) ultrawideband (UWB) systems which
gives higher performance than the conventional implementations by applying the ideas of pulsed
OFDM. By pulsating the normal OFDM symbols with a duty cycle of less than 1, we are achieving
a diversity gain given by inverse of the duty cycle of the pulses. The pulsed OFDM can simply be
generated by replacing the digital-to-analog convertor (DAC) in an OFDM transmitter with a pulse
train generator. The generator produces amplitude-modulated pulses with duty cycles of less than 1.
This gives a closer approximation of the signal thus improving our estimation.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Dubey, Ojas (200501107) and Lalwani, Vishal (200501117)

Semantic Web for Agriculture Production (SWAP); 4 p.; 2009.
Chaudhary, Sanjay
Semantic web; Ontology; OWL; RDF
The content available on the World Wide Web today is meant for human consumption. In the
present web scenario the term information retrieval is quite misleading. The semantic web approach
is to present only relevant information to the user based on certain concepts and the relations
between them. Moreover, it deals with replacing the current web pages with ones that carry machine
processable content along with the formatting information. This can be achieved by maintaining the
data in the form of ontologies and using query builders to extract information from them. This
project aims to propose an agriculture information system based on semantic web. The information
system, unlike existing system, is not based in key word based search but rather uses a new
approach of dynamic query generation based on user input for context base search.
11
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gadde, Apuroop (200501092)

Depth Estimation in a Low Depth of Field image; 4 p.; 2009.
Joshi, Manjunath V.
Object of interest; Depth of field; Defocus.
A low depth of field image belongs to a specific category of images which comprises of only two
types of pixels. Pixels those are either part of object of interest (OOI) or otherwise. This report
proposes a method to obtain the depth information in such kind of images using the concepts of
higher order statistics and wavelet transform. In a typical Low Depth if field image the OOI is
sharp or in other words focused and the remaining part of the image is blurred or defocused. We
discuss a method the separate the OOI from the background and also estimate the distance
between the OOI and the background.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gadde, Ramachandra Rao (200501132)

A Randomized Linear Time Algorithm to find Minimum Spanning Trees; 4 p.; 2009.
Chatterji, Samaresh
Minimum spanning tree; Algorithm; Kruskals algorithm; Karger, Klein and Tarjan Algorithm.
Minimum spanning tree is tree with minimum edge weights in a weighed graph. Many algorithms
have been proposed to find the Minimum Spanning Tree in a weighted graph. One such algorithm
is Karger, Klein and Tarjan Algorithm which is a randomized linear time algorithm to find a
Minimum Spanning Tree in a connected graph with edge weights. The aim of the project is to study
the algorithm, implement it and compare it with other existing algorithms.
Author: Gaddh, Rohan (200501106) and Jain, Khyati (200501235)

Title: On-Line Fair Resource Allocation Scheme in OFDMA Systems Using Cooperative Game Theory; 5
p.; 2009.
Keywords: Fairness; Game Theory; Nash Bargaining solution; OFDMA scheduling; Online Scheduling
Abstract: This report talks about the problem of resource allocation in Orthogonal Frequency Division
Multiple Access (OFDMA) systems like WiMAX and 3GPP LTE. The resource allocation schemes
can be classified into four categories based on their primary objectives: fairness, system throughput
maximization, power optimization and QoS guarantee. A proportionally fair on-line algorithm has
been devised to allocate sub-carriers to the users based on the rates at which they choose to
transmit. Once the sub-carriers are allocated fairly by Nash Bargaining Model, they are dynamically
shuffled between the users as the transmission rates change; in order to minimize the cost and
maximize the system throughput.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Garg, Amit (200501232) and Jindal, Puneet (200501239)

Development of GSM Protocol through LPC2106 Microcontroller; 5 p.; 2009.
C. Vijaykumar
ARM7TDMI-S; GSM; LPC2106; SIM300 modem; Microcontroller
GSM is Global System for Mobile Communication. It is the technology of voice and data
transmission with the help of authenticated SIM card. This is widely used on end user side in
telecommunication networks. Our project intends to develop a GSM protocol to control devices
remotely by sending specific SMS message from a cell phone. Project is implemented using general
purpose 32 bit microcontroller LPC2106. This report consists of basic hardware description, project
setup and implemented protocol.
12
Author:
Title:
Supervisor:
On site
supervisor:
Keywords:
Abstract:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Garg, Sagun (200501098)

Robust Design for M-Banking Client Application on Mobile using Design Patterns; 9 p.; 2009.
Banerjee, Asim
Murthy, Siddalinga, TCS-Qualcomm
M-Banking; Robust Design; Design patterns; Client Mobile Application Design Metrics.
M-banking is an important channel for banking services, and in emerging markets, provides some
possibility for becoming a primary channel. With mostly object oriented applications becoming
successful in the market it is an obvious choice for our design. There are two purposes of this
thesis. First, to look into the microarchitectures (object structures) static and dynamic relations
among objects (and/or their classes) encountered in object-oriented development of client mbanking application. And second, to quantify the quality of de sign. Objects should communicate
without becoming entangled in each others data models and methods. Design patterns are used to
keep classes separated and prevent them from having to know too much about one another. Loose
coupling for flexible design and encapsulation has been an objective of good object oriented design.
Measuring has been the basis for science and engineering since the middle ages. Measurement is
necessary so as to improve the software design, assisting in assessing the quality of a project. By
using design metrics, a designer can correct software defects which otherwise generally become
huge design overheads as the project progresses.
Gopi, Nitin (200501022)
Semantic Search Engine; 4 p.; 2009.
Chaudhary, Sanjay
Index; Latent semantic indexing; Search engine; Singular value decomposition.
The content of the World Wide Web is useful to millions of people. The information seekers use a
search engine to begin their web activity. Users submit a query, typically a list of keywords, and
receive a list of web pages that may be relevant, typically pages that contain the keywords. Although
the search engines are very helpful in finding information on the Internet, they suffer from the fact
that they do not know the meanings of the terms and expressions used in the Web pages and the
relationships between them. The aim of this work is to show how better algorithms like Latent
Semantic Indexing can be used for indexing.
Gowtham Srinivas P. (200501090) and Reddy, D. Ravindra Kumar (200501094)

Developing Ontology for Indian Technical Institutes; 5 p.; 2009.
Jat, P. M.
Ontology; OWL; Semantic web; Objective Developing ontology for Indian Technical Institutions
(Typically considering IITs and other premier Institutions).
Abstract: In the present web, databases are made available in some form where users, application programs,
and uses are open-ended and ever changing. In this scenario we should have data along with its
semantics. For human users we can present this data with some presentation form, but for
application programs and software agents these semantics has to be provided in machine
understandable and processable form. The ontology includes machine-interpretable definitions of
basic concepts in the domain and relations among them. As the research done is little to develop a
knowledge base in the field of education, we choose to develop ontology for the domain Indian
Technical Institutions. It includes concepts such as Institutes, Departments, Faculty, Programs,
Research Areas, and Cutoff ranks for Program.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Goyal, Abhas (200501036) and Gupta , Rubish (200501070)

Portfolio Optimization; 6 p.; 2009.
Chatterji, Samaresh
Optimization methods; Market optimization; Stock optimization
The purpose of the project is to study the theory presented in the paper by Thomas Rossier [1],
First, to validate the implementation of strategy on a simulated market and then apply this strategy
13
on the stocks of real Indian stock market.

Author:
Title:
Supervisor:
Keywords:
Abstract:
Goyal, Ankush (200501063) and Mishra, Abhinesh (200501155)

An Optimized LVQ algorithm for Multi-interval Discretization of Continuous Values; 5 p.; 2009.
Chaudhary, Sanjay
Multi-interval discretization; Learning vector quantization; Genetic algorithm.
Discretization of continuous valued features is an important problem to consider during
classification learning. There already exist a number of successful discretization techniques based on
LVQ algorithm. In this work, we have approached the problem of discretization from a different
angle, and have proposed an algorithm based on optimization of Learning Vector Quantization
(LVQ) with Genetic Algorithm (GA). LVQ has been employed to function as a classification
algorithm and discretization is performed using this classification nature of LVQ algorithms. We
have modeled a GA based algorithm, which enhances the accuracy of the classifier.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Goyal, Deep (200501061)

Ontology Matching; 10 p.; 2009.
Jat, P. M.
Ontology; Ontology matching; Semantic web
In todays world of semantic web where efforts are being made to make data over the web to be
machine processable, ontology is playing an important role. But in present scenario, several
ontologies are developed by various organizations. They use their own taxonomies and
vocabularies. Because of this, interoperability between ontologies is difficult and hence arises the
need of ontology matching. This project aims to demonstrate the concept of ontology matching
using two heterogeneous ontologies.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Goyal, Gourav (200501105)

Public-Key Cryptography Using Paraunitary Matrices over Fields of Characteristic Two; 4 p.; 2009.
C. Vijaykumar and Das, Manik Lal
Public-Key Cryptography; Multivariate cryptography; Paraunitary Matrices; Finite-Fields.
A very important issue in the area of cryptography is to build the system faster, efficient and
secured enough. Although the RSA is secured but still it has some practical problems mainly, keysetup time and size of key. These problems can be solved by multivariate cryptography. There have
been many schemes developed since last few years. To design a multivariate cryptosystem, Dr. F.
Delgosha and Dr. F. Fekri proposed an algebraic approach which is based on formulating a general
system of multivariate polynomial equations by paraunitary matrices and given the name as
Paraunitary Asymmetric Cryptosystem (PAC). A trapdoor one-way function has been designed over
the fields of characteristic two with some approximations to paraunitary matrix. This function is
used for encryption/decryption. It has been claimed that the proposed cryptosystem is secured
against the attacks developed for Hidden Field Equations (HFE). As a conclusion, during my BTP,
I have worked and understood the concepts of PAC very clearly by giving a complete analysis of
PAC.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Aakar (200501025) and Saini, Milan (200501034)

Formal Analysis of Hierarchical Key Assignment Schemes; 6 p.; 2009.
Mathuria, Anish M.
Key management schemes; Hierarchical key assignment; Diffe-hellman calss of protocol
In this work, we study the problem of formal analysis and provable security in key management
schemes, with focus on the hierarchical key assignment schemes (HKASs). We highlight the
absence and henceforth the need for a proof model in such schemes which handles their dynamic
aspect. We then present a new automation tool which models an existing algebraic scheme to verify
the Diffie-Hellman class of protocols (DHCPs) and extends it for various security attributes. We
formulate the model to enable a novel approach of formal analysis of a HKAS based on the
14
DHCPs which is supported by the automation tool as well, and which considerably eases the
process.
Author:
Title:
Supervisor:
On site
Supervisors:
Keywords:
Abstract:
Gupta, Abhishek (200501068)

Development of C Simulator for AWG based analog & digital video interface; 4 p.; 2009.
Dubey, Rahul
Sharma, Vivek Mohan and Gupta, Navneet
Set-Top box; Arbitrary waveform generator; Flexible digital video output formatter
This report explains about the microcontroller known as Arbitrary Waveform Generator, which
enables to generate any arbitrary waveform using a very simple programming language. The
Arbitrary Waveform Generator with some added hardware can be used to generate copy protection
pulses, vertical blanking and horizontal blanking pulses. One of the major applications is that it
increases the flexibility of transferring the video signal in any required standard. This report also
contains the architecture of the C model of the applications involving Arbitrary Waveform
Generator. The C model which is actually the exact replica of the hardware helps in verification of
the different firmwares developed for the different video standards.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Amit (200501035)

Extending Cursor : A New Technique for Enhancing Target Acquisition; 4 p.; 2009.
Jotwani, Naresh D.
Fitts'law; Interaction Technique; Pointing; Target acquisition.
In this paper we present Extending cursor, a new technique for capturing targets. This technique
attempts to reduce the movement time to acquire the target by reducing the distance of movement
between target center and cursor position. Extending cursor technique uses two cursors in which
motion of one cursor is controlled by the other. In order to capture the target on large screens
which are becoming more popular nowadays, user employ more hand work and fast mouse
movements. This makes the entire pointing process cumbersome thereby making it uneasy to keep
track on the cursor. We propose a new design to improve pointing task by making less hand
movements.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Anurag (200501033)

Coreference Resolution using Inductive Logic Programming; 4 p.; 2009.
Pandya, Abhinay
Annotated corpus; Coreference resolution; Entity; General theory; Mention.
Coreference Resolution is one of the major tasks involved in understanding of human languages by
a computer. Various algorithms, models have been proposed to resolve the mentions of a particular
noun phrase in a text. Inductive Logic Programming is a new thought to address the same problem
and seems to be more promising and more concrete in formal representation of a human language
which can be easily understood by a computer. The project therefore aims at using Inductive Logic
Programming to generate general theory which can be used by a computer to resolve mentions of
entities in an annotated corpus.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Divyank (200501190)

File system for Real Time Applications with Continuous Media; 4 p.; 2009.
Divakaran, Srikrishnan
Admission Control; Continuous media; File system, disk layout
Continuous media services are soft real-time applications that require file system services that can
provide time guarantees. Also delivery of data should satisfy application specific quality of service
parameters. Conventional file systems are not optimized for continuous media and do not allow
clients to influence placement strategy. This project proposes a design for a file system which
attempts to provide effective admission control and file layout policy for continuous media
15
applications. The file System metadata is modified to increase the efficiency of storage of
continuous media data and issues with multiple disk data management are handled.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Rohit (200501064) and Somani, Abhishek (200501077)

Web Service Discovery and Composition; 6 p.; 2009.
Chaudhary, Sanjay
BPEL; UDDI; Web services; Web services composition.
Web service is becoming the next generation of web based application because of their accessibility
and compatibility. As the number of available Web services increases rapidly, HOW to locate the
suitable Web services is a big challenge. The process of locating or discovering of Web services is
known as Web Service Discovery. But only finding and selecting the suitable services isn't enough,
composition of these services to a desired output is also a big issue. This paper provides a brief
overview of Web service technologies and focus on the Universal Description, Discovery, and
Integration (UDDI) which is a standard for publishing and discovery of Web services. Finally, this
paper will also discuss the composition mechanism for Web services using Business Process
Execution Language (BPEL).
Author:
Title:
Supervisor:
Keywords:
Abstract:
Gupta, Sachin (200501176)

Secure Data Transmission Protocol for Distributed Wireless Sensor Networks; 5 p.; 2009.
Das, Manik Lal
Pairwise key establishment; Public key cryptography; WSN security.
Wireless Sensor Networks (WSN) is a special type of networked systems characterized by severely
constrained bandwidth, computational and energy resources. WSN is gaining popularity in
commercial and military environment but due to its peculiar characteristics it is prone to vulnerable
attacks, thus secure data transmission is now becoming a major concern. Deriving an efficient and
robust solution for key establishment, providing authorization and data confidentiality for end-toend system has become a challenging task. This report addresses the problem of secure data
transmission in distributed WSN and also explaining the reason for reduced efficiency in existing
solutions. We propose a technique for Secure Data Transmission in Distributed Sensor network via
ECC and polynomial pool based key predistribution scheme.
Author: Gupta, Shekhar (200501010)

Title: A 0.7 Volt High Performance Three Stage OPAMP Using Forward Body Biased Technique; 4 p.;
2009.
Supervisor: Parikh, Chetan D.
Keywords: Bulk driven circuit; Depletion region; Frequency Compensation; Threshold voltage.
Abstract: In this paper we have designed a very low voltage three stage operational amplifier for biomedical
instrumentation in standard 0.18m CMOS technology, to obtain 90 dB dc gain, 20 Mhz gain
bandwidth product and 470 of phase margin. The operational amplifier (OPAMP) operates at a
supply voltage of 0.7 V. To make circuit stable we have applied single miller capacitance frequency
compensation technique. The high threshold voltage of MOSFET poses a major problem in
designing OPAMP at 0.7V. In order to overcome this we applied a dc voltage 0.35V at the bulk of
transistor. This reduced the threshold voltage of MOSFET. The circuit is designed with load
capacitance of 10pF.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Grandhi, Ravi (200501197)

Crop Estimation Model: Prediction and Simulation; 4 p.; 2009.
Chaudhary, Sanjay
Crop estimation; HPC; Agriculture.
In April 2008 the government of India imposed a ban on the rice export of the nation. During the
beginning of the year 2008 the global food market witnessed a price hike in almost all the
agriculture products. The reasons for the hike are very distinct and complex. The World Banks
16
Agriculture Unit predicts that the change is weather conditions was also a reason for the price
alteration. India is predominantly an agriculture state. The fluctuations in the food price effects the
life of billions of people. Hence a model to estimate the crops is necessary to further use it to
predict the prices of the crops. Since this involves heavy data crunching we need to use High
Performance Computing.
Iraveni, Ashok Kumar (200501111)
Algorithm for Converting SQL into Relational Algebra; 6 p.; 2009.
Jat, P. M.
SQL (Structured Query Language); Relational Algebra; Syntax; semantics; Relational Schema;
Relational model; Relations; Aggregate functions; Unary operator; Binary operator; Simple query;
Binary query; Complex query; Group by query; Projection; Selection; Union; Intersection; Cartesian
Product.
Abstract: Structured Query Language (SQL) is the dominant relational model data base language today,
comprising commands to define relational algebra objects (DDL Data Definition Language), and
commands for the data manipulation on relations (DML Data Manipulation language). In SQL
there may be some group of queries which are syntactically different but semantics of the queries is
same. But it is tough to predict which queries have same semantics from group of syntactically
different queries. In this report I will explain about how to find out such queries by following the
steps of algorithm proposed by me.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jain, Amit (200501081) and Pandey, Sumit (200501104)

Mash-Maker: An Integrated Framework for Developing Next Generation Mashups; 7 p.; 2009.
Chaudhary, Sanjay
Mashups; Next generation mashups; APIs; Integrated framework
The new age of the Web is defined by the socialization of content and the free availability of
information. As a part of this trend most major web application providers expose their services and
data via publically available APIs. Developers use APIs from multiple sources and remix the data to
provide the end user with a new application which has the best of many worlds. These applications
are called Mashups. Till now, the development of Mashups involved using multiple technologies
and getting multiple data sources to work together as one. The aim of Mash-Maker is to provide the
developers with a specialized framework that would help in them focus on developing and
perfecting their Mashup and also develop reusable components that they could use in future
Mashups rather than work out issues posed by various languages in working with each other. This
report describes the proposed framework in detail.
Jain, Anurag (200501027)

Virtual/Soft Token Based two-factor Authentication; 4 p.; 2009.
Das, Manik Lal
Authentication; Virtual/soft token; Virtual Smart Cards; Hard token; One way hash function; one
time password (OTP).
Abstract: The security vulnerabilities and thefts are increasing nowadays that represents the weakness of static
password based authentication system. This causes the significant financial/brand loss to enterprise
and highlighting the fact that more robust, secure, multifactor dynamic authentication system is
required. I think that Two factor authentication using Hard tokens (Hardware Electronic Device),
and Soft token are next generation methods providing strong authentication using one time
password system. In this work we discuss the different authentication schemes with their positive
and negative points and finally discussed on Soft token based two-factor authentication.
Author:
Title:
Supervisor:
Keywords:
17
Author:
Title:
Supervisor:
On Site
Supervisor:
Keywords:
Abstract:
Jain, Anurag (200501050)

DDR2 SDRAM Model Verification Using Palladium and Axis; 4 p.; 2009.
Mandal, Sushanta
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jain, Chaitanya (200501041)

Dynamic Time Warping Based Approach to Dialect Recognition in Indian English; 4 p.; 2009.
Sarkar, Aditi Nath and Patil, Hemant
Linguistics; MFCC; DTW.
Speech has evolved as the primary medium of communication among humans. But some intricacies
distinguish one regional speaker from another. Such distinctions mark out the speech forms of one
group from another group as a language, and of a sub-group as a dialect. These styles make
speech, region and group specific. The differences still persist even if the speakers from different
regions speak in a foreign tongue, native to none of them.
Gupta, Piyush
DDR2 SDRAM; Emulator platform; Palladium; Verification plan.
Memories have been an essential component of various digital designs. New and improved memory
models are continuously being introduced in the market. Currently the most used and trusted
memory used is Double Data Rate2 Synchronous Dynamic Random Access Memory (DDR2
SDRAM). In order to verify a design it needs to be tested with an original DDR2 SDRAM. A high
amount of fee is paid to memory vendors to lease a memory module. ST Microelectronics
developed a memory module of its own to verify designs on emulator platforms. This project is to
verify this new memory module against established DDR2 SDRAM. Since this module is to be used
for two technologies, simulation acceleration and emulation, as a part of this project I implemented
the module with two tools. A comprehensive study and a comparative study of the two different
technologies are also presented in this report.
This project is aimed at analyzing how, in India, various regional speakers who are speakers of
different languages as their native language, differ from each other with respect to their
pronunciation of English. A Dynamic Time Warping based approach has been developed for a
dialect recognition system for Indian English.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jain, Manish (200501023)

Porting Free RTOS on Wild Cense; 6 p.; 2009.
Ranjan, Prabhat
Real time operating system; Wild cense; FreeRTOS; Real time.
WildCense is a wireless sensor network for studying behavior and movement patterns of wild
animals. It also gathers microclimatic and positional information of the animals. The whole system
is designed as a network of several nodes. Along with communication with various hardware units,
WildCense has to follow some timing constraints for completing its objectives. Achieving these
objectives becomes more difficult when sequential programming is used for implementing the
system. Therefore, keeping these requirements into consideration, aim of this project is to port
FreeRTOS, a real-time operating system on WildCense for bringing multitasking into the system
and fulfilling all timing constraints besides keeping the system simple and reliable. This report looks
into the workflow and architecture of WildCense with FreeRTOS.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jain, Mohit (200501088)

Is the Attack Valid? A Tool for Detecting Erroneous Attacks Found by Scyther; 5 p.; 2009.
Mathuria, Anish M.
Autonomic Framework; Formal Analysis; Attack Validation; Security Protocols.
Formal methods have been used for the analysis of security protocols and for detection of flaws in
them. However, a number of false attacks have been reported in literature. This is a serious problem
as good protocols might be rejected because of false attacks. In an autonomic framework, attacks
18
found by automated model checkers needs to be validated, as literature reports model checkers
producing false attacks. The two categories of false attacks reported by the model checker Scyther
are Senders Incomplete Knowledge Error (SIKE) and Ticket Attacks. In recent research, Anders
Hagalisletto proposed formal methods and developed a tool to validate attacks on protocols, but
the tool is not publicly available. In this paper, we propose novel formal approaches to detect false
attacks on security protocols under SIKE and Ticket Attack categories. We also developed a tool,
SPAA (Security Protocols Attack Analyzer), to automate the validation approach. SPAA reported
several attacks found by Scyther, to be false. SPAA also discovered falseness in attacks mentioned
in the standard libraries like Clark-Jacob and SPORE. We expect that in the future, attack validation
will become an essential part to determine the soundness of any attack.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jat, Madan Lal (200501177)

Service Mashups; 4 p.; 2009.
Jat, P. M.
Mashups; Rails; Ruby; Web2.0.
Web has evolved from a private network to a public enterprise. Most of new evolving services are
different and publicly available which are developed on standard protocols like REST and SOAP,
using tools RSS and Atom. These services make end-user powerful and the user can compose
services himself. This scenario gave birth to service mashups which typically provide solutions for
pointed problems i.e. for specific problems. This project intends to provide information to user in
the form of a service mashup by extracting information from heterogeneous sources such as Web
APIs, Web feeds and HTML pages and it is build on RoR web application framework. This
document describes design and implementation of Mashups.
Jha, Anju (200501167)

A Proof Technique for Greedy Algorithms; 5 p.; 2009.
Amin, Ashok T.
Greedy Algorithms; Lexicographic Ordering; Proof Technique; PSum (Product Sum) problem;
Scheduling problem.
Abstract: Greedy Algorithms are used to solve optimization problems and provide solutions that are simple,
straight-forward and easy to implement. Even though these algorithms are easy to design, they may
be difficult to analyze for correctness. We propose a technique to establish the correctness of
greedy algorithms. The technique is based on the proof of the PSum (Product Sum) problem. The
proof of correctness of greedy algorithms which can be posed within this framework can be
established. This report gives an introduction to the PSum problem and a demonstration of how
the technique is applied to several well-known greedy algorithms to prove their correctness.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Jhunjhunwala, Harsha (200501056)

Face Detection and Recognition; 5 p.; 2009.
Banerjee, Asim
Piriyakumar, D. Antony Louis, Siemens Ltd.
AdaBoost; Detection rates; Eigenface; Face detection; Face recognition; False negatives; False
positives; Nearest feature line.
Abstract: Face recognition deals with identifying or verifying one or more persons in a given still or video
image, using a stored database of faces. Face detection is the first step involved in face recognition.
We start with background removal, which separates the face from the non-face parts. It is done by
attempting to find face-like features in the given image. A method for detecting faces has been
presented in this report. The detected faces are then send for recognition. The second part of the
report presents a method for face recognition.
19
Author:
Title:
Supervisor:
Keywords:
Abstract:
Jindal, Nitesh (200501222)

Disk Scheduling Algorithms for Continuous media file systems; 4 p.; 2009.
Disk Arrays; File Placement; Hard Disk; Prefetching; Real Time Disk Scheduling Algorithms.
Existing file systems do not exploit features of disk arrays like striping, shadowing, de-clustering and
mirroring in designing disk scheduling algorithms. In this project, we attempt to design efficient
disk scheduling algorithms by exploiting these disk array features.
Author:
Title:
Supervisor:
On site
Supervisor
Keywords:
Abstract:
Joshi, Apurva (200501184)

Enabling MultiPoint in Educational Tools; 6 p.; 2009.
Banerjee, Asim
Author:
Title:
Supervisor:
Keywords:
Abstract:
Joshi, Prachi (200501237)

Automated Correction of Faulty Security Protocols; 5 p.; 2009.
Mathuria, Anish M.
Protocol analyzer (Scyther); Patching security protocols.
SHRIMP is an existing tool used for patching interleaving replay attacks in a protocol. It has its
limitations over classic replay attacks and type flaw attacks. Further we have shown a simple
technique which could be used in order to patch some Type Flaw attacks which were not targeted
so far by SHRIMP.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Josyula, Prakash (200501133)

Multimedia Content Encryption; 4 p.; 2009.
Das, Manik Lal
Cryptography; Partial encryption; Image compression.
The recent advances in multimedia technology and its usage have placed a great demand for
efficient storage and transmission of multimedia data. Transmission of data through a network can
be easily intercepted by eavesdroppers and must be protected. Various encryption techniques are in
place to achieve this data protection. In general, the encryption of multimedia data is carried out by
treating it as a regular binary sequence and encrypting it using a conventional encryption algorithm.
This approach of encrypting the entire multimedia data is often referred to as a nave approach.
This approach is often not recommended because it is computationally intensive and it cannot be
applied for real-time image and video communication and processing.
Hutchful, David, Kentaro Toyama, Microsoft Research India

Computer aided learning; Developing regions; Education; Multiple mice.
MultiPoint is a Microsoft technology that allows multiple people to simultaneously, each with their
own mouse, interact with a computer application. This technology has the potential to address the
uneven computer to student ratio in rural schools in India and other emerging economies.
However, the existing educational content and tools used in schools only support single mouse
scenarios. This paper discusses means and issues around the integration of MultiPoint Technology
with the existing educational content and tools.
Partial encryption is a method in which only part of the compressed data is encrypted using a secure
encryption algorithm and the rest is transmitted through the channel unencrypted. The technique
can be applied to images, audio and video data. These partial encryption techniques are faster,
secure and do not have any effect on the compression algorithms involved. In our project we have
explored the application of this partial encryption technique on images which are compressed by
Quadtree, JPEG, and JPEG2000 techniques. The aim of the project is to explore and analyze the
application of this method to various image, audio and video compression techniques and to
propose a new application to one of the known compression techniques.
20
Author:
Title:
Supervisor:
Keywords:
Abstract:
Kalra, Anshika (200501171)

Question Answering in Bio Medical Text; 4 p.; 2009.
Pandya, Abhinay
First order logic; Information retrieval; Natural language processing [NLP]; Question Answering.
Today web acts a database for storing and retrieving information. Search engines have made
possible to retrieve information in real time. Surfers retrieve information in the form of list of
documents for their questions. Question Answering technology in web aims to retrieve information
in more precise form and return results that are desired. Bio medical text can be considered as
closed domain. Today systems like EAGLi are present which allow retrieving answers to natural
language questions, but they also list documents. TREC genomics tries to improve text retrieval in
bio medical data. The main aim is to develop a methodology to enhance the precision of
information retrieved by breaking documents into paragraphs.
Author: Kalyampudi, Poornachand (200501158)

Title: Cross-layer Design for Multimedia Streaming in Cluster Based Adaptive Two-hop Wireless
Network; 8 p.; 2009.
Supervisor: Venkatraman, Hrishikesh
Keywords: End-user perceived quality; loss rate; average bit rate; Quality of service; Double dumbbell topology
and Multimedia streaming.
Abstract: Over the last few years, there has been a rapid increase in the demand for high quality multimedia
services in the handheld wireless device. This requires high data rate for both voice and video
transmission. By creating a system model which follows double dumbbell topology i.e. client nodes
acts as receivers, server nodes acts as transmitters (some times acts as receivers also). The main base
station (the central node) acts as major source for transmission. The major algorithms used here are
QOAS (Quality Oriented Adaptive Scheme), RBAR (Receiver Based Auto Rate) and EDCA
(Enhanced Distributed Channel Access). Cross layer designing follows here by combining QOAS
with RBAR and comparing over QOAS using double dumbbell topology that serves the purpose of
two-hop cellular network. By calculating PSNR (Peak Signal to Noise Ratio) values for the obtained
Hybrid QOAS and comparing it with the normal QOAS in order to show the performance of the
Hybrid QOAS.
Author: Karteek T. (200501211)
Title: Performance Analysis of Approximate Nearest Neighbor Searching for k-d and BBD trees; 4 p.;
2009.
Supervisor: Chatterji, Samaresh
Keywords: Approximate Range Searching; Balanced Box Decomposition Tree; Data Structures; Nearest
Neighbor Searching, Range Query
Abstract: Nearest neighbor searching is defined as finding the point closest in distance to arbitrary point from
a pre-defined set of data points. In many applications, it is sufficient to determine an approximate
nearest neighbor.
It is proposed to investigate the performance of the recently developed algorithm of Arya and
Mount which is claimed to have good performance in practical application.
Khandelwal, Swapnil (200501007)
Waste Monitoring System; 7 p.; 2009.
Roy, Anil K.
Classification of waste; Waste distribution pattern; Solid waste management (SWM) options; Buy
Back model.
Abstract: The project aims to develop a waste monitoring system for the municipal authorities to understand
the waste characteristics of an area and utilise the information in preparing a waste management
model which is effective and economically beneficial for all the elements involved in the waste
management system. Waste monitoring will be done through a systematic mapping of waste on a
Author:
Title:
Supervisor:
Keywords:
21
municipality map along with online monitoring of the waste lifting and dumping process.
Khanted, Ravin (200501240)
A Study on Kalman Filter and Estimation Techniques; 6 p.; 2009.
Mitra, Suman K.
Least squares estimation; Weighted least squares; Recursive least squares; Weighted recursive least
squares; Kalman filter.
Abstract: There are several estimation techniques available in estimation theory literature. I have attempted to
apply estimation techniques namely Least Square, Weighted Least Square and Recursive Weighted
Least Square techniques for curve fitting. Kalman Filter is also an estimation technique. These
methods are implemented using matlab. The performance of various approaches is demonstrated
by taking hundred data points with and without weights and estimating the straight line having the
least square error in Cartesian coordinate.
Author:
Title:
Supervisor:
Keywords:
Kishore, Anil (200501127) and Koneru, Tilak (200501228)

Parallel and Dynamic Graph Algorithms for Shortest Path Problem; 4 p.; 2009.
V. Sunitha
All Pairs Shortest Path (APSP); Dynamic Algorithms; Multiprocessors; Parallel Algorithms; Single
Source Shortest Path (SSSP)
Abstract: In this report, we look at parallel algorithms for the All-Paris Shortest Path (APSP) problem based
on matrix An and parallelizing some well-known sequential algorithms. We also look at some
algorithms for solving the APSP problem on dynamic graphs. We then propose some parallel
algorithms for solving the APSP on dynamic graphs.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Koganti, Nishanth (200501112)

Scheduling in Wireless Fading Systems using Cross layer Design Approach; 4 p.; 2009.
C. Vijaykumar
Orthogonal Frequency Division Multiplexing (OFDM); Finite State Markov Channel (FSMC)
Scheduling the users with the available channels while holding certain constraints and using adaptive
power-rate transmission scheme by a cross layer design approach in order to maximize the system
throughput. The channels taken are slow fading.
Author:
Title:
Supervisor:
On site
Supervisor
Keywords:
Konkimalla, Sravani Ratna (200501224)

Creation of Test Framework and Testing of WCDMA-AS Air Interface software; 5 p.; 2009.
Jat, P. M.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Kotapati, Sreekanth (200501095)

Channel Estimation using Pilots in OFDM Systems; 4 p.; 2009.
Joshi, Manjunath V.
Coherence Bandwidth; Doppler Spread; Inter Symbol Interference; Multipath fading.
Orthogonal Frequency Division Multiplexing (OFDM) is one of the emerging wireless technologies
designed to combat the issues of multipath fading environment. Channel estimation using pilot
symbols facilitates the receiver to analyze the wireless multipath fading channel. Channel
equalization is useful in the compensation of channel fading effects. Channel equalization uses the
Palaniappan, Vinoth
Wideband code division multiple access - Access stratum (WCDMA-AS); Offline build; Testing of
HHO and BMC procedures.
Abstract: Testing of WCDMA mobile software. This includes creating test frame work for WCDMA Access
Stratum, creation of test cases and execution of test cases and debugging of issues for wcdma access
stratum software.
22
properties of estimated channel.

Krishna, R.V.S. (200501150)
Non-homogenous AR (auto-regressive) Model Based Prior for Multi-resolution Fusion; 5 p.; 2009.
Joshi, Manjunath V.
Segmentation; E-M Algorithm; Auto-regressive model; Regularization technique; Multiresolution
fusion
Abstract: In this paper we propose a model-based approach for Multiresolution fusion of remotely sensed
images. Given a high spatial resolution & low spectral resolution PAN (Panchromatic) image and a
low spatial resolution & high spectral resolution MS (Multispectral) images on the same
geographical area, the objective is to enhance the spatial resolution of the MS images to that of the
PAN image. This is an ill posed problem and hence requires a proper regularization technique in
order to get a better solution. We use a non-homogenous AR (autoregressive) model based prior of
the PAN image and use the same parameters obtained from the segmented regions of the PAN
image to estimate the high spatial resolution fields for the MS bands.
Author:
Title:
Supervisor:
Keywords:
Krishna Teja, V. (200501124)

Vertex coloring problem and maximal independent set construction; 4 p.; 2009.
Chatterji, Samaresh
Vertex coloring; Maximal independent set; Wireless adhoc networks; NP-hard problems; Lubys
algorithm; distance -2 neighbors; Graph theory; message losses due to collisions.
Abstract: My project deals with vertex coloring problem of graph theory , in particular Lubys algorithm for
coloring the vertices and computing the maximal independent set. Lubys algorithm colors the
vertices based on the topology and the distance-2 neighbors. Successful coloring is organized in
phases and proceeds in a synchronous round by round fashion.
Author:
Title:
Supervisor:
Keywords:
Kuchipudi, Kashyap (200501212)

Evolutionary Algorithms for MultiObjective Optimization; 5 p.; 2009.
Chatterji, Samaresh
Evolutionary algorithms; Single Objective Optimization; Multi Objective Optimization; Pareto
optimal set.
Abstract: Most of the real world optimization problems are complex in nature.They usually have sinle
objective or multiple objectives.Multiple objective problems are characterized by distinct measures
of performance. Evolutionary algorithms are stochastic search methods for solution of optimization
problem that can be simulated computationally by evolutionary process.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Lakkaraju Ramesh (200501226)

FPGA Implementation of JPEG2000 Arithmetic Encoder; 4 p.; 2009.
Dubey, Rahul
JPEG2000; EBCOT; MQ encoder; Verilog, FPGA.
JPEG2000 is the most recent image compression standard which provides a large set of features
useful for wide variety of applications but it is more complex than previous standards. In this
standard encoding process takes about 70% of the processing time. In this paper three stage
pipelined architecture of arithmetic encoder is presented and also discusses the techniques for speed
enhancement. Architecture of arithmetic encoder is developed, implemented in verilog, synthesized
in FPGA Xilinx 8.2i.
23
Author:
Title:
Supervisor:
Keywords:
Abstract:
Lal, Siddhartha (200501046)

A Connector Between Scyther and SHRIMP; 6 p.; 2009.
Mathuria, Anish M.
Autonomic Framework; Connector; Scyther; Shrimp; Security Protocols.
In an autonomic framework where protocols are generated on the fly, checked whether they satisfy
all their goals, and then attacks on them validated for correctness, it becomes very essential to
minimize human interference. This is so because very often errors in the process are caused due to
human negligence. Thus there is a need for developing tools that can automate communication
between the different modules of such a framework. In this paper, we present an approach to
develop a connector that takes the graphical attack representation of a protocol checker, Scyther,
and converts it into a notation that can be used as input by a patching tool, Shrimp, thereby
minimizing human interference in the framework. To the best of our knowledge, no such
approach for a connector tool exists in literature on network security.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Lal, Suvansh (200501208)

Formal Verification of Security Protocols Using ALSP; 5 p.; 2009.
Das, Manik Lal
ALSP; Bluetooth security; Formal verification; Logic Programming; SPAK; Stable model semantics.
This report projects a simple and formal approach of protocol verification by embedding actions
into a Logic Programming reasoning. We use ALSP (Action Language for Security Protocols) as an
efficient formal specification language and smodels, a model generator to perform a formal analysis
of security protocols. We apply this technique for the formal verification of two recently proposed
key exchange protocols for Bluetooth technology, the SPAK(Simply Passkey-Authenticated Key
Exchange) and the APAK(Amplified Passkey-Authenticated Key Exchange). We also propose as a
consequence of our analysis that, the SPAK fails to meet its claims of forward secrecy and mutual
authentication. We repair the protocol based on our analysis and present the repaired protocol.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Manmeet Singh (200501181) and Kapoor, Vishav Vikram (200501234)

System Dynamics of IT & BPO Company; 8 p.; 2009.
Chatterji, Samaresh
Business process outsourcing Company; Feedback diagram; IT company; System dynamics.
The methods of system modeling provide us with tools of better understanding the difficult
problems of management. Instead of looking at the events and their causes individually it takes the
whole system into consideration. We are taking an IT company and a Business Process
Outsourcing (BPO) company as our two independent systems and then we model them according
to the variables that affect the performance of these organizations.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Macharla, Divya (200501148)

ASIC Design; 6 p.; 2009.
Dubey, Rahul
Pasirajan, Radhakrishnan Director : Engineering, Open-Silicon Research Private Limited
High Definition audio; Synthesis; Power planning; Design optimization constraints; Static timing
Analysis; Formal verification.
Abstract: The ASIC implementation of High Definition Audio Controller involved understanding of
architecture of the design and about the intellectual property used in the design, ensuring the coding
guidelines are followed, in the design, constraining the design. The design flow includes Logic
Synthesis of the Register Transfer Level (mapping to a target technology), Formal Verification, PreLayout Timing Analysis (using cell delays and wire load models) for initial understanding of the
designs post-layout performance, Floorplanning (including Power Planning, Input/Output
planning and Intellectual Property Placement), Placement of the design according to the
floorplanning (along with timing and area optimizations using techniques like buffering, sizing,
trimming, pin swapping, cloning), Clock Tree Synthesis, Routing and Post-Layout netlist
24
verification(Formal Verification)
Author:
Title:
Supervisor:
Keywords:
Abstract:
Madhavapeddi, Swetha Sri (200501199)

Development of a Secure Steganographic Technique; 6 p.; 2009.
Raval, Mehul S.
Blind Steganalysis; Histogram Abnormality; LSB; Quantization Index Modulation.
This project mainly aims at developing a secure steganographic technique which can successfully
resist the blind steganalysis methods. In this report, we have proposed a steganographic technique
called D-QIM which uses the concept of Quantization Index Modulation. This technique gives
more embedding capacity as well as it is resistive to JPEG compression attacks. It is also resistive to
various blind steganalyzers like Farid, PF-274.
Malviya, Ratnesh (200501019)

Distributed Vertex Colouring Algorithms based on Greedy Colouring; 4 p.; 2009.
V. Sunitha
Distributed graph coloring; First fit; Greedy graph coloring; Incidence degree ordering; Saturation
degree ordering.
Abstract: We consider some distributed algorithms for graph colouring. These distributed algorithms derive
their effectiveness from those graph colouring algorithms which are known to be effective in
sequential setting. We study the Distributed First Fit (DFF), Distributed Incidence Degree Ordering
(DIDO) and Distributed Saturated Degree Ordering (DSDO) algorithms. We compare these with
the Distributed Largest First (DLF) algorithm referred to as Distributed Largest Degree Ordering
(DLDO) in this paper on the basis of the number of colours used to colour a graph.
Author:
Title:
Supervisor:
Keywords:
Maremanda, Sudha Praveen (200501161)

Invariant Texture Analysis; 4 p.; 2009.
Joshi, Manjunath V.
Invariant texture analysis; Compactness; Perimeter contribution; Gabor filter; Area ratio matrix;
Invariant histogram; Polarogram; Zernike moments.
Abstract: This report gives some insight into the meaning of texture and the process of Invariant Texture
Analysis. This report addresses the problem of rotation, scale and translation invariant recognition
of images by Structural and Model Based methods. Structural Methods discussed are Perimeter
Contribution and Compactness and Invariant Histogram. Model Based method discussed is
multichannel Gabor filters. The statistical methods Polarogram and Zernike Moments are
discussed in brief.
Author:
Title:
Supervisor:
Keywords:
Author: Mathur, Akhil (200501215)

Title: Clozer - An Authoring Environment for Creating Interactive Classroom Learning Content; 5 p.;
2009.
Supervisor: Banerjee, Asim
On site
Hutchful, David and Toyama, Kentaro (Microsoft Research, India)
Supervisor:
Keywords: Classroom education; Computer-aided Learning; Developing regions; Human computer interaction;
User interfaces.
Abstract: Computer aided learning is increasingly becoming popular as a means to augment classroom
teaching in developing regions. It holds special significance for India, where the literacy rate is 65
percent, much below than the world average of 80 percent. 1 However, in the current usage
paradigm, computers are primarily used in a lab setting where students interact with applications
designed for self-learning. This leaves the teachers out of the learning loop, thus creating a gap
between the learning that happens in the classroom and the learning that happens in the computer
labs. This project aims to develop tools and applications that allow teachers to use computers in
classroom instructions in order to bridge the aforementioned gap.
25
Author:
Title:
Supervisor:
Keywords:
Abstract:
Meel, Praveen (200501031)

Ontology for UG program in CS/IT; 5 p.; 2009.
Jat, P. M.
Ontology; Course Categorization; OWL; Semantic web
Today the contents available on World Wide Web are meant for human utilization. But for
application program and software agents these contents should be in machine process able form.
The semantic web approach is to present only relevant information to the user based on certain
concepts and the relationship between them by adding semantics to data and replace the current
web pages with the machine process able contents. This can be achieved by creating and
maintaining the data in the form of ontologys. This project aims to propose and develop ontology
for Undergraduate (UG) program in Computer Science (CS)/Information Technology (IT).
Author:
Title:
Supervisor:
Keywords:
Abstract:
Mehrotra, Saransh (200501047)

Low Power Motion Estimation Circuit Using Adiabatic Logic; 5 p.; 2009.
Nagchoudhuri, Dipankar
Adiabatic logic; Efficient charge recovery logic; Motion estimation.
An advanced technique, called Adiabatic Logic is developed to minimize power dissipation is
CMOS circuits. Efficient Charge Recovery Logic is chosen as a method based on this Adiabatic
Logic. Using proposed logic, we designed the modules of an efficient tree based architecture of
motion estimation circuit. Tree based architecture consists of difference unit, adder and a
comparator as its modules. A conventional static CMOS motion estimator with same architecture is
also designed and finally a comparison of power is made between adiabatic and CMOS static
estimators. Circuits and simulations are done in 2 micro meter TSMC technology.
Merwana, Umang (200501011) and Pandey, Jitendra Kumar (200501149)

Analyzing Multiple Regression and Neural Network in Modeling a Dynamic Pattern; 4 p.; 2009.
Ghodgaonkar, Deepak
Auto correlation; Multicollinearity; Time series analysis; Data mining; Neural network; Multi layer
feed forward; Backprogation.
Abstract: A case study of Indian Stock Exchange (highly dynamic system) is being undertaken to carry out the
equivalence. Multiple Regression and Neural Networks would be used to carry out the theoretical
and advanced computational modeling of the system [7]. Multiple Linear Regressions is used to
study the time being linkages of the input and output variables. Later, the project studies Neural
Networks. In both the cases, the most important variables which define the expected deliverable,
i.e., BSE Sensex were identified and applied to the Linear Regression and Multi-layer backpropagation (BP) neural network. The system can estimate the buying and selling signs according to
the prediction of future trends to stock market, and provide decision-making for stock investors.
Author:
Title:
Supervisor:
Keywords:
Author: Mishra, Mayank (200501053)

Title: Implementation of Hidden Markov Model for Building a Speaker Dependent Isolated Word
Recognizer; 5 p.; 2009.
Supervisor: Sarkar, Aditi Nath and Patil, Hemant
Keywords: Automated speech recognition system; Forward algorithm; Forward-backward training algorithm;
Hidden Markov model, Isolated digit recognizer; K-means Vector Quantization Algorithm; Viterbi
search algorithm.
Abstract: In this project, Speech Recognition refers to the task of recognizing linguistic content in a spoken
sentence. In this work, the problem of isolated digit recognition is attempted with the help of
MFCC as feature extractor and Hidden Markov Model(HMM) as modeling technique for each
linguistic class(digits in the present case). The implementation of HMM consists of two major tasks:
building HMM model( forward-backward algorithm) and recognition(forward algorithm). The
results are obtained for closed set and open set experiments using a 5-state left-right HMM.
26
Author: Mittal, Ashish (200501037) and Bajaj, Prashant (200501236)

Title: To Define Accurate Channel Capacity by Merging Electromagnetic and Information Theory; 6 p.;
2009.
Keywords: Antenna measurement; Antennas; Channel capacity; Multiple-input multiple-output (MIMO)
systems; Number of degrees of freedom (NDF).
Abstract: Many relations have been reported between the information theory and electromagnetic theory,
highlighting some inescapable limitations imposed by the laws of electromagnetism to
communication systems. Beginning with this result, the role and importance of degrees of freedom
of the field in radiating system is identified. These degrees of freedom are used in different ways by
different classes of antennas. In particular, a multiple-input multiple-output antenna is a radiating
system which conveys statistically independent information using more than one degree of freedom.
In this report we are trying to characterize information theory via shannons information capacity,
wireless propagation systems and number of degrees of freedom of wave radiation using the
physical point of view of Maxwells equations.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Modi, Ankit (200501180)

Farmer Information System for ATMA; 9 p.; 2009.
Chaudhary, Sanjay
ATMA; Agricultural inputs; Farm profile; agricultural produce and logistics.
This project is intended to develop information system for ATMA. Registered farmers under
ATMA need to make available their farm profile, crop detail etc. to the system, and he will be able
to know markets around him to buy agricultural inputs as well as prices of agriculture produce. He
can also insert his total production details (crop type, variety, quantity etc) to the system and system
will compute all the logistics for the markets nearest to his location and will suggest him to go for
most profitable market to sell his production. This functionality will enhance the profitability of
farmers, and make their work worthy.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Muraharirao, Siva Charan (200501159)

Authentication of Digital Images; 4 p.; 2009.
Das, Manik Lal
Cryptography; Digital signature; Digital watermark; Image authentication; Hash function.
This report presents a new technique for digital image authentication. We have explored three
techniques for image authentication, such as, digital signature, hash function, and LSB based image
authentication. We observed that the digital signature technique is capable of detecting if certain
blocks of an image have been altered. The hash function based technique provides greater
efficiency for digital watermarking, and the LSB based technique embeds the watermark in the
original image, making it to be perceptually invisible. During our study we found that each of these
techniques has a disadvantage or has a scope for increase in efficiency. We combined all the good
features of the existing ones and developed a new technique which is more accurate than the
existing ones. We, then, analyzed our proposal in the context of security and efficiency and
compared it with the existing techniques.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Murthy, R. Satyanarayan (200501166)

Probe Sequences in Hash Tables; 4 p.; 2009.
Amin Ashok T.
Bidirectional linear probing; Ordered hash tables; Double hashing; Compact hash tables.
A hash table is a data structure that associates keys with values. A hash table works by transforming
the key using a hash function into a hash value, a number that is used as an index in an hash table
to locate the desired location where the values should be. The locations that are examined when we
attempt to insert a key K into table T are called probe sequences since we probe each location in
the probe sequence to see if we can find an empty location in which to the key can be inserted .A
lot of work has been done in the area of probe sequences. The report discusses the analyzes the
27
properties of different probe sequences. After studying the insert algorithm of bidirectional linear
probing , I found this area interesting and I finally have come up with a Delete Algorithm in
bidirectional linear probing.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Nagireddy, Pradeeep (200501160)

Fragile Domain Watermarking Techniques; 5 p.; 2009.
Raval, Mehul
Fragile watermarking; Image authentication.
This work develops an insight into Digital Image watermarking and also significantly addresses the
issue of content authentication with the help of fragile watermarking technique. The objective is to
develop a fragile watermarking model useful to locate individual tampered pixels. The work majorly
deals with localization of the tampered area 1) using block based approach which deals with
individual blocks in an image i.e., the tampering effect is realized block wise
2) using individual pixel based approach where the effect of tampering can be recognized at those
particular pixel locations.
Author: Nalamati, Rajendra Prasad (200501179)

Title: Implementation and Modification of Embedded Zerotree Wavelet Coder for Still Image
Compression; 5 p.; 2009.
Supervisor: Raval, Mehul S.
Keywords: Compression Ratio (CR); Discrete Wavelet Transform (DWT); Embedded Zerotree Wavelet
(EZW);, Non-Uniform Quantization; Huffman Coding algorithm.
Abstract: The report presents two approaches for modifying already existing Embedded Zerotree Wavelet
(EZW) coder algorithm. The first approach performs a non-uniform quantization of wavelet
coefficients before the EZW coding is applied. The second approach is based on the computing
energy difference between the parent in approximated coefficients and all the children in the
detailed coefficients. The aim of modification is to achieve better compression ratio of any given
image without disturbing the quality or better quality with same compression ratio. The quality of
the image is measured using Mean Square Error (MSE), Peak-Signal-to-Noise-Ratio (PSNR),
Signal-to-Noise Ratio (SNR), and Normalized Correlation (NC).
Author:
Title:
Supervisor:
Keywords:
Abstract:
Nallavelli, Ramya (200501135) and Yenugula, Naveen (200501152)

1V Rail-to-Rail 12-bit Pipelined ADC; 4 p.; 2009.
Parikh, Chetan D.
Pipelined ADC; Comparator; MDAC.
The goal is to design a 1V rail-to-rail 12-bit pipelined ADC with a speed of 80Msamples/sec. The
pipelined ADC consists of 5 stages; the first 4 stages resolving 2 bits each and the last stage
resolving 4 bits with a provision for digital error correction. The design is done with the objective of
achieving maximum Differential and Integral Non-linearity of LSB.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Nama, Amit (200501006) and Mittal, Saurabh (200501018)

Algorithm Evaluation for the Weighted Vertex Cover Problem; 6 p.; 2009.
Chatterji, Samaresh
Vertex cover Approximation algorithm; Maximal matching; NP hard problem.
Vertex cover problem has been one of the most studied because of its eide variety of applications
raging from networking and biological fields to real life applications. Since the problem is known to
be NP Hard, many algorithms have been put forward to improve the solution to the problem in
terms of approximation ratios as well as time complexity of the algorithms. It is proposed to
implement te recent theoretical algorithm of F. Grandoni, J. Konemann and a. Panconesi and do a
detailed analysis of the proposed performance.
28
Navkar Samdaria (200501174)

Securing SSL/TLS Against Man-in-the-middle Attack; 5 p.; 2009.
Das, Manik Lal
Authentication; Man-in-the-middle attacks; Secure Socket Layer (SSL); Transport Layer Security
(TLS).
Abstract: Secure Socket Layer (SSL) or Transport Layer Security (TLS) provides secure connectivity over the
Internet. Large number of e-commerce applications such as Internet banking employs SSL/TLS
protocol, to cryptographically protect the communication channel between the client and the server,
without being aware of the fact that man-in-the-middle (MITM) attack could pose a serious threat
to such applications. In this report we discuss the MITM in SSL/TLS, and attempt to mitigate this
threat with an efficient solution that can safeguard SSL from its possible damage. We will use a
token-based user authentication -validated by the correct server, before exploiting the transaction
security provided by SSL/TLS.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Nekkanti, Vasavi Kumar (200501162)

Visualization of OWL Ontology; 5 p.; 2009.
Chaudhary, Sanjay
AJAX; Visualization of Ontology; Ontology; OWL; Semantic web.
Ontologies are the building blocks of semantic web. There is a growing need for effective ontology
visualization for design, management and browsing. This project aims to present an interactive web
application using AJAX to visualize an ontology based on Web Ontology language (OWL).
Nigam, Abhinav (200501185) and Srivastava, Anuj (200501207)

Wasteland Identification & Soil Property Analysis Using GIS; 6 p.; 2009.
Roy, Anil K.
GIS Satellite image Geo referenced; Spatial data; Vectorization; Classes; False colour composite
Image; Wasteland.
Abstract: A GIS (Geographic Information System) is a system which uses computerized mechanism for
integrating geo-referenced data sets and analyzes them in order to generate information relevant to
the management needs in a particular context. GIS can reveal hidden patterns, relationships and
trends which are otherwise not evident in statistical packages, often creating new information from
the existing data sources. This report examines the capability of GIS as a technology and its
usability as a decision support system in various domains. Also we have analyzed the specific
requirement of our client, IOCL, to help them understand if the district of Balasore of Orissa state
has some wasteland suitable for cultivation of Jetropha under their Bio-fuel initiative.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Nunia, Vikas (200501100) and Tiwari, Anukool (200501080)

Developing Ontology For Music; 5 p.; 2009.
Jat, P. M.
Music; Ontology; OWL and semantic web; Objective - developing ontology for Music.
Present web is web of text. Every document on the web looks exactly the same to every machine.
In present scenario we need to add some extra data to those documents so that machines are able to
understand meaning of these documents. This will be a web of data and knowledge. The ontology
defines the terms used to describe and represent an area of knowledge. The music ontology links all
the data related to music and encodes the knowledge of the domain music in such a way that it can
be understood by the machine. We choose to develop ontology for music [2]. The Music Ontology
provides Specification for main set of concepts, relationship and properties for describing music on
machine understandable data. This document contains a description of the Music Ontology.
29
Parimi, Varun Rajendra (200501210)

Qualitative Analysis of C4.5 Decision Tree Induction Algorithm; 4 p.; 2009.
Chaudhary, Sanjay
Decision trees; Induction, c4.5; Training/test data, Information gain; Gain ratio; Data mining;
Classification rules; Pruning; Error.
Abstract: Decision trees is a method of classification where a model is prepared from the database tuples
followed by the construction of decision tree from the training data using C4.5 algorithm. The
classification rules thus obtained from the decision tree are used to identify the class labels of data
whose labels are not known. The analysis part consists of evaluating the accuracy of trees and the
rules against unseen cases called test data by altering the training data size and introducing noise
into the training data. The accuracy of the trees and rules is based on the error rate. For the trees
generated the accuracy is measured before and after pruning separately.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Patnaik, Nandini (200501163)

Fault Identification In Diagnosable Systems; 4 p.; 2009.
Amin, Ashok T.
Allowable fault set; L-graph; maximum matching; minimum vertex cover set; t-diagnosable system
A self diagnosable system is a system consisting interconnected units, which has the capability of
testing its units and determining faulty units. A t-diagnosable system is a system t or less than t
faulty units. Various approaches have been developed to identify the set of faulty units by studying
a collection of test results produced by the system. One such approach is devised by A.T. Dahbura
and G.M. Masson which presents an algorithm for identifying the set of faulty units in a tdiagnosable system. This report summarizes fault identification algorithms and presents an
implementation of A.T. Dahbura and G.M. Massons algorithm.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Pitchikala, Satish (200501153)

Hardware Implementation of Full-Search Block Matching Algorithm; 5 p.; 2009.
Dubey, Rahul
Video Compression; MPEG; Motion Estimation; Block Matching Algorithms; FPGA.
In various video compression standards like MPEG, VCEG and H.261, Motion Estimation is used
to reduce the temporal redundancy. Motion estimation and subsequent motion compensation
processes are the most demanding, in terms of both computational time and hardware complexity,
in these standards. Hardware implementation of motion estimation algorithms on FPGAs and
ASICs is necessary for meeting the real-time requirements of video compression. This paper
presents an efficient VLSI architecture to implement Full search Motion Estimation Algorithm. The
design is implemented using Verilog HDL.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Praveen Kumar (200501209) and Srivastava, Vinay Kumar (200501233)

Effect of Frequency Offset on OFDM; 4 p.; 2009.
C. Vijaykumar
BER; Cyclic Extension; Pilot (Training) Symbol; Schmidl-Cox.
In an OFDM communication system synchronization is as important as it is to singlecarrier
systems. Moreover, because of the existence of multiple subcarriers, frequency offset between the
transmitter and the receiver carrier cause intercarrier interference (ICI) which in turn causes more
severe performance degradation on OFDM than on single-carrier systems. OFDM systems are
particularly sensitive to errors in carrier frequency, a problem made worse by the high carrier
frequencies and narrow subcarrier spacing of many systems. In this project, we have analyzed
methods of synchronization in OFDM using techniques like Cyclic extension, Pilot Symbol and a
particular method of Schmidl-Cox.
30
Prakash, Nikhil (200501085) and Garg, Saurabh (200501238)

Low Noise Amplifier Design; 4 p.; 2009.
Gupta, Sanjeev
LNA, S-Parameter; Delta, Stability Factor; MAG; MSG; Noise Figure; BJT; ADS; Smith Chart;
IMN; OMN; Biasing.
Abstract: Low Noise Amplifier is a very important element in the communication systems. In this paper, we
have proposed a design of low noise amplifier through simulation in Advanced Design System
(ADS) software. The architecture used here operates at a frequency of 1.0 GHz. Several BJT
transistors were tested for their stability and gain analysis. The approximated value of gain analysis
we obtained in the required frequency domain were 17.3 dB for BJT. Various factors were taken
into account to decide the transistor to be used and the frequency range such as stability factor, gain
and noise figure. Frequency was selected as 1.0 GHz on the basis of the fulfillment of the design
specifications mentioned later in the report. Proper matching and biasing networks were added to
the amplifier system to enhance the amplifier gain and reduce the noise figure.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Prithvi Raj Krishna, N.S. (200501114)

Node Localization in Lunar Environment; 4 p.; 2009.
Srivastava, Sanjay
Localization; Achors; Ranging; GPS; Cluster
Location awareness is an important issue in Wireless sensor networks (WSN) applications. I have
Worked upon designing a robust localization scheme for a sensor network deployed on the moon
that would work to search for the traces of minerals and other substances. One major constraint on
this application is that the dependence on infrastructure like GPS has to be kept at a bare
minimum. The localization scheme would also have to ensure minimum levels of accuracy in the
face of high ranging errors and a harsh terrain model. The following sections describe the nature of
the approaches considered for the project.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Priyanka, B.K. (200501128)

Technique to Reduce Vector Generation Time and Resource Requirement; 4 p.; 2009.
Dubey, Rahul
Author:
Title:
Supervisor:
Keywords:
Abstract:
Purohit, Autul (200501021) and Pareek, Ritika (200501086)

A Novel MAC Layer Configuration Protocol for CR Based Multihop Wirless Networks; 6 p.; 2009.
Chatterji, Samaresh
Cognitive radio; Multihop; MAC layer configuration protocol.
MAC layer configuration of a Cognitive Radio (CR) network deals with utilizing a common set of
channels to enable communication among participating nodes. Using the system topology
information we have edeveloped a MAC configuration protocol which operates over multiple
channels for efficient communication among nodes in distributed CR network.
Choudary, Ajay
Simulation, Test Vector; EVCD; Turn around time; Burs; Postedwrites; Test interface controller;
AHB; AXI; Netlist
Abstract: Functional test vector generation for large System on Chips (SoC) is a time consuming job and
requires huge computational resources. The test vectors are generated through simulations which
takes nearly 40 to 70 percent of the overall verification effort. A technique to reduce the time as
well as resources required for vector generation through a simulation is presented here. The
reduction is achieved by partitioning the simulation verification into two in order to identify the
parts which could be replicated with out requiring a simulator. TIC Interface protocol is studied to
identify the two partitions. The technique needs to be modified in order to suit the burst mode and
posted tic writes of AHB as well as AXI interfaces with which the TIC interface interacts. During
the simulations 40-50% speed up is achieved in the vector generation turn around time. The results
obtained from a normal simulation and this partitioned simulation remains the same.
31
Purohit, Raj Rishi (200501072)

Implementation of Rational Wavelets and Filter Design for Speech Recognition; 4 p.; 2009.
Patil, Hemant
Cepstrum; Dyadic and rational filterbank (FB); Linear prediction coefficients (LPC); Mel frequency
cepstral coefficients (MFCC); Wavelet packets.
Abstract: The project is to develop of various wavelet based feature extraction techniques of a given input
speech signal. These feature vectors once extracted can be passed through a model (in the present
case Hidden Markow Model) which compares the test sequence of speech with the trained sequence
by which the model is created. In case of isolated digit recognition, ten digits as used to calculate
the accuracy of recent work in rational filterbank and comparing it with off-the shelf models which
have been in use such as MFCC (Mel Frequency Cepstral Coefficients), and tree structured dyadic
filterbank. Initially, pitch of different phonemes using cepstrum analysis is observed. Then graphic
implementation of Linear Prediction analysis (LP Analysis) is done. Later part shows the study and
comparison of results using different proposed feature vector techniques for isolated digit
recognition.
Author:
Title:
Supervisor:
Keywords:
Ram, G. (200501139) and Mittal, Saumya (200501182)

Enhancements to Repository Management; 6 p.; 2009.
Banerjee, Asim
Content ; Saba Content Management System; Development Repository; Saba Repository Report
Tool; Saba Repository Archive Tool
Abstract: Enhancements to Repository Management provides mechanisms for efficient storage of resources
in the development Repository. These mechanisms will overcome the limitations on space and
technology which exist in the current development repository. The enhancements include
developing a Saba Repository Cleanup Tool which will remove all the unwanted resources/versions
from the repository. The Saba Repository Cleanup Tool includes a Saba Repository Report Tool
and a Saba Repository Archive Tool. The Saba Repository Report Tool creates a report of
repository and the Saba Repository Archive Tool creates an archive of the repository projects and
removes them from the repository.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Ramrakhiyani, Laveen (200501042) and Nirdesh Kumar (200501067)

Miniaturized Microstrip Antenna and Microstrip Array Antenna at 1.4 GHz; 8 p.; 2009.
Gupta, Sanjeev
Microstrip Antenna (MSA)
Microstrip antennas have been a topic of study in recent years. They are finding application in
microwave systems due to their advantages over conventional type of antennas.
In this paper behavior and properties of microstrip antenna have been analyzed and then array of
such antenna in different forms have been designed. Further the microstrip antenna is miniaturized
with a process known as shorting of antenna. The shorting of antenna is done using two
procedures firstly by full shorting then by using shorting posts. These microstrip antennas have the
potential to find application in telecommunication mobile because of their reduced size.
As a result we come to know that as we keep on increasing the number of elements in microstrip
antenna array the loss and directivity increases. When we short the antenna there is some tradeoff
between the size of antenna and the efficiency of the microstrip antenna.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Rathi, Pankaj Kumar (200501016) and Verma, Sparsh (200501039)

A Kalman Filter Estimation Approach for Modeling Time Series Data in Stock Market; 5 p.; 2009.
C. Vijaykumar
Time-series; State Estimation; Kalman Filter.
The study of financial data is becoming increasingly important as the financial industry trades on
shorter and shorter time scales. In this report we present a Kalman Filter estimation approach for
32
modeling noisy financial time-series. The Kalman Filter is the best linear optimal estimator for the
state estimation of a linear dynamic system. There are several other estimation techniques available
in estimation theory literature. We have attempted to apply other estimation techniques namely
Linear Least Square, Weighted Least Square and Recursive Weighted Least Square techniques and
curve fitting techniques are also used to model the time-series and a comparative analysis is done
between these methods. These methods are implemented in MATLAB. The performance of
various approaches is demonstrated on tick data from Bombay Stock Exchange. A statistical
software SPSS is also used to analyze various statistics of the time-series data.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Ravi Shankar, G. (200501130)

Real Time Scheduling Using Least-Cost-Last Algorithm; 4 p.; 2009.
Divakaran , Srikrishnan
Scheduling algorithm; Real time application
Continuous media services are near real-time applications that require time guarantees. These
applications compete for a wide range of limited resources like processor, memory, network
bandwidth and hard disk. So there is a need for designing algorithms that can allocate resources
efficiently. In real-time systems, each task needs to complete within a certain time referred to as its
deadline. If the deadline is to be met under any circumstances then it is called a hard deadline. In
many real-time applications, the deadlines of all tasks will not be hard or critical. Such deadlines
which can be missed without affecting performance are called soft deadlines. Continuous media
services are soft real-time applications comprising of large audio, video streams that are periodic.
These data streams are often accessed sequentially and are have varying compression levels. This
results in data requests that are periodic, with variable rates and have deadlines. So there is a need to
design algorithms that can schedule these real-time data requests. These types of algorithms are
called real-time scheduling algorithms.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Reddy, P. Vivek (200501138)

Text Document Classification Using Finite Mixture Model; 4 p.; 2009.
Mitra, Suman K.
Document Classification ; Finite Mixture Model.
The automated assignment of texts to predefined categories based on their content is a task of
increasing importance. Assigning classifications to documents is essential to the efficient
management and retrieval of knowledge. Text categorization presents unique challenges due to the
large number of attributes present in the data set, large number of training samples, and attribute
dependencies. Finite Mixture Models are powerful and flexible probabilistic tools used for modeling
data. The work in this project involves studying the application of finite mixture model to
document classification and then experimenting it on dataset.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Reddy, V. S. Goutham (200501142)

Analysis of Software Architecture Using Dependency Manager; 4 p.; 2009.
Jat, P. M.
Software Architecture; Design, Dependency structure matrix (DSM); Design rules; Metrics.
Software Architecture is an important subfield of software engineering that plays a fundamental
role in the design and evolution of large software systems. Software architecture provides an
explicit and formal description of the properties of the system. During the recent years there has
been a tremendous increase in the complexity of the software systems there by making the
management of architecture a difficult task. In complex software systems excessive inter-modular
dependencies are an indicator of poor software design as in highly coupled systems small changes
leads to major software defects. Hence Dependency Models are effective ways that can be used to
represent the architecture of a software system by presenting the architecture in the form of a
Dependency Structure Matrix (DSM) and design rules. The aim of the Dependency Manager is to
analyze the architecture of complex software systems and presents it in the form of a DSM from
which the architecture of the system can be studied and further design rules applied to it to manage
33
it effectively. Further the Dependency Matrix can be used to generate other software metrics like
Stability Metrics and Abstraction Metrics which provide an in depth understanding of the
underlying Software Architecture.
Rimmanapudi, Ravi Kiran (200501200)
Comparative Analysis of Kleins and Modified Kleins algorithm; 4 p.; 2009.
Chatterji, Samaresh
Graph; Network; Flow; circulation; augmenting path; Residual network; Negative cost directed
cycle; Minimum mean cycle.
Abstract: Constructing an optimal circulation or minimum cost circulation is one of the most fundamental
network flow problem. There are several approaches proposed to solve this problem. In this
project I propose to conduct a experimental study on actual performance of Kleins and modified
Kleins algorithm in an identical environment.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Rout, Lipsa Shrabani (200501213)

Fast Approach for Stereo Using Particle Swarm Optimization Technique; 5 p.; 2009.
Joshi, Manjunath V.
Cost Function, Depth, Disparity, Particle Swarm Optimization, Stereo.
Stereo vision deals with solving the depth estimation problem using the concept of disparity. By
obtaining the disparities we try to find out the distance of each object point from the camera so that
we can construct a 3-D form of an image. To find the disparity many techniques have been studied
and applied. The efficiencies of these techniques are determined by using the concept of cost
function. To get the optimal disparity map we minimize this cost function. In this project we have
studied the concepts of stereo and the algorithms for determining the disparity. We have proposed
the use of Particle Swarm Optimization as a technique for finding disparity and by implementing
this method our aim has been to minimize the cost function faster when compared to the other
techniques.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Rungta, Mohit Kumar (200501206) and Shahani, Kapil (200501076)

Settlement of Chharanagar; 8 p.; 2009.
Chatterji, Samaresh
System Dynamics; Stock Flow Diagram; De notified Tribe (DNT).
It is proposed to develop a System Dynamics model of the Chharanagar community and apply it to
analyze the principal factors underlying the growth and progress of the community.
Sahoo, Rohit Kumar (200501157) and Parikh, Gaurav (200501230)

Experimental Study of Connected Dominating Sets for Mobile Ad-Hoc Networks
Chatterji, Samaresh
Approximation ratio; Connected dominating set; Dominating set; Maximal independent set; Unit
disc graph.
Abstract: It is proposed to carry out an experimental study of the algorithm proposed by Alzoubi, Wan and
Frieder for finding a connected dominating set in a graph. The algorithm proposed by them is for
the application of construction of virtual backbone in wireless Ad-Hoc network.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sai Teja P. (200501113) and Tandle, Sawant (200501151)

A Tool for Automatically Generating Security Protocols; 4 p.; 2009.
Mathuria, Anish M.
Automatic protocol generation; Protocol Checker; Belief logic; Multi Protocol flaws.
The idea of autonomic framework depicts generation of protocols on the fly from the requirements
of the participants. We tried to simulate this framework, and for this a prototype of a protocol
generator has been built. The following report tries to capture some of the implementation details
34
of the generator and attempts to make it more robust. Based on the results obtained with the
prototype, changes are suggested in the architecture.
Sambu Shiva Sai Krishna Prasad (200501147)
Computational Geometry -Witness Set and Guard Set Problem; 6 p.; 2009.
Chatterji, Samaresh
Algorithm; Convex Vertex; Guard set; Halfspaces; Line of Support; p sees q; p witnesses q; Reflex
Vertex; Simple polygon; Sweepline algorithm; Visibility Kernel;, Visibility Polygon; Witness set.
Abstract: The problem of how many guards are necessary to guard any polygon with n vertices has been
extensively studied in computational geometry. A variant of this problem is that of finding a witness
set in a polygon. A recent paper by Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther
Moet, Chan-Su Shin et al has obtained various theorems and proposed an algorithm for finding a
finite witness set if it exists. It is proposed to implement the algorithm and study its performance in
a simulation framework.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sampath, P. Shanmukha (200501093)

Metrics on Protein Structure; 6 p.; 2009.
Gupta, Manish K.
Protein structure; Algorithms; Structural alignment mthods
Advance in the growth of new protein structures getting entered in the database there is a need for
the faster algorithm for the comparison protein structures compared to the algorithms which are
computationally intensive. The algorithm should not only be faster but also should give a good
measure of similarity between two proteins. This measure of similarity is used to find the functional
similarity between proteins and also to get a global view of the new protein structure. There are
many different methods proposed to find the similarity between the proteins using different kinds
of representation yet these methods face the problem of defining a good similarity score between
the two proteins. These methods are classified into two categories structural alignment methods
and alignment free methods. Due to computation intensive nature of structural alignment methods
alignment free methods have been developed with faster computational speeds. Analysis on the
structural alignment methods have been by Kohel [1]. In this paper we analyze the similarity score
given by three selected alignment methods contact metric (CM), topology of protein
structures(TOPS) and secondary structure matching (SSM) among the other alignment free
methods. The results reveal that the graphical representation of protein structure to calculate the
structural similarity using SSM method gives the best similarity score compared to other two
methods. The results also reveal that contact metric (CM) shows good similarity score between
some proteins where it is far better than the SSM similarity score even then it is not a good measure
of similarity between protein structures. Combination of two or more methods of structural
comparison may define good measure of similarity between protein structures.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Saxena, Shubham (200501108)

Path Complexity of Programs; 6 p.; 2009.
Amin, Ashok T.
Control flow; execution path; program complexity measures; Testing
Various complexity measures are used to analyze programs and estimate the effort required for
efficient development and/or testing. We explore a new measure called Path Complexity which is
based on the total number of program execution paths. This measure overcomes the shortcoming
of the static control flow/ data flow measures, which may contain path(s) that are not traversed for
any input value. Path complexity measure can differentiate between two programs with isomorphic
control flow graphs.
35
Shaik, Khaja Ahmad (200501074)

Improving Load-Transient Response of Capacitor less Low Drop out Voltage Regulator; 4 p.; 2009.
Parikh, Chetan D.
Conventional LDO; Capacitor less LDO; Load transient response; Low dropout regulator; Pass
device; Small signal stability; System on chip (SOC); Damping Factor.
Abstract: LDO voltage regulators are essential part of power management. Most of the work is done on
conventional voltage regulators , but capacitor less LDOs are unstable and load transient analysis of
capacitor less LDOs is also very poor but it is having advantage of avoiding bulky external capacitor
which is very useful in SOC applications. So improving the stability and load transient performance
of capacitor less LDOs is worth solving. In this report, analysis of Capacitor less LDO and
relationship between open loop phase margin and closed loop load transient analysis is presented,
and simulation and discussion of two current existing techniques of improving load transient
response of capacitor less LDO presented.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sharma, Amit (200501083)

Secure Program Execution in Wireless Sensor Networks (WSN); 5 p.; 2009.
Das, Manik Lal
Wireless sensor networks; Program integrity verification; Authentication protocol; Wireless security.
Wireless Sensor networks (WSN) have found important applications in real world problems as the
medium is wireless network. Security in WSN is of utmost importance for securing the applications
from adversary. Since sensor nodes are usually deployed in hostile and unattended environments
they are susceptible to various attacks such as node capture, physical tampering, etc. The resource
limitations of sensors make key establishment in sensor nodes an arduous task. Several symmetric
key establishment mechanisms have been proposed earlier but most of them are not scalable. In this
project, we have modified a recently proposed distributed authentication protocol of Program
Integrity Verification Servers (PIVS) by using an efficient key pre-distribution scheme [5].The
Proposed DAPP Model uses the DAS and Sengupta Scheme in a hierarchical network as opposed
to the distributed network which was used in the previous DAPP model. Then we have analyzed
the security of the Proposed DAPP model for various types of attacks and compared that with of
the already proposed DAPP scheme.
Sharma, Anshul (200501004) and Golcha, Manish (200501005)

Connected Dominating Set in Wireless Ad-hoc Network; 5 p.; 2009.
Chatterji, Samaresh
Ad hoc Networks; Connected dominating Set (CDS); Maximal independent set (MIS); Spanning
tree.
Abstract: The spine of a wireless network corresponds to a connected dominating set (CDS) of the
underlining graph of the network. Consequently, many algorithms have been presented for finding a
CDS of small size. We propose to implement and experimentally evaluate these known algorithms
in a simulation framework.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Sharma, Ashish (200501029)

Effects of Integrating Digital Visual Materials for Rural Education; 6 p.; 2009.
Chaudhary, Sanjay
Toyama, Kentaro, MSRI
Human computer interaction; Multipoint; Rural education; Visual materials.
The use of computers in schools especially in developing regions brings with it vast, largely
untapped educational resource - digital and multimedia content. At the same time, there exist
problem of how this resources can be best utilized to remove any gap between learning that take
place in the classroom and learning that takes place in computer lab. An example, to develop
software that enables the teachers to use computers for whole - Classroom instruction. In this
project, known as Multipoint Enabled PC + Projector, we aim to rapidly build and deploy
36
Multipoint (multimouse) enabled applications which is typically used for displaying digital content
derived from textbooks augmented with complimentary multimedia resources (image and video)
obtained from any external source, or locally created material such as photographs and drawings.
Multipoint feature will enable one computer to serve many students simultaneously. Data collected
based on observations and teacher feedbacks along with testing by deploying it in many schools can
be used to verify existing applications and also to achieve symbiotic human computer interaction.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sharma, Gaurav (200501024)

Comparison of relative Performance of TEO and VTEO for Emotion Recognition; 4 p.; 2009.
Patil, Hemant
Teager energy operator (TEO); Variable length teager energy operator (VTEO); Vortices.
The Automatic recognition and classification of speech under stress has applications in behavioral
and mental health sciences, human to machine communication and robotics. While research on
speech recognition has been going on with good pace, emotion recognition is still in its nascent
phase. Most of the classification in emotion recognition has been done by linear model of speech
signal. However, studies by Zhou et.al.[2] indicate that in the emotional state of anger or stress, the
fast air flow causes vortices located near the false vocal folds providing additional excitation signals
other than the pitch. The additional excitation signals appear in the speech spectrum as harmonics
of fundamental frequencies not equal to F0, and cross-harmonics between the F0 source and
additional sources. This implies that the vortex-flow interactions produce speech that can be treated
as a multiple-source signal and the speech production process has a nonlinear character. Here we
will extract the features of the Emotion signals with the help non linear TEO and VTEO and will
compare the relative performance of TEO and VTEO.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sharma, Ruchi (200501008) and Jain, Kapil (200501060)

Ultra Wideband Low-Noise Amplifier Design; 5 p.; 2009.
Gupta, Sanjeev
Return loss; Noise; transconductance; Reverse isolation; Common gate and common source.
An ultra wideband (UWB) low noise amplifier (LNA) is presented in this report. The LNA is
designed in three stages; input matching, interstage matching and output matching network. The LC
network is used for input and output matching. The cascode LNA structure is used with an
interstage matching inductor placed between the two MOSFETs of 0.25m standard metal oxide
semiconductor technology. The amplifier is optimized for minimum noise figure and maximum
gain at 3.1 GHz. The simulated LNA achieved noise figure smaller than 1.5dB and gain greater than
20dB at 3.1 GHz frequency.
Sharma, Sudhanshu (200501109)

Preserving Edges In Regularized Constrained Least- Squares Image Restoration; 3 p.; 2009.
Joshi, Manjunath V.
Adaptive regularization; Image restoration; Regularized constrained least-squares filter; Wiener
filter.
Abstract: Image restoration based on constrained least squares (CLS) estimation has various difficulties with
it. The most powerful approaches to overcome these difficulties is regularization. This is known as
regularized constrained total least squares (RCLS) image restoration. Generally we use smoothness
as prior information while using RCLS methods which results in loss of edges in restored image. So
first we classify image into edge and non edge blocks and then we apply RCLS algorithm to
eliminate noise around edges.
Author:
Title:
Supervisor:
Keywords:
37
Shashank Kumar (200501118) and Varun Raj C.V. (200501170)

MIMO-OFDM Channel Equalization; 5 p.; 2009.
C. Vijaykumar
M-QAM; Multiple input multiple output; Orthogonal frequency Division Multiplexing; Channel
equalization; Singular value decomposition; V-Blast; Spectral factorization
Abstract: The use of antenna arrays at the transmitter and the receiver (MIMO) increases the diversity gain or
system capacity on a time-variant and frequency selective channel. MIMO when coupled with
orthogonal frequency division multiplexing modulation scheme enhances the performance by
increasing the data rate. Here we design first a MIMO-OFDM system which is used to transmit and
receive at the antennas. Further, we implement the Channel equalization for a Fading channel with
Additive White Gaussian Noise (AWGN). We explore the cases where the channel is flat fading
with the channel matrix consisting of numbers or impulses and for frequency selective fading,
where the channel matrix is a series of impulses bringing polynomial matrices. In the latter case, we
need to perform spectral factorization methods to design the receiver. Finally we analyze the
performance of these different cases by plotting the BER in each case.
Author:
Title:
Supervisor:
Keywords:
Shekhawat, Ajeet Singh (200501032)

Weaknesses and Improvements of E-Mail Protocols; 5 p.; 2009.
Das, Manik Lal
Private key; Public key; Public key certificates; Multipurpose internet mail extensions (MIME);
Public key infrastructure (PKI); Pretty good privacy (PGP); S/MIME.
Abstract: Internet mail has always been vulnerable to unauthorized manipulation. Unavailability of completely
secure channel and need to exchange data securely over insecure medium resulted in end to end
email security protocols like S/MIME, MOSS, PEM and PGP and PKCS #7. This report discusses
the two most prevalent standards for the email security PGP and S/MIME with their structure and
shortcomings and compares them on the bases of efficiency and security. We wish to provide
critical survey of these protocols and try to mitigate shortcomings in these protocols and suggest
methods to prevent Surreptitious forwarding.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisors:
Keywords:
Abstract:
Shekhar, Praveen (200501154)

Virtual Tour of the Institute (DA-IICT) Campus; 4 p.; 2009.
Roy, Anil K. and Desai, Binita
Panoramic image; Virtual tour; Action script.
Virtual Tour has become a significant feature in todays contemporary life. Real Estates, Shopping
Malls, Retail shops, Commercial buildings, Hotels, Schools, Universities etc. have been using this
exciting feature to give an almost realistic view to their clients. Virtual Tour has been growing as a
featured application to promote an easy way access to people, especially from remote places to give
a visual picturization of places via internet thus saving a lot of time and giving an independence to
view on an anytime, anywhere basis. The virtual tour of DA-IICT campus has been developed in
Flash using ActionScript 2.0. The tour would reduce the gap between the real and the virtual
world. Besides the virtual tour, we have also developed a total dynamic framework of a slideshow
that entails an image gallery depicting different activities in the DA-IICT campus.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Shettigar, Samata (200501191)

Face Recognition Model Using 2D PCA and LDA; 4 p.; 2009.
Joshi, Manjunath V
Face Recognition; Linear Discriminant Analysis; FisherFace; EigenFace.
Discriminant Analysis (LDA) method along with 2D Principal Component Analysis (PCA)
algorithm along with Gabor Feature used for face recognition. LDA system has been preferred over
PCA for face recognition, where PCA projects original set of face images onto lower dimensional
spaces and LDA projects illuminated images from arbitrary angle. Unlike PCA which deals with 1D
vector, 2D PCA is based on 2D matrix. LDA attempts to model differences in various variables. A
Gabor filter is a band-pass filter whose impulse response is given by multiplying a Gaussian
38
envelope function with complex sinusoidal. Gabor filters are used through which the image is
passed and histogram values of the output image are dealt as Gabor features for the classification by
finding the minimum Euclidean distance between the test image and the input image. LDA, PCA
and Gabor feature method are then combined and the results compared against the results obtained
using LDA, PCA and Gabor feature method separately.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Shrinkhala, Kirti (200501110)

On Acyclic Orientation of an Undirected Graph for Maximizing Reachability; 4 p.; 2009.
Amin, Ashok T.
Acyclic orientation; Optimal; Reachability; Undirected Graph.
Let G be an undirected Graph with n vertices and m edges. By acyclic orientation R of the edges of
G, we obtain a graph GR so that GR does not contain any directed cycle. Every undirected graph G
has many such acyclic orientations. By r (GR) we denote the number of pair of vertices u, v such
that there exists a directed path from u to v or from v to u in GR. We study the acyclic orientation
R of G such that r (G, R) maximizes and find an approximate algorithm that orients any undirected
graph to get maximum r (G, R).
Singhal, Ankur (200501183)

Framework for Providing QoS Guarantees in Continuous Media Applications; 5 p.; 2009.
Admission control; Buffer management; Continuous media; QoS (Quality of service); Real time
system.
Abstract: Continuous media applications attempt to provide Quality of Service guarantees by (1) effective
admission control, and (2) efficient utilization of disk bandwidth and buffer. However, in existing
continuous media systems there exists no analytical framework where the applications can provide
feedback for admission control, buffer and cache management. In this project, we design a
framework where application can influence admission control, buffer and cache policies. Thereby
provide better utilization of system resources for satisfy application requirement.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Singhania, Shruti (200501002)

Adaptive SVD Update Algorithms for Channel Estimation in MIMO Systems; 4 p.; 2009.
C. Vijaykumar
SVD Perturbation; LMS; MIMO; NMSE, Precoding; V-BLAST ZF.
Adaptive SVD update algorithms requires updating the singular values and corresponding right and
left singular vectors for a slowly time varying channel response matrix. Two new algorithms based
on Perturbation and LMS based approaches were presented in [1] for MIMO systems. In this
report, I have followed the paper and verified the results presented in it. The results show that
though the NMSE performance is good for both the algorithms as demonstrated in [1],the
algorithms does not show a good SNR vs. BER performance when symbol detection is done using
precoding due to phase error problem in updating singular vectors. Instead, the algorithms are used
for channel estimation and V-BLAST ZF method is used for symbol detection which gives a good
performance.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Sinha, Rahul (200501059) and Verma, Swati (200501069)

VoIP Security using Dynamic Authentication and Identity-based Technique; 5 p.; 2009.
Das, Manik Lal
Bilinear pairing authentication; Elliptic curve cryptography; Session initiation protocol
Voice over Internet Protocols (VoIP) is an emerging technology which allows users to make calls
using IP-based networks. Session Initiation Protocol (SIP) is one prominent protocol which is used
to create, tear down or modify VoIP sessions among users. The security of SIP has become very
important in recent times. This is because the SIP authentication scheme, derived from Hypertext
Transfer Protocol (HTTP) Digest authentication scheme, is vulnerable to many attacks. In this
39
project, we study existing VoIP security, identify a few shortcomings and propose two protocols for
securing VoIP. One of our protocols considers identity-based crypto-primitive and the other one
uses dynamic authentication technique. We will analyze our proposed protocols and compare them
with existing VoIP protocols.
Soumya, P. V. (200501140)
Centralized Printing System; 5 p.; 2009.
Banerjee, Asim
Client spooler; Server spooler; Internet printing protocol, RPC; Enhanced meta file (EMF),
Graphics device interface (GDI); PrnAdmin.dll, MONO framework.
Abstract: Centralized Printing is one of the many and diverse applications of client server architecture.
Centralized printing is implemented using the Network Printer and the Printer Server concepts.
This report examines the Implementation techniques and describes the Network printer
architecture in detail. Then it describes the system design specifications and also the architectural
design of a network printing system soft ware
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Srivastava, Ankit (200501103)

Rapid Performance Benchmarking Methodology of Design Architecture with AXI Crossbar Case
Study; 4 p.; 2009.
Dubey, Rahul
AXI; Emulation; Synthesizable transactors.
This paper presents a new high speed, low cost scalable approach of performance benchmarking.
We build a generic, synthesizable FSM wrapper around the DUT implementing the followed SoC
block protocol. This wrapper is then replicated to emulate a real multi-master multi-slave
configuration on a FPGA platform. It is responsible for creating several dummy data transactions
which are then tested and monitored to validate the functionality of bus fabric covering all possible
corner cases. Such an approach works without the requirement of heavy infrastructure related to
hardware-software link up and performs many orders of magnitude better than simulation speed.
Author: Srivastava, Nishant (200501066)

Title: Generic Mathematical Model to evaluate Full Chip Dynamic Voltage Drop based on Operational
Frequency and Utilization; 4 p.; 2009.
Supervisor: Parikh, Chetan D.
On site
Srivastava, Rajeev
Supervisor:
Keywords: IR drop; Dynamic voltage drop; Backend.
Abstract: This report comprises of the work carried out at ST Microelectronics as a part of the B-Tech
project. In this report, a mathematical model has been proposed for the evaluation of Dynamic
Voltage Drop in a particular region based on the operating frequency and the total utilization. A
very brief description of the tools learnt and its specific use is included.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Srivastava, Saurabh (200501049)

IP Header Compression; 5 p.; 2009.
Banerjee, Asim
Pottabathula, Praveen Kumar, Sr. Lead Engineer, Qualcomm, Hyderabad
Van Jacobson header compression
With the increasing use of internet, it becomes more and more important that we utilize the scarce
network resources efficiently. The TCP/IP headers have a combined size of 40 octets. This proves
to be a significant overhead in case of interactive traffic (payload equals a few bytes) over low speed
serial links. Several header compression protocols have been devised to maximize the link efficiency
(Ratio of payload to header + payload). Van Jacobson Header Compression [1] is one such
40
protocol. It uses the redundancy in the transmitted headers to minimize the header size.
I propose to study this protocol; develop it as an independent library and create dynamic memory
scheme for the same. Further I would be developing testing modules for its verification over
Software Unit Test Framework, SUTF.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Srujan Kumar V. H. N. (200501195)

Automatic Identification of Cephalometric Landmarks; 4 p.; 2009.
Banerjee, Asim
Cephalometry, Cephalogram; Cluster algorithm; LVQ neural network; Active shape models (ASM).
Cephalometry is a process performed using radiographic images to aid in growth and development
of cranio-facial treatments. This process is generally used by orthodontic surgeons. This process
involves accurate measurements which if performed manually is vulnerable to inconsistencies.
These inconsistencies can be significantly reduced by using automated Cephalometry. An approach
has been drafted using adaptive coordinates space to automate the localization of landmarks.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Subramaniyan, G. S. Neeraj (200501141) and Chandra, Y. Sharad (200501143)

System Dynamics of a Fresh Food Store; 6 p.; 2009.
Chatterji, Samaresh
System dynamics; Fresh food store
Our Project involves the study of an existing system using System Dynamics. Lately big players
have entered the retail market in India and selling fresh food to consumers is the major concern.
The system chosen by us is regarding a Fresh food store. We intend to study the intricate factors
that play an important role in the progress of the supermarket taking in changing factors like
competition, popularity, marketing strategies, customer employee dynamics and products. We have
divided our project into four phases. These phases involve: - initial study of the system, making
theoretical models and collecting preliminary data, conducting base runs with this data and
performing iterations of the model and finally conducting scenario runs on the model by varying
policy parameters.
Author:
Title:
Supervisor:
Keywords:
Abstract:
SuryaNarayana, P.S.V. (200501229)

Shortest Path Algorithm; 4 p.; 2009.
Chatterji, Samaresh
Equivalence class, Path branching, Directed graph, Dijkshtras algorithm
Computing the shortest path between two points is a long standing problem in computational
geometry which has been studied extensively. It is used in many applications like networking, sensor
networks, robotics etc. Given a planar set of polygonal obstacles with disjoint interiors, the problem
is to compute a shortest path between two points avoiding all the obstacles. Several algorithms have
been developed to solve this problem. It is proposed to experimentally compare the performance of
the Hershberger, Suri and Mathew Maxels algorithm[3] on finding the k-shortest paths with a
standard algorithm[4][5].
Author:
Title:
Supervisor:
CoSupervisor:
Keywords:
Abstract:
Swain, Satyajit (200501089)

Game AI Library for NPC Motions in Mobile Games; 6 p.; 2009.
Jat, P. M.
Kam, Matthew, Carnegie Mellon University
Artificial Intelligence; Game AI; Mobile games; Traditional games
The growth of mobile gaming market offers considerable potential for deployment of engaging and
compelling games constructed using AI components and techniques. Game AI is an area with
incredible potential to increase players immersion and fun. However currently there is a shortage of
Game AI middleware designed specifically to suit the resource constraint mobile devices.
41
In our research project we have to address this gap by developing a Game AI library specifically for
mobile based games. This report discusses the motivation, our approach in designing the Game AI
library and the functionalities included in the library. We have also prototyped 2 games using our
Game AI library as a proof of concept. The report also includes an evaluation study conducted to
study the effectuality of our Game AI library.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Talwar, Ankit (200501003) and Goenka, Anushree (200501096)

An Empirical Investigation of Capital Asset Pricing Model in India; 5 p.; 2009.
Chatterji, Samaresh
CAPM; Risk-return; Beta; Book to market value; Regression analyses.
The Capital Asset Pricing Model (CAPM) suggests a linear relationship between the expected return
and the risk of an asset. The purpose of this study was to verify the risk-return relationship and the
dependency on time of the Capital Asset Pricing Model. For this purpose data from 1998-2001 and
2005-2008 was used. The paper outlines the hypotheses under investigation, the methodology used
and our findings for the application of the model on Indian capital markets. The study did not show
results supportive of the proposed model.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Taneja, Rajat (200501001) and Bhargava, Shobhneet (200501055)

Web-based Application for Querying Institute Ontology; 5 p.; 2009.
Jat, P. M.
ARQ, Jena; Ontology; OWL; RDF; Semantic web; SPARQL.
Semantic web promises searches to be more precise and meaningful on the web. While building
ontologies is first step towards realizing semantic web, having suitable applications to answer
queries are equally important. This work is an attempt towards creating a generic application that
queries ontologies.
Author: Todi, Rahul (200501084)

Title: Implementation of Coverage Driven Verification for verifying AHB Bus using Axiom CDF; 4 p.;
2009.
Supervisor: Dubey, Rahul
On site
Srinivas, Sakhamuri and SaiGanapathy, Srinivas
Supervisor:
Keywords: Coverage driven verification; Functional coverage; AHB protocol.
Abstract: Verification still remains one of the most strenuous and time consuming part of the development
cycle. A lot of effort has been put to come up with a number of strategies and experiment different
things that would help automate and simplify the verification process. A new methodology of
Coverage Driven Verification has been very effective to cut down on the resources and time
involved. In this paper we will implement this concept for verifying AHB protocol using the tool
Axiom CDF and compare the results with the existing process.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Thota, Sai Gopal (200501116)

Feature enhancement and Code Quality Improvement for Camera Software; 4 p.; 2009.
Banerjee, Asim
Lakkaraju, Deepthi S.
Automation; Storage devices; Optimization; Debugging; Testing; Camera sensor; Tuning.
Exponential growth in technological innovation and competition demanding innovative products
and features from the developer community is leading to their continuous effort in adding value to
the existing features. To make the developers working environment less tedious, newer ideas to
reduce the "presence" of the developer for different tasks where automation is feasible can be
developed. Also optimization of time and resources , testing and fixing issues are an integral part of
any application development scenario. Our project, "Feature enhancement and Code quality
42
improvement for camera software" tries to address the issues discussed here and develop tools.
Author:
Title:
Supervisor:
On site
Supervisor:
Keywords:
Abstract:
Tyagi, Anupriya S. (200501204)

SMG Web Development; 5 p.; 2009.
Jat, P. M.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Vamshi Krishna, G. (200501131)

System Dynamics Model for National Parks; 4 p.; 2009.
Chatterji, Samaresh
System dynamics; National park; Feedback; Loop; Flows; Stocks; Stock-Flow diagram.
A mathematical model is the mathematical representation of a process, device, or concept by means
of a number of variables which are defined to represent the inputs, outputs, and internal states of
the device or process, and a set of equations and inequalities describing the interaction of these
variables. With the analysis of a National Park, efforts have been concentrated in feasibility of
running a National Park where National park would be facing problems from many factors like
Human settlement inside the parks, cattle grazing inside the park, poachers inside the park etc. The
focus was mainly on three goals. First, it is targeted at understanding the problems raised inside the
National Park. Second, is to examine dependencies of some of the main factors causing these
problems. Third, critically analyzing some of the policy options and making a few policy
recommendations, within the scope of the model.
Mathur, Neeraj
Requirements; Entity Relationship diagram; Class diagram; Testing.
The Sensor Mechanical Group (SMG) of the Indian Space Research Organisation (ISRO) are
getting developed a web based portal through/with the help of which most of the paper work can
be reduced, information is available at a click, redundancies in job reduce, combined with built in
softwares so that they can do their work from anywhere and can easily access needed information
anywhere and anytime. Moreover, have an organized web based system to keep their project work
organized. Thus, my BTech project has been to develop the Sensor Mechanical Group Web
System.
Vamsi Krishna, T. (200501198)

Developing of Web Services using WS-Engineer; 5 p.; 2009.
Chaudhary, Sanjay
Service oriented architecture; Commercial web services; Business process execution language
(BPEL), WS-Engineer.
Abstract: Service Oriented Architecture provides methods for systems development and integration where
systems, group functionality around business processes and package them as interoperable services
and it is now widely used now to develop and integrate the highly heterogeneous systems. WSEngineer, a model based approach for web service orchestration and choreography is a new
methodology for designing the web service interactions. In this work, a sample SOA system is
designed partly using WS-engineer and analyzed vis--vis a conventional one. Commercial web
services are employed in the application development to get hands-on with the real world
applications.
Author:
Title:
Supervisor:
Keywords:
Author:
Title:
Supervisor:
Keywords:
Abstract:
Varma, K. Phani Kumar (200501125)

Verification of Graceful Tree Conjecture; 4 p.; 2009.
Amin, Ashok T.
Graceful Trees; Graceful Tree Conjecture; Tree Isomorphism; Number Of Non-Isomorphic Trees.
Graceful Tree conjecture had captured the imagination of the mathematicians for years. Graceful
tree conjecture had neither been proved nor contradicted. Most of the work on graceful trees till
now had tried to prove or disprove the Graceful Tree Conjecture and had succeeded in classifying
43
some types of trees as graceful. One approach to solve the graceful tree conjecture is to verify how
many trees are graceful for a certain number of vertices n. If the number of non-isomorphic trees
for n vertices is same as number of non-isomorphic graceful trees for n vertices, we can say that all
trees with n vertices are graceful. We will try to prove the graceful tree conjecture for as large a n as
possible or will disprove the graceful tree conjecture if we find that number of non- isomorphic
graceful trees are not equal to number of non-isomorphic trees for certain n. Till now, a brute force
approach is used to find out whether all the trees are graceful for a certain number of vertices n. We
propose a better approach and had proved the graceful tree conjecture for 11 vertices.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Varshney, Varun (200501079)

3D Simulation and Environment Visualization; 4 p.; 2009.
Desai, Binita and Roy, Anil K.
3D simulation; 3D Engines; Environment visualization.
3D simulations and virtual reality is rapidly changing the world as they are the new demonstration
tools used in design visualizations, architecture demos, training facilities, simulators and games. 3D
visualization provides a real time effective solution for the depiction of procedure of functioning of
a machine or process or any environment. Today 3D simulations are used in numerous applications
because they form an effective teaching tool. They can be used to teach medical students on how to
carry out a complicated surgery, train employees of a production pipeline to assemble complex
mechanical parts and to demonstrate the difficult functionalities of a new mechanical product.
Virtual reality enables the end user to experience any environment. In this world of Internet it is a
revolutionary process whereby the user can experience at the click of a button.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Verma, Risav Kumar (200501193) and Puvvala, Sai Charan (200501194)

Tata Nano: A Case Study Using System Dynamics; 5 p.; 2009.
Chatterje, Samaresh
System dynamics; Automobile market; Study model
Tata Nano is one of the most happening and popular projects of recent times in the automobile
industry. It is expected to bring about a revolution in the industry and drastically change the
automobile market of India. It has already gained a worldwide publicity and made it into the
Guinness Book of World Records before actually being produced. It is a complex project whose
success or failure depends upon the interaction of various factors. We have used the System
Dynamics approach to model the production of Tata Nano and study the various factors which
play a key role in the working of the system. The model thus prepared is used to analyze and study
the different consequences of the factors affecting the system.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Ved, Harshal (200501020)

Low power NEDA based 1D-DCT Architecture; 4 p.; 2009.
Nagachoudhuri, Dipankar
Discrete cosine transform; Guarded evaluation; Low power; Precision levels.
This paper presents a new methodology to reduce power consumption of New Distributed
Algorithm (NEDA) based 1D DCT architecture. The methodology is based on restricting the
number of bits that are used to represent DCT coefficients. The new methodology enables a
significant amount of hardware reduction and power saving up to 16% while achieving acceptable
values of Peak Signal to noise ratio (PSNR) for transformed images.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Vishnu Kanth, Irukulapati Naga (200501196) and Srinivas Balu, Seshu (200501169)
Implementation of Adaptive Filters using Subband and Frequency Domain Techniques; 5 p.; 2009.
C. Vijaykumar
Frequency domain adaptive filters (FDAF); Sub band.
Adaptive signal processing applications such as adaptive equalization or adaptive wideband active
noise and echo cancellation involve filters with hundreds of taps required for accurate
44
representation of the channel impulse response. The computational burden associated with such
long adaptive filters and their implementation complexity is very high. In this report, first we
compare time domain and frequency domain implementations of adaptive filters and found that
frequency domain structures yields better results than time domain for very long impulse response.
In the next part of the report, estate the results obtained from implementations of adaptive filters
using sub band and frequency domain techniques.
Author:
Title:
Supervisor:
Keywords:
Abstract:
Yadav, Khushvant (200501156)

Embedding of Binary Trees in Hypercube and Related Graphs; 5 p.; 2009.
Chatterji, Samaresh
Binary tree (BTn); Caterpillar (C); Hypercube (Qn); Augmented cube (AQn); Embedding
Many interconnection networks work on the topology of hypercubes and a lot of work has been
done in past to develop methods for building more efficient interconnection networks using
hypercube topology. Embedding binary trees into another network the hosts network here the
hypercube network, helps in designing solutions for the host network using the known solutions on
binary trees. This report consists of overview of background study done in embedding of binary
trees in hypercubes and augmented cubes. Some related work done in this area is also being shown.
45
Author Index
Gadde, Apuroop, 12
Gadde, Ramachandra Rao, 12
Gaddh, Rohan, 12
Garg, Amit, 12
Garg, Sagun, 13
Garg, Saurabh, 31
Goenka, Anushree, 42
Golcha, Manish, 36
Gopi, Nitin, 13
Gowtham Srinivas P., 13
Goyal, Abhas, 13
Goyal, Ankush, 14
Goyal, Deep, 14
Goyal, Gourav, 14
Grandhi, Ravi, 16
Gupta , Rubish, 13
Gupta, Aakar, 14
Gupta, Abhishek, 15
Gupta, Amit, 15
Gupta, Anurag, 15
Gupta, Divyank, 15
Gupta, Pawan, 5
Gupta, Rohit, 16
Gupta, Sachin, 16
Gupta, Shekhar, 16
Iraveni, Ashok Kumar, 17
Jain, Amit, 17
Jain, Ankit Kumar, 3
Jain, Anurag, 17, 18
Jain, Chaitanyam 18
Jain, Kapil, 37
Jain, Khyati, 12
Jain, Manish, 18
Jain, Mohit, 18
Jat, Madan Lal, 19
Jha, Anju, 19
Jhunjhunwala, Harsha, 19
Jindal, Nitesh, 20
Jindal, Puneet, 12
Joshi, Apurva, 20
Joshi, Prachi, 20
Josyula, Prakash, 20
Kalra, Anshika, 21
Kalyampudi, Poornachand, 21
Kapoor, Vishav Vikram, 24
Karteek T., 21
Khandelwal, Swapnil, 21
Khanted, Ravin, 22
Abhinav Krishna, 11
Abhinav Vijay, 1
Aditya Prakash, 1
Agarwal, Ambuj, 1
Agarwal, Himanshu, 2
Agarwal, Ritu, 2
Agarwal, Somya, 7
Aggarwal, Vineet, 2
Agrawal, Ankit, 2
Agrawal, Manish, 3
Agrawal, Rohin, 3
Anuj Kumar, 3
Aravindh, V. V., 3
Arjun Singh, 4
Bagga, Sumit, 4
Bagla, Sumit, 4
Bajaj, Prashant, 27
Baphna, Ankit, 4
Baser, Puneet, 5
Batra, Sangam, 5
Bhagya, Rohit, 5
Bhargava, P.V. Vijay, 5
Bhargava, Shobhneet, 42
Bhatia, Nitesh, 6
Bikualla, Avinash, 6
Bontha, Srikanth Reddy, 6
Boppudi, Ravi Teja, 6
Chandra , P. Satish, 7
Chandra, Sakshi, 7
Chandra, Y. Sharad, 41
Chaplot, Vikrant, 7
Chauhan, Sidhartha, 8
Cheedi, Kalyan, 7
Chitneni, B. K Nagarjuna, 8
Chittor, Aditya, 8
Chouhan, Kishan Singh, 8
Chowdhary, B. Aneesha, 9
Daggumati, Pallavi, 9
Daiya, Abhishek, 9
Dantuluri, Udaya Bhaskar, 9
Dargar, Apurva, 10
Das, Aniruddha, 10
Dasksha Gouri, 6
Das, Prabhu Dutta, 10
Dayal, Akash, 11
Dholakia, Rounak, 11
Dhulipala, Hima Kireeti Srikanth, 11
Dubey, Ojas, 11
46
Author Index
Kishore, Anil, 22
Koganti, Nishanth, 22
Koneru, Tilak, 22
Konkimalla, Sravani Ratna, 22
Kotapati, Sreekanth, 22
Krishna Teja, V., 23
Krishna, R.V.S., 23
Kuchipudi, Kashyap, 23
Lakkaraju Ramesh, 23
Lal, Siddhartha, 24
Lal, Suvansh, 24
Lalwani, Vishal, 11
Macharla, Divya, 24
Madhavapeddi, Swetha Sri, 25
Malik, Kunal, 1
Malviya, Ratnesh, 25
Manmeet Singh, 24
Maremanda, Sudha Praveen, 25
Mathur, Akhil, 25
Meel, Praveen, 26
Mehrotra, Saransh, 26
Merwana, Umang, 26
Mishra, Abhinesh, 14
Mishra, Mayank, 26
Mittal, Ashish, 27
Mittal, Saumya, 32
Mittal, Saurabh, 28
Modi, Ankit, 27
Mundra, Anik, 5
Mundra, Ankit, 10
Muraharirao, Siva Charan, 27
Murthy, R. Satyanarayan, 27
Nagireddy, Pradeeep, 28
Nalamati, Rajendra Prasad, 28
Nallavelli, Ramya, 28
Nama, Amit, 28
Navkar Samdaria, 29
Nekkanti, Vasavi Kumar, 29
Nigam, Abhinav, 32
Nirdesh Kumar, 32
Nunia, Vikas, 29
Pandey, Jitendra Kumar, 26
Pandey, Sumit, 17
Pareek, Ritika, 31
Parikh, Gaurav, 34
Parimi, Varun Rajendra, 30
Patnaik, Nandini, 30
Pitchikala, Satish, 30
Prakash, Nikhil, 31
Praveen Kumar, 30
Prithvi Raj Krishna, N. S., 31
Priyanka.B.K., 31
Purohit, Autul, 31
Purohit, Raj Rishi, 32
Puvvala, Sai Charan, 44
Ram, G., 32
Ramnani, Vikas, 10
Ramrakhiyani, Laveen, 32
Rathi, Pankaj Kumar, 32
Ravi Shankar, G., 33
Reddy D., Ravindra Kumar, 13
Reddy, P. Vivek, 33
Reddy, V. S. Goutham, 33
Rimmanapudi, Ravi Kiran, 34
Rout, Lipsa Shrabani, 34
Rungta, Mohit Kumar, 34
Sahoo, Rohit Kumar, 34
Sai Teja P., 34
Saini, Milan, 14
Sambu Shiva Sai Krishna Prasad, 35
Sampath, P. Shanmukha, 35
Saxena, Shubham, 35
Shahani, Kapil, 34
Shaik, Khaja Ahmad, 36
Sharma, Amit, 36
Sharma, Anshul, 36
Sharma, Ashish, 36
Sharma, Gaurav, 37
Sharma, Ruchi, 37
Sharma, Sudhanshu, 37
Shashank Kumar, 38
Shekhar, Praveen, 38
Shekhawat, Ajeet Singh, 38
Shettigar, Samata, 38
Shrinkhala, Kirti, 39
Sidharth Kumar, 1
Singhal, Ankur, 39
Singhania, Shruti, 39
Sinha, Rahul, 39
Somani, Abhishek, 16
Soumya, P. V., 40
Srinivas Balu, Seshu, 44
Srivastava, Ankit, 40
Srivastava, Anuj, 29
Srivastava, Nishant, 40
Srivastava, Saurabh, 40
47
Author Index
Srivastava, Vinay Kumar, 30
Srujan Kumar V. H. N., 41
Subramaniyan, G. S. Neeraj, 41
SuryaNarayana, P.S.V., 41
Swain, Satyajit, 41
Talwar, Ankit, 42
Tandle, Sawant, 34
Taneja, Rajat, 42
Thota, Sai Gopal, 42
Tiwari, Anukool, 29
Todi, Rahul, 42
Tyagi, Anupriya S., 43
Vamshi Krishna, G., 43
Vamsi Krishna, T., 43
Varma, K. Phani Kumar, 43
Varshney, Varun, 44
Varun Raj C. V., 38
Ved, Harshal, 44
Verma, Risav Kumar, 44
Verma, Sparsh, 32
Verma, Swati, 39
Vishnu Kanth, Irukulapati Naga, 44
Yadav, Khushvant, 45
Yenugula, Naveen, 28
48
Supervisor Index
Amin, Ashok T., 2, 7, 19, 27, 30, 35, 39, 43
Banerjee, Asim, 3, 4, 5, 8, 10, 12, 13, 19, 20, 25, 32, 40, 41, 42, 44
C. Vijaykumar, 3, 5, 11, 14, 27, 30, 32, 38, 39, 44
Chatterji, Samaresh, 4, 6, 7, 9, 11, 12, 13, 21, 22, 23, 24, 28, 31, 34, 35, 36, 41, 42, 43, 44, 45
Chaudhary, Sanjay, 2, 6, 8, 11, 13, 14, 16, 17, 27, 29, 30, 36, 43
Das, Manik Lal, 7, 14, 16, 17, 24, 27, 29, 36, 38, 39
Desai, Binita, 3, 38, 44
Divakaran, Srikrishnan, 15, 20, 33, 39
Dutta, Gautam, 1
Dubey, Rahul, 3, 15, 23, 24, 30, 31, 40, 42
Ghodgaonkar, Deepak, 26
Gupta, Manish K., 35
Gupta, Sanjeev, 1, 5, 31, 32, 37
Jat, P .M., 6, 8, 13, 14, 17, 19, 22, 26, 29, 33, 41, 42, 43
Joshi, Manjunath V., 7, 12, 22, 23, 25, 34, 37, 38
Jotwani, Narresh, 1, 2, 15
Mandal, Shushanta, 9, 18
Mathuria, Anish M., 8, 14, 18, 20, 24, 34
Mitra, Suman K., 1, 2, 4, 5, 10, 22, 33
Mohan, S., 9
Nagchoudhuri, Dipnkar, 2, 6, 26, 44
Pandya, Abhinay, 15, 24
Parikh, Chetan D., 2, 10, 16, 28, 36, 40
Patil, Hemant, 18, 26, 32, 37
Ranjan, Prabhat, 18
Raval, Mehul, 11, 25, 28
Roy, Anil K., 2, 3, 9, 21, 29, 38, 44
Sarkar, Aditi Nath, 18, 26
Srivastava, Sanjay, 31
Venkatraman, Hrishikesh, 21
V. Sunitha, 22, 25
49
Resource Centre
DA-IICT
Near Indroda Circle
Gandhinagar - 382007
Phone: 079-30510578
E-mail: rcservices@daiict.ac.in

Full Catalogue 2005 09

Uploaded by

Copyright:

Available Formats

You might also like

Full Catalogue 2005 09

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Full Catalogue 2005 09

Uploaded by

Copyright:

Available Formats

Catalogue

Updated on: 25/03/2010

Resource Centre Team

Ultra Wide Band Transmission and Receiver Design

By Abhinav Vijay and Kunal Malik

Prakash and Sidharth Kumar

Parking Lot Management System

Intelligent Traffic Management - Segregation of Vehicles using Video Images

On Uniquely Diagnosable Fault Sets in Diagnosable Systems

Context Aware Semantic Service Discovery

By Manish Agrawal and Ankit Kumar Jain

Detection of Digital Image Manipulation

Design and Development of Mobile Intelligent Tutoring Systems

Experimental Evaluation of Dynamic Data Structure for Point Location Problem

Performance Analysis Tools for ARM

BREW MP Eclipse Plugin

Contour Extraction of moving object in a still camera video

Aperture Coupled Microstrip Antenna

Polarimetric SAR Data Processing

Parallel Query Optimization for Join Framework of Pig Latin

PC-Based Tool for Comprehensive Test Application

By Srikanth Reddy Bontha

Optical Character Recognition

Acyclic Orientation of Undirected Graphs to Maximize Reachability

By Sakshi Chandra and Somya Agarwal

Bluetooth Security Using Identity Based Encryption

Algorithms for finding a Minimal Dominating Set in a Graph

OLAP Technology for Business Intelligence Analytics System in Retail Enterprises

Design Pattern Recognition Using DSM

Activity and Budget Monitoring System for ATMA

By Kishan Singh Chouhan

Designing CIL Connector To Scyther

Development and optimization of CMOS Structured ASIC libraries

Hafnium Oxide Gate Dielectrics for Microelectronics Applications

Robot Motion Planning

A Novel Design for a Current Feedback Amplifier

By Apurva Dargar and Ankit Mundra

Mobilizing Community Health Workers to Improve Maternal Health in India

By Prabhu Dutta Das

Vehicle make and model recognition

A Case Study in System Dynamics

High Performance Implementation of Pulsed OFDM For Ultrawideband Communications

By Hima Kireeti Srikanth Dhulipala

Semantic Web for Agriculture Production (SWAP)

By Ojas Dubey and Vishal Lalwani

Depth estimation in a Low Depth of Field image

A Randomized Linear Time Algorithm to find Minimum Spanning Trees

By Ramachandra Rao Gadde

Development of GSM Protocol through LPC2106 Microcontroller

By Amit Garg and Puneet Jindal

Semantic Search Engine

Developing Ontology for Indian Technical Institutes

By Gowtham Srinivas P. and Reddy, D. Ravindra Kumar

An optimized LVQ algorithm for multi-interval discretization of continuous values

By Ankush Goyal and Abhinesh Mishra

Public-Key Cryptography Using Paraunitary Matrices over Fields of Characteristic Two

Formal Analysis of Hierarchical Key Assignment Schemes

By Aakar Gupta and Milan Saini

Extending cursor - A New Technique for Enhancing Target Acquisition