Java Project Titles With Abstracts

Firstman Software Solution
Java Projects
KNOWLEDGE AND DATA ENGINEERING / DATA MINING
Sno TITLE Year
1 Binrank: Scaling Dynamic Authority-Based Search Using Materialized Sub 2010

graphs
Combinatorial Approach for Preventing SQL Injection Attacks(Secure
2 Computing)
2009
3 Effective and Efficient Query Processing for Video Subsequence 2009

Identification
4 PBFMCSP: Prefix Based Fast Mining of Closed Sequential Patterns

2009
5 Study on Intelligent E-Shopping System Based on Data Mining

2009
6 Truth Discovery With Multiple Conflicting Information Providers On Web 2008
7 Protection Of Database Security Via Collaborative Inference Detection 2008
Online Index Recommendations for High-Dimensional Databases Using

8 Query Workloads
2008
An Efficient Clustering Scheme to Exploit Hierarchical Data in Network

9 Traffic sis
2008
Image Processing
1 Noise Reduction By Fuzzy Image Filtering(Fuzzy System) 2003

0
1 Application Of BPCS Steganography To Wavelet Compressed Video 2004
1
Mobile Computing
1 Energy Maps for Mobile Wireless Networks: Coherence Time versus

2009
2 Spreading Period
1 Intrusion Detection In Homogeneous & Heterogeneous Wireless Sensor
2008
3 Networks
14 Cryptographic Versus Trust-based Methods for MANET Routing Security 2008
1
Location Based Spatial Query Processing In Wireless Broadcast Environments 2008
5
1
Bandwidth Estimation For Ieee 802.11 Based Adhoc Network 2008
6
1
Benefit-Based Data Caching In Ad Hoc Networks 2008
7
1
Distributed Cache Updating For The Dynamic Source Routing Protocol 2006
8
1 An Acknowledgment-Based Approach For The Detection Of Routing 2007
9 Misbehavior In Mantes
2
Detection Of Misbehavior In MANATES 2007
0
NETWORKING
21 On Wireless Scheduling Algorithms For Minimizing The Queue-Overflow 2010

Probability
2 Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p 2009
2 Networks
2 Leveraging Identity-Based Cryptography For Node Id Assignment In 2009

3 Structured P2p Systems
2 2009
4 Measuring Capacity Bandwidth of Targeted Path Segments
2 2009
5 Capturing Router Congestion and Delay
2 minimizing file download time in stochastic peer-to-peer networks congested 2008

6 sensor networks
27 Geometric Approach To Improving Active Packet Loss Measurement 2008
BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc

28 2008
Networks
29 Designing Less-Structured P2P Systems for the Expected High Churn 2008
Performance Of A Speculative Transmission Scheme For Scheduling Latency

30 2008
Reduction
Modeling & Automated Containment Of Worms(Secure Computing With

31 2008
Networking)
Constructing Inter-Domain Packet Filters To Control IP Spoofing Based On

32 2008
BGP Updates
33 Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion 2008
34 Security In Large Mediator Protocols 2008
A Distributed Database Architecture For Global Roaming In Next-Generation

35 2004
Mobile Networks
36 A Novel Secure Communication Protocol For Ad Hoc Networks [SCP] 2008
SOFTWARE ENGINEERING
3 Using The Conceptual Cohesion Of Classes For Fault Prediction In Object 2008
7 Oriented Systems
PARALLEL AND DISTRIBUTED SYSTEMS
3 2009
8 Dynamic Search Algorithm In Unstructured Peer-To-Peer Networks
3 Distributed Algorithms For Constructing Approximate Minimum Spanning 2009

9 Trees In Wireless Sensor Networks
4 2009
0 Dynamic Routing With Security Considerations
4 2008
1 Quiver: Consistent Object Sharing For Edge Services
4 2008
2 DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
4 2008
3 Computation-Efficient Multicast Key Distribution
4 2007
4 An Adaptive Programming Model For Fault-Tolerant Distributed Computing
4 2007
5 Homogenous Network Control And Implementation
4 2005
6 A BGP Based Mechanism For Lowest Cost Routing
Advance Computing, Secure Computing, JOURNAL

AND CONFERENCE PAPERS
4 Enhancing Privacy And Authorization Control Scalability In The Grid Through 2009
7 Ontologies
4 2009
8 Combinatorial Approach For Preventing Sql Injection Attacks
4 Evaluating the Vulnerability of Network Traffic Using Joint Security and 2009
9 Routing Analysis
5 A Precise Termination Condition Of The Probalastic Packet Marking 2008

0 Algorithm
5 Hybrid Intrusion Detection With Weighted Signature Generation Over 2007

1 Anomalous Internet Episodes
5 Network Border Patrol: Preventing Congestion Collapse And Promoting 2004

2 Fairness In The Internet
Web Based Project
1 Broken Links Handler
2 DEFECT TRACKING TOOL / BUG Sluts
3 Fashion Studios
4 Smart City
5 College Message System
6 Scheduling And Dispatching Management System
7 Town Online Complaint System
8 Web Crawler
9 Software Resource Planning Tool
10 Spam Mailing Detection System
11 Student Project Allocation And Management With Online Testing
12 Adxpress
13 Boardwalk
14 Cotelligent
15 Ezeemerchant
16 Loan Amortizer
17 Transport Plus
18 CALTOOL - COMPUTER AIDED LEARNING TOOL
21 E-School
22 Organizational Internal Survey
23 Web Shop
24 Web Forum
25 E-Talk
27 Telecom Inventory Maintenance System
28 Project Automation System
29 Work Flow Management System
31 E-Banking
32 Bus Scheduling And Dispatching
34 Tutelage Imprinter
35 Easy Journey
36 Pharmacy Management System
Windows Based Project
1 Protocol Scrubbing
2. Structure Text Filling
3. An Agent Based Intrusion Detection
4. Hop By Hop
5. Optical Multicast Routing In Ad Hoc-Network
6. Image Rendering For A Grid Tech
7 Network Analyzer
8 Credit Card Approval System
9 Visual Cryptography
10 Digital Water Marking
11 JBrowser
12 Public Key Validation For Dns Security Extension
13 Web’s Eye
14. Web Extractor

15 Online Database Wizard
16. Visual Editor
17. Stegohider
18. Embedding Data Into Video File With Less Distortion Using Lsb Technique
19. Remote Network Monitoring And Control
20. Http Server
21. Implementation Of Idea Algorithm
22. Image Compression
23. Pretty Good Privacy
24. Car Sales System
25. Remote File Repository
26. Bank System
27. Audio Track Finder
28. Airways Reservation System
29 Location Aided Routing
30 Web Importer
31 Atm Simulator
32 High Speed Download Manager
33 Extreme Pc
34 Java Productivity Aids

1. QUIVER: CONSISTENT OBJECT SHARING FOR EDGE SERVICES
2. RATE & DELAY GUARANTEES PROVIDED BY CLOSE PACKET
SWITCHES WITH LOAD BALANCING
3. GEOMETRIC APPROACH TO IMPROVING ACTIVE PACKET LOSS
MEASUREMENT
4. A PRECISE TERMINATION CONDITION OF THE PROBALASTIC PACKET
MARKING ALGORITHM
5. INTRUSION DETECTION IN HOMOGENEOUS & HETEROGENEOUS

WIRELESS SENSOR NETWORKS
6. PERFORMANCE OF A SPECULATIVE TRANSMISSION SCHEME FOR
SCHEDULING LATENCY REDUCTION
7. TWO TECHNIQUES FOR FAST COMPUTATION OF CONSTRAINED
SHORTEST PATH
8. USING THE CONCEPTUAL COHESION OF CLASSES FOR FAULT
PREDICTION IN OBJECT ORIENTED SYSTEMS
9. TRUTH DISCOVERY WITH MULTIPLE CONFLICTING INFORMATION
PROVIDERS ON WEB
10. LOCATION BASED SPATIAL QUERY PROCESSING IN WIRELESS
BROADCAST ENVIRONMENTS
11. BANDWIDTH ESTIMATION FOR IEEE 802.11 BASED ADHOC NETWORK
12. MODELING & AUTOMATED CONTAINMENT OF WORMS
13. BENEFIT-BASED DATA CACHING IN AD HOC NETWORKS
14. CONSTRUCTING INTER-DOMAIN PACKET FILTERS TO CONTROL IP
SPOOFING BASED ON BGP UPDATES
15. ORTHOGONAL DATA EMBEDDING FOR BINARY IMAGES IN
MORPHOLOGICAL TRANSFORM DOMAIN- A HIGH-CAPACITY
APPROACH
16. PROTECTION OF DATABASE SECURITY VIA COLLABORATIVE
INFERENCE DETECTION
17. DUAL-LINK FAILURE RESILIENCY THROUGH BACKUP LINK MUTUAL
EXCLUSION
18. ACTIVE LEARNING METHODS FOR INTERACTIVE IMAGE RETRIEVAL
19. SECURITY IN LARGE MEDIATOR PROTOCOLS
20. A SIGNATURE BASED INDEXING METHOD FOR EFFICIENT CONTENT
BASED RETRIEVAL OF RELATIVE TEMPORAL PATTERNS
21. Structure and Texture Filling-In of Missing Image Blocks in Wireless
Transmission and Compression Applications
22. Retrieving Files Using Content Based Searching and presenting it in Carousel
view
23. XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks
24. Distributed cache updating for the Dynamic source routing protocol
25. An Adaptive Programming Model for Fault-Tolerant Distributed Computing
26. Face Recognition Using Laplacian faces
27. Predictive Job Scheduling in a Connection Limited System using Parallel Genetic
Algorithm
28. A Distributed Database Architecture for Global Roaming in Next-Generation
Mobile Networks
29. Noise Reduction by Fuzzy Image Filtering
30. A Novel Secure Communication Protocol for Ad Hoc networks [SCP]
31. Hybrid Intrusion Detection with Weighted Signature Generation over Anomalous
Internet Episodes(HIDS)
32. Network border patrol: preventing congestion collapse and promoting fairness in
the Internet
33. Application of BPCS steganography to wavelet compressed video
34. An Acknowledgment-Based Approach For The Detection Of Routing Misbehavior
In Mantes
35. Homogenous Network Control and Implementation
36. Neural Networks for Unicode Optical Character recognition
37. A BGP based mechanism for lowest cost routing
38. Training based numeric character reorganization using neural networks
39. An Algorithmic approach to identify network link failures
40. Detection of misbehavior in MANATES
General And Web Application Projects
41. Online handwritten script reorganization
42. An Optimized distributed rule mining algorithm
43. Protocol scrubbing
44. Structure text fillingc
45. An Agent based intrusion detection
46. Image Transport Protocol for the internet
47. Hop by Hop
48. Optical Multicast routing in Ad hoc-network
49. Image Rendering for a Grid Tech
50. Library Management System
51. Java Network File System
52. Network Analyzer
53. Credit card approval system
54. Fashion Studios
55. SNMP Simulator
56. Public key validation For DNS Security Extension
57. Web’s Eye
58. Web Extractor
59. Web Shop
60. Visual Editor
61. ETL
62. Telecom Inventory Maintenance System
63. TCP/IP Chat Server
64. Student Information System
65. Thief Detector
66. Graphical Web Server
67. FTP Server
68. Distance Learning System

69. Complete Mail System in JSP
70. Peer to peer Messaging System
71. Car Sales System
72. Bank System
74. Pseudo Random Number Generation Using Cellular Automata And Its Application
75. Airways Reservation System
76. Location Aided Routing
77. CryptoSystems
78. JExplorer
79. JDraw
80. Java Productivity Aids
81. FTP
82. E-mail system
83. Dynamic Signature Verification Using Pattern Recognition
84. Chatting
85. Pharmacy Management System
86. Web Based Image Transport Protocol
87. Apriory Algorithm Using Association Rule Mining
88. Broken Links Handler*
89. Bug Tracker
90. City Guide
91. College Message System
92. DBwand
93. Face Recognition Using Eigen faces
94. Implementation of IDEA Algorithm
96. Net conference
97. Online Examination*
98. Packet Monitoring System
99. Pretty Good Privacy
100. Scheduling and Dispatching Management System
101. Smart Payroll System
102. Stegohider
103.
EMBEDDING DATA INTO VIDEO FILE WITH LESS DISTORTION
USING LSB TECHNIQUE
104. Terminal Controller
105. Town online complaint system
106. Visual Cryptography
107. Voice Domain
108. Water Marking
109. Web Browser
110. Web Crawler
111. Web Enabled Automated Manufacturing System*
112. Web Importer

113. Work Flow Management System
114. Performance Evolution of RMI
115. Network Management Tool
116. Courier Information System*
117. ATM Simulator
118. High Speed Download Manager
119. SECURE COMMUNICATION USING IDEA
120. Integrating Speech Engine With Web Navigator
121. ATM Networks and Intelligent Packet Filtering
122. Voice Doc
123. Net Banking
124. Video Library
125. Distributed File Editor Project
126. Student Project Allocation and Management with Online Testing
127. Elliptic curve Cryptography
128. AdXpress
129. Boardwalk
130. Cotelligent
131. Ezeemerchant
132. Loan Amortizer
133. Transport Plus
134. E-School
135. Organizational internal survey
136. Web Forum
137. RSFS
138. E-talk
139. Project Automation System
140. Hotel Management System*
141. Extreme PC
142. Customer Flow Management*
143. Transportation System on IDS
144. Electronic Care
145. Web Traffic Analyzer*
146. Mega Mart Ad Release Management*
147. Cricket Game in java
148. E-Banking
149. Bus Scheduling and Dispatching
150. Vertical Search Engine
1. BINRANK: SCALING DYNAMIC

AUTHORITY-BASED
SEARCH USING MATERIALIZED SUB
GRAPHS
Abstract
Dynamic authority-based keyword search algorithms, such as
ObjectRank and personalized PageRank, leverage semantic link
information to provide high quality, high recall search in databases,
and the Web. Conceptually, these algorithms require a querytime
PageRank-style iterative computation over the full graph. This
computation is too expensive for large graphs and not feasible at
query time. Alternatively, building an index of precomputed results for
some or all keywords involves very expensive preprocessing. We
introduce BinRank, a system that approximates ObjectRank results by
utilizing a hybrid approach inspired by materialized views in traditional
query processing. We materialize a number of relatively small subsets
of the data graph in such a way that any keyword query can be
answered by running ObjectRank on only one of the subgraphs.
BinRank generates the subgraphs by partitioning all the terms in the
corpus based on their co-occurrence, executing ObjectRank for each
partition using the terms to generate a set of random walk starting
points, and keeping only those objects that receive non-negligible
scores. The intuition is that a subgraph that contains all objects and
links relevant to a set of related terms should have all the information
needed to rank objects with respect to one of these terms. We
demonstrate that BinRank can achieve subsecond query execution
time on the English Wikipedia data set, while producing high-quality
search results that closely approximate the results of ObjectRank on
the original graph. The Wikipedia link graph contains about 108 edges,
which is at least two orders of magnitude larger than what prior state
of the art dynamic authority-based search systems have been able to
demonstrate. Our experimental evaluation investigates the trade-off
between query execution time, quality of the results, and storage
requirements of BinRank.
Existing System:
• PageRank algorithm utilizes the Web graph link structure to
assign global importance to Web pages. It works by modeling the
behavior of a “random Web surfer” who starts at a random Web
page and follows outgoing links with uniform probability.
• The PageRank score is independent of a keyword query..
• Personalized PageRank (PPR) for Web graph data sets and

ObjectRank for graph-modeled databases results. Therefore, the
issue of scalability of PPR has attracted a lot of attention.
• ObjectRank extends (personalized) PageRank to perform
keyword search in databases. ObjectRank uses a query term
posting list as a set of random walk starting points and conducts
the walk on the instance graph of the database.
Proposed System:
• In this project, a BinRank system that employs a hybrid approach
where query time can be traded off for preprocessing time and
storage. BinRank closely approximates ObjectRank scores by
running the same ObjectRank algorithm on a small subgraph,
instead of the full data graph.
• BinRank query execution easily scales to large clusters by
distributing the subgraphs between the nodes of the cluster.
• We are proposing the BinRank algorithm for the trade time of
search. Our alogorithm solves the time consuming problem in
query execution. Time will be reduced because of cache storage
and redundant query handling method.
HARDWARE SPECIFICATION
Processor : Any Processor above 500 MHz.
Ram : 128Mb.
Hard Disk : 10 GB.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System : Windows Family.
Pages developed using : Java Server Pages and HTML.
Techniques : Apache Tomcat Web Server 5.0, JDK 1.5 or higher
Web Browser : Microsoft Internet Explorer.
Data Bases : SQlServer 2000
Client Side Scripting : Java Script
2. Combinatorial Approach for Preventing SQL Injection Attacks(Secure

Computing)
Abstract:
A combinatorial approach for protecting Web applications against SQL injection is discussed in this
paper, which is a novel idea of incorporating the uniqueness of Signature based method and auditing
method. The major issue of web application security is the SQL Injection, which can give the attackers
unrestricted access to the database that underlie Web applications.Many software systems have evolved to
include a Web-based component that makes them available to the public via the Internet and can expose
them to a variety of Web-based attacks. One of these attacks is SQL injection, which can give attackers
unrestricted access to the databases that underlie Web applications and has become increasingly frequent
and serious. This paper presents a new highly automated approach for protecting Web applications against
SQL injection that has both conceptual and practical advantages over most existing techniques. From a
conceptual standpoint, the approach is based on the novel idea of positive tainting and on the concept of
syntax-aware evaluation. From a practical standpoint, our technique is precise and efficient, has minimal
deployment requirements, and incurs a negligible performance overhead in most cases. We have
implemented our techniques in the Web Application SQL-injection Preventer (WASP) tool, which we used
to perform an empirical evaluation on a wide range of Web applications that we subjected to a large and
varied set of attacks and legitimate accesses. WASP was able to stop all of the otherwise successful attacks
and did not generate any false positives.
Ram : 128Mb.
Hard Disk : 10 GB.
3. Effective and Efficient Query Processing for Video

Subsequence Identification
Abstract
This paper presents a graph transformation and matching

approach to identify the occurrence of potentially different ordering or
length due to content editing. With a novel batch query algorithm to
retrieve similar frames, the mapping relationship between the query
and database video is first represented by a bipartite graph. The
densely matched parts along the long sequence are then extracted,
followed by a filter-and-refine search strategy to prune some irrelevant
subsequences. During the filtering stage, Maximum Size Matching is
deployed for each sub graph constructed by the query and candidate
subsequence to obtain a smaller set of candidates. During the
refinement stage, Sub-Maximum Similarity Matching is devised to
identify the subsequence with the highest aggregate score from all
candidates, according to a robust video similarity model that
incorporates visual content, temporal order, and frame alignment
information.
Existing System:
With the growing demand for visual information of rich content,
effective and efficient manipulations of large video databases are
increasingly desired. Many investigations have been made on content-
based video retrieval. However, despite the importance, video
subsequence identification, which is to find the similar content to a
short query clip from a long video sequence, has not been well
addressed.
It is often undesirable to manually check whether a video is part
of a long stream by browsing its entire length.
Proposed System:
Video subsequence identification involves locating the position of
the most similar part with respect to a user-specified query clip Q from
a long pre stored video sequence S. Ideally; it can identify relevant
video, even if there exists some transformation distortion, partial
content reordering, insertion, deletion, or replacement. Sub sequence
identification task aims at finding if there exists any subsequence of a
long database video that shares similar content to a query clip.
Modules:
1. Video Copy Detection
2. Video Similarity Search
Module Descriptions:
Video Copy Detection
Extensive research efforts have been made on extracting and
matching content-based signatures to detect copies of videos. In their
work, query sequence slides frame by frame on database video with a
fixed length window. Since the process of video transformation could
give rise to several distortions, techniques circumventing these
variations by globe signatures have been considered. They tend to
depict a video globally rather than focusing on its sequential details.
Some properties that are likely to be preserved even with these
variations (e.g., shot length information) were suggested to be
generated as compact signatures and string matching technique could
be used to report such a copy. However, this method is only applicable
for queries which consist of multiple shots.
Video Similarity Search
The methods mentioned above only have been designed to
detect videos of the same temporal order and length. To further search
videos with changes from query due to content editing, a number of
algorithms have been proposed to evaluate video similarity. To deal
with inserting in or cutting out partial content, here used dynamic
programming based on ordinal measure of re sampled frames at a
uniform sampling rate to find the best match for different length video
sequences.
We investigate sub sampled frame-based matching and take

average inter frame similarity into account as well as the factors of
temporal order, frame alignment, gap, and noise for accurate
identification. An efficient heuristic method is devised to aggregate the
scores of different factors for directly deriving the most similar
subsequence according to this overall video similarity measure,
without enumerating all combinations.
Software Requirements
 Microsoft Windows XP Professional
 JDK 6.0
 JMF 2.0.1
Hardware Requirements
 Pentium 4 processor
 1 GB RAM
 80 GB Hard Disk Space
4. PREFIX BASED FAST MINING OF CLOSED SEQUENTIAL PATTERNS

ABSTRACT
In recent years, mining of sequential patterns has been studied extensively in various
domains. Most of the existing algorithms find patterns in transactional databases. This
paper proposes a novel algorithm to mine closed sequential patterns using an inverted
matrix and prefix based sequence element matrix. Inverted matrix minimizes the search
space for discovering various sequential patterns of different items. We use a prefix based
sequence element matrix to minimize the scans required at levels k and k+1 in the mining
process. Our experimental results show the performance improvement of the new
algorithm over the previous work.
EXISTING SYSTEM
Frequent pattern mining in temporal domain, an emerging research trend is the
focus of this study. Existing frequent pattern mining algorithms in temporal domain
are all based on Apriori’s candidate generation logic and hence suffer from repeated
input scans setback. Prefix Span, a variant of FP-growth proposed for efficient
sequential pattern mining requires input to be in the form of transactions or records
and does not maintain temporal continuity across transactions. An algorithm on fast
mining of closed sequential patterns mines patterns on transactional records.
PROPOSED SYSTEM
INVERTED MATRIX
This paper uses an inverted matrix approach to associate each item with its sequence
segments those are subsequences of the sequence in which it occurs as a prefix and to
associate all items in each segment using pointers. Similar to the vertical approach in
the transactional database representation, the item is the key of each record in this
layout. The difference between this approach and the vertical approach is that each
attribute on the inverted matrix is not the transaction ID, but a pointer points to the
location of the next item on the same sequence segment. The construction of the
inverted matrix is assumed to be pre-processing of the mining process. The inverted
matrix that is made of two parts: the index and the sequence array.
The index contains the items and the sequence array is a set of rows in which each
row is associated with one item in the index part. Each row is made of pairs
representing pointers, where each pair holds two information: the physical address in
the index part of the next item in the same sequence segment, and the physical
address in the row of the next item in the same sequence segment. The entries of the
sequence segments with items are done as follows: the given sequence is read, the
location of the first item in the sequence is sought and an entry to its sequence array is
added that holds the location of the next item in this sequence. For the second time
the same process occurs, in which an entry in the inverted matrix of the second item
is added to hold the location of the third item in the sequence. Table 1 shows the
inverted matrix of the sample sequence ABCDBDACDBACBDCDABCD.
5: Study on intelligent e-shopping system based on data mining

ABSTRACT
E-commerce is a related concept of data mining technologies and the realization
process of data mining techniques are described. Combine data mining and guide features
of e-shopping site, study intelligent shopping guide system based on data mining. Use
data mining technology to guide customers to buy goods or to provide recommendations
in order to provide higher quality services. We take the specific case as study object, we
use data mining techniques to analyze and propose solutions.
The use of data mining provide users with intelligent guide and make users easy
in the range of goods which not only save user browsing net and considering time, but
also provide users with a good proposal to allow the user to get the appropriate selection
of goods, is a kind of high-quality services.
Existing System
Ecommerce can be achieved by a variety of electronic means of communication
such as phone or fax. But now people are exploring e-commerce based on EDI
(electronic data interchange) and the internet. Particularly as internet technology has
become more sophisticated, real development of ecommerce will be built on the
internet technology. So there were some people who take e-commerce as IC (internet
commerce).E-commerce refers to the network as the carrier, the use of digital
electronic means to carry out business activities. With the developing of internet
technology and the Web technology, various types of e-commerce sites are coming
out. It is not difficult to establish e-commerce sites, but to obtain economic and social
benefits. On the e-commerce web site, there may be millions of on-line transactions,
generating a large number of documents and records of the registration form every
day. Ecommerce companies are faced with a wealth of data, lack of knowledge of
embarrassment.
Problems in existing system:

• The time complexity is very large.
• There are no guidelines for user to buy appropriate things.
• The schemes are cost effective.
Proposed System
E-commerce has changed people's consumption style, there have been a variety of
online stores and Web sites devoted to business, consumers can also buy desirable
commodity in homes, but a growing number of similar sites, and also to choose more and
more, the face of online shopping, people often will fall into the plight of choice,
especially choice of gifts, it is more difficult to select one satisfaction and newer. In real
life, when I do not know how to choose, friends or other people as a guide, advise, but
not on the Internet. Are there any web site can provide a service as user's guide this
election?
Smart guide realization of the program: the gift network establish a specialized
section “help you to choose gift”, set up a number of multi-issue election, according to
prompt the user answer, such as human sex, love, what kind of gifts they had received,
and so on, these data will be connected to the database, using data mining to analyze the
data, be able to find what kind of gifts send more appropriately, and then return a result to
the user, help users make a decision. To achieve this function is to establish a model:
study relationship between all information and gifts user chosen.
Software requirements:
Operating System: Windows 2000/XP
Front end: Dot net
Documentation: MS - Word XP
Designing: Star UML
Backend: SQL
Hardware requirements:
CPU: Pentium IV
RAM: 512MB.
Hard Disk: 40GB.
Monitor: SVGA Color Monitor.
Keyboard: 108 Standards.
Mouse: Logitech scroll mouse.
6. TRUTH DISCOVERY WITH MULTIPLE CONFLICTING

INFORMATION PROVIDERS ON WEB
Abstract
The world-wide web has become the most important

information source for most of us. Unfortunately, there is no guarantee
for the correctness of information on the web. Moreover, different web
sites often provide conflicting in-formation on a subject, such as
different specifications for the same product. In this paper we propose
a new problem called Veracity that is conformity to truth, which
studies how to find true facts from a large amount of conflicting
information on many subjects that is provided by various web sites.
We design a general framework for the Veracity problem, and invent
an algorithm called Truth Finder, which utilizes the relationships

between web sites and their information, i.e., a web site is trustworthy
if it provides many pieces of true information, and a piece of
information is likely to be true if it is provided by many trustworthy
web sites. Our experiments show that Truth Finder successfully finds
true facts among conflicting information, and identifies trustworthy
web sites better than the popular search engines.
Existing System:
 Page Rank and Authority-Hub analysis is to utilize the hyperlinks to find

pages with high authorities.
 These two approaches identifying important web pages that users are
interested in, Unfortunately, the popularity of web pages does not
necessarily lead to accuracy of information
5.4.2. Proposed System:
 We formulate the Veracity problem about how to discover true facts from
conflicting information.
 Second, we propose a framework to solve this problem, by defining the

trustworthiness of websites, confidence of facts, and influences between
facts.
 Finally, we propose an algorithm called TRUTHFINDER for identifying

true facts using iterative methods.
5.4.3. Disadvantage:
 The popularity of web pages does not necessarily lead to accuracy of

information.
 Even the most popular website may contain many errors.
 Where as some comparatively not-so-popular websites may provide more
accurate information.
5.4.4. Advantage:
 Our experiments show that TRUTHFINDER achieves very high accuracy

in discovering true facts.
 It can select better trustworthy websites than authority-based search

engines such as Google.
6. System Requirements:
6.1. Hardware:
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 20 GB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
6.2. Software:
FRONT END : Java, J2ee (JSP)
TOOL USED : JFrameBuilder
OPERATING SYSTEM : Window’s Xp
BACK END : Sql Server 2000
16. PROTECTION OF DATABASE SECURITY VIA

COLLABORATIVE INFERENCE DETECTION
Abstract
Malicious users can exploit the correlation among data to infer

sensitive information from a series of seemingly innocuous data
accesses. Thus, we develop an inference violation detection system to
protect sensitive data content. Based on data dependency, database
schema and semantic knowledge.
we constructed a semantic inference model (SIM) that
represents the possible inference channels from any attribute to the
pre-assigned sensitive attributes. The SIM is then instantiated to a
semantic inference graph (SIG) for query-time inference violation
detection.
For a single user case, when a user poses a query, the
detection system will examine his/her past query log and calculate the
probability of inferring sensitive information. The query request will be
denied if the inference probability exceeds the pre specified threshold.
For multi-user cases, the users may share their query answers
to increase the inference probability. Therefore, we develop a model to
evaluate collaborative inference based on the query sequences of
collaborators and their task-sensitive collaboration levels.
Experimental studies reveal that information authoritativeness,
communication fidelity and honesty in collaboration are three key
factors that affect the level of achievable collaboration. An example is
given to illustrate the use of the proposed technique to prevent
multiple collaborative users from deriving sensitive information via

inference.
Existing System
 Multiple collaborative users from deriving sensitive information via inference.
 Experimental studies reveal that information authoritativeness, communication

fidelity, and honesty in collaboration are three key factors that affect the level of
achievable collaboration
Proposed System
 we develop a model for evaluating collaborative inference based on the query

sequences of collaborators and their task-sensitive collaboration levels.
 A mechanism that propagates update to the user history files to ensure that no
query is rejected based on the outdated information.
 To reduce the time in examining the entire history login computation inference.
System Requirements:
 Hardware:
 PROCESSOR : PENTIUM IV 2.6 GHz
 RAM : 512 MB DD RAM
 MONITOR : 15” COLOR
 HARD DISK : 20 GB
 CD-DRIVE : LG 52X
 KEYBOARD : STANDARD 102 KEYS
 MOUSE : 3 BUTTONS
 Software:
 FRONT END : JAVA(SWING)
 Back End : SQL Server
 OS : Window’s Xp SP2
 IDE : NetBeans 6.5, JFrameBuilder
Online Index Recommendations for

High-Dimensional Databases Using Query Workloads
Abstract:
Usually users are interested in querying data over a relatively

small subset of the entire attribute set at a time. A potential solution is
to use lower dimensional indexes that accurately represent the user
access patterns. If the query pattern change, then the query response
using the physical database design that is developed based on a static
snapshot of the query workload may significantly degrade. To address
these issues, we introduce a parameterizable technique to recommend
indexes based on index types that are frequently used for high-
dimensional data sets and to dynamically adjust indexes as the
underlying query workload changes. We incorporate a query pattern
change detection mechanism to determine when the access patterns
have changed enough to warrant change in the physical database
design. By adjusting analysis parameters, we trade off analysis speed
against analysis resolution.
Existing System:
 Query response does not perform well if query
patterns change.
 Because it uses static query workload.
 Its performance may degrade if the database size
gets increased.
 Tradition feature selection technique may offer less
or no data pruning capability given query attributes.
Proposed System:
 We develop a flexible index selection frame work to

achieve static index selection and dynamic index
selection for high dimensional data.
 A control feedback technique is introduced for

measuring the performance.
 Through this a database could benefit from an index

change.
 The index selection minimizes the cost of the queries in

the work load.
 Online index selection is designed in the motivation if

the query pattern changes over time.
 By monitoring the query workload and detecting when

there is a change on the query pattern, able to evolve
good performance as query patterns evolve
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 20 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
Software:
Front End : J2EE(JSP)
Back End : MS SQL 2000
Tools Used : JFrameBuilder
Operating System : WindowsXP
AN EFFICIENT CLUSTERING SCHEME TO EXPLOIT

HIERARCHICAL DATA IN NETWORK TRAFFIC
ANALYSIS
ABSTRACT
There is significant interest in the data mining and network management
communities about the need to improve existing techniques for clustering multivariate
network traffic flow records so that we can quickly infer underlying traffic patterns. In
this paper, we investigate the use of clustering techniques to identify interesting traffic
patterns from network traffic data in an efficient manner. We develop a framework to
deal with mixed type attributes including numerical, categorical, and hierarchical
attributes for a one-pass hierarchical clustering algorithm.
We demonstrate the improved accuracy and efficiency of our approach in
comparison to previous work on clustering network traffic.
EXISTING SYSTEM:
Categorization based Network monitoring (Auto Focus) techniques.
Traffic matrix: The aim of traffic matrix measurement is to estimate the volume of
traffic between origin and destination points in the network for capacity planning.
Traffic volume: The aim of traffic volume measurement is to determine the total
traffic sent or received in a network. Of particular interest is the problem of
measuring network usage of customers.
Traffic dynamics: The aim of monitoring traffic dynamics is to measure the temporal
variation in Internet traffic.
Traffic mixture: when traffic volume data is aggregated over time, it can reveal
important features of network usage for performance and security management.
Deficiency of an Existing System:

 It does not has Hierarchical Classification
 DOS Attacker cannot be Found
 No Intimation for any violation
PROPOSED SYSTEM:
• Hierarchical, distance-based clustering scheme (Echidna).
• To summarize the main types of traffic flows that are observed in a network.
• Introduction of a new distance measure for hierarchically structured attributes
such as IP addresses and a set of heuristics.
• Summarize and compress reports of significant traffic clusters from a hierarchical
clustering algorithm.
Proposed System Features :

 It has System based Hierarchical Classification
 Efficient Network Traffic Monitoring
 Infer of underlying patterns for multivariate traffic flows
 It Identify DOS Attack
SYSTEM REQUIREMENTS SPECIFICATION:
Hardware Requirements:
• Processor : Pentium IV 3.3 GHz.

• Hard Disk : 80 GB.
• Ram : 1 GB.
Software Requirements:
• Operating system : Windows XP Professional.

• Language Used : Java 1.6 (Swings ,AWT ,Sockets)
• Database : SQL Server 2000
Noise Reduction by Fuzzy Image Filtering
Abstract
A new fuzzy filter is presented for the noise reduction of

images corrupted with additive noise. The filter consists of two stages.
The first stage computes a fuzzy derivative for eight different
directions. The second stage uses these fuzzy derivatives to perform
fuzzy smoothing by weighting the contributions of neighboring pixel
values. Both stages are based on fuzzy rules which make use of
membership functions. The filter can be applied iteratively to
effectively reduce heavy noise. In particular, the shape of the
membership functions is adapted according to the remaining noise
level after each iteration, making use of the distribution of the
homogeneity in the image. A statistical model for the noise distribution
can be incorporated to relate the homogeneity to the adaptation
scheme of the membership functions. Experimental results are
obtained to show the feasibility of the proposed approach. These
results are also compared to other filters by numerical measures and
visual inspection.
Hardware specifications:
Processor : Intel Processor IV
RAM : 128 MB
Hard disk : 20 GB
CD drive : 40 x Samsung
Floppy drive : 1.44 MB
Monitor : 15’ Samtron color
Keyboard : 108 mercurykeyboard
Mouse : Logitech mouse
Software Specification
Operating System : Windows XP/2000
Language used : J2sdk1.4.0
33 Application of BPCS steganography to wavelet compressed

video
Abstract
This paper presents a steganography method using lossy

compressed video which provides a natural way to send a large
amount of secret data. The proposed method is based on wavelet
compression for video data and bit-plane complexity segmentation
(BPCS) steganography. In wavelet-based video compression methods
such as 3-D set partitioning in hierarchical trees (SPIHT) algorithm and
motion-JPEG2000, wavelet coefficients in discrete wavelet transformed
video are quantized into a bit-plane structure and therefore BPCS
steganography can be applied in the wavelet domain. 3-D SPIHT-BPCS
steganography and motion-JPEG2000-BPCS steganography are
presented and tested, which are the integration of 3-D SPIHT video
coding and BPCS steganography and that of motion-JPEG2000 and
BPCS, respectively. Experimental results show that 3-D SPIHT-BPCS is
superior to motion-JPEG2000-BPCS with regard to embedding
performance.
Hardware specifications:
Processor : Intel Processor IV
RAM : 128 MB
Hard disk : 20 GB
CD drive : 40 x Samsung
Floppy drive : 1.44 MB
Monitor : 15’ Samtron color
Keyboard : 108 mercurykeyboard
Mouse : Logitech mouse
Language used : J2sdk1.4.0
Energy Maps for Mobile Wireless Networks: Coherence Time

versus Spreading Period
ABSTRACT
We show that even though mobile networks are highly unpredictable when
viewed at the individual node scale, the end-to-end quality-of-service (QoS) metrics can
be stationary when the mobile network is viewed in the aggregate. We define the
coherence time as the maximum duration for which the end-to-end QoS metric remains
roughly constant, and the spreading period as the minimum duration required to spread
QoS information to all the nodes.
We show that if the coherence time is greater than the spreading period, the end-
to-end QoS metric can be tracked. We focus on the energy consumption as the end-to-end
QoS metric, and describe a novel method by which an energy map can be constructed and
refined in the joint memory of the mobile nodes.
Finally, we show how energy maps can be utilized by an application that aims to
minimize a node's total energy consumption over its near-future trajectory.
MODULES:
In this project we concentrated on main three modules these are
1. Node Module
2. Energy Calculation
3. Time Calculation
1. Node Module
Here we have taken totally five nodes called node A, Node B, Node C,
Node D from these nodes we can transfer data to destination node whish one is
six node after receiving the data in that node data will be displayed
2. Energy calculator
In this module we can calculate the energy values which is used by nodes to
receive the data this is the main important thing for our project which is going to
calculate the energy.
3. Time calculation
In this Module we are going to calculate time duration which is related to data
receiver
EXISTING SYSTEM:
In mobile networking previously if we want to transfer some information

from one place to fixed base station it will taking lot of energy. For this till now
we are using proactive and reactive routing. We can send limited information only
that to using a huge energy and one more important thing is still now we are not
using end-to-end metrics.
Deficiency of an Existing System:

 It does not Geographic routing protocols
 unaware of its implications for end-to-end QoS metrics
PROPOSED SYSTEM:
Application that aims to minimize a node’s total energy consumption over its
near-future trajectory. our aim is to transfer information from location to a fixed base
station BS with minimum energy through a mobile network in which the node buffers are
not congested. we focus on paths through space, and the nodes are taken to be
interchangeable, and we aim to associate a QoS metric with the physical path through
space. Our aim will be to minimize the total energy consumption.
SYSTEM REQUIREMENTS SPECIFICATION:
• Processor : Pentium IV 3.3 GHz.

• Ram : 1 GB.
• Operating system : Windows XP Professional.

• Language Used : Java 1.6 (Swings ,AWT ,Sockets)
Intrusion Detection in
Homogeneous and Heterogeneous
Wireless Sensor Networks
Abstract:
Intrusion detection in Wireless Sensor Network (WSN)

is of practical interest in many applications such as detecting an
intruder in a battlefield. The intrusion detection is defined as a
mechanism for a WSN to detect the existence of inappropriate,
incorrect, or anomalous moving attackers. In this paper, we consider
this issue according to heterogeneous WSN models. Furthermore, we
consider two sensing detection models: single-sensing detection and
multiple-sensing detection... Our simulation results show the
advantage of multiple sensor heterogeneous WSNs.
Existing System:
1 In single-sensing detection, At a time only one intruder detected
by the wsn.
2 Our Previous work was according to homogeneous and
heterogeneous single sensor in wireless sensor network
.
Proposed System:
1 In Heterogeneous wireless sensor ,Intruder detected anywhere in

the network.
2. We are detecting the intruder in multiple sensor heterogeneous
wireless sensor network.
Disadvantage:
1 The sensed information provided by a single sensor might

be inadequate for recognizing the intruder.
2 So that there is no guarantee for our information has been
sent securely.
3. Data will not routed if primary detector fails.
Advantage:
1 If primary detector fails another detector detect the intruder.

2 By finding the intruders we can send our information in a secured
manner.
Hardware:

RAM : 512 MB DD RAM
HARD DISK : 20 GB
CDDRIVE : LG 52X
MOUSE : 3 BUTTONS
Software:
FRONT END : Java

TOOL USED : JFrameBuilder
OPERATING SYSTEM : Window’s Xp
Cryptographic Versus Trust-based Method s for MANET

Routing Security
Abstract
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without
requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security
issues into account. Subsequent proposals used strong cryptographic methods to secure the
routing information. In the process, however, these protocols created new avenues for
denial of service (DoS). Consequently, the trade-off between security strength and DoS
vulnerability has emerged as an area requiring further investigation. It is believed that
different trust methods can be used to develop protocols at various levels in this trade-off.
To gain a handle on this exchange, real world testing that evaluates the cost of existing
proposals is necessary. Without this, future protocol design is mere speculation. In this
project, we give the first comparison of SAODV and TAODV, two MANET routing
protocols, which address routing security through cryptographic and trust-based means
respectively. We provide performance comparisons on actual resource-limited hardware.
EXISTING SYSTEM:
As more applications were developed to take advantage of the unique properties of ad-
hoc networks, it soon became obvious that security of routing information was an issue
not addressed in the existing protocols. Lundberg presents several potential problems
including node compromise, computational overload attacks energy consumption attacks,
and black hole attacks. Deng et al. further discuss energy consumption and black hole
attacks along with impersonation and routing information disclosure. Jakobsson et al.
categorize attacks as manipulation of routing information and exhaustive power
consumption, and provide detailed treatments of many characteristic attacks.
PROPOSED SYSTEM:
While research has focused on “lightweight” security mechanisms, some proposed

protocols use more expensive asymmetric cryptography. Zhou and Haas present a multi-
path protocol extension that uses threshold cryptography to implement the key
management system. It requires some nodes to function as servers and an authority to
initialize these servers. Zapata and Asokan propose SAODV a secure version of AODV,
which uses digital signatures and hash chains to secure the routing messages. Pissinou et
al. propose a trust-based version of AODV using static trust levels. The same authors
then extend this protocol to thwart multiple colluding nodes. Neither of these address
securing the trust exchanges, or the overhead involved. Li et al. introduce a trust-based
variant of AODV] that secures the trust information. However, their protocol requires an
intrusion detection system in the network. Finally, Meka et al. propose a third trusted
AODV with a simple method of evaluating trust even without source routing. Our work
in this paper considers the asymmetric cryptography and trust-based extensions to AODV
presented and shows a real world comparison of the performance of the two protocols.
Our results suggest that new protocols can be developed which take advantage of the best
features of both types of protocols, and which share aspects of each security model.
Hardware Interface
 Hard disk : 40 GB
 RAM : 512 MB
 Processor Speed : 3.00GHz
 Processor : Pentium IV Processor
 Lan set up for 4 systems (min)
Software Interface
 JDK 1.5
 Java Swing
Location-Based Spatial Query Processing in

Wireless Broadcast Environments
Abstract
Location-based spatial queries (LBSQ s) refer to spatial

queries whose answers rely on the location of the inquirer. Efficient
processing of LBSQ s is of critical importance with the ever-increasing
deployment and use of mobile technologies. We show that LBSQ s has
certain unique characteristics that the traditional spatial query
processing in centralized databases does not address. For example, a
significant challenge is presented by wireless broadcasting
environments, which have excellent scalability but often exhibit high-
latency database access. In this paper, we present a novel query
processing technique that, though maintaining high scalability and
accuracy, manages to reduce the latency considerably in answering

LBSQ s. Our approach is based on peer-to-peer sharing, which enables
us to process queries without delay at a mobile host by using query
results cached in its neighboring mobile peers. We demonstrate the
feasibility of our approach through a probabilistic analysis, and we
illustrate the appeal of our technique through extensive simulation
results.
Existing System
• Existing techniques cannot be used effectively in a wireless

broadcast environment, where only sequential data access
is supported.
• It may not scale to very large user populations.
• In an existing system to communicate with the server, a
client must most likely use a fee-based cellular-type
network to achieve a reasonable operating range.
• Third, users must reveal their current location and send it
to the server, which may be undesirable for privacy
reasons
Proposed System
• This System is a novel approach for reducing the spatial query

access latency by leveraging results from nearby peers in
wireless broadcast environments.
• Our scheme allows a mobile client to locally verify whether
candidate objects received from peers are indeed part of its
own spatial query result set.
• The method exhibits great scalability: the higher the mobile
peer density, the more the queries answered by peers.
• The query access latency can be decreased with the increase
in clients.
System Requirement Specification

Software Interface
• JDK 1.5
• Java Swing
• SQL Server
Hardware Interface
• PROCESSOR : PENTIUM IV 2.6 GHz

• RAM : 512 MB DD RAM
• MONITOR : 15” COLOR
• HARD DISK : 40 GB
• KEYBOARD : STANDARD 102 KEYS
• MOUSE : 3 BUTTON
Bandwidth Estimation for IEEE 802.11-Based

Ad Hoc Networks
Abstract:
Since 2005, IEEE 802.11-based networks have been able to provide a

certain level of quality of service (QoS) by the means of service
differentiation, due to the IEEE 802.11e amendment. However, no
mechanism or method has been standardized to accurately evaluate
the amount of resources remaining on a given channel. Such an
evaluation would, however, be a good asset for bandwidth-constrained
applications. In multihop ad hoc networks, such evaluation becomes
even more difficult. Consequently, despite the various contributions
around this research topic, the estimation of the available bandwidth
still represents one of the main issues in this field. In this paper, we
propose an improved mechanism to estimate the available bandwidth
in IEEE 802.11-based ad hoc networks. Through simulations, we
compare the accuracy of the estimation we propose to the estimation
performed by other state-of-the-art QoS protocols, BRuIT, AAC, and
QoS-AODV.
Existing System:
 The ad hoc networking community assumes that the underlying
wireless technology is the IEEE 802.11 standard due to the broad
availability of interface cards and simulation models.
 This standard has not been targeted especially for multihop ad

hoc operation, and it is therefore not perfectly suited to this type.
 An accurate evaluation of the capabilities of the routes is

necessary. Most of the current QoS proposals leave this problem
aside, relying on the assumption that the link layer protocols are
able to perform such an evaluation.
Proposed System:
 In this system they are using 802.11 MAC layer to evaluate the
correct bandwidth.
 This method combines channel monitoring to estimate each

node’s medium occupancy.
 Probabilistic combination of the values is to account for

synchronization between nodes, estimation of the collision
probability between each couple of nodes, and variable
overhead’s impact estimation.
 This mechanism only requires one-hop information

communication and may be applied without generating a too
high additional overhead.
 We show the accuracy of the available bandwidth measurement

through NS-2 simulations.
 These results show that single-hop flows and multihop flows are
admitted more accurately, resulting in a better stability and
overall performance.
System Requirements
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 20 GB
CDDRIVE : LG 52X
MOUSE : 3 BUTTONS
Software:
Front End : Java, Swing
Back End : MS Access
Benefit-Based Data Caching In Ad Hoc Networks
ABSTRACT
Data caching can significantly improve the efficiency of information
access in a wireless ad hoc twork by reducing theaccess latency and
bandwidth usage. wever, designing efficient distributed caching
algorithms is ontrivial when network nodeshave limited memory. In
this article, we consider the cache placement problem of nimizing total
data access cost in ad hoc networkswith multiple data items and nodes
with limited memory pacity. The above optimization problem is known
to be NP-hard. Definingbenefit as the reduction in total access cost, we
present a polynomial-time centralized approximation algorithm that
provably delivers asolution whose benefit is at least 1/4 (1/2 for
uniform-size data items) of the optimal benefit. The approximation
algorithm is amenableto localized distributed implementation, which is
shown via simulations to perform close to the approximation lgorithm.
Our distributedalgorithm naturally extends to networks with mobile
nodes. We simulate our distributed algorithm using a network
simulator (ns2) anddemonstrate that it significantly outperforms
another existing caching echnique (by Yin and Cao [33]) in all
important performancemetrics. The performance differential is
particularly large in more challenging scenarios such as higher access
frequency and smaller
4.2 Proposed System
Each node cache the items most frequently accessed by itself.
Eliminate replications among neighboring nodes Creation of stable
groups to gather neighborhood inform and determine caching
placements. Each node act as a server Server maintains nearest cache
node and Server nearest cache node by using routing protocol First
save data item on local space IF any other items are exist that will be
replace.
Operating System: windows 2000/NT
Development Kit: J2SE 5.0

RDBMS: MS Access
Hard Disk: 256 MB
Process: Pentium IV
Distributed Cache Updating for Dynamic Source Routing Protocol:

ABSTRACT
On-demand routing protocols (DSR), use route caches to make routing decisions. Due to
mobility, cached routes easily become stale. The goal of the project is to proactively
disseminating the broken link information to the nodes that have that link in their caches. It
defines a new cache structure called a cache table and presents a distributed cache algorithm.
Each node maintains in its cache table the information necessary for cache updates. When a link
failure is detected, the algorithm notifies all reachable nodes that have cached the link in a
distributed manner. It concludes that proactive cache updating is the key to the adaptation of on-
demand routing protocols to mobility.
ll
3 Hardware Requirements
Hard disk : 40 GB
RAM : 512 MB
Processor Speed : 3.00GHz
Processor : Pentium IV
3.4.4 Software Requirements
JDK 1.5
Java Swings
MS-Access
An Acknowledgment-Based Approach For The

Detection Of Routing Misbehavior In Mantes
Abstract
As attackers use automated methods to inflict widespread damage on vulnerable

systems connected to the network, it has become painfully clear that traditional manual
methods of protection do not suffice. This paper discusses an intrusion prevention
approach, intrusion detection, response based on active networks that helps to provide
rapid response to vulnerability advisories.
A intrusion detection and intrusion blocker that can provide interim protection
against a limited and changing set of high-likelihood or high-priority threats. It is
expected that this mechanism would be easily and adaptively configured and deployed to
keep pace with the ever-evolving threats on the network, intrusion detection and response
based on agent system, digital signature used to provide a security.
Active networks are an exciting development in networking services in which the

infrastructure provides customizable network services to
packets. The custom network services can be deployed by the user inside the packets
themselves. In this paper we propose the use of agent based intrusion detection and
response. Agents are integrated with the collaborative IDS in order to provide them with
a wider array of information to use their response activities.
Detection Of Misbehavior In MANATES
Abstract
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes
(hosts) which communicate with each other via wireless links either directly or relying on
other nodes as routers. The operation of MANETs does not depend on pre-existing
infrastructure or base stations. Network nodes in MANETs are free to move randomly.
Therefore, the network topology of a MANET may change rapidly and unpredictably. All
network activities, such as discovering the topology and delivering data packets, have to
be executed by the nodes themselves, either individually or collectively. Depending on its
application, the structure of a MANET may vary from a small, static network that is
highly power-constrained to a large-scale, mobile, highly dynamic network.
There are two types of MANETs: closed and open. In a closed

MANET, all mobile nodes cooperate with each other toward a common goal, such as
emergency search/rescue or military and law enforcement operations. In an open
MANET, different mobile nodes with different goals share their resources in order to
ensure global connectivity. However, some resources are consumed quickly as the nodes
participate in the network functions. For instance, battery power is considered to be most
important in a mobile environment. An individual mobile node may attempt to benefit
from other nodes, but refuse to share its own resources. Such nodes are called selfish or
misbehaving nodes, and their behavior is termed selfishness or misbehavior.
One of the major sources of energy consumption in mobile nodes of

MANETs is wireless transmission. A selfish node may refuse to forward data packets for
other nodes in order to conserve its own energy.
The 2ACK scheme is proposed to mitigate the adverse effects of

misbehaving nodes. The basic idea of the 2ACK scheme is that, when a node forwards a
data packet successfully over the next hop, the destination node of the next-hop link will
send back a special two-hop acknowledgment called 2ACK to indicate that the data
packet has been received successfully.
This 2ACK scheme is implemented as add-on technique on the DSR

protocol. The DSR protocol has two important modules. They are Route Discovery and
Route Maintenance.
Route Discovery is the mechanism by which a node S wishing to

send a packet to a destination node D obtains a source route to D. Route Discovery is
used only when S attempts to send a packet to D and does not already know a route to D.
Route Maintenance is the mechanism by which node S is able to

detect, while using a source route to D, if the network topology has changed such that it
can no longer use its route to D because a link along the route no longer works. When
Route Maintenance indicates a source route is broken, S can attempt to use any other
route it happens to know to D, or can invoke Route Discovery again to find a new route.
Route Maintenance is used only when S is actually sending packets to D.
SCOPE OF THE SYSTEM:

This project proposes the 2ACK scheme to mitigate the adverse
effects of misbehaving nodes. The basic idea of the 2ACK scheme is that, when a node
forwards a data packet successfully over the next hop, the destination node of the next-
hop link will send back a special two-hop acknowledgment called 2ACK to indicate that
the data packet has been received successfully. In this project, we present the details of
the 2ACK scheme and our evaluation of the 2ACKscheme as an add-on to the Dynamic
Source Routing (DSR) protocol.
3.1 EXISTING SYSTEM

In the Existing system routing misbehavior can severely degrade the
performance at the routing layer. Specifically, nodes may participate in the route
discovery and maintenance processes but refuse to forward data packets.
In the existing system various techniques have been proposed to

prevent selfishness in MANETs. These schemes can be broadly classified into two
categories: Credit-based schemes and Reputation-based schemes.
1) Credit-Based Schemes:
The basic idea of Credit-Based schemes is to provide incentives for

nodes to faithfully perform networking functions. In order to achieve this goal, virtual
(electronic) currency or similar payment system may be set up. Nodes get paid for
providing services to other nodes. When they request other nodes to help them for packet
forwarding, they use the same payment system to pay for such services
The main problem with credit-based schemes is that they usually

require some kind of tamper resistant hardware and/or extra protection for the virtual
currency or the payment system.
2) Reputation-Based Schemes:
The second category of techniques to combat node misbehavior in

MANETs is Reputation Based. In such schemes, network nodes collectively
detect and declare the misbehavior of a suspicious node. Such a declaration is
then propagated throughout the network, so that the misbehaving node will be cut
off from the rest of the network.
Due to its reliance on overhearing, however, the watchdog technique

may fail to detect misbehavior or raise false alarms in the presence of ambiguous
collisions, receiver collisions, and limited transmission power.
3.2 PROPOSED SYSTEM

The 2ACK scheme can be implemented as an add-on to existing
routing protocols for MANETs, such as DSR. The 2ACK scheme detects misbehavior
through the use of a new type of acknowledgment packet, termed 2ACK. A 2ACK packet
is assigned a fixed route of two hops (three nodes), in the opposite direction of the data
traffic route. The 2ACK scheme solves the problems of ambiguous collisions, receiver
collisions, and limited transmission power.
In this project, we propose the 2ACK scheme that serves as an add-

on technique for routing schemes to detect routing misbehavior and to mitigate their
adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment
packets in the opposite direction of the routing path.
In this project, we present the details of the 2ACK scheme and our
evaluation of the 2ACKscheme as an add-on to the Dynamic Source Routing (DSR)
protocol.
3.3 SYSTEM REQUREMENTS

3.3.1 SOFTWARE REQUIREMENTS
OS : Windows
Project Platform : Java
Software : JDK1.5
User Interface : Swings
HARDWARE REQUIREMENTS
Key Board : Standard Key Board with 101 Keys

Monitor : SVGA Color Monitor
Hard disk : 20 GB
RAM : 256 MB
ON WIRELESS SCHEDULING
ALGORITHMS FOR MINIMIZING THE
QUEUE-OVERFLOW PROBABILITY
AIM:
To Minimize the Queue-Overflow Probability in the wireless Network by using an

Scheduling algorithm alpha in the router side.
Synopsis:
The link scheduling algorithm mainly focuses on to reduce the queue overflow
rate over queue length. Let us consider a cellular network in which there are N users to
transmit the data through the router in that each user connects with a router to transmit that
makes the queue in the other end.
To overcome the queue the base station selects user based on the service
rate, after it reaches the threshold. The goal is to find algorithms for scheduling the
transmissions such that the queues are stabilized at given offered loads. An important result
along this direction is the development of the so-called “throughput-optimal” algorithms.
In our system we have approached the scheduling algorithm in the Online

Mobile Banking of the Mobile User.
Existing System:
The Constrained queuing system is used as a model of a radio networks,

the server correspond to the link and the constraints disallows simultaneous transmission. At
each time slot routing decision are taken for served customer and eligible set consider for
activation.
Proposed System:
In scheduling algorithms collectively referred to as the “alpha algorithms.” For a

given, the alpha algorithm picks the user for service at each time that has the largest product of the
transmission rate. This result enables us to design scheduling algorithms that are both close to optimal in
terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small
queue-overflow probabilities over queue-length ranges of practical interest.
• JDK 1.6
• My SQL 5.0
Node Isolation Model and Age-Based Neighbor

Selection in Unstructured P2P Networks
Abstract
R ESILIENCE of P2P networks under random user arrival and

departure (i.e., churn) has recently become an active research area [15]–[20], [22], [32].
One of the primary metrics of resilience is graph disconnection during which a P2P
network partitions into several nontrivial sub graphs and starts to offer limited service to
its users. However, as shown in [19], most partitioning events in well-connected P2P
networks are single-node isolations, which occur when the immediate neighbors of a
node fail before is able to detect their departure and then replace them with other alive
users. For such networks, node isolation analysis has become the primary method for
quantifying network resilience in the presence of user churn.
In fact, the second strategy based on random walks on

age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system
monotonically increases its resilience as its age and size grow. Specifically, we show
that the probability of isolation converges to zero as these two metrics tend to infinity.
We finish the paper with simulations in finite-size graphs that demonstrate the effect of
this result in practice.
RESILIENCE of P2P networks under random user arrival and departure

(i.e., churn) has recently become an active research. One of the primary metrics of
resilience is graph disconnection during which a P2P network partitions into several
nontrivial sub graphs and starts to offer limited service to its users. Most partitioning
events in well-connected P2P networks are single-node isolations, which occur when the
immediate neighbors of a node fail before is able to detect their departure and then
replace them with other alive users. For such networks, node isolation analysis has
become the primary method for quantifying network resilience in the presence of user
churn.
3. SYSTEM ANALYSIS
Existing System
 In existing system, unstructured p2p network consider only exponential (mean time
to failure) user lifetime and age-independent neighbor replacement.
 Unstructured P2P networks are single-node isolations, which occur when the
immediate neighbors of a node fail before a node is able to detect their departure
and then replace them with other alive users.
 Probability of user isolation is high in existing system and the users cannot
communicate with the isolated nodes.
 When node gets isolated from the network, the links between the nodes get failure.
So, graph gets disconnected.
 Newly joining node unable to detect the heavy-tailed user lifetime to avoid its
probability of isolation from the network.
Disadvantages
 Node isolated from network. So, communication problem occurs.

 Neighbor node unable to detect the failure previously.
 Graph Disconnection between the networks.
 Resilience of peer to peer networks under random user arrival and departure is
difficult.
 New node cannot be able to identify the heavy-tailed node in the network.
 Probability of user isolation and graph disconnection is high.
Proposed System
 In proposed system, we consider heavy-tailed user lifetime for improving residual

lifetime of chosen users and reducing probability of user isolation and graph
partitioning from network.
 Node isolation analysis has become the primary method for quantifying network
resilience in the presence of user churn.
 A joining node randomly selects alive users from the system and chooses the
user with the maximal age. Random walk algorithms have been used to build
unstructured P2P systems and replace failed links with new ones.
 Introduce a new-neighbor selection strategy that is based on random walks over

weighted directed graphs to identify the isolated node.
 Calculating the age for each node based on sum of weight of indegrees of a
node.
Advantages
 Reducing probability of user isolation.

 Avoids graph partitioning from network.
 Overcome Communication problem.
 Resilience of peer to peer networks for random user arrival and departure is
done.
 Probability of user isolation and graph disconnection is low.
Leveraging Identity – Based Cryptography for NODE ID

Assignment in structured P2P systems
Abstract:-
Structured peer-peer has grown rapidly because of their scalability, efficiency and
reliability . They provide high secured resilient media for the efficiency storage and
retrieval of file objects. Structured Peer to Peer Systems assign a unique key identifier to
every object and node ID’s associated with objects are mapped by P2P overlay protocols
to the node responsible for that objects. The assignment of node ID’s is therefore
critically important to the efficiency and security of the system Sybil attacks allow an
adversary to control large portions of P2P network by simultaneously obtaining many
identifiers. The solution to these problems largely rely on the use of trusted certificate
authorities and a structured public key infrastructure ( PKI ) to assign and certify node
ID’s . These schemas require maintenance of complex PKI systems .
Proposed System :-
We consider the use of identity based cryptography to assist in the security and\
performance critical assignment of user identities in p2p systems. Identity based
cryptosystems use textual strings to derive public keys from cryptographic parameters
advertised within a domain. This approach avoids many of the complexities of PKI usage
as a public key is directly derivable from their identity and reduces overheads and
associated with authentication. We exploit these features in p2p systems by assigning and
ID and providing the associated identity based private key to which joining mode. The
use of IBE systems leads to a trust model different than those differed by previous
centralized identity management approaches. In our proposed system identities are keys
are derived directly from the IP addresses of the participating entities. Users of the
system compute the public keys of their peers directly. We identify three protocols
representing diverse trust models and performance profiles based on identity based
cryptography.
Protocol 1:- a fully decentralized ID-based assignment scheme.
Protocol 2:- A centralized scheme in which a single host system plays

dual roles as ID assigning authority and P2P boot strap node.
Protocol 3:- An approach that retains the separation of duties of a

decentralized model at a low cost by using a hybrid of identity based
symmetric key cryptography.
Measuring Capacity Bandwidth of

Targeted
Path Segments
ABSTRACT:
Accurate measurement of network bandwidth is important for network
management applications as well as flexible Internet applications and
protocols which actively manage and dynamically adapt to changing
utilization of network resources.
Extensive work has focused on two approaches to measuring

bandwidth:
measuring it hop-by-hop, and measuring it end-to-end along a path.
Unfortunately, best-practice techniques for the former are inefficient and
techniques for the latter are only able to observe bottlenecks visible at end-
to-end scope. In this paper,
we develop end-to-end probing methods which can measure bottleneck
capacity bandwidth along arbitrary, targeted subpaths of a path in the
network, including subpaths shared by a set of flows.
We evaluate our technique through ns simulations, then provide a
comparative Internet performance evaluation against hop-by-hop and end-to-
end techniques. We also describe a number of applications which we foresee
as standing to benefit from solutions to this problem, ranging from network
troubleshooting and capacity provisioning to optimizing the layout of
application-level overlay networks, to optimized replica placement.
ALGORITHM / TECHNIQUE USED:
ALGORITHM DESCRIPTION:
EXISTING SYSTEM:
PROPOSED SYSTEM:
Measurement of network bandwidth is important for many Internet
applications and protocols, especially those involving the transfer of large
files and those involving the delivery of content with real-time QoS
constraints, such as streaming media. Some specific examples of
applications which can leverage accurate bandwidth estimation include end-
system multicast and overlay network configuration protocols content
location and delivery in peer-to-peer (P2P) networks network-aware cache
or replica placement policies and flow scheduling and admission control
policies at massively-accessed content servers .In addition, accurate
measurements of network bandwidth are useful to network operators
concerned with problems such as capacity provisioning, traffic engineering,
network troubleshooting and verification of service level agreements
(SLAs).
SYSTEM SPECIFICATION:
HARDWARE REQUIREMENT:
 System : Pentium IV 2.4 GHz.
 Hard Disk : 40 GB.

 Ram : 256 Mb.
 Floppy Drive : 1.44 Mb.
 Monitor : 15 VGA Colour.
 Mouse : Logitech.
SOFTWARE REQUIREMENT:
 Operating system : Windows XP Professional.
 Coding Language : Java.
 Tool Used : Eclipse.
CAPTURING ROUTER CONGESTION AND DELAY

Abstract:
Using a unique monitoring experiment, we capture all packets crossing a (lightly
utilized) operational access router from a Tier-1 provider, and use them to provide a
detailed examination of router congestion and packet delays. The complete capture
enables not just statistics as seen from outside the router, but also an accurate physical
router model to be identified. This enables a comprehensive examination of congestion
and delay from three points of view: the understanding of origins, measurement, and
reporting.Our study defines new methodologies and metrics. In particular,the traffic
reporting enables a rich description of the diversity of micro congestion behavior, without
model assumptions, and at achievable computational cost.
Existing System:
END-TO-END packet delay is one of the canonical metricsin Internet Protocol (IP)
networks, and is important bothfrom the network operator and application performance
pointsof view. For example the quality of Voice Over IP is directlydependent on delay,
and network providers may have ServiceLevel Agreements (SLAs) specifying allowable
values of delaystatistics across the domains they control. An important componentof end-
to-end delay is that due to forwarding elements, thefundamental building block of which
is the delay incurred whena packet passes through a single IP router.
Proposed System:
The motivation for the present work is a detailed knowledge and understanding of
such “through-router” delays. A thorough examination of delay leads inevitably to deeper
questions about congestion, and router queueing dynamics in general. We provide a
comprehensive examination of these issues from three points of view: the understanding
of origins, measurement, and reporting, all grounded in a unique data set taken from a
router in the access network of a Tier-1 provider.
The first aim of this paper is a simple one, to exploit this unique data set by
reporting in detail on the magnitudes, and also the temporal structure, of delays on high
capacity links with nontrivial congestion. The result is one of the most comprehensive
pictures of router delay performance that we are aware of. As our analysis is based on
empirical results, it is not reliant on
assumptions on traffic statistics or router operations. Our second aim is to use the
completeness of the data as a tool to investigate how packet delays occur inside the
router. In other words, we aim to provide a physical model capable of explaining the
observed delay and congestion. Working in the
context of the popular store and forward router architecture [5], we are able to justify the
commonly held assumption that the bottleneck of such an architecture is in the output
buffers, and thereby validate the fluid output queue model relied on routinely in the field
of active probing. We go further to define a refined model with an accuracy close to the
limits of timestamping precision, which is robust to many details of the architecture under
reasonable loads.
Packet delays and congestion are fundamentally linked, as the former occur precisely
because periods of temporary resource starvation, or micro congestion episodes, are dealt
with via buffering. Our third contribution is an investigation of the origins of such
episodes, driven by the question, “What is the dominant mechanism responsible for
delays?”. We use a powerful methodology of virtual or “semi-” experiments, that exploits
both the availability of the detailed packet data, and the fidelity of the router model. We
identify, and evaluate the contributions of, three known canonical mechanisms: i)
reduction in link bandwidth from core to access; ii) multiplexing of multiple input
streams; iii) burstiness of the input traffic stream(s).
Modules
 CLIENT
 SERVER
Modules description:
SERVER: Server is main module in this project, server receive the data sent by client &
calculate the congestion parameters for the client like delay, bandwidth, busy & status of
client.
CLIENT: Client sends the data to server & if client is free at server, data is successfully
sent .Otherwise the data is in queue until previous data is send.
• System : Pentium IV 2.4 GHz.
• Ram : 256 Mb.
• Operating system : - Windows XP Professional.

• Coding Language : - Java.
• Tool Used : - Eclipse.
Minimizing File Download Time in Stochastic Peer-to-Peer

Networks
ABSTRACT
The peer to peer(p2p) file-sharing application are becoming increasingly popular and
account for more than 70% of the Internet’s bandwidth usage.Measurement studies
show several hour s depending on the level of network congestion or the capacity
fluctation.We consider two major factors that have significant impact on average
download time,namely spatial service capability in different source peer.
EXISTING SYSTEM:
CLIENT - SERVER FILE SHARING
Content distribution is a centralized one, where the content is distributed from the
centralized server to all clients requesting the document.
Clients send request to the centralized server for downloading the file. Server accepts the
request and sends the file as response to the request.In most client-server setups, the
server is a dedicated computer whose entire purpose is to distribute files.
DRAWBACKS OF EXISTING SYSTEM
 Scalability problem arises when multi requests arises at a single time.
 Servers need heavy processing power
 Downloading takes hours when clients increases
 Requires heavy storage in case of multimedia content
PROPOSED SYSTEM:
 Peer-to-peer content distribution provides more resilience and higher availability

through wide-scale replication of content at large numbers of peers.
 A P2P content distribution community is a collection of intermittently-connected

nodes with each node contributing storage, content and bandwidth to the rest of
the community
 The peer-to-peer file sharing networks had a centralized server system. This
system controls traffic amongst the users.
HARDWARE SPECIFICATION:
Processor : Pentium-IV
Speed : 1.1GHz
RAM : 512MB
Hard Disk : 40GB
General : KeyBoard, Monitor , Mouse
SOFTWARE SPECIFICATION:
Operating System : Windows XP

Software : JAVA ( JDK 1.5.0)
Protocol : UDP
A Geometric Approach to
Improving Active
Packet Loss Measurement
Abstract
Measurement and estimation of packet loss characteristics are

challenging due to the relatively rare occurrence and typically short duration
of packet loss episodes. While active probe tools are commonly used to
measure packet loss on end-to-end paths, there has been little analysis of the
accuracy of these tools. The objective of our study is to understand how to
measure packet loss episodes accurately with end-to-end probes. Studies
show that the standard Poisson-modulated end-to-end measurement of
packet loss accuracy has to be improved. Thus, we introduce a new
algorithm for packet loss measurement that is designed to overcome the
deficiencies in standard Poisson-based tools. Specifically, our method entails
probe experiments that follow a geometric distribution to enable more
accurate measurements than standard Poisson probing and other traditional
packet loss measurement tools. We also find the transfer rate. We evaluate
the capabilities of our methodology experimentally by developing and
implementing a prototype tool, called BADABING. BADABING reports
loss characteristics are far more accurately than traditional loss measurement
tools.
Existing System:
• In the Existing traditional packet loss measurement

tools, the accuracy of the packet loss measurement has
to be improved.
• Several studies include the use of loss measurements

to estimate packet loss, such as Poisson modulated
tools which can be quite inaccurate.
Proposed System:
• The purpose of our study is to understand how to

measure end-to-end packet loss characteristics
accurately.
• The goal of our study is to understand how to

accurately measure loss characteristics on end-to-end
paths with probes.
• Specifically, our method entails probe experiments that

follow a geometric approach to improve the accuracy of
the packet loss measurement.
System Requirements
Hardware:
RAM : 512 MB
MONITOR : 15”
HARD DISK : 20 GB
CDDRIVE : 52X
Software:
FRONT END : JAVA, SWING
TOOLS USED : JFRAME BUILDER
OPERATING SYSTEM: WINDOWS XP
A Bidirectional Routing Abstraction for Asymmetric Mobile Ad

Hoc Networks
ABSTRACT
Wireless links are often asymmetric due to heterogeneity in the transmission
power of devices, non-uniform environmental noise, and other signal propagation
phenomenon’s. Unfortunately, routing protocols for mobile ad hoc networks typically
work well only in bidirectional networks. This paper first presents a simulation study
quantifying the impact of asymmetric links on network connectivity and routing
performance. It then presents a framework called BRA that provides a bidirectional
abstraction of the asymmetric network to routing protocols. BRA works by maintaining
multi-hop reverse routes for unidirectional links and provides three new abilities:
improved connectivity by taking advantage of the unidirectional links, reverse route
forwarding of control packets to enable off-the-shelf routing protocols, and detection
packet loss on unidirectional links. Extensive simulations of AODV layered on BRA
show that packet delivery increases substantially (two-fold in some instances) in
asymmetric networks compared to regular AODV, which only routes on bidirectional
links.
Description of Problem
The similar system is already available are non-predictive and employs greedy
based algorithms or a variant of it. That is the existing system will not predict in advance
regarding the situation. So we cannot schedule the jobs in network in such a way that the
resources are utilized at the optimal level. The problem is to reduce the processing
overhead during scheduling. The proposed system work to data transfer between
computers of two networks. Generally, during data transfer between pc of two different
networks.
Existing Method
The Data mining Algorithms can be categorized into the following:
 AODVAlgorithm
 Classification
 Clustering Algorithm
Classification:
The process of dividing a dataset into mutually exclusive groups such that the
members of each group are as "close" as possible to one another, and different groups are
as "far" as possible from one another, where distance is measured with respect to specific
variable(s) you are trying to predict. For example, a typical classification problem is to
divide a database of companies into groups that are as homogeneous as possible with
respect to a creditworthiness variable with values "Good" and "Bad."
Clustering:
The process of dividing a dataset into mutually exclusive groups such that the
members of each group are as "close" as possible to one another, and different groups are
as "far" as possible from one another, where distance is measured with respect to all
available variables.
Given databases of sufficient size and quality, data mining technology can generate new
business opportunities by providing these capabilities:
• Automated prediction of trends and behaviors. Data mining automates the

process of finding predictive information in large databases. Questions that
traditionally required extensive hands-on analysis can now be answered directly
from the data — quickly. A typical example of a predictive problem is targeted
marketing. Data mining uses data on past promotional mailings to identify the
targets most likely to maximize return on investment in future mailings. Other
predictive problems include forecasting bankruptcy and other forms of default,
and identifying segments of a population likely to respond similarly to given
events.
• Automated discovery of previously unknown patterns. Data mining tools

sweep through databases and identify previously hidden patterns in one step. An
example of pattern discovery is the analysis of retail sales data to identify
seemingly unrelated products that are often purchased together. Other pattern
discovery problems include detecting fraudulent credit card transactions and
identifying anomalous data that could represent data entry keying errors.
Proposed System
Job scheduling is the key feature of any computing environment and the
efficiency of computing depends largely on the scheduling technique used. Popular
algorithm called Bi-Directional Routing concept is used in the systems across the
network and scheduling the job according to predicting the load.
Here the system will take care of the scheduling of data packets between the source
and destination computers.
• Job scheduling to route the packets at all the ports in the router
• Maintaining queue of data packets and scheduling algorithm is implemented
• First Come First Serve scheduling and Bi-Directional Routing Algorithm
scheduling is called for source and destination Comparison of two algorithm is
shown in this proposed system
SYSTEM REQUIREMENTS:
Hardware:
PROCESSOR : Dual Core

RAM : 1 GB
HARD DISK : 160 GB
Software:
FRONT END : Java

OPERATING SYSTEM : Window’s XP
Designing Less-Structured P2P Systems

For the Expected High Churn
ABSTRACT:
We address the problem of highly transient populations in unstructured and

loosely structured peer-to-peer (P2P) systems. We propose a number of illustrative query-
related strategies and organizational protocols that, by taking into consideration the
expected session times of peers (their lifespan), yield systems with performance
characteristics more resilient to the natural instability of their environments. We first
demonstrate the benefits of lifespan-based organizational protocols in terms of end-
application performance and in the context of dynamic and heterogeneous Internet
environments. We do this using a number of currently adopted and proposed query-
related strategies, including methods for query distribution, caching, and replication. We
then show, through trace-driven simulation and wide-area experimentation, the

performance advantages of lifespan-based, query-related strategies when layered over
currently employed and lifespan-based organizational protocols. While merely
illustrative, the evaluated strategies and protocols clearly demonstrate the advantages of
considering peers’ session time in designing widely-deployed P2P systems.
EXISTING SYSTEM:
• Query strategy is flooding, where a query is propagated to all
neighbors within a certain radius.
• It provides scalability problem
PROPOSED SYSTEM:
• Lifespan-based strategies for query distribution, caching, and replication.
• The problem of highly transient populations in unstructured and loosely
structured P2P systems can be rectified.
• We present trace-driven simulation and wide-area experiment results that
illustrate the performance advantages of considering peers’ estimated
session time as a key system attribute in the design of Churn-resilient P2P
systems
SYSTEM REQUIREMENTS
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 80 GB
Software:
Back End : MS SQL 2000
Performance of a Speculative Transmission

Scheme for Scheduling-Latency Reduction
Abstract:
This work was motivated by the need to achieve low latency in

an input-queued centrally-scheduled cell switch for high-performance
computing applications; specifically, the aim is to reduce the latency
incurred between a request and response arrival of the corresponding

grant. The minimum latency in switches with centralized scheduling
comprises two components, namely, the control-path latency and the
data-path latency, which in a practical high-capacity, distributed switch
implementation can be far greater than the cell duration. We introduce
a speculative transmission scheme to significantly reduce the average
control-path latency by allowing cells to proceed without waiting for a
grant, under certain conditions. It operates in conjunction with any
centralized matching algorithm to achieve a high maximum utilization.
Using this model, performance measures such as the mean delay and
the rate of successful speculative transmissions are derived. The results
demonstrate that the latency can be almost entirely eliminated between
request and response for loads up to 50%. Our simulations confirm the
analytical results.
Existing System:
• Brikoff-von-newmann Switch which is eliminate the scheduler. It

incurs a worst-case latency penalty of N time slots. It has to wait
for exactly N time slots for the next opportunity.
• Control and data path-latencies comprise serialization and de-
serialization delays, propagation delay, processing delay
between request and response.
Proposed System:
• We propose a novel method to combine speculative and

scheduled transmission in a cross bar switch.
• Speculative modes of operation reduced latency at low
utilization.
• Scheduled modes of operation achieve high maximum
throughput.
Advantage:
• The speculative transmission that does not have to wait for grant
hence low latency.
• The scheduled transmission achieve high maximum throughput.
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 20 GB
CDDRIVE : LG 52X
MOUSE : 3 BUTTONS
Software:
Operating System : Window’s XP
Back End : SQL Server 2000
Modeling and Automated

Containment of Worms
Abstract
Self-propagating codes, called worms, such as Code Red, Nimda,

and Slammer, have drawn significant attention due to their enormously
adverse impact on the Internet. Thus, there is great interest in the research
community in modeling the spread of worms and in providing adequate
defense mechanisms against them. In this paper, we present a (stochastic)
branching process model for characterizing the propagation of Internet
worms. The model is developed for uniform scanning worms and then
extended to preference scanning worms. This model leads to the
development of an automatic worm containment strategy that prevents the
spread of a worm beyond its early stage. Specifically, for uniform scanning
worms, we are able to determine whether the worm spread will eventually
stop. We then extend our results to contain uniform scanning worms. Our
automatic worm containment schemes effectively contain both uniform
scanning worms and local preference scanning worms, and it is validated
through simulations and real trace data to be non intrusive.
Existing System:
• In previous simulation model uses a combination of the deterministic

epidemic model and a general stochastic epidemic model to model the
effect of large-scale worm attacks.
• In an Existing system the complexity of the general

stochastic epidemic model makes it difficult to derive
insightful results that could be used to contain the
worm.
• In a previous study it is used to detect the presence of
a worm by detecting the trend, not the rate, of the
observed illegitimate scan traffic.
• The filter is used to separate worm traffic from
background non worm scan traffic.
Proposed System:
• This model leads to the development of an automatic worm

containment strategy that prevents the spread of a worm beyond its
early stage.
• We obtain the probability that the total number of hosts that the worm
infects is below a certain level.
• Our strategy can effectively contain both fast scan worms and slow
scan worms without knowing the worm signature in advance or
needing to explicitly detect the worm.
• Our automatic worm containment schemes effectively contain the
worms and stop its spreading.
System Requirements
Hardware:
RAM : 512 MB
MONITOR : 15”
HARD DISK : 20 GB
CDDRIVE : 52X
MOUSE : 3 BUTTONS
Software:
FRONT END : JAVA, SWING

TOOLS USED : JFRAME BUILDER
OPERATING SYSTEM: WINDOWS XP
Constructing Inter-Domain Packet Filters to Control IP

Spoofing Based on BGP Updates
Abstract
The Distributed Denial-of-Service (DDoS) attack is a serious threat to the legitimate

use of the Internet. Prevention mechanisms are thwarted by the ability of attackers to
forge or spoof the source addresses in IP packets. By employing IP spoofing, attackers
can evade detection and put a substantial burden on the destination network for policing
attack packets. In this paper, we propose an inter-domain packet filter (IDPF) architecture
that can mitigate the level of IP spoofing on the Internet. A key feature of our scheme is
that it does not require global routing information. IDPFs are constructed from the
information implicit in Border Gateway Protocol (BGP) route updates and are deployed
in network border routers. We establish the conditions under which the IDPF framework
correctly works in that it does not discard packets with valid source addresses. Based on
extensive simulation studies, we show that, even with partial deployment on the Internet,
IDPFs can proactively limit the spoofing capability of attackers. In addition, they can
help localize the origin of an attack packet to a small number of candidate networks.
Existing System:
• Existing system uses Network Ingress Filtering.

• Ingress filtering primarily prevents a specific network from being used for
attacking others.
Proposed System:
• In our project we propose and study IDPF architecture as an effective

countermeasure to the IP spoofing-based DDoS attacks. IDPFs rely on BGP
update messages exchanged on the Internet to infer the validity of source address
of a packet forwarded by a neighbor.
System Requirements

• RAM :512 MB DD RAM
• MONITOR :15” COLOR
• HARD DISK :20 GB
• FLOPPY DRIVE :1.44 MB
• CDDRIVE :LG 52X
• KEYBOARD :STANDARD 102 KEYS
• FRONT END : Java swing and Networking

• OPERATING SYSTEM : Window’s XP
• BACK END :Ms Access
Constructing Inter-Domain Packet Filters to Control IP

Spoofing Based on BGP Updates
Abstract
The Distributed Denial-of-Service (DDoS) attack is a serious threat to the legitimate

use of the Internet. Prevention mechanisms are thwarted by the ability of attackers to
forge or spoof the source addresses in IP packets. By employing IP spoofing, attackers
can evade detection and put a substantial burden on the destination network for policing
attack packets. In this paper, we propose an inter-domain packet filter (IDPF) architecture
that can mitigate the level of IP spoofing on the Internet. A key feature of our scheme is
that it does not require global routing information. IDPFs are constructed from the
information implicit in Border Gateway Protocol (BGP) route updates and are deployed
in network border routers. We establish the conditions under which the IDPF framework
correctly works in that it does not discard packets with valid source addresses. Based on
extensive simulation studies, we show that, even with partial deployment on the Internet,
IDPFs can proactively limit the spoofing capability of attackers. In addition, they can
help localize the origin of an attack packet to a small number of candidate networks.
Existing System:
• Existing system uses Network Ingress Filtering.

• Ingress filtering primarily prevents a specific network from being used for
attacking others.
Proposed System:
• In our project we propose and study IDPF architecture as an effective

countermeasure to the IP spoofing-based DDoS attacks. IDPFs rely on BGP
update messages exchanged on the Internet to infer the validity of source address
of a packet forwarded by a neighbor.
System Requirements

• RAM :512 MB DD RAM
• MONITOR :15” COLOR
• HARD DISK :20 GB
• FLOPPY DRIVE :1.44 MB
• CDDRIVE :LG 52X
• KEYBOARD :STANDARD 102 KEYS
• FRONT END : Java swing and Networking

• OPERATING SYSTEM : Window’s XP
• BACK END :Ms Access
Dual-Link Failure Resiliency through Backup Link

Mutual Exclusion
Abstract:
Networks employ link protection to achieve fast recovery from link failures.
While the first link failure can be protected using link protection, there are several
alternatives for protecting against the second failure. This paper formally classifies the
approaches to dual-link failure resiliency.
One of the strategies to recover from dual-link failures is to employ link

protection for the two failed links independently, which requires that two links may not
use each other in their backup paths if they may fail simultaneously. Such a requirement
is referred to as backup link mutual exclusion (BLME) constraint and the problem of
identifying a backup path for every link that satisfies the above requirement is referred to
as the BLME problem.
This paper develops the necessary theory to establish the sufficient conditions for
existence of a solution to the BLME problem. Solution methodologies for the BLME
problem is developed using two approaches by: 1) formulating the backup path selection
as an integer linear program; 2)developing a polynomial time heuristic based on
minimum cost path routing.
The ILP formulation and heuristic are applied to six networks and their
performance is compared with approaches that assume precise knowledge of dual-link
failure. It is observed that a solution exists for all of the six networks considered. The
heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link
failures, although the backup path lengths may be significantly higher than optimal.
In addition, the paper illustrates the significance of the knowledge of failure

location by illustrating that network with higher connectivity may require lesser capacity
than one with a lower connectivity to recover from dual-link failures.
Software:
 FRONT END : JAVA(SWING)
 OS : Window’s Xp SP2
 IDE : NetBeans 6.5, JFrameBuilder
Hardware:
 PROCESSOR : PENTIUM IV 2.6 GHz
 RAM : 512 MB DD RAM
 MONITOR : 15” COLOR
 HARD DISK : 20 GB
 CD-DRIVE : LG 52X
 KEYBOARD : STANDARD 102 KEYS
 MOUSE : 3 BUTTONS
Security in large Networks Using Mediator

Protocols
Abstract:
The combination of 3AQKDP (implicit) and 3AQKDPMA (explicit)
quantum cryptography is used to provide authenticated secure communication
between sender and receiver.
In quantum cryptography, quantum key distribution protocols (QKDPs)
employ quantum mechanisms to distribute session keys and public discussions to
check for eavesdroppers and verify the correctness of a session key. However,
public discussions require additional communication rounds between a sender and
receiver. The advantage of quantum cryptography easily resists replay and passive
attacks.
A 3AQKDP with implicit user authentication, which ensures that
confidentiality is only possible for legitimate users and mutual authentication is
achieved only after secure communication using the session key start.
In implicit quantum key distribution protocol(3AQKDP) have two phases
such as setup phase and distribution phase to provide three party authentication
with secure session key distribution. In this system there is no mutual
understanding between sender and receiver. Both sender and receiver should
communicate over trusted center.
In explicit quantum key distribution protocol (3AQKDPMA) have two
phases such as setup phase and distribution phase to provide three party
authentications with secure session key distribution. I have mutual understanding
between sender and receiver. Both sender and receiver should communicate
directly with authentication of trusted center.
Disadvantage of separate process 3AQKDP and 3AQKDPMA were
provide the authentication only for message, to identify the security threads in the
message. Not identify the security threads in the session key.
3.1 Existing System

 In classical cryptography, three-party key distribution protocols utilize
challengeresponse mechanisms or timestamps to prevent replay attacks .
 However, challengeresponse mechanisms require at least two communication
rounds between the TC and participants, and the timestamp approach needs the
assumption of clock synchronization which is not practical in distributed systems
(due to the unpredictable nature of network delays and potential hostile attacks) .
 Furthermore, classical cryptography cannot detect the existence of passive attacks
such as eavesdropping. This fact can then be used to reduce the number ofrounds
of other protocols based on challenge-response mechanisms to a trusted center
(and not only three-party authenticated key distribution protocols).
3.2 Limitations of Existing System
Disadvantage of separate process 3AQKDP and 3AQKDPMA were provide the
authentication only for message, to identify the security threads in the message.
Not identify the security threads in the session key.
3.3 Proposed System.

In quantum cryptography, quantum key distribution protocols (QKDPs) employ quantum
mechanisms to distribute session keys and public discussions to check for eavesdroppers
and verify the correctness of a session key. However, public discussions require
additional communication rounds between a sender and receiver and cost precious qubits.
By contrast, classical cryptography provides convenient techniques that enable efficient
key verification and user authentication.
Hardware Interface
 Hard disk : 40 GB
 RAM : 512 MB
 Processor Speed : 3.00GHz
 Processor : Pentium IV Processor
Software Interface
 JDK 1.5
 Java Swing
 MS-Access/SQL Server
A Distributed Database Architecture For Global

Roaming In Next-Generation Mobile Networks
Abstract
The next-generation mobile network will support terminal mobility, personal
mobility, and service provider portability, making global roaming seamless. A location-
independent personal telecommunication number (PTN) scheme is conducive to
implementing such a global mobile system. However, the nongeographic PTNs coupled
with the anticipated large number of mobile users in future mobile networks may
introduce very large centralized databases. This necessitates research into the design and
performance of high-throughput database technologies used in mobile systems to ensure
that future systems will be able to carry efficiently the anticipated loads. This project
proposes a scalable, robust, efficient location database architecture based on the location-
independent PTNs.
The proposed multitree database architecture consists of a number of database
subsystems, each of which is a three-level tree structure and is connected to the others
only through its root. By exploiting the localized nature of calling and mobility patterns,
the proposed architecture effectively reduces the database loads as well as the signaling
traffic incurred by the location registration and call delivery procedures. In addition, two
memory-resident database indices, memory-resident direct file and
T-tree, are proposed for the location databases to further improve their throughput.
Analysis model and numerical results are presented to evaluate the efficiency of the
proposed database architecture. Results have revealed that the proposed database
architecture for location management can effectively support the anticipated
high user density in the future mobile networks.
HARDWARE REQUIREMENTS:
 Intel Pentium III Processor 128MB RAM

 10 GB Free Hard disk space
 STD Color Monitor
Operating System : Windows 2000/XP/NT.

Software : JDK 1.5
Database : Microsoft Access
A Novel Secure Communication Protocol for Ad Hoc networks [SCP]
Abstract
An ad hoc network is a self organized entity with a number of

mobile nodes without any centralized access point and also there is a
topology control problem which leads to high power consumption and
no security, while routing the packets between mobile hosts.
Authentication is one of the important security requirements of a
communication network. The common authentication schemes are not
applicable in Ad hoc networks. In this paper, we propose a secure
communication protocol for communication between two nodes in ad
hoc networks. This is achieved by using clustering techniques. We
present a novel secure communication framework for ad hoc networks
(SCP); which describes authentication and confidentiality when packets
are distributed between hosts with in the cluster and between the
clusters. These cluster head nodes execute administrative functions
and network key used for certification. The cluster head nodes (CHs)
perform the major operations to achieve our SCP framework with help
of Kerberos authentication application and symmetric key
cryptography technique which will be secure reliable transparent and
scalable and will have less over head.
3.1 HARDWARE AND SOFTWARE SPECIFICATION:

Hardware Environment:
The selection of hardware is very important in the existence and proper working of
any software. In the selection of hardware, the size and the capacity requirements are also
important.
The Web Based Manufacturing System can be efficiently run on Pentium system
with at least 128 MB RAM and Hard disk drive having 20 GB. Floppy disk drive of 1.44
MB and 14 inch Samsung color monitor suits the information system operation.(A Printer is
required for hard copy output).
Processor : Intel P-III based system
Processor Speed : 250 MHz to 833MHz
RAM : 256MB
Hard Disk : 40GB
Software Environment:
One of the most difficult tasks is that, the selection of the software, once system
requirement is known is determining whether a particular software package fits the
requirements. After initial selection further security is needed to determine the desirability of
particular software compared with other candidates. This section first summarizes the
application requirement question and then suggests more detailed comparisons.
• Operating System -- Windows 95/98/NT/2000

• Browser -- IE
• Web/Application Server -- Tomcat Server
• Database -- Oracle
• Database Connectivity -- JDBC
• Java Technologies -- Java (Servlets, Jsp)
• Scripting Technology -- JavaScript
Using the Conceptual Cohesion of Classes for

Fault Prediction in Object-Oriented Systems
Abstract:
High cohesion is desirable property in software systems to

achieve reusability and maintainability. In this project we are
measures for cohesion in Object-Oriented (OO) software reflect
particular interpretations of cohesion and capture different aspects of
it. In existing approaches the cohesion is calculate from the structural
information for example method attributes and references. In
conceptual cohesion of classes, i.e. in our project we are

calculating the unstructured information from the source code such
as comments and identifiers. Unstructured information is embedded
in the source code. To retrieve the unstructured information from the
source code Latent Semantic Indexing is used. A large case study
on three open source software systems is presented which compares
the new measure with an extensive set of existing metrics and uses
them to construct models that predict software faults. In our project we
are achieving the high cohesion and we are predicting the fault in
Object –Oriented Systems.
Existing Systems:
1. Structural metrics are calculated from the source code such as
references and data sharing between methods of a class
belong together for cohesion.
2. It define and measure relationships among the methods of a
class based on the number of pairs of methods that share
instance or class variables one way or another for cohesion.
Disadvantage
• Lacking of high cohesion
Proposed Systems
1. In proposed System unstructural information is retrieved from
the source code like comments and identifiers.
2. Information is retrieved from the source code using Latent
Semantic Indexing.
3. With the help of C3 and existing metrics we are achieving the
high cohesion and low coupling.
Advantage
• We can predict the fault prediction using high cohesion
• PROCESSOR : PENTIUM III 866 MHz
• RAM : 128 MB DD RAM
• MONITOR : 15” COLOR
• FLOPPY DRIVE : 1.44 MB
• CDDRIVE : LG 52X
• KEYBOARD : STANDARD 102 KEYS
• MOUSE : 3 BUTTONS
• LANGUAGE : JAVA
• FRONT-END TOOL : SWING
• OPERATING SYSTEM : WINDOWS-XP
DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED

PEER-TO-PEER NETWORKS
ABSTRACT:
Designing efficient search algorithms is a key challenge in unstructured peer-to-

peer networks. Flooding and random walk (RW) are two typical search algorithms.
Flooding searches aggressively and covers the most nodes. However, it generates a large
amount of query messages and, thus, does not scale. On the contrary, RW searches
conservatively. It only generates a fixed amount of query messages at each hop but would
take longer search time. We propose the dynamic search (DS) algorithm, which is a
generalization of flooding and RW. DS takes advantage of various contexts under which
each previous search algorithm performs well. It resembles flooding for short-term search
and RW for long-term search. Moreover, DS could be further combined with knowledge-
based search mechanisms to improve the search performance. We analyze the
performance of DS based on some performance metrics including the success rate, search
time, query hits, query messages, query efficiency, and search efficiency. Numerical
results show that DS provides a good tradeoff between search performance and cost. On
average, DS performs about 25 times better than flooding and 58 times better than RW in
power-law graphs, and about 186 times better than flooding and 120 times better than
RW in bimodal topologies.
SYSTEM ANALYSIS:
EXISTING SYSTEM:
Flooding and RW are two typical examples of blind search algorithms by which
query messages are sent to neighbors without any knowledge about the possible locations
of the queried resources or any preference for the directions to send. Some other blind
search algorithms include modified BFS (MBFS) , directed BFS expanding ring and
random periodical flooding (RPF).These algorithms try to modify the operation of
flooding to improve the efficiency. However, they still generate a large amount of query
messages.
DISADVANTAGES:
In the existing system search cost is high.
It produces considerable query messages even when the resource distribution is

scarce.
The search is especially inefficient when the target is far from the query source
because the number of query messages would grow exponentially with the hop counts.
It’s more time consuming one.
ROPOSED SYSTEM:
In this paper, we propose the dynamic search (DS) algorithm, which is a
generalization of flooding and RW. DS overcomes the disadvantages of flooding and RW
and takes advantage of different contexts under which each search algorithm performs
well. The operation of DS resembles flooding for the short-term search and RW for the
long-term search. In order to analyze the performance of DS, we apply the random graphs
as the models of network topologies and adopt the probability generating functions to
model the link degree distribution. We evaluate the performance of search algorithms in
accordance with some performance metrics including the success rate, search time,
number of query hits, and number of query messages, query efficiency, and search
efficiency.
PROBLEM FORMULATION:
Flooding and RW are two typical examples of blind search algorithms by which
query messages are sent to neighbors without any knowledge about the possible locations
of the queried resources or any preference for the directions to send. Some other blind
search algorithms include modified BFS (MBFS) [23], directed BFS [6], expanding ring
and random periodical flooding (RPF).These algorithms try to modify the operation of
flooding to improve the efficiency. However, they still generate a large amount of query
messages. Jiang et al. propose a Light Flood algorithm, which is a combination of the
initial pure flooding and subsequent tree-based flooding.
PROPOSED SOLUTION:
DS is designed as a generalization of flooding, MBFS, and RW. There are two
phases in DS. Each phase has a different searching strategy. The choice of search strategy
at each phase depends on the relationship between the hop count h of query messages and
the decision threshold n of DS.
Phase1. When h <= n

At this phase, DS acts as flooding or MBFS. The number of neighbors that a
query source sends the query messages to depends on the predefined transmission
probability p. If the link degree of this query source is d, it would only send the query
messages to d. p neighbors. When p is equal to 1, DS resembles flooding. Otherwise, it
operates as MBFS with the transmission probability p.
Phase2. When h > n

At this phase, the search strategy switches to RW. Each node that receives the
query message would send the query message to one of its neighbors if it does not have
the queried resource. Assume that the number of nodes visited by DS at hop h ¼ n is the
coverage cn, and then the operation of DS at that time can be regarded as RW with cn
walkers. However, there are some differences between DS and RW when we consider the
whole operation.
KNOWLEDGE-BASED DYNAMIC SEARCH

In this section, we present the generic scheme to incorporate these knowledge-based
search algorithms with our DS algorithm. We construct the probabilistic function based
on the information learned from the past experiences, with respect to each search target,
search time, and local topology information. Thus, a node has more information to
intelligently decide how many query messages to send and to which peers these messages
should be forwarded
Ram : 128Mb.
Hard Disk : 10 Gb.
Compact Disk : 650 Mb.

Language : JDK 1.5
Data Bases : Microsoft Sql Server
Front End : Java Swing
Distributed Algorithms for

Constructing
Approximate Minimum Spanning Trees
In Wireless Sensor Networks
Abstract:
While there are distributed algorithms for the Minimum Spanning Tree (MST)
problem, these algorithms require relatively large number of messages and time, and
are fairly involved, making them impractical for resource-constrained networks such as
wireless sensor networks. In such networks, a sensor has very limited power and any
algorithm needs to be simple, local and energy efficient. Motivated by these
considerations, we design and analyze a class of simple and local distributed algorithms
called Nearest Neighbor Tree (NNT) algorithms for energy- efficient construction of an
approximate MST in wireless networks. Assuming that the nodes are uniformly
distributed, we show provable bounds on both the quality of the spanning tree produced
and the energy needed to construct them. We show that while NNT produces a close
approximation to the MST, it consumes asymptotically less energy than the classical
message-optimal distributed MST algorithm due to Gallagery, Humblet, and Spira.
Further, the NNTs can be maintained dynamically with polylogarithmic rearrangements
under node insertions/deletions. We also perform extensive simulations, which show that
the bounds are much better in practice. Our results, to the best of our knowledge,
demonstrate the first tradeoff between the quality of approximation and the energy
required for building spanning trees on wireless networks, and motivate similar
considerations for other important problems.
Existing System:
The minimum spanning tree (MST) problem is an important and commonly

occurring primitive in the design and operation of data and communication networks .
For instance , in ad hoc sensor networks , MST is the optimal routing tree for data
aggregation. Traditionally, the efficiency of distributed algorithms is measured by
the running time and the number of messages exchanged among the computing
nodes , and a lot of research has gone into the design of algorithms that are optimal
with respect to such criteria. The classical algorithm due to Gallagery, Humble t, and
Spira (hence forth referred to as the GHS algorithm) uses _(n ln n ) jEj) messages , and
is essentially optimal with respect to the message complexity . There are distributed
algorithms that find the MST and are essentially optimal in terms of time
complexity : they run in O(Diam(G) ) n1=2polylog(n)) time, and there are (almost)
matching lower bounds. However, these time-optimal algorithms involve a lot of
message transfers (much more than GHS). Even for a wireless network modeled by a
unit disk graph (UDG) or even a ring, any distributed algorithm to construct an MST
needs _(n ln n) messages . Despite their theoretical optimality, these algorithms are
fairly involved, require synchronization and a lot of bookkeeping ;such algorithms are
impractical for ad hoc and sensor networks .
Disadvantages:
• The network management and communication has to be done in a local
and distributed fashion.
• Battery limitations
• Energy is a very crucial resource.
• Exchanges a large number of messages, can consume a relatively large
amount of energy (and also time)
• It is not suitable in an energy-constrained sensor network
• Cycle detection is another one disadvantage
Proposed System:
In this paper, we study a class of simple , local , distributed, approximation
algorithms called the Nearest Neighbor Tree (NNT) algorithms that are provably
good: they build slightly suboptimal trees with low energy complexity and are easy to
maintain dynamically. The NNT algorithms bypass such a step completely by a very
simple idea : each node chooses a unique rank, a quantity from a totally ordered set,
and a node connects to the nearest node of higher rank. The algorithm consists of
exchanging three types of messages : request, available, and connect among the
nodes . Each node begins with broadcasting a request for connection message.
System Requirement:
Ram : 128Mb.
Hard Disk : 10 GB.
Compact Disk : 650 Mb.
Operating System : Windows 2000 server Family.
Language : JDK 1.5
Data Bases : Microsoft SQL Server
Dynamic Routing with Security Considerations
Abstract:
Security has become one of the major issues for data communication over wired
and wireless networks. Different from the past work on the designs of cryptography
algorithms and system infrastructures, An analytic study on the proposed algorithm is
presented, and experiments are conducted to verify the analytic results and to show the
capability of the proposed algorithm.
Algorithm / Technique used:

Distance-vector-based algorithm for dynamic routing.
Algorithm Description:
A distance-vector-based algorithm for dynamic routing to improve the security of

data transmission. We propose to rely on existing distance information exchanged among
neighboring nodes (referred to as routers as well in this paper) for the seeking of routing
paths. In many distance-vector-based implementations, e.g., those based on RIP, each
node Ni maintains a routing table in which each entry is associated with a tuple and Next
hop denote some unique destination node, an estimated minimal cost to send a packet to
t, and the next node along the minimal-cost path to the destination node, respectively.
Existing System:
Existing work on security-enhanced data transmission includes the designs of
cryptography algorithms and system infrastructures and security-enhanced routing
methods. Their common objectives are often to defeat various threats over the Internet,
including eavesdropping, spoofing, session hijacking, etc. Among many well-known
designs for cryptography based systems, the IP Security (IPSec) and the Secure Socket
Layer (SSL) are popularly supported and implemented in many systems and platforms.
Although IPSec and SSL do greatly improve the security level for data transmission, they
unavoidably introduce substantial overheads, especially on gateway/host performance
and effective network bandwidth. For example, the data transmission overhead is 5
cycles/byte over an Intel Pentium II with the Linux IP stack alone, and the overhead
increases to 58 cycles/byte when Advanced Encryption Standard (AES) is adopted for
encryption/decryption for IPSec.
Proposed System:
We propose a dynamic routing algorithm that could randomize delivery paths for
data transmission. The algorithm is easy to implement and compatible with popular
routing protocols, such as the Routing Information Protocol in wired networks and
Destination-Sequenced Distance Vector protocol in wireless networks, without
introducing extra control messages
• System : Pentium IV 2.4 GHz.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 256 Mb.
• Operating system : - Windows XP Professional.
• Coding Language : - Java.
• Tool Used : - Eclipse.
Quiver: Consistent Object Sharing for

Edge Services
Abstract
We present Quiver, a system that coordinates service

proxies placed at the “edge” of the Internet to serve distributed clients
accessing a service involving mutable objects. Quiver enables these
proxies to perform consistent accesses to shared objects by migrating
the objects to proxies performing operations on those objects. These
migrations dramatically improve performance when operations
involving an object exhibit geographic locality, since migrating this
object into the vicinity of proxies hosting these operations will benefit
all such operations. This system reduces the workload in the server. It
performs the all operations in the proxies itself. In this system the
operations performed in First-In-First-Out process. This system handles
two process serializability and strict serializabilty for durability in the
consistent object sharing . Other workloads benefit from Quiver,
dispersing the computation load across the proxies and saving the
costs of sending operation parameters over the wide area when these
are large. Quiver also supports optimizations for single-object reads
that do not involve migrating the object. We detail the protocols for
implementing object operations and for accommodating the addition,
involuntary disconnection, and voluntary departure of proxies. Finally,
we discuss the use of Quiver to build an e-commerce application and a
distributed network traffic modeling service.
Existing System:
• In the existing system the proxies has been maintained in the

critical path for each object updation or each proxy should
connected with the centralized server.
• The consistency was not maintained while sharing the object.
• If the proxy has failed means the object has been lost.
• The existing system supports only single-object operations, and

provides weak consistency semantics.
Disadvantages:
• Consistency was not maintained while migrating the object
between the proxies.
• It does not handle the proxy disconnections.
• It supports only the single object operations.
Proposed System:
• This system forms the proxies in the tree structure. It shares the
objects within the proxies. It reduces the workload in the server.
• Quiver enables consistent multiobject operations and
optimizations for single-object reads that are not possible in
these prior algorithms.
• This system recovers the proxy disconnection. The disconnected

proxies maintained by alternate proxies or it will be maintained
through server.
• This System use the kruskal’s algorithm for maintaining tree

structure. It reduces weightage in the tree structure.
• It holds the object even when the proxy has been disconnected.
System Requirements
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 20 GB
CDDRIVE : LG 52X
MOUSE : 3 BUTTONS
Software:
Front End : Java
Back End : MS Access
Tools Used : NetBeans(ide)
DCMP: A DISTRIBUTED CYCLE MINIMIZATION

PROTOCOL FOR PEER-TO-PEER NETWORKS
ABSTRACT
Broadcast-based peer-to-peer (P2P) networks, including flat (for example,
Gnutella) and two-layer superpeer implementations (for example, Kazaa), are extremely
popular nowadays due to their simplicity, ease of deployment, and versatility. The
unstructured network topology, however, contains many cyclic paths, which introduce
numerous duplicate messages in the system. Although such messages can be identified
and ignored, they still consume a large proportion of the bandwidth and other resources,
causing bottlenecks in the entire network. In this paper, we describe the Distributed Cycle
Minimization Protocol (DCMP), a dynamic fully decentralized protocol that significantly
reduces the duplicate messages by eliminating unnecessary cycles.
As queries are transmitted through the peers, DCMP identifies the problematic
paths and attempts to break the cycles while maintaining the connectivity of the network.
In order to preserve the fault resilience and load balancing properties of unstructured P2P
systems, DCMP avoids creating a hierarchical organization. Instead, it applies cycle
elimination symmetrically around some powerful peers to keep the average path length
small. The overall structure is constructed fast with very low overhead. With the
information collected during this process, distributed maintenance is performed
efficiently even if peers quit the system without notification. The experimental results
from our simulator and the prototype implementation on PlanetLab confirm that DCMP
significantly improves the scalability of unstructured P2P systems without sacrificing
their desirable properties. Moreover, due to its simplicity, DCMP can be easily
implemented in various existing P2P systems and is orthogonal to the search algorithms.
EXISTING SYSTEM
• Simplicity, ease of deployment, and versatility
• Unstructured network topology contains many cyclic paths
• It simplifies the implementation of large ad hoc distributed repositories of digital
information.
• Queries are transmitted through the cyclic path
LIMITATIONS OF THE EXITING SYSTEM

• Introduce numerous duplicate messages in the system
• It consume a large proportion of the bandwidth and other resources
• It causes bottlenecks in the entire network.
PROPOSED SYSTEM
• DCMP is dynamic fully decentralized protocol
• Queries are transmitted through the peers
• DCMP use message flooding to propagate queries
• DCMP use the method Native Duplicate Elimination (NDE)
• DCMP implements the prototype called Planet Lab
ADVANTAGE OF PROPOSED SYSTEM

• Preserve the fault resilience and load balancing
• It avoid duplicate messages and repeated messages
• It reduce number of cycle per transaction
Processor/system : Pentium IV
Main memory : 512 MB RAM
Cache memory : 512 KB
Processor speed : 600 MHz
Keyboard : 101 keys
Hard disk drive : 40 GB
SOFTWARE REQUIREMENTS
Operating system : Windows 2000 and above

Front end designing Tool : Java Swing
Programming Language : Core Java
Text Editor : Note Pad
Database : SQL-Server.
Computation-Efficient Multicast Key

Distribution
ABSTRACT
Efficient key distribution is an important problem for secure group

communications. The communication and storage complexity of multicast key
distribution problem has been studied extensively. In this paper, we propose a new
multicast key distribution scheme whose computation complexity is significantly
reduced. Instead of using conventional encryption algorithms, the scheme employs MDS
codes, a class of error control codes, to distribute multicast key dynamically. This scheme
drastically reduces the computation load of each group member compared to existing
schemes employing traditional encryption algorithms. Such a scheme is desirable for
many wireless applications where portable devices or sensors need to reduce their
computation as much as possible due to battery power limitations. Easily combined with
any key-tree-based schemes, this scheme provides much lower computation complexity
while maintaining low and balanced communication complexity and storage complexity
for secure dynamic multicast key distribution.
Existing System
The communication complexity is usually ensured by the number of data bits that
need to be transmitted from the GC to group members to convey information of session
keys, whereas the storage complexity is measured by the number of data bits that the GC
and group members need to store to obtain session keys. Another similarly important but
usually under noticed, if not ignored, factor is the computation complexity, which can be
measured by the number of computation operations (or the computation time on a given
computing platform) that the GC and group members need to distribute and extract
session keys. Hereafter, the problem of how resources can effectively be used to
distribute session keys is referred to as the group key distribution problem.
Draw Back:
 The group controller maintains whole group member’s information, so increase
the storage complexity.
 The group members are not able to communicate with any other groups during the
re keying process.
 The Group controller takes all responsibilities for the group such as key
generation, re keying process and message transfer to any other groups
Proposed System:
The complexity of the rekeying operation is asymmetric between a new member’s
join and an old member’s leave. When a new member joins, the GC can easily multicast
the new session key encrypted by the current session key to all the current members,
followed by a unicast to the new member to send the new session key encrypted by a
predetermined encryption key shared between the GC and the new member. Thus, join is
easy, with low communication and computation cost. However, when an old member
leaves, the current session key cannot be used to convey the new session key information
securely, since it is also known to the old member. Thus, hereafter, we will focus on the
rekeying operation for a single member leave. The same idea can easily be extended to
other rekeying operations such as batch rekeying.
Advantages of the Proposed System:
 The Group controller responsibilities are shared by the Group control
intermediater such as Re keying process and scalability of the group process
 Use the Identity tree based structure
 The group members are not affected by the key generation process when they are
willing to communicate with any other group members
 The Centralized key server used for key generation process and the KGC is also
act as a Router for group to group communication
 The Re keying process is done only to the particular group members not to the
entire group members
Ram : 256MB.
Hard Disk : 80 GB
Operating System : Windows XP
Techniques : JDK 1.5
Data Bases : Microsoft Sql Server
Front End : Java Swing.
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
Abstract
The capability of dynamically adapting to distinct runtime

conditions is an important issue when designing distributed systems
where negotiated quality of service (QOS) cannot always be delivered
between processes. Providing fault tolerance for such dynamic
environments is a challenging task. Considering such a context, this
paper proposes an adaptive programming model for fault-tolerant
distributed computing, which provides upper-layer applications with
process state information according to the current system synchrony
(or QOS). The underlying system model is hybrid, composed by a
synchronous part (where there are time bounds on processing speed
and message delay) and an asynchronous part (where there is no time
bound). However, such a composition can vary over time, and, in
particular, the system may become totally asynchronous (e.g., when
the underlying system QOS degrade) or totally synchronous.
Moreover, processes are not required to share the same view of the
system synchrony at a given time. To illustrate what can be done in
this programming model and how to use it, the consensus problem is
taken as a benchmark problem. This paper also presents an
implementation of the model that relies on a negotiated quality of
service (QOS) for communication channels.
• SOFTWARE REQUIREMENTS:-
• Java1.3 or More
• Java Swing – front end
• Windows 98 or more.
• Ms Access – Back end
• HARDWARE REQUIREMENTS:-
• Hard disk : 40 GB
• RAM :128mb
• Processor : Pentium
Homogenous Network Control And Implementation

ABSTRACT
This project, titled “Homogenous Network Control and

Implementation”, presents a way of developing integrity-preserved computer
networks.The propsed generic network is based on a detailed review and
comparitive analysis of ongoing research work in the field of homogenous
distributed systems and fault-tolerant systems. The presented network
facilitates easy sharing of information among the systems in the network by
establishing a peer to peer network connection among all the systems.
Homogenous Network of Workstations (HNOW systems) comprise of
similar kinds of PC’s, Workstations connected over a single network. In a
homogenous network, each machine has the ability to send data to another
machine, irrespective of the working conditions of the server.
In general, a set of networks is classified as homogenous, if the
networks are “same”(e.g., using the same basic technology, frame format
and addressing); a set of networks is classified as heterogeneous if the set
contains network that differ.
The theme of the project is centered on the development of a
homogenous network and establishment of process continuation module,
which plays an imperative part in maintaining the network integrity.
Operating System : Windows XP/NT.
Software : JDK 1.5

A BGP Based Mechanism For Lowest Cost Routing
ABSTRACT
The routing of traffic between internet domains and autonomous systems is
handled by the Border Gateway Protocol (BGP). The internet comprised of many
administrative domains to transmit the packets from one autonomous system to another
or with in the system.
There is set of bidirectional links between the no of nodes and the network is an
AS graph because the routes selection problem arises when a node has multiple potential
routes to destination .The main goal is to send each packet along the least cost path(LCP),
the pricing mechanism must be strategy proof so that agents have no incentives to lie
about their costs.
.1 Existing System
 The drawback of this approach is that it tends to overwhelm the nodes on the least
cost path, which is undesirable for sensor networks since all sensor nodes are
collaborating for a common mission and the duties of failed nodes may not be
taken by other nodes.
 A few schemes have been proposed to address this problem by studying the
maximum lifetime routing problem. The problem focuses on computing the flow
and transmission power to maximize the lifetime of the network, which is the time
at which the first node in the network runs out of energy. Some distributed
solutions based on sub gradient algorithms and utility-based algorithm have been
proposed. The common assumption of these works is that the data flows are
conserved during the transmission from the sensor nodes to the sink node, which
however is not true for sensor networks because data collected by neighboring
nodes are often spatially correlated.
3.2 Proposed System
 The algorithm requires maintaining two trees—the coding tree for raw data
aggregation and the Border gateway protocol (BGP) for delivering the
compressed data to the sink node. These works demonstrate that data aggregation
can greatly improve the performance of various communication protocols.
 By jointly optimizing routing and data aggregation, the network lifetime can be
extended from two dimensions. One is to reduce the traffic across the network by
data aggregation, which can reduce the power consumption of the nodes close to
the sink node. The other is to balance the traffic to avoid overwhelming the
bottleneck nodes. In this paper, we present a model to integrate routing and data
aggregation. We adopt the geometric routing whereby the routing is determined
solely according to the nodal position. This allows different data correlation
models such as that in to be incorporated without intervening the underlying
routing scheme.
3.3 System Requirements
3.3.1 Hardware Requirements

Hard Disk : 40GB
RAM : 512MB

Operating System : Windows XP/2003 or Linux
User Interface : AWT and Swings
Programming Language : Java
Web Applications : Socket programming
IDE/Workbench : My Eclipse 6.0
Enhancing Privacy and Authorization Control

Scalability in the Grid through Ontologies
Abstract
The use of data Grids for sharing relevant data has proven to be
successful in many research disciplines. However, the use of these
environments when personal data are involved (such as in health) is reduced
due to its lack of trust. There are many approaches that provide encrypted
storages and key shares to prevent the access from unauthorized users.
However, these approaches are additional layers that should be managed
along with the authorization policies. We present in this paper a privacy-
enhancing technique that uses encryption and relates to the structure of the
data and their organizations, providing a natural way to propagate
authorization and also a framework that fits with many use cases. The paper
describes the architecture and processes, and also shows results obtained in a
medical imaging platform.
Existing System
One of the challenges for biomedical application is to provide efficient

high-level interfaces, depending on the applications that enable access to
Grids for nonexperts, ensuring transparent access to medical resources
through services compatible with medical practice. As part of the interfaces,
a flexible architecture for the management of the privacy of data is needed,
compatible with medical practice and with preexisting Grid security systems
are complex enough to be considered an obstacle in the successful Grid
adoption.
Proposed System
The main objective of this paper is to provide Grid middleware’s such

as TRENCADIS, with efficient and reliable privacy protection for sensitive
data. This paper presents a model for long-term storage and management of
encrypted data in distributed environments. Furthermore, the paper outlines
how this model is implemented to preserve the privacy of patient
information in Grid-based collaborative computational infrastructures for
biomedical applications. This paper delineates a dependable security
framework in overextended organizations. Throughout the assembly of this
framework, organizations will encounter different degrees of data integrity
and confidentiality.
The specific objectives of the paper are
1) To propose an on-the-fly cryptographic infrastructure to protect privacy

from users with administrative privileges.
2) To provide a flexible architecture for organizing key management for

long-term storage of encrypted data.
3) To propose a model applicable in different environments, Compatible

with current Grid middleware’s.
4) To provide an access control mechanism for encryption keys based on

ontological groups and roles.
Ram : 128Mb (Min).
Hard Disk : 10 GB (Min).
Compact Disk : 650 Mb (Min).
Language : JDK 1.5
Data Bases : Microsoft SQL Server
Combinatorial Approach for Preventing SQL

Injection Attacks
Abstract:
A combinatorial approach for protecting Web applications against SQL injection is discussed in this
paper, which is a novel idea of incorporating the uniqueness of Signature based method and auditing
method. The major issue of web application security is the SQL Injection, which can give the attackers
unrestricted access to the database that underlie Web applications.Many software systems have evolved to
include a Web-based component that makes them available to the public via the Internet and can expose
them to a variety of Web-based attacks. One of these attacks is SQL injection, which can give attackers
unrestricted access to the databases that underlie Web applications and has become increasingly frequent
and serious. This paper presents a new highly automated approach for protecting Web applications against
SQL injection that has both conceptual and practical advantages over most existing techniques. From a
conceptual standpoint, the approach is based on the novel idea of positive tainting and on the concept of
syntax-aware evaluation. From a practical standpoint, our technique is precise and efficient, has minimal
deployment requirements, and incurs a negligible performance overhead in most cases. We have
implemented our techniques in the Web Application SQL-injection Preventer (WASP) tool, which we used
to perform an empirical evaluation on a wide range of Web applications that we subjected to a large and
varied set of attacks and legitimate accesses. WASP was able to stop all of the otherwise successful attacks
and did not generate any false positives.
Objective
SQL injection techniques are an increasingly dangerous threat to the security of information
stored upon Oracle Databases. These techniques are being discussed with greater regularity on security
mailing lists, forums, and at conferences. There have been many good papers written about SQL Injection
and a few about the security of Oracle databases and software but not many that focus on SQL injection
and Oracle software. This is the first article in a two-part series that will examine SQL injection attacks
against Oracle databases. The objective of this series is to introduce Oracle users to some of the dangers of
SQL injection and to suggest some simple ways of protecting against these types of attack. SQL injection
techniques are an increasingly dangerous threat to the security of information stored upon Oracle
Databases. These techniques are being discussed with greater regularity on security mailing lists, forums,
and at conferences. There have been many good papers written about SQL Injection and a few about the
security of Oracle databases and software but not many that focus on SQL injection and Oracle software.
This is the first article in a two-part series that will examine SQL injection attacks against Oracle databases.
The objective of this series is to introduce Oracle users to some of the dangers of SQL injection and to
suggest some simple ways of protecting against these types of attack.

Ram : 128Mb.
Hard Disk : 10 GB.

Evaluating the Vulnerability of Network Traffic Using Joint

Security and Routing Analysis
ABSTRACT
Joint analysis of security and routing protocols in wireless networks reveals

vulnerabilities of secure network traffic that remain undetected when security and routing
protocols are analyzed independently. We formulate a class of continuous metrics to
evaluate the vulnerability of network traffic as a function of security and routing
protocols used in wireless networks. We discuss the availability of security parameters to
the adversary and show that unknown parameters can be estimated using probabilistic
analysis. We demonstrate vulnerability evaluation using the proposed metrics and node
capture attacks using the GNAVE algorithm.
EXISTING SYSTEM:
ASSURANCE of secure applications and services in wireless networks relies on

the properties of confidentiality and integrity, respectively defined as the ability to keep
data Secret from unauthorized entities and the ability to verify that data has not been
maliciously or accidentally altered. Eschenauer and Gligor recently demonstrated in that
these properties can be efficiently compromised by physically capturing network nodes
and extracting cryptographic keys from their memories. These node capture attacks are
possible in most wireless networks due to the unattended operation of wireless nodes and
the prohibitive cost of tamper-resistant hardware in portable devices. Furthermore, as
shown in , an intelligent adversary can improve the efficiency of a node capture attack
over that of approaches in recent literature focusing on random node capture using
publicly available information leaked from the key assignment protocol.
PROPOSED SYSTEM:
We develop two complementary vulnerability definitions using set theoretic and

circuit theoretic interpretations of the security of network traffic, allowing a network
analyst or an adversary to determine weaknesses in the secure network.
We formalize node capture attacks using the vulnerability metric as a nonlinear

integer programming minimization problem and propose the GNAVE algorithm, a
Greedy Node capture Approximation using Vulnerability Evaluation.
• SYSTEM : Dual Core
• RAM : 1 GB
• Operating system :- Windows XP Professional

• Front End : - Java Technology.
A PRECISE TERMINATION CONDITION OF THE

PROBABIISTIC PACKET MARKING ALGORITHM
Abstract
The probabilistic packet marking (PPM) algorithm is a

promising way to discover the Internet map or an attack graph that the
attack packets traversed during a distributed denial-of-service attack.
However, the PPM algorithm is not perfect, as its termination condition
is not well defined in the literature. More importantly, without a proper
termination condition, the attack graph constructed by the PPM
algorithm would be wrong. In this work, we provide a precise
termination condition for the PPM algorithm and name the new
algorithm the Rectified PPM (RPPM) algorithm. The most significant
merit of the RPPM algorithm is that when the algorithm terminates, the
algorithm guarantees that the constructed attack graph is correct, with
a specified level of confidence. We carry out simulations on the RPPM
algorithm and show that the RPPM algorithm can guarantee the
correctness of the constructed attack graph under 1) different
probabilities that a router marks the attack packets and 2) different
structures of the network graph. The RPPM algorithm provides an
autonomous way for the original PPM algorithm to determine its
termination, and it is a promising means of enhancing the reliability of
the PPM algorithm.
Existing System:-
 In the existing system PPM algorithm is not perfect, as its

termination condition is not well defined.
 Without proper termination condition the attack graph

constructed by the PPM algorithm would be wrong.
 The algorithm requires prior knowledge about the network

topology.
Proposed System:-
 To propose termination condition of the PPM algorithm, this is

missing or is not explicitly defined in the literature.
 Through the new termination condition, the user of the new

algorithm is free to determine the correctness of the constructed
graph.
 The constructed graph is guaranteed to reach the correctness

assigned by the user, independent of the marking probability and
the structure of the underlying network graph.
 In this system we proposed a Probabilistic Packet Marking

Algorithm to encode the packet in the routers to detect the
attacked packets.
 To reduce the a constructed graph such that the constructed

graph is the same as the attack graph, where an attack graph is
the set of paths the attack packets traversed,
 To construct a graph, is a graph returned by the PPM algorithm.
System Requirements
Hardware:
RAM : 512 MB DD RAM
HARD DISK : 20 GB
CDDRIVE : LG 52X
MOUSE : 3 BUTTONS
Software:
Intrusion Detection In Homogeneous & Heterogeneous

Wireless Sensor Networks
Abstract
Intrusion Detection, which is the art of detecting inappropriate, incorrect,

or anomalous activity. This Project reports the design principles and
evaluation results of a new experimental hybrid intrusion detection system. By
mining anomalous traffic episodes from Internet connections, we build an
ADS that detects anomalies beyond the capabilities of signature-based
SNORT system. A weighted signature generation scheme is developed to
integrate ADS with SNORT by extracting signatures from anomalies detected.
HIDS extracts signatures from the output of ADS and adds them into the
SNORT signature database for fast and accurate intrusion detection
Existing System:
 Conventional systems that detect known attacks with low false alarms.
However, the signature-based IDS cannot detect unknown attacks
without any recollected signatures.
 Furthermore, signature matching performs well only
for single-connection attacks. With the sophistication of attackers,
more attacks involve multiple connections. This limits the detection
range by signature matching.
Proposed System :
An anomaly-based system uses a different philosophy. A network

anomaly is detected if the incoming traffic pattern deviates from the
normal profiles significantly. This system combines the positive
features of both intrusion detection models to achieve higher detection
accuracy, lower false alarms, and, thus, a raised level of cyber trust.
 Operating System : Windows 2000/XP

 Implementation Languages : Jdk 1.5.0
 Database : Microsoft Access
2.3.2. Hardware Requirements
 CPU: 466MHz Processor and above.

 Memory: 64 MB RAM and above.
 Disk Space: 1 GB and above.
 Network Devices: Switches, Router, Hubs, CD-ROM.
Network Border Patrol: Preventing Congestion Collapse And

Promoting Fairness In The Internet
ABSTRACT
The fundamental philosophy behind the Internet is

expressed by the scalability argument: no protocol, mechanism, or service should be
introduced into the Internet if it does not scale well. A key corollary to the scalability
argument is the end-to-end argument: to maintain scalability, algorithmic complexity
should be pushed to the edges of the network whenever possible.
Perhaps the best example of the Internet philosophy is TCP

congestion control, which is implemented primarily through algorithms operating at end
systems. Unfortunately, TCP congestion control also illustrates some of the shortcomings
the end-to-end argument. As a result of its strict adherence to end-to-end congestion
control, the current Internet suffers from main maladies: congestion collapse from
undelivered packets.
The Internet’s excellent scalability and robustness result in part

from the end-to-end nature of Internet congestion control. End-to-end congestion control
algorithms alone, however, are unable to prevent the congestion collapse and unfairness
created by applications that are unresponsive to network congestion. To address these
maladies, we propose and investigate a novel congestion-avoidance mechanism called
network border patrol (NBP).
NBP entails the exchange of feedback between routers at the borders of a network
in order to detect and restrict unresponsive traffic flows before they enter the network,
thereby preventing congestion within the network.
2.1 EXISTING SYSTEM:

 Packets are buffered in the routers present in the network which causes
Congestion collapse from undelivered packets arises when bandwidth is
continuously consumed by packets that are dropped before reaching their
ultimate destinations.
 Retransmission of undelivered packets is required to ensure no loss of data.
 Unfair bandwidth allocation arises in the Internet due to the presence of
undelivered packets.
2.2 PROPOSED SYSTEM

 Buffering of packets in carried out in the edge routers rather than in the core
routers.
 The packets are sent into the network based on the capacity of the network
and hence there is no possibility of any undelivered packets present in the
network.
 Absence of undelivered packets avoids overload due to retransmission.
 Fair allocation of bandwidth is ensured.
System requirements:
• Hardware Requirements:
 Processor: Intel Pentium III Processor

 Random Access Memory: 128MB
 Hard Disk: 40GB
 Processor Speed: 300 min
• Software Requirements:
 Language: Java Networking

 Front End Tool: Java Swing
 Operating System: Windows 98
An algorithm approach for to identify network link failures
ABSTRACT
Due to the Internet’s complexity and various routing policies, it is difficult to

locate the exact connectivity changes that occur from time to time which are the causes
for large volumes of BGP update messages.
“An Algorithmic Approach to Identify Network Link Failures” is an approach to
identify these connectivity changes exactly. Here an algorithm, called FindChange is
used that can pin down the origin of routing changes due to any single link failure or link
restoration.
The algorithm set, FindChange uses a simplified model of BGP and graph model
of internet. It has distinctions from BGP model such as assuming one best path between
two nodes, single connection between two nodes. FindChange takes the update messages
collected from vantage points as input and accurately locates the link changes. The input
is taken as graphs and by making the comparisons of edges between two nodes the links
which are failed, added or restored and links unchanged are identified. Using this
information path between two nodes is computed before and after the connectivity
changes.
Existing System
An ad-hoc combination of intuition, experience, and informal analysis is often

used to speculate the causes of large swings in BGP updates. In addition to the challenge
of scale, the underlying Internet topology is not known precisely and the monitoring points
provide views from only a limited set of geographic locations. In such an environment,
ad-hoc techniques are limited by the expertise of the administrator and it is not easy to
identify the underlying events that cause BGP changes. To provide dependable global data
delivery, analysis tools are needed that can help us to understand the BGP system and
pinpoint the exact cause of connectivity changes.
3.2 Proposed System
A formal approach is provided to identify the link failures which are supposed to
cause route changes and pinpoint exact connectivity changes. Along with the links failed,
the links which are restored or newly added, the links which remains unchanged are
identified and the number of links failed, restored, unchanged.
3.3 System Requirements

OS : Windows
Project Platform : Java
Software : JDK1.5
User Interface : Frames
3.3.2 Hardware Requirements
Key Board : Standard Key Board with 101 Keys

Monitor : SVGA Color Monitor
Hard disk : 20 GB
RAM : 256 MB
Broken Links Handler
ABSTRACT
The presence of broken links is a serious problem plaguing the World Wide Web.
Surveys show that 6% of the links on the web are broken. It reduces the usability of the world
web. To deal with this problem, we implemented a web broken links handler check application
with Java web interface. It can check the good links and bad ones in a web page. It has the
functionality for checking a site, saving the checking result, canceling current check and so on.
It differentiates external/internal links, for which internal link sites are recursively checked.
SYSTEM SPECIFICATIONS:
The system on which the project developed has the following configuration.
HARDWARE SPECIFICATIONS:
Main Memory : 64MB.

MicroProcessor : Pentium –III.
Hard Disk Drive : 4.3 GB.
Cache Memory : 512KB.
SOFTWARE SPECIFICATIONS:
Operating System : Windows 98/NT.

Front End : Java ,Servlets,Jsp,
1. Bug Tracker
ABSTRACT
The project is a developed based on the standards of the coding used by the developer is
tested before giving to the client. System that interacts with the code developed bye the user.
Using this project any developer with minimal knowledge can easily check correctness of the
code easily without any errors.
Business Requirements Analysis

Before submitting to the client or hosting any site of the project should maintain a
testing tools. Here this developing system is based on this process only. This project will
maintain a database for each project, in that it maintains project code, bugs. Bug tracking
developers read these bugs and fix the bugs and update the same information in the bug
reports.
The following is the system developed for the above stated needs. An initial feasibility
study was conducted & a conclusion was arrived at that automating such a system would not
only achieve all the things mentioned above.
Hardware Specifications:
• Intel P-III Processor

• 64 MB RAM
• 40 GB Hard Disc
Software Specifications

Language : jsp,servlets.
BackEnd : Oracle
Fashion Studio
ABSTRACT
It seems that over the past few decades a new art form has emerged. This is an art
form that painters, writers and photographers dive into on a daily basis. A piece of art is
considered to be abstract when the image is not clearly defined or visibly noticeable in a
quick glance. The word abstract means “not relating to concrete objects but expressing
something that can only be appreciated intellectually.” This is a relatively new art form
that takes mundane objects and transfers them to the unknown. Abstract art is one of the
fastest growing fields of photography. A photographer is able to take abstract pictures of
people, landscapes, places, animals and much more. A photographer is given a broader
range to experiment abstractly when using a digital camera but a regular camera can also
be used. There are several hints to help you when taking an abstract picture.
First of all let us discuss what an abstract picture is. An abstract picture can be the
wheel of a tractor, a photograph of a blurred chess piece, a screen window, a solitary fork
sitting alone atop a table or the face of a person, unrecognizable and changed. Abstract
art allows the photographer to create new images that only they may see or to turn
ordinary objects into a spectacular work of art. A graduate student several years ago, who
majored in abstract photography, was told to take a picture of her car. The student then
took pictures of different parts of her car and then made a collage of the collection of
pictures in the shape of her car. This is considered an abstract piece of artwork. When
taking an abstract photograph of a person stop and think before you press the shutter
button. Look at the subject and pick out the physical features, traits or characteristics that
you want the abstract photograph to be composed of. If the subject has been through a
tragedy, photograph the eyes, to convey this weight of sadness. If a person is joyous or
laughing photograph their mouth in order to bring that joy and free spirit to the
photograph.
Abstract photography is great for artists who want to broaden and expand their
creative range. It is also wonderful for photographers who have a unique eye and find
beauty in things that are extraordinary. Next time you have you camera out fool around
with a few of these abstract ideas. You might just fall in love with this relatively new art
form.
There are 3 roles in this system namely,
1. Administrator Module
2. Model Module
3. Student Module
2. INTRODUCTION
What is Project allocation with Fashion Technology?
Fashion Technology is a one stop shop for all your fashion technology needs. FT
partners with small to medium fashion and apparel companies to supply support and
maintain all their IT needs. Fashion Technology offers more than just a product, it offers
service and experience. Fashion Technology believes that the project isn’t completed
when the fashion software is implemented. Ongoing training is a critical factor in long-
term business success.
3.4 H/W AND S/W REQUIREMENTS:
Server side:
Minimum 4GB Hard disk
P-IV processor or equivalent
RAM 512 MB
Jdk 1.6 installed in it
Client side: Any terminal with internet connection and a web browser.
SOFTWARE REQUIREMENTS:
Server side:
Jdk 1.6 installed in it.
Apache tomcat 4.1.36 –t installed in it.
Oracle 8i installed in it.
Client side:
Any Web Browser.
2. Smart City
ABSTRACT
India is the one among the fast growing countries. Every one can visit the country
throughout India. In the list of visiting places cities are the mostly visited places. Tourists are
come from different places and new to the city they don’t know about the cities, cultures of the
people, local language to communicate and how to approach. Tourist guides are the persons
who guide the tourists about the city like the visiting places, their importance and how to
approach by taking money from them. Tourist guides may cheat tourists for money by telling
lies and chance to rob them. In some cities they are not available.To overcome these problems
an efficient and powerful web application called SMART CITY has implemented.
This is the online application that provides brief information about the city by using
efficient web applications. To get the details about top restaurants, hotels, lodges, events online
SMART CITY is an efficient web application.
It provides every one detailed description about entertainment, museum exhibits,

monuments and memorials, movies, theaters, hotels, events for concerts and guides the visitors
with stories, events listings and theater listings.
SMART CITY also features arts and entertainment, attractions, recreation, festivals and
most famous devotional places. You’ll instantly get access to the information about the city and
provides you with all the information you need to know about the things in the city.
This system provides Lifestyle of the people in the city, Entertainment guide, latest
information on accommodation, food, sightseeing, shopping, social, cultural and tourist
information and is a comprehensive guide.
Users in this module are Admin and the information seeker. Admin can modify the
existing modules and add new modules. Whereas the information seeker can view the site only.
MODULES:
The different modules in this system are
 City culture
 Tourist places
 City branches
 Hospitals
 Educational institutes
 Entertainment
 City map
 Travels
City culture:
Provides information about the culture of the people in

the city
Tourist places:
This module contains the information about the popular tourist places
City branches:
Describes the most famous places in the city
Hospitals:
Provides information about the famous hospitals in the city
Educational institutes:
This module contains detailed information about the various educational institutions
Entertainment:
Contains all the information about the entertainment like movies, cultural
programmes etc.
Travels:
Detailed description about travels
Operating system : Windows XP/2000

Language : Java using Servlets and JSP
Backend : Oracle
Processor : Pentium II
Harddisk : 40GB
RAM : 128 MB
3. College Message System
ABSTRACT
College Messaging System represents a Technology based academic Student status

delivery system. It incorporates the Educational Institutions and interactive parent
communities. On-line Technology is an important development in delivering the educational
services. Integrated approach of the system enhances the image and reputation of the
Institution.
Like in our college, we have a very prevalent system for monitoring the student’s
presence in various classes. It often comes to our notice that many students abscond from
classes for various reasons and more often, this goes unnoticed by their parents. Therefore, in
our project we would like to develop and deploy a web based Messaging system, which would
automatically inform the corresponding parents about the absence of their ward through an
email to the parents email id or an SMS to the parents mobile.
CMS, which would store all the information about the students ranging from their
attendance to their corresponding semester marks and their fee details. The benefits of the
proposed system are that there would be ease in the attendance taking process, which would get
rid of the paper works and their respective calculations.
We get prompt information regarding the attendance of a particular student either it is
percentage for all classes or for each faculty. Finally, the auto generation of an email or SMS
regarding the absence of the student would keep the parents in notice, about their wards
presence in the college. The attendance system is based around tracking student absences, since
there should be fewer of them than presences. An attendance record is stored for a student
whether they are absent/present from college. No record is stored when they are present. This is
the easiest approach in terms of record entry. Attendant is an online database system, which
provides a straightforward way for departments to record attendance information about their
students
By using this system we can accept their attendance through biometrics device.
Modules in College Messing System:
1. Admin module
2. Parent module
3. SMS and E-Mail
HDD : 40GB
Operating System : Windows 2000 or Windows XP
Language : JAVA
BACK-END DATABASE : ORACLE
Scheduling and Dispatching Management System
Abstract
Development of a dispatching and scheduling software application using

advanced 3-tier client/server architecture. The software application will enable shuttle
operation management in real time. The system will have the ability to manage vehicle,
drivers and passenger information, define and manage vehicle schedules and fixed routes,
and so management reporting. In addition to operating a fixed route system, the
application also provides scheduled routing for residential and non-fixed hotel routes and
variable routing for load balancing. The web module will provide the capability to accept
reservation requests from the Internet.
Java With Swings
Databases: Ms-Access
H/W Requirements:
Processor : Pentium III or above
Ram : 256MB or Above
Hard Disk : 40GB or Above
4. Town online complaint system
ABSTRACT
The system deals with providing online support to the people who are facing problems
with various software technologies. Problems with the current system, there is a
communication gap between the customer and the organizations. People generally don’t
know the name of the sites of all organizations to post their problem.
Customer usually face some problem while posting the bugs occurred in different
software’s as they have to post their bugs to different sites individually and there is no
surety of quick response from the organization. Few organizations may not be interested
in responding to the customer problems.
So in order to overcome all these limitations and to meet all their requirements,
the current process is replaced with this application.
2.2.1 SOFTWARE USED
O/S Microsoft Windows 2000
Interface Tools :-
FRONT END HTML , Style Sheets
PROGRAMMING LANGUAGES Java , Servlets , JDBC
SCRIPTING TOOLS Java Script
BACK END Oracle 8i
SERVER Tomcat 4.0
2.2.2 HARDWARE USED

Server side: -
PROCESSOR INTEL PENTIUM PROCESSOR

SPEED 933 MHz
RAM 256 MB
HARDDISK 40 GB
FDD 3.5 Inch floppy drive that possess enough
backup capacity to maintain in case of
system crash
CACHE MEMORY 512 KB.

MEMORY 32 bit.
Input Devices:
KEYBOARD 101 Keys
MOUSE Samsung
Output Devices:
PRINTER TVS
MONITOR Zenith
Client side :-
PROCESSOR INTEL PENTIUM PROCESSOR
SPEED 933 MHz
RAM 128 MB or above
HARDDISK 10.3 GB or above
FDD 1.44 MB Floppy Disk Drive
CACHE MEMORY 512 KB.
MEMORY 32 bit.
Input Devices:
KEYBOARD 121 Keys

MOUSE Intel
Output Devices:
MONITOR Intel
5. Web Crawler
ABSTRACT
A web crawlers is a program, which automatically traverses the web by
downloading documents and following links from page to page. They are mainly used by
web crawlers engines to gather data for indexing. Other possible applications include
page validation, structural analysis and visualization, update notification, mirroring and
personal web assistants/agents etc. Web crawlers are also known as spiders, robots,
worms etc.
Web crawlers’s start by parsing a specified web page, noting any hypertext links
on that page that point to other web pages. They then parse those pages for new links, and
so on, recursively. Web-Search software doesn't actually move around to different
computers on the Internet, as viruses or intelligent agents do. A Search resides on a single
machine. The Search simply sends HTTP requests for documents to other machines on
the Internet, just as a web browser does when the user clicks on links. All the Search
really does is to automate the process of following links.
Web crawlersing speed is governed not only by the speed of ones own Internet
connection, but also by the speed of the sites that are to be Searched. Especially if one is
a Searching site from multiple servers, the total Searching time can be significantly
reduced, if many downloads are done in parallel. This work implements the “Breadth
First Searching” algorithm, a refined version of one of the first dynamic Web crawlers
algorithm, In order to build a major search engine or a large repository such as the
Internet Archive, high-performance Search start out at a small set of pages and then
explore other pages by following links in a “breadth first-like” fashion.
Operating System : Windows NT/ Windows 98
Language : JAVA
H/W REQUIREMENTS:
Processor : Pentium III or Above
Software Resource Planning Tool
ABSTRACT
A method for the project engineering of an automation system is provided. An existing
project is opened or a new project is created in a project engineering software tool.
A project manager, who serves as supervise the work of a project team. The manager
oversees not only the people and technology involved, client information, time and money
constraints and quality of the work. In this automation system project manager is a
administrator who assign the project to team and monitor the progress of work.
Modules in PAS
Administrator Module
Manager Module
Team Member Module
Software Spefication
JSP,Servlets
Oracle 10g
125.Spam Mailing Detection System
Abstract
Spam Mailing System
Spam is a growing problem for email users, and many solutions have been proposed,
from a postage fee for email to Turing tests to simply not accepting email from people
you don't know. Spam filtering is one way to reduce the impact of the problem on the
individual user (though it does nothing to reduce the effect of the network traffic
generated by spam). In its simplest form, a spam filter is a mechanism for classifying a
message as either spam or not spam.
There are many techniques for classifying a message. It can be examined for "spam-
markers" such as common spam subjects, known spammer addresses, known mail
forwarding machines, or simply common spam phrases. The header and/or the body can
be examined for these markers. Another method is to classify all messages not from
known addresses as spam. Another is to compare with messages that others have
received, and find common spam messages. And another technique, probably the most
popular at the moment, is to apply machine learning techniques in an email classifier.
The Spam filter implemented is used to block spam also called unsolicited email. It uses
statistical approach called Bayesian filtering to block the spam. First of all
the program has to be trained using a set of spam and non-spam mails. These are put in a
database. The performance increases with the number of training it gets. When a new
mail comes it is tokenized and probability of each word is found by looking into the
database. The total probability is found out and if it is greater than 0.9 it is marked as
spam. With good training it can block 99% of the spam mails with 0 false positives.
Bayesian Filtering In a nutshell, the approach is to tokenize a large corpus of spam and a
large corpus of non-spam. Certain tokens will be common in spam messages and
uncommon in non-spam messages, and certain other tokens will be common in non-spam
messages and uncommon in spam messages. When a message is to be classified, we
tokenize it and see whether the tokens are more like those of a spam message or those of
a non-spam message. How we determine this similarity is what the math is all about.
It isn't complicated, but it has a number of variations.
Theory of Operation Probabilities in this algorithm is calculated using a degenerate case

of Bayes' Rule. There are two simplifying assumptions: that the probabilities of features
(i.e. words) are independent, and that we know nothing about the prior probability of an
email being spam. The first assumption is widespread in text classification. Algorithms
that use it are called "naive Bayesian.' If spammers get good enough at obscuring tokens
for this to be a problem, we can respond by simply removing white space, periods,
commas, etc. and using a dictionary to pick the words out of the resulting sequence. And
of course finding words this way that weren't visible in the original text would in itself be
evidence of spam.
Language : Java using JSP
Web Server : Apache Tomcat 6.0
Backend : Oracle 9i o 10g
Web Browser : ie,firefox,chrome
Scripting Language : Java Script
Web Designing : HTML,CSS
Harddisk : 40GB
RAM : 128 MB
. Student Project Allocation And Management With Online

Testing
ABSTRACT
This project is aimed at developing a web-based system, which manages the
activity of “Student Project Management” and “Online Testing”. This is a system used by
Educational Institutions or other organizations, which are willing to give student
projects. This system will manage the database and maintain a list of all student groups
that have registered on this site, conduct their online test and shortlist those students who
have passed the eligibility criteria as set by the professors.
EXISTING SYSTEM AND ITS DRAWBACKS:
Today, student testing system is being done from classroom level. It includes lot of
manual work. Depending on the result, he allocates the project to the student. This
involves lot of manpower and consumes time, like evaluation of the paper, setting the
paper, maintaining the records of the student, and security. This may some times prove to
be costly.
PROPOSED SYSTEM AND ITS MERITS:
We find the need for the student management system to be computerized which
results in the reduction in the manual work and reduces time. Since the whole system is
computerized, the evaluation of the paper is done automatically. Then depending upon
this result, the projects are allocated to the students. A new module by name Admin has
been proposed in our project, which controls the system.

Web Server : Apache Tomcat 6.0
Backend : Oracle 9i
Web Browser : ie,firefox,chrome
Scripting Language : Java Script
Web Designing : HTML,CSS
Harddisk : 40GB
RAM : 128 MB
AdXpress
Abstract
AdXpress is the largest single source of online intelligence for marketing,
advertising, media and research communities worldwide. AdXpress offers a
FREE World Advertising and Marketing News email service, ensuring the top
global stories are delivered daily to your inbox. Our free classifieds will expose
your ads to local, regional and national buyers in different countries across
the globe. AdXpress is a full featured classified ad manager website.
AdXpress is designed to seamlessly integrate ads in this website.
Our AdXpress ad web site is organized using an easy-to-follow index so that
you can locate the classified ads you're interested in quickly and easily. We
hope you'll enjoy your visit and you will opt this site for placing the ads
forever and you will definitely add our site as a bookmark in your web
browser. Please come back and visit us again soon.
Welcome to AdXpress. We are pleased to be able to offer you free classified
advertising over the Internet. AdXpress splits your screen up into various
sections. At the home page there are list of menu options. These allow you to
go straight to a category you want by navigating through the sub options.
Existing System:
Here the existing system is nothing but manual traditional new paper systems
in which we can post the ads then the customer of new paper can only see these
details. In this system the company will store the business information in a record
which is not safe. We need assign the tasks and get status of the tasks from an
employee manually.
Disadvanatges:
 Ad info can accessible for the customers of our new paper

 Allows to post limited no of ads
 Difficulty in managing different ads in different categories
 Difficulty in updated the new links for each and every time
 Difficulty in updated the yellow pages information
 Difficulty in managing daily business activities of the company
 Difficulty in tracking the tasks.
Proposed system:
Here the proposed system is to replace an existing system with
a software solution using which we can post the ads in a classifieds portal sothat the
customer this info from online by sitting at the home. Apart from it we can also post
links and yellow pages information. We can track the tasks related to our ad business
very easily from online.
Advantages:
1.Posting the ads in a portal which the customers can access from online
2.Posting new links and yellows info which the customer can utilize from
Online
3.Allows to company to efficient manage their tasks
4.Allows the company to manage their agents and observe the business
5.through an agent.
6. Allows to categorize the ads which customers to find out the
Information
7. Very easily
HARDWARE AND SOFTWARE REQUIREMENTS
Processor : Intel 2.0 GHz or above

Hard Disk : 80 GB
RAM : 512 MB RAM.
SOFTWARE : JDK1.5.0,
Apache Tomcat 5.0.25,
MYSQL 5.0
OPERATING SYSTEM : WINDOWS XP with SP2
Broadwalk
ABSTRACT
The project entitled “BROADWALK REALERS NETWORK” is developed for

organization of “NAVEEN TILES Pvt. Ltd” located in Rajastan.The developed
system helps the organization to receive orders through online for product tiles that
can be supplied by the organization.
This Activity includes three modules customers,dealers and administrator.Customer
module facilitates the customers to place order through online,and can view
catalog information provide by organization.In this module each customer order
will be verified to determine whether author dealer existing in the area specified
by customer.If dealer existing then the customer order will be redirected to
corresponding dealer otherwise those orders will be registered as direct customers
orders to Administrator.
Dealer module facilitates authorized dealers to customer orders status in their
area,to place order ,to manage their details in Administrator records.
Administrator module facilitates the Administrator to view direct customers order
status,dealers order status and also to maintain transport charges info and products
catalog information.Administrator can also appoint new Dealer and remove existing
Dealer.
The project developed on platform windows98 using software HTML,JSP,JDBC,
JavaScript, JavaMail and jdk1.4 with backend database Oracle 8.0.
Operating System : Windows xp
Client Side : HTML,JavaScript.
ServerSide : JDK 1.5,JSP2.1,JAVA MAIL 1.1.3
Back-end : Oracle 10g
Server : Apache Tomcat 5.0
PROCESSOR : Pentium 2 366mhz
Monitor : SVGA Color monitor
HardDisk : 10GB
RAM : 32MB
Mouse : Digital
Keyboard : 105 keys digital
Contelligent
Abstract
Contelligent is a component-based Web Content Management
solution. This system is based on the convenience of the students
to communicate with the resources provided by the COMPUTER
AIDED LEARNING TOOL section of the university.
This project is aimed to provide services to students over

Internet, each student is given with a unique id and as the student
logs on into the system he will be given access to anonymous
number of sections.
The different sections that are involved in this system

are:
1. Lecture notes
2. Assignment
3. Exam Time table
4. Library
The services provided by these sections are:
Lecture notes section deals with the notes of all the
professors in the college depending on the subject they
deal with. These notes are divided based on the subject,
particular professor and on particular year and course.
Assignments section is further divided into two sections
namely assignment and repeat assignment. The difference
is that assignment deals with the assignments for fresh
students who are doing them for the first time and repeat
assignment are for the students who are doing the
assignment as a repeat.
E x a m Ti m e Ta b l e s e c t i o n g i v e s t h e i n f o r m a t i o n o f t h e
examination timetable of a course. This section is updated
a c c o r d i n g l y.
Library is a special section. This section deals with all the
books in the library and their management. This section
further divided based on the different categories like
computers, business, finance, and accounts…. The status
of the book i.e. if that particular book is available or not
is displayed.
The system uses 2 different types of users 1.
administrator 2. Normal user (student) 3. Faculty 4.
Corporate User
Required Hardware:
 Pentium IV Processor.
 256 MB RAM.
 80 GB Hard Disk space.
 Ethernet card with an Internet and Internet zone.
Ezeemerchant
ABSTRACT
The popularity of interactive media such as the World Wide Web
(WWW) has been growing at a very rapid pace (see, e.g., GVU 1999).
From a marketing perspective, this has manifested itself primarily in
two ways:
1. A drastic increase in the number of companies that seek to use

the WWW to communicate with (potential) customers, and
2. The rapid adoption of the WWW by broad consumer segments
for a variety of purposes, including pre purchase information
search and online shopping.
The combination of these two developments provides a basis for

substantial growth in the commercial use of interactive media for
shopping called Online Shopping.
We conceptualize this behavior as a shopping activity performed by
a consumer via a computer-based interface, where the consumer’s
computer is connected to, and can interact with, a retailer’s digital
storefront (implemented on some computer) through a network (e.g.,
the WWW). A consumer can engage in online shopping in any location,

and they can compare the prices and they can buy the product without
face-to-face assistance to the shopper. This reduces the time and it is
the solution for the to overcome the traffic and pollution problems in
metropolitan cities.
While making purchase decisions, consumers are often unable to
evaluate all available alternatives in great depth and, thus, tend to use
two-stage processes to reach their decisions. At the first stage,
consumers typically screen a largeset of available products and identify
a subset of the most promising alternatives. Subsequently, they
evaluate the latter in more depth, perform relative comparisons across
products on important attributes, and make a purchase decision. So
this application provides a facilty to do this to
greater extent.
The shopper can take the decision to improve the business

depending on the current customer rate and their bills. To satisfy the
customer needs the online shopping cart system comes to the door
step of very customer through online and provides all the facilities
what the customer faces when he shops manually. The shopper can
store the Day to day transactions in the database and so that he can
go back to any earlier transaction and he can check it.
The customer can see the status of goods delivery also by sitting
at home. The shopper can also see the delivery status and can deliver
goods to undelivered customers. Shopper can generate the user-
friendly reports to analyze the business statistics. Shopper can
maintain the list of categories, list of products in a category, list of
orders, order tracking and payments through user-friendly screens.
The customer has the tendency to pickup as many items
irrespective of their needs. To avoid this the EzeeMerchant system
provides a facility called cart so that the customer can check the items
he has selected and what is the amount at a particular point time and
he can take the decision to continue shopping, stop shopping or
remove unnecessary goods. High security will provided for each and
every customer by providing customerID and password which is
generated through customer registration facility.
Ultimately the EzeeMerchant System caters all the user needs
through online.
4.2 Proposed System:
This system allows the customers to register on their own after
reading the license agreement. After registration each user will receive
username and password using which the customer can shop different
products and place it in a cart. The customer can check the items in
the cart at any point of time and he can confirm the order and pay the
bill using credit card. The shopper can manage different categories,
products and the cart. He can also see the customer orders and
confirm the order to deliver the good. The customer and the shopper
can track the orders at any point of time. The main features of this
system:
1. The user can shop the different branded items under one roof.
2. The shopper can change the any page dynamically with out
touching the source code.
3. The shopper can change different processing charge values
dynamically.
4. The shopper can check the credited amounts and select different
options to confirm the orders or else send the mails to customers
using manageable email templates.
4.4 Software Requirements Specification
4.4.1. Introduction
Purpose:
The purpose of this project is to handle Human Resources
of an organization.
Document Conventions
All the main heading are in BOLD and underlined.
Error message will be denoted using a (!) prefix. The steps in the
document follow Software Development Lifecycle methodology.
4.4.1.3. Product Scope
The scope of the project is limited to a single organization.
4.4.1.4. Reference
Java Server Programming J2EE edition – wrox.
J2EE Complete reference -McGraw Hill.
MySql 5.0
Java Servlet Programming –Oreilly.
4.4.2. Operating Environment
• Operating System
Windows 2000server and professional
• Hardware platform
Pentium 4 processor
256 MB RAM
• Software specifications
J2SDK 1.4
J2SDK 1.4 J2EE
MySql 5.0
Microsoft Front Page Express

Internet Explorer
Tomcat 4.0
James Server
Required Software
 Windows 2000/ XP operating system.
 Internet explorer 5.0 and Netscape navigator.
 MySQL Server.
 Java/J2EE.
 Web Server as Tomcat.
Loan Amortizer
ABSTRACT
The life of a person is so hectic that he has to look after
his family affairs as well as grow along with the rest of the society. In this
struggle, sometimes he has to go for a loan to make small purchases for his
family and repay the loan as per the schedule. In this case, small companies
lending the loan on easy installments would be his choice. Loan Amortizer is a
software that enables a lending company like Citi Financials, Fullerton etc to
promote a transparent and secured environment in lending the loans as well as
their recovery process.
The administrator of this software can just view the information besides adding
new users and employees and changing their passwords. Thus he cannot
interfere with the loan process or payments. This part is dealt by manager who
has authority to issue the loan to an individual. He can provide information on
which type of loan being issued and to whom.
Accountant and agents of the finance company can view all the details of the
customer. When a customer makes a payment, they can store the payment
details into the database. Thus, Loan Amortizer is an online software application
which fulfills all the requirements of a typical finance company. It provides the
interface to users in a graphical way to manage the daily transactions as well as
historical data. The users can provide a clear picture to the customers regarding
how much is already paid and how much is still pending. By extending this
software, it is possible to make the customer to directly view his transactions
right from beginning. This will eliminate any mischief played by any third party
person. Also provides the management reports like Released Loans, Payments,
Rejected Applications, Submitted Papers and Finance Report.
This application maintains the centralized database so that any changes done at
a location reflects immediately. This is an online tool so more than one user can
login into system and use the tool simultaneously.
The aim of this application is to reduce the manual effort needed to manage
transactions and historical data used in a finance company. Also this application
provides an interface to users to view the details like the Released Loans and
Finance Report etc.
Technologies used: J2SE, Servlets, JSP, JDBC and Java Script.
4.4.2. Operating Environment

• Operating System
Windows 2000server and professional
• Hardware platform
Pentium 4 processor
256 MB RAM
Transport Plus
ABSTRACT
It is every company’s need to see the welfare of its
employees by providing transportation for the employees to attend their duties
successfully. This is the reason many MNC companies maintain their own fleet
and sometimes takes the help of third party transport systems also. When
several employees wish to utilize the bus services provided by the company,
naturally the company employees need a system to allot the buses and oversee
the transportation. Transport Plus is a software that quenches this need.
Transport Plus has four types of users. The administrator
of this software will be able to create new users and change the passwords. He
can add or update the employee information in the company. He can add and
view the information of Transport categories and also available routes.
Depending on the users’ demands, new route and also new pick up points can be
added to the database. Beyond this, the administrator can also act as a normal
user and book a bus or cab for himself. He has authority to place a cab request
or cancel a request for a bus. This system calculates fare depending on three
categories: short distance, medium and long distance and the fare would be
deducted from the employees’ salaries.
When an employee of the company wants to avail the
transportation facility, he will forward a request which will be approved by the
administrator depending on the availability of room in the bus. When an
employee wants a cab, it will be arranged by the approver and later depending
on the recommendation of the project manager the charge may or may not be
deducted from the employee salary.
Approver is another user of this system. He can view the
details of transport categories, routes and pick up points. He can approve a
request for a cab from an employee and store the information of assigned cab.
The transport people can view all the information related
to who are the employees utilizing the transportation. They can take a decision
to approve or disapprove the requests placed for transportation. They can
arrange a cab physically for the employee and send the cab details to the
employee who placed the request.
Users and guest users are employees who want to use
the transport facility. The users can place their request for a bus to reach the
company or for a cab when they want to go to a different place. These requests
are approved or declined by the transport people or project manager.
This application has rich user interface so that novice
users can access easily. This application provides the management reports like
Occupancy report, Approval status report, to track the usage of company’s

transport facility as well as cab facility.
CURRENT SYSTEM:
Current system is a manual one in which employees has to submit their

applications for transport facility as well as for cab facility. Employees has to
follow up regularly with transport personnel to know the status of their requests
which is time consuming and hectic.
Disadvantages:
The following are the disadvantages of current system
1. It is difficult to track the occupancy.
2. More manual hours need to generate required reports
3. It is tedious to track the details of cabs provided by third party.
4. There is no possibility to track the approvals of requests.
5. No co-ordination between various departments.
PROPOSED SYSTEM:
Proposed system is a software application which avoids more
manual hours that need to spend in record keeping and generating reports. This
application keeps the data in a centralized way which is available to all the users
simultaneously. It is very easy to manage historical data in database. No specific
training is required for the employees to use this application. They can easily use
the tool that decreases manual hours spending for normal things and hence
increases the performance.
Advantages:
The following are the advantages of proposed system
1. Easy to process requests

2. Can generate required reports easily
3. Easy to manage historical data in a secure manner
4. Centralized database helps in avoiding conflicts
5. Easy to use GUI that does not requires specific training.
6. Implementation of approval process is very easy
7. Occupancy tracking helps in decision making
Technologies used: J2SE, Servlets, JSP, JDBC and Java Script.
COMPUTER AIDED LEARNING TOOL
ABSTRACT
Education has become a part of every human. There are several types of education
systems presently running. COMPUTER AIDED LEARNING TOOL is one of the education
systems that are under process long before but only committed to the University.
COMPUTER AIDED LEARNING TOOL is an out classes study that allow you to
educate when you have a desire and time. A chance to study in any place you like, during your
summer vocations or while some other activities. The only thing is that you should be provided
with all the necessary materials.
This system maintains all the course details so that the users of this system after
registration views the list of the course details and also the scheduled course details. After
finishing the course the user will test his performance by attending an online examination
followed by a question and answer and finally when he finishes the exam there instantly
system display his marks which he scored.
COMPUTER AIDED LEARNING TOOL is developed in a web based technology with
backend as Oracle Server. This system helps the user to not waste his time in distance training
education when compared to remote education and finally he could instantly view the marks
which he scored in the online exam.
S/W Requirements:
Technologies : Java, J2EE (JDBC, Servlets, JSP)
Database : Oracle 9i
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
E-School
ABSTRACT
The project entitled as “E-SCHOOL” helps the school/college management to
communicate the details of the attendance, marks, cultural activities and other
information to the students/faculty/parents through Mail/SMS. This system makes use of
threads to calculate the attendance.
Then by generating reports on each day it will identify the students who have less
percentage of attendance than the required aggregate percentage. It sends the messages to
the mobiles of the parents about the attendance and marks details. Apart from this
whenever the parent’s want to know about their children’s attendance and marks they can
directly login into the site or they can send message to the administrator by giving that
particular student’s registration number and they can get return message.
Current Scenario
In the existing system, the details of the students regarding their attendance and
marks are being maintained in the database and a print of it is made and sent to parents by
post monthly once. The problems here are:
• More manual work
• Chance of missing the letters through post
• Consumes more time
Proposed System
This system helps the college to communicate the details of the attendance and
marks to the parents through Mail/SMS. By generating reports daily, weekly, monthly it
will identify the students who have less percentage of attendance than the stipulated
attendance percentage and send SMS and Mails to the parents.
Salient Features:
• Fast and accurate report generation
• Send attendance reports to parent’s mail

• Easy, interactive GUI
• Two way Communication through mails

User Interface : HTML, CSS, jsp
Client-side Scripting : JavaScript
Web Applications : JDBC, Servlets, JSP, JavaMailAPI
IDE/Workbench : Net beans
Database : Oracle 10g
Server Deployment : Tomcat5.5.9
Hard Disk : 40GB
RAM : 256MB
Organizational Internal Survey

Abstract
Organizational Internal Survey supports multiple chatrooms. You can open
new chatroom by following “open a chatroom ” link. You can manage a chatroom by
selecting the chatroom in the list box named “ Manage Chatroom ”. You can backup all
the chatrooms by following “Backuphatrooms” link.
You can add/remove/update moderators. A moderator is defined by an
username(login), a password and an email. Email field is not mandatory. Links between
moderators and chatrooms could be configuered in chatroom forums . In addition to
chatrooms could be configuered in chatroom forums. In addition to chatroom’s
moderation (kick off, ban,transcript,….) a moderator can open many new chatrooms.
However moderators cannot backup chatrooms, modify Organizational Internal Survey
system properties , and add /remove/ update other moderators.
Totally you have the control over chat rooms,users , systems properties to change..
DisplayMode: There are four ways to display chatroom’s content (i.e chatrooms
clients). It could be in an html/javascript page,an applet , a java application or in a
MacroMedia flash5 client.So for html/javascript clients,you have to choose between
Framed(jsp) or Buffered –Framed(jsp) modes.Buffered-Framed one is optimixed to lower
flickering effect.
System Analysis
Existing Systems:
There is no existing system. Here we have developed this application

just to provide chat rooms to chat different kind of moderators. This is
a system provides all the basic features pf a ChattingSystems.
ProposedSystems:
The first step of analysis process involves the identification of need.
The success of a system depends laragely on how accurately a
problem is defined thoroughly investigated and properly carried out
through the choice of solution .
Software Requirements :
Operating System : Windows XP/2003 or
Linux
Web Applications : JDBC, Servlets,
JSP,XML
Back End : Flat File System(XML)
Font End : JSP,Servlets,Html
Hard Disk : 40GB
RAM : 512MB or more
Web shopping
ABSTRACT
Web shopping
Web shop is the process consumers go through to purchase products or services over the
Internet. An online shop, eshop, e-store, internet shop, webshop, webstore, online store,
or virtual store evokes the physical analogy of buying products or services at a bricks-
and-mortal retailer or in a shopping mall.
The metaphor of an online catalog is also used, by analogy with mail order catalogs. All
types of stores have retail web sites, including those that do and do not also have physical
storefronts and paper catalogs. Webshop is a type of electronic commerce used for
business-to-business (B2B) and business-to-consumer (B2C) transactions.
Contents
Benefits of Webshopping
1. Bargaining power of consumers. They enjoy a wider choice

2. Supplier power. It is more difficult for consumers to manage a non-digital
channel.
3. Internet increases commoditization
4. Threat of new entrants. Online means it is easier to introduce new services with
lower over-heads
5. Threat of substitutes
6. Rivalry among competitors. It is easier to introduce products and services to
different markets
Overview of the System

Finding products
There are a few ways for you to locate the product that you are looking for:
View
You will find a View List option on the client services page web shopping web
site, where you can view the name (or part of the name) or the product code of any
product. This will view the products that matched your search criteria.
Category Navigation
On the left and top of on web shopping you will find 'client'. By clicking on you can log
into respective product surfing where all products will be listed related to the category
you chose. On the page you will find view items and purchases.
Brand Navigation
Requesting Products
If you cannot find a product that you are looking for, you are welcome to send
your feedbacks and we will either send you a link to the specific product or we will try to
source the product that you are looking for and add it to the web site.
How to buy a product
On purchase Items page you will find a “Purchase” button. When you click on
this button your product will be added to your shopping list, and you will be redirected to
your purchases list, where you can amend your product selection, by removing it from
your list or by changing the quantity that you wish to buy. You will also be able to see
what is currently in your list by looking at the purchases list.
After the product has been added to your list and you are happy with your selection,
you can click on the “Bill” button. This action will redirect you the Secure Online Web
Shopping web site. Web Shopping will allow you to complete your sale.
New Users:
If you have shopped at any Web Shopping enabled store in the past, you will
already have a web shopping account, and you would be able to login using your Web
Shopping Account. If you are unsure if you have a web shopping account, you can
register your by click on the “sign in new user” link, this will tell you if you are
registered.
Non Registered Users:
If you have not yet registered at any web shopping enabled store, you can
complete the form provided. This will allow web shopping to know who you are and
where to ship your products.
When your order is ready to be shipped you will receive another bill to notify you
that your order is completed. At this stage the funds will no longer be reserved on your
account, and will be moved from your account to our account.
If you need to cancel your order, you can do so by visiting to Web shopping
outlets, selecting the relevant order, and clicking on the “Remove Item” link at the
bottom of your purchase list page. Just note that you can only cancel an order if the order
has not been shipped yet.
Direct Deposit Payments
You need to allow up to 7 days from the date your order was placed for your order to be
shipped. We have 3 Shipping options available, and you will be asked to choose one
when you are on the Web shopping payment web site. The 3 shipping options are:
Remote Locations
Remote locations are any area that does not fall in the Web shopping outlet city
limits.
Web shopping’s Best Buy of the day
Web Shop will be putting a new product on special every day, at prices that have
never before been seen in India. The special will however be valid for just one
day, and be replaced by another product the next day. You can also subscribe to
our Suggestion box to stay up to date of the specials that we are running.
Suggestions
By visiting our Suggestions section, you can subscribe to any of our exciting
search for items, and they will keep you up to date of the latest happenings on
Web shopping.
Software and Hardware Requirements

Software requirements
Operating system: windows 98, MS-DOS
Backend : ORACLE 8.0
Language : Java2.0(JDBC) Java script, JSP
Driver : Micro Soft ODBC for oracle.
Browser : Internet Explorer4.0
CPU : Pentium 2.0
RAM : 32 MB
Hard disk : 1.74MB
Monitor : SVGA color monitor
Keyboard : 105 standard and mouse.
Server : Any Java enabled web server.
E-Talk
Abstract:
E-Talk supports multiple chatrooms. You can open new chatroom by following “open
a chatroom ” link. You can manage a chatroom by selecting the chatroom in the list box
named “ Manage Chatroom ”. You can backup all the chatrooms by following
“Backuphatrooms” link.
You can add/remove/update moderators. A moderator is defined by an username(login), a

password and an email. Email field is not mandatory. Links between moderators and
chatrooms could be configuered in chatroom forums . In addition to chatrooms could be
configuered in chatroom forums. In addition to chatroom’s moderation (kick off,
ban,transcript,….) a moderator can open many new chatrooms. However moderators
cannot backup chatrooms, modify E-Talk system properties , and add /remove/ update
other moderators.
Totally you have the control over chat rooms,users , systems properties to change..
DisplayMode: There are four ways to display chatroom’s content (i.e chatrooms clients).
It could be in an html/javascript page,an applet , a java application or in a MacroMedia
flash5 client.So for html/javascript clients,you have to choose between Framed(jsp) or
Buffered –Framed(jsp) modes.Buffered-Framed one is optimixed to lower flickering
effect.
Existing Systems:
There is no existing system. Here we have developed this application
just to provide chat rooms to chat different kind of moderators. This is
a system provides all the basic features pf a ChattingSystems.
ProposedSystems:
The first step of analysis process involves the identification of need.
The success of a system depends laragely on how accurately a
problem is defined thoroughly investigated and properly carried out
through the choice of solution .
Software Requirements :
Operating System : Windows XP/2003 or
Linux
Web Applications : JDBC, Servlets,
JSP,XML
Back End : Flat File System(XML)
Font End : JSP,Servlets,Html
Hard Disk : 40GB
RAM : 512MB or more
62. Telecom Inventory Maintenance System
Abstract
The project entitled “Telecom Inventory Maintenance System” deals with fully
automated system used by the Telecom department.
Telecom industry is one of the major sectors, which provides so many services to
their customers such as request for a new connection, change of number, billing etc.
Maintaining all these services manually is complicated process.
The main objective of this project is to automate the services provided by
telecom system, by which customer can use all the services online.
This project has been divided into four modules.
1. Applications
2. Entries
3. Enquiries
4. Complaints
The Applications module provides following services.
• A customer can apply for a new telephone connection by filling the form.
• He can request for transferring phone connection to another location.
• He can modify the mode of bill payment details.
• He can also cancel his phone connection.
The Entries module provides following services.
• If the customer requested for change of telephone number, here if we
enter the old number, it will display the new number.
The Enquiries module provides following services.
• The customer can make a request about his bill.
• He can also know the information about changed numbers.
• He can also ask about the status of his applications.
The Complaints module provides following services.
The customers can complaint regarding the service and all other issues
Existing System:
The existing system is a manual one where the entrant has to go to the Telecom
Connection System and get details of the company for getting the new connection. Here
it is getting a tedious one for the user to go and manually register with it. And in the
process only a few users are take the connection. To overcome this they have proposed
for the online Connection.
Problem Statement:
The previous system was a manual system. So, the system is not available to all
globally. To make the system available globally, it is now proposed to be web enabled.
In the existing manual process entrants cannot get the information of all the
telecom system where by registering with Telecom Connection System they can get the
updated share values and also since the registration process is atomized, participation in
Connection is easy to the entrants.
Proposed System:
The proposed system is the online registration of the entrants with the company.
By atomizing this Connection process, the entrants enjoy the facility to participate from
anywhere. Entrants can also get the information online about all the telecom system. By
this process the user can get all the information of the Connection process from where
ever he wants as there is no need for him to come to the office and register for
Connection. Thus the proposed system is efficient all the way.
1 HARDWARE AND SOFTWARE SPECIFICATION:
Hardware Environment:
The selection of hardware is very important in the existence and proper working of
any software. In the selection of hardware, the size and the capacity requirements are also
important.
The Web Based Manufacturing System can be efficiently run on Pentium system
with at least 128 MB RAM and Hard disk drive having 20 GB. Floppy disk drive of 1.44
MB and 14 inch Samsung color monitor suits the information system operation.(A Printer is
required for hard copy output).
Processor : Intel P-III based system
Processor Speed : 250 MHz to 833MHz
RAM : 256MB
Hard Disk : 40GB
Software Environment:
One of the most difficult tasks is that, the selection of the software, once system
requirement is known is determining whether a particular software package fits the
requirements. After initial selection further security is needed to determine the desirability of
particular software compared with other candidates. This section first summarizes the
application requirement question and then suggests more detailed comparisons.
• Operating System -- Windows 95/98/NT/2000

• Browser -- IE
• Web/Application Server -- Tomcat Server
• Database -- Oracle
• Database Connectivity -- JDBC
• Java Technologies -- Java (Servlets, Jsp)
• Scripting Technology -- JavaScript
Project Automation System
ABSTRACT
Modules in PAS
Manager Module
Team Member Module
JSP,Servlets
Oracle 10g
Work Flow Management System

Abstract
Work Flow Management System is customer care management system.
Work Flow Management System is called as Edesk or Help Desk System. It is so
called as Help Desk System because it tries to solve all the HD (helpdesk)
problems, which are coming from the users of Ecare.
Work Flow Management System will take care of every request coming
from their users and try to solve and produce the solution of the particular request.
Work Flow Management System also will store the responses for the future use.
Work Flow Management System contains six main members who play very
important role in this Help Desk System. They include super user, level1
administrator, level2 administrator, level3 administrator, corporate client user and
corporate user (or end-user).
Super user is the chief head of the organization that assigns first
level, second level, and third level administrators. The super user is responsible
for all the three level administrators including the corporate clients. The Super
user is the sole person who is responsible for creating categories, modules and
the support team.
Super user creates new categories only if HD problems don’t belong
to those categories present in Work Flow Management System and similarly with
the creation of modules. When the super user creates new categories and modules
he will label these categories and modules as levels and appoint one administrator
for each of them. When the super user gets the HD problem as request he can
modify the request or can answer it by sending solution to the level3 or the support
team who is responsible for messaging the response or the solution to the end-user
(corporateuser).
Corporate client is the one who buys Work Flow Management System
product for his business purpose. He can create corporate users for his product.
Corporate user is the one who has to register himself to the corporate client before
he submits the HD problems to the super user and corporate user is the actual end-
user of the product or service.
Corporate user will register to the corporate client and corporate client
sends all the registration details to the super user, and after the registration the
end-user will submit the HD problems to the super user. When the super user
gets the HD problems he will check the details of the end-user and send the
responses to the support team who will message the responses to the corporate
users.
Work Flow Management System is very useful for the corporate clients
who want their business to extend world wide i.e., by keeping contact and good
relation with the corporate users who buy their products. The corporate clients
who buy Work Flow Management System for their business can know what are
the various problems of their product which are coming from their users so that
they improve their products to the user needs. Any user who knows a little about
of the computer can handle Work Flow Management System
Jsp,servlets
Oracle10g.
Harddisk : 40GB
RAM : 128 MB
E-Bank
ABSTRACT
The main objective of this proposed system is to online all
the activities of a bank. The system is like to enable the bank employees to open accounts
for their customers with ease and to add the details, to transfer amount from one account
to another account and doing all the activities related to loan, making all type of
transactions. Using the system employees can also generate different types of modules.
• Add Acct Type Information

• Add Loan Detail Information
• Create New Accounts
• Transaction (Deposits, Withdraws and Loan Payments)
• Issue Loans
• Generate Reports .
Using the system client can also generate different type of modules.
• Check Account Types Information

• Check Loans Information
• Check Balance Amount
2.3 PROBLEM SPECIFICATION

2.3.1 Existing System:
The existing system is a manual process. Numerous accounts are
to be maintained: 1) Maintain Records for each Account. 2) Note Deposits and
with draw transaction for each account 3) Maintain Loan Records And 4)
Maintain DD’s Records. The existing system to be maintains lot of paper work
information’s. When any statistical analysis is to be carried out, for example: a
comparison of the past year’s deposits or withdraws with that of the current
year, it is also a laborious task of referring to many record books, compiling
lists, and carrying out the analysis work.
2.3.2 Problems With Existing System:

• Lot of space is required to store all the details of the candidates and
the Companies.
• Data is spread across a number of record books, which
have to be manually integrated to arrive at a solution.
• The system is prone to human errors. Detection of errors is
a difficult task since every thing is done manually.
• Tracking of errors to their origin is difficult
• There is no security to data. Any one can view through the
data concerning the activities of the Consultancy
• Any modification to the data requires searching through all
the records and then making the relevant changes.
• The process is very time consuming.
2.3.3 Proposed System:
Manual processing of data is very tedious and time
consuming and leads to erroneous results, at times. In order to overcome
these snags computers are being used extensively in all fields thereby
minimizing manual labor and errors to a great extent.
Taking all the advantages involved in computerizing, the proposed system “ Net
Banking System” integrates all the manual activities by linking them under a single
head. This System processes the day-to-day activities and generates tender reports that
help the user to get a good grasp of the situation(s) and take decisions quickly and in-
time.
HARDWARE SPECIFICATIONS
Processor : Intel Pentium III or Above
Ram : 256 MB or more

Cache : 512 KB
Hard disk : 16 GB hard disk recommended for primary partition.
2.4.4 SOFTWARE SPECIFICATIONS
Operating system : Windows XP or later
Front End Software : J2EE,TOMCAT

Back End Software : ORACLE-8i
Bus Scheduling and Dispatching Management System
Abstract
Java With Swings
Databases: Ms-Access
H/W Requirements:
Tutelage Imprinter
ABSTRACT
systems presently running. Tutelage Imprinter is one of the education systems that are under
process long before but only committed to the University.
TUTELAGE IMPRINTER is an out classes study that allow you to educate when you
have a desire and time. A chance to study in any place you like, during your summer vocations
or while some other activities. The only thing is that you should be provided with all the
necessary materials.
This system maintains all the course details so that the users of this system after
registration views the list of the course details and also the scheduled course details. After
finishing the course the user will test his performance by attending an online examination
followed by a question and answer and finally when he finishes the exam there instantly
system display his marks which he scored.
Tutelage Imprinter is developed in a web based technology with backend as Oracle
Server. This system helps the user to not waste his time in distance training education when
compared to remote education and finally he could instantly view the marks which he scored
in the online exam.
S/W Requirements:
Technologies : Java, J2EE (JDBC, Servlets, JSP)
Database : Oracle 9i
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
Easy Journey
ABSTRACT
throughout India. In the list of visiting places cities are the mostly visited places. Tourists
are come from different places and new to the city they don’t know about the cities,
cultures of the people, local language to communicate and how to approach.
Tourist guides are the persons who guide the tourists about the city like the
visiting places, their importance and how to approach by taking money from them.
Tourist guides may cheat tourists for money by telling lies and chance to rob them. In
some cities they are not available.
To overcome these problems an efficient and powerful web application called
EASY JOURNEY has implemented.
This is the online application that provides brief information about the city by
using efficient web applications. To get the details about top restaurants, hotels, lodges,
events online EASY JOURNEY is an efficient web application.
It provides every one detailed description about entertainment, museum
exhibits, monuments and memorials, movies, theaters, hotels, events for concerts
and guides the visitors with stories, events listings and theater listings.
EASY JOURNEY also features arts and entertainment, attractions, recreation,
festivals and most famous devotional places. You’ll instantly get access to the
information about the city and provides you with all the information you need to know
about the things in the city.
This system provides Lifestyle of the people in the city, Entertainment guide,
latest information on accomodation, food, sightseeing, shopping, social, cultural and
tourist information and is a comprehensive guide.
Backend : Oracle
Harddisk : 40GB
RAM : 128 MB
PHARMACY MANAGEMENT SYSTEM.doc

Abstract
The Pharmacy Management System is a web application developed in Java
with back end Oracle. This project can be used by a hospital for its pharmacy
department or by a medical shop. The main basic theme of this application is to
keep track about all of the medicines available in the pharmacy department.
The administrator will maintain the medicines information along with
medicine manufacturing date, expiry date and price. Administrator will also
maintain information about the distributor of the medicines with his phone
number,email ,address etc.The administrator also keep track of his staff details and
maintain the equipment details.
The staff/Employee of the organization will store the updated data
about the medicines ie the medicines quantity and inspection information.
The user can give his complaints to the administrator about the
medicines.He can also view all the complaints posted by the other users.
Software Environment
Operating System : Windows 2000/XP/NT
Front end software: jdk1.5
Back end software : ORACLE8i
Hardware Environment
Processor : Intel Pentium or more
Ram : 256 Mb or more
Hard disk : 10 Gb or more
Monitor : Color monitor (256 colors or more)
1.Protocol Scrubbing
ABSTRACT
This paper describes the design and implementation of protocol scrubbers.
Protocol scrubbers are transparent, interposed mechanisms for explicitly removing
network scans and attacks at various protocol layers. The transport scrubber supports
downstream passive network-based intrusion detection systems by converting ambiguous
network flows into well-behaved flows that are unequivocally interpreted by all
downstream endpoints. The fingerprint scrubber restricts an attacker’s ability to
determine the operating system of a protected host. As an example, this paper presents
the implementation of a TCP scrubber that eliminates inserton and evasion attacks—
attacks that use ambiguities to subvert detection—on passive network-based intrusion
detection systems,while preserving high performance. The TCP scrubber is based on a
novel, simplified state machine that performs in a fast and scalable manner. The
fingerprint scrubber is built upon the TCP scrubber and removes additional ambiguities
from flows that can reveal implementation-specific details about a host’s operating
system.
• Operating System : Windows 95/98/NT/2000
• Other Tools & Technologies : Java, Swings, NetWorking
• Hardware Requirements
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
2.Structure Text Fillingz

ABSTRACT
An approach for filling-in blocks of missing data in image transmission is
presented in this paper. When compression algorithms such as JPEG are used as part of
the wireless transmission process, images are first tiled into blocks of 8 8 pixels. When
such images are transmitted over fading channels, the effects of noise can destroy entire
blocks of the image.
Instead of using common retransmission query protocols, we aim to reconstruct
the lost data using correlation between the lost block and its neighbors. If the lost block
contained structure, it is reconstructed using an image inpainting algorithm, while texture
synthesis is used for the textured blocks. The switch between the two schemes is done in
a fully automatic fashion based on the surrounding available blocks. The performance of
this method is tested for various images and combinations of lost blocks.
For our implementation, we consider PGM (Portable Gray Map) images for filling
in of missing image blocks. We use Java 2, The Standard Edition for implementing the
algorithm, and the holes (missing blocks) are placed randomly for testing the project.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
3. An Agent Based Intrusion Detection

ABSTRACT
infrastructure provides customizable network services to packets. The custom network
services can be deployed by the user inside the packets themselves. In this paper we
propose the use of agent based intrusion detection and response. Agents are integrated
with the collaborative IDS in order to provide them with a wider array of information to
use their response activities.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
4.Hop By Hop
ABSTRACT
IP multicast is facing a slow take-off although it has been a hotly debated topic
for more than a decade. Many reasons are responsible for this status. Hence, the Internet
is likely to be organized with both unicast and multicast enabled networks. Thus, it is of
utmost importance to design protocols that allow the progressive deployment of the
multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop
multicast routing protocol). HBH adopts the source-specific channel abstraction to

simplify address allocation and implements data distribution using recursive unicast trees,
which allow the transparent support of unicast- only routers. An important original
feature of HBH is its tree construction algorithm that takes into account the unicast
routing asymmetries. Since most multicast routing protocols rely on the unicast
infrastructure, the unicast asymmetries impact the structure of the multicast trees.We
show through simulation that HBH outperforms other multicast routing protocols in
terms of the delay experienced by the receivers and the bandwidth consumption of the
multicast trees. Additionally, we show that HBH can be incrementally deployed and that
with a small fraction of HBH-enabled routers in the network HBH outperforms
application-layer multicast.
5.Optical Multicast Routing In Ad Hoc-Network
ABSTRACT
An ad-hoc mobile network is a collection of mobile nodes that are
dynamically and arbitrarily located in such a manner that the interconnections
between nodes are capable of changing on a continual basis. The primary goal
of such an ad-hoc network routing protocol is correct and efficient route
establishment between a pair of nodes so that messages may be delivered in a
timely manner. Multicasting is to send single copy of a packet to all of those of
clients that requested it, and not to send multiple copies of a packet over the
same portion of the network, nor to send packets to clients who don’t want it.
The Adhoc Multicast Routing Protocol (AMRoute) presents a novel
approach for robust IP Multicast in mobile ad-hoc networks by exploiting user-
multicast trees and dynamic logical cores. It creates a bi-directional, shared tree
for data distribution using only group senders and receivers as tree nodes.
Unicast tunnels are used as tree links to connect neighbors on the User-
multicast tree. Thus AMRoute does not need to be supported by network nodes
that are not interested/capable of multicast, and group State Cost is incurred only
by group senders and receivers. Also, the use of tunnels as tree links implies that
tree structure does not need to change even in case of a dynamic network
topology, which reduces the signaling traffic and packet loss. Thus AMRoute
does not need to track network dynamics; the underlying Unicast protocol is
solely responsible for this function.
AMRoute does not require a specific Unicast routing protocol; therefore, it can
operate seamlessly over separate domains with different Unicast protocols. We have
tried to overcome the transient loops in the mesh creation. Also we have
implemented the Dynamic core migration technique by using a timer which
periodically changes the current core node, so that the efficiency of the protocol can
be improved.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
6.Image Rendering For A Grid Tech
ABSTRACT
Grid Computing is an advanced technology of distributed computing. A Grid

is a collection of computers, storage and other devices which are joined together by any
means of communication like internet and which can be used to manage information and
solve their problems among themselves.
Grid Computing allows usage of the unutilized resources of other systems.
This is achieved by distributing the workload of the system to the other systems in order
to use their unused resources such as their memory, processor, etc which results in
balancing the workload, decreasing the network traffic, bandwidth, etc. This concept is
used in our project to render a large image in a very short time by distributing the image
to many systems for using their resources.
As the workload is evenly distributed among the grid network, even the large
work can be done in a short time itself. The main scope is that using the unused resources
to complete the work efficiently. This project helps to use the resources efficiently and
cost effective. Grid Computing is about making large amounts of computing power
available for applications and users. Collaborative development of Java Grid Engine
technology provides the proper development framework to ensure that Grid Engine
technology meets the requirements of the largest number of users.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
Network Analyzer
ABSTRACT
This paper describes how to use an AEA Technology network analyzer to tune an
antenna. This paper discusses tuning issues at a general level; no specific model of
antenna is addressed here. For best link efficiency, you must properly tune the antenna to
resonance. Additionally, if the antenna has two or more adjustments available, you
should also tune the antenna for the optimum match. Resonance occurs when the reactive
portion of the antenna impedance is zero. This causes the voltage to be in phase with the
current, and allows the transmitter to generate its maximum power. SWR or return loss
readings do not provide enough information to determine resonance. You must use a
vector impedance reading to see resonance. The transmission lines used to feed the
antenna can add a layer of confusion to the measurements. If practical, tune the antenna
by itself first, then add in the feedline for more measurement
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
9. Credit Card Approval System

ABSTRACT
An automated security credit checking system for checking a credit
application for fraud before a credit card is issued. The credit checking system scans the
credit application, and uses an optical character recognition program to check the
application. The credit checking system helps determine whether the application is
legible, and whether there is a discrepancy between the post mark and the mailing
address. The credit checking system automatically determines whether the application is
a corporate or individual application, and whether the application is one of numerous
requests from the same person, employer, or address. The credit checking system also
tracks the status of each application and the route each type of application has taken,
whether it is a corporate application, a suspected fraudulent application, a verified
fraudulent application, or a rejected application. This credit checking system checks on-
line national fraud information sources, and fraud information that is compiled by the
system and entered into system memory on a daily basis. A letter listing credit bureaus to
contact for protection is generated and sent to any victim of fraud detected during daily
credit checking. The automated credit checking system keeps a daily tally of the number
of corporate applications received, the percentage of individual applications approved,
the percentage of individual applications declined or rejected, and the percentage of
individual applications that were detected as being fraudulent.
• Other Tools & Technologies : Java, Swings, Jdbc
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
10. Visual Cryptography

ABSTRACT
Visual cryptography is a cryptographic technique which allows visual information
(pictures, text, etc.) to be encrypted in such a way that the decryption can be performed
by the human visual system, without the aid of computers.
Visual cryptography was pioneered by Moni Naor and Adi Shamir in 1994. They
demonstrated a visual secret sharing scheme, where an image was broken up into n shares
so that only someone with all n shares could decrypt the image, while any n-1 shares
revealed no information about the original image. Each share was printed on a separate
transparency, and decryption was performed by overlaying the shares. When all n shares
were overlayed, the original image would appear. Using a similar idea, transparencies can
be used to implement a one-time pad encryption, where one transparency is a shared
random pad, and another transparency acts as the ciphertext.
Features:
Share image into two parts
Security
• Other Tools & Technologies : Java, Swings, Networking
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
Digital Water Marking
ABSTRACT
Our project deals with the concept of watermarking. Recent advancements in
computer technologies offer many facilities for duplication, creation, manipulation,
reproduction and distribution of the digital multimedia. They are becoming extremely
easier 7and faster with the existence of the Internet and the availability of pervasive and
powerful multimedia tools. However, these advances have their drawbacks as well, for
example unauthorized tampering of images.
Digital watermarking has emerged as a possible method to tackle these issues.
Digital watermarking is a process to embed secondary data in digital media.
A digital watermark is created by inserting a digital signal, or pattern within
multimedia content. This embedded information can be used to determine whether the
host data are being tampered with or not.
These embedded data are can be visible or invisible depend on the particular
applications and the requirements of applications. , and can later be detected or extracted.
It has made a considerable progress in recent years and attracted attention from both
academia and industry. It plays a vital role as it allows to identify the legitimate owner,
track authorized users via fingerprinting or detect malicious tampering of the document.
Several watermarking methods exist for every kind of digital media .for example Text
documents, images, video, audio even for 3D polygon models, maps and computer
programs. Our project deals with watermarking the images with other images and text.
Modules:
1. Text on image
2. Image on image
• Web/Application Server : Tomcat
• Database Server : Oracle 8i
• Other Tools & Technologies : Java (JDK), Servlets (JSDK), JavaMail
• Pentium IV
• 64 MB Ram
• Hard Disk 4.3 GB
JBrowser
ABSTRACT
Our project deals with developing some tools, which help in enhancing the activities at
different stages in the software development life cycle (SDLC). Our tools will fall under the
category of CASE tools which enable sophistication during the software development.
We aim at developing two tools, (a) Code Analyzer ( jBrowser ) and (b) Log Reader.
The jBrowser would be a tool that would help the user track control flow between java classes
via method calls. Given a starting point, this tool tracks the entire path within a particular
location spotting various method calls under different scenarios. We aim at building this tool as
an effective tool to understand the control flow while reengineering and reverse engineering
and as a testing tool which would identify the broken links between the java classes.
The Log Reader is another simple tool. This tool focuses on presenting the user with a
user friendly GUI, using which the user can query and extract useful information from the log
files generated by an application server in an interactive and understandable manner.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
Public Key Validation For Dns Security Extension
ABSTRACT
The mapping or binding of IP addresses to host names became a major problem in

the rapidly growing Internet and the higher level binding effort went through different
stages of development up to the currently used Domain Name System (DNS).
The DNS Security is designed to provide security by combining
the concept of both the Digital Signature and Asymmetric key (Public key)
Cryptography. Here the Public key is send instead of Private key. The DNS security uses
Message Digest Algorithm to compress the Message(text file) and PRNG(Pseudo
Random Number Generator) Algorithm for generating Public and Private key. The
message combines with the Private key to form a Signature using DSA Algorithm, which
is send along with the Public key.
The receiver uses the Public key and DSA Algorithm to form a
Signature. If this Signature matches with the Signature of the message received, the
message is Decrypted and read else discarded.
The Domain Name System (DNS) has become a critical operational part of the
Internet Infrastructure, yet it has no strong security mechanisms to assure Data Integrity
or Authentication. Extensions to the DNS are described that provide these services to
security aware resolves are applications through the use of Cryptographic Digital
Signatures. These Digital Signatures are included zones as resource records.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
15.Web’s Eye
ABSTRACT
Web’s Eye is software to develop web pages .Many people is aware of world
wide web and web pages, but not even capable of dreaming a web page design. The
Web’s Eye is q user friendly software which will assist you in designing a web page and
putting your creative ideas in the web to change you really professional in the World’s
Eyes. Suppose if you are a professional Web’s Eye will show a different face as an
intelligent colleague to navigate you. Web’s Eye uses Java @ Platform to develop an
extra featured user friendly software for creating web pages. Web page code generation is
done in HTML. The strong graphical user interface which is the unique property of this
project helps to distribute the tags intelligently . The project mainly aims at simplifying
user effort for creating a web page.
Extra features of Web’s Eye
• Full fledged html help covers all the areas of HTML
• Inbuilt browser to have a preview
• Integrated IE allows downloading
• Two modals one for Beginners and other for
Professionals
• Installation kit
• Vast library of button objects
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
16.Web Extractor
ABSTRACT
A web web extract is a program, which automatically traverses the web by
downloading documents and following links from page to page. Web search engines to
gather data mainly use them. Other possible applications include page validation,
structural analysis and visualization; update notification, mirroring and personal web
assistants/agents etc. web extract are also known as spiders, robots, worms etc.
web extract’s start by parsing a specified web page, noting any hypertext
links on that page that point to other web pages. They then parse those pages for new
links, and so on, recursively. Web-Importer software doesn't actually move around to
different computers on the Internet, as viruses or an intelligent agent does. An importer
resides on a single machine. The importer simply sends HTTP requests for documents to
other machines on the Internet, just as a web browser does when the user clicks on links.
All the importer really does is to automate the process of following links.
Web importing speed is governed not only by the speed of ones own
Internet connection, but also by the speed of the sites that are to be downloaded.
Especially if one is an importing site from multiple servers, the total downloading time
can be significantly reduced, if many downloads are done in parallel. This work
implements the “Breadth First Importing” algorithm, a refined version of one of the first
dynamic Web search algorithm, In order to build a major search engine or a large
repository such as the Internet Archive, high-performance importers start out at a small
set of pages and then explore other pages by following links in a “breadth first-like”
fashion.
Modules:
1. Filter web pages
2. Download pages
S/W Requirements:
Operating System : Windows XP/2000 Professional
Language Name : Jdk1.4 or higher
H/W Requirements:
Online Database Wizard
ABSTRACT
Online Database Wizard is an innovative, intuitive database wizard. Specifically aimed
at developers developing , Internet database related projects, website, etc., Online Database
Wizard profiles host of features that are very much crucial but neglected in general. This
document provides very superficial information and capabilities of Online Database Wizard.
In simple, using Online Database Wizard any developer with minimal knowledge can
easily do the following things
• connect to multiple databases easily

• create databases
• modify databases
• import and export data
• execute SQL statements
Modules
• Input entry screen (connection requirements)
• SQL Editor window
• Results Window
• Syntax highlighter and help
• Saving SQL statements
• Saving output results
• Schema generation with UI
• Multiple database connections
o MS Access
o MS SQL
o Oracle
o My SQL
• Storing multiple connection information
• Importing data directly from local disk to internet
• Exporting data from internet to local disk
• Relationship diagram between tables
• Database properties / structure details
Purpose of the Project:
Initial screen which is going to ask user on what type of database that the user wants to
interact. Then it will ask for the required parameters to act on that particular database.
Based on the parameters it establishes the connection and executes the user queries to his
satisfaction.
• connect to multiple databases easily

• create databases
• modify databases
• import and export data
• execute SQL statements
Intel P-III Processor
64 MB RAM
40 GB Hard Disc
Software Specifications:

Language : JAVA using Swings
Visual Editor
ABSTRACT
Providing the users with the create documents main purpose of this application.
The project implementation is mainly concerned with create documents are
maintained by our editor. The project has been developed by utilizing
JAVA2, using Swing, IO, and wt(Abstract Window Toolkit) The successful
platform used is Windows and has its application in windows based System.
The abstraction for a System is its Documents, the usual methods in now-a-
days based on Windows Environments. The term Word Processing refers to
the activity carried out using a computer and suitable software to create,
view, edit, manipulate, transmit, store, retrieve and print documents.
• Other Tools & Technologies : Java, Swings
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
19. Stegohider
ABSTRACT
Steganography is the art of hiding information. There are a large number of
Steganographic methods used in different applicatons.It is extensively used in Digital
Water marking, communication within closed community with additional degrees of
security. An attempt is being made to implement a new technique , entitled
“Steganographic Application Tool”, for image encoding in steganography. It provides
more security for data transfer on Internet and other networks. Our intention is to hide the
existence of the message; While Cryptography scrambles a message so that it can not be
understood. Using Steganography a secret message can be transmitted without the fact of
the transmission being discovered. This hiding of data can be done in three different
media such as text, image and audio files. Though there are variety of image formats to
implement the algorithms used in this system, we use the JPEG format to embed the Plain
text as it contains the compressed image format. In this technique, firstly the pixels values
(RGB values) of the image in which the plain text is to be embedded are extracted. The
bits of the plain text into the two LSB bits of the RGB values in the image. The
transparency bits of the pixels are not disturbed. The fact that we are embedding the plain
text into the two LSB bits enables the recipient to get the original image without any
distortions. In order to provide more security, we are first encrypting the message using
DES algorithm and then cipher text as the input to our technique and the same message
will be extracted and decrypted at the receiver end.
Steganography is really interesting subject and the applications using

Steganography are increasing day-by-day. A number of algorithms were developed and
implemented to achieve Steganography in images and audio. Many new algorithms are
coming and each of them uses a unique method of making life of a Steg-Analyst more
miserable everyday.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
EMBEDDING DATA INTO VIDEO FILE

WITH LESS DISTORTION USING LSB TECHNIQUE
ABSTRACT
The “Embedding Data into Video File” is an application which deals

with security during transmission of data across the network. Security for the data is
required, as there is always a possibility for someone to read those secret data. The
system deals with implementing security using steganography. Steganography is the art
of hiding information in ways so as to prevent detection of hidden messages.
Data Embedding into Video File is software, which tries to alter the
originality of the data files in to some encrypted form by using “Tiny Encryption
Algorithm”. Encryption of data plays a vital role in the real time environment to keep the
data out of reach of unauthorized people, such that it is not altered and tampered. After
encryption, the files can be transferred securely by using steganography. We are using
video as stegno media to embed the encrypted data file .So this has been defined as
“Video Steganography”. The application should have a reversal process as of which
should be in a position to deembed data file from video and decrypt the data to its
original format upon the proper request by the user. The goal of our project is to design a
tool for providing security to the system during transmission of data through the network.
The project is developed using graphics in java swings.
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
Remote Network Monitoring And Control

ABSTRACT
This project deals with the functionalities of the node systems connected through
a network. This system implements Remote control at the application level.
This project controls the remote systems by performing the node operations like
shutdown, checking files and its permissions, etc. As the application is built purely on
JAVA using RMI APIs, it is platform independent and the users can run their application
using this software.
Java also provides a strong development platform in its own right for remote-
control solutions. This system helps in handling the operations of the administrator, in
order to avoid time delay by executing the tasks, from the server itself.
This enhances the work efficiency of the administrator and also reduces the
physical work strain. It can also be used to reduce the unnecessary power consumption in
an organization.
1.1 CURRENT SYSTEM:
• In the present generation systems, there is a need for the administrator has to go all
around the network in order to terminate any system that is left non-terminated.
• The administrator has to take all the trouble of going to a particular system to access a
file that is needed by him.
• In order to get the system configuration details of any particular system, the
administrator has to take the trouble of going to that system for obtaining the
information.
• The processes that are running in a particular system can be viewed only in that
system itself by using the present generation software’s.
• In order to provide security for the files from unauthorized users, the administrator
has to assign the file permissions. In the existing systems this is handled by
performing the required actions on that particular system itself.
1.2 PROPOSED SYSTEM:
The disadvantages present in the existing systems can be overcome using the proposal
systems.
• Using the Node Controller software the administrator can control the operations
of the remote system from his system it self.
• With this software, he can search the files he wants that are present on the remote
system and can download the files to his system in order to access them and can
also upload them to any system.
• The administrator can get the configuration of the remote system from the server
system itself using this software.
• In order to terminate the operations on the remote systems, the administrator can
obtain the current process details of the remote systems from the server itself.
• In order to ensure the security for the files in an organization, the administrator
can provide the file access permissions.
• Running rmiregistry in the client systems performs all the above operations.
5.3.1 Software Requirements:

OPERATING PLATFORM : WINDOWS XP, VISTA
Technologies : JAVA, RMI, SWINGS,networking
5.3.2 Hardware Specifications:
PROCESSOR : PENTIUM-4
RAM : 256 MB (MINIMUM)
HARD DISK : 20 GB (MINIMUM)
VDU : SVGA COLOR MONITOR
KEY BOARD : 104 STANDARDS
LAN : ENABLED
HTTP Server
ABSTRACT
GRAPHICAL WEB Server is a web based window application.
A HTTP Server displays a browser page with a graphical user interface. Web browsers
plays a critical role in making Web content accessible to people with disabilities. Access
to Web content requires that Web browsers provide users with final control over the
styling of rendered content, the type of content rendered and the execution of automated
behaviors. The features available in Web browsers determine the extent to which users
can orient themselves and navigate the structure of Web resources. . This project HTTP
Server uses a port number to retrieve the applications on a web page This project is
depending on the port number and using this port number in the url we access the pages .
The present subject matter describes a HTTP Server stores visual representations of user-
selected web pages and provides a convenient way to collect web pages and related
information . Using the techniques described herein, a user can easily save information
including: a link to a web page; a thumbnail image related to the web page; a title of the
web page; information from the web page; metadata associated with the web page; and
user comments regarding the web page. In this paper we describe how we are using the
visualization system to visualize the portion of the Web explored during a browsing
session. As the user browses, the Web browser communicates the URL and title of each
document fetched as well as all the anchors contained in the document. Finally we are
creating our own server using port number.

Technologies : JAVA
SWINGS,networking,JSP,Servlets
LAN : ENABLED
8. Implementation of IDEA Algorithm
ABSTRACT
The “IMPLEMENTATION AND ITS PERFORMANCE EVALUATION OF IDEA

ALGORITHM” is an application which deals with security during transmission of data across
the network. Security for the data is required, as there is always a possibility for someone to
read those secret data.
Encryption of data plays a vital role in the real time environment to keep the data out of
reach of unauthorized people, such that it is not altered and tampered. After encryption, the
files can be uploaded by using File Transfer protocol. After transfer of data, the files are
decrypted.
This application also calculates the time taken to encrypt and decrypt the data using 64-
bit key,128-bit key,192-bit key,256-bit key. The main goal of our project is to design a tool for
providing security to the system during transmission of data through the network. The project is
developed using graphics in java swings.

Technologies : JAVA
SWINGS,networking,JSP,Servlets
LAN : ENABLED
ABSTRACT
Image Compression is mainly used for compressing the image data with out any
significant image data or image clarity. This is for easy maintenance, network transforming and
security also provided. In this project the lousy compression techniques can be used in some
contexts where data loss cannot affect the image clarity in this area.
In some important situations image compression uses Lossless compression involves
with compressing data which, when decompressed, will be an exact replica of the original data.
This is the case when binary data such as executables, documents etc. are compressed. They
need to be exactly reproduced when decompressed. On the other hand, images need not be
reproduced 'exactly'. An approximation of the original image is enough for most purposes, as
long as the error between the original and the compressed image is tolerable.
Pentium IV Processor.
128 MB RAM.
20GB Hard Disk space.
Windows 2000 XP operating system.

J2sdk1.4.0 or higher
Pretty Good Privacy
ABSTRACT
PGP Encryption (Pretty Good Privacy) is a computer program that provides
cryptographic privacy and authentication. The first PGP version, by designer and developer
Phil Zimmermann, became available in 1991. Since then major enhancements have been made
and a wide range of products are now available from PGP Corporation and other companies.
PGP encryption applications

While originally used primarily for encrypting the contents of email messages and
attachments from a desktop client, PGP products have been diversified since 2002 into a set of
encryption applications which can be managed by an optional central policy server. PGP
encryption applications include email and attachments, digital signatures, laptop full disk
encryption, file and folder security, protection for IM sessions, batch file transfer encryption,
and protection for files and folders stored on network servers.
The PGP Desktop 9.x application includes desktop email, digital signatures, IM
security, laptop whole disk encryption, file and folder security, self decrypting archives, and
secure shredding of deleted files. Capabilities are licensed in different ways depending on
features required.
The PGP Universal 2.x management server handles centralized deployment, security
policy, policy enforcement and reporting. It is used for automated email encryption in the
gateway and manages PGP Desktop 9.x clients. It works with the PGP public keyserver - called
the PGP Global Directory - to find recipient keys. It has the capability of delivering email
securely when no recipient key is found via a secure HTTPS browser session.
With PGP Desktop 9.0 managed by PGP Universal Server 2.0, released in 2005, all
PGP encryption applications are based on a new proxy-based architecture. These newer
versions of PGP software eliminate the use of email plug-ins and insulate the user from
changes to other desktop applications. All desktop and server operations are now based on
security policies and operate in an automated fashion. The PGP Universal server automates the
creation, management, and expiration of keys esharing these keys among all PGP encryption
applications.
New versions of PGP applications use both OpenPGP and the S/MIME, allowing
communications with any user of a NIST specified standard.
How PGP encryption works:

PGP encryption uses public-key cryptography and includes a system which binds
the public keys to user identities. The first version of this system was generally known as
a web of trust to contrast with the later-developed X.509 system which uses a hierarchical
approach based on certificate authority. Current versions of PGP encryption include both
alternatives through an automated management server.
Encryption/decryption.
PGP message encryption uses asymmetric key encryption algorithms that use the
public portion of a recipient's linked key pair, a public key, and a private key. The sender
uses the recipient's public key to encrypt a shared key (aka a secret key or conventional
key) for a symmetric cipher algorithm. That key is used, finally, to encrypt the plaintext
of a message. Many PGP users' public keys are available to all from the many PGP key
servers around the world which act as mirror sites for each other.
The recipient of a PGP encrypted email message decrypts it using the session key
for a symmetric algorithm. That session key is included in the message in encrypted form
and was itself decrypted using the recipient's private key. Use of two ciphers in this way
is sensible because of the very considerable difference in operating speed between
asymmetric key and symmetric key ciphers (the differences are often 1000+ times). This
operation is completely automated in current PGP desktop client products.
Digital signatures:
A similar strategy is used to detect whether a message has been altered since it
was completed, and whether it was actually sent by the person/entity claimed to be the
sender. It is used by default in conjunction with encryption, but can be applied to
plaintext as well. The sender uses PGP encryption to create a digital signature for the
message with either the RSA or DSA signature algorithms. To do so, PGP products
compute a hash (also called a message digest) from the plaintext, and then creates the
digital signature from that hash using the sender's private key.
The message recipient uses the sender's public key and the digital signature to
recover the original message digest. He compares this message digest with the message
digest he computed himself from the (recovered) plaintext. If the signature matches the
received plaintext's message digest, it must be presumed (to a very high degree of
confidence) that the message received has not been tampered with, either deliberately or
accidentally, since it was properly signed
Language : .Net(vb.Net)
H/W REQUIREMENTS:
27.Car Sales System
ABSTRACT
An information processing technology of the present invention is capable of speeding
up a process that a prospective buyer of a used car determines an intention of purchasing the
car. A car sale information providing system of the present invention includes a car information
storage unit stored with mappings of car information containing a name, a type, a year model
etc of a car to car inspection information obtained as a result of inspecting the car concerned. A
car information input device is provided for inputting the car information and getting the car
information stored in the car information storage unit (A search unit is provided for outputting
an input screen for searching the car information stored in the car information storage unit , and
searching based on conditions inputted. The system includes a car information output unit , for
outputting display information, including a purchase indication interface for transmitting car
purchase information containing the searched car information and the car inspection
information corresponding to the car information.
ENVIRONMENT:
Operating System Server: Windows XP or later
Programming language: Java
Graphical User Interface: Jdk, Swings
Hardware Specification:
Processor: Intel Pentium or More
RAM: 512 MB Ram
Hard Disk: PC with 20GB
Remote File Repository

ABSTRACT
This REMOTE FILE REPOSITORY development of a system that is simple and

easy to find client system files.
Using this project any one can search for a particular file or files on the client
machine by simply giving the client machines IP address, file extension and location of the file
by sitting on the server machine. The list of files with the specific extension will be displayed
on the server machine.
Some of the features are:
The proposed system should be in the way, the user can enter the client system IP, file
extension, path of the file or folder very quickly.
It should display the matching files. The files should be display in the order as they
exist.
The modules are
1. User interface
2. Searching
User interface
It provides very attractive and friendly user interface. The user can easily
interact with the system ( to provide client system IP / file system extensions..Etc).
Searching
This module allows us to search the files and folders exist in client system. It
allows regular expressions to Search the files. It displays in the files in an order as
they exist in system.
ENVIRONMENT:
Graphical User Interface: Java Swings API
RAM: 512 MB Ram
Bank System
ABSTRACT
The main objective of this proposed system is to all the activities of a bank. The system
is like to enable the bank employees to open accounts for their customers with ease and to add
the details, to transfer amount from one account to another account and doing all the activities
related to loan, making all type of transactions. Using the system employees can also generate
different types of modules.
• Add Acct Type Information

• Add Loan Detail Information
• Create New Accounts
• Transaction (Deposits, Withdraws and Loan Payments)
• Issue Loans
• Issue DD’s
• Generate Reports (Day, monthly, withdraws, dd’s, and deposits)
• Check Account Types Information

• Check Loans Information
• Check Balance Amount

Graphical User Interface: Java Swings,Jdbc
RAM: 512 MB Ram
ABSTRACT
This program was created for individuals who own numerous unlabeled mixed cds and
would love to have a means of locating tracks on the cd.
In order for this program to work there have to be some type of distinction between the
cds. For instance we label our cds with a number(ie, CD 1, CD 2..). Although "CD 1" is the
most recommended format it isn't the only choice. There are many different alternatives like
labeling the cds by color and so on. A user easily can find out the track of cd by using title or
track number.
Of course the saved cd name will have to match the label. For example, if you save the
cd as "CD 1" then you should label your cd #1 or so, otherwise the program will not benefit
you.
S/W Requirements:
 JAVA/J2EE
 Oracle/MSSQL/MS-Access
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
Airways Reservation System
ABSTRACT
Airways Reservation System is used to give the customers the best of booking tickets.
The web technologies have been developed in such a manner that they can provide good
services to its users. The airlines ticketing system is a web-based application which have been
developed in one of the web technologies Java with backend as Oracle9i.
The airlines ticketing is the system that provides not only ticket booking services
but also it gives the complete information about the Airlines Company. The ticket booking is
made very easy that the customer can book his ticket by just giving his credit card number. His
ticket will be sent to the prescribed address given by the customer. This online application is
very flexible so that the customer can easily fill his details and receive the ticket in time.
S/W Requirements:
 VB/.NET/JAVA/J2EE
 Oracle 9i/MSSQL/MS-Access
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
32.Location Aided Routing
ABSTRACT
We study routing misbehavior in MANETs (Mobile Ad Hoc Networks) in this paper. In
general,routing protocols for MANETs are designed based on the assumption that all
participating nodes are fully cooperative. However, due to the open structure and scarcely
available battery-based energy, node misbehaviors may exist. One such routing misbehavior is
that some sel_sh nodes will participate in the route discovery and maintenance processes but
refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an
add-on technique for routing schemes to detect routing misbehavior and to mitigate their
packets in the opposite direction of the routing path. In order to reduce additional routing
overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme.
Analytical and simulation results are presented to evaluate the performance of the proposed
Scheme.
The various modules included in the project as

follows:
Module 1: Route Discovery.

Module 2: Data Security.
Module 3: Data Transfer.
Module 4: Route Maintenance.
Module 5: Route Disconnection
• Other Tools & Technologies : Java
• P IV 2.4
• 128 MB Ram
• Hard Disk 40 GB
33.Web Importer
ABSTRACT
A web importer is a program, which automatically traverses the web by

assistants/agents etc. Web importers are also known as spiders, robots, worms etc.
Web Importer’s start by parsing a specified web page, noting any hypertext links
so on, recursively. Web-Importer software doesn't actually move around to different
computers on the Internet, as viruses or an intelligent agent does. An importer resides on
a single machine. The importer simply sends HTTP requests for documents to other
machines on the Internet, just as a web browser does when the user clicks on links. All
the importer really does is to automate the process of following links.
Web importing speed is governed not only by the speed of ones own Internet
connection, but also by the speed of the sites that are to be downloaded. Especially
if one is an importing site from multiple servers, the total downloading time can be
significantly reduced, if many downloads are done in parallel. This work
implements the “Breadth First Importing” algorithm, a refined version of one of
the first dynamic Web search algorithm, In order to build a major search engine or
a large repository such as the Internet Archive, high-performance importers start

out at a small set of pages and then explore other pages by following links in a
“breadth first-like” fashion.
Modules:
3. Find file structure using WebCrawler
4. Filter web pages
5. Download pages
S/W Requirements:
H/W Requirements:
34.Atm Simulator
ABSTRACT
The project ATM STIMULATOR is beneficial for the any people who are in
villages or in ruler area or in metro city. A person who needs a fast cash and fast and hard
cash. We presents a software ATM machine for the transaction of money and saving of
money. The database is maintained for each individual account. This project has been
designed as such the ATM using the software. In our project overall several forms have
been created. For these form of records this database is used. This project is maintains a
database for different records, it means that for the account transactions.Advantages:
• Fast accessing
• No manpower is needed
• No need to go to bank to deposit
• Time consuming process

• 64 MB RAM
• 4 GB Hard Disc

Language : JAVA using SWINGS/AWT
Database : Access/Oracle/SqlServer
35.High Speed Download Manager
ABSTRACT
This is purely a java enabled Network project using which an end user downloads
different files (data) from various servers with a high-speed data transfer. The end user
activating the Download Manager need to submit an URL of the file to be downloaded,
by which the software gets connected to the server and gets the file information with its
status for the download. After which the user is asked for the path to save the file. The
Download manager then downloads the requested file at a high speed.
The software design supports the display of status information of the download
carried out at every second (i.e.) the percentage of file downloaded. The most striking
feature of this download manager is support of high-speed data transfer and it allows the
user to download more than one file simultaneously. It provides a reliable data transfer by
tracing the download status at every moment and helps to continue the file downloading
from the position of its last download if the downloading is terminated by a sudden
disaster like loss of connection due to any reason or failure of transmission.

• 64 MB RAM
• 4 GB Hard Disc
Language :JAVA using SWINGS/AWT,Networking
Extreme Pc
ABSTRACT
XtremePC is an open source project has been developed using Java RMI-NIO and
Win32 API with Windows XP Look & Feel. It provides opportunity to access files of your
remote PC from anywhere in the world. You can even run any type of file with associated
executable files, turn off the remote PC, restart, log off, lock etc.
You can also download files from your Remote PC to the current PC, and upload files
from the currently using PC to the Remote PC. You will also be able to know the file
information before downloading and uploading files so that you would always know the file
size which is being downloaded or uploaded. Caching the contents of drives, folders added
extremely fast navigation so that you will always feel that you are accessing local drives.
It also ensures the security of passed information both ways using Data Encryption
Standard (DES) algorithm using Electronic Code Book (ECB). The Remote PC is always
protected by password. You have to know the password in order for using the Remote PC from
the current PC.
Here is a snapshot attached with this email, how you will see your PC out of your
house. However, Lite Edition does not support XP Look & Feel.
What’s new?
 No more command-line interfaces. Now it is loaded with Graphical User Interface with
Windows XP Look & Feel. Those who faced problem loading XP Look& Feel, may try
this Lite Edition. It uses only built-in Java Look & Feel, which reduced size of the
distributable file.
 Easy and EXTREMELY fast navigation through Internet, feels like local drives.
 Select a file from the remote PC and use menu to download, upload, and run on
remote PC.
 Run files on remote PC with any kind of extension.
 New I/O, Remote Method Invocation (RMI) technologies are involved.
Java RMI
Swings
38.Transportation System On Ids
ABSTRACT
Making cities liveable is a matter of growing concern for different groups across the
globe. As such, the effects that the distinct means transportation can have on different
communities have been an evolving subject of study. This coursework is intended to describe
the design of Meeting Arrangement for a university or college, a simple meeting arrangement
system based on the different means of transportation for students at the college or University.
On a given day, students arrive to the college or university for different activities (lessons and
meetings) using distinct means of transportation. Consequently, their arrival times vary
according to not only to the means but also to the departure point.
The idea is to produce a case study scenario where students can will fully register their
routes and keep their classmates updated on their arrival times. With potential application to
meeting arrangement and lesson start times, such system shall be modeled as an Informative
Digital Screen (IDS) similar to the ones located at bus stops across the city. For our case study,
we assume that such means are restricted to bus, car, and bicycle only.
By using this system, students and staff at university or college can potentially arrange
meetings and in general, be more informed to schedule activities. Such system is to be modeled
using object oriented techniques and deployed accordingly as a Java computer programming
application.
Java Swings

• 64 MB RAM
• 4 GB Hard Disc
Java Productivity Aids(JBrowser)
ABSTRACT
Our project deals with developing some tools, which help in enhancing the
activities at different stages in the software development life cycle (SDLC). Our
tools will fall under the category of CASE tools which enable sophistication
during the software development.
We aim at developing two tools, (a) Code Analyzer ( jBrowser ) and (b)
Log Reader. The jBrowser would be a tool that would help the user track control
flow between java classes via method calls. Given a starting point, this tool tracks
the entire path within a particular location spotting various method calls under
different scenarios. We aim at building this tool as an effective tool to understand
the control flow while reengineering and reverse engineering and as a testing tool
which would identify the broken links between the java classes.
The Log Reader is another simple tool. This tool focuses on presenting the
user with a user friendly GUI, using which the user can query and extract useful
information from the log files generated by an application server in an interactive

and understandable manner.
Java Swings
• 64 MB RAM
• 4 GB Hard Disc
ABSTRACTS FOR JAVA LIST
1. QUIVER: CONSISTENT OBJECT SHARING FOR EDGE

SERVICES
Abstract
We present Quiver, a system that coordinates service proxies

placed at the “edge” of the Internet to serve distributed clients
accessing a service involving mutable objects. Quiver enables these
proxies to perform consistent accesses to shared objects by migrating
the objects to proxies performing operations on those objects. These
migrations dramatically improve performance when operations
involving an object exhibit geographic locality, since migrating this
object into the vicinity of proxies hosting these operations will benefit
all such operations. This system reduces the workload in the server. It
performs the all operations in the proxies itself. In this system the
operations performed in First-In-First-Out process. This system
handles two process serializability and strict serializabilty for durability
in the consistent object sharing . Other workloads benefit from Quiver,
dispersing the computation load across the proxies and saving the
costs of sending operation parameters over the wide area when these
are large. Quiver also supports optimizations for single-object reads
that do not involve migrating the object. We detail the protocols for
implementing object operations and for accommodating the addition,
involuntary disconnection, and voluntary departure of proxies. Finally,
we discuss the use of Quiver to build an e-commerce application and a
distributed network traffic modeling service.
2. RATE & DELAY GUARANTEES PROVIDED BY CLOSE PACKET

SWITCHES WITH LOAD BALANCING
Abstract
In this paper, we consider an overarching problem that

encompasses both performance metrics. In particular, we study the
network capacity problem under a given network lifetime requirement.
Specifically, for a wireless sensor network where each node is
provisioned with an initial energy, if all nodes are required to live up to
a certain lifetime criterion, Since the objective of maximizing the sum
of rates of all the nodes in the network can lead to a severe bias in
rate allocation among the nodes, we advocate the use of
lexicographical max-min (LMM) rate allocation. To calculate the LMM

rate allocation vector, we develop a polynomial-time algorithm by
exploiting the parametric analysis (PA) technique from linear program
(LP), which we call serial LP with Parametric Analysis (SLP-PA). We
show that the SLP-PA can be also employed to address the LMM node
lifetime problem much more efficiently than a state-of-the-art
algorithm proposed in the literature. More important, we show that
there exists an elegant duality relationship between the LMM rate
allocation problem and the LMM node lifetime problem. Therefore, it is
sufficient to solve only one of the two problems. Important insights
can be obtained by inferring duality results for the other problem.
3. GEOMETRIC APPROACH TO IMPROVING ACTIVE PACKET

LOSS MEASUREMENT
Abstract
Measurement and estimation of packet loss characteristics are

challenging due to the relatively rare occurrence and typically short
duration of packet loss episodes. While active probe tools are
commonly used to measure packet loss on end-to-end paths, there
has been little analysis of the accuracy of these tools or their impact
on the network. The objective of our study is to understand how to
measure packet loss episodes accurately with end-to-end probes. We
begin by testing the capability of standard Poisson- modulated end-to-
end measurements of loss in a controlled laboratory environment

using IP routers and commodity end hosts. Our tests show that loss
characteristics reported from such Poisson-modulated probe tools can
be quite inaccurate over a range of traffic conditions. Motivated by
these observations, we introduce a new algorithm for packet loss
measurement that is designed to overcome the deficiencies in
standard Poisson-based tools. Specifically, our method entails probe
experiments that follow a geometric distribution to 1) enable an
explicit trade-off between accuracy and impact on the network, and 2)
enable more accurate measurements than standard Poisson probing at
the same rate. We evaluate the capabilities of our methodology
experimentally by developing and implementing a prototype tool,
called BADABING. The experiments demonstrate the trade-offs
between impact on the network and measurement accuracy. We show
that BADABING reports loss characteristics far more accurately than
traditional loss measurement tools.
4. A PRECISE TERMINATION CONDITION OF THE

PROBALASTIC PACKET MARKING ALGORITHM
Abstract
The probabilistic packet marking (PPM) algorithm is a

promising way to discover the Internet map or an attack graph that
the attack packets traversed during a distributed denial-of-service
attack. However, the PPM algorithm is not perfect, as its termination
condition is not well defined in the literature. More importantly,
without a proper termination condition, the attack graph constructed
by the PPM algorithm would be wrong. In this work, we provide a
precise termination condition for the PPM algorithm and name the new
algorithm the Rectified PPM (RPPM) algorithm. The most significant
merit of the RPPM algorithm is that when the algorithm terminates, the
algorithm guarantees that the constructed attack graph is correct, with
a specified level of confidence. We carry out simulations on the RPPM
algorithm and show that the RPPM algorithm can guarantee the
correctness of the constructed attack graph under 1) different
probabilities that a router marks the attack packets and 2) different
structures of the network graph. The RPPM algorithm provides an
autonomous way for the original PPM algorithm to determine its
termination, and it is a promising means of enhancing the reliability of
the PPM algorithm.
5. INTRUSION DETECTION IN HOMOGENEOUS &

HETEROGENEOUS WIRELESS SENSOR NETWORKS
Abstract
Intrusion detection in Wireless Sensor Network (WSN) is of

practical interest in many applications such as detecting an intruder in
a battlefield. The intrusion detection is defined as a mechanism for a
WSN to detect the existence of inappropriate, incorrect, or anomalous
moving attackers. In this paper, we consider this issue according to
heterogeneous WSN models. Furthermore, we consider two sensing
detection models: single-sensing detection and multiple-sensing
detection... Our simulation results show the advantage of multiple
sensor heterogeneous WSNs.
6. PERFORMANCE OF A SPECULATIVE TRANSMISSION

SCHEME FOR SCHEDULING LATENCY REDUCTION
Abstract
This work was motivated by the need to achieve low latency in

an input centrally-scheduled cell switch for high-performance
computing applications; specifically, the aim is to reduce the latency
incurred between issuance of a request and arrival of the
corresponding grant. We introduce a speculative transmission scheme
to significantly reduce the average latency by allowing cells to proceed
without waiting for a grant. It operates in conjunction with any
centralized matching algorithm to achieve a high maximum utilization.
An analytical model is presented to investigate the efficiency of the

speculative transmission scheme employed in a non-blocking N*NR
input-queued crossbar switch with receivers R per output. The results
demonstrate that the can be almost entirely eliminated for loads up to
50%. Our simulations confirm the analytical results.
7. TWO TECHNIQUES FOR FAST COMPUTATION OF

CONSTRAINED SHORTEST PATH
Abstract
Computing constrained shortest paths is fundamental to some

important network functions such as QoS routing, MPLS path selection,
ATM circuit routing, and traffic engineering. The problem is to find the
cheapest path that satisfies certain constraints. In particular, finding
the cheapest delay-constrained path is critical for real-time data flows

such as voice/video calls. Because it is NP-complete, much research
has been designing heuristic algorithms that solve the -approximation
of the problem with an adjustable accuracy. A common approach is to
discretize (i.e., scale and round) the link delay or link cost, which
transforms the original problem to a simpler one solvable in
polynomial time. The efficiency of the algorithms directly relates to the
magnitude of the errors introduced during discretization. In this paper,
we propose two techniques that reduce the discretization errors, which
allow faster algorithms to be designed. Reducing the overhead of
computing constrained shortest paths is practically important for the
successful design of a high-throughput QoS router, which is limited at
both processing power and memory space. Our simulations show that
the new algorithms reduce the execution time by an order of
magnitude on power-law topologies with 1000 nodes.
8. USING THE CONCEPTUAL COHESION OF CLASSES FOR

FAULT PREDICTION IN OBJECT ORIENTED SYSTEMS
Abstract
High cohesion is desirable property in software systems to

achieve reusability and maintainability. In this project we are
measures for cohesion in Object-Oriented (OO) software reflect
particular interpretations of cohesion and capture different aspects of
it. In existing approaches the cohesion is calculate from the structural
information for example method attributes and references. In
conceptual cohesion of classes, i.e. in our project we are calculating
the unstructured information from the source code such as comments
and identifiers. Unstructured information is embedded in the source
code. To retrieve the unstructured information from the source code
Latent Semantic Indexing is used. A large case study on three open
source software systems is presented which compares the new
measure with an extensive set of existing metrics and uses them to
construct models that predict software faults. In our project we are
achieving the high cohesion and we are predicting the fault in Object –
Oriented Systems
9. TRUTH DISCOVERY WITH MULTIPLE CONFLICTING

INFORMATION PROVIDERS ON WEB
Abstract
The world-wide web has become the most important

information source for most of us. Unfortunately, there is no guarantee
for the correctness of information on the web. Moreover, different web
sites often provide conflicting in-formation on a subject, such as
different specifications for the same product. In this paper we propose
a new problem called Veracity that is conformity to truth, which
studies how to find true facts from a large amount of conflicting
information on many subjects that is provided by various web sites.
We design a general framework for the Veracity problem, and invent
an algorithm called Truth Finder, which utilizes the relationships
between web sites and their information, i.e., a web site is trustworthy
if it provides many pieces of true information, and a piece of
information is likely to be true if it is provided by many trustworthy
web sites. Our experiments show that Truth Finder successfully finds
true facts among conflicting information, and identifies trustworthy
web sites better than the popular search engines.
10. LOCATION BASED SPATIAL QUERY PROCESSING IN

WIRELESS BROADCAST ENVIRONMENTS
Abstract
Location-based spatial queries (LBSQ s) refer to spatial queries

whose answers rely on the location of the inquirer. Efficient processing
of LBSQ s is of critical importance with the ever-increasing deployment
and use of mobile technologies. We show that LBSQ s has certain
unique characteristics that the traditional spatial query processing in
centralized databases does not address. For example, a significant
challenge is presented by wireless broadcasting environments, which
have excellent scalability but often exhibit high-latency database
access. In this paper, we present a novel query processing technique
that, though maintaining high scalability and accuracy, manages to
reduce the latency considerably in answering LBSQ s. Our approach is
based on peer-to-peer sharing, which enables us to process queries
without delay at a mobile host by using query results cached in its
neighboring mobile peers. We demonstrate the feasibility of our
approach through a probabilistic analysis, and we illustrate the appeal
of our technique through extensive simulation results.
11. BANDWIDTH ESTIMATION FOR IEEE 802.11 BASED ADHOC

NETWORK
Abstract
Since 2005, IEEE 802.11-based networks have been able to

provide a certain level of quality of service (QoS) by the means of
service differentiation, due to the IEEE 802.11e amendment. However,
no mechanism or method has been standardized to accurately
evaluate the amount of resources remaining on a given channel. Such
an evaluation would, however, be a good asset for bandwidth-
constrained applications. In multihop ad hoc networks, such evaluation
becomes even more difficult. Consequently, despite the various
contributions around this research topic, the estimation of the
available bandwidth still represents one of the main issues in this field.
In this paper, we propose an improved mechanism to estimate the
available bandwidth in IEEE 802.11-based ad hoc networks. Through
simulations, we compare the accuracy of the estimation we propose to
the estimation performed by other state-of-the-art QoS protocols,
BRuIT, AAC, and QoS-AODV.
12. MODELING & AUTOMATED CONTAINMENT OF WORMS
Abstract
Self-propagating codes, called worms, such as Code Red,

Nimda, and Slammer, have drawn significant attention due to their
enormously adverse impact on the Internet. Thus, there is great
interest in the research community in modeling the spread of worms
and in providing adequate defense mechanisms against them. In this
paper, we present a (stochastic) branching process model for
characterizing the propagation of Internet worms. The model is
developed for uniform scanning worms and then extended to
preference scanning worms. This model leads to the development of
an automatic worm containment strategy that prevents the spread of a
worm beyond its early stage. Specifically, for uniform scanning worms,
we are able to determine whether the worm spread will eventually
stop. We then extend our results to contain uniform scanning worms.
Our automatic worm containment schemes effectively contain both
uniform scanning worms and local preference scanning worms, and it
is validated through simulations and real trace data to be non
intrusive.
1. BENEFIT-BASED DATA CACHING IN AD HOC NETWORKS
Abstract
Data caching can significantly improve the efficiency of

information access in a wireless ad hoc network by reducing the access
latency and bandwidth usage. However, designing efficient distributed
caching algorithms is non-trivial when network nodes have limited
memory. In this article, we consider the cache placement problem of
minimizing total data access cost in ad hoc networks with multiple data
items and nodes with limited memory capacity. The above optimization
problem is known to be NP-hard. Defining benefit as the reduction in
total access cost, we present a polynomial-time centralized
approximation algorithm that provably delivers a solution whose
benefit is at least one-fourth (one-half for uniform-size data items) of
the optimal benefit. The approximation algorithm is amenable to
localized distributed implementation, which is shown via simulations to
perform close to the approximation algorithm. Our distributed

algorithm naturally extends to networks with mobile nodes. We
simulate our distributed algorithm using a network simulator (ns2),
and demonstrate that it significantly outperforms another existing
caching technique (by Yin and Cao [30]) in all important performance
metrics. The performance differential is particularly large in more
challenging scenarios, such as higher access frequency and smaller
memory.
14. CONSTRUCTING INTER-DOMAIN PACKET FILTERS TO

CONTROL IP SPOOFING BASED ON BGP UPDATES
Abstract
The Distributed Denial-of-Service (DDoS) attack is a serious
threat to the legitimate use of the Internet. Prevention mechanisms
are thwarted by the ability of attackers to forge or spoof the source
addresses in IP packets. By employing IP spoofing, attackers can
evade detection and put a substantial burden on the destination
network for policing attack packets. In this paper, we propose an inter-
domain packet filter (IDPF) architecture that can mitigate the level of
IP spoofing on the Internet. A key feature of our scheme is that it does
not require global routing information. IDPFs are constructed from the
information implicit in Border Gateway Protocol (BGP) route updates
and are deployed in network border routers. We establish the
conditions under which the IDPF framework correctly works in that it
does not discard packets with valid source addresses. Based on
extensive simulation studies, we show that, even with partial
deployment on the Internet, IDPFs can proactively limit the spoofing
capability of attackers. In addition, they can help localize the origin of

an attack packet to a small number of candidate networks.
15. ORTHOGONAL DATA EMBEDDING FOR BINARY IMAGES IN

MORPHOLOGICAL TRANSFORM DOMAIN- A HIGH-CAPACITY
APPROACH
Abstract
This paper proposes a data-hiding technique for binary images

in morphological transform domain for authentication purpose. To
achieve blind watermark extraction, it is difficult to use the detail
coefficients directly as a location map to determine the data-hiding
locations. Hence, we view flipping an edge pixel in binary images as
shifting the edge location one pixel horizontally and vertically. Based
on this observation, we propose an interlaced morphological binary
wavelet transform to track the shifted edges, which thus facilitates
blind watermark extraction and incorporation of cryptographic
signature. Unlike existing block-based approach, in which the block
size is constrained by 3times3 pixels or larger, we process an image in
2times2 pixel blocks. This allows flexibility in tracking the edges and
also achieves low computational complexity. The two processing cases

that flipping the candidates of one does not affect the flippability
conditions of another are employed for orthogonal embedding, which
renders more suitable candidates can be identified such that a larger
capacity can be achieved. A novel effective Backward-Forward
Minimization method is proposed, which considers both backwardly
those neighboring processed embeddable candidates and forwardly
those unprocessed flippable candidates that may be affected by
flipping the current pixel. In this way, the total visual distortion can be
minimized. Experimental results demonstrate the validity of our
arguments.
52708. PROTECTION OF DATABASE SECURITY VIA

COLLABORATIVE INFERENCE DETECTION
Abstract
Malicious users can exploit the correlation among data to infer

sensitive information from a series of seemingly innocuous data
accesses. Thus, we develop an inference violation detection system to
protect sensitive data content. Based on data dependency, database
schema and semantic knowledge.
we constructed a semantic inference model (SIM) that
represents the possible inference channels from any attribute to the
pre-assigned sensitive attributes. The SIM is then instantiated to a
semantic inference graph (SIG) for query-time inference violation
detection.
For a single user case, when a user poses a query, the
detection system will examine his/her past query log and calculate the
probability of inferring sensitive information. The query request will be

denied if the inference probability exceeds the pre specified threshold.
For multi-user cases, the users may share their query answers
to increase the inference probability. Therefore, we develop a model to
evaluate collaborative inference based on the query sequences of
collaborators and their task-sensitive collaboration levels.
Experimental studies reveal that information authoritativeness,
communication fidelity and honesty in collaboration are three key
factors that affect the level of achievable collaboration. An example is
given to illustrate the use of the proposed technique to prevent
multiple collaborative users from deriving sensitive information via
inference.
52709. DUAL-LINK FAILURE RESILIENCY THROUGH BACKUP LINK
MUTUAL EXCLUSION
Abstract
Networks employ link protection to achieve fast recovery from
link failures. While the first link failure can be protected using link
protection, there are several alternatives for protecting against the
second failure. This paper formally classifies the approaches to dual-
link failure resiliency. One of the strategies to recover from dual-link
failures is to employ link protection for the two failed links
independently, which requires that two links may not use each other in
their backup paths if they may fail simultaneously. Such a requirement
is referred to as backup link mutual exclusion (BLME) constraint and
the problem of identifying a backup path for every link that satisfies
the above requirement is referred to as the BLME problem. This paper
develops the necessary theory to establish the sufficient conditions for
existence of a solution to the BLME problem. Solution methodologies
for the BLME problem is developed using two approaches by: 1)
formulating the backup path selection as an integer linear program; 2)
developing a polynomial time heuristic based on minimum cost path

routing. The ILP formulation and heuristic are applied to six networks
and their performance is compared with approaches that assume
precise knowledge of dual- link failure. It is observed that a solution
exists for all of the six networks considered. The heuristic approach is
shown to obtain feasible solutions that are resilient to most dual-link
failures, although the backup path lengths may be significantly higher
than optimal. In addition, the paper illustrates the significance of the
knowledge of failure location by illustrating that network with higher
connectivity may require lesser capacity than one with a lower
connectivity to recover from dual-link failures
52710. ACTIVE LEARNING METHODS FOR INTERACTIVE

IMAGE RETRIEVAL
Abstract
Active learning methods have been considered with increased

interest in the statistical learning community. Initially developed within
a classification framework, a lot of extensions are now being proposed
to handle multimedia applications. This paper provides algorithms
within a statistical framework to extend active learning for online
content-based image retrieval (CBIR). The classification framework is
presented with experiments to compare several powerful classification
techniques in this information retrieval context. Focusing on interactive
methods, active learning strategy is then described. The limitations of
this approach for CBIR are emphasized before presenting our new
active selection process RETIN. First, as any active method is sensitive
to the boundary estimation between classes, the RETIN strategy
carries out a boundary correction to make the retrieval process more
robust. Second, the criterion of generalization error to optimize the

active learning selection is modified to better represent the CBIR
objective of database ranking. Third, a batch processing of images is
proposed. Our strategy leads to a fast and efficient active learning
scheme to retrieve sets of online images (query concept). Experiments
on large databases show that the RETIN method performs well in
comparison to several other active strategies.
52711. SECURITY IN LARGE MEDIATOR PROTOCOLS
Abstract
The combination of 3AQKDP (implicit) and 3AQKDPMA (explicit)

quantum cryptography is used to provide authenticated secure
communication between sender and receiver. In quantum
cryptography, quantum key distribution protocols (QKDPs) employ
quantum mechanisms to distribute session keys and public discussions
to check for eavesdroppers and verify the correctness of a session key.
However, public discussions require additional communication rounds
between a sender and receiver. The advantage of quantum
cryptography easily resists replay and passive attacks.
A 3AQKDP with implicit user authentication, which ensures that

confidentiality is only possible for legitimate users and mutual
authentication is achieved only after secure communication using the

session key start.
In implicit quantum key distribution protocol(3AQKDP) have two

phases such as setup phase and distribution phase to provide three
party authentication with secure session key distribution. In this
system there is no mutual understanding between sender and
receiver. Both sender and receiver should communicate over trusted
center.
In explicit quantum key distribution protocol (3AQKDPMA) have

two phases such as setup phase and distribution phase to provide
three party authentications with secure session key distribution. I
have mutual understanding between sender and receiver. Both sender
and receiver should communicate directly with authentication of
trusted center.
Disadvantage of separate process 3AQKDP and 3AQKDPMA

were provide the authentication only for message, to identify the
security threads in the message. Not identify the security threads in
the session key.
20. A SIGNATURE BASED INDEXING METHOD FOR EFFICIENT

CONTENT BASED RETRIEVAL OF RELATIVE TEMPORAL
PATTERNS
Abstract
Project aims for efficient content based retrieval process of
relative temporal pattern using signature based indexing method. Rule
discovery algorithms in data mining generate a large number of
patterns/rules, sometimes even exceeding the size of the underlying
database, with only a small fraction being of interest to the user. It is
generally understood that interpreting the discovered patterns/rules to
gain insight into the domain is an important phase in the knowledge
discovery process. However, when there are a large number of
generated rules, identifying and analyzing those that are interesting
becomes difficult. We address the problem of efficiently retrieving
subsets of a large collection of previously discovered temporal
patterns. When processing queries on a small database of temporal
patterns, sequential scanning of the patterns followed by
straightforward computations of query conditions is sufficient.
However, as the database grows, this procedure can be too slow, and
indexes should be built to speed up the queries. The problem is to

determine what types of indexes are suitable for improving the speed
of queries involving the content of temporal patterns. We propose a
system with signature-based indexing method to speed up content-
based queries on temporal patterns And It’s used to optimize the
storage and retrieval of a large collection of relative temporal patterns.
The use of signature files improves the performance of temporal
pattern retrieval. This retrieval system is currently being combined
with visualization techniques for monitoring the behavior of a single
pattern or a group of patterns over time.
21 Structure and Texture Filling-In of Missing Image Blocks in Wireless

Transmission and Compression Applications
Abstract
An approach for filling-in blocks of missing data in wireless

image transmission is presented in this paper. When compression
algorithms such as JPEG are used as part of the wireless transmission
process, images are first tiled into blocks of 8 x 8 pixels. When such
images are transmitted over fading channels, the effects of noise can
destroy entire blocks of the image. Instead of using common
retransmission query protocols, we aim to reconstruct the lost data
using correlation between the lost block and its neighbors. If the lost
block contained structure, it is reconstructed using an image in
painting algorithm, while texture synthesis is used for the textured
blocks. The switch between the two schemes is done in a fully
automatic fashion based on the surrounding available blocks. The
performance of this method is tested for various images and
combinations of lost blocks. The viability of this method for image
compression, in association with loss JPEG, is also discussed.
22 Retrieving Files Using Content Based Searching and presenting it in

Carousel view
Abstract
The current project is divided into four inter-dependent phases.
Phase 1 deals with designing algorithms for summarizing and

indexing text files. In case of multimedia files the meta data files are
created manually by the programmers. This phase also involves
algorithms for converting .doc and .pdf files to .txt format. In this
system the searching is not done at the run time as indexing is done
before hand.
In Phase 2 folders would be replaced by a new construct called
a library. A library is a virtual folder that intelligently gathers
information about files on the system and presents them to the users.
The concept of folders ceases to exist. Instead, the users are
privileged enough to view similar files together irrespective of their
location in the physical memory. This enables retrieval of files based
on various parameters. This concept is named as CAROUSEL VIEW
after the proposed system with the same name to be launched by the
Microsoft’s Windows Longhorn which is a complete revolution in itself.
Phase 3 establishes a common peer to peer (P2P) protocol that

enables remote querying over other terminals in the network. This
module allows this software to be used across the internet and also
over various LANs. In a nutshell, this project aims at creating a system
which is highly enhanced over the existing traditional ones and
providing a user friendly environment.
23 XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks
Abstract
The XTC AD-HOC network topology control algorithm

introduced shows three main advantages over previously proposed
algorithms. First, it is extremely simple and strictly local. Second, it
does not assume the network graph to be a unit disk graph; XTC
proves correct also on general weighted network graphs. Third, the
algorithm does not require availability of node position information.
Instead, XTC operates with a general notion of order over the
neighbors' link qualities. In the special case of the network graph
being a unit disk graph, the resulting topology proves to have bounded
degree, to be a planar graph, and - on average-case graphs - to be a
good spanner.
24 Distributed cache updating for the Dynamic source routing

protocol
Abstract
On-demand routing protocols use route caches to make

routing decisions. Due to mobility, cached routes easily become stale.
To address the cache staleness issue, prior work in DSR used
heuristics with ad hoc parameters to predict the lifetime of a link or a
route. However, heuristics cannot accurately estimate timeouts
because topology changes are unpredictable. In this paper, we
propose proactively disseminating the broken link information to the
nodes that have that link in their caches. We define a new cache
structure called a cache table and present a distributed cache update
algorithm. Each node maintains in its cache table the information
necessary for cache updates. When a link failure is detected, the
algorithm notifies all reachable nodes that have cached the link in a
distributed manner. The algorithm does not use any ad hoc
parameters, thus making route caches fully adaptive to topology
changes. We show that the algorithm outperforms DSR with path
caches and with Link-Max Life, an adaptive timeout mechanism for link
caches. We conclude that proactive cache updating is key to the
adaptation of on-demand routing protocols to mobility.
25 An Adaptive Programming Model for Fault-Tolerant Distributed

Computing
Abstract
The capability of dynamically adapting to distinct runtime

conditions is an important issue when designing distributed systems
where negotiated quality of service (QOS) cannot always be delivered
between processes. Providing fault tolerance for such dynamic
environments is a challenging task. Considering such a context, this
paper proposes an adaptive programming model for fault-tolerant
distributed computing, which provides upper-layer applications with
process state information according to the current system synchrony
(or QOS). The underlying system model is hybrid, composed by a
synchronous part (where there are time bounds on processing speed
and message delay) and an asynchronous part (where there is no time
bound). However, such a composition can vary over time, and, in
particular, the system may become totally asynchronous (e.g., when
the underlying system QOS degrade) or totally synchronous.
Moreover, processes are not required to share the same view of the
system synchrony at a given time. To illustrate what can be done in
this programming model and how to use it, the consensus problem is
taken as a benchmark problem. This paper also presents an
implementation of the model that relies on a negotiated quality of
service (QOS) for communication channels.
26 Face Recognition Using Laplacian faces
Abstract
The face recognition is a fairly controversial subject right now.

A system such as this can recognize and track dangerous criminals and
terrorists in a crowd, but some contend that it is an extreme invasion
of privacy. The proponents of large-scale face recognition feel that it
is a necessary evil to make our country safer. It could benefit the
visually impaired and allow them to interact more easily with the
environment. Also, a computer vision-based authentication system
could be put in place to allow computer access or access to a specific
room using face recognition. Another possible application would be to
integrate this technology into an artificial intelligence system for more
realistic interaction with humans.
We propose an appearance-based face recognition method

called the Laplacianface approach. By using Locality Preserving
Projections (LPP), the face images are mapped into a face subspace for
analysis. Different from Principal Component Analysis (PCA) and Linear
Discriminant Analysis (LDA) which effectively see only the Euclidean
structure of face space, LPP finds an embedding that preserves local
information, and obtains a face subspace that best detects the
essential face manifold structure. The Laplacian faces are the optimal
linear approximations to the eigen functions of the Laplace Beltrami
operator on the face manifold. In this way, the unwanted variations
resulting from changes in lighting, facial expression, and pose may be
eliminated or reduced.
Theoretical analysis shows that PCA, LDA, and LPP can be

obtained from different graph models. We compare the proposed
Laplacianface approach with Eigenface and Fisherface methods on
three different face data sets. Experimental results suggest that the
proposed Laplacianface approach provides a better representation and
achieves lower error rates in face recognition. Principal Component
Analysis (PCA) is a statistical method under the broad title of factor
analysis. The purpose of PCA is to reduce the large dimensionality of
the data space (observed variables) to the smaller intrinsic
dimensionality of feature space (independent variables), which are
needed to describe the data economically. This is the case when there
is a strong correlation between observed variables. The jobs which PCA
can do are prediction, redundancy removal, feature extraction, data
compression, etc. Because PCA is a known powerful technique which
can do something in the linear domain, applications having linear
models are suitable, such as signal processing, image processing,
system and control theory, communications, etc.
The main idea of using PCA for face recognition is to express

the large 1-D vector of pixels constructed from 2-D face image into the
compact principal components of the feature space. This is called
eigenspace projection. Eigenspace is calculated by identifying the
eigenvectors of the covariance matrix derived from a set of fingerprint
images (vectors).
27 Predictive Job Scheduling in a Connection Limited System using

Parallel Genetic Algorithm
Abstract
Job scheduling is the key feature of any computing

environment and the efficiency of computing depends largely on the
scheduling technique used. Intelligence is the key factor which is
lacking in the job scheduling techniques of today. Genetic algorithms
are powerful search techniques based on the mechanisms of natural
selection and natural genetics.
Multiple jobs are handled by the scheduler and the
resource the job needs are in remote locations. Here we assume that
the resource a job needs are in a location and not split over nodes and
each node that has a resource runs a fixed number of jobs. The
existing algorithms used are non predictive and employs greedy based
algorithms or a variant of it. The efficiency of the job scheduling
process would increase if previous experience and the genetic
algorithms are used. In this paper, we propose a model of the
scheduling algorithm where the scheduler can learn from previous
experiences and an effective job scheduling is achieved as time
progresses.
28 A Distributed Database Architecture for Global Roaming in Next-

Generation Mobile Networks
Abstract: The next-generation mobile network will support terminal

mobility, personal mobility, and service provider portability, making
global roaming seamless. A location-independent personal
telecommunication number (PTN) scheme is conducive to
implementing such a global mobile system. However, the non-
geographic PTNs coupled with the anticipated large number of mobile
users in future mobile networks may introduce very large centralized
databases. This necessitates research into the design and performance
of high-throughput database technologies used in mobile systems to
ensure that future systems will be able to carry efficiently the
anticipated loads. This paper proposes a scalable, robust, efficient
location database architecture based on the location-independent
PTNs. The proposed multi tree database architecture consists of a
number of database subsystems, each of which is a three-level tree
structure and is connected to the others only through its root. By
exploiting the localized nature of calling and mobility patterns, the
proposed architecture effectively reduces the database loads as well as
the signaling traffic incurred by the location registration and call
delivery procedures. In addition, two memory-resident database
indices, memory-resident direct file and T-tree, are proposed for the
location databases to further improve their throughput. Analysis model
and numerical results are presented to evaluate the efficiency of the
proposed database architecture. Results have revealed that the
proposed database architecture for location management can
effectively support the anticipated high user density in the future
mobile networks.
29 Noise Reduction by Fuzzy Image Filtering
Abstract
A new fuzzy filter is presented for the noise reduction of

images corrupted with additive noise. The filter consists of two stages.
The first stage computes a fuzzy derivative for eight different
directions. The second stage uses these fuzzy derivatives to perform
fuzzy smoothing by weighting the contributions of neighboring pixel
values. Both stages are based on fuzzy rules which make use of
membership functions. The filter can be applied iteratively to
effectively reduce heavy noise. In particular, the shape of the
membership functions is adapted according to the remaining noise
level after each iteration, making use of the distribution of the
homogeneity in the image. A statistical model for the noise distribution
can be incorporated to relate the homogeneity to the adaptation
scheme of the membership functions. Experimental results are
obtained to show the feasibility of the proposed approach. These
results are also compared to other filters by numerical measures and
visual inspection.
30 A Novel Secure Communication Protocol for Ad Hoc networks [SCP]
Abstract
An ad hoc network is a self organized entity with a number of

mobile nodes without any centralized access point and also there is a
topology control problem which leads to high power consumption and
no security, while routing the packets between mobile hosts.
Authentication is one of the important security requirements of a
communication network. The common authentication schemes are not
applicable in Ad hoc networks. In this paper, we propose a secure
communication protocol for communication between two nodes in ad
hoc networks. This is achieved by using clustering techniques. We
present a novel secure communication framework for ad hoc networks
(SCP); which describes authentication and confidentiality when packets
are distributed between hosts with in the cluster and between the
clusters. These cluster head nodes execute administrative functions
and network key used for certification. The cluster head nodes (CHs)
perform the major operations to achieve our SCP framework with help
of Kerberos authentication application and symmetric key
cryptography technique which will be secure reliable transparent and
scalable and will have less over head.
31 Hybrid Intrusion Detection with Weighted Signature Generation over

Anomalous Internet Episodes(HIDS)
Abstract
This paper reports the design principles and evaluation results

of a new experimental hybrid intrusion detection system (HIDS). This
hybrid system combines the advantages of low false-positive rate of
signature-based intrusion detection system (IDS) and the ability of
anomaly detection system (ADS) to detect novel unknown attacks. By
mining anomalous traffic episodes from Internet connections, we build
an ADS that detects anomalies beyond the capabilities of signature-
based SNORT or Bro systems. A weighted signature generation
scheme is developed to integrate ADS with SNORT by extracting
signatures from anomalies detected. HIDS extracts signatures from
the output of ADS and adds them into the SNORT signature database
for fast and accurate intrusion detection. By testing our HIDS scheme
over real-life Internet trace data mixed with 10 days of Massachusetts
Institute of Technology/ Lincoln Laboratory (MIT/LL) attack data set,
our experimental results show a 60 percent detection rate of the HIDS,
compared with 30 percent and 22 percent in using the SNORT and Bro
systems, respectively. This sharp increase in detection rate is obtained
with less than 3 percent false alarms. The signatures generated by
ADS upgrade the SNORT performance by 33 percent. The HIDS
approach proves the vitality of detecting intrusions and anomalies,
simultaneously, by automated data mining and signature generation
over Internet connection episodes.
32. Network border patrol: preventing congestion collapse and

promoting fairness in the Internet
Abstract
The Internet's excellent scalability and robustness result in part

from the end-to-end nature of Internet congestion control. End-to-end
congestion control algorithms alone, however, are unable to prevent

the congestion collapse and unfairness created by applications that are
unresponsive to network congestion. To address these maladies, we
propose and investigate a novel congestion-avoidance mechanism
called network border patrol (NBP). NBP entails the exchange of
feedback between routers at the borders of a network in order to
detect and restrict unresponsive traffic flows before they enter the
network, thereby preventing congestion within the network. Moreover,
NBP is complemented with the proposed enhanced core-stateless fair
queuing (ECSFQ) mechanism, which provides fair bandwidth
allocations to competing flows. Both NBP and ECSFQ are compliant
with the Internet philosophy of pushing complexity toward the edges
of the network whenever possible. Simulation results show that NBP
effectively eliminates congestion collapse and that, when combined
with ECSFQ, approximately max-min fair bandwidth allocations can be
achieved for competing flows.
33 Application of BPCS steganography to wavelet compressed
video
Abstract
This paper presents a steganography method using lossy

compressed video which provides a natural way to send a large
amount of secret data. The proposed method is based on wavelet

compression for video data and bit-plane complexity segmentation
(BPCS) steganography. In wavelet-based video compression methods
such as 3-D set partitioning in hierarchical trees (SPIHT) algorithm and
motion-JPEG2000, wavelet coefficients in discrete wavelet transformed
video are quantized into a bit-plane structure and therefore BPCS
steganography can be applied in the wavelet domain. 3-D SPIHT-BPCS
steganography and motion-JPEG2000-BPCS steganography are
presented and tested, which are the integration of 3-D SPIHT video
coding and BPCS steganography and that of motion-JPEG2000 and
BPCS, respectively. Experimental results show that 3-D SPIHT-BPCS is
superior to motion-JPEG2000-BPCS with regard to embedding
performance.
34 An Acknowledgment-Based Approach For The Detection Of Routing

Misbehavior In Mantes
Abstract
We study routing misbehavior in MANETs (Mobile Ad Hoc

Networks) in this paper. In general, routing protocols for MANETs are
designed based on the assumption that all participating nodes are fully
cooperative. However, due to the open structure and scarcely available

battery-based energy, node misbehaviors may exist. One such routing
misbehavior is that some selsh nodes will participate in the route
discovery and maintenance processes but refuse to forward data
packets. In this paper, we propose the 2ACK scheme that serves as an
add-on technique for routing schemes to detect routing misbehavior
and to mitigate their adverse effect. The main idea of the 2ACK
scheme is to send two-hop acknowledgment packets in the opposite
direction of the routing path. In order to reduce additional routing
overhead, only a fraction of the received data packets are
acknowledged in the 2ACK scheme. Analytical and simulation results
are presented to evaluate the performance of the proposed scheme.
35 Homogenous Network Control and Implementation
Abstract
This project, titled “Homogenous Network Control and

Implementation”, presents a way of developing integrity-preserved
computer networks. The proposed generic network is based on a
detailed review and comparative analysis of ongoing research work in
the field of homogenous distributed systems and fault-tolerant
systems. The presented network facilitates easy sharing of information

among the systems in the network by establishing a peer to peer
network connection among all the systems.
Homogenous Network of Workstations (HNOW systems)
comprises of similar kinds of PC’s, Workstations connected over a
single network. In a homogenous network, each machine has the
ability to send data to another machine, irrespective of the working
conditions of the server. In general, a set of networks is classified as
homogenous, if the networks are “same”(e.g., using the same basic
technology, frame format and addressing); a set of networks is
classified as heterogeneous if the set contains network that differ. The
theme of the project is centered on the development of a homogenous
network and establishment of process continuation module, which
plays an imperative part in maintaining the network integrity
36 Neural Networks for Unicode Optical Character recognition
Abstract
The central objective of this project is demonstrating the

capabilities of Artificial Neural Network implementations in recognizing
extended sets of optical language symbols. The applications of this
technique range from document digitizing and preservation to
handwritten text recognition in handheld devices. The classic difficulty
of being able to correctly recognize even typed optical language
symbols is the complex irregularity among pictorial representations of

the same character due to variations in fonts, styles and size. This
irregularity undoubtedly widens when one deals with handwritten
characters.
Hence the conventional programming methods of mapping
symbol images into matrices, analyzing pixel and/or vector data and
trying to decide which symbol corresponds to which character would
yield little or no realistic results. Clearly the needed methodology will
be one that can detect ‘proximity’ of graphic representations to known
symbols and make decisions based on this proximity. To implement
such proximity algorithms in the conventional programming one needs
to write endless code, one for each type of possible irregularity or
deviation from the assumed output either in terms of pixel or vector
parameters, clearly not a realistic fare. An emerging technique in this
particular application area is the use of Artificial Neural Network
implementations with networks employing specific guides (learning
rules) to update the links (weights) between their nodes. Such
networks can be fed the data from the graphic analysis of the input
picture and trained to output characters in one or another form.
Specifically some network models use a set of desired outputs to
compare with the output and compute an error to make use of in
adjusting their weights. Such learning rules are termed as Supervised
Learning.
One such network with supervised learning rule is the Multi-
Layer Perceptron (MLP) model. It uses the Generalized Delta Learning
Rule for adjusting its weights and can be trained for a set of
input/desired output values in a number of iterations. The very nature
of this particular model is that it will force the output to one of nearby
values if a variation of input is fed to the network that it is not trained
for, thus solving the proximity issue. Both concepts will be discussed in
the introduction part of this report. The project has employed the MLP
technique mentioned and excellent results were obtained for a number
of widely used font types. The technical approach followed in
processing input images, detecting graphic symbols, analyzing and
mapping the symbols and training the network for a set of desired
Unicode characters corresponding to the input images are discussed in
the subsequent sections. Even though the implementation might have
some limitations in terms of functionality and robustness, the
researcher is confident that it fully serves the purpose of addressing
the desired objectives.
37. A BGP based mechanism for lowest cost routing
ABSTRACT
The routing of traffic between internet domains and autonomous systems is

handled by the Border Gateway Protocol (BGP). The internet comprised of many
administrative domains to transmit the packets from one autonomous system to another
or with in the system.
There is set of bidirectional links between the no of nodes and the network is an
AS graph because the routes selection problem arises when a node has multiple potential
routes to destination .The main goal is to send each packet along the least cost path(LCP),
the pricing mechanism must be strategy proof so that agents have no incentives to lie
about their costs.
38. TRAINING BASED NUMERICAL CHARACTER RECOGNITION USING

NEURAL NETWORKS
ABSTRACT
The implementation of Training based Numeric Character Recognition is a

handwritten number recognition system by comparing with existing images. It can be
developed by using image processing and neural network technique. Before the computer
can recognize handwritten number, a set of handwritten number images needed to be
provided to computer to teach her about what the image mean does. The chain codes
approach is used to extract out the image feature information based on their shape. The
image information which has been converted into a set of numerical number will be
feeded into the neural network. Neural Network will be trained and continuous to
improve based on its learning experience. After a well trained Neural Network has been
constructed, any test image will be processed using the above mentioned image
processing technique. A set of numerical number will be obtained and feeded into the
Neural Network. The output of the Neural Network is the result of the recognition.
39. An algorithm approach for to identify network link failures
ABSTRACT
Due to the Internet’s complexity and various routing policies, it is difficult to

locate the exact connectivity changes that occur from time to time which are the causes
for large volumes of BGP update messages.
“An Algorithmic Approach to Identify Network Link Failures” is an approach to
identify these connectivity changes exactly. Here an algorithm, called FindChange is
used that can pin down the origin of routing changes due to any single link failure or link
restoration.
The algorithm set, FindChange uses a simplified model of BGP and graph model
of internet. It has distinctions from BGP model such as assuming one best path between
two nodes, single connection between two nodes. FindChange takes the update messages
collected from vantage points as input and accurately locates the link changes. The input
is taken as graphs and by making the comparisons of edges between two nodes the links
which are failed, added or restored and links unchanged are identified. Using this
information path between two nodes is computed before and after the connectivity
changes.
40. DETECTION OF MISBEHAVIOUR IN MANETS
ABSTRACT
Routing misbehavior in MANETs (Mobile Ad Hoc Networks) is studied in this

project. In general, routing protocols for MANETs are designed based on the assumption
that all participating nodes are fully cooperative. However, due to the open structure and
scarcely available battery-based energy, node misbehaviors may exist. One such routing
misbehavior is that some selfish nodes will participate in the route discovery and
maintenance processes but refuse to forward data packets.
In this project, we propose the 2ACK scheme that serves as an add-on technique
for routing schemes (such as DSR) to detect routing misbehavior and to mitigate their
packets in the opposite direction of the routing path.
General And Web Application Projects Abstract

41. Online handwritten script reorganization
ABSTRACT
Automatic identification of handwritten script facilitates many important

applications such as automatic transcription of multilingual documents and search for
documents on the Web containing a particular script. The increase in usage of handheld
devices which accept handwritten input has created a growing demand for algorithms that
can efficiently analyze and retrieve handwritten data. This project proposes a method to
classify words and lines in an online handwritten document into one of the six major
scripts: Arabic, Cyrillic, Devnagari, Han, Hebrew, or Roman. The classification is based
on 11 different spatial and temporal features extracted from the strokes of the words. The
proposed system attains an overall classification accuracy of 87.1 percent at the word
level with 5-fold cross validation on a data set containing 13,379 words. The
classification accuracy improves to 95 percent as the number of words in the test sample
is increased to five, and to 95.5 percent for complete text lines consisting of an average of
seven words.
System Requirements
Language : Java1.5
Front End Tool: Swing,
Operating System: Windows 98.
Processor : Intel Pentium III Processor
Random Memory: 128MB
Hard Disk :20GB
Processor Speed: 300 min
42. An Optimized distributed rule mining algorithm
ABSTRACT
With the explosive growth of information sources available on the World Wide
Web, it has become increasingly necessary for users to utilize automated tools in find the
desired information resources, and to track and analyze their usage patterns.
Association rule mining is an active data mining research area. However, most
ARM algorithms cater to a centralized environment. In contrast to previous ARM
algorithms, ODAM is a distributed algorithm for geographically distributed data sets that
reduces communication costs. Recently, as the need to mine patterns across distributed
databases has grown, Distributed Association Rule Mining (D-ARM) algorithms have
been developed. These algorithms, however, assume that the databases are either
horizontally or vertically distributed. In the special case of databases populated from
information extracted from textual data, existing D-ARM algorithms cannot discover
rules based on higher-order associations between items in distributed textual documents
that are neither vertically nor horizontally distributed, but rather a hybrid of the two.
Modern organizations are geographically distributed. Typically, each site locally
stores its ever increasing amount of day-to-day data. Using centralized data mining to
discover useful patterns in such organizations' data isn't always feasible because merging
data sets from different sites into a centralized site incurs huge network communication
costs. Data from these organizations are not only distributed over various locations but
also vertically fragmented, making it difficult if not impossible to combine them in a
central location. Distributed data mining has thus emerged as an active subarea of data
mining research.
A significant area of data mining research is association rule mining.
Unfortunately, most ARM algorithms focus on a sequential or centralized environment
where no external communication is required. Distributed ARM algorithms, on the other
hand, aim to generate rules from different data sets spread over various geographical
sites; hence, they require external communications throughout the entire process. DARM
algorithms must reduce communication costs so that generating global association rules
costs less than combining the participating sites' data sets into a centralized site.
43. Protocol scrubbing
ABSTRACT
This paper describes the design and implementation of protocol scrubbers.

Protocol scrubbers are transparent, interposed mechanisms for explicitly removing
network scans and attacks at various protocol layers. The transport scrubber supports
downstream passive network-based intrusion detection systems by converting ambiguous
network flows into well-behaved flows that are unequivocally interpreted by all
downstream endpoints. The fingerprint scrubber restricts an attacker’s ability to
determine the operating system of a protected host. As an example, this paper presents
the implementation of a TCP scrubber that eliminates inserton and evasion attacks—
attacks that use ambiguities to subvert detection—on passive network-based intrusion
detection systems,while preserving high performance. The TCP scrubber is based on a
novel, simplified state machine that performs in a fast and scalable manner. The
fingerprint scrubber is built upon the TCP scrubber and removes additional ambiguities
from flows that can reveal implementation-specific details about a host’s operating
system.
44. Structure text filling

ABSTRACT
An approach for filling-in blocks of missing data in wireless image transmission

is presented in this paper. When compression algorithms such as JPEG are used as part of
the wireless transmission process, images are first tiled into blocks of 8 8 pixels. When
such images are transmitted over fading channels, the effects of noise can destroy entire
blocks of the image.
Instead of using common retransmission query protocols, we aim to reconstruct
the lost data using correlation between the lost block and its neighbors. If the lost block
contained structure, it is reconstructed using an image inpainting algorithm, while texture
synthesis is used for the textured blocks. The switch between the two schemes is done in
a fully automatic fashion based on the surrounding available blocks. The performance of
this method is tested for various images and combinations of lost blocks.
For our implementation, we consider PGM (Portable Gray Map) images for filling
in of missing image blocks. We use Java 2, The Standard Edition for implementing the
algorithm, and the holes (missing blocks) are placed randomly for testing the project.
45. An Agent based intrusion detection
ABSTRACT

infrastructure provides customizable network services to packets. The custom network
services can be deployed by the user inside the packets themselves. In this paper we
propose the use of agent based intrusion detection and response. Agents are integrated
with the collaborative IDS in order to provide them with a wider array of information to
use their response activities.
46. Image Transport Protocol for the internet
ABSTRACT
Images account for a significant and growing fraction of Web downloads. The
traditional approach to transporting images uses TCP, which provides a generic reliable
in-order bytestream abstraction, but which is overly restrictive for image data. We
analyze the progression of image quality at the receiver with time, and show that the in-
order delivery abstraction provided by a TCP-based approach prevents the receiver
application from processing and rendering portions of an image when they actually
arrive. The end result is that an image is rendered in bursts interspersed with long idle
times rather than smoothly. This paper describes the design, implementation, and
evaluation of the image transport protocol (ITP) for image transmission over loss-prone
congested or wireless networks. ITP improves user-perceived latency using application-
level framing (ALF) and out-oforder application data unit (ADU) delivery, achieving
significantly better interactive performance as measured by the evolution of peak signal-
to-noise ratio (PSNR) with time at the receiver. ITP runs over UDP, incorporates
receiver-driven selective reliability, uses the congestion manager (CM) to adapt to
network congestion, and is customizable for specific image formats (e.g., JPEG and
JPEG2000). ITP enables a variety of new receiver post-processing algorithms such as
error concealment that further improve the interactivity and responsiveness of
reconstructed images. Performance experiments using our implementation across a
variety of loss conditions demonstrate the benefits of ITP in improving the interactivity
of image downloads at the receiver.
47. Hop by Hop
ABSTRACT
IP multicast is facing a slow take-off although it has been a hotly debated topic
for more than a decade. Many reasons are responsible for this status. Hence, the Internet
is likely to be organized with both unicast and multicast enabled networks. Thus, it is of
utmost importance to design protocols that allow the progressive deployment of the
multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop
multicast routing protocol). HBH adopts the source-specific channel abstraction to
simplify address allocation and implements data distribution using recursive unicast trees,
which allow the transparent support of unicast- only routers. An important original
feature of HBH is its tree construction algorithm that takes into account the unicast
routing asymmetries. Since most multicast routing protocols rely on the unicast
infrastructure, the unicast asymmetries impact the structure of the multicast trees.We
show through simulation that HBH outperforms other multicast routing protocols in
terms of the delay experienced by the receivers and the bandwidth consumption of the
multicast trees. Additionally, we show that HBH can be incrementally deployed and that
with a small fraction of HBH-enabled routers in the network HBH outperforms
application-layer multicast.
48. Optical Multicast routing in Ad hoc-network
ABSTRACT
An ad-hoc mobile network is a collection of mobile nodes that are

dynamically and arbitrarily located in such a manner that the interconnections
between nodes are capable of changing on a continual basis. The primary goal
of such an ad-hoc network routing protocol is correct and efficient route
establishment between a pair of nodes so that messages may be delivered in a
timely manner. Multicasting is to send single copy of a packet to all of those of
clients that requested it, and not to send multiple copies of a packet over the
same portion of the network, nor to send packets to clients who don’t want it.
The Adhoc Multicast Routing Protocol (AMRoute) presents a novel
approach for robust IP Multicast in mobile ad-hoc networks by exploiting user-
multicast trees and dynamic logical cores. It creates a bi-directional, shared tree
for data distribution using only group senders and receivers as tree nodes.
Unicast tunnels are used as tree links to connect neighbors on the User-
multicast tree. Thus AMRoute does not need to be supported by network nodes
that are not interested/capable of multicast, and group State Cost is incurred only
by group senders and receivers. Also, the use of tunnels as tree links implies that
tree structure does not need to change even in case of a dynamic network
topology, which reduces the signaling traffic and packet loss. Thus AMRoute
does not need to track network dynamics; the underlying Unicast protocol is
solely responsible for this function.
AMRoute does not require a specific Unicast routing protocol; therefore, it can
operate seamlessly over separate domains with different Unicast protocols. We have
tried to overcome the transient loops in the mesh creation. Also we have
implemented the Dynamic core migration technique by using a timer which
periodically changes the current core node, so that the efficiency of the protocol can
be improved.
49. Image Rendering for a Grid Tech
ABSTRACT
Grid Computing is an advanced technology of distributed computing. A Grid

is a collection of computers, storage and other devices which are joined together by any
means of communication like internet and which can be used to manage information and
solve their problems among themselves.
Grid Computing allows usage of the unutilized resources of other systems.

This is achieved by distributing the workload of the system to the other systems in order
to use their unused resources such as their memory, processor, etc which results in
balancing the workload, decreasing the network traffic, bandwidth, etc. This concept is
used in our project to render a large image in a very short time by distributing the image
to many systems for using their resources.
As the workload is evenly distributed among the grid network, even the large
work can be done in a short time itself. The main scope is that using the unused resources
to complete the work efficiently. This project helps to use the resources efficiently and
cost effective. Grid Computing is about making large amounts of computing power
available for applications and users. Collaborative development of Java Grid Engine
technology provides the proper development framework to ensure that Grid Engine
technology meets the requirements of the largest number of users.
50. Library Management System

ABSTRACT
This project is a complete package of Library Management. It deals with each

and every aspect of a library, which includes librarians’ id, details, issuing of cards to
barrowers etc. This project also keeps track of each and every book in different sections
like biology, history, mathematics, computers etc. and also has a database about all the
books records like books issued, books returned including their date and time. It also has
features like email to a librarian, daily reports to take down printout.
This is a windows application which can be developed in
Java Swings. The Library Management system is a very user-friendly program. It can be
incorporated with menus and tab canvas for a friendly environment.
S/W Requirements:
 Java Swings
H/W Requirements:
Processor : P IV 900 MHz+
Ram : 128 MB RAM
Hard Disk : 40 GB
51. Java Network File System
ABSTRACT
•Interoperability with other file systems is provided because JNFS runs on top
of a native file system. Thus, JNFS can provide access to files served over both local file
systems such as NTFS or a UNIX local file system, as well as network file systems such
as NFS or DFS.
•A Java implementation of JNFS ensures that it will work on all NC-
compliant devices, ie., more platform independent than NFS.
•Implementation of authentication protocol based on Access Control List
provides good security than NFS for granting access to files.
Advantages:
 The proposed system provides more interoperability with other file
systems.
 This system is more platform independent than the existing system.


 Good security is provided by the implementation of authentication

protocol based on Access Control
S/W Requirements:
 Java Swings, Networking
 MS-Access
 FILE SYSTEM - FAT-32/NTFS

 PROTOCOLS USED - TCP/IP AND FTP
H/W Requirements:
Processor : P IV 900 MHz+
Ram : 128 MB RAM
Hard Disk : 40 GB
52. Network Analyzer
ABSTRACT
This paper describes how to use an AEA Technology network analyzer to tune
an antenna. This paper discusses tuning issues at a general level; no specific model of
antenna is addressed here. For best link efficiency, you must properly tune the antenna to
resonance. Additionally, if the antenna has two or more adjustments available, you
should also tune the antenna for the optimum match. Resonance occurs when the reactive
portion of the antenna impedance is zero. This causes the voltage to be in phase with the
current, and allows the transmitter to generate its maximum power. SWR or return loss
readings do not provide enough information to determine resonance. You must use a
vector impedance reading to see resonance. The transmission lines used to feed the
antenna can add a layer of confusion to the measurements. If practical, tune the antenna
by itself first, then add in the feedline for more measurements.
53. Credit card approval system
ABSTRACT
An automated security credit checking system for checking a credit

application for fraud before a credit card is issued. The credit checking system scans the
credit application, and uses an optical character recognition program to check the
application. The credit checking system helps determine whether the application is
legible, and whether there is a discrepancy between the post mark and the mailing
address. The credit checking system automatically determines whether the application is
a corporate or individual application, and whether the application is one of numerous
requests from the same person, employer, or address. The credit checking system also
tracks the status of each application and the route each type of application has taken,
whether it is a corporate application, a suspected fraudulent application, a verified
fraudulent application, or a rejected application. This credit checking system checks on-
line national fraud information sources, and fraud information that is compiled by the
system and entered into system memory on a daily basis. A letter listing credit bureaus to
contact for protection is generated and sent to any victim of fraud detected during daily
credit checking. The automated credit checking system keeps a daily tally of the number
of corporate applications received, the percentage of individual applications approved,
the percentage of individual applications declined or rejected, and the percentage of
individual applications that were detected as being fraudulent.
54. Fashion Studios
ABSTRACT
It seems that over the past few decades a new art form has emerged. This is an
art form that painters, writers and photographers dive into on a daily basis. A piece of art
is considered to be abstract when the image is not clearly defined or visibly noticeable in
a quick glance. The word abstract means “not relating to concrete objects but expressing
something that can only be appreciated intellectually.” This is a relatively new art form
that takes mundane objects and transfers them to the unknown. Abstract art is one of the
fastest growing fields of photography. A photographer is able to take abstract pictures of
people, landscapes, places, animals and much more. A photographer is given a broader
range to experiment abstractly when using a digital camera but a regular camera can also
be used. There are several hints to help you when taking an abstract picture.
First of all let us discuss what an abstract picture is. An abstract picture can be
the wheel of a tractor, a photograph of a blurred chess piece, a screen window, a solitary
fork sitting alone atop a table or the face of a person, unrecognizable and changed.
Abstract art allows the photographer to create new images that only they may see or to
turn ordinary objects into a spectacular work of art. A graduate student several years ago,
who majored in abstract photography, was told to take a picture of her car. The student
then took pictures of different parts of her car and then made a collage of the collection of
pictures in the shape of her car. This is considered an abstract piece of artwork. When
taking an abstract photograph of a person stop and think before you press the shutter
button. Look at the subject and pick out the physical features, traits or characteristics that
you want the abstract photograph to be composed of. If the subject has been through a
tragedy, photograph the eyes, to convey this weight of sadness. If a person is joyous or
laughing photograph their mouth in order to bring that joy and free spirit to the
photograph.
Abstract photography is great for artists who want to broaden and expand their
creative range. It is also wonderful for photographers who have a unique eye and find
beauty in things that are extraordinary. Next time you have you camera out fool around
with a few of these abstract ideas. You might just fall in love with this relatively new art
form.
55. SNMP Simulator
ABSTRACT
The SNMP (Simple network management protocol) Agent Simulator enables

simulation of standalone SNMP agents to test and demonstrate SNMP-based
management applications. SNMP provides a method of managing network hosts such as
workstation or server computers, routers, bridges, and hubs from a centrally-located

computer running network management software. SNMP performs management services
by using a distributed architecture of management systems and agents.
SNMP provides the ability to monitor and communicate status information

between a variety of hosts. Both agents and management systems use SNMP messages to
inspect and communicate host information. SNMP messages are sent using the User
Datagram Protocol (UDP). The Internet Protocol (IP) is used to route the messages
between the management system and host.
The information that the management system request is contained in a

MANAGEMENT INFORMATION BASE. The MIB is a database that contains various
types of information about a networked computer, such as the version of network
software running on that computer and the available hard drive space. When simple
network management protocol (SNMP) management programs send requests to a
network device, the agent software on that device receives the requests and retrieves
information from MIBs. The agent then sends the requested information back to the
initiating SNMP management program.
Its unique ability to create default values from any SMI-compliant MIB or record
variables from an existing agent and create variations on this basic simulation enables
rapid simulation of SNMP devices. ALL SNMPv1, SNMPv2, and SNMPv3 operations
(Get/ GetNext /GetBulk /Set/Traps /Notifications) are supported. Simple network
management protocol (SNMP) provides security through the use of community names
and authentication traps. You can restrict SNMP communications for the agent, allowing
it to communicate with only a specific list of other SNMP management systems.
S/W Requirements:
Operating System: Windows XP/2000 Professional
Monitoring & Management Tools
H/W Requirements:

56. Public key validation For DNS Security Extension
ABSTRACT
The mapping or binding of IP addresses to host names became a major problem in

the rapidly growing Internet and the higher level binding effort went through different
stages of development up to the currently used Domain Name System (DNS).
The DNS Security is designed to provide security by combining
the concept of both the Digital Signature and Asymmetric key (Public key)
Cryptography. Here the Public key is send instead of Private key. The DNS security uses
Message Digest Algorithm to compress the Message(text file) and PRNG(Pseudo

Random Number Generator) Algorithm for generating Public and Private key. The
message combines with the Private key to form a Signature using DSA Algorithm, which
is send along with the Public key.
The receiver uses the Public key and DSA Algorithm to form a
Signature. If this Signature matches with the Signature of the message received, the
message is Decrypted and read else discarded.
The Domain Name System (DNS) has become a critical operational part of the
Internet Infrastructure, yet it has no strong security mechanisms to assure Data Integrity
or Authentication. Extensions to the DNS are described that provide these services to
security aware resolves are applications through the use of Cryptographic Digital
Signatures. These Digital Signatures are included zones as resource records.
57. Web’s Eye

ABSTRACT
Web’s Eye is software to develop web pages .Many people is aware of world
wide web and web pages, but not even capable of dreaming a web page design. The
Web’s Eye is q user friendly software which will assist you in designing a web page and
putting your creative ideas in the web to change you really professional in the World’s
Eyes. Suppose if you are a professional Web’s Eye will show a different face as an
intelligent colleague to navigate you. Web’s Eye uses Java @ Platform to develop an
extra featured user friendly software for creating web pages. Web page code generation is
done in HTML. The strong graphical user interface which is the unique property of this
project helps to distribute the tags intelligently . The project mainly aims at simplifying
user effort for creating a web page.
Extra features of Web’s Eye
• Full fledged html help covers all the areas of HTML
• Inbuilt browser to have a preview
• Integrated IE allows downloading
• Two modals one for Beginners and other for
Professionals
• Installation kit
• Vast library of button objects
58. Web Extractor
ABSTRACT
A web web extract is a program, which automatically traverses the web by
assistants/agents etc. web extract are also known as spiders, robots, worms etc.
web extract’s start by parsing a specified web page, noting any hypertext
links on that page that point to other web pages. They then parse those pages for new
links, and so on, recursively. Web-Importer software doesn't actually move around to
different computers on the Internet, as viruses or an intelligent agent does. An importer
resides on a single machine. The importer simply sends HTTP requests for documents to
other machines on the Internet, just as a web browser does when the user clicks on links.
All the importer really does is to automate the process of following links.
Web importing speed is governed not only by the speed of ones own
Internet connection, but also by the speed of the sites that are to be downloaded.
Especially if one is an importing site from multiple servers, the total downloading time
can be significantly reduced, if many downloads are done in parallel. This work
implements the “Breadth First Importing” algorithm, a refined version of one of the first
dynamic Web search algorithm, In order to build a major search engine or a large
repository such as the Internet Archive, high-performance importers start out at a small
set of pages and then explore other pages by following links in a “breadth first-like”
fashion.
Modules:
6. Filter web pages
7. Download pages
S/W Requirements:
H/W Requirements:
59. Web Shop
ABSTRACT
This project mainly deals with the operation of shopping the different goods,
which are available on the net corresponding to the particular web server so
we can call as Web Shop. Now a days Internet technology is growing to
communicate between the people and fulfilling their needs. Application on
Internet plays an important role in the application development, which is
providing all round solutions right from the mails to e-commerce On such
due-course, this project is stepping towards the Internet project
development used for shopping on net. This project contains mainly
transactions between the customers of the e-Shoppe Server so that to access
the goods that is available at the corresponding server.
In this project the customer after getting into the concern site as to make selection
of the products that are given displayed after that for the payment of the
money he/she as to go through login process and has to specify the credit
card details and get the products ordered.
The old customer’s customer-id and the related password should be valid for
shopping on the net. This project has been developed using HTML and on
the server side using Active Server Pages.NET with the help of VBScript as
both on server side and client side validations.
60. Visual Editor
ABSTRACT
Providing the users with the create documents main purpose of this application.
The project implementation is mainly concerned with create documents are
maintained by our editor. The project has been developed by utilizing
JAVA2, using Swing, IO, and wt(Abstract Window Toolkit) The successful
platform used is Windows and has its application in windows based System.
The abstraction for a System is its Documents, the usual methods in now-a-
days based on Windows Environments. The term Word Processing refers to
the activity carried out using a computer and suitable software to create,
view, edit, manipulate, transmit, store, retrieve and print documents.
61. Resource Share
ABSTRACT
This project describes how to perform file searching and data base searching efficiently
by loading a database or by using the name of the file. For this the server is going to run,
through the server the required files are going to be retrieved. Here we are used the ms access
data base to store the contents of the file and the fields of the data base which is loaded into the
server. The client is going to be request from which data base or from which file he would like
access the data to the server. The server is accepts the request and send the response by using
the multithreading technology.
S/W Requirements:
Language Name : Jdk1.5.0 or higher
Concepts used : MultiThreading
H/W Requirements:
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ0 Telecom Inventory Maintenance System
Abstract
The project entitled “Telecom Inventory Maintenance System” deals with fully
automated system used by the Telecom department.
Telecom industry is one of the major sectors, which provides so many services to
their customers such as request for a new connection, change of number, billing etc.
Maintaining all these services manually is complicated process.
The main objective of this project is to automate the services provided by
telecom system, by which customer can use all the services online.
This project has been divided into four modules.

0 Applications
1 Entries
2 Enquiries
3 Complaints
The Applications module provides following services.

0 A customer can apply for a new telephone connection by filling the form.
1 He can request for transferring phone connection to another location.
2 He can modify the mode of bill payment details.
3 He can also cancel his phone connection.
The Entries module provides following services.

4 If the customer requested for change of telephone number, here if we enter the
old number, it will display the new number.
The Enquiries module provides following services.

5 The customer can make a request about his bill.
6 He can also know the information about changed numbers.
7 He can also ask about the status of his applications.
The Complaints module provides following services.

8 The customers can complaint regarding the service and all other issues.
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ1 TCP/IP Chat Server
Abstract
Teleconferencing or Chatting, is a method of using technology to bring people and ideas

“together” despite of the geographical barriers. The technology has been available for years but
the acceptance it was quit recent. Our project is an example of a chat server. It is made up of 2
applications the client application, which runs on the user’s Pc and server application, which
runs on any Pc on the network. To start chatting client should get connected to server where
they can practice two kinds of chatting, public one (message is broadcasted to all connected
users) and private one (between any 2 users only) and during the last one security measures
were taken. As a common technology used in modern computer network communication,
Socket network programming is one of the most popular technology to develop based on
TCP/IP because it can customize packets communicate with each other effectively [1].
Network communication uses the interface which provided by operating system at different
levels of communication to implement the secure communication in the process of network.
Socket communication belongs to the bottom level of network communication, and API is used
to program for network communication. This paper provides a method about a chat room using
socket based on UDP (User Datagram Protocol). This design includes two parts, Server and
Client. After client and server set up to connect, you can achieve many machines to
communicate. It is equivalent to a dedicated chat server, a simplified WWW server.
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ2 Student Information System
ABSTRACT
The STUDENT HELPER is the best way to develop school maintenance quickly and
easily. This is system allows the user to add the classes and as well as to view the classes, and
to maintain schedule to the classes and to add classes to the schedule. The user can add the
teacher and as well as he could able to view the teacher details, at the same time user can add
the exam details when it should be conducted and he could able to view the exam details , at the
same time user can add the contact details and can view the contact details.
Features of System
0 Windows Based Maintenance System

1 Quick & Easy Way To Maintain A School
2 Advanced Reporting And Analytics
RAM : 256MB
HD space : 40GB
Os : Windows 2000 or Windows Xp
Language : MS.NET
Database : Xml Reports
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ3 Thief Detector
ABSTRACT
Video surveillance technology is not nearly as expensive or difficult to acquire as it

used to be. A new trend in video surveillance is driving down the price even further. Now you
can transform your webcam and personal computer into a fully functioning video surveillance
system simply by configuring the Motion Detection Software.
Video Surveillance System is a motion detection software that monitors your home,
office, or any premise. The system records action triggered by motion or noise as it happens.
You can view activities monitored by your camera from anywhere with an Internet connection.
The system will send immediate email notification along with a photo directly in your
mailbox as soon as motion or noise intrusion is detected. You can customize alerts like video
and audio recording, taking snaps with date and time, sounding alarms etc. Automatically
upload recorded video, audio and snaps to a FTP server of your choice.
Features:
Use webcams and IP cameras to monitor and record video. Send instant e-mail
notification when motion or noise is detected by your camera. Schedule monitoring to start and
stop automatically at weekly, once, application startup or daily intervals. Broadcast the video
from the camera so you can view it remotely. Send e-mail notifications with a photo snap of
the motion or noise event sent to your mailbox. View all event history along with recordings
and photo snaps from within the System. Upload recorded videos, audios, and photo snaps on
FTP within a configured interval.
System Specifications:
S/W Requirements:

Database Support : ORACLE
IDE : JAVA
H/W Requirements:

External device : Webcam
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ4 Graphical Web Server
ABSTRACT
This project describes the process of connecting a window based application with web
application by taking the port number which specified at web page.A method and implementing
computer system is provided in which a function or applet for example may be downloaded
from a network server and graphical user interface
(GUI) processor interprets a data stream consisting of GUI controls and attributes, and
places the controls and attributes in a presentation space. In an exemplary embodiment, a web
browser program loads an HTML (Hypertext Markup Language) from a GUI (Graphical User
Interface) stream processor applet from a web server
. The web browser then loads the GUI stream processor (GSP) from the web server and
begins executing the GSP. The GSP then requests the GUI stream from the web server by
opening a stream to a file, CGI (Common Gateway Interface) script or servlet on the server.
The GSP then receives the GUI stream and assembles the user interface in the JAVA applet
presentation space managed by the browser. The GSP may periodically update itself by
repeating the last two steps.
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ5 FTP Server

ABSTRACT
FTPServer is an implementation of File Transfer Protocol (FTP), an application layer

protocol in the OSI Model. The FTP Protocol defines a standard set of commands that is used
by the server and client to communicate. It is a standard to access the file system of remote
systems. The FTPServer implements the action to be carried out for each ftp command
requested by the client.
The ftp requests from the clients consist of the common ftp commands. Using the
ftp commands the client and upload and download files from remote systems. The whole
process is based on the client/s....
To solve the FTP server-clusterpsilas global balancing problem, this paper proposes a
novel load balancing scheme, including the choice of FTP load balancing strategies and the
construct of the uniform distributed platform which is implemented by JXTA. The paper adopts
the self-adaptive FTP load balancing strategy, called global-local-secondary global, to schedule
the download requests of clients dynamically. The cluster is divided into several subsets
disjointed mutually, and each subset has an only super node. The negotiation among subsets is
implemented by communication of super nodes. The validity of the scheme is testified by
experiments.
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ6 Distance Learning System
ABSTRACT
systems presently running. Distance Learning System is one of the education systems that are
under process long before but only committed to the University. The students have to come to
the university to check for the exam dates, syllabus, any changes, hall tickets collection etc,
which results in a time waste of the students.
Distance Learning System is developed in a web based technology (.Net) with

backend as SQL Server. This system gives the students complete information regarding the
Distance education. Starting from the syllabus, books prescribed, exam dates, any changes
related to the exams or syllabus. Even the hall tickets can be downloaded directly from the
website. This reduces the time wastage of students.
S/W Requirements:
 JAVA/J2EE
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
ఀ䜀ఀ䠀ఀ䜀ఀ䜀ఀ䜀ఀ7 Complete Mail System in JSP
ABSTRACT
0 Peer to peer Messaging System
ABSTRACT
The project titled peer-to-peer Messaging presents the development of an instant

messaging application based on the concept of peer-to-peer networking using JXTA
platform. P2P (or peer-to-peer) networking is a network model where, depending on an
operation's context, any node can operate as either a server or a client. The P2P
architecture is a decentralized architecture, where neither client nor server status exists
in a network. Every entity in the network, referred to as a peer, has equal status, meaning
that an entity can either request a service or provide a service. The main goal of this
project is to send instant messages to peers in the JXTA network using JXTA relay.
JXTA defines a set of protocols to enable a framework for peer-to-peer

computing. All JXTA network users are peers to each other . Peers communicate with
each other to perform different tasks (such as searching for new peers). Peer identifiers
uniquely identify the peer on the JXTA network The JXTA relay can accept client
commands and act upon the commands on the client's behalf. The relay acts as a junction
between the JXTA networks and peers.
JXTA has defined the data communication protocols that enable messaging
between a relay and a client. The JXTA relay receives commands from a J2ME client,
performs what's necessary on the client's behalf, and represents a JXME client on the
JXTA network. The JXME client send messages to the relay. The relay discovers the peer
and route the messages to the destination.
1 Car Sales System
ABSTRACT
An information processing technology of the present invention is capable of speeding

up a process that a prospective buyer of a used car determines an intention of purchasing the
car. A car sale information providing system of the present invention includes a car information
storage unit stored with mappings of car information containing a name, a type, a year model
etc of a car to car inspection information obtained as a result of inspecting the car concerned. A
car information input device is provided for inputting the car information and getting the car
information stored in the car information storage unit (A search unit is provided for outputting
an input screen for searching the car information stored in the car information storage unit , and
searching based on conditions inputted. The system includes a car information output unit , for
outputting display information, including a purchase indication interface for transmitting car
purchase information containing the searched car information and the car inspection
information corresponding to the car information.
2 Bank System
ABSTRACT
The main objective of this proposed system is to all the activities of a bank. The system
is like to enable the bank employees to open accounts for their customers with ease and to add
the details, to transfer amount from one account to another account and doing all the activities
related to loan, making all type of transactions. Using the system employees can also generate
different types of modules.
0 Add Acct Type Information
1 Add Loan Detail Information
2 Create New Accounts
3 Transaction (Deposits, Withdraws and Loan Payments)
4 Issue Loans
5 Issue DD’s
6 Generate Reports (Day, monthly, withdraws, dd’s, and deposits)

0 Check Account Types Information
1 Check Loans Information
2 Check Balance Amount
3 Audio Track Finder
ABSTRACT
This program was created for individuals who own numerous unlabeled mixed cds and
would love to have a means of locating tracks on the cd.
In order for this program to work there have to be some type of distinction between the
cds. For instance we label our cds with a number(ie, CD 1, CD 2..). Although "CD 1" is the
most recommended format it isn't the only choice. There are many different alternatives like
labeling the cds by color and so on. A user easily can find out the track of cd by using title or
track number.
Of course the saved cd name will have to match the label. For example, if you save the
cd as "CD 1" then you should label your cd #1 or so, otherwise the program will not benefit
you.
S/W Requirements:
 JAVA/J2EE
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
74. Pseudo Random Number Generation Using Cellular Automata And

Its Application
ABSTRACT
High-performance pseudo random number generators (PRNGs) play an important role

in a variety of applications like computer simulations, and industrial applications including
cryptography. High-quality PRNG can be constructed by employing cellular automata (CA).
Advantage of the PRNG that employs CA includes that it is fast and suitable for hardware
implementation. Our work consists of generating pseudo random sequences using two
dimensional CA, which can be used in various applications
A set of statistical tests for randomness are also used in our work. The
National Institute of Standards and Technology (NIST) proposes these procedures. These
statistical tests are useful in detecting deviations of a binary sequence from randomness.
Our work also presents a new verifiable voting scheme, Electronic

Voting, which is based on the pseudo random number generator. The basic idea for a verifiable
voting is to have ballots with a unique serial number. Each voter will cast her vote on the ballot
and take a copy of the ballot home. When the election result is published, all ballots are
published such that every voter can check that her vote is indeed counted for the intended
candidate.
0 Airways Reservation System

ABSTRACT
Airways Reservation System is used to give the customers the best of booking tickets.
The web technologies have been developed in such a manner that they can provide good
services to its users. The airlines ticketing system is a web-based application which have been
developed in one of the web technologies Java with backend as Oracle9i.
The airlines ticketing is the system that provides not only ticket booking services
but also it gives the complete information about the Airlines Company. The ticket booking is
made very easy that the customer can book his ticket by just giving his credit card number. His
ticket will be sent to the prescribed address given by the customer. This online application is
very flexible so that the customer can easily fill his details and receive the ticket in time.
S/W Requirements:
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
1 Location Aided Routing
ABSTRACT
We study routing misbehavior in MANETs (Mobile Ad Hoc Networks) in this paper. In

general,routing protocols for MANETs are designed based on the assumption that all
participating nodes are fully cooperative. However, due to the open structure and scarcely
available battery-based energy, node misbehaviors may exist. One such routing misbehavior is
that some sel_sh nodes will participate in the route discovery and maintenance processes but
refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an
add-on technique for routing schemes to detect routing misbehavior and to mitigate their
packets in the opposite direction of the routing path. In order to reduce additional routing
overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme.
Analytical and simulation results are presented to evaluate the performance of the proposed
Scheme.
The various modules included in the project as

follows:
Module 1: Route Discovery.

Module 2: Data Security.
Module 3: Data Transfer.
Module 4: Route Maintenance.
Module 5: Route Disconnection
0 Operating System : Windows 95/98/NT/2000
0 Other Tools & Technologies : Java
0 P IV 2.4
1 128 MB Ram
2 Hard Disk 40 GB
2 Crypto Systems
ABSTRACT
In cryptographic terminology, the message is called plaintext or clear text. Encoding the
contents of the message in such a way that hides its contents from outsiders is called
encryption. The encrypted message is called the cipher text. The process of retrieving the
plaintext from the cipher text is called decryption. Encryption and decryption usually make use
of a key, and the coding method is such that decryption can be performed only by knowing the
proper key.
Cryptography is the art or science of keeping messages secret. Cryptanalysis is the art
of breaking ciphers, i.e. retrieving the plaintext without knowing the proper key. People who do
cryptography are cryptographers, and practitioners of cryptanalysis are cryptanalysts.
Cryptography deals with all aspects of secure messaging, authentication, digital
signatures, electronic money, and other applications. Cryptology is the branch of mathematics
that studies the mathematical foundations of cryptographic methods.
System Specification:
Main Memory : 64MB.

Front End : Java Using AWT/SWINGS
Back End : File Streams
3 JExplorer
ABSTRACT
JExplorer is an example on how to use JTree, JList and perform simple filesystem tasks.
At the moment you can only view contents of your local drives. I plan to enable drag and drop,
to make JExplorer more complex clone of Windows Explorer. Soon you'll be able to copy,
move, delete and rename files. In this version I used TreeModel and ListModel instead of
DefaultTreeModel and DefaultListModel which results in more efficient and easy to read code.
4 JDraw
ABSTRACT
This project developed by Java1.2 Version Jdrawing Design by Java Drawing Tools.
Drawing are Create and Save and Open by our Software. Drawing Files are created by Our
Jdrawings java Tools. The Following Information are provides.
Add
BitmapIcon are pasted to drawing screen.
Simple Line Drawing

Circle Drawing
Curve Drawing
Edit
Cut and Copy and Paste Delete tools are provided by selected drawing areas.
Help
About the Software.
5 Java Productivity Aids
ABSTRACT
Our project deals with developing some tools, which help in enhancing the activities at
different stages in the software development life cycle (SDLC). Our tools will fall under the
category of CASE tools which enable sophistication during the software development.
We aim at developing two tools, (a) Code Analyzer ( jBrowser ) and (b) Log Reader.
The jBrowser would be a tool that would help the user track control flow between java classes
via method calls. Given a starting point, this tool tracks the entire path within a particular
location spotting various method calls under different scenarios. We aim at building this tool as
an effective tool to understand the control flow while reengineering and reverse engineering
and as a testing tool which would identify the broken links between the java classes.
The Log Reader is another simple tool. This tool focuses on presenting the user with a
user friendly GUI, using which the user can query and extract useful information from the log
files generated by an application server in an interactive and understandable manner.
81. FTP
ABSTRACT
0 E-mail system
ABSTRACT
The project E-mail system is a window based application which allows the
multiple users to send and receive the mail forth and back with in a network or outside of
network. This email system having a facility of attachment. The should have a id to enter into
the mail room If the user is a new one he need to register himself to get the user name and
password. A user can change his own profile, as well as able to change the password.
S/W Requirements:
H/W Requirements:
0 Dynamic Signature Verification Using Pattern Recognition
ABSTRACT
In this paper we describe a new approach to dynamic signature verification using

pattern recognition. The authentic and forgery samples are represented by Pattern Recognition
is used to achieve optimal separation between the two models. An enrollment sample
clustering and screening procedure is described which improves the robustness of the system.
We also introduce a method to estimate and apply subject norms representing the "typical":
variation of the subject's signatures. The subject norm functions are parameterized, and the
parameters are trained as an integral part of the discriminative training. The system was
evaluated using 480 authentic signature samples and 260 skilled forgery samples from 44
accounts and achieved an equal error rate of 2.25%.
84. Chatting
ABSTRACT
85. Pharmacy Management System
ABSTRACT
The pharmacy management information system is a web application developed in .Net

with backend as Sql Server. This project can be used by a hospital for its pharmacy department
or by a medical shop. The main basic theme of this application is to keep track about all of the
medicines available in the pharmacy department.
The user will be given access to view all the medicines in all the categories but he
cannot make any changes to the data. For any required medicine the user can browse from the
data available. If he gets the required information he can buy the medicines or else he can put
the query for the required medicines. The user can send the doctor’s prescription and order for
the medicines using his credit card. The medicines will be sent to the customer to his address.
This is a very flexible project for the users to browse and view the medicines available.
S/W Requirements:
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
0 Web Based Image Transport Protocol
ABSTRACT
Images account for a significant and growing fraction of Web downloads. The
traditional approach to transporting images uses TCP, which provides a generic reliable
in-order bytestream abstraction, but which is overly restrictive for image data. We
analyze the progression of image quality at the receiver with time, and show that the in-
order delivery abstraction provided by a TCP-based approach prevents the receiver
application from processing and rendering portions of an image when they actually
arrive. The end result is that an image is rendered in bursts interspersed with long idle
times rather than smoothly. This paper describes the design, implementation, and
evaluation of the image transport protocol (ITP) for image transmission over loss-prone
congested or wireless networks. ITP improves user-perceived latency using application-
level framing (ALF) and out-oforder application data unit (ADU) delivery, achieving
significantly better interactive performance as measured by the evolution of peak signal-
to-noise ratio (PSNR) with time at the receiver. ITP runs over UDP, incorporates
receiver-driven selective reliability, uses the congestion manager (CM) to adapt to
network congestion, and is customizable for specific image formats (e.g., JPEG and
JPEG2000). ITP enables a variety of new receiver post-processing algorithms such as
error concealment that further improve the interactivity and responsiveness of
reconstructed images. Performance experiments using our implementation across a
variety of loss conditions demonstrate the benefits of ITP in improving the interactivity
of image downloads at the receiver.
87. A priory Algorithm Using Association Rule Mining
ABSTRACT
In this project report the main focus lies in the generation of frequent patterns, which is
the most important task in explanation of the fundamentals of association rule mining. The
association rule mining is a fundamentally important task in the process of knowledge
discovery in large databases. This is done by analyzing the implementations of the well known
association rule mining algorithms like Apriori, Dynamic Item set Counting Algorithm, FP-
growth and a new algorithm ‘Matrix Based Association Rule Mining Algorithm’(MBA).
Run time behaviors of these algorithms are analyzed and compared using Mushroom
dataset. An evaluation study of the algorithms is performed in order to analyze their time
complexity and the impact that they have on the original database.
88. Broken Links Handler
ABSTRACT
The presence of broken links is a serious problem plaguing the World Wide Web.
Surveys show that 6% of the links on the web are broken. It reduces the usability of the world
web. To deal with this problem, we implemented a web broken links handler check application
with Java web interface. It can check the good links and bad ones in a web page. It has the
functionality for checking a site, saving the checking result, canceling current check and so on.
It differentiates external/internal links, for which internal link sites are recursively checked.
SYSTEM SPECIFICATIONS:
HARDWARE SPECIFICATIONS:
Main Memory : 64MB.


Front End : Java Using SWINGS
0 Bug Tracker
ABSTRACT
The project is a developed based on the standards of the coding used by the developer is
tested before giving to the client. System that interacts with the code developed bye the user.
Using this project any developer with minimal knowledge can easily check correctness of the
code easily without any errors.
Business Requirements Analysis
Before submitting to the client or hosting any site of the project should maintain a
testing tools. Here this developing system is based on this process only. This project will
maintain a database for each project, in that it maintains project code, bugs. Bug tracking
developers read these bugs and fix the bugs and update the same information in the bug
reports.
The following is the system developed for the above stated needs. An initial feasibility
study was conducted & a conclusion was arrived at that automating such a system would not
only achieve all the things mentioned above.
0 Intel P-III Processor

1 64 MB RAM
2 40 GB Hard Disc

Language : jsp,servlets.
BackEnd : Oracle
1 City Guide
ABSTRACT
throughout India. In the list of visiting places cities are the mostly visited places. Tourists are
come from different places and new to the city they don’t know about the cities, cultures of the
people, local language to communicate and how to approach. Tourist guides are the persons
who guide the tourists about the city like the visiting places, their importance and how to
approach by taking money from them. Tourist guides may cheat tourists for money by telling
lies and chance to rob them. In some cities they are not available.To overcome these problems
an efficient and powerful web application called CITY GUIDE has implemented.
This is the online application that provides brief information about the city by using
efficient web applications. To get the details about top restaurants, hotels, lodges, events online
CITY GUIDE is an efficient web application.
It provides every one detailed description about entertainment, museum exhibits,

monuments and memorials, movies, theaters, hotels, events for concerts and guides the visitors
with stories, events listings and theater listings.
CITY GUIDE also features arts and entertainment, attractions, recreation, festivals and
most famous devotional places. You’ll instantly get access to the information about the city and
provides you with all the information you need to know about the things in the city.
This system provides Lifestyle of the people in the city, Entertainment guide, latest
information on accommodation, food, sightseeing, shopping, social, cultural and tourist
information and is a comprehensive guide.
Users in this module are Admin and the information seeker. Admin can modify the
existing modules and add new modules. Whereas the information seeker can view the site only.
MODULES:
The different modules in this system are
䜀 City culture
䜀 Tourist places
䜀 City branches
䜀 Hospitals
䜀 Educational institutes
䜀 Entertainment
䜀 City map
䜀 Travels
City culture:
Provides information about the culture of the people in

the city
Tourist places:
This module contains the information about the popular tourist places
City branches:
Describes the most famous places in the city
Hospitals:
Provides information about the famous hospitals in the city
Educational institutes:
This module contains detailed information about the various educational institutions
Entertainment:
Contains all the information about the entertainment like movies, cultural
programmes etc.
Travels:
Detailed description about travels
Backend : Oracle
Harddisk : 40GB
RAM : 128 MB
2 College Message System
ABSTRACT
College Messaging System represents a Technology based academic Student status

delivery system. It incorporates the Educational Institutions and interactive parent
communities. On-line Technology is an important development in delivering the educational
services. Integrated approach of the system enhances the image and reputation of the
Institution.
Like in our college, we have a very prevalent system for monitoring the student’s
presence in various classes. It often comes to our notice that many students abscond from
classes for various reasons and more often, this goes unnoticed by their parents. Therefore, in
our project we would like to develop and deploy a web based Messaging system, which would
automatically inform the corresponding parents about the absence of their ward through an
email to the parents email id or an SMS to the parents mobile.
CMS, which would store all the information about the students ranging from their
attendance to their corresponding semester marks and their fee details. The benefits of the
proposed system are that there would be ease in the attendance taking process, which would get
rid of the paper works and their respective calculations.
We get prompt information regarding the attendance of a particular student either it is

percentage for all classes or for each faculty. Finally, the auto generation of an email or SMS
regarding the absence of the student would keep the parents in notice, about their wards
presence in the college. The attendance system is based around tracking student absences, since
there should be fewer of them than presences. An attendance record is stored for a student
whether they are absent/present from college. No record is stored when they are present. This is
the easiest approach in terms of record entry. Attendant is an online database system, which
provides a straightforward way for departments to record attendance information about their
students
By using this system we can accept their attendance through biometrics device.
Modules in College Messing System:
0 Admin module
1 Parent module
2 SMS and E-Mail
HDD : 40GB
Operating System : Windows 2000 or Windows XP

Language : JAVA
BACK-END DATABASE : ORACLE
3 DBwand
ABSTRACT
DBWand is an innovative, intuitive database wizard. Specifically aimed at developers

developing online, Internet database related projects, website, etc., DBWand profiles host of
features that are very much crucial but neglected in general. This document provides very
superficial information and capabilities of DBWand.
In simple, using DBWand any developer with minimal knowledge can easily do the
following things
0 connect to multiple databases easily

1 create databases online
2 modify databases online
3 import and export data
4 execute SQL statements online
Modules
0 Input entry screen (connection requirements)

1 SQL Editor window
2 Results Window
3 Syntax highlighter and help
4 Saving SQL statements
5 Saving output results
0 Schema generation with UI
6 Multiple database connections
o MS Access
o MS SQL
o Oracle
o My SQL
7 Storing multiple connection information
8 Importing data directly from local disk to internet
9 Exporting data from internet to local disk
10 Relationship diagram between tables
11 Database properties / structure details
Purpose of the Project:
Initial screen which is going to ask user on what type of database that the user wants to
interact. Then it will ask for the required parameters to act on that particular database.
Based on the parameters it establishes the connection and executes the user queries to his
satisfaction.
5 connect to multiple databases easily
6 create databases
7 modify databases
8 import and export data

9 execute SQL statements
Intel P-III Processor
64 MB RAM
40 GB Hard Disc

Language : JAVA using Swings
4 Face Recognition Using Eigen faces
ABSTRACT
People recognize each other by their faces and voices, so we feel very comfortable
interacting with a machine that does the same. Voice recognition products are the best example
of the successful application of AI technologies in practice. Many of them already entered the
mainstream market and are routinely used in various areas. Face recognition, on the other hand,
currently receives less public attention and people generally think it is still impossible for a
computer to quickly and accurately recognize its user using only the visual input. For more than
twenty years, face recognition was considered among the hardest problems in AI and computer
vision in particular. However, researchers have discovered regularities in various human
physiological characteristics, like skin color and human facial geometry. One of the best known
early examples of face recognition techniques was presented in 1980’s by Teuvo Kohonen,
proving that a simple neural network could perform face recognition for aligned and
normalized face images. Later developments brought fast, cheap unobtrusive and robust
products on the market. According to some reports, face recognition is expected to be among
the fastest growing biometric market segments over the next 2-3 years. It now generates around
15% of the total revenue in this field, behind finger scan and hand geometry methods.
As for the technological background, there are various methods by which a

computer recognizes people. Each one of them focuses on a small set of features that can be
used to uniquely recognize human faces- mouth, nose, eyebrows, jaw line and cheekbone.
Changes in lighting, aging, rotation, facial expression and appearance (glasses, beards, haircuts)
will produce different methods, so it is important to understand their advances and
shortcomings.
Eigen face technology, patented at MIT, utilizes two dimensional, global grayscale
images representing distinctive characteristics of a human face, describing what is common to
groups of individuals and where they differ most. Just as any color can be created by mixing
primary colors, the vast majority of faces can be reconstructed by combining features of
approximately 100-125 eigen faces.
MODULE INFORMATION:
Designing Algorithm
About Matrix Class
Applying Filters
Checking Images through eigen.
System Specifications:
S/W Requirements:
Operating System: Windows XP/2000 Professional
Database Support: ORACLE
IDE : Jdk1.4 or higher, JMF
H/W Requirements:

Webcam : 2 mega pixel
5 Implementation of IDEA Algorithm
ABSTRACT
The “IMPLEMENTATION AND ITS PERFORMANCE EVALUATION OF IDEA

ALGORITHM” is an application which deals with security during transmission of data across
the network. Security for the data is required, as there is always a possibility for someone to
read those secret data.
Encryption of data plays a vital role in the real time environment to keep the data out of
reach of unauthorized people, such that it is not altered and tampered. After encryption, the
files can be uploaded by using File Transfer protocol. After transfer of data, the files are
decrypted.
This application also calculates the time taken to encrypt and decrypt the data using 64-
bit key,128-bit key,192-bit key,256-bit key. The main goal of our project is to design a tool for
providing security to the system during transmission of data through the network. The project is
developed using graphics in java swings.
6 Image Compression
ABSTRACT
Image Compression is mainly used for compressing the image data with out any
significant image data or image clarity. This is for easy maintenance, network transforming and
security also provided. In this project the lousy compression techniques can be used in some
contexts where data loss cannot affect the image clarity in this area.
In some important situations image compression uses Lossless compression involves

with compressing data which, when decompressed, will be an exact replica of the original data.
This is the case when binary data such as executables, documents etc. are compressed. They
need to be exactly reproduced when decompressed. On the other hand, images need not be
reproduced 'exactly'. An approximation of the original image is enough for most purposes, as
long as the error between the original and the compressed image is tolerable.
Pentium IV Processor.
128 MB RAM.
20GB Hard Disk space.
Windows 2000 XP operating system.

J2sdk1.4.0 or higher
7 Net conference
ABSTRACT
The main concept of Net Conference is developing the conference on the net. We can
compare the Net conference with the Telephone Conference. Normally in Telephone
Conference, there will be more than two users connected at a time and all the users are able to
here words from any one of the user. So implementing the same concept on the Net is nothing
but Net Conference.
This project is used to:

Conduct conferences with their employees. So they can get online decisions from
employees from the different branches of the company.
0 The another advantage is that the company is having branches throughout

the country. So this will help them to communicate business affairs of the
company and live meetings and conferences between their directors. They can
conduct board of directors meeting.
0 It will give On-line solutions from the superiors to the employees.
Main Memory : 64MB.

Front End : Java Using Servlets
Back End : Oracle 8i or SQL Server or Access.
Database Connectivity : JDBC,Microsoft ODBCDriver for Oracle.
8 Online Examination
ABSTRACT
For our society, the learning with the help of electronically media has become an
important factor for the preservation and the creation of qualified jobs. But this type of learning
is lacking of a checking of the contents the students have learned. Only with an enormous
organizational effort and a lot of time, consultation could be realized. Another factor that
blockades the efficient learning is the time that is spent on correcting and returning the exams.
A regular control of the contents is not possible, because the correction of tests and
exams takes to long. But studies proof that just a regular control leads to better results. With
Online examination system we have succeeded in developing a system to realize a convenient,
high-performing and incontestable Multiple-Choice exam. With this type of exam it is possible
to review the contents of the courses in regular intervals. The main focus of this project lies on
the user interface which is easy to handle as well as a fast, flexible evaluation and a maximum
of efficient background information (stats).
Online examination system is the new way to conducting exams to the students using
the efficient web technologies and the Internet. Online is the technology of accessing the
application from sitting anywhere in front of a computer with an ease of operation.
9 Packet Monitoring System
ABSTRACT
This project is intended to develop a tool called Packet Sniffer. The Packet Sniffer
allows the computer to examine and analyze all the traffic passing by its network connection. It
decodes the network traffic and makes sense of it.
When it is set up on a computer, the network interface of the computer is set to

promiscuous mode, listening to all the traffic on the network rather than just those packets
destined for it. Packet Sniffer is a tool that sniffs without modifying the network’s packet in
anyway. It merely makes a copy of each packet flowing through the network interface and finds
the source and destination Ethernet addresses of the packets. It also decodes the protocols in the
packets given below.
ARP (Address Resolution Protocol), RARP (Reverse Address Resolution Protocol), IP

(Internet Protocol), TCP (Transmission Control Protocol), UDP (User Datagram Protocol),
ICMP (Internet Control Message Protocol) and IGMP (Internet Group Message Protocol).
The output is appended into normal text file, so that the network administrator can
understand the network traffic and later analyze it.
10 Pretty Good Privacy
ABSTRACT
PGP Encryption (Pretty Good Privacy) is a computer program that provides

cryptographic privacy and authentication. The first PGP version, by designer and developer
Phil Zimmermann, became available in 1991. Since then major enhancements have been made
and a wide range of products are now available from PGP Corporation and other companies.
PGP encryption applications
While originally used primarily for encrypting the contents of email messages and
attachments from a desktop client, PGP products have been diversified since 2002 into a set of
encryption applications which can be managed by an optional central policy server. PGP
encryption applications include email and attachments, digital signatures, laptop full disk
encryption, file and folder security, protection for IM sessions, batch file transfer encryption,
and protection for files and folders stored on network servers.
The PGP Desktop 9.x application includes desktop email, digital signatures, IM
security, laptop whole disk encryption, file and folder security, self decrypting archives, and
secure shredding of deleted files. Capabilities are licensed in different ways depending on
features required.
The PGP Universal 2.x management server handles centralized deployment, security
policy, policy enforcement and reporting. It is used for automated email encryption in the
gateway and manages PGP Desktop 9.x clients. It works with the PGP public keyserver - called
the PGP Global Directory - to find recipient keys. It has the capability of delivering email
securely when no recipient key is found via a secure HTTPS browser session.
With PGP Desktop 9.0 managed by PGP Universal Server 2.0, released in 2005, all
PGP encryption applications are based on a new proxy-based architecture. These newer
versions of PGP software eliminate the use of email plug-ins and insulate the user from
changes to other desktop applications. All desktop and server operations are now based on
security policies and operate in an automated fashion. The PGP Universal server automates the
creation, management, and expiration of keys esharing these keys among all PGP encryption
applications.
New versions of PGP applications use both OpenPGP and the S/MIME, allowing
communications with any user of a NIST specified standard.
How PGP encryption works:
PGP encryption uses public-key cryptography and includes a system which binds
the public keys to user identities. The first version of this system was generally known as
a web of trust to contrast with the later-developed X.509 system which uses a hierarchical
approach based on certificate authority. Current versions of PGP encryption include both
alternatives through an automated management server.
Encryption/decryption.
PGP message encryption uses asymmetric key encryption algorithms that use the
public portion of a recipient's linked key pair, a public key, and a private key. The sender
uses the recipient's public key to encrypt a shared key (aka a secret key or conventional
key) for a symmetric cipher algorithm. That key is used, finally, to encrypt the plaintext
of a message. Many PGP users' public keys are available to all from the many PGP key
servers around the world which act as mirror sites for each other.
The recipient of a PGP encrypted email message decrypts it using the session key
for a symmetric algorithm. That session key is included in the message in encrypted form
and was itself decrypted using the recipient's private key. Use of two ciphers in this way
is sensible because of the very considerable difference in operating speed between
asymmetric key and symmetric key ciphers (the differences are often 1000+ times). This
operation is completely automated in current PGP desktop client products.
Digital signatures:
A similar strategy is used to detect whether a message has been altered since it
was completed, and whether it was actually sent by the person/entity claimed to be the
sender. It is used by default in conjunction with encryption, but can be applied to
plaintext as well. The sender uses PGP encryption to create a digital signature for the
message with either the RSA or DSA signature algorithms. To do so, PGP products
compute a hash (also called a message digest) from the plaintext, and then creates the
digital signature from that hash using the sender's private key.
The message recipient uses the sender's public key and the digital signature to
recover the original message digest. He compares this message digest with the message
digest he computed himself from the (recovered) plaintext. If the signature matches the
received plaintext's message digest, it must be presumed (to a very high degree of
confidence) that the message received has not been tampered with, either deliberately or
accidentally, since it was properly signed

Language : .Net(vb.Net)
H/W REQUIREMENTS:

11 Scheduling and Dispatching Management System
Abstract

Hardware Specifications
A Personal Computer
1 64 MB RAM
2 4 GB Hard Disc

Language : JAVA
Database : Oracle/Access/SqlServer
12 Smart Payroll System
ABSTRACT
The Smart Payroll System deals with salary pay slips of employees of any
company. In the organizations they provide some facilities for their employees like HRA,
DA, LTC, LLTC etc. Employees will be having some specific number of different kinds
of leaves available for the whole year. As the organization has different departments,
even the facilities and leave details will be different.
Depending upon the allowances the respective amount will be added to the Basic
Salary of the employee. Depending on the leaves taken and loss of pay the amount will
be calculated and gets deducted in the total salary that has been calculated with the
addition of allowances. This project Smart Payroll System will do all those additions and
deductions, and calculates the net salary very efficiently to the accurate point without any
errors. This also keeps track of each employee’s salary details.
S/W Requirements:
 JAVA/J2EE
H/W Requirements:
P IV 900 MHz+
128 MB RAM
40 GB HDD
13 Stegohider
ABSTRACT
Steganography is the art of hiding information. There are a large number of

Steganographic methods used in different applicatons.It is extensively used in Digital
Water marking, communication within closed community with additional degrees of
security. An attempt is being made to implement a new technique , entitled
“Steganographic Application Tool”, for image encoding in steganography. It provides
more security for data transfer on Internet and other networks. Our intention is to hide the
existence of the message; While Cryptography scrambles a message so that it can not be
understood. Using Steganography a secret message can be transmitted without the fact of
the transmission being discovered. This hiding of data can be done in three different
media such as text, image and audio files. Though there are variety of image formats to
implement the algorithms used in this system, we use the JPEG format to embed the Plain
text as it contains the compressed image format. In this technique, firstly the pixels values
(RGB values) of the image in which the plain text is to be embedded are extracted. The
bits of the plain text into the two LSB bits of the RGB values in the image. The
transparency bits of the pixels are not disturbed. The fact that we are embedding the plain
text into the two LSB bits enables the recipient to get the original image without any
distortions. In order to provide more security, we are first encrypting the message using
DES algorithm and then cipher text as the input to our technique and the same message
will be extracted and decrypted at the receiver end.
Steganography is really interesting subject and the applications using

Steganography are increasing day-by-day. A number of algorithms were developed and
implemented to achieve Steganography in images and audio. Many new algorithms are
coming and each of them uses a unique method of making life of a Steg-Analyst more
miserable everyday.
103. EMBEDDING DATA INTO VIDEO FILE

WITH LESS DISTORTION USING LSB TECHNIQUE
ABSTRACT
The “Embedding Data into Video File” is an application which deals
with security during transmission of data across the network. Security for the data is
required, as there is always a possibility for someone to read those secret data. The
system deals with implementing security using steganography. Steganography is the art
of hiding information in ways so as to prevent detection of hidden messages.
Data Embedding into Video File is software, which tries to alter the
originality of the data files in to some encrypted form by using “Tiny Encryption
Algorithm”. Encryption of data plays a vital role in the real time environment to keep the
data out of reach of unauthorized people, such that it is not altered and tampered. After
encryption, the files can be transferred securely by using steganography. We are using
video as stegno media to embed the encrypted data file .So this has been defined as
“Video Steganography”. The application should have a reversal process as of which
should be in a position to deembed data file from video and decrypt the data to its
original format upon the proper request by the user. The goal of our project is to design a
tool for providing security to the system during transmission of data through the network.
The project is developed using graphics in java swings.
14 Terminal Controller
ABSTRACT
This project deals with easily exporting the user interface over the network to a
remote computer with the rmi protocol. This system does Remote control at the
application level. The system allows controlling the systems remotely like shutdown,
checking files and its permissions, etc.
As the application is built purely on JAVA using RMI APIs, it is platform
independent and you can run your application on any server. Java also provides a strong
development platform in its own right for remote-control solutions.
Modules:
Remote Handling
Remote File Searching
Remote Privileges
Remote Configuration
Hardware Specifications

1 64 MB RAM
2 40 GB Hard Disc
Operating System : Windows XP/ Windows 2000

Language : VB.NET
BackEnd : Oracle9i/SqlServer 2000
15 Town online complaint system
ABSTRACT
The system deals with providing online support to the people who are facing problems
with various software technologies. Problems with the current system, there is a
communication gap between the customer and the organizations. People generally don’t
know the name of the sites of all organizations to post their problem.
Customer usually face some problem while posting the bugs occurred in different
software’s as they have to post their bugs to different sites individually and there is no
surety of quick response from the organization. Few organizations may not be interested
in responding to the customer problems.
So in order to overcome all these limitations and to meet all their requirements,
the current process is replaced with this application.
16 Visual Cryptography
ABSTRACT
Visual cryptography is a cryptographic technique which allows visual information
(pictures, text, etc.) to be encrypted in such a way that the decryption can be performed
by the human visual system, without the aid of computers.
Visual cryptography was pioneered by Moni Naor and Adi Shamir in 1994. They
demonstrated a visual secret sharing scheme, where an image was broken up into n shares
so that only someone with all n shares could decrypt the image, while any n-1 shares
revealed no information about the original image. Each share was printed on a separate
transparency, and decryption was performed by overlaying the shares. When all n shares
were overlayed, the original image would appear. Using a similar idea, transparencies can
be used to implement a one-time pad encryption, where one transparency is a shared
random pad, and another transparency acts as the ciphertext.
Features:
Share image into two parts
Security
1 Other Tools & Technologies : Java, Swings
3 P IV 2.4
4 128 MB Ram
5 Hard Disk 40 GB
17 Voice Domain
ABSTRACT
This project to be developed for hands free browsing to handle difficult web urls
in an easy way and it can speech voice depending on given text file (text to voice) and
can create a text file by using your voice (Speech recognition). I facilitate the user with
easy handling of computer applications by their voice.
This scope of the project is to create a voice enabled browser, which enables
hands free use of software applications to computing capabilities away from the desk.
In the present world of different means of communication there have been great
changes takes place. The most comfortable and easy way of communication of conveying
message to voice.
Modules :
0 Text-to-Speech
1 Speech recognition
2 Hands free browser
䜀 JDK Version
䜀 Sun’s JMF (Java Media Framework) 2.1.1
䜀 SAPI (Speech Application Programming Interface)
䜀 Processor : Pentium IV or above
䜀 RAM : 256 MB or above
䜀 Hard Disk : 40 GB
䜀 Microphone / Headphone
䜀 Speakers
18 Water Marking
ABSTRACT
Our project deals with the concept of watermarking. Recent advancements in

computer technologies offer many facilities for duplication, creation, manipulation,
reproduction and distribution of the digital multimedia. They are becoming extremely
easier 7and faster with the existence of the Internet and the availability of pervasive and
powerful multimedia tools. However, these advances have their drawbacks as well, for
example unauthorized tampering of images.
Digital watermarking has emerged as a possible method to tackle these issues.

Digital watermarking is a process to embed secondary data in digital media.
A digital watermark is created by inserting a digital signal, or pattern within
multimedia content. This embedded information can be used to determine whether the
host data are being tampered with or not.
These embedded data are can be visible or invisible depend on the particular
applications and the requirements of applications. , and can later be detected or extracted.
It has made a considerable progress in recent years and attracted attention from both
academia and industry. It plays a vital role as it allows to identify the legitimate owner,
track authorized users via fingerprinting or detect malicious tampering of the document.
Several watermarking methods exist for every kind of digital media .for example Text
documents, images, video, audio even for 3D polygon models, maps and computer
programs. Our project deals with watermarking the images with other images and text.
Modules:
0 Text on image
1 Image on image
3 Web/Application Server : Tomcat
4 Database Server : Oracle 8i
5 Other Tools & Technologies : Java (JDK), Servlets (JSDK), JavaMail
6 Pentium IV
7 64 MB Ram
8 Hard Disk 4.3 GB
19 Web Browser
ABSTRACT
Web Browsers are the most prominent network application programs that are used
for surfing the information on the www. At the beginning, the idea of a World Wide Web
comprised of hypertext links didn't attract much attention. The main reason for this
situation was a lack of user-friendly client software. The World Wide Web is a client-
server information system that consists of two different programs - the client and the
server. These two programs ‘talk' to each other "using a standardized protocol called
hypertext transfer protocol" (HTTP). Today, the World Wide Web is a place of
information sharing, entertainment, as well as a medium for distance work and education.
Therefore, it is necessary to carefully evaluate the wide range of browser software in
order to choose the one, which will most effectively serve ones telecommuting purposes.
The most important browser feature, however, is a fast and accurate hypertext
markup language (HTML) rendering engine. Today, this means that a browser has to
comply with the HTML 2.0 standard. Simultaneously, some features from HTML 3.0
standard (e.g. tables, frames) are already used on many Web sites and a good browser
should support these features as well. Finally, a ‘perfect' browser should support the
‘Java' script, which can turn Web pages into dynamic sites (e.g., running headlines,
rotating objects, animation of figures and icons). Our project is to design browser
software with some essential features.
20 Web Crawler
ABSTRACT
A web crawlers is a program, which automatically traverses the web by

downloading documents and following links from page to page. They are mainly used by
web crawlers engines to gather data for indexing. Other possible applications include
page validation, structural analysis and visualization, update notification, mirroring and
personal web assistants/agents etc. Web crawlers are also known as spiders, robots,
worms etc.
Web crawlers’s start by parsing a specified web page, noting any hypertext links
so on, recursively. Web-Search software doesn't actually move around to different
computers on the Internet, as viruses or intelligent agents do. A Search resides on a single
machine. The Search simply sends HTTP requests for documents to other machines on
the Internet, just as a web browser does when the user clicks on links. All the Search
really does is to automate the process of following links.
Web crawlersing speed is governed not only by the speed of ones own Internet
connection, but also by the speed of the sites that are to be Searched. Especially if one is
a Searching site from multiple servers, the total Searching time can be significantly
reduced, if many downloads are done in parallel. This work implements the “Breadth
First Searching” algorithm, a refined version of one of the first dynamic Web crawlers
algorithm, In order to build a major search engine or a large repository such as the
Internet Archive, high-performance Search start out at a small set of pages and then
explore other pages by following links in a “breadth first-like” fashion.

Language : JAVA
H/W REQUIREMENTS:

21 Web Enabled Automated Manufacturing System
ABSTRACT
The system is a web based Manufacturing System that enables a Manufacturing

company to schedule its manufacturing operations based on the daily update of sales
from its dealers. The system is modeled to be used by a Manufacturing company, whose
main activity is manufacturing different products & then selling the finished goods
through a network of Dealers.
To start with, the Stocks of all the Products manufactured by the company and
held in the company warehouse are stored in a Database. The details that are stored
include the quantity of each product held with the company dealers who hold the stocks
of finished products for sale.
Once the sales figures of Products sold in the past week are entered by the Dealers
over the Internet along with the Orders for the next delivery, the schedule for the next
week’s production will be drawn up. A report of the required raw materials or parts will
be drawn up with the approved suppliers for each & the suppliers will be intimated about
the part requirements over the Internet & asked to quote their rates. The message asking
for a Quotation will be sent as an e-mail message. Once the rates are quoted, the Order
will be placed with the required delivery schedules.
The system incorporates intelligent Order processing System that checks and
intimates the required Higher-ups in the Company about any discrepancies in the Orders
that were placed. For example if an Order is placed with a Supplier whose rates are not
the least then an automatic Event-generation will send the details of the Order & the
person who placed it to the Managers or Directors who are supposed to oversee the
process.
Once the parts are supplied the Part Stocks will be updated. Then a production
plan will be drawn up taking the Bill-of-materials into consideration. The Bill-of-
Materials contains the details of each Product & the type & quantity of Parts required for
manufacturing a single unit of the Product. Once the Production plan is approved, the
Part Stocks will be updated when the Parts are issued to the Production Department.
Once the finished products are available from the Production Department, the Products
will be dispatched based on the Orders placed by the Dealers. The stocks with the dealers
will also be maintained.

7 Browser : IE
8 Web/Application Server : Java Webserver 2.0
9 Database Server : Oracle 8i
10 Database Connectivity : JDBC , Microsoft ODBC Driver for Oracle
2 Other Tools & Technologies : Java (JDK), Servlets (JSDK), JavaMail
9 Pentium Min233 Mhz

10 64 MB Ram
11 512 KB Cache Memory
12 Hard Disk 4.3 GB
13 Microsoft Compatible 101 or more keyBoard
22 Web Importer
ABSTRACT
A web importer is a program, which automatically traverses the web by

assistants/agents etc. Web importers are also known as spiders, robots, worms etc.
Web Importer’s start by parsing a specified web page, noting any hypertext links
so on, recursively. Web-Importer software doesn't actually move around to different
computers on the Internet, as viruses or an intelligent agent does. An importer resides on
a single machine. The importer simply sends HTTP requests for documents to other
machines on the Internet, just as a web browser does when the user clicks on links. All
the importer really does is to automate the process of following links.
Web importing speed is governed not only by the speed of ones own Internet
connection, but also by the speed of the sites that are to be downloaded. Especially
if one is an importing site from multiple servers, the total downloading time can be
significantly reduced, if many downloads are done in parallel. This work
implements the “Breadth First Importing” algorithm, a refined version of one of
the first dynamic Web search algorithm, In order to build a major search engine or
a large repository such as the Internet Archive, high-performance importers start
out at a small set of pages and then explore other pages by following links in a
“breadth first-like” fashion.
Modules:
8. Find file structure using WebCrawler

9. Filter web pages
10. Download pages
S/W Requirements:
H/W Requirements:
23 Work Flow Management System
ABSTRACT
The system, which was developed now, makes this process of scheduling much
easier and computerized. By this system the manager or top level designated employee
can fix the schedule of any employee working under him, he even can check whether the
employee is free in the particular time or in other times. Thus the top level management
can easily fix the process of scheduling, and even can change the appointment which is
reflected immediately to the related employee avoiding direct contact of the employee
resulting in saving lot of time and work overhead.
The system even has the option for only viewing the employee’s activities or
appointments. This feature avoids direct contact to the respective employee’s database
and activities. There is an option where only the supervisor (the top-level manager) can
have direct access to the employee’s activities, he can change the appointments of the
employees working under him. No other employee of the same designation or same level
of hierarchy can do this.

12 Browser : IE
13 Database Server : Oracle 8I or SQL Server
14 Database Connectivity : JDBC , Microsoft ODBC Driver for
Oracle
3 Other Tools & Technologies : Java (JDK), Swings
14 Pentium Min233 Mhz

15 64 MB Ram
16 512 KB Cache Memory
17 Hard Disk 4.3 GB
18 Microsoft Compatible 101 or more keyBoard
24 Performance Evolution of RMI
ABSTRACT
With the explosive growth of internet and network services, there is always a
proliferation for distributed application that seek to leverage the power of the internet.
Remote method invocation is now increasingly being used in Internet based applications
and hence it is important to study the performance parameters of RMI. RMI is the action
of invoking a method of a remote interface on a remote object.
The three methods of RMI namely General , Activation and Custom Socket
Factory are to be evaluated empirically using parameters like Round trip time , Latency
and Packets per Unit time. The graph plotted allows us to gain an insight into the
performance aspects and other tradeoffs of RMI. The General method deals with
invoking any method directly from memory of the remote machine. RMI Activation
allows passive objects to be brought into the active state by instantiating it on an as
needed basis. Custom socket factory method allows customization of socket depending
on the type and amount of data to be transferred over the channel. It is proposed to
implement security for the data being transferred using Rijndael Algorithm that imparts
security due to its high resistance to attacks, code compactness and design simplicity.
Search mechanism is also to be implemented in the GUI, which has user-friendly access
to the three methods of RMI and displays the results of the evaluation.
25 Network Management Tool
ABSTRACT
This project deals with registration of soft wares and checking the details of
software’s those are already installed. A System administrator can monitor all the system
which are installed or not with in a network environment sitting from single location. By
taking the system id, name and path the administrator is going to register the software’s.
By using the system id the admin can able to install the required software to any
destination with in the network.
S/W Requirements:
H/W Requirements:
26 Courier Information System
ABSTRACT
There are many services, which are utilized by a citizen provided by the
government or private sector. The Project entitled "COURIER SERVICE SYSTEM" is
an intranet application developed to maintain the transactions through net for Courier
Service System.
The main aim of "COURIER SERVICE SYSTEM" is to improve the services of

Customers. The Head office will maintain the Central server. This Contains two major
modules. which are Employee Details and courier service. The Employee module
maintains employee information which is having MapInfo, Leave master, Leave
transactions, Loan and Salary details. The second module having customer, branch,
Dispatches, Receipts details. The primary features of the project entitled "COURIER
SERVICE SYSTEM" are high accuracy, design flexibility and easy availability. And
also it uses database tables Representing entities and relationships between entities.
27 ATM Simulator
ABSTRACT
To deposit, withdraw amount from the banks manually is long process. To made
this manual process fast this proposed system Automatic Teller Machine (ATM) be
designed. This proposed system deals with all transactions of actual ATM centers like
login to your account according to your pin number given, checking balance amount,
savings as well as current account. Also the account holder can deposit, withdraw
amount from his/her current or savings account respectively from any location.
Advantages:
0 Fast accessing
1 No manpower is needed
2 No need to go to bank to deposit
3 Time consuming process

4 64 MB RAM
5 4 GB Hard Disc
Language : JAVA using SWINGS/AWT
Database : Access/Oracle/SqlServer
28 High Speed Download Manager
ABSTRACT
This is purely a java enabled Network project using which an end user downloads
different files (data) from various servers with a high-speed data transfer. The end user
activating the Download Manager need to submit an URL of the file to be downloaded,
by which the software gets connected to the server and gets the file information with its
status for the download. After which the user is asked for the path to save the file. The
Download manager then downloads the requested file at a high speed.
The software design supports the display of status information of the download
carried out at every second (i.e.) the percentage of file downloaded. The most striking
feature of this download manager is support of high-speed data transfer and it allows the
user to download more than one file simultaneously. It provides a reliable data transfer by
tracing the download status at every moment and helps to continue the file downloading
from the position of its last download if the downloading is terminated by a sudden
disaster like loss of connection due to any reason or failure of transmission.
119. SECURE COMMUNICATION USING

IDEA
ABSTRACT
The project is designed at transmitting information via network in a safe and secure
manner. The project is mainly divided into two modules. The first module describes
Message Digest with Secure Hash algorithm for integrity of the message. The second
module describes the International Data Encryption Algorithm where the message is
encrypted first and it can be decrypted using the same algorithm. These two algorithms
are integrated for a safe transmission of the message via the network. The same concept
is embedded in network using the concept of socket programming. The usage of Socket
Programming is that it is used for identifying the destination using the host address and
port number.
0 Integrating Speech Engine With Web Navigator
ABSTRACT
Finding information on the web is like looking for a needle in a haystack.

Fortunately there are stating points one can use. Tools are also available to help perform
searches for specific data. It is the browser that helps communicate with the Internet
world. A browser is a program that takes input as a page requested; interprets the text,
formats the commands that the text contains, and displays the page properly formatted on
the screen.
Web server serves static content to a web browser at a basic level. This means that
the web server receives a request for a web page as requested through the browser. The
web server is also called HTTP server because it responds to HTTP request. Web server
allows you to serve contents over the Internet using the Hyper Text Markup Language
(HTML) and returns the appropriate HTML document.
Speech technology is becoming increasingly important in both personal and
enterprise computing human interaction with computer. Speech technology allows hands
free use of computers and supports access to computing capabilities away from the desk
over the telephone.
Speech recognition and speech synthesis can improve computing accessibility for
users with disabilities and can reduce the risk of repetitive strain injury and other
problems caused by current interface. Voice Enabled Browser is one that performs all the
activities of the Browser and includes the advanced technology mentioned above to have
a fast and easy operation of Internet.
Our project aims at developing a Web Navigator and incorporating basic
functions into it. After having done this, linking the browser to a speech engine namely
IBM Via Voice.
1 ATM Networks and Intelligent Packet Filtering
ABSTRACT
The TCP/IP protocol suite is the standard requirement fo all applications that need
to communicate over the Internet. As TCP/IP applications are unable to specify the QoS
parameters needed for most Asynchronous Transfer Mode (ATM) services, we tend to
use the GCRA Algorithm. The purpose of Cell-Rate Guarantees for Traffic across ATM
Network is to provide QoS.
ATM is a connection-oriented switching technology, utilizing statistical
multiplexing of fixed-length packets, known as cells. The purpose of
traffic control is to minimize congestion. In an ATM network when the Source Machine
continuously sends cells to the Destination Machine through the Router Machine, there
will be a possibility of occurring congestion. When congestion occurs the Routing
Machine cannot accept more cells and hence these cells will be discarded. This causes
regeneration and retransmission of the discarded ATM cells. The objective of this project
is to simulate an overflowing ATM network and establish a router with congestion
control based on the GCRA algorithm.
2 OPTIMAL MUTLICAST ROUTING IN AD-HOC NETWORKS
ABSTRACT
123. Net Banking
ABSTRACT
The main objective of this proposed system is to online all the activities of a bank.
The system is like to enable the bank employees to open accounts for their customers
with ease and to add the details, to transfer amount from one account to another account
and doing all the activities related to loan, making all type of transactions. Using the
system employees can also generate different types of modules.
11 Issue Loans
12 Issue DD’s

124. Video Library
ABSTRACT
0 Distributed File Editor Project
ABSTRACT
Von Neumann computers distinguish between primary and secondary memories

by providing explicit distinct interfaces to each. After that virtual memory systems use
the primary memory interface to provide access to secondary storage devices by loading
information into the physical primary memory when it is needed. But still these requires a
separate interface to access remote files. So, there is a need to develop systems, which
uses the same interface for accessing the local memory as well as remote memory.
The primary duty of such a system is making better use of existing file &
secondary memory interfaces to maintain transparency to the end user by creating an
illusion to user that everything is happening on his own system.
In this project entitled “Distributed File Editor “, we developed a simple file with
main concentration on implicit file sharing. Our intention is to provide a graphical user
interface through which the user can access remote files with a level of transparency. To
implement this we use the concepts of distributed systems like distributed file systems
and group communication.
1 Student Project Allocation and Management with Online Testing

ABSTRACT
This project is aimed at developing a web-based system, which manages the
activity of “Student Project Management” and “Online Testing”. This is a system used by
Educational Institutions or other organizations, which are willing to give student
projects. This system will manage the database and maintain a list of all student groups
that have registered on this site, conduct their online test and shortlist those students who
have passed the eligibility criteria as set by the professors.
There are 3 roles in this system namely,
0 Administrator role
1 Professor role
2 Student role
An administrator logs into this system, and can register a professor who belongs
to that institution. A student should register, provide his information (like semester
marks, technologies familiar with, prior project experience etc.,) and also provide
information about his team members. He/she is allowed to give the Online Test during a
scheduled time interval. After giving the test student’s test score is saved in the database.
Professor can login and then shortlist students for allocating the projects by their
academic performance and/or test score.
2 Elliptic curve Cryptography
ABSTRACT
Cryptography can be defined as the process of making information indecipherable

to all except those who are the intended recipients of such information. In this day of
electronic communication via the Internet, particularly electronic commerce, securing
sensitive data (such as credit card numbers and e-mail) is becoming increasingly
important. Through various methods of cryptography, data can be safely transmitted

without the threat of the information being intercepted and, subsequently, compromised.
This project is on implementation of elliptic curve cryptography (ECC).ECC is an
approach to public-key cryptography based on the algebraic structure of elliptic curves
over finite fields.
3 AdXpress
ABSTRACT
AdXpress is the largest single source of online intelligence for marketing,

advertising, media and research communities worldwide. AdXpress offers a FREE
World Advertising and Marketing News email service, ensuring the top global stories are
delivered daily to your inbox. Our free classifieds will expose your ads to local, regional
and national buyers in different countries across the globe. AdXpress is a full featured
classified ad manager website. AdXpress is designed to seamlessly integrate ads in this
website.
Our AdXpress ad web site is organized using an easy-to-follow index so that you
can locate the classified ads you're interested in quickly and easily. We hope you'll enjoy
your visit and you will opt this site for placing the ads forever and you will definitely add
our site as a bookmark in your web browser. Please come back and visit us again soon.
Welcome to AdXpress. We are pleased to be able to offer you free classified

advertising over the Internet. AdXpress splits your screen up into various sections. At the
home page there are list of menu options. These allow you to go straight to a category
you want by navigating through the sub options.
There are two types of users who can use this system:
1.Administrator
2.Member
This application allows the administrator us to manage the members through

registration. He can also manage the categories and he has the right to place a new on his
won, edit the ad or delete the add. Once member is registered he can place the ads in
selective category. He can generate a report about which are placed by him, he can edit
his ad and he deletes his ad. It allows the administrator to manage important links
information, yellow pages and he can store the ad management tasks using this
application, assign the tasks to different employees and check their status.
4 Boardwalk
ABSTRACT
The project entitled “BROADWALK REALERS NETWORK” is developed

for organization of “NAVEEN TILES Pvt. Ltd” located in Rajastan.The developed
system helps the organization to receive orders through online for product tiles that
can be supplied by the organization. This Activity includes three modules customers,
dealers and administrator. Customer module facilitates the customers to place order
through online, and can view catalog information provide by organization. In this
module each customer order will be verified to determine whether author dealer
existing in the area specified by customer. If dealer existing then the customer
order will be redirected to corresponding dealer otherwise those orders will be
registered as direct customers orders to Administrator.
Dealer module facilitates authorized dealers to customer orders status in
their area, to place order ,to manage their details in Administrator records.
Administrator module facilitates the Administrator to view direct customers
order status, dealers order status and also to maintain transport charges info and
products catalog information. Administrator can also appoint new Dealer and remove
existing Dealer.
5 Cotelligent
ABSTRACT
Contelligent is a component-based Web Content Management solution. This

system is based on the convenience of the students to communicate with the resources
provided by the distance learning section of the university.
This project is aimed to provide services to students over Internet, each student is
given with a unique id and as the student logs on into the system he will be given access
to anonymous number of sections.
The different sections that are involved in this

system are:
0 Lecture notes
1 Assignment
2 Exam Time table
3 Library
The system uses 2 different types of users 1. administrator 2. Normal user

(student) 3. Faculty 4. Corporate User
Ezeemerchant
ABSTRACT
The popularity of interactive media such as the World Wide Web (WWW) has
been growing at a very rapid pace (see, e.g., GVU 1999). From a marketing perspective,
this has manifested itself primarily in two ways:
0 A drastic increase in the number of companies that seek to use the WWW to
communicate with (potential) customers, and
1 The rapid adoption of the WWW by broad consumer segments for a variety of
purposes, including pre purchase information search and online shopping.
The combination of these two developments provides a basis for substantial
growth in the commercial use of interactive media for shopping called Online Shopping.
We conceptualize this behavior as a shopping activity performed by a consumer

via a computer-based interface, where the consumer’s computer is connected to, and can
interact with, a retailer’s digital storefront (implemented on some computer) through a
network (e.g., the WWW). A consumer can engage in online shopping in any location,
and they can compare the prices and they can buy the product without face-to-face
assistance to the shopper. This reduces the time and it is the solution for the to overcome
the traffic and pollution problems in metropolitan cities.
While making purchase decisions, consumers are often unable to evaluate all
available alternatives in great depth and, thus, tend to use two-stage processes to reach
their decisions. At the first stage, consumers typically screen a largeset of available
products and identify a subset of the most promising alternatives. Subsequently, they
evaluate the latter in more depth, perform relative comparisons across products on
important attributes, and make a purchase decision. So this application provides a facilty
to do this to greater extent.
The shopper can take the decision to improve the business depending on the
current customer rate and their bills. To satisfy the customer needs the online shopping
cart system comes to the door step of very customer through online and provides all the
facilities what the customer faces when he shops manually. The shopper can store the
Day to day transactions in the database and so that he can go back to any earlier
transaction and he can check it.
The customer can see the status of goods delivery also by sitting at home. The
shopper can also see the delivery status and can deliver goods to undelivered customers.
Shopper can generate the user-friendly reports to analyze the business statistics. Shopper
can maintain the list of categories, list of products in a category, list of orders, order
tracking and payments through user-friendly screens.
The customer has the tendency to pickup as many items irrespective of their
needs. To avoid this the EzeeMerchant system provides a facility called cart so that the
customer can check the items he has selected and what is the amount at a particular point
time and he can take the decision to continue shopping, stop shopping or remove
unnecessary goods. High security will provided for each and every customer by
providing customerID and password which is generated through customer registration
facility. Ultimately the EzeeMerchant System caters all the user needs through online.
Loan Amortizer
ABSTRACT
The administrator of this software can just view the information besides adding
new users and employees and changing their passwords. Thus he cannot interfere with
the loan process or payments. This part is dealt by manager who has authority to issue the
loan to an individual. He can provide information on which type of loan being issued and
to whom.
Accountant and agents of the finance company can view all the details of the
customer. When a customer makes a payment, they can store the payment details into the
database. Thus, Loan Amortizer is an online software application which fulfills all the
requirements of a typical finance company. It provides the interface to users in a
graphical way to manage the daily transactions as well as historical data. The users can
provide a clear picture to the customers regarding how much is already paid and how
much is still pending. By extending this software, it is possible to make the customer to
directly view his transactions right from beginning. This will eliminate any mischief
played by any third party person. Also provides the management reports like Released
Loans, Payments, Rejected Applications, Submitted Papers and Finance Report.
This application maintains the centralized database so that any changes done at a
location reflects immediately. This is an online tool so more than one user can login into
system and use the tool simultaneously.
The aim of this application is to reduce the manual effort needed to manage
transactions and historical data used in a finance company. Also this application provides
an interface to users to view the details like the Released Loans and Finance Report etc.
Technologies used:
J2SE, Servlets, JSP, JDBC and Java Script.
Transport Plus
ABSTRACT
It is every company’s need to see the welfare of its employees by providing

transportation for the employees to attend their duties successfully. This is the reason
many MNC companies maintain their own fleet and sometimes takes the help of third
party transport systems also. When several employees wish to utilize the bus services
provided by the company, naturally the company employees need a system to allot the
buses and oversee the transportation. Transport Plus is a software that quenches this need.
Transport Plus has four types of users. The administrator of this software will be
able to create new users and change the passwords. He can add or update the employee
information in the company. He can add and view the information of Transport categories
and also available routes. Depending on the users’ demands, new route and also new pick
up points can be added to the database. Beyond this, the administrator can also act as a
normal user and book a bus or cab for himself. He has authority to place a cab request or
cancel a request for a bus. This system calculates fare depending on three categories:
short distance, medium and long distance and the fare would be deducted from the
employees’ salaries.
When an employee of the company wants to avail the transportation facility, he

will forward a request which will be approved by the administrator depending on the
availability of room in the bus. When an employee wants a cab, it will be arranged by the
approver and later depending on the recommendation of the project manager the charge
may or may not be deducted from the employee salary.
Approver is another user of this system. He can view the details of transport
categories, routes and pick up points. He can approve a request for a cab from an
employee and store the information of assigned cab.
The transport people can view all the information related to who are the
employees utilizing the transportation. They can take a decision to approve or disapprove
the requests placed for transportation. They can arrange a cab physically for the employee
and send the cab details to the employee who placed the request.
Users and guest users are employees who want to use the transport facility. The
users can place their request for a bus to reach the company or for a cab when they want
to go to a different place. These requests are approved or declined by the transport people
or project manager.
This application has rich user interface so that novice users can access easily. This
application provides the management reports like Occupancy report, Approval status
report, to track the usage of company’s transport facility as well as cab facility.
E-School
ABSTRACT
The project entitled as “E-SCHOOL” helps the school/college management to

communicate the details of the attendance, marks, cultural activities and other
information to the students/faculty/parents through Mail/SMS. This system makes use of
threads to calculate the attendance.
Then by generating reports on each day it will identify the students who have less
percentage of attendance than the required aggregate percentage. It sends the messages to
the mobiles of the parents about the attendance and marks details. Apart from this
whenever the parent’s want to know about their children’s attendance and marks they can
directly login into the site or they can send message to the administrator by giving that
particular student’s registration number and they can get return message.
Current Scenario
In the existing system, the details of the students regarding their attendance and
marks are being maintained in the database and a print of it is made and sent to parents by
post monthly once. The problems here are:
0 More manual work
1 Chance of missing the letters through post
2 Consumes more time
Proposed System
This system helps the college to communicate the details of the attendance and
marks to the parents through Mail/SMS. By generating reports daily, weekly, monthly it
will identify the students who have less percentage of attendance than the stipulated
attendance percentage and send SMS and Mails to the parents.
Salient Features:
Fast and accurate report generation
Send attendance reports to parent’s mail
Easy, interactive GUI
Two way Communication through mails
Organizational internal survey
ABSTRACT
Organization Internal Survey is an intranet application. The main concept for

developing the project is to maintain relationship among employees. In any organization some
decisions are taken by collecting opinions of employees in the organization. A successful
organization can take right decision at right time. Decisions play a vital role in the
organization .Only the allowed employees can login and individual conclusion is made. It is
having mainly two modules. One is at Administration Level and other one is of Employees. It
maintains authentication in order to access the application. Administrator task includes
Employee Registration i.e., new employee recruitment will take place. News and information
about company can access employee.
Authorities will refer the complaints that are given by employees. Issues will put in front
of related employees to get proper solutions. For selecting higher posts Elections will be
conducted.
The user modules include reading and checking notice and displayed issues.
Employees can register complaint against management. Every employee can participate
in the elections. Nominees can put their promise on net through canvas module. Results
will be displayed for every issue. On an issue an employee can vote only for once. It
generates all the related validations.
Web Forum
ABSTRACT
Web Forum is uniquely designed for reading Internet forums and conferences. You can
easily add your favorite forums to Web Forum to stay informed about updates and changes on
these forums without loading them in your browser. Web Forum saves you time by showing
new and updated topics while hiding topics you have already read. This is a typical forums
which allows users to add threads and reply to existing threads. It also allows users to search
for existing threads. It provides all common tasks related to users such as registration, password
recovery, change profile etc.
Technologies and Products used
0 Jsp,servlets
1 Oracle10g
RSFS
ABSTRACT
This REMOTE SYSTEM FILE SEARCH development of a system that is simple

and easy to find client system files.
Using this project any one can search for a particular file or files on the client
machine by simply giving the client machines IP address, file extension and location of the file
by sitting on the server machine. The list of files with the specific extension will be displayed
on the server machine.
Some of the features are:
The proposed system should be in the way, the user can enter the client system IP, file
extension, path of the file or folder very quickly.
It should display the matching files. The files should be display in the order as they
exist.
The modules are
1. User interface
2. Searching
User interface
It provides very attractive and friendly user interface. The user can easily
interact with the system ( to provide client system IP / file system extensions..Etc).
Searching
This module allows us to search the files and folders exist in client system. It
allows regular expressions to Search the files. It displays in the files in an order as
they exist in system.
ENVIRONMENT:

Graphical User Interface: Java Swings API


RAM: 512 MB Ram
E-talk
ABSTRACT
Here is E-talk, the JSP™ Chat Application. It allows opening and managing multi skin
chat rooms. System user can open and control multiples chat rooms. Moderators can manage
users (list, ban, kickoff), manage blacklist, generate transcripts, do backup, and apply chat
rooms parameters such as max users, language, filters, performance, ... Server side needs
Servlets/JSP. Client side could be HTML/CSS/JavaScript, Applet, Flash or Application such as
SWING. Chat rooms are easily customizable thanks to skins, Etalk is ready for XML
communication to its XML Connector service.
Project Automation System
ABSTRACT

Modules in PAS
Manager Module
Team Member Module
JSP,Servlets
Oracle 10g
Hotel Management System
ABSTRACT
Hotel Software is an in-house Windows based application used by businesses to

automate their day-to-day operations such as room bookings, reservations, checkin or checkout.
Hotel reservation software is developed for suitable works of the following types of
accommodation like Hotels, Motels and Guesthouses, University accommodation letting,
Cottages, Villas, Cabins, Hostels or Any other room booking which is to be managed on a day-
to-day basis.
Java Swings
Oracle 10g
Extreme PC
ABSTRACT
XtremePC is an open source project has been developed using Java RMI-NIO and
Win32 API with Windows XP Look & Feel. It provides opportunity to access files of your
remote PC from anywhere in the world. You can even run any type of file with associated
executable files, turn off the remote PC, restart, log off, lock etc.
You can also download files from your Remote PC to the current PC, and upload files
from the currently using PC to the Remote PC. You will also be able to know the file
information before downloading and uploading files so that you would always know the file
size which is being downloaded or uploaded. Caching the contents of drives, folders added
extremely fast navigation so that you will always feel that you are accessing local drives.
It also ensures the security of passed information both ways using Data Encryption
Standard (DES) algorithm using Electronic Code Book (ECB). The Remote PC is always
protected by password. You have to know the password in order for using the Remote PC from
the current PC.
Here is a snapshot attached with this email, how you will see your PC out of your
house. However, Lite Edition does not support XP Look & Feel.
What’s new?
䜀 No more command-line interfaces. Now it is loaded with Graphical User Interface with
Windows XP Look & Feel. Those who faced problem loading XP Look& Feel, may try this Lite
Edition. It uses only built-in Java Look & Feel, which reduced size of the distributable file.
䜀 Easy and EXTREMELY fast navigation through Internet, feels like local drives.
䜀 Select a file from the remote PC and use menu to download, upload, and run on
remote PC.
䜀 Run files on remote PC with any kind of extension.
䜀 New I/O, Remote Method Invocation (RMI) technologies are involved.
Java RMI
Swings
Customer Flow Management
ABSTRACT
CFM helps companies adopt a consumer-centric perspective and begins when a

customer makes an appointment for a visit or enters a shop, bank, hospital or a public sector
service centre. It stresses the importance of planning and monitoring the customer’s entire visit,
possibly also capturing data and information at each point of contact with a member of staff or
self-service point. Furthermore it can link all the service points together, helping managers
understand the dynamics of the customer’s visit and ultimately their experience.
In short, Customer Flow Management can link the vast amount of customer information
gathered in CRM databases to the real-time activities targeting and influencing the customers
present in the service provider’s premises.
The benefits of this approach are significant. In the short-term it can increase sales and
productivity by up to 30% and decrease costs by up to 30% by ensuring that the right customer
is at the right place, at the right time and is serviced by the most appropriate staff member. It
also increases customer and staff satisfaction by reducing the actual as well as the perceived
waiting time and creating a relaxed environment characterised by a controlled and fair waiting
process. It can also generate data and insights to drive ongoing business improvements with a
mid- to long-term perspective.
So, based on 27 years of experience from more than 110 markets across the world we
believe we are well positioned to propose an answer to our own question. And we believe it is a
simple one – most service providers are not aware of the vast possibilities available and the
potential impact they might have on their business. This white paper is an attempt to set this
right by describing the opportunities embedded in Customer Flow Management.
Transportation System on IDS
ABSTRACT
Making cities liveable is a matter of growing concern for different groups across the
globe. As such, the effects that the distinct means transportation can have on different
communities have been an evolving subject of study. This coursework is intended to describe
the design of Meeting Arrangement for a university or college, a simple meeting arrangement
system based on the different means of transportation for students at the college or University.
On a given day, students arrive to the college or university for different activities (lessons and
meetings) using distinct means of transportation. Consequently, their arrival times vary
according to not only to the means but also to the departure point.
The idea is to produce a case study scenario where students can will fully register their
routes and keep their classmates updated on their arrival times. With potential application to
meeting arrangement and lesson start times, such system shall be modeled as an Informative
Digital Screen (IDS) similar to the ones located at bus stops across the city. For our case study,
we assume that such means are restricted to bus, car, and bicycle only.
By using this system, students and staff at university or college can potentially arrange
meetings and in general, be more informed to schedule activities. Such system is to be modeled
using object oriented techniques and deployed accordingly as a Java computer programming
application.
Java Swings
Electronic Care
ABSTRACT
No matter what the industry, businesses are realizing that one of the quickest and most
effective ways to strengthen their business is to treat their customer base like the valuable asset
it is. The competition for customers in every industry is fiercer than ever, as loyal customers are
expensive to acquire and easy to lose. Ten years ago, only a few people might have recognized
the expression "Customer Churn." Today, almost everyone knows what it means, and a
growing number of decision-makers can quote average churn figures for their industry, if not
their own business. Companies are more willing to invest in CRM tools and infrastructure, but
with that increased focus comes increased accountability. The pressure on customer contact
centers to improve service quality is higher than ever before. Through e-care we can solve the
customer problem on service with the help of e-mail.
Jsp,servlets
Oracle10g
Web Traffic Analyzer
ABSTRACT
This Project Mainly Designed for creating database for examination for students and
making online tests for students with random picking of different questions to different students
Application functions.
application developer
adminstrator for login
create a table for registration for scheduler exam
create a table for schedule
All data should be saved to the data base
Jsp,Servlets
Oracle10g
Mega Mart Ad Release Management
ABSTRACT
Mega Mart wanted to revive its brand image, so it hired an ad agency for it. The ad
agency came up with brilliant ideas for marketing. They created ads of all types like audio,
video, print media etc. The task of managing these ads was huge and they wanted a software
developed to manage the process better. Entering User Id and password in the Login screen.
Viewing Advertisement pricing details. Viewing Strategy report. Entering Advertisement
pricing details. Budget Allocation by the manager. All the data should be saved to database
generating unique records. Display message to the user.
Cricket Game in java
ABSTRACT
This is game project which seems to be a quiz in cricket. The project will generate a 50
fifty random multiple questions from the database one after another and displays whether the
entered option is correct or not immediately and finally displays the total number of correct
answers and grade of the user.
S/W Requirements:
H/W Requirements:
148. E-Banking
ABSTRACT
The main objective of this proposed system is to
online all the activities of a bank. The system is like to enable the bank employees to
open accounts for their customers with ease and to add the details, to transfer amount
from one account to another account and doing all the activities related to loan, making
all type of transactions. Using the system employees can also generate different types of
modules.
18 Issue Loans
19 Issue DD’s

149. Bus Scheduling and Dispatching
ABSTRACT
Bus Scheduling and Dispatching System is a windows
application software to keep track of your employees working in this
system,buses, routes,passengers, bookings and the payments . Easily
view each vehicle's schedule for the day.. Drivers can view schedules
ahead of time for better planning and time management.
This project consists of three modules .
1) Manager
2) Supervisor
3) Booking Clerk
In this project , Manager can access permission to the application and
Supervisor and Booking Clerk has their own restrictions except the
manager.
The manager adds new users to the organization and keeps track of
every operation in the system ie he can add new
employee,buses,routes and passengers.
Supervisor has no access permission to add users and passengers and
booking.
Booking Clerk has no idea of adding users snd scheduling the buses.
He is the one who is used for booking and keeps track of payments and
he generates an application form for the payments.
0 Vertical Search Engine
ABSTRACT
It’s a technique to search required URLs from the database.

In this we can store URL information along with category. It is also known as URL filtering.
With this we can save the time and improve search efficiency.
Eg: If we search “scanner” keyword. Then it can search only in hardware category.
Vertical search engines send their spiders out to a highly refined database, and their
indexes contain information about a specific topic. As a result, they are of most value to people
interested in a particular area; what’s more, the companies that advertise on these search
engines reach a much focused audience. For example, there are search engines for
veterinarians, doctors, patients, job seekers, house hunters, recruiters, travelers and corporate
purchasers, to name a few.

Java Project Titles With Abstracts

Hochgeladen von

Dokumentinformationen

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

Java Project Titles With Abstracts

Hochgeladen von

Copyright:

Verfügbare Formate

Firstman Software Solution

Sno TITLE Year

1 Binrank: Scaling Dynamic Authority-Based Search Using Materialized Sub 2010

3 Effective and Efficient Query Processing for Video Subsequence 2009

4 PBFMCSP: Prefix Based Fast Mining of Closed Sequential Patterns

5 Study on Intelligent E-Shopping System Based on Data Mining

6 Truth Discovery With Multiple Conflicting Information Providers On Web 2008

7 Protection Of Database Security Via Collaborative Inference Detection 2008

Online Index Recommendations for High-Dimensional Databases Using

An Efficient Clustering Scheme to Exploit Hierarchical Data in Network

1 Noise Reduction By Fuzzy Image Filtering(Fuzzy System) 2003

1 Energy Maps for Mobile Wireless Networks: Coherence Time versus

21 On Wireless Scheduling Algorithms For Minimizing The Queue-Overflow 2010

2 Leveraging Identity-Based Cryptography For Node Id Assignment In 2009

2 minimizing file download time in stochastic peer-to-peer networks congested 2008

27 Geometric Approach To Improving Active Packet Loss Measurement 2008

BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc

Performance Of A Speculative Transmission Scheme For Scheduling Latency

Modeling & Automated Containment Of Worms(Secure Computing With

Constructing Inter-Domain Packet Filters To Control IP Spoofing Based On

33 Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion 2008

34 Security In Large Mediator Protocols 2008

A Distributed Database Architecture For Global Roaming In Next-Generation

36 A Novel Secure Communication Protocol For Ad Hoc Networks [SCP] 2008

PARALLEL AND DISTRIBUTED SYSTEMS

3 Distributed Algorithms For Constructing Approximate Minimum Spanning 2009

Advance Computing, Secure Computing, JOURNAL

5 A Precise Termination Condition Of The Probalastic Packet Marking 2008

5 Hybrid Intrusion Detection With Weighted Signature Generation Over 2007

5 Network Border Patrol: Preventing Congestion Collapse And Promoting 2004

Web Based Project

1 Broken Links Handler

2 DEFECT TRACKING TOOL / BUG Sluts

5 College Message System

6 Scheduling And Dispatching Management System

7 Town Online Complaint System

9 Software Resource Planning Tool

10 Spam Mailing Detection System

11 Student Project Allocation And Management With Online Testing

18 CALTOOL - COMPUTER AIDED LEARNING TOOL

22 Organizational Internal Survey

27 Telecom Inventory Maintenance System

28 Project Automation System

29 Work Flow Management System

32 Bus Scheduling And Dispatching

36 Pharmacy Management System

Windows Based Project

2. Structure Text Filling

3. An Agent Based Intrusion Detection

5. Optical Multicast Routing In Ad Hoc-Network

6. Image Rendering For A Grid Tech

8 Credit Card Approval System

10 Digital Water Marking

12 Public Key Validation For Dns Security Extension

14. Web Extractor

15 Online Database Wizard

16. Visual Editor

19. Remote Network Monitoring And Control

20. Http Server

21. Implementation Of Idea Algorithm

22. Image Compression

23. Pretty Good Privacy

24. Car Sales System

25. Remote File Repository