Full Catalogue 2006 10

Catalogue
of
B.Tech. Project Reports
Batch - 2006-10
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 2006-2010 batch students to the Institute. This document covers in all 141
projects submitted by 2006-10 batch students and are listed in alphabetical order under each
year by student’s 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: 08/10/2010 Resource Centre Team
i
Contents
Batch - 2006-2010
1. Hardware Approaches to System Security 1
By Animesh Agarwal
2. Investor Facilitation Portal It Solution for Investors 1
By Ankit Agarwal
3. Design and Simulation of a 2.4 GHz Low Noise Amplifier 1
By Rohit Agarwal
4. Heuristic for Multiple Sequence Alignment 2
By Sweta Agarwal
5. Acyclic Edge Coloring of Subquartic Graphs 2
By Karan Aggarwal and Anurag Sharma
6. Corporate Fed Microstrip Array: Theory and design 2
By Ankit Agrawal
7. KnowledgeNet A Comprehensive System for Research Community and Industry Professionals 2
By Ankur Agrawal and Kapil Khandelwal
8. Multiband Multi-Fractal Antenna Analysis and Design 2
By Shruti Agrawal
9. M V C Architecture, PHP Unit Testing and MDX 3
By Sudhanshu Agrawal
10. Flashing Tools 3
By Vinay Agrawal
11. Analysis of a Certificate-less Key Agreement Scheme 3
By Akshun Kumar
12. Design of a Planar RFID Tag Antenna at Microwave Frequencies 3
By Ranajeet Anand and Sameer Dubey
13. Filtering False Data Injection in Wireless Sensor Networks 4
By Anudeep C.
14. Basic Arithmetic Using DNA Self Assembly 4
By K. Avinash and Bhooma B. Reddy
ii
15. ImageCense: Improving Image Communication Efficiency and Data Rate 4
By U. L. N.Bhargav
16. Motion Segmentation Using Normalized Cuts 4
By Manisha Biyani
17. Application of Genetic Algorithm in Implementation of Technical Trading Rules in Stock 5
Markets
By Kushal Bhola and Rishi Josan
18. E-District - Bringing Govt. Services To The Doorstep of Citizen 5
By Shashank Bolia and Anshul Mehta
19. Developing and Profiling of Parallel Scilab Application Using OpenMP 5
By P. S. S. Chaitanya and Ramya Bolla
20. Storytelling based Vocabulary Learning on Cell Phones 6
By Anshul Chaurasia
21. Study of Static and Dynamic Code Analysis 6
By Vishal Singh Chauhan
22. Virtual Environments Navigable Over The www 6
By Akhil Chennuru and S.S. Prem Kumar

23. Classifieds on Mobile 6
By Jatinder Singh Chhabra
24. Data Compression Algorithm 7
By Smit Choudhary
25. Saba Assessment Authoring Tool 7
By Nikhil Kr. Dalmia
26. Extending CAN clusters using IEEE 802.11b standard for industrial communication 7
By Dhruv Dani
27. Solving Data-intensive Problems Uusing Hadoop 7
By Anoop Kumar Dhanvijay
28. India Research Portal 8
By Harsh Dhulia
29. Implementation of Pmipv6 in Ns2 8
By B. Divya, and M. Sai Sujith Kumar Reddy
iii
30. Emulator Based Approach for Functional Verification 8
By Dorav Kumar
31. Online Load Balancing Of Temporary Tasks On Unrelated Machines 8
By Prashant P.Dutta
32. Power and Overflow Optimization of Wireless Sensor nodes Using Queueing Models 9
By Sudhanshu Dwivedi and Anshul Goel

33. Confro-Query 9
By Khushal Garg
34. Implementation of USB 2.0 Transceiver Macrocell 9
By Sai Suneel Goda
35. Analysis of the Complexity of Multinet Pvt. Ltd. Network 10
By Prateek Goyal
36. Speaker Recognition from Their Hum and QBH (Query by Humming) 10
By Shri Krishna Goyal
37. Embedded System Design for fuel measurement and tracking Vehicles 10
By Jayesh Gumber
38. Image Processing for the Quality Assessment of food grains using Parallel Programming 10
By Ankit Gupta and Somya Garg
39. Post Flood Estimation 11
By Anurag Gupta and Rohan Bhandari
40. Performance Analysis of Minimum Spanning Tree Algorithms 11
By Mradul Gupta
41. Pragmatic Financial Investment Analyzer 11
By Nakul Gupta and Anurag Nigam

42. A Mobile Application for Illiterate and Semi-Literate Users 11
By Sanchit Gupta
43. IR Text Collection in Punjabi 11
By Saurabh Gupta
44. RFC 1981 (IPv6 Path MTU Discovery) Compliance in Mobile Phone’s Data Service Protocol 12
Stack
By Setu Gupta
45. Information Extraction with Logic Programming 12
By Sumit Gupta
iv
46. PAPR Comparison between different multiple carrier FDMAs 12
By Anshul Jain and Mayank Singhai
47. French Tuesdays (iPhone APP. Development) 12
By Ansu Jain
48. Zipher: A Context-Aware Game for Mobile Phones Over Bluetooth 13
By Ashwin Jain, Hari, C. and Saket Pandey
49. Network Infrastructure Management System & SLA Generation Tool 13
By Prateek Jain
50. Remotely Accessible Virtual Drawing Board (rSpace) 13
By Rachit Jain
51. Proxy Re-Signature 13
By Rajesh Kumar Jain
52. A Simple Protocol for Computing Aggregation Function Min/Max in Wireless Sensor Nodes 14
By Sneha Jain
53. Security Analysis of Two Handover Authentication Protocols Using Protocol Composition 14
Logic
By Aanchal Jindal
54. Audio Video-Synchronization 14
By Shobhit Jain
55. Characterization and Thermal Resistance Estimation of AlGaN/GaN based High Electron 14
Mobility Transistors
By Tanu Jindal
56. Self Assertive Device for Helping People with Cerebral Palsy 15
By Sanika Joshi and Brijesh Chokhra

57. Data Entry Operator System using CRM 15
By Hitesh Kamra
58. Game Theory In Stock Exchange 15
By Kavita
59. Dew Harvesting: Models and Analysis 15
By Manish Khandelwal
60. DWT-based Digital Image Watermarking 16
By Bharath Kolli
v
61. System Dynamical Modeling of Role of Microfinance in Poverty Alleviation 16
By Venkata Siva Ramakrishnh Kolli
62. A Light-weight Rule Engine for Wireless Sensor Network 16
By Ramakrishna Konda
63. Study of Fujito’s 2- Approximation Algorithm for Minimum Cost Tree Cover 17
By Pramod Chowdary Koneru
64. GPS less Small Animal Tracking 17
By Sri Harsha R. Koundinya, and Ajay Anaparthi
65. Classification of Normal and Abnormal Tracheal Sounds 17
By Sai Vamsi Krishna

66. Rule Engines 18
By Paras Mani and Vaibhav Yadav
67. Phone Book Manager: Overview and Optimizations on Code and Memory Usage 18
By Ankit Maheshwari
68. Architecture Design of a Processor for Biomedical Applications and Investigation of Latest Full 18
Adder Topologies
By Mohit Maheshwari, and Prashant Garg
69. Dual Band Circularly Polarized Microstrip Patch Antennas For RFID Reader 18
By S. Mahidhar and Ankur Garg
70. Security Proofs for Hierarchical Key Assignment Schemes With Dependent Keys 19
By Murali Medisetty
71. Effect of clustering on energy efficiency of ad-hoc networks 19
By Pranjal Mishra
72. Multiple Sequence Alignment Using Secondary Structures 19
By Arpit Mithal and Namit Jain
73. Graph Coloring Algorithms 19
By Mohit Kumar Mittal and Vijit Agrawal
74. Image Inpainting Using PDEs 19
By Mulagalapati, Murali
75. Cryptanalysis and Improvement of Protocols Integrating Diffie-Hellman Key Exchange into 20
Digital Signature Algorithm (DSA)
vi
By Vivek Munagala
76. Scheduling in Xen 20
By Vardan Hemant Nagar and Rohan
77. Extensions to the Automatic Security Protocol Builder 20
By Kartik Nagar
78. Implementation of LC - 3 as Three Stages Pipelined and Three Sstage Super Scalar Pipelined 21
Processor in Verilog
By Naveen Narang
79. Development of a Sensor Node for Acoustic WSN 21
By Rushi N. Narayana and Prudhvi Reddy
80. Development of USB framework for USB Functionalities on Android 21
By D. Naveen, and Ravi Shankar Konduri,
81. Web Service Composition with BPEL 21
By Mounika Nukala
82. Universal Search UI and Data Feed Extractor 22
By Rahul Kumar Niranjan
83. Rule Engines 22
By Mani Paras and Vaibhav Yadav

84. Bayesian learning of t-mixture Models, SVFMM and Their Application on Satellite Image 22
Segmentation
By Shaifali Parashar
85. Software Transactional Memory 23
By Aditya Pareek and Ajay Kumar
86. Network Infrastructure Management System & SLA Generation Tool 23
By Raviraj Parihar
87. IT Solutions for Intelligence Bureau 23
By Ankit Parwal
88. Kinetic Typography 23
By Ankur Patankar
89. Study of Ant Colony Based Algorithm For Routing in Mobile Ad Hoc Network 24
By Raj Patel and Vikas Jain
vii
90. Subband Adaptive Filtering in Frequency Domain and Coefficient Decimation Filter bank 24
By Sneha S Singhvi Pokarna and Ankit Mishra
91. Primality Testing 24
By Gowtham Potru
92. Locality Aware Parallelism 24
By Mayank Prabhakar
93. Noise Cancellation Adaptive Filter - A MicroBlaze Based Design 25
By Jitesh Kumar Prajapat
94. Sensor Event Service (SES) 25
By K. Uday Bhanu Prasad and Harish Kotagiri
95. Conflict Free Coloring of Some Graphs 25
By N. V. Raghuveer
96. Topology Control And Interference Optimization in Ad-Hoc Networks 25
By Piyush Rai and Himanshu Chauhan
97. Query In RDF Graph for Semantic Search 26
By Vishal Raj
98. Widget for Job Search 26
By Raunak
99. Web Application for Employment Exchange Office 26
By Anvesh Rayankula
100. Simulation Study of Bond Percolation 26
By B. Rohit Reddy and E. Shashidhar
101. Developing Dashboard and Analytics Frame Work for Digital Green System 27
By Sreenivasula Reddy, G.
102. Finding Depth Map from Stereo Images 27
By Jahnavi Reddy and Sanjeeva Reddy
103. Analysis on Overhead Reduction Schemes of Signaling CQI Feedback in LTE Systems 27
By Sneha Reddy and Kaveri Swetha
104. Semantic Web for Agricultural Production (SWAP) 27
By T. A. Sivananda Reddy and Naresh Vangari
viii
105. To Compute The Continued Fraction of Logba Following Shank’s Algorithm 28
By T. Krishna Teja Reddy
106. Optimization of Query Rewriting Techniques For OPDMS and DL-Lite 28
By Gajendra Royal and Ritesh Pagaria
107. Question Answering System: Retrieving Passages 28
By Hitesh Sabnani
108. Rumor Spreading (via Mobile) in Social Networks 28
By Rakesh Salecha
109. CTA Studio 28
By K. SaiSwaroop
110. Fusion of Spectral and Phase Information for Singer Identification 29
By Krishna Pal Singh Sarangdevot
111. SPARQL Query Optimization Through Selectivity Estimation of Triple Patterns 29
By Samahil Sethi and Kumar, Sunil
112. Scenario-based Protocol Checker 29
By Dhruv Shah
113. A Self-Healing and Mutual-Healing Key Distribution Scheme for Wireless Networks 29
By Prasann Shah
114. Towards Improving Web Service Composition and Ranking 30
By Digvijay Singh Shaktawat and Pushpak Aggarwal
115. Implementation of Distributed Data Structures 30
By Anshul Sharma
116. Verification of Digital Systems 30
By Manish Kumar Sharma
117. A CPW-Fed Planar V-Type Monopole Antenna For USB Applications 30
By Vineet Kumar Sharma
118. Virtual 3-D Tour of Bagh Caves 31
By Shashi Kumar
119. Performance Analysis of Jiaxin Wang, Tarjan and Szwarcfiter Algorithms 31
By I. Shiva Rama Krishna and Sudheer Kumar Kethireddy
120. Stack Offence - A Faulty Approach 31
ix
By Vaibhav Shrimali
121. SyMynd - Share your 'my'nd 31
By Abhinav Singh
122. Digital Circuit Design Using Double Gate MOSFETs 32
By Arjun Singha,
123. A Study on Protocol Patching Using SHRIMP 32
By Astha Singhal and Prerna Rustagi

124. Approach Towards a Semantic Multimedia Retrieval Model 32
By Rahul Sirohi
125. Parallelization of Waterman-Smith String Alignment Algorithm 32
By Utkarsh Srivastava
126. Security Issues in IPsec 33
By Vishal Somani
127. Evaluation of Web Server in a Virtualized Environment 33
By M. V. Sudheerkumar and Sandeep Avula
128. Ontology Development For Digital Library In Health Domain 33
By Prakash C. Sukhwal
129. Simulation of Traveling Salesman Problem Using Markov Chain Monte Carlo Method 33
By Suresh Kumar and Rakesh Kumar
130. Automated Detection of False Attacks 34
By Swarnika
131. Multiple Object Tracking and Shape Detection 34
By Kamal Tej Tallam
132. 4-Issue Speculative Superscalar Microprocessor 34
By Vaibhav Temani
133. On-Line Load Balancing 34
By Akash Tiwari, and Arpita Verma
134. Evaluation of Heap Sort Algorithms 35
By Anirudh Kumar Tripathi
135. Towards a Digital Language Knowledge System 35
By Harshita Tripathi and Samir Passi
x
136. Finding Smallest H-Subgraph in Real Weighted Graphs 35
By Venkat, I. Vamsi and M. Amith Kumar,
137. Comparative study of Various Reputation System through Simulations 35
By Ishan Vashistha
138. New Protocol for the Nearby Friend Problem 36
By D. Venkatesh
139. iPaper: a digital substitute of a print paper 36
By Pallav Vyas
140. Comparison Between Algorithms for Solving Discrete Logarithm Problem 36
By V. Harish Vyas
141. Discovery of Semantic Web Services 36
By L. Yeshwanth, and Hari Teja A. Reddy
Author Index 37
Supervisor Index 39
xi
Resource Centre, DA-IICT B.Tech. Projects 2010
B. Tech Projects
(Abstracts)
2006-2010
Author: Agarwal, Animesh (200601147)

Title: Hardware Approaches to System Security; 24 p.; 2010.
Supervisor: Mathuria, Anish
Keywords: Hardware approach; System security; Tagged architecture; Secure bit2; BASS
Abstract: System Security deals with the security vulnerabilities which arise in systems due to the limitations
and properties of the programming language used to code the operating system. This report
explains some of the major threats and attacks which are of concern in the realm of system security.
Then we move onto the some developed approaches to tackle those attacks and threats, with their
merits and demerits. Special attention is given to one particular approach - 'Tagged Architecture'
and is discussed at length, with more focus on the false negatives on this approach. The false
negatives are not just stated, but also experiments have been performed to verify them. Then we
propose xes to help obviate the more severe of the discussed attacks. Also BASS was used as the
testing suite for experimentation and on realising that it does not cover all the cases we made an
addendum to it.
Author: Agarwal, Ankit (200601003)

Title: Investor Facilitation Portal It Solution for Investors; 14 p.; 2010.
Supervisor: Jat, P. M.
Keywords: Framework; IFP; MOU; Online investment
Abstract: Investor Facilitation Portal is a project developed for the Industries Commissionerate, Gujarat
which operates under the Industries & Mines Department, Government of Gujarat. The major role
of this department is to coordinate between different offices for the development of industries and
it plays an important role in promotion, development and monitoring of industries in the state. The
portal is a Mission Mode Project under the National E-Governance Plan.
Author: Agarwal, Rohit (200601178)

Title: Design and Simulation of a 2.4 GHz Low Noise Amplifier, 5 p.; 2010.
Supervisor: Gupta, Sanjeev
Keywords: Impedance matching, gain, LNA (Low noise amplifier), Noise figure, stability factor, S-parameters
Abstract: The following technical report presents the work done on the design and simulation of a 2.4 GHz
low noise amplifier. The design methodology of this amplifier required the analysis of amplifier
stability and proper matching network selection with a low noise figure. For the purpose of
simulation, Agilent’s simulation tool ADS (Advanced Design System) was employed. The transistor
used was FHX35LG which is a super low noise transistor intended for simultaneous low noise and
reasonably high gain in the 2-10GHz frequency range. The design specifications of the amplifier
were laid down initially and the results achieved conform to the laid specifications. The built
amplifier performed extremely well on the tests of gain, stability and noise figure. The Design
Procedure laid down in this report can be used as a step by step method for designing a Low Noise
Amplifier.
1
Author: Agarwal, Sweta (200601022)

Title: Heuristic for Multiple Sequence Alignment; 7 p.; 2010.
Supervisor: Divakaran, Srikrishnan
Keywords:
Abstract: Alignment of multiple biological sequences helps in their structures and biological functionality.
Dynamic programming can help in obtaining optimal multiple sequence alignment of a given set of
sequences. However, as it’ time and space complexity is of order O(nk) , where n is the length of
sequence and k , no of sequences , for alignment of moderately large number of sequences ,
dynamic programming approach are not practical. Progressive alignment methods based on guiding
trees can quickly determine multiple sequence alignment for large no. of sequences, though results
are not ensured to be optimal. In this project, an attempt is made to find relationship between guide
trees and multiple sequence alignment quality and thereby help in designing better quality
progressive alignment algorithms.
Author: Aggarwal, Karan (200601002) and Sharma, Anurag (200601057)

Title: Acyclic Edge Coloring of Subquartic Graphs; 7 p.; 2010.
Supervisor: Muthu, Rahul
Keywords: Graph coloring; Acyclic coloring; Acyclic edge coloring; Acyclic edge chromatic number; Subquartic
graphs, ∆ - regular graph, Graph algorithm
Abstract: It is a well known conjecture that the acyclic edge chromatic number of a simple and finite graph,
'a (G) ≤ ∆ (G) +2. Let m be the number of edges of a graph. In this report we propose an O (m)
time algorithm for coloring a subquartic graph of maximum degree, ∆=4 with 6 colors which works
in majority of the cases.
Author: Agrawal, Ankit (200601116)

Title: Corporate Fed Microstrip Array: Theory and design; 5 p.; 2010.
Supervisor: Das, Manik Lal
Keywords: Directivity; Gain; Microstrip antenna; Microstrip array.
Abstract: A corporate fed microstrip antenna is presented in this report. The antenna is designed in different
phases. First of all the dimensions of the rectangular patch is obtained for a particular frequency.
Second phase consists of construction of an array using the elements of the dimensions obtained
above. Software used to simulate the design is ADS.
Author: Agrawal, Ankur (200601145) and Khandelwal, Kapil (200601077)

Title: KnowledgeNet A Comprehensive System for Research Community and Industry Professionals;
7 p.; 2010.
Supervisor: Chaudhary, Sanjay and Roy, Anil K
Keywords: e-learning; Information systems; Ranking algorithm; Software engineering; Web engineering.
Abstract: This project aims to create a knowledge system which provides a platform for sharing of
information, knowledge, experiences and ideas among different target groups, namely research
community, academia and industry professionals, to enhance quality of education, research and
development. It promotes interaction among registered users of this system to further develop and
integrate these threaded pieces together. The project is build using Component Based Software
Engineering (CBSE) model.
Author: Agrawal, Shruti (200601232)

Title: Multiband Multi-Fractal Antenna Analysis and Design; 4 p.; 2010.
Supervisor: Gupta, Sanjeev
Keywords: Fractal; Multiband; Cantor antenna.
Abstract: The wireless freedom experienced by personal computer, handheld, consumer electronics and cell
phone users is moving into the digital home and office. Nowadays, people want greater freedom
and convenience in connecting all types of devices. There needs to be freedom to use multiple
2
technologies (working on different frequencies) through a single device. The answer is multiband
fractal technology. In this work, some examples of fractal microstrip antenna and multifractal cantor
antenna have been analyzed, based on which a novel multiband fractal antenna has been proposed,
which is designed for RF-ID and WiMAX applications, with a costeffective substrate. The
measured antenna parameters are presented to validate the proposed antenna.
Author: Agrawal, Sudhanshu (200601167)

Title: M V C Architecture, PHP Unit Testing and MDX, 3 p.; 2010.
Supervisor: Raval, Mehul
Keywords: Online analytical processing; Refactoring; PHPunit test; Mocking.
Abstract: Several problems can arise when applications contain a mixture of data access code, business logic
code, and presentation code. Such applications are difficult to maintain, because interdependencies
between all of the components cause strong ripple effects whenever a change is made anywhere.
High coupling makes classes difficult or impossible to reuse because they depend on so many other
classes. The Model-View- Controller design pattern solves these problems by decoupling data
access, business logic, and data presentation and user interaction.
Author: Agrawal, Vinay (200601174)

Title: Flashing Tools; 7 p.; 2010.
Supervisor: Chaudhary, Sanjay , Srinivasan, Nageswari and Pasupathy, Visuvanadan
Keywords: OMAP3; NAND Flash writers; U-Boot, X-Loader
Abstract: Today an embedded system plays an important role in our daily life. All these embedded system
compose many small, but complex, devices like embedded processors, memories, communication
channels etc. This report is a continuation of my BTP part1 report. In order to have better
understanding of this report, it is advisable to go first through my BTP part1 report. This report
explains the detailed layer structure of CCS NAND Flash writer which I have developed for
OMAP3 based platforms. The report also discusses the structure of NAND Flash memory device
and different components which plays a vital role in working of NAND Flash writer.
Author: Akshun Kumar (200601023)

Title: Analysis of a Certificate-less Key Agreement Scheme, 4 p.; 2010.
Keywords:
Abstract: Certificate-less public key cryptography combines the ideas of traditional public key cryptography
and ID-based cryptography. The idea proposes to provide better security where a third party is
required to be trusted. After the first certificate-less key agreement scheme was given by Al-Riyami
and Patterson [2] in 2003 many new schemes have been proposed. In this paper I analyze the use of
certificate-less paradigm in key agreement protocols. We discuss a protocol which was recently
proposed by Boyd, Lippold and Nieto [1] in this paper, analyzing its strength over a given model
and a list of required security attributes.
Author: Anand, Ranajeet (200601186) and Dubey, Sameer (200601189)

Title: Design of a Planar RFID Tag Antenna at Microwave Frequencies, 10 p.; 2010.
Supervisor: Ghodgaonkar, Deepak
Keywords: Directive gain; Patch antenna; Return loss; RFID tag antenna.
Abstract: Two designs of planar passive RFID tag antenna have been proposed which will operate at
frequencies in the microwave range. First design operates at 2.44GHz ISM band while the second
one at 5.8 GHz. The tag provides a return loss (S11) of -20.87dB and directive gain of 4.27 dBi at
2.44GHz and a return loss of -17.53dB and directive gain of 7.91 dBi at 5.8GHz. The size of the
antennas is 100mm x 90mm x 1.8mm. Performance of the antennas at these frequencies is observed
by the results of simulations carried out on the commercially available software CST Microwave
Studio.
3
Author: Anudeep C. (200601020)

Title: Filtering False Data Injection in Wireless Sensor Networks; 5 p.; 2010.
Keywords: Sensor networks; False report; Symmetric; Public key
Abstract: Wireless sensor networks (WSNs) consist of a large number of small sensor nodes equipped with
limited computation capacity, restricted memory space and limited power resource deployed to
detect events of interest. They suffer various malicious attacks, false report injection being one of
them. An adversary can inject false data reports containing non-existent events via compromised
nodes causing false alarms at the base station and draining out energy of forwarding nodes. There
are many symmetric methods to detect and filter false reports. The report analyses the use of public
key techniques and also analyses the scheme proposed by Zhen Yu that uses MACs.It also presents
a scheme using short hash-based signatures in filtering false report injection attacks.
Author: Avinash, K. (200601018) and Reddy, Bhooma B. (200601224)

Title: Basic Arithmetic Using DNA Self Assembly; 7 p.; 2010.
Supervisor: Chatterji, Samaresh and Gupta, Manish
Keywords: Algorithmic self assembly; Tile assembly model; Adder; Subtractor; Multiplier; Divisor; Glues;
Temperature; XGrow.
Abstract: Self Assembly is considered as the process of organizing the existing components into a pattern or
structure which resulted due to interaction among the components themselves. Self Assembly is
generally applied to molecular and nano scale regimes. Tile systems provide a useful model to
understand Self Assembly at nano scale. In this paper we present Basic Arithmetic operations like
Addition, Subtraction and Multiplication using our own tile systems and also compare with the
existing models for the same.
Author: Bhargav U. L. N. (200601240)

Title: ImageCense: Improving Image Communication Efficiency and Data Rate; 9 p.; 2010.
Supervisor: Ranjan, Prabhat
Keywords: IEEE 802.15.4; Base; Node; Wireless sensor network, Xbee firmware API, Real time clock
Abstract: Wireless Sensor Networks (WSN) are built on three fundamental concepts: Processing,
Communication and Sensing. All WSNs are heavily power constrained and tiny savings in energy
could lead to higher benefits as time progresses. With the current advances in VLSI and chip design,
energy consumed due to processing and sensing can be limited to a fair extent. Contrary to this,
communication in WSN is an area which has great scope for advancements in energy savings. My
work is in based on ImageCense, a sensor network which involves transmission of images amongst
sensor nodes. I won’t be concentrating on the applications for ImageCense which are vast and
plenty. Unlike other sensor networks, image sensor networks put in huge loads of data into the
communication part of WSNs which is by far inefficient in terms of energy and power. On top of it,
we transmit images over the IEEE 802.15.4 standard which is tailor-made for low data rate
applications contrary to the one which we would like to have. This paper provides some
improvements and suggestions on the same in the communication part of the existing ImageCense
nodes and the results obtained.
Author: Biyani, Manisha ( 200601217)

Title: Motion Segmentation Using Normalized Cuts; 6 p.; 2010.
Supervisor: Banerjee, Asim
Keywords: Image segmentation; Motion; Frames; N-cut algorithm; Graphical approach
Abstract: Motion Segmentation is a means of separating moving objects in a video from a static background.
The background image is accumulated over multiple images and the invariant values of each pixel
are taken to be the background after a certain number of frames. When there are a series of images
detecting regions of change in them of the same scene taken at different times is of widespread
interest. Important applications of this change detection include video surveillance, remote sensing,
medical diagnosis and treatment and traffic monitoring. It usually involves image registration, which
4
is aimed at removing meaningless changes caused by camera motion and followed by subsequent
steps, motion segmentation is done. Graph theoretic approaches have been widely used for
performing segmentation. In this report we have studied one such interesting graphical method
using Ncut.
Author: Bhola, Kushal (200601032) and Josan, Rishi (200601080)

Title: Application of Genetic Algorithm in Implementation of Technical Trading Rules in Stock Markets;
7 p; 2010.
Supervisor: Chatterji, Samaresh
Keywords: Filter rule; Stock market data mining; Genetic algorithm; Technical trading rules; moving average
Abstract: This report discusses the application of Genetic algorithm in stock market data mining
optimization. Technical trading rules aid in making financial decisions based on historical data i.e.
opening/closing prices of shares in a stock market index. The selection of values for different
parameters of Filter rule presents a problem, as the range of parameters and hence the no. of
combinations is very large. We intend to address the above mentioned problem using GA to find
near optimal values of the parameters. Secondly, we would use these parameters to check the
profitability of using that particular trading rule. Thirdly, we would compare the performance of
Filter rule with the performance of various moving average rules across different time periods and
using different parameters.
Author: Bolia, Shashank (200601200) and Mehta, Anshul (200601190)

Title: E-District - Bringing Govt. Services To The Doorstep of Citizen; 7 p.; 2010.
Supervisor: Raut, Manoj
Keywords: e-District; Web portal; Government to citizen(G2C) services
Abstract: e-District is an initiative of the Department of Information technology(DIT), Ministry of
Communication & Information Technology (MCIT), and Government of India. It has been
identified as one of the Mission Mode Projects at the State level. The project aims at providing
support to the basic administrative unit i.e. “District Administration” to enable content
development of G2C services (Govt. to Citizen), which would optimally leverage and utilize the
three infrastructure pillars, the State Wide Area Network (SWAN) for connectivity, State Data
Centre (SDC) for secure and fail safe data storage, and Common Service Centers (CSCs) as the
primary front-ends for service delivery to deliver services to the citizens at their doorstep. e-District
project involves integrated and seamless delivery of citizen services by district administration
through automation of workflow, back end digitization, integration and process redesigning across
participating sections/departments for providing services in a most efficient manner to the citizens.
Author: Chaitanya, P. S. S. (200601094) and Bolla, Ramya (200601220)

Title: Developing and Profiling of Parallel Scilab Application Using OpenMP; 17 p.; 2010.
Supervisor: Chaudhary, Sanjay
Keywords:
Abstract: Parallel computing systems like multi-cores and multi-processors have become quite popular in this
decade but exploiting all their resources and generating maximum performance is a key issue. In this
report we discuss the need of parallel programming and its implementation in Scilab, numerical
computational software used by researchers and people in the industry. We have implemented the
parallel versions of certain highly computational Scilab functionalities to improve Scilab’s
performance on multicore architecture. In this report we briefly describe the different techniques
and tradeoffs that are involved in designing efficient parallel versions of Scilab functionalities and
their implementations. By employing the various performance issues and tradeoffs involved in
parallel programming, we implemented a parallel version of Scilab library using OpenMP, integrated
it with the original Scilab software and also evaluated the performance of parallel and serial codes
on 32-bit dual cores
5
Author: Chaurasia, Anshul (200601152)

Title: Storytelling based Vocabulary Learning on Cell Phones, 8 p.; 2010.
Supervisor: Desai, Binita
Keywords: Storytelling; ESL vocabulary; Educational games H5.m. Information interfaces and presentation
(e.g., HCI): Miscellaneous.
Abstract: Storytelling has been regarded as a very potent form of communication of ideas and themes,
especially to children. Here we discuss one entire design, prototype and deploy life-cycle of a
Storytelling tool on a low resource devices (such as cell phones) as an engaging and fun activity
while providing the learners with lots of meaning-based input, specifically in the area of vocabulary
learning.
Author: Chauhan, Vishal Singh (200601222)

Title: Study of Static and Dynamic Code Analysis, 10 p.; 2010.
Keywords: Dynamic binary instrumentation; Dynamic code analysis, False negatives, False positives, Static
code analysis
Abstract: Storytelling has been regarded as a very potent form of communication of ideas and themes,
especially to children. Here we discuss one entire design, prototype and deploy life-cycle of a
Storytelling tool on a low resource devices (such as cell phones) as an engaging and fun activity
while providing the learners with lots of meaning-based input, specifically in the area of vocabulary
learning.
Author: Chennuru, Akhil (200601156) and Prem Kumar S. S. (200601113)

Title: Virtual Environments Navigable Over The www; 4 p.; 2010.
Keywords: 3D simulation; 3Dgame engines, Environment visualization
Abstract: With modeling in 3D to recreate workmanship and buildings of the antique, the use of the Virtual
Reality as medium of enlarging the analysis capacity, visualization, restoration simulation and
conservation of historical monuments [1]. 3D environments and virtual reality is rapidly changing
the world as they are the new demonstration tools used in design visualizations, virtual restoration,
architecture demos, training facilities, simulators and games [2]. Creation of 3D virtual
environments (VE) can be performed using a variety of design tools, most of which create 3D
virtual worlds using high definition graphics, 3D Game engines and smooth animation techniques.
The produced result is realistic and eye-catching. VR provides greater freedom in viewing a model
than physical constraints would allow. It provides the ability to zoom in and examine details that
could not be distinguished by the naked eye. Today 3D simulations are used in numerous
applications because they form an effective teaching tool.
Author: Chhabra, Jatinder Singh (200601120)

Title: Classifieds on Mobile; 11 p.; 2010.
Keywords: Mobile station integrated services digital network; Short message service, Unstructured
supplementary service data; Value added services
Abstract: Classifieds on Mobile deals with Alerts related to Jobs and Matrimony. Ver se' Innovation’s is a
mobile based classified alerts provider. Most of the revenue that the company generates is through
the various applications which it presents to various operators to add to their value added services
(VAS). As the partnership progressed with Vodafone it became necessary to develop Jobs and
Matrimonial classifieds on different channels. My work involved the preparation of both Jobs and
Matrimonial services to be used for Vodafone.
6
Author: Choudhary, Smit (200601233)

Title: Data Compression Algorithm; 15 p.; 2010.
Keywords:
Abstract: A data compression is the process of encoding information using fewer bits. This paper describes a
lossless data compression algorithm which uses a reversible transformation technique to a block of
input text. Borrows Wheeler transformation doesn’t compress the data but it reorders the data so
that move to front compressed it in an efficient way. We also analyzed this algorithm by using
Deterministic Information Theory. This provides us what is actually happens during the complete
transformation. We also implement this algorithm and trying some modification to make it better.
Author: Dalmia, Nikhil Kr. (200601231)

Title: Saba Assessment Authoring Tool; 5 p.; 2010.
Keywords: Assessment; SCORM; Question pool
Abstract: Assessment authoring is perceived as an integral component of a Learning System. Assessment
authoring tool allows creation and editing of simple tests and surveys. The tool is simple and Web-
based. It is integrated with the Saba LMS and is accessible to the content administrators. There is
also an Assessment Packager which packages the test or surveys into a Sharable Content Object
Reference Model (SCORM) compliant zip file. The packager supports both SCORM 1.2 and 2004
(also referred as 1.3).
Author: Dani, Dhruv (200601163)

Title: Extending CAN clusters using IEEE 802.11b standard for industrial communication; 10 p.; 2010.
Supervisor: Chakka, Vijaykumar
Keywords:
Abstract: The study involves the connection of distributed real – time systems scattered over a large area, (as
found in industries) using a suitable communication medium, so as to achieve the desired efficiency
from a performance perspective. The research carried out in this field comprised of building and
testing a communication network by integrating the wired CAN (Controller Area Network)
protocol with the IEEE 802.11b WLAN protocol. The MAC (Medium Access Control) layer of the
protocols has been synthesized on a FPGA and the procedure to carry out the conversion amidst
the frames has been shared.
Author: Dhanvijay, Anoop Kumar (200601162)

Title: Solving Data-intensive Problems Uusing Hadoop; 6 p.; 2010.
Keywords: Hadoop; Mapreduce; HDFS; Parallel-data processing
Abstract: With the advancement of computing technology, availability of high capacity, low cost storage
devices, Web 2.0, etc there has been an exponential increase in the data being produced every day.
Given the sheer size of data, analysis of this data, most of which is unstructured, has
emerged as a challenging problem. Extracting relevant information from the data presents
problems of parallelization, fault-tolerance, data distribution and load balancing and requires new
parallel processing models to provide a timely solution. MapReduce, a parallel data processing
model, offers one such solution. This technique has been effectively leveraged by companies like
Google and Yahoo. Hadoop is an open source implementation of the MapReduce
programming model and is suited for parallel data processing tasks of the order of petabyte. The
report discusses the MapReduce model, its applicability to various problems and the results and
analysis of the applications deployed on Hadoop.
7
Author: Dhulia, Harsh (200601102)

Title: India Research Portal; 5 p.; 2010.
Keywords:
Abstract: The India Knowledge Portal (IKP) is an endeavour to create a unique platform for information
exchange and collaboration among the Indian academic and research community. While many
different portals catering to the academic and research community exits, there is an urgent need to
consolidate all these features and applications at one place in an India specific context. The India
Knowledge Portal is envisaged as being an umbrella portal hosing resources on school education,
higher education, research and libraries.
India Research Portal (IRP) is a subsystem of IKP which is focused on catering to the needs of the
Indian research community.
Author: Divya, B. (200601012) and Reddy, M. Sai Sujith Kumar (200601087)

Title: Implementation of Pmipv6 in Ns2; 6 p.; 2010.
Keywords: Network simulator (NS2); Proxy mobile IPv6.
Abstract: The Internet Engineering Task Force (IETF) proposed Proxy Mobile IPv6 (PMIPv6) which is
considered to be a very promising network based mobility management protocol and theoretically
found that using this protocol results a better performance than using globally standardized mobility
protocol Mobile IPv6(MIPv6).
In this paper, the advantages of PMIPv6 protocol are verified by implementing it in NS2 and
comparing its performance in 802.11 environments with MIPv6.
Author: Dorav Kumar (200601206)

Title: Emulator Based Approach for Functional Verification; 6 p.; 2010.
Supervisor: Dubey, Rahul
Keywords: Emulation; FPGA prototyping; Transactional level verification; HDL co-simulation; C++ co-
simulation
Abstract: Logic emulation has been used in industry for ASIC/SoC debugging from a long time. Recent
developments in the emulation environments have enabled the systems engineers to debug the
ASIC/SoC hardware along with embedded software validation. The new emulators have got all the
traditional aspects of emulation and rapid prototyping unified into a single environment. The
objective of this project is to explore this new emulator based environment being used for
functional verification in industry. Emulator used in this project is Zero Bug Ultra Fast emulator
(ZeBu-UF), which is a product of Electronic and Verification Engineering (EVE).
Author: Dutta, Prashant P. (200601067)

Title: Online Load Balancing Of Temporary Tasks On Unrelated Machines; 4 p.; 2010.
Keywords:
Abstract: In this report the focus would be to develop an online algorithm which is better than the greedy
algorithm for temporary tasks with unknown duration. So far the best known online algorithm for
this problem is the greedy one. In this report an algorithm which claims to be better than greedy has
been dicussed and compared with greedy.
8
Author: Dwivedi, Sudhanshu (200601149) and Goel, Anshul (200601091)

Title: Power and Overflow Optimization of Wireless Sensor nodes Using Queueing Models; 8 p.; 2010.
Supervisor: Mulherkar, Jaideep
Keywords:
Abstract: Wireless sensor networks are networks utilizing wireless sensor nodes. These sensor nodes are very
small in size having limitations on buffer capacity, energy constraints, etc. These nodes suffer from
buffer overflow and are desired to be energy efficient. We have tried to address these two issues by
modeling a sensor node as a tandem queue. We have done analysis on two different models of these
sensor nodes, one using a fixed service rate and the other utilizing a varying service rate and found
out that the model with a varying service rate performs better. Also with the help of graphical
analysis we have designed a methodology to help a user design a wireless sensor node with a varying
service rate to suit best to his requirements. Also a theoretical study on Queueing theory has been
done.
Author: Garg, Khushal (200601039)

Title: Confro-Query; 4 p.; 2010.
Keywords: Semantic web; Linked data; SPARQL; Query generation; Link traversal based execution.
Abstract: The web has been known as a network of globally distributed documents. Now the next version of
the web is web as network of distributed resources where resources could be anything. Semantic
web, which means to make web interpretable by machine, this concept makes it easy to retrieve data
that is spread over various pages and the user wants the collection of inter-related data. While
semantic web has been making many promises, Linked data appears to be a concrete realization of
some of those promises. Linked data is about using the web to connect related data that wasn't
previously linked. But to query Linked data one has to know the SPARQL query language and also
the ontology which has been used to create the to-be-queried RDF graph statements. The presented
application aims to enable a general user who doesn't have any knowledge of either RDF
framework, SPARQL or the ontology, to be able to find solutions for various conference related
queries just by knowing the structure of inter-connections between resources in the graph. The
application by itself generates the SPARQL Query based on the user's input query, execute it over
web of linked data and provide the user with aggregated solution. The application also addresses the
issues related to non-retrieval of data from different servers by executing the SPARQL query with
the Link traversal based query execution using basic graph pattern matching.
Author: Goda, Sai Suneel (200601044)

Title: Implementation of USB 2.0 Transceiver Macrocell; 5 p.; 2010.
Keywords: USB 2.0 transceiver macrocell (UTM); USB 2.0 transceiver macrocell interface (UTMI), Clock and
data recovery; Verilog HDL.
Abstract: The reference document [2] defines the USB 2.0 Transceiver Macrocell Interface (UTMI) and the
operational aspects of the USB 2.0 Transceiver Macrocell (UTM). The intent of the UTMI is to
accelerate USB 2.0 peripheral development by defining an interface to which ASIC and peripheral
vendors can develop. ASIC vendors and foundries can implement the UTM and add it to their
device libraries. Thus, peripheral and IP vendors will be able to develop their designs, insulated
from the highspeed and analog circuitry issues associated with the USB 2.0 interface, thus
minimizing the time and risk of their development cycles. The current project is aimed at
implementing UTM abiding to the UTMI specifications described in [2]. The design is implemented
using Verilog HDL.
9
Author: Goyal, Prateek (200601061)

Title: Analysis of the Complexity of Multinet Pvt. Ltd. Network; 4 p.; 2010.
Keywords:
Abstract: The main aim of this project is to study the complexity of networks and methods to quantify them.
Then using a suite of complexity models that describe the routing design and configuration of the
network in a succinct fashion and applying it to a Enterprise network. The network of Multinet Pvt.
Ltd,. Udaipur is used in this project and all the complexity metrics are applied on this network..
Author: Goyal, Shri Krishna (200601195)

Title: Speaker Recognition from Their Hum and QBH (Query by Humming), 5 p.; 2010.
Supervisor: Patil, Hemant
Keywords: Humming; Query by humming; Linear prediction coefficient; Linear prediction cepstral coefficient.
Abstract: There are many systems that recognize speaker from their speech. In this report, we are going to
verify and identify speakers from their hum and query by humming (QBH). The technique for
feature extraction form speaker hum sound and query by hum, we will use The Linear Prediction
Coefficients (LPC), Linear Prediction Cepstral Coefficients (LPCC), Mel Frequency Cepstral
Coefficients (MFCC) and Teager Mel Frequency Cepstral Coefficients(TMFCC).We are taking
database of 50 speakers (38 male,12 female) for speaker recognition from their hum and 10 speakers
(10 male) for query by humming. First we will extract feature from training speaker hum and make a
training database then we will extract feature from testing speaker hum and compare with training
database. MFCC is giving better result than LPC and LPCC for speaker recognition from their hum
and also query by humming by the results of simulations carried out on the commercially available
software CST Microwave Studio.
Author: Gumber, Jayesh (200601164)

Title: Embedded System Design for fuel measurement and tracking Vehicles; 8 p.; 2010.
Keywords:
Abstract: The embedded system is designed to reduce the stealing of fuel from the vehicles; the proposed
system communicates through GSM network and transmits data regarding the status of the fuel as
well as position of the vehicle, which will obtained using the Global Positioning System. The
following report describes the working of the GPS device, its interfacing with the Microcontroller,
the data format which it transmits and the extraction of relevant data from the transmitted data.
Author: Gupta, Ankit (200601079) and Garg, Somya (200601106)

Title: Image Processing for the Quality Assessment of food grains using Parallel Programming; 7 p.; 2010.
Supervisor: Chaudhary, Sanjay and Rawal, Mehul
Keywords: Image processing; Parallel computing; Quality assessment
Abstract: Quality assessment of food grains with the help of image processing can contribute significantly to
the field of agriculture and food engineering. Various quality parameters for a crop can be retrieved
just by processing the snapshot of the concerned crop. The image processing applications being
computation intensive ends up taking a lot of time and resources. By integrating the techniques of
parallel computing with an image processing algorithm we can achieve a much higher data
throughput. We propose to design a parallel image processing application for quality assessment of
food grains which will exploit the intrinsic parallelism in the application to enhance the performance
of the application and hence to make it more time and performance efficient on a multi-core
architecture..
10
Author: Gupta, Anurag (200601111) and Bhandari, Rohan (200601065)

Title: Post Flood Estimation; 5 p.; 2010.
Keywords:
Abstract: The proposed work combines few models for estimating post flood information which is essential
for decision making in case of flood events. The goal is to demonstrate the model with reference to
a case study so that near real time results can be obtained on real time data.
Author: Gupta, Mradul (200601165)

Title: Performance Analysis of Minimum Spanning Tree Algorithms; 4 p.; 2010.
Keywords: Minimum spanning tree (MST); Sparse graph; Average graph; Dense graph; e /v (ratio of number
of Edges and number of vertices).
Abstract: The report contains a comparative performance evaluation of algorithms for finding the MST
(Minimum Spanning Tree) of a weighted graph. The two main algorithms selected for evaluation are
Boruvka deterministic algorithm and the recent Karger, Klein and Targan (KKT) algorithm. The
KKT algorithm is a probabilistic algorithm which claims to obtain significantly better results on the
average than the Boruvka’s on which it is based. Kruskal standard algorithm is used as a base for
comparison.
Author: Gupta, Nakul (200601007) and Nigam, Anurag (200601051)

Title: Pragmatic Financial Investment Analyzer; 7 p.; 2010.
Keywords: Financial derivatives; Nonlinear multivariate constraints; Nonlinear multivariate optimization;
Portfolio; Assets; Equities; Securities; NPV; AAR; PI; Rate of return; Stochastic programming;
Markowitz model; Asset ratio; Correlation; Covariance.
Abstract: Portfolio optimization and analysis of financial investments has always been the area of utmost
importance in modern finance. A software tool for analyzing financial investments has been
designed and implemented, which includes most of the standard investment decision methods. An
innovative feature of the tool is the incorporation of a multi period optimization decision model
based on the work of Charles and Dutta.
Author: Gupta, Sanchit (200601192) and Jain, Anubhuti (200601214)

Title: A Mobile Application for Illiterate and Semi-Literate Users, 5 p.; 2010.
Supervisor: Sethuraman, S.
Keywords: ICTD; semiliterate; Illiterate; Audio; User interface; Mobile
Abstract: Literacy has always been a roadblock in the path of development of any nation. It is because
dissemination of knowledge and information to an illiterate and to an extent semiliterate individual
is a challenging task. In the project, we tried to understand and analyse existing
applications, technologies and research aimed at facilitating knowledge transfer to this set of users.
The literature study was then followed up by field studies to test our findings and eventually decide
on features and modalities for a user viable solution. The data thus collected was used to define a
problem definition and subsequently develop a user interface (minimal text with audio and pictorial
interface to communicate with user) for a mobile application that would enable semiliterate and
illiterate users to share information efficiently
Author: Gupta, Saurabh (200601127)

Title: IR Text Collection in Punjabi; 30 p.; 2010.
Supervisor: Majumder, Prasenjit
Keywords: Punjabi; Punjabi test collection; IR
Abstract: Objective evaluation of search effectiveness has been the cornerstone of IR. Unfortunately, there
isn't any standard test collection for the evaluation of Punjabi information retrieval systems. We
11
have built a standard IR text collection for Punjabi according to TREC1 specifications, which will in
turn improve the quality of research in the field of Punjabi information retrieval. This is the first
attempt at building a test collection for Punjabi language. I have also developed a stemmer and a
stopword list for Punjabi language..
Author: Gupta, Setu (200601088)

Title: RFC 1981 (IPv6 Path MTU Discovery) Compliance in Mobile Phone’s Data Service Protocol Stack;
6 p.; 2010.
Supervisor: Pottabathulla, Praveen Kumar and Ranjan, Prabhat
Keywords: PMTU: path maximum transmission unit; PMTUD: Path MTU discovery, 1981; Compliance: RFC
1981 implemented in IPv6; U.E.: User equipment or phone.
Abstract: Most medium and high end cell-phone chipsets today support data calls by running an embedded
TCP/IP stack. Also, these days there is a stress to migrate from IPv4 to IPv6 as much possible.
Mobile chipsets supports IPv6 connections but without the compliance of RFC1981. IPv6
specifications recommend the implementation of RFC 1981 as well in IPv6 end devices. RFC1981
is Path MTU Discovery process, which ensures that maximum size packet, that can reach the
receiver is send-out at a time on a physical link. Since, wireless standards like 802.11; UMTS, etc
normally support higher packet sizes than IPv6 minimum specification which is currently used. This
document describes how this fact can be exploited by implementing RFC 1981 (Path MTU
Discovery) in mobile software and produce better throughputs within the same network resource
constraints. This report specifically describes the concept, design and implementation of the project
and testing as conceived till 20.04.2010.
Author: Gupta, Sumit (200601082)

Title: Information Extraction with Logic Programming; 5 p.; 2010.
Supervisor: Pandya, Abhinay
Keywords: Information extraction; Inductive logic programming; Machine learning
Abstract: A huge amount of information is hidden within unstructured text. This information is often best
exploited in structured or relational form, which is suited for many applications including
Information Extraction (IE). Information Extraction is the task of automatically extracting
structured information from a given set of information thus producing a well defined categorized
data from unstructured machine readable information. Information Extraction in biological data is
one of the most skewed tasks. Here, we exploit the idea of Inductive Logic Programming (ILP) and
Statistical Methods for extracting information using Aleph as the ILP system.
Author: Jain, Anshul (200601154) and Singhai, Mayank (200601184)

Title: PAPR Comparison between different multiple carrier FDMAs; 6 p.; 2010.
Keywords: Long term evolution (LTE); Single carrier FDMA; Uplink; (peak to average power ratio) PAPR;
Downlink.
Abstract: This report includes the study of the concepts of LTE, OFDMA (Orthogonal Frequency Division
Multiple Access) and SC-FDMA (Single Carrier Frequency Division Multiple Access) and
comparison between OFDMA, localized SC-FDMA and distributed SC-FDMA on the basis of
PAPR.
Author: Jain, Ansu (200601198)

Title: French Tuesdays (iPhone APP. Development); 7 p.; 2010.
Keywords: iPhone development; API development
Abstract: French Tuesdays is an event management social networking site. Its organize events across six
different cities in the world. It is similar to other social networking sites like FaceBook, Orkut,
Linkedin etc. This report describes the steps followed to implement a French Tuedays API for
12
iPhone.
Author: Jain, Ashwin (200601001), Hari, C. (200601046), and Pandey, Saket (200601122)
Title: Zipher: A Context-Aware Game for Mobile Phones Over Bluetooth; 11 p; 2010.
Supervisor: Srivastava, Sanjay
Keywords: Pervasive gaming; Ubiquitous computing; Java; Bluetooth; J2ME; Middleware
Abstract: Pervasive Gaming is an alternative form of gaming that attempts to bring the real back into the
virtual worlds by making use of the principles of pervasive computing. However, most of the
underlying software used in experimental games is not reusable as it is very specific to the
application and the platform. We have developed a prototype game called Zipher that aims to bring
pervasive gaming to an easily available platform and also provide an architecture for the future
development of pervasive applications on such platforms.
Author: Jain, Prateek (200601069)

Title: Network Infrastructure Management System & SLA Generation Tool; 5 p.; 2010.
Supervisor: Bhise, Minal
Keywords: Ticket; Nagios; Data center; Share point
Abstract: We have developed a web based portal “Network infrastructure management system”, which aims
at giving a simplified solution to network device management at the data centers of various
countries for the whole organization which also provides a graphical user interface for internal DNS
server using MYSQL database in the backend. We have also developed a new automatic service
level agreement (SLA) generation tool for a computer system and network monitoring software
application (Nagios) and developed scripts for updating Share Point’s database.
Author: Jain, Rachit (200601126)

Title: Remotely Accessible Virtual Drawing Board (rSpace), 4 p.; 2010.
Keywords: Human computer interaction; Digital content development and remote data sharing.
Abstract: In my project I have tried to incorporate the Human Computer Interaction technologies with the
software that are used to produce the digital graphic contents. The project aims to provide the user
freedom to use the projected surface as the drawing board, and also enables the user to do
collaborative work with other users connected through a network. The project attempts to bring the
artists from different parts of the world together and work on the same piece simultaneously in real
time. The project can also be used for educational purposes. The project uses Nintendo’s Wii
controller and specially made pens, fitted with infrared LED. The project works on the high
performance infrared points capturing ability of Wii remote.
Author: Jain, Rajesh Kumar (200601056)

Title: Proxy Re-Signature; 5 p.; 2010.
Keywords: Signature translation; Proxy re-signature; Proxy signature; Proxy revocation; Authenticating path in
network; Proxy key; Algorithm; Design ; Security
Abstract: This report is about Proxy Re-Signature Scheme, in which a semi-trusted proxy translates one type
of signature to other type of signature. The proxy acts as a translator between Alice and Bob. Alice’s
Signature is translated into a signature from Bob on the same message. In this process, the proxy
cannot learn any secret key or cannot sign any message on behalf of Alice or Bob. This report
describes a proxy re-signature scheme that translates Alice’s Schnorr signature to Bob’s RSA
signature. At no point of conversion the security of schnorr and RSA signature schemes are
compromised. This scheme construct involves generating suitable proxy re-sign keys. This is done
by establishing communication among Alice, the proxy signer and Bob. In this Report Undirection
Proxy Re-signature is discussed means Alice’s Signature convert it to Bob’s Signature but not Bob’s
Signature to Alice’s Signature. The Signatures generated by regular signature generation algorithm
13
and the proposed re-signature algorithm are indistinguishable. It is very useful tool for sharing web
certificates, forming group signature, authenticating work path.
Author: Jain, Sneha (200601124)

Title: A Simple Protocol for Computing Aggregation Function Min/Max in Wireless Sensor Nodes; 13 p.;
2010.
Supervisor:
Keywords: Wireless sensor networks; Data aggregation.
Abstract: In Wireless Sensor Networks communication costs plays a crucial role in deciding the eefficiency of
a system. Hence data agregation is important as it reduces the network trac to a great extent. When
we use homomorphic encryption scheme, end-to-end privacy is provided. To compute
minimum/maximum, comparison is required but it has been proved that homomorphic encryption
is insecure against comparison.We propose a new scheme for computing the aggregation function
maximum/minimum in Wireless Sensor Networks. We apply scheme for an existing protocol which
is designed for mean calculation using data aggregation.
Author: Jindal, Aanchal (200601037)

Title: Security Analysis of Two Handover Authentication Protocols Using Protocol Composition Logic,
15 p.; 2010.
Supervisor:
Keywords: Protocol composition logic; Handover authentication
Abstract: The project aims at doing a thorough security analysis of 2 handover authentication protocols
using a formal method called Protocol Composition Logic (PCL) to prove the security of these
protocols. The proof is modular, comprising a separate proof for each protocol section giving the
reader a deeper understanding of the importance of every section. The important security attributes
of handover authentication protocols are mutual authentication, anonymity and key secrecy. We
have therefore used PCL to prove the above mentioned security metrics of the protocols.
Author: Jain, Shobhit (200601227)

Title: Audio Video-Synchronization; 3 p.; 2010.
Keywords: Audiovisual correlation; Quadratic mutual information; Kernel density estimation; Face detection.
Abstract: This report focuses on the study of different techniques to re-establish the Audio Video-Sync in a
video. The Audio Video-drift may enter the system during the creation, post-production,
transmission, reception or playback processing. Among all the different kinds of Audio Video-Sync
errors the most easily perceivable falls in the category of Lip Sync errors.
Author: Jindal, Tanu (200601014)

Title: Characterization and Thermal Resistance Estimation of AlGaN/GaN based High Electron Mobility
Transistors; 19 p.; 2010.
Supervisor: Roy, Anil K.
Keywords: 2DEG (two dimensional electron gas); HEMT
Abstract: III-nitrides semiconductor devices are being widely used as a good technology vehicle for high-
frequency and high-power applications. In particular, AlGaN/GaN High Electron Mobility
Transistors (HEMT) are currently the most promising devices for microwave power application.
These devices can work effciently under wider bias ranges without break - down due to better
material properties responsible for high power/high frequency, i.e., large band gap, high electron
drift velocity and high break - down electric eld. Since these devices operate at high voltage levels
which may result in large currents and can lead to considerable heat generation causing signicant
increase in the channel temperature and thermal resistance that adversely a ects the electron
transport properties. The reliability and power performance of AlGaN/GaN HEMT power devices
depend critically on thermal resistance and operating channel temperature. Therefore, an accurate
14
estimation of thermal resistance and channel temperature is highly desirable. In this study, reported
closed form expressions are used for estimating the thermal resistance of 0:25m gate AlGaN/GaN
HEMTS through simulation and its variation with geometrical parameters for dierent substrates,
e.g., Sic, Sapphire, Si, GaN and Diamond. In this project, simulation is carried out in MATLAB
R2008b to predict the thermal behavior of AlGaN/GaN HEMTs with industry standard
geometrical parameters.
Author: Joshi, Sanika (200601017), Chokhra, Brijesh (200601045)

Title: Self Assertive Device for Helping People with Cerebral Palsy; 9 p.; 2010.
Keywords:
Abstract: RF CePal’ is a self assertive wireless network for helping people with cerebral palsy. RF CePal is a
cost effective, portable tilt-based remote control which can control the Infrared (IR) based
appliances using RF gateway. Wireless network contains one remote control (this node will be called
as REMOTE in this document) and one/many IR nodes (these will be called IR nodes in this
document). The remote control could switch between the devices and this way could control more
than one device. This is a button free device which uses hand tilts and amount of pressure exerted
by hand for controlling four different functions of IR based appliances. Accelerometer/Gyro
Sensor is used to measure a hand tilt and force sensor is used to measure pressure exerted by the
hand. This device has been implemented and tested on digital photo frame and TV.
Author: Kamra, Hitesh (200601042)

Title: Data Entry Operator System using CRM; 5 p.; 2010.
Keywords: Operator; Batch profile; Remote (server); Host (client); Branch; Synchronization.
Abstract: Data Entry Operator System is software, which is used to keep the record of daily work done by the
operator. The software is installed on StayinFront CRM (Customer Relationship Management)
Mobile. Any changes on the host are reflected on remote. The technique used in this software can
also apply to companies other than data entry. The software is secure and user friendly. VBScript is
a Microsoft scripting language used in this software. The database used in the software is Microsoft
SQL Server 2005. The software is developed using StayinFront CRM version 10. PL/SQL as a
procedural language of SQL is used in this software.
Author: Kavita (200601112)

Title: Game Theory In Stock Exchange; 3 p.; 2010.
Keywords:
Abstract: The aim of this project is to evaluate the applicability of Genetic Algorithm for solving a stock
Market game, following the model of Armin Zeanali and Ashkan Rahimi,from the paper “A game-
theoretic based dynamic stock price mdelling” ,presented in IEEE. The model has been
implemented and simulated under the condition of a sequential game between 4 players and 8
stocks to be traded amongst themselves.
Author: Khandelwal, Manish (200601166)

Title: Dew Harvesting: Models and Analysis, 10 p.; 2010.
Supervisor: Chaudhary, Sanjay and Sharan, Girja
Keywords: Dew deposition in India, Dew data analysis, Spatial data analysis, Variogram analysis of dew
Abstract: Dew is atmospheric water vapour condensing on a surface that has been cooled by radiative cooling
at night. In arid and semi-arid areas where dew occurs frequently and in significant amount, dew can
be harvested as an alternate source of water. Dew is being measured at some places for years but we
have dew data only for few stations in India. By doing spatial data analysis for given stations, we
have to develop a model which can approximate dew amount for a station if its location is given.
15
Variogram technique of analyzing spatial data is used to develop this model.
Author: Kolli, Bharath (200601031)

Title: DWT-based Digital Image Watermarking; 5 p.; 2010.
Keywords: Arnold transform, Discrete wavelet transform; Single value decomposition; Watermark.
Abstract: Because of its growing popularity, the Discrete Wavelet Transform (DWT) is commonly used in
recent watermarking schemes. In a DWT-based scheme, the DWT coefficients are modified with
the data that represents the watermark. In this paper, we gave a good insight of DWT-based Image
watermarking techniques. Some of the techniques studied here include multiple watermarking
schemes in DWT, a hybrid scheme based on DWT and Singular Value Decomposition (SVD) and
usage of Arnold transform scrambling algorithm for watermark encryption. This paper talks first
about the basic spatial-domain watermarking techniques i.e least significant bit modification and
then about the various DWT-based techniques mentioned above.
Author: Kolli, Venkata Siva Ramakrishnh (200601073)

Title: System Dynamical Modeling of Role of Microfinance in Poverty Alleviation; 6 p.; 2010.
Keywords: Poverty; Microfinance; System dynamics; Treasury; Loans outstanding; Income.
Abstract: Poverty in India is a widespread phenomenon. This is generally attributed to lack of financial
support systems and other resources (food, water, shelter, sanitation, education and health facility).
According to a 2005 World Bank estimate, 42% of India's falls below the international poverty line.
There have been many policies and Five-Year plans to eradicate poverty, all of which focused on
how the government should help eradicate it. It is here that microfinance has been useful to help
poor help themselves instead of depending on the government to solve their problems.
Microfinance is considered to be one of the ways in helping the poor people to procure loans
custom made for them to rise above their poverty. Most of the studies so far have concentrated on
how Microfinance helped the poor and how to make it work. These studies do not display how the
various aspects are connected and their impact on the whole system, i.e. poor and the microfinance
institutions. So I propose to follow the System Dynamics approach to analyze the system and model
it according to System Dynamics Principles.
Author: Konda, Ramakrishna (200601040)

Title: A Light-weight Rule Engine for Wireless Sensor Network; 11 p.; 2010.
Keywords: Rule engine; Sensor network; XML, Mapping ontology.
Abstract: Wireless Sensor Networks (WSN) are highly dynamic in nature so as the application requirement
that uses it. A Middleware support for wireless sensor network is required to handle this dynamic
nature and allow applications to work seamlessly with underlying wireless sensor network.
MidSen[1] made the designed applications independent of the continuous changing deployment
conditions using the rule based approach. Even though there were many existing rule engines, none
have been made in view of the wireless sensor network as they have very different set of
requirements. We have designed and implemented a “Rule Engine” considering the memory and
response time hand in hand and it is the best support for MidSen requirement. Proposed rule
engine provides portability, flexibility and extensibility as rule repository is built in XML format.
Rule engine is build using C++ to suit the memory constraints of wireless sensor network. We have
also extended rule engine using ontology to support semantic information. Hashing is used to
reduce the response time.
16
Author: Koneru, Pramod Chowdary (200601078)

Title: Study of Fujito’s 2- Approximation Algorithm for Minimum Cost Tree Cover; 4 p.; 2010.
Keywords: MST (minimum spanning trees); Steiner tree; Matching in graph theory; Directed and undirected
edge weighted graphs; Graph theory; Approximation algorithms.
Abstract: Our problem formulation is as follows. Given an undirected edge weighted graph G, we wish to
find a minimum cost tree T in a given connected graph G with costs on the edges, such that the
vertices of T form a vertex cover for G. In this paper, First, we study Fujito’s 2- approximation
algorithm for minimum cost tree cover problem, how it’s using various techniques (primal dual
Technique and local ratio technique) on MST to get the desired minimum cost tree cover. Second
we implement the algorithm proposed by Fujito and finally we verify the effectiveness of the
algorithm through simulation.
Author: Koundinya, Sri Harsha R. (200601201) Anaparthi, Ajay (200601205)

Title: GPS less Small Animal Tracking; 11 p.; 2010.
Keywords:
Abstract: GPS less small animal tracking system is a wireless sensor network based system for monitoring the
movement microclimate and hibernation of the turtle. A wireless sensor network is a collection of
nodes organized into a cooperative network. We will determine the position with the help of range
measurement tool. With the Rssi and Lqi values using the localization algorithm the location the
target is obtained.
Author: Krishna, Sai Vamsi (200601071)

Title: Classification of Normal and Abnormal Tracheal Sounds; 7 p.; 2010.
Supervisor: Patil, Hemant A.
Keywords: Pulmonary diseases; Teager energy operator; Tracheal sound classification; Discrete wavelet
transform
Abstract: The objective of this project is to develop models of healthy persons and pulmonary disease
patients of mainly Allergic Airway Disease (AAD) also called as Asthma, Chronic Obstructive
Pulmonary Disease (COPD) based on their tracheal sounds and compare the models with a newly
admitted subject to conclude what pulmonary disease he/she is suffering from if the subject is really
effected with. In this study, 70 healthy volunteers and 40 patients with chronic pulmonary diseases
were enrolled to investigate significant differences between normal and abnormal subjects. Tracheal
sounds were acquired using Littman Electronic Stethoscope placed on the examinee’s throat
positioned exactly at the trachea of the examinee. The tracheal data collected in stethoscope was
transferred to a computer using infrared technology and is analyzed using different phases of speech
communication techniques to develop models. The main objective of this work is to develop
models of trained Healthy class subjects and 2 different Abnormal class subjects using different
feature extraction techniques and match those models with a new subject’s model during testing
phase using a classifier to identify the class of the new subject which he/she is actually matched to.
The novelty of our work is usage of tracheal data for the classification of normal and abnormal
tracheal sounds using new feature extraction algorithms we have proposed based on Discrete
wavelet Transform combined with normalized TEO , normalized energy and already developed
MFCC(Mel frequency cepstral coefficients).The classification was performed using a minimum
distance classifier under speaker independent conditions. Quantification of results obtained is
tabulated in the end and the accuracy in the above cases range from 60% to 72% for wavelet and
70% to 78% for MFCC.
17
Author: Mani, Paras (200601063) and Yadav, Vaibhav (200601072)

Title: Rule Engines; 6 p.; 2010.
Keywords: Rule engine; Semantic web; Knowledge base; Inference rules; Forward and backward chaining;
JESS; Facts and rules
Abstract: Rule engine is an engine which is based on rules, logics and facts. Rule engine is an expert system
which has a collection of rules (knowledge base) and an inference engine which analyses fact
patterns and is matched with the applicable rules. Inference search engine overcome the problems
of keyword based search engines. We have used an expert system JESS to understand the working
of rule based engines.
Author: Maheshwari, Ankit (200601204)

Title: Phone Book Manager: Overview and Optimizations on Code and Memory Usage; 5 p.; 2010.
Keywords: Phone book manager; Lint; Embedded file system; Optimization
Abstract: Phone Book Manager (PBM) is an integral and the most important part of any mobile Handset. It is
responsible for maintaining contact lists, maintaining and updating call logs and adding advanced
functionalities as per the requirements. As a member of the PBM team at Qualcomm I have
understood the functionality, both in terms of the features and the code involved. I have performed
some dedicated and combined tasks that have been assigned to me. This document lists the
background of what is a phone book manager and details of the tasks performed be me during the
course of my B-tech ProjectiPhone.
Author: Maheshwari, Mohit (200601008) and Garg, Prashant (200601144)

Title: Architecture Design of a Processor for Biomedical Applications and Investigation of Latest Full
Adder Topologies; 10 p.; 2010.
Supervisor: Nagchoudhuri, Dipankar
Keywords: Biomedical applications; Pipeline architecture; Instruction set architecture (ISA).
Abstract: We are laying the foundation for a processor design project where DAIICT will have an indigenous
processor design ready for fabrication by the end of 2011. The major objective of this project is
educational rather than commercial and the idea is to gain the technical know-how of various VLSI
design stages starting from schematic to layout. The first part of the project focused on coming up
with a novel five stage pipeline architecture and the second part concentrated on investigating
various full adder topologies, including the most recently proposed ones . The processor designed
will be useful in applications like monitoring the electrical activity of brain, heart and other body
organs. In the adder design, the focus has been to come up with an adder architecture which can be
replicated at various places inside the processor. The adder should also have a minimal number of
transistors such that it covers the minimum possible area in order to bring down the chip cost.
Author: Mahidhar S. ( 200601098 ) and Garg Ankur ( 200601139 )

Title: Dual Band Circularly Polarized Microstrip Patch Antennas For RFID Reader; 4 p.; 2010.
Keywords: Patch antenna; RFID reader; Dual band; Return loss; S11.
Abstract: In this paper we present 2 novel dual band micro-strip patch antennas for UHF band and
microwave frequency of 2.44GHz and 5.8GHz for Radio Frequency Identification (RFID) reader
applications. The 1st antenna has operating frequencies of 955MHz and 2.44GHz. The 2nd antenna
operates at 2.44GHz and 5.8GHz microwave frequency. The proposed antennas have a corner
truncated rectangular metallic patch which is circularly polarized along with a ground plane and a
single coaxial probe feed. The patch antenna is printed on Rogers R04003 material with dielectric
constant of 3.38 and dielectric loss tangent of 0.0027. The structure of antenna is very simple and
low cost. Simulations of these antennas with operating frequencies at 955MHz, 2.44GHz and
2.44GHz, 5.8GHz showed promising results with Return Loss (S11) of about -19dB, -25.5dB for
the 1st antenna and -15dB, -13dB for the 2nd. For the antennas, the VSWR is less than 1.6 and
18
directivity of 1st antenna is nearly 4.55 dB and 7.42 dB at 955 MHz and 2.44 GHz respectively. For
2nd antenna, directivity at 2.44 GHz and 5.8 GHz is 7.47 and 5.77 respectively.
Author: Medisetty, Murali (200601238)

Title: Security Proofs for Hierarchical Key Assignment Schemes With Dependent Keys; 20 p.; 2010.
Keywords:
Abstract: This paper examines the security proof of a hierarchical key assignment scheme given byWu andWi.
Some minor errors in their proof are shown and new definitions are proposed to fix them.We then
examine a hash based key assignment scheme proposed by Vadnala and Mathuria proved secure in
Wu-Wei model. In order to reduce the required public storage, we propose some minor changes to
their scheme and using the new definitions defined, we provide a rigorous proof to modified
Vadnala- Mathuria’s scheme.
Author: Mishra, Pranjal (200601219)

Title: Effect of clustering on energy efficiency of ad-hoc networks; 6 p.; 2006.
Keywords: Ad-hoc networks; Clustering protocols; Energy efficiency.
Abstract: Clustering can be used to improve the energy efficiency of Ad hoc networks and hence the life of
AD-hoc Networks. A brief study of some clustering protocols is done. The work aims to compare
different cluster formation by changing the size of layer clusters for a given topology on the basis of
Total energy and the energy of cluster head consumed in a given period of time
Author: Mithal, Arpit (200601119) and Jain, Namit (200601133)

Title: Multiple Sequence Alignment Using Secondary Structures; 6 p.; 2010.
Keywords: Guide tree, Multiple sequences alignment, Progressive alignment; String algorithms.
Abstract: Multiple Sequence Alignment (MSA) is a NP-Hard problem. Various heuristic approaches have
been proposed for it. This paper tries to improve the sensitivity of most commonly used heuristic
approach i.e. progressive alignment. We use secondary structure information to construct
biologically relevant sequences. Apart from increasing biological relevance, it also helps in reducing
time and space requirements. Suggested changes have been incorporated into a new program and a
preliminary experiment has showed encouraging results.
Author: Mittal, Mohit Kumar (200601110) and Agrawal, Vijit (200601132)

Title: Graph Coloring Algorithms; 4 p.; 2010.
Keywords: Acyclic edge coloring; Bichromatic cycle; Kempe chain properness; Vizing’s theorem;
Abstract: Graph Theory, as the name suggests, is the study of mathematical structures used to model certain
objects and the relations between them. One key area of graph theory is graph coloring problems. It
has many real life applications. This report would demonstrate the basic idea of our work
concerning a variant of the graph coloring problems i.e. acyclic edge coloring, total number of
colors required for special classes of graphs and some key definitions and terminology used in it.
Author: Mulagalapati, Murali (200601104)

Title: Image Inpainting Using PDEs; 4 p.; 2010.
Supervisor: Joshi, Manjunath V.
Keywords: Image inpainting; Image smoothness estimator; Isophotes and anisotropic diffusion
Abstract: Inpainting is the process of reconstructing lost or deteriorated parts of images. For instance, in the
case of a valuable painting, this task would be carried out by a skilled Image restoration artist. The
term “digital Image Inpainting” is coined by Marcelo Bertalmio and Guillermo Sapiro during the
19
proceedings of SIGGRAPH 2000, New Orleans. The goals and applications of inpainting vary from
restoration of damaged paintings and photographs to removal of selected object. In this paper, I
tried implementing an algorithm introduced by Bertalmio and Sapiro. After the user selects the
regions to be restored, the algorithm automatically fills-in these regions with information
surrounding them. The advantage of this paper over previous papers is that, users need not specify
where the novel information comes from. This is automatically done, thereby allowing to
simultaneously fill-in numerous regions containing completely different structures and surrounding
backgrounds. Some good applications of this technique include removal of superimposed text like
dates, subtitles, and the removal of objects like support cables, wires etc.
Author: Munagala, Vivek (200601221)

Title: Cryptanalysis and Improvement of Protocols Integrating Diffie-Hellman Key Exchange into Digital
Signature Algorithm (DSA); 17 p.; 2010.
Keywords: Key agreement; Diffie-hellman; Canetti-krawczyk model
Abstract: There were a series of protocols published which integrate DH key exchange protocol into DSA.
Starting with Arazi’s protocol, there were attacks proposed and modifications suggested. We show
that the Harn-Mehta-Hsin three-pass key agreement protocol, and the improved versions proposed
by Phan are not secure against the public key substitution unknown key-share attack. We also show
that the improved version of Phan’s protocol by Jeong, Kwon and Lee does not provide Key
Freshness. We then extend the original Canetti - Krawczyk (CK) model so as to simulate these
attacks. Finally we propose a modified protocol and prove it secure in the extended CK model.
Author: Nagar, Vardan Hemant (200601239) and Rohan (200601068)

Title: Scheduling in Xen; 7 p.; 2010.
Keywords: Information extraction; Inductive logic programming; Machine learning
Abstract: In this paper we discuss Xen, an x86 Virtual Machine Monitor and the intricacies involved with the
scheduling in Xen. The previous versions of Xen used schedulers like Atropos, Round Robin, BVT
and SEDF scheduler. Better performance and additional functionality is the motivation that has led
to new schedulers like credit scheduler that score over those schedulers in many of these areas. But
even the credit scheduler has some weaknesses and it does not provide adequate support for
running real-time interactive applications which limits the adoption of
Virtualization in some domains. There is a lot of scope for research and improvement in this area as
research is still in its embryonic stage.
Author: Nagar, Kartik (200601099)

Title: Extensions to the Automatic Security Protocol Builder; 12 p.; 2010.
Keywords:
Abstract: The technique of automatic backward search guided by the rules of belief logic was proposed by
Zhou and Foley and is used in the automatic generation of security protocols. P Sai Teja and Sawant
Tandle built a prototype of the Automatic Security Protocol Builder based on the above technique,
and were successful in generating mutual authentication protocols using symmetric keys. In my
work, I have extended the tool to automatically generate public key authentication protocols and
key-agreement protocols. In the process, the underlying logic system has also been extended by
adding new inference rules, and some of the deficiencies in the original framework of Zhou and
Foley have also been corrected.
20
Author: Narang, Naveen (200601058)

Title: Implementation of LC - 3 as Three Stages Pipelined and Three Sstage Super Scalar Pipelined
Processor in Verilog; 5 p.; 2010.
Keywords: Little Computer 3 (LC - 3); Instruction set; Data path; Synthesis.
Abstract: In this paper, an implementation of Little Computer 3(LC - 3) processor as 3 - stage pipelined and 3
- stage super scalar pipelined is presented. The LC - 3 architecture comprises of 15 instructions
which include arithmetic, logical and branch instructions. The processor has been implemented
using the hardware descriptive language Verilog. This paper briefly discusses about the system –
level model, Instruction set architecture and control processor. Next, the detailed design
implementation and description of various aspects of LC – 3 are explained.
Author: Narayana, Rushi N. (200601083) and Reddy, Prudhvi (200601131)

Title: Development of a Sensor Node for Acoustic WSN; 14 p.; 2010.
Keywords:
Abstract: This paper presents the design of a FrogCense node for distributed acoustic sensing and processing
applications in wireless sensor networks. The node developed may be used as a platform for
acoustic sensing wireless applications. The memory, processing and communication restrictions
imposed on nodes in general and specific flaws in the previously designed nodes are analyzed and a
simpler, cost effective but more efficient platform is developed. The node is based on an 8-bit
ATMEL ATMEGA32 microcontroller capable of operating at clock frequencies up to 16 MHz and
accessing up to 4MB Flash from the AT45DB321B memory device for temporary processing
operations and a further 512 MB of permanent storage space from a Micro-SD card interface.
Wireless communication is provided by the XBee module which is compliant with the IEEE
802.15.4 standard. During ongoing development, the serial port provides a debug interface. The
additional requirements, design constraints and advantages of an acoustic sensor node are further
discussed in this paper.
Author: Naveen, D. (200601028) and Konduri, Ravi Shankar

Title: Development of USB framework for USB Functionalities on Android; 4 p.; 2010.
Supervisor:
Keywords: USB, DIAG; Mass storage; ADB; Android; Modem
Abstract: USB framework is an important and time saving framework for developers working on USB
Functionality in Android Phones. Android phones use USB for SD cards, GPS and ADB. So this
framework has readymade modules that can be used by the developer while developing its code
instead of rewriting it again from the scratch. As a member of Linux USB team, I had the
opportunity to understand and analyze the USB 2.0 protocol. This document describes the USB
framework developed, various concepts in USB and working of USB framework.
Author: Nukala, Mounika (200601237)

Title: Web Service Composition with BPEL; 7 p.; 2010.
Keywords: Web services; Business process and BPEL
Abstract: Web services are increasingly being used to expose applications over the Internet. These Web
services are being integrated within and across enterprises to create higher function services. BPEL
is a work flow language that facilitates this integration. This paper provides a brief overview of the
BPEL features, handling faulty situations in business processes, dynamic binding with the partner
web services and also discusses the composition mechanism for Web services using Business
Process Execution Language (BPEL).
21
Author: Niranjan, Rahul Kumar (200601135)

Title: Universal Search UI and Data Feed Extractor; 9 p.; 2010.
Keywords: Lucene; Parsing; Search UI; Data extraction; Vertical
Abstract: Verse' Innovation is a mobile classified provider deals in different verticals including Jobs,
Matrimony and Real-Estate by sending SMS alerts to the users of different providers including
Airtel, Vodafone, Idea, Aircel and BSNL. It also has an active search service joberix.com which
claims more than 3,963,078 job searches from India's best job sites. Search Layer is one of the most
important and basic layer of layered architecture of Verse' Innovation. Universal Search UI project
was aimed to design UI for Verse internal users to provide complete visibility of data available on
Verse indices in all verticals. Project was supposed to design mainly for Job, Matrimony and Real-
Estate vertical. Second project was creation of parsers which can parse XML feeds provided by the
content providers(CP's) respectively quikr.com, olx.com and shiksha.com and extract useful
information from the meta data using Lucene Memory indexing and search technique and push data
into search indices to make them search-able for end users. Along with these main projects I was
also supposed to implement cache for Matrimony vertical, alert formation for automobiles and
automobile-seeker verticals to send on mobile and also deployment of one of the most critical
process Alert Manager. Purpose of working on these projects was to get acquainted with different
layers of Verse architecture and get to know the intricacies of Verse Search subsystem.
Author: Paras Mani (200601063) and Yadav, Vaibhav (200601072)

Title: Rule Engines; 6 p.; 2010.
Keywords: Rule engine; Semantic web; Knowledge base; Inference rules; Forward and backward chaining;
JESS; Facts; Rules.
Abstract: Rule engine is an engine which is based on rules, logics and facts. Rule engine is an expert system
which has a collection of rules (knowledge base) and an inference engine which analyses fact
patterns and is matched with the applicable rules. Inference search engine overcome the problems
of keyword based search engines. We have used an expert system JESS to understand the working
of rule based engines.
Author: Parashar, Shaifali (200601117)

Title: Bayesian learning of t-mixture Models, SVFMM and Their Application on Satellite Image
Segmentation; 8 p.; 2010.
Supervisor: Mitra, Suman and Majumder, Prasenjit
Keywords: Bayesian learning; Bilateral filtering, finite mixture models; Gaussian mixture model; Spatially
variant mixture model; T-distribution mixture model
Abstract: This paper presents a technique for performing unsupervised clustering of satellite images using a
unique ‘sampling-resampling’ based Bayesian learning method. In this paper, we focus on the use of
finite mixture models and spatially variant finite mixture models as well to cluster data sets of
continuous multivariate data. As normality based methods of estimation are not robust, we review
the use of t component distributions. With the mixture model-based approach, the normal
distribution for each component in the mixture model is embedded in a wider class of elliptically
symmetric distributions with an additional parameter called the degrees of freedom. The advantage
of the t mixture model is that, although the number of outliers needed for breakdown is almost the
same as with the normal mixture model, the outliers have to be much larger. We have also
implemented spatially variant finite mixture models with Bayesian learning which therefore gives a
better result than normal and tmixture models.
22
Author: Pareek, Aditya (200601095) and Ajay Kumar (200601180)

Title: Software Transactional Memory; 7 p; 2010.
Keywords: Concurrency; Atomicity; Software transactional memory (STM); Multithreading
Abstract: With the advent of the multi-core processors and considering the very fact that writing a parallelism
implementation is notoriously difficult, the idea of including transaction as a part of the
programming model has gained more attention in the recent past years. Transactions, basic building
block of the database world, are used for concurrency control in parallel programs and satisfy the
property of Atomicity and Isolation. Transactional Memory as compared to the other ideas in this
field is evolutionary rather than revolutionary. Software Transactional Memory is an emerging
synchronization mechanism for ensuring the protection of shared data in concurrent programs. It
basically aims at providing simple, intuitive and user-friendly environment to write parallel programs
and is more scalable alternative to traditional locking mechanism, by promoting the notion of
transactions. In this paper, we aim to discuss the basic concept and issues involved in Software
Transactional Memory (STM) and reflect the comparative analysis with the traditional lock
synchronization system.
Author: Parihar, Raviraj (200601085)

Title: Network Infrastructure Management System & SLA Generation Tool; 5 p.; 2010.
Keywords: Ticket; Nagios; Data center; Share point
Abstract: We have developed a web based portal “Network infrastructure management system”, which aims
at giving a simplified solution to network device management at the data centers of various
countries for the whole organization which also provides a graphical user interface for internal DNS
server using MYSQL database in the backend. We have also developed a new automatic service
level agreement (SLA) generation tool for a computer system and network monitoring software
application (Nagios) and developed scripts for updating Share Point’s database.
Author: Parwal, Ankit (200601049)

Title: IT Solutions for Intelligence Bureau; 12 p.; 2010.
Keywords:
Abstract: This project is to mainly computerize the Intelligence Bureau Department. The functions of
Intelligence Bureau broadly include crime detection, crime prevention and law and order
maintenance. All these functions are interlinked to each other, which depend on the flow of
information amongst them. This System will gather all the data about the important incidents,
organizations and people. The System will automate the process of analyzing the data and will
generate reports based upon the requirements. These reports will be very helpful in concluding the
fact from the data. The System will be able to take place of Physical files and thus removing the
paper work.
Author: Patankar, Ankur (200601053)

Title: Kinetic Typography; 5 p.; 2010.
Keywords: Kinetic typography , Signal processing
Abstract: Kinetic Typography is basically an animation technique of expressing emotions in text. This text is
presented over time in a manner intended to convey or evoke a particular idea or emotion.
Currently only few softwares exist to produce automated kinetic typography text and many have
started to come. The main aim of the project is to design an application, a Kinetic Typography
Editor which take text and sound as inputs and produce a kinetic typography text based on the
input sound.
23
Author: Patel, Raj (200601055) and Jain, Vikas (200601066)

Title: Study of Ant Colony Based Algorithm For Routing in Mobile Ad Hoc Network; 6 p.; 2010.
Keywords: Ant algorithm, Route discovery, Route maintenance, Route failure, Swarm intelligence
Abstract: Mobile Ad hoc networks consist of a set of dynamic nodes. The topology does not remain fixed but
changes with time dynamically. This necessitates a change in routing from route to destination. The
traditional routing algorithms works well for static networks but for the mobile ad hoc networks, an
algorithm that performs route discovery phase, route maintenance phase, and detection of failure
along the path between two nodes is needed. This paper studies the performance of a recently
presented paper by Cauvery N.K. and K.V. Vishwanatha in an International Conference on
Artificial Intelligence and Neural Networks, Bangkok in Dec 2008.
Author: Pokarna, Sneha S Singhvi (200601099) and Mishra, Ankit (200601153)

Title: Subband Adaptive Filtering in Frequency Domain and Coefficient Decimation Filter bank; 8 p.;
2010.
Keywords: Frequency domain adaptive filtering (FDAF); filter banks; block least mean squared (BLMS);
transfer domain adaptive filtering, Coefficient decimated filter bank (CDFB); Sub-band adaptive
filtering; Least mean error (LMS) method; Power spectral density (PSD); Polyphase implementation
of filter banks.
Abstract: When we do the time domain implementations for adaptive filters, the ∆Wn (correction/ update)
contains step size µ which is to be chosen such that the rate of convergence increases. The problem
with time domain adaptive filter is witnessed when colored (correlated) noise is present. As this
noise is band limited, it is infinite in the time domain. So the adaptive algorithm fails to converge
and the mean-squared error keeps adding up. The result is that the input signal (having correlated
noise) never converges to the desired signal (without noise). If the noise is correlated with the
signal, this noise gets amplified when doing time-domain adaptive filtering. The solution can be
achieved using frequency domain adaptive filtering. Further in frequency domain adaptive filter
subband implementation, we can choose step size µ for different bands. So lower value of the step
size can be chosen for the bands where correlated noise is present and the MSE converges much
better though at a slower rate. This helps in achieving lower values of mean squared error (MSE)
after lesser number of iterations of the LMS algorithm. Further in the paper, coefficient decimation
filter bank (CDFB) is applied to the frequency domain sub-band adaptive filtering, to understand its
better performance over conventional analysis-synthesis filter bank achieved through polyphase
technique.
Author: Potru, Gowtham (200601092)

Title: Primality Testing; 6 p.; 2010.
Keywords:
Abstract: Over years many people proposed Primality testing algorithms. But for the first time an
unconditional deterministic polynomial-time algorithm (AKS algorithm) was proposed for Primality
testing by Agrawal, Kayal and Saxena in a paper titled “PRIMES is in P”[AKS]. In this project, the
AKS algorithm is analyzed, implemented and compared with other available algorithms for
primality testing.
Author: Prabhakar, Mayank (200601038)

Title: Locality Aware Parallelism; 5 p.; 2010.
Keywords:
Abstract: Most modern processors have shared cache on their chip. The shared cache architecture brings
exciting new opportunities to software and system designers. There are many software techniques
which can be used to better utilize the shared cache and enhance performance parallel multi-
24
threaded program. In this work, we conduct a systematic measurement of the influence of various
software techniques for improving data locality on different parallel multi-threaded program based
on major parallel programming models. The main software techniques we used were loop tiling,
processor affinity and cache-sharing aware program transformations. From these measurements we
were able to indentify which class of programs can be improved by which techniques. We were also
able to identify some reasons behind such observations.
Author: Prajapat, Jitesh Kumar (200601036)

Title: Noise Cancellation Adaptive Filter - A MicroBlaze Based Design; 4 p.; 2010.
Keywords: Adaptive filter; Normalized least-mean square (NLMS); Field programmable gate array (FPGA);
EDK; Micro blaze soft processor (MSP); RISC; OPB; LMB; FSL; Intellectual property (IP); FIFO
Abstract: Adaptive filters are widely used in many applications like: Interference (Noise) cancellation,
Prediction, Inverse modeling of system and Identification of system. These are a class of filters that
iteratively and continuously update their coefficients in order to minimize error in the output signal.
Since FPGA based designing and implementation of adaptive filters increase their configurability in
terms of number of coefficients and their data bit width so the implementation of this project is
done on FPGA (Spartan-3E Starter Board Kit).
Author: Prasad, K. Uday Bhanu (200601228) and Kotagiri, Harish (200601229)

Title: Sensor Event Service (SES); 8 p.; 2010.
Keywords: Web notification service; Alerts; Sensor web; Sensor alert service; Sensor event service
Abstract: Sensor Event Service (SES) is a component of Open Geospatial Consortium (OGC)’s Sensor Web
Enablement which is capable of generating notifications depending on the event and filter condition
set by clients. Here we discuss Sensor Alert Service (SAS) as an elementary model for
communication between sensor and clients. As the notifications generated by the Sensor Alert
Service contain lots of redundant data, a need for Event Pattern Recognition on the input data
streams is necessary. So, we discuss the protocol used for communication, event patterns in Sensor
Event Service (SES) and the efficient filtering using EML.
Author: Raghuveer, N. V. (200601029)

Title: Conflict Free Coloring of Some Graphs; 3 p.; 2010.
Keywords: Conflict free coloring; Frequency assignment; Graph theory; Computational geometry.
Abstract: Frequency assignment in cellular networks is the motivation bhing conflict free coloring of different
types of graphs. Conflict free coloring of set regions is it assign colors to the regions so that a point
residing in the intersection of regions should have a region with unique color. Attaining this goal
with minimum numbers of colors is an interesting problem and equally hard to that of colring of
graphs. Problem of minimizing number of colors of set of different region such as disks, intervals
and other convex regions have been studied in this report. The dual of this problem which is
conflict free coloring of points with respect to regions is also given some attention. Both static and
dynamic versions of the problem have been studied to capture practical scenario.
Author: Rai, Piyush (200601081) and Chauhan, Himanshu (200601181)

Title: Topology Control And Interference Optimization in Ad-Hoc Networks; 6 p.; 2010.
Keywords: Ad-hoc networks; Interference optimization; LISE; Topology control.
Abstract: Topology control in ad-hoc networks tries to lower node energy consumption by reducing
transmission power and by confining interference, collisions and consequently retransmission. In
this paper we will discuss the low interference algorithm named LISE (Low Interference Spanner
Establisher) – claiming to solve the interference issue by graph sparseness. We will try to implement
25
the algorithm and will analyze the result.
Author: Raj, Vishal (200601207)

Title: Query In RDF Graph for Semantic Search, 4 p.; 2010.
Keywords: Resource description framework (RDF) Resource; Property; Literals; Subject; Predicate; Object.
Abstract: In the present time RDF (Resource Description Framework) is consider as the standard for the
storage of data on the web. A computer application uses the information in structured format which
is scattered around the world wide web. RDF is an précis Model i.e. it breaks down the data into
small fragments. RDF uses the triple format for the storage of data, It divide the information into
SUBJECT, PREDICATE and OBJECT in other designation Resource, Property and Literal. With
the increase in the data, the demand for the searching techniques increased. This report will be
dealing with this topic.
Author: Raunak (200601075)

Title: Widget for Job Search; 4 p.; 2010.
Keywords:
Abstract: The main aim of this project is to make a job portal mobile widget for Vodafone Global which
enables the end user to either post their resume or post jobs. Users can also search for jobs as well
as they can also search for candidates. This product has been released recently in South Africa.
Through this widget the non-internet user can search for jobs or candidates on their mobile phone
with GPRS enabled handset or even on the television with the internet connection.
Author: Rayankula, Anvesh (200501123)

Title: Web Application for Employment Exchange Office; 4 p.; 2010.
Keywords: Web portal; Requisition form; N-Tier; Application; Servlets; IDE; JSP; PostgreSQL; SQL
Queries; TEEP [the employment exchange portal].
Abstract: An Ever increasing demand for employment needs various new techniques to accelerate the Job
Recruitments. An Employment Exchange portal acts as a medium between Employers and
Jobseekers and thereby addressing issues of mutual concern. This project talks about how to replace
the traditional manual system with a dynamic on-line web portal (TEEP) and the benefits of it to a
prospective Jobseeker and also the feasibility of the same. The following sections illustrate the
various tools, designs and their roles in developing a portal and how it increases the transparency
between the Jobseeker and Employer.
Author: Reddy, B. Rohit (200601177) Shashidhar, E. (200601107)

Title: Simulation Study of Bond Percolation; 6 p.; 2010.
Keywords: Cluster; Lattice, Connected components, Mean.
Abstract: The percolation theory is developed using general ideas of critical phenomena and applying these
theory in the applications of mathematics. Some of the conjectures are defined and illustrated,
approach to simulate few conjectures and the results produced are also shown in this report
26
Author: Reddy, G. Sreenivasula (200601041)

Title: Developing Dashboard and Analytics Frame Work for Digital Green System; 5 p.; 2010.
Keywords: Digital green dash board; Analytics tool kit; Offline system; Assistant development managers;
Digital green and development managers.
Abstract: This report explains the process of developing dashboard and analysis tool kit for Digital Green
system. Starting from the introduction of Digital Green concept and their systems, this report
discusses about implementation of their system by using technologies like python, GWT and
Django web framework. Digital Green is an organization which is working to improve the social,
economic and environmental sustainability of small farmer’s livelihood. For this Digital Green
produces the videos which are helpful to the farmers in increasing their fields productivity and also
raising their standards by having good yields. They needed an interface which includes all their
analytics regarding states, districts, blocks, village and videos that were produced. This interface will
provide the necessary information regarding Digital Green videos and also their effectiveness all
over the places where it has been disseminated. The goal of this project is to build Digital Green’s
Analytical Dashboard by using Digital Green ER-Model and their database schema. By using
Dashboard, Digital Green users will be able to retrieve the relevant information and also they can
access various statistics of the system by using which they can take efficient decisions.
Author: Reddy, Jahnavi (200601202) and Reddy, Sanjeeva (200601118.)

Title: Finding Depth Map from Stereo Images; 5 p.; 2010.
Supervisor: Joshi, Manjunathan. V.
Keywords: Depth map; Disparit; Sum of absolute difference; MF algorithm, Simulated annealing; Rectification;
Mean suare eror (MSE); Cyclopean separation; Sereopsis.
Abstract: The main objective of this paper is to compare the Depth Maps calculated from Local and Global
Methods. Two rectified images are taken as inputs and the depth map is calculated from the local
(Sum of Absolute Difference i.e., SAD and PMF algorithm (Pollard, Mayhew and Frisby)) and
global (Simulated Annealing) methods. Mean Square Errors (MSEs) of the true depth map (which
has been taken from the internet) and the depth maps obtained from both the local and global
methods are calculated and compared.
Author: Reddy, Sneha (200601123) and Kaveri Swetha (200601130)

Title: Analysis on Overhead Reduction Schemes of Signaling CQI Feedback in LTE Systems; 37 p.; 2010.
Supervisor: Chakka, Vijay Kumar
Keywords:
Abstract: • Introduction
• Overhead reduction schemes for signaling the CQI feedback
Author: Reddy, T. A. Sivananda (200601235) and Vangari, Naresh (200601215)

Title: Semantic Web for Agricultural Production (SWAP); 12 p.; 2010.
Keywords: Semantic web; Ontology; OWL, Text to speech (TTS).
Abstract: The current web represents information in human understandable form (natural language) and
humans can deduce facts and valuable results from this information but machines can't do it they
are ignorant, they can't make any sense about this information. The Semantic Web represents the
information based on concepts and relations which gives machine the ability to understand the
Semantics of information. The goal of this project is to develop information cum recommendation
system, based on Semantic Web paradigm, for farmers. This system uses a new approach of
dynamic query generation based on user input for context base search and outperforms the
traditional key word based search engines.
27
Author: Reddy, T. KrishnaTeja (200601211)

Title: To Compute The Continued Fraction of Logba Following Shank’s Algorithm; 4 p.; 2010.
Keywords: Shanks' algorithm; Continued fraction log; Heuristic algorithm.
Abstract: To give a more practical variant of Shanks' 1954 algorithm in [1] for computing the continued
fraction of logb a, for integers a > b > 1, using the ‘mean’ of integers in a sequence and an integer
parameter c > 1. The variant, when repeated for a few values of c = 10r, enables one to guess if
logba is rational and to find approximately r partial quotients.s
Author: Royal, Gajendra (200601169) and Pagaria, Ritesh (200601096)

Title: Optimization of Query Rewriting Techniques For OPDMS and DL-Lite; 6 p.; 2010.
Keywords: Terms algorithms; Owl 2; Ontology; Conjunctive query; P2P; Optimization; Query rewriting.
Abstract: Most of query rewriting Algorithms does not work well when size of axioms reach more than few
hundred. We have proposed optimization technique for query rewriting over heterogeneous
ontology’s in OPDMS (Ontology based P2P data management system) that considers integrity
constraints specified on local data sources and for homogenous ontology’s we did comparative
study for rewriting algorithms of OWL2 QL profile which[7] is based on DL-Lite family.
Author: Sabnani, Hitesh (200601142)

Title: Question Answering System: Retrieving Passages; 4 p.; 2010.
Supervisor: Majumder, Prasenjit
Keywords: Question answering; Information retrieval; Natural language processing
Abstract: Retrieving relevant passages and ranking them is an integral sub-problem of Question Answering.
The answer text to be returned is a substring of the relevant passages. It is therefore important to
retrieve the relevant passages before finding the answer text for the question. We propose a system
that returns a relevant passage for a question.
Author: Salecha, Rakesh (200601009)

Title: Rumor Spreading (via Mobile) in Social Networks; 5 p.; 2010.
Keywords: Rumor spreading; Gossip; Random networks, Graphs and PA model; PUSH-PULL strategy.
Abstract: Rumor spreading is one of the basic mechanisms for information dissemination in networks. A
rumor spreading strategy (PUSH, PULL or PUSH-PULL), given a (random) graph of n nodes, the
strategy succeeds if the message is delivered in n, many rounds, regardless of the starting node, with
probability 1 - o(1 ) [1]. It fails if, with non-vanishing probability, there exist a node from which the
message requires polynomially-many rounds to be delivered to all nodes [1]. This report studies the
performance of rumor spreading in the classic preferential attachment model of Bollob´as et al,
which is considered to be a valuable model for social networks. It also aims to understand
difference between PUSH, PULL, and PUSH-PULL strategy and decide which is more suitable for
various types of applications..
Author: SaiSwaroop, K. (200601194)

Title: CTA Studio; 6 p.; 2010.
Keywords: ASIA (automated scripting interface for ASICS); ASIC (application specific integrated circuit); CTA
(comprehensive test application); FTA (functional test area); QPST (qualcomm product support
tool); PERL (practical extraction and reporting language); XML (extensible markup language); FFA
(form factor appliance).
Abstract: CTA Studio is a Desktop application that is designed to work on the top of ASIA (Automated
Scripting Interface for ASICS) and CTA (Comprehensive Test Application). CTA Studio provides a
GUI interface for creating, editing XML user scenarios, loading and executing scenarios on the
28
phone (target/FFA) and retrieving the logs from the phone((target/FFA) and displaying it in a user
friendly format.
Author: Sarangdevot, Krishna Pal Singh (200601005)

Title: Fusion of Spectral and Phase Information for Singer Identification; 5 p.; 2010.
Supervisor: Patil, Hemant
Keywords: Music information retrieval; Singer identification, phase information.
Abstract: All the previous work done in the field of Singer identification based on MFCC, the phase
information has been ignored. We proposed the technique of fusion of spectral and phase
information for the development of a system for singer identification. For this purpose we are
taking database of 20 famous Indian singers (10 male and 10 female). We will first make models of
the features extracted from each singer and then for testing we will extract features from the query
song and compare with each model. The model which will approximately similar to the features of
the song, we will assign that query song to singer. By fusion of spectral and phase information we
are getting 15% better results than the results obtained from only spectral information.
Author: Sethi, Samahil (200601236) and Sunil Kumar (200601179)

Title: SPARQL Query Optimization Through Selectivity Estimation of Triple Patterns, 6 p.; 2010.
Keywords: Query optimization; Selectivity estimation; SPARQL; Triple
Abstract: In our project we worked on different approaches of query optimization. Since in real world
millions of transactions happens per second and for these transaction optimization plays an
important role because it reduces the execution cost(time).There are lots of methods of query
optimization like re-arrangement of query, selectivity estimation of query etc. We worked on
selectivity estimation of triple pattern for query optimization. We are working with SPARQL query
optimization because SPARQL query takes less execution time. In selectivity estimation we re-
arrange the triples according to their selectivity which is calculated through cost analysis. In this
paper we implemented two algorithms and compared the results on the basis of execution time.
Author: Shah, Dhruv (200601050)

Title: Scenario-based Protocol Checker; 19 p.; 2010.
Keywords: Security protocols; Protocol checker; Man-in-the-middle; Unknown key share
Abstract: This project aims at developing and implementing a security protocol checker, which finds possible
attacks on the given security protocol. It is a scenario-based checker, and therefore works for
specific attack models in the public key authentication domain. It can check for the violation of
specific security claims. Our work is based on the work of TakamichiSaito, whose proposed
algorithms have been incorporated in the implementation of the checker. Besides comprehensively
testing the checker on a variety of protocols, we have thereafter expanded the scope of the checker
by adding some new attack models.
Author: Shah, Prasann (200601034)

Title: A Self-Healing and Mutual-Healing Key Distribution Scheme for Wireless Networks; 6 p.; 2010.
Keywords: Self-healing; Mutual-healing
Abstract: Self-Healing mechanisms have been proposed to establish session keys in large and dynamic groups
even when the underlying network is unreliable. Mutual-Healing deals with some of the deficiencies
existing in the Self-Healing Mechanisms. This paper proposes a scheme which encompasses both
Self-Healing and Mutual-Healing mechanisms using bilinear pairings. The contributions of this
paper are as follows: firstly, the scheme is collusion-free for any coalition of non-authorized users.
Secondly, the private key has nothing to do with the number of revoked users and can be reused as
long as it is not disclosed. Thirdly, the storage overhead for each user is a constant.
29
Author: Shaktawat, Digvijay Singh (200601128) and Aggarwal, Pushpak (200601173)

Title: Towards Improving Web Service Composition and Ranking; 7 p.; 2010.
Keywords: Page-rank, Service composition; Service ranking; Structured data; Web service; Workflow
Abstract: Web services, which facilitate automated machine-to-machine interaction, are being touted as the
next big revolution in the internet world because of they provide for easy interoperability, reuse and
integration of functionalities. But as their need grows, individual services will greatly hamper
scalability of the service model. Herein lies the need for bundling services together; a process called
web service composition. Here we extend a comprehensive approach towards service composition
using workflows and move on to improve service search results using a new technique for ranking
the web services based on their popularity.
Author: Sharma, Anshul (200601183)

Title: Implementation of Distributed Data Structures; 5 p.; 2010.
Keywords:
Abstract: Data structure is a particular format of organizing and storing data. Different basic data structures
available to us are arrays, liked lists, stacks, queues, trees etc. However, in current scenario, various
applications demand data structure which can be operated on different machines at the same time,
or in simple terms distributed data structures. As the implementation of these data structures is
challenging as well as essential, in this paper, I have studied various intricacies involved in the
implementation and have started with implementation of distributed array first, moving on to more
complex data structures. The most important application of distributed data structure is Real time
Document Editing. It requires algorithms for achieving collaboration among its different copies.
Lately, Google wave, a real time communication and collaboration platform, is developed which
implements a distributed data structure. This paper also looks upon underlying distributed data
structure of Google Wave along with the technology used for concurrent editing which is
Operational Transforms.
Author: Sharma, Manish Kumar (200601004)

Title: Verification of Digital Systems; 6 p.; 2010.
Keywords: CIC Filter, BLDC motor; Verification; PWM generator; System generator; PI controller
Abstract: Verification is the process which verifies the correctness of your design. I verified two digital
systems, one of which was a predesigned CIC (Cascaded Integrator-Comb) filter and other was an
FPGA based Speed Control of BLDC (Brushless DC) motor. CIC filter was verified as a black box
and for BLDC motor, speed controller (PI controller) and PWM generator were first designed and
then integrated with the switch and BLDC motor. After this, the system was verified. Both systems
were verified first on Xilinx System Generator Tool and then on hardware using Xilinx Spartan 3
and 3E board.
Author: Sharma, Vineet Kumar (200601093)

Title: A CPW-Fed Planar V-Type Monopole Antenna For USB Applications; 8 p.; 2010.
Keywords: Advance design system (ADS); Coplanar- waveguide (CPW); Printed circuit board (PCB); Ultra-
wideband (UWB); UWB antenna and wireless communications
Abstract: A small ultra-wideband V-type monopole antenna fed by a coplanar waveguide (CPW) for mobile
UWB devices has been studied and simulation work has been performed using ADS (Advance
Design System) software. It has dimension of 14.48mm*26mm*0.6mm and provides a wide
impendence bandwidth ranging from 7.50GHz to 9.24GHz adjustable by variation of its
parameters, such as the relative permittivity, thickness of the substrate, width of antenna and
ground plane dimensions. The characteristics of this antenna are sensitive to both vertically and
horizontally polarized electromagnetic waves. The planar dimensions of the antenna are proposed
30
to be in mm dimension. This paper describes the details of the analyses, performance

characteristics, simulation results and the parametric study performed during the project.
Author: Shashi Kumar (200601155)

Title: Virtual 3-D Tour of Bagh Caves; 5 p.; 2010.
Keywords: Stereo correspondence; Image base rendering, Mesh modeling.
Abstract: Documentation and preservation of ancient architecture is of greater importance for further
research and increase in the knowledge of ancient civilization. There are many techniques by which
one can preserve the replica of sites like painting of the site by any artist or 2D imaging technique
but as technology becoming more advanced now one can make a shift from 2-D to 3-D imaging
techniques with user friendly interface and interaction. This technique can also be a better
representation of the heritage sites. By navigating through mouse one could experience a walk
through the cave without even going to the place. Many of the heritage sites are in the places where
travelling is very hard to do so in that case this 3D tour will be of great help. In this project I have
tried to make the 3D tour of bagh caves.
Author: Shiva Rama Krishna, I. (200601103) and Kethireddy, Sudheer Kumar (200601172)
Title: Performance Analysis of Jiaxin Wang, Tarjan and Szwarcfiter Algorithms; 5 p.; 2010.
Keywords: Cycle; Directed graph; Open path; Backtracking stack; Queue; Adjacency matrix, Position vector,
Boolean vector; Elementary path; Elementary cycle.
Abstract: Numerous algorithms have been proposed for enumeration of cycles in a Di-graph. Three standard
algorithms proposed by Swzarcfiter and Lauren, Jiaxin Wang and Hongbo Liu and Tarjan
respectively have been implemented and their performance is evaluated by a simulation study.
Author: Shrimali, Vaibhav (200601010)

Title: Stack Offence - A Faulty Approach; 23 p.; 2010.
Keywords: Software approach; System security; GCC; Activation frame
Abstract: Software coding practices usually ignore to enforce strict bounds checking on buffers, pointers etc.
This ignorance leads to a software code which is vulnerable to a kind of attack known as buffer
overflow. Buffer overawes are the simplest yet most powerful attacks in the field of system security
exploiting software vulnerabilities. This report discusses this well-known attack along with some of
the proposed and implemented approaches to counter this attack. It also identifies some flaws in an
approach known as "StackOfFence" which claims to ensure the integrity of the return address by
pushing on the stack two copies of the return address, a transformed (or encrypted) return address
value along with the original one. Before popping the return address, two return address values are
compared to detect any malicious activity, thus preventing the exploitation of the stack based buffer
overflow vulnerabilities. This report discusses an attack on "StackOfFence" and tries to expose
some of the vulnerabilities in this approach.
Author: Singh, Abhinav (200601101)

Title: SyMynd - Share your 'my'nd; 5 p.; 2010.
Supervisor:
Keywords: Arnold transform, Discrete wavelet transform, Single value decomposition, Watermark.
Abstract: Ebooks can be a very efficient way to disseminate knowledge. Ebooks present many benefits and
advantages over printed books like availability, portability, language accessibility, costs, security,
distribution, environmental benefit. Along with purchase, print and download facility, features like
multi-media and link attachment makes it even more useful.
31
Author: Singhal, Arjun (200601176)

Title: Digital Circuit Design Using Double Gate MOSFETs, 6 p.; 2010.
Supervisor: Parikh, Chetan
Keywords: Double gate MOSFET (DG MOSFET); Fully depleted silicon on insulator (FDSOI)
Abstract: Moore’s law projects the shrinking of dimensions exponentially and hence the doubling of the
number of transistors every two years. This leads to current chips having more than billion
transistors and channel lengths being less than 30nm. This has led us to search for alternatives to
existing devices. As a result these new transistors have opened new research areas and here one
such technology called the double gate MOSFET will be discussed. Digital Circuits using double
gate MOSFET will be the main focus of this report.
Author: Singhal, Astha (200601024) and Rustagi, Prerna (200601203)

Title: A Study on Protocol Patching Using SHRIMP, 26 p.; 2010.
Keywords: SHRIMP; Type flaw attacks; Classic replay attacks; Multi protocol attacks; Strand space
Abstract: This report is a study on the automated patching of security protocols using the protocol patching
tool SHRIMP. It deals with the extension of SHRIMP and its limitations. It discusses the heuristics
for the incorporation of patches for type flaw attacks and classic replay attacks in the existing
SHRIMP framework. It also discusses ground work for patching of multi protocol attacks using
SHRIMP and the basic concepts of Strand Space formalism. The theoretical aspect of the type flaw
patch was published in [1], where in the notion of Strand Spaces is being extended to track down
type flaws.
Author: Sirohi, Rahul (200601151)

Title: Approach Towards a Semantic Multimedia Retrieval Model, 6 p.; 2010.
Keywords:
Abstract: Everyday huge amount of information is saved in digital format. This information is in the form of
documents, books, pictures, videos, audios and etc. Today the major concern is the efficient and
quick retrieval of the information which the user demands through his query. This highlights the
issues we face when we deal with Multimedia data retrieval. In this paper I have discussed the ways
to achieve Semantic web and what issues are hindering us to reach the high level of Semantic
retrieval. I have tried to develop algorithm that deals with the problem of retrieval in multiple
ontology of same domain, using one query, where synonyms are used in the keywords while
defining the Ontologies. In addition to it, how to deal with natural language query where the user
has no idea of the keywords used in defining the relationship used in the ontology but his query
needed to be answered.
Author: Srivastava, Utkarsh (200601074)

Title: Parallelization of Waterman-Smith String Alignment Algorithm; 4 p.; 2010.
Keywords: Local alignment, optimal score; Multi-threading; Dynamic programming; Average execution time;
Alphabet set.
Abstract: Detecting alignment patterns in strings is an important area of research and of great relevance to the
field of DNA, RNA and protein analysis. This project discusses the optimization of the string
alignment algorithm proposed by Smith and Waterman [1], in a multi-threaded environment.
32
Author: Somani, Vishal (200601197)

Title: Security Issues in IPsec, 4 p.; 2010.
Keywords: Encapsulating security payload; IP; Internet key exchnage; Key recovery.
Abstract: This report is about secuirty issues in IPsec and presents a brief description of how the keys are
exchanged between the communicating parties, the protocols which are used for communication,
the modes in which they operate and how the key can be recovered.
Author: Sudheerkumar, M. V. (200601027) and Avula, Sandeep (200601048)

Title: Evaluation of Web Server in a Virtualized Environment; 7 p.; 2010.
Supervisor: Chaudary, Sanjay
Keywords: Cache; Benchmarking; Virtualization
Abstract: The dependency of web servers plays an important role in the furthering of the cloud technology.
We essentially need to understand the working of the web server with the parameters that directly
affect the web server. Through a series of experiments we wish to detail the difference in the
performance of a web server running on a normal machine i.e., sans a virtualized environment and
one which runs on the Kernel Virtual Machine (KVM). We would be mainly looking to compare
both the machines by taking into account the low level system metrics like cache misses, number of
un-halted clocks, the buss traffic and the system throughput. There is a huge difference in the
performance of both these machines and a primary cause is seen to be the excessive processing
speed of the processor, which interestingly hinders the performance of the servers in certain cases.
Now how we optimize the hardware before us to use it to bring about an efficient performance is
what the experiments are about.
Author: Sukhwal, Prakash C. (200601052)

Title: Ontology Development For Digital Library In Health Domain; 6 p.; 2010.
Keywords: Ontology; OWL; Semantic web; Protege
Abstract: This report will discuss the various aspects and know how required for the development of
ontologies and developing a system schema using UML to realize the multiple-ontology based
semantic Medical Digital Library. It discusses the procedure (step-by-step) followed towards
developing the project under presentation. This document intends to facilitate any future work to be
conducted in the domain of medical ontology development by both stating the power of tool
protégé and work yet to be carried out in future.
Author: Suresh Kumar (200601140) and Rakesh Kumar (200601158)

Title: Simulation of Traveling Salesman Problem Using Markov Chain Monte Carlo Method; 6 p.; 2010.
Supervisor: Mulherkar, Jaideep
Keywords:
Abstract: This paper presents two approaches to solve Traveling Salesman Problem, one is using the
Exhaustive Search and other is using Simulated Annealing. The Traveling Salesman Problem is not
a new problem to the world of researchers. Research has been started from the 1930s and till now
scientists are working on it to give algorithm that is more efficient than the previous algorithms like
Exhaustive Search. The application of Simulated Annealing is quite straight forward; for that we
start with randomly distributed configuration and perform series of steps to change the
configuration gradually to obtain a best possible solution within a fixed amount of move or time
frame [1]. In this problem, next city is generated by the Metropolis algorithm. The same moves are
also followed in case of greedy algorithm but now acceptance probability factor given by Metropolis
criterionis also included which reduces the task of selecting any particular city in a particular order
and we can now select any city in any order with certain probability factor. This paper relates
Traveling Salesman Problem with the Markov chain.
33
Author: Swarnika (200601109)

Title: Automated Detection of False Attacks; 26 p.; 2010.
Keywords: Security protocol validation; Attacks on security protocols
Abstract: This document discusses another approach to the attacks on security protocols. Attacks Work as a
tool to evaluate the effiency of the protocol. However, in some scenarios the validity of certain
attacks may itself stand questionable. Thus the analysis of attacks and their validation offers an
interesting area of study.
We have been able to identify two different categories of false attacks generated by Scyther, the
automated protocol checker developed by Dr. Cremers. This paper also describes the input and
outputs of the automated detection of false attacks framework (see figure 5). We have endeavoured
to formalize the identification of false attacks and in the process we have developed an automated
tool for the same. This work also forms a part of an autonomic framework (figure 1) and serves to
validate the attacks generated by the automated protocol checker.
Author: Tallam, Kamal Tej (200601019)

Title: Multiple Object Tracking and Shape Detection; 5 p.; 2010.
Keywords:
Abstract: Shape recognition and object tracking have become pivotal across areas ranging from medical
imaging to surveillance. This project aims to develop a system which can detect and distinguish
medicinal pills and give an estimate of the number of defective pills. The project also involves
tracking of similarly featured multiple targets in a cluttered environment. The approach taken
consists of simulating the relative performance of Multiple Hypothesis Tracking (MHT) and Joint
Probabilistic Data Association (JPDA) techniques. This work provides comparison in terms of error
and the time taken for simulation of results. MHT implementation uses a log-likelihood track score
to choose among various hypotheses. JPDA uses a weighted sum of the observations to update a
track. These weights are the probability that the observation originated from the target in track. It
was found that while JPDA is quickly confirms the tracks than MHT, JPDA tracks are more likely
to be error prone.
Author: Temani, Vaibhav (200601021)

Title: 4-Issue Speculative Superscalar Microprocessor; 4 p.; 2010.
Keywords:
Abstract: Techniques such as register renaming, dynamic scheduling, branch prediction, and multiple-
instruction issue have become the basic ingredients of any modern day microprocessor architecture.
This report outlays the design of a 4-instruction issue superscalar architecture implemented in
Verilog HDL which supports the aforementioned techniques. The processor executes the
instructions in an out-of-order fashion implying that instructions are not executed sequentially, but
depending on the availability of resources. The program correctness is confirmed due to committing
of instructions in order. This provides a lot of improvement over conventional simple pipelined
processors.
Author: Tiwari, Akash (200601013) and Verma, Arpita (200601090)

Title: On-Line Load Balancing; 4 p.; 2010.
Keywords: Introduction; Basic schemes and algorithms; Permanent machine case; Temporary machine case;
Algorithms.
Abstract: We will study the problem of Online Load Balancing, where our goal is to minimize the maximum
load on any machine model at a given time. We consider the problem of scheduling permanent jobs
on related machine model in an on-line fashion assuming that we know the maximum job a priori
34
and develop an algorithm that achieves a competitive ratio of 2.
Author: Tripathi, Anirudh Kumar (200601141)

Title: Evaluation of Heap Sort Algorithms; 5 p.; 2010.
Keywords: Complexity; Performance; Running time.
Abstract: Heap sort is a sorting algorithm and for this special type of data structure called Heap is used. There
are many types of heaps. Here in this project I am evaluating three different types of heap. The
purpose of this study was to evaluate the performance of various heap sort algorithms, namely
Binary Heaps, Binomial Heaps and Fibonacci Heaps. For this purpose I have implemented the
above algorithms and measured the running time for various methods of those algorithms.
Author: Tripathi, Harshita (200601143) and Passi, Samir (200601234)

Title: Towards a Digital Language Knowledge System: Boli; 7 p.; 2010.
Keywords: Cognitive system of language; Boli; Knowledge Systems; Multi-lingual application
Abstract: Languages define us. It is through languages that we make sense and meaning of everything around
us. The problem of dying languages is not restricted to the loss of a tool of communication. A
language dead, is a knowledge society lost forever. We have developed a concrete stand-alone
system of language as a knowledge base, which aims at transforming orality to text via established
script typeface, builds up a multi-lingual database and incorporates a lexicon and an online/offline
translation system within it. It is an attempt to preserve a language, its culture and knowledge
through a network of people collaborating as an agency. Boli tries to set up a participatory
community system where language communities come together for building up their own
knowledge bases. It also works as a language learning system. Boli as a tool is a lexicon-cum-
translator, but Boli as a system is a participatory linguistic knowledge base.
Author: Vamsi Venkat, I. (200601170) and Amith Kumar, M. (200601115)

Title: Finding Smallest H-Subgraph in Real Weighted Graphs; 5 p.; 2010.
Keywords: Minimum H-subgraphs; Subgraphs; Graphs; Graph theory.
Abstract: Finding cliques and other types of subgraphs in a large graph are classical problems in complexity
theory and algorithmic combinatorics. The problem of finding induced subgraphs on k vertices in
an n-vertex graph has been studied extensively. It is proposed to implement and investigate the
performance of the algorithm developed by Virginia Vassilevska and Ryan Williams.
Author: Vashistha, Ishan (200601182)

Title: Comparative study of Various Reputation System through Simulations; 5 p.; 2010.
Keywords: OCEAN: Observation based coperation enforcement in ad hoc networks; PDF: Probability density
function
Abstract: Ad hoc networks heavily rely on the cooperation of nodes. In such scenario a misbehaving node
can very badly affect the working of the network. Various reputation systems have been proposed
to assign reputation to different entities of a system so that misbehaving entities could be found out
and severely dealt with. The objective of this project is to do compare various proposed reputation
systems through simulation and comparison with the Social Reputation System to find out ways in
which these existing reputation systems can be modified and applied to fit the need of an Ad hoc
network.
35
Author: Venkatesh, D. (200601175)

Title: New Protocol for the Nearby Friend Problem, 15 p.; 2010.
Keywords: Nearby-friend problem; Location privacy
Abstract: The nearby friend problem in the context of location based services is to learn the location of a
friend only if he or she is actually nearby, maintaining the privacy of their locations at the same time.
We propose a new protocol which is a variant to the existing Louis protocol. Our protocol does not
require any third party to communicate the answer to the user.
Author: Vyas, Pallav (200601070)

Title: iPaper: a digital substitute of a print paper; 5 p.; 2010.
Supervisor: Roy, Anil K
Keywords: Tangible interface; Fluid interface; Ubiquitous computing; Digital newspaper; Human computer
interaction
Abstract: In modern lifestyle, where technology makes a style-statement along with providing various
facilities, there is an imperative need of breakthrough in accessing and reading/viewing news, too.
Here we introduce an iPaper, a handy portable digital newspaper which attempts to revolutionize
newspaper reading. iPaper explores new and interactive ways of information delivery to the readers,
by using the already existing unfathomable source of information and an intuitive and immersive
user interface. It will provide the user with news of his interest and will keep the news headlines
always updated by remaining connected to the internet. We expect that the iPaper would be an
entirely new experience for the reader and cost-effective as well. iPaper will not just be a medium to
deliver news, but to be a complete replacement of paper.
Author: Vyas, V. Harish (200601191)

Title: Comparison Between Algorithms for Solving Discrete Logarithm Problem; 4 p.; 2010.
Keywords:
Abstract: The discrete logarithm problem is important in cryptography because of its wide spread use in
various security protocols. The security of many cryptosystems is based on the difficulty of solving
the discrete logarithm problem. We are going to discuss about 2 algorithms which are used to solve
discrete logarithm problem and compare the two algorithms.
Author: Yeshwanth, L. (200601108) and Reddy, Hari Teja A. (200601210)

Title: Discovery of Semantic Web Services; 7 p.; 2010.
Keywords: Web services; Ontology; Semantic annotations; Match-making algorithm; Bipartite graph
Abstract: Web service is becoming the next generation of web based applications because of their accessibility
and compatibility [9]. Adding semantics to web services improve the reusability of Web Services by
facilitating the composition of services, improving discovery, and enabling the integration, popularly
known as semantic web services. These web service descriptions (WSDL) are generally stored on
Universal Registries like UDDI, which is known to be standard for publishing and discovery of
Web services. The process of locating or discovering of desired Web services on these registries is
known as Web Service Discovery. This paper provides a brief overview of Semantic Web service
technologies and focus on the Service Discovery. Also, we presented how SAWSDL can be used to
annotate service descriptions.
36
Author Index
Agarwal, Animesh, 01 Gupta, Nakul, 11

Agarwal, Ankit, 01 Gupta, Sanchit, 11
Agarwal, Rohit, 01 Gupta, Saurabh, 11
Agarwal, Sweta, 02 Gupta, Setu, 12
Aggarwal, Karan, 02 Gupta, Sumit, 12
Aggarwal, Pushpak, 30 Hari, C., 13
Agrawal, Ankit, 02 Jain, Anshul, 12
Agrawal, Ankur, 02 Jain, Ansu, 12
Agrawal, Shruti, 02 Jain, Anubhuti, 11
Agrawal, Sudhanshu, 03 Jain, Ashwin, 13
Agrawal, Vijit, 19 Jain, Namit, 19
Agrawal, Vinay, 03 Jain, Prateek, 13
Ajay Kumar, 23 Jain, Rachit, 13
Akshun Kumar, 03 Jain, Rajesh Kumar, 13
Amith Kumar, M., 35 Jain, Shobhit, 14
Anand, Ranajeet, 03 Jain, Sneha, 14
Anaparthi, Ajay, 17 Jain, Vikas, 24
Anudeep C., 04 Jindal, Aanchal, 14
Avinash, K., 04 Jindal, Tanu, 14
Avula, Sandeep, 33 Josan, Rishi, 05
Bhandari, Rohan, 11 Joshi, Sanika, 15
Bhargav U. L. N., 04 Kamra, Hitesh, 15
Bhola, Kushal, 05 Kaveri Swetha, 27
Biyani, Manisha, 04 Kavita, 15
Bolia, Shashank, 05 Kethireddy, Sudheer Kumar, 31
Bolla, Ramya, 05 Khandelwal, Kapil, 02
Chaitanya, P. S. S., 05 Khandelwal, Manish,15
Chauhan, Himanshu, 25 Kolli, Bharath, 16
Chauhan, Vishal Singh, 06 Kolli, Venkata Siva Ramakrishnh, 16
Chaurasia, Anshul, 06 Konda, Ramakrishna, 16
Chennuru, Akhil, 06 Konduri, Ravi Shankar, 21
Chhabra, Jatinder Singh, 06 Koneru, Pramod Chowdary, 17
Chokhra, Brijesh, 15 Kotagiri, Harish, 25
Choudhary, Smit, 07, Koundinya, Sri Harsha R., 17
Dalmia, Nikhil Kr., 07 Krishna, Sai Vamsi, 17
Dani, Dhruv, 07 Maheshwari, Ankit, 18
Dhanvijay, Anoop Kumar, 07 Maheshwari, Mohit, 18
Dhulia, Harsh, 08 Mahidhar S, 18
Divya, B., 08 Mani, Paras, 18
Dorav Kumar,08 Medisetty, Murali, 19
Dubey, Sameer, 03 Mehta, Anshul, 05
Dutta, Prashant P., 08 Mishra, Ankit, 24
Dwivedi, Sudhanshu, 09 Mishra, Pranjal, 19
Garg Ankur, 18 Mithal, Arpit, 19
Garg, Khushal, 09 Mittal, Mohit Kumar, 19
Garg, Prashant, 18 Mulagalapati, Murali, 19
Garg, Somya, 10 Munagala, Vivek, 20
Goda, Sai Suneel, 09 Nagar, Kartik, 20
Goel, Anshul, 09 Nagar, Vardan Hemant, 20
Goyal, Prateek, 10 Narang, Naveen, 21
Goyal, Shri Krishna, 10 Narayana, Rushi N., 21
Gumber, Jayesh, 10 Naveen, D., 21
Gupta, Mradul, 11 Nigam, Anurag, 11
Gupta, Ankit, 10 Niranjan, Rahul Kumar, 22
Gupta, Anurag, 11 Nukala, Mounika, 21
50
Author Index
Pagaria, Ritesh, 28 Singhal, Astha, 32

Pandey, Saket, 13 Sirohi, Rahul, 32
Paras Mani, 22 Somani, Vishal, 33
Parashar, Shaifali, 22 Srivastava, Utkarsh, 32
Pareek, Aditya, 23 Sudheerkumar, M. V., 33
Parihar, Raviraj, 23 Sukhwal, Prakash C., 33
Parwal, Ankit, 23 Sunil Kumar, 29
Passi, Samir, 35 Suresh Kumar, 33
Patankar, Ankur, 23 Swarnika, 34
Patel, Raj, 24 Tallam, Kamal Tej, 34
Pokarna, Sneha S Singhvi, 24 Temani, Vaibhav, 34
Potru, Gowtham, 24 Tiwari, Akash, 34
Prabhakar, Mayank, 24 Tripathi, Anirudh Kumar, 35
Prajapat, Jitesh Kumar, 25 Tripathi, Harshita, 35
Prasad, K. Uday Bhanu, 25 Vamsi Venkat, I., 35
Prem Kumar S. S., 06 Vangari, Naresh, 27
Raghuveer, N. V., 25 Vashistha, Ishan, 35
Rai, Piyush, 25 Venkatesh, D., 36
Raj, Vishal, 26 Verma, Arpita, 34
Rakesh Kumar, 33 Vyas, Pallav, 36
Raunak, 26 Vyas, V. Harish, 36
Rayankula, Anvesh, 26 Yadav, Vaibhav, 18
Reddy, B. Rohit, 26 Yadav, Vaibhav, 22
Reddy, Bhooma B., 04 Yeshwanth, L., 36
Reddy, G. Sreenivasula, 27
Reddy, Hari Teja A., 36
Reddy, Jahnavi, 27
Reddy, M. Sai Sujith Kumarm, 08
Reddy, Prudhvi, 21
Reddy, Sanjeeva, 27
Reddy, Sneha, 27
Reddy, T. A. Sivananda, 27
Reddy, T. KrishnaTeja, 28
Rohan, 20
Royal, Gajendra, 28
Rustagi, Prerna, 32
Sabnani, Hitesh, 28
SaiSwaroop, K., 28
Salecha, Rakesh, 28
Sarangdevot, Krishna Pal Singh, 29
Sethi, Samahil, 29
Shah, Dhruv, 29
Shah, Prasann, 29
Shaktawat, Digvijay Singh, 30
Sharma, Anshul, 30
Sharma, Anurag, 02
Sharma, Manish Kumar, 30
Sharma, Vineet Kumar, 30
Shashi Kumar, 31
Shashidhar, E., 26
Shiva Rama Krishna, I., 31
Shrimali, Vaibhav, 31
Singh, Abhinav, 31
Singhai, Mayank, 12
Singhal, Arjun, 32
51
Supervisor Index
Banerjee, Asim, 04, 07, 08, 12, 14, 16, 18, 28, 30, 34
Bhise, Minal, 13, 23, 27, 32, 33
Chakka, Vijaykumar, 07, 08, 12, 24, 27
Chatterji, Samaresh, 04, 05, 10, 11, 15, 16, 17, 23, 24, 25, 26, 28, 31, 32, 35, 36
Chaudhary, Sanjay, 02, 03, 05, 06, 07, 10, 11, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 27, 30, 33, 36
Das, Manik Lal, 02, 03, 04, 06, 13, 29, 33
Desai, Binita, 06, 13, 31, 35
Divakaran, Srikrishnan, 02, 07, 08, 19, 34
Dubey, Rahul, 08, 09, 10, 21, 25, 30, 34
Ghodgaonkar, Deepak, 03, 18, 30
Gupta, Manish K., 04
Gupta, Sanjeev, 01, 02
Jat, P .M., 01, 09, 23, 26, 28, 29
Joshi, Manjunath V., 19, 27
Majumder, Prasenjit, 11, 22, 28
Mathuria, Anish M., 01, 19, 20, 29, 31, 32, 34, 36
Mitra, Suman K., 22
Mulherkar, Jaideep, 09, 33
Muthu, Rahul, 02, 19, 25
Nagchoudhuri, Dipnkar, 18
Pandya, Abhinay, 12
Parikh, Chetan D., 32
Patil, Hemant, 10, 17, 29
Ranjan, Prabhat, 04, 12, 15, 17, 21
Raut, Manoj, 05
Raval, Mehul, 03, 10
Roy, Anil K., 02, 14, 36
Sethuraman, S., 11
Srivastava, Sanjay, 13, 19, 35
39
Supervisor Index
Banerjee, Asim, 04, 07, 08, 12, 14, 16, 18, 28, 30, 34
Bhise, Minal, 13, 23, 27, 32, 33
Chakka, Vijaykumar, 07, 08, 12, 24, 27
Chatterji, Samaresh, 04, 05, 10, 11, 15, 16, 17, 23, 24, 25, 26, 28, 31, 32, 35, 36
Chaudhary, Sanjay, 02, 03, 05, 06, 07, 10, 11, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 27, 30, 33, 36
Das, Manik Lal, 02, 03, 04, 06, 13, 29, 33
Desai, Binita, 06, 13, 31, 35
Divakaran, Srikrishnan, 02, 07, 08, 19, 34
Dubey, Rahul, 08, 09, 10, 21, 25, 30, 34
Ghodgaonkar, Deepak, 03, 18, 30
Gupta, Manish K., 04
Gupta, Sanjeev, 01, 02
Jat, P .M., 01, 09, 23, 26, 28, 29
Joshi, Manjunath V., 19, 27
Majumder, Prasenjit, 11, 22, 28
Mathuria, Anish M., 01, 19, 20, 29, 31, 32, 34, 36
Mitra, Suman K., 22
Mulherkar, Jaideep, 09, 33
Muthu, Rahul, 02, 19, 25
Nagchoudhuri, Dipnkar, 18
Pandya, Abhinay, 12
Parikh, Chetan D., 32
Patil, Hemant, 10, 17, 29
Ranjan, Prabhat, 04, 12, 15, 17, 21
Raut, Manoj, 05
Raval, Mehul, 03, 10
Roy, Anil K., 02, 14, 36
Sethuraman, S., 11
Srivastava, Sanjay, 13, 19, 35
39
Resource Centre
DA-IICT
Near Indroda Circle
Gandhinagar - 382007
Phone: 079-30510578
E-mail: rcservices@daiict.ac.in

Full Catalogue 2006 10

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Full Catalogue 2006 10

Hochgeladen von

Copyright:

Verfügbare Formate

Catalogue

Updated on: 08/10/2010 Resource Centre Team

2. Investor Facilitation Portal It Solution for Investors 1

3. Design and Simulation of a 2.4 GHz Low Noise Amplifier 1

4. Heuristic for Multiple Sequence Alignment 2

5. Acyclic Edge Coloring of Subquartic Graphs 2

By Karan Aggarwal and Anurag Sharma

6. Corporate Fed Microstrip Array: Theory and design 2

7. KnowledgeNet A Comprehensive System for Research Community and Industry Professionals 2

By Ankur Agrawal and Kapil Khandelwal

8. Multiband Multi-Fractal Antenna Analysis and Design 2

9. M V C Architecture, PHP Unit Testing and MDX 3

10. Flashing Tools 3

11. Analysis of a Certificate-less Key Agreement Scheme 3

12. Design of a Planar RFID Tag Antenna at Microwave Frequencies 3

By Ranajeet Anand and Sameer Dubey

13. Filtering False Data Injection in Wireless Sensor Networks 4

14. Basic Arithmetic Using DNA Self Assembly 4

By K. Avinash and Bhooma B. Reddy

16. Motion Segmentation Using Normalized Cuts 4

17. Application of Genetic Algorithm in Implementation of Technical Trading Rules in Stock 5

18. E-District - Bringing Govt. Services To The Doorstep of Citizen 5

By Shashank Bolia and Anshul Mehta

19. Developing and Profiling of Parallel Scilab Application Using OpenMP 5

By P. S. S. Chaitanya and Ramya Bolla

20. Storytelling based Vocabulary Learning on Cell Phones 6

21. Study of Static and Dynamic Code Analysis 6

By Vishal Singh Chauhan

22. Virtual Environments Navigable Over The www 6

By Akhil Chennuru and S.S. Prem Kumar

By Jatinder Singh Chhabra

24. Data Compression Algorithm 7

25. Saba Assessment Authoring Tool 7

By Nikhil Kr. Dalmia

27. Solving Data-intensive Problems Uusing Hadoop 7

By Anoop Kumar Dhanvijay

28. India Research Portal 8

By B. Divya, and M. Sai Sujith Kumar Reddy

31. Online Load Balancing Of Temporary Tasks On Unrelated Machines 8

By Sudhanshu Dwivedi and Anshul Goel

34. Implementation of USB 2.0 Transceiver Macrocell 9

By Sai Suneel Goda

35. Analysis of the Complexity of Multinet Pvt. Ltd. Network 10

By Shri Krishna Goyal

By Ankit Gupta and Somya Garg

39. Post Flood Estimation 11

By Anurag Gupta and Rohan Bhandari

40. Performance Analysis of Minimum Spanning Tree Algorithms 11

41. Pragmatic Financial Investment Analyzer 11

By Nakul Gupta and Anurag Nigam

By Anshul Jain and Mayank Singhai

47. French Tuesdays (iPhone APP. Development) 12

48. Zipher: A Context-Aware Game for Mobile Phones Over Bluetooth 13

By Ashwin Jain, Hari, C. and Saket Pandey

49. Network Infrastructure Management System & SLA Generation Tool 13

50. Remotely Accessible Virtual Drawing Board (rSpace) 13

By Rajesh Kumar Jain

54. Audio Video-Synchronization 14

By Sanika Joshi and Brijesh Chokhra

59. Dew Harvesting: Models and Analysis 15

60. DWT-based Digital Image Watermarking 16

By Venkata Siva Ramakrishnh Kolli

62. A Light-weight Rule Engine for Wireless Sensor Network 16