IEEE - Java - 2010

A personal Authentication Based on IRIS Recognition
(IEEE)
ABSTRACT
Iris recognition is the process of recognizing a person by analyzing the apparent pattern of his
or her iris. There is a strong scientific demand for the proliferation of systems, concepts and
algorithms for iris recognition and identification. This is mostly because of the comparatively
short time that iris recognition systems have been around. In comparison to face, fingerprint
and other biometric traits there is still a great need for substantial mathematical and computer-
vision research and insight into iris recognition. One evidence for this is the total lack of publicly
available adequate datasets of iris images.
The program converts a photo of an eye to an 'unrolled' depiction of the subject's iris and
matches the eye to the agent's memory. If a match is found, it outputs a best match. The
current functionality matches that proposed in the original requirements.
Introduction:
A biometric system is essentially a pattern recognition system that operates by acquiring
biometric data from an individual, extracting a feature vector from the acquired data,
comparing this feature vector from the database feature vector. Person authentication has
always been an attractive goal in computer vision. Authentication systems based on human
characteristics such as face, finger, iris and voice are known Biometrics systems. The basis of
every biometric system is to get the input image and generate prominent feature vectors like
color, texture, etc.
Existing Biometric Technology

• Fingerprint Recognition
• Voice Recognition
• Signature Recognition
• Face Recognition
• Palm Recognition
IGS LABS Technologies Pvt Ltd. Email:training@igslabs.com, Ph: 9739066172, www.igslabstraining.com, www.makefinayearproject.com
Our Proposed Iris Recognition
Iris recognition is the most powerful biometric technology there is. Nothing else comes close.
Most accurate
• Scalable
• Opt-in
• Non-contact
• Interoperable cameras
What is the Iris?
The iris is the plainly visible, colored ring that surrounds the pupil. It is a muscular structure
that controls the amount of light entering the eye, with intricate details that can be measured,
such as striations, pits, and furrows. The iris is not to be confused with the retina, which lines
the inside of the back of the eye. No two irises are alike. There is no detailed correlation
between the iris patterns of even identical twins, or the right and left eye of an individual. The
amount of information that can be measured in a single iris is much greater than fingerprints,
and the accuracy is greater than DNA.
Taking a Picture:
An iris recognition camera takes a black and white picture from 5 to 24 inches away, depending
on the type of camera. The camera uses non-invasive, near-infrared illumination (similar to a
TV remote control) that is barely visible and very safe. Proof Positive certified cameras are in
compliance with all applicable international illumination safety standards, including ANSI/IESNA
RP-27.1-96 and IEC 60825-1 Amend.2, Class 1 LED. These are the latest worldwide standards.
Unlike other biometric technologies that can be used in surveillance mode, iris recognition is an
opt-in technology. In order to use the technology you must first glance at a camera. Iris
recognition cannot take place without your permission.
Iris Recognition:
In less than a few seconds, even on a database of millions of records, the Iris Code template
generated from a live image is compared to previously enrolled ones to see if it matches any of
them. The decision threshold is automatically adjusted for the size of the search database to
ensure that no false matches occur even when huge numbers of Iris Code templates are being
compared with the live one.
Some of the bits in an Iris Code template signify if some data is corrupted (for example by
reflections, or contact lens boundaries), so that it does not influence the process, and only valid
data is compared. Decision thresholds take account of the amount of visible iris data, and the
matching operation compensates for any tilt of the iris.
A key advantage of iris recognition is its ability to perform identification using a one-to-all
search of a database, with no limitation on the number of Iris Code records and no requirement
for a user first to claim an identity, for example with a card.
TECNOLOGY USED
Software Requirements
Java Swing
Java Applets
Hardware Requirements
Hard disk : 40 GB
RAM : 256 MB
Processor : Pentium IV Processor
A Bidirectional Routing Abstraction for Asymmetric
Mobile Ad Hoc Networks (IEEE)
Abstract:
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices,
non-uniform environmental noise, and other signal propagation phenomenon. 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.
Existing System:
AODV avoids any unidirectional links in its paths. It achieves this by tracking the unidirectional
links in a black list. Nodes discover unidirectional links and add them to the black list whenever
an RREP sent along the reverse path fails to return an expected acknowledgment. Once added,
a unidirectional link is retained in the black list for a short lifetime. Nodes do not forward RREPs
to any node in their black list.
Proposed System:
Improved connectivity by taking advantage of the unidirectional links

Reverse route forwarding of control packets to enable off-the-shelf routing protocols
Detection packet loss on unidirectional links.
SYSTEM REQUIREMENTS:
Hardware Interface:
Hard disk : 40 GB
RAM : 512 MB
Processor : Pentium IV
Software Interface:
JDK 1.5
Swing Builder
SQL Server
Extracting Actionable Knowledge from Decision Trees
(IEEE)
Most data mining algorithms and tools stop at discovered customer models, producing
distribution information on customer profiles. Such techniques, when applied to industrial
problems such as customer relationship management (CRM), are useful in pointing out
customers who are likely attritors and customers who are loyal, but they require human experts
to post process the discovered knowledge manually. Most of the post processing techniques
have been limited to producing visualization results and interestingness ranking, but they do not
directly suggest actions that would lead to an increase in the objective function such as profit.
In this paper, we present novel algorithms that suggest actions to change customers from an
undesired status (such as attritors) to a desired one (such as loyal) while maximizing an
objective function: the expected net profit. These algorithms can discover cost effective actions
to transform customers from undesirable classes to desirable ones. The approach we take
integrates data mining and decision making tightly by formulating the decision making problems
directly on top of the data mining results in a post processing step. To improve the
effectiveness of the approach, we also present an ensemble of decision trees which is shown to
be more robust when the training data changes. Empirical tests are conducted on both a
realistic insurance application domain and UCI benchmark data.
System Requirements
Software Specification
Operating System : Windows
Front End : HTML
Middle Ware : Java Servlets, Jsp, Struts
Back End : SQL Server
Hardware Specification:
Processor : Intel Pentium IV
Clock Speed : 700 MHZ
RAM : 128 MB
Monitor : 14” SVGA Digital Color Monitor
Keyboard : 107 Keys Keyboard
Floppy Drive : 1.44MB
Compact Disk Drive : 700MB
Hard Disk : 20GB
Mouse : Logitech Mouse
Existing System:
When data mining techniques are applied to customer relationship management it resulted in
finding out customer models and behaviors as graphical representations
Problem Findings
Using graphical representations the exact optimal knowledge could not be found
PROPOSED SYSTEM:
Enhanced Decision Tree Algorithm implementation provides the easy way to find out exact
optimal actions that can change the customer from undesired status to desired status while
maximizing the net profit.
Modules:
Main modules:
1. Customer
2. Supporting Team
3. Admin
Sub Modules:
1. Customer:
a. Customer Registration
b. Customer Login
c. View products
d. Purchasing products
e. Apply feedback
2. Supporting Team
a. View Customer Details
b. View Feedback Information
c. Build Customer Profile
d. Profit Calculation
e. Listing Action Sets
3. Admin
a. View Customer Feedback
b. View Support team Suggestions
c. View Action Set
d. Selecting Action Set
e. Apply Actions
Data Flow Diagram
CUSTOMER FEED CUSTOMER INFORMATION

BACK
BUILD CUS BUILD DECISION

SUPPORTING TOMER TREE
CUSTOMERS TEAM PROFILE
NET PROFIT CALCULATION FOR NET PROFIT FOR

CUSTOMER GROUP SINGLE CUSTOMER
ACTION SET
SELECT
BEST
ACTIONS
Customer Input
Loyal Probability
Of Customer
Decision Tree
Implementation
Post Processing
Steps
Exact Actions
Conclusion:
Most data mining algorithms and tools produce only the segments and ranked lists of
customers or products in the outputs.
In this project, we present a novel technique to take these results as input and produce
a set of actions that can be applied to transform customers from undesirable classes to
desirable ones.
DISTRIBUTED CACHE UPDATING USING DYNAMIC
SOURCE ROUTING PROTOCOL
Objective
The purpose of our project is to proactively disseminating the broken link information to the
nodes that have 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.
Existing System
• TCP performance degrades significantly in Mobile Ad hoc Networks due to the packet losses.
Most of these packet losses result from the Route failures due to network mobility.
• TCP assumes such losses occur because of congestion, thus invokes congestion control
mechanisms such as decreasing congestion windows, raising timeout, etc, thus greatly
reduce TCP throughput.
• However, after a link failure is detected, several packets will be dropped from the network
interface queue; TCP will time out because of these packet losses, as well as for
Acknowledgement losses caused by route failures.
• There is no intimation information regarding the failure links to the node from its
neighboring Node’s. So that the Source Node cannot able to make the Route Decision’s at
the time of data transfer.
Proposed System
• Prior work in Dynamic Source Routing Protocol 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.
• Prior researches have proposed to provide link failure feedback to TCP, so that TCP can avoid
responding to route failures as if congestion had occurred.
• 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.
• The Source Node has the information regarding about the destination and the intermediate
node links failure, So that it is useful from Packet loss and reduce the latency time while data
transfer throughout the Network.
Advantages of Proposed System

1. Proactive cache updating also prevents stale routes from being propagated to other
nodes
2. We defined a new cache structure called a cache table to maintain the information
necessary for cache updates. We presented a distributed cache update algorithm that
uses the local information kept by each node to notify all reachable nodes that have
cached a broken link. The algorithm enables DSR to adapt quickly to topology changes.
3. The algorithm quickly removes stale routes no matter how nodes move and which traffic
model is used.
DSR-Update Algorithm
A new distributed cache update algorithm:
1. When a node detects a link failure, proactively notifies all reachable nodes that have
cached that link about the link failure.
2. Proactive cache updating also prevents stale routes from being propagated to other
nodes
Language : Java Networking
Front End Tool : Java Swing
Back End Tool : SQL Server
Operating System: Windows 98.
Hardware Requirements
Processor : Intel Pentium III Processor
RAM : 128MB
Hard Disk : 20GB
Processor Speed: 300 min
VAS for Hand Held Device
Objectives:
This specification proposes an implementation of MMS Gateway. The prevalent of system of
handling MMS content is proprietary and non interoperable and hence implementation of MMS
solution is cumbersome in real time environment, which is full of devices of multimedia
manufactures .The scenario being as such, an MMS Gateway provides a perfect solution. This
Gateway handles the following tasks:
1. Reception of MMS messages from mobile phones for forwarding to MMSC (Multimedia
Messaging Service Center).
2. Encoding of received MMS messages in MM7 protocol.
3. Forwarding the encoded message to MMSC for delivery to respective end User
device.
To demonstrate the functioning of MMS Gateway we need some more modules. They are
Sender, Receiver, MMSC and content server. MMSC is useful for buffering the message if the
receiver is not available.
J2ME Multimedia Messaging Service (JMMS) is an application designed to provide Multimedia
Messages from handheld devices. The application has also considered the limitations of the
wireless network connections. It has been designed in such a way that it can resolve the
possible data loss during transmission and can cope up with the limitations/constraints of all
proposed target devices irrespective of differences in their sizes, display capabilities, power
supply and network support.
Environment:
• Sun Java 1.4.2
• J2ME 2.0
• J2METK
• MMS API
• MMSTK
• MM7 API
• MM7 Gateway
• WEB Server
• MMSC
• Windows 98 and above.
Scope & Limitations:
1. The proposed software targets resource constrained and more specifically wireless
computing devices.
2. Deployment requires formatting the display in an generic way so that it work for all different
types of devices.
3. Special attention is needed regarding complexities of network limitations.
Multiple Routing Configurations for Fast IP Network
Recovery (IEEE-2009)
Abstract:
As the Internet takes an increasingly central role in our communications infrastructure,

the slow convergence of routing protocols after a network failure becomes a growing problem.
To assure fast recovery from link and node failures in IP networks, we present a new recovery
scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees
recovery in all single failure scenarios, using a single mechanism to handle both link and node
failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and
assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional
routing information in the routers, and allows packet forwarding to continue on an alternative
output link immediately after the detection of a failure. It can be implemented with only minor
changes to existing solutions. In this paper we present MRC, and analyze its performance with
respect to scalability, backup path lengths, and load distribution after a failure. We also show
how an estimate of the traffic demands in the network can be used to improve the distribution
of the recovered traffic, and thus reduce the chances of congestion when MRC is used.
Existing System:
The demands on Internet reliability and availability have increased accordingly. A
disruption of a link in central parts of a network has the potential to affect hundreds of
thousands of phone conversations or TCP connections, with obvious adverse effects. The ability
to recover from failures has always been a central design goal in the Internet. IP networks are
intrinsically robust, since IGP routing protocols like OSPF are designed to update the forwarding
information based on the changed topology after a failure. This network-wide IP re-
convergence is a time consuming process, and a link or node failure is typically followed by a
period of routing instability. During this period, packets may be dropped due to invalid routes.
Proposed System:
In this paper we present a new scheme for handling link and node failures in IP
networks. Multiple Routing Configurations (MRC) is a proactive and local protection mechanism
that allows recovery in the range of milliseconds. MRC allows packet forwarding to continue
over preconfigured alternative next-hops immediately after the detection of the failure. Using
MRC as a first line of defense against network failures, the normal IP convergence process can
be put on hold. This process is then initiated only as a consequence of non-transient failures.
Since no global re-routing is performed, fast failure detection mechanisms like fast hellos or
hardware alerts can be used to trigger MRC without compromising network stability. MRC
guarantees recovery from any single link or node failure, which constitutes a large majority of
the failures experienced in a network. MRC makes no assumptions with respect to the root
cause of failure, e.g., whether the packet forwarding is disrupted due to a failed link or a failed
router.
System Requirements:
Hardware requirements:
Processor : Any Processor above 500 MHz
Ram : 128Mb.
Hard Disk : 10 GB.
Compact Disk : 650 Mb.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High Resolution Monitor.
Software requirements:
Operating System : Windows Family.
Language : JDK 1.5
Data Bases : Microsoft SQL Server
Front End : Java Swing
Enhancing Search Performance in Unstructured P2P
Networks Based on Users’ Common Interest (IEEE)
Abstract:
Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on top of the
Internet to facilitate efficient sharing of resources. They can be roughly classified as either
structured or unstructured networks. Without stringent constraints over the network topology,
unstructured P2P networks can be constructed very efficiently and are therefore considered
suitable to the Internet environment. However, the random search strategies adopted by these
networks usually perform poorly with a large network Size. In this paper, we seek to enhance
the search performance in unstructured P2P networks through exploiting users’ common
interest patterns captured within a probability-theoretic framework termed the user interest
model (UIM). A search protocol and a routing table updating protocol are further proposed in
order to expedite the search process through self organizing the P2P network into a small
world. Both theoretical and experimental analyses are conducted and demonstrated the
effectiveness and efficiency of our approach.
Existing System:
Peers in unstructured P2P networks to choose their neighbors and locally shared files, using
Flooding techniques.
In purely unstructured P2P networks such as blind search through flooding mechanisms is
usually explored for resource discovery. To find a file, a peer sends out a query to its neighbors
on the overlay, until the query has traveled a certain radius. Despite its simplicity and
robustness, flooding techniques, in general, do not scale. In large networks, the probability of a
successful search may decrease dramatically without significantly enlarging the flooding radius.
Disadvantages:
• Blind Search.
• Future reference is not present in routing table.
• Delay due to absence of Routing Updating table.
Proposed System:
In order to improve search performance, guided search. The key problem is what information is
actually eligible to guide the search. Used interest-based locality as the general search
guidance. The basic assumption is that if a peer p0 has a particular file required by another
peer p, and then p0 is likely to have other files to be requested by p in the future. According to
previous successful queries, shortcuts from peer p to several peers p0 are established in order
to expedite subsequent search processes.
Advantages:
• Guided Search.
• Routing updating table.
• Fast Search Technique based on UIM.
System Requirement:
SOFTWARE REQUIREMENTS:-
Java1.3 or More
Java Swing – front end
SQL-back end
Windows 98 or more.
HARDWARE REQUIREMENTS:-
Hard disk : 40 GB
RAM : 128mb
Processor : Pentium
TTA
ANNR
ROOX
XWWO
ORRK
K FFO
ORRC
CEE
Objectives:
Tanrox work force is time collection software that is streamlined for billing and invoicing
purposes. Tanrox work force allows time tracking for customer and project related tasks. After
being collected the data can then be exported for invoice generation.
Description:
This guide describes how to execute these activities using Tanrox work force interfaces.
In addition, section Getting started describes initial data setup up to the point when you are
ready to start registering working time with Tanrox work force.
Section contents:
• Overview
• Submit time-track for the current week
• Submit and modify time-track for the selected date/week
• View time-track for a selected month
• Delete reported time-track
• Remove tasks from the Submit Time-Track interface
Registration of time expenses consists of the following activities related to registering and
managing your personal time expenses:
• Submitting time-track
• Viewing personal time-track
• Modifying personal time-track
• Deleting personal time-track
Time-track is Tanrox work force's term used to refer to working time submitted and stored in
the system.
To access the interfaces for submission of time-track use the top-level menu option 'Submit
Time-track'. To access the interfaces for browsing the submitted time-track use the top-level
menu option 'My Time-track'.
Users shall have the 'Submit Time-Track' access right to access interfaces for submission and
browsing of time-track. Note that the users who do not have this right as well as user 'root' will
not see these interfaces at all.
The interfaces for submission and management of personal time-track always show and store
time tracked by the user who is currently logged in. To browse the time-track submitted by
other users use the Staff output report (see section Generate staff output report).
To access the interfaces for Tasks, Projects, and Customers Management use top-level menu
option 'Projects & Tasks'.
Each of the access rights regulates user access to the corresponding subset of system
interfaces. System users may have any combination of these access rights. For example:
• A user who has only 'Manage Tasks' access right will be able to create new tasks to
track time expenses for, but will not be allowed to create new projects and customers.
• A user who has only 'Manage Customers' access right will be able to create and modify
customers but will not be able to create projects and tasks.
Grant these access rights to users according their responsibilities in everyday work. If you do
not need to introduce subordination between users and responsibilities, just grant all three
access rights to those users who are responsible for project/task management in your
organization. For example, you can grant them to project managers.
Note that users who do not have some access right will not see the interfaces associated with
this right at all.
See section User management about information on how to grant access rights to system users.
Hardware Requirements:
Processor : Intel P-III based system
Processor Speed : 250 MHz to 833MHz
RAM : 64MB to 256MB
Hard Disk : 2GB to 30GB
Software Requirements:
Language : Java
Web Components : Html, Jsp
Control Components : Servlets
Framework : Struts
Scripting Language : JavaScript
Web Server : Tomcat
Database (Back End) : MySQL
Mobile Gadgeteer (Remote pc Accessing using Mobile)
Objectives:
This application is designed to provide the user Access a PC from his mobile device.
This project is to enable the mobile users to control his PC information at their finger tips.
The application must consider the limitations of mobile devices.
This project involves flow of data on the Wireless Application Protocol.
The application must work properly without problems on all targeted devices, power supply and
network support.
Environment:
• J2ME 2.0 TOOL KIT
• J2SDK 1.4.1
• MIDP 2.0
• XML
• Java / Java servlets / Java Server Pages
• Windows NT/200X

The proposed software targets resource constrained and more specifically wireless computing
devices.
Deployment requires formatting the display in a generic way so that it works for all different
types of devices.
Special attention is needed regarding complexities of network limitations.
Introduction:
The Mobile Information Device Profile (MIDP) is the first and most mature J2ME profile. MIDP is
based on the CLDC and is currently supported by major device manufacturers such as Motorola,
Nokia, Ericsson, and RIM, and by carriers like SprintPCS, Nextel, and NTT DoCoMo. Many
independent software vendors also support MIDP. Table summarizes the target devices for
MIDP 2.0.
Table Device Requirements for Mobile Information Device Profile 2.0
Requirement Description
Display Screen- size: 96x54,. Display depth: 1- bit. Pixel shape (aspect ratio):
approximately 1:1.
Input One or more of the following user-input mechanisms: one-handed keyboard, two-
handed keyboard, or touch screen.
Memory 256 kilobytes of non-volatile memory for the MIDP implementation, beyond what’s
required for CLDC. 8 kilobytes of non-volatile memory for application-created
persistent data. 128 kilobytes of volatile memory for the Java runtime.
Networking Two-way, wireless, possibly intermittent, with limited bandwidth.
Power Limited power, typically battery-operated.
MIDP, led by Motorola, was initially defined by JSR 37, which produced the MIDP 1.0
specification, and then by JSR 118, which defined the MIDP 2.0 specification. MIDP2.0
enhanced version 1.0 quite a bit. Even though the MIDP specification indicates the use of CLDC
1.0, nothing would preclude MIDP 2.0 (or 1.0) using CLDC 1.1 as its base.
In addition to the MIDP 1.0 APIs for networking, user interfaces, local persistence, and MIDlet
life-cycle, MIDP 2.0 adds APIs for networking, including socket (TCP) streams, UDP datagrams,
serial, push-initiated, and secure connections, as well as a robust security API and policy, and
APIs for sound and even gaming. MIDP 2.0 also formally includes in the profile specification an
update of the MIDP 1.0 Over the Air (OTA) User Initiated Provisioning recommendation
(originally defined as an addendum to the MIDP 1.0 specification), which describes how
applications are to be discovered and downloaded over wireless networks. Table summarizes
the packages available in MIDP 1.0 and MIDP 2.0.
Mobile Invoice
Objective:
This specification proposes of Mobile Invoice. The prevalent of system of handling Mobile Billing
content is proprietary and non interoperable and hence Mobile Invoice solution is cumbersome
in real time environment, which is full of devices of multimedia manufactures. The scenario
being as such, a Mobile Invoice Application provides a perfect solution. This Application handles
the following tasks:
1. Paying Bills of Electricity, Water bills, Municipality. Etc.

2. Transactions on the bill payments...
Mobile Invoice is useful for paying bills by using the common mobile which is available at low
rates.
This system was implemented using the J2ME, SERVLETS, NETWORKING concepts of J2SE.
Description:
Java™ Platform, Micro Edition (Java ME) is the most ubiquitous application platform for mobile
devices across the globe. It provides a robust, flexible environment for applications running on
a broad range of other embedded devices, such as mobile phones, PDAs , TV set-top boxes,
and printers. The Java ME platform is deployed on millions of devices, supported by leading tool
vendors, and used by companies worldwide. In short, it is the platform of choice for today's
consumer and embedded devices.
Modules:
Authentication Module
Communication Module
Service Module
Billing Module
Checking Module
Language Used:
Java,J2ee,J2me
The proposed software targets resource constrained and more specifically wireless
computing devices.
Deployment requires formatting the display in a generic way so that it works for all
different types of devices.
Special attention is needed regarding complexities of network limitations
EMBEDDING THE SECURE DATA IN AN AUDIO/VIDEO
AND IMAGE FILES
Objective
The purpose of our project is to enable the development of hiding the data and to encrypt the
data using cryptography. Steganography is the science of hiding information and the goal of
Steganography is to hide the data from a third party where as the goal of cryptography is to
make data unreadable by a third party.
But simply encrypting the data and transmitting it will cause suspension among the viewers so
in this project to avoid such suspension, the data is embedded into a picture and this innocent
looking picture is transmitted.
Existing System
Almost all digital file formats can be used for embedding data, but the formats that are more
suitable are those with a high degree of redundancy. Redundancy can be defined as the bits of
an object that provide accuracy far greater than necessary for the object’s use and display.
Hiding information in text is historically the most important method of embedding data. An
obvious method was to hide a secret message in every nth letter of every word of a text
message.
It is only since the beginning of the Internet and all the different digital file formats that is
decreased in importance. Text embedding data using digital files is not used very often since
text files have a very small amount of redundant data.
Given the proliferation of digital images, especially on the Internet, and given the large amount
of redundant bits present in the digital representation of an image, images are the most popular
cover objects for embedding data.
Proposed System
In the proposed system we can overcome the difficulties of the existing system. In our system
we are introducing all the three concept to secure the information which is send by the user.
The data/information which the sender wants to send will be encrypted and then if the
information is too bigger in size there is an option to compress the data using compression
technique and later that data/information is embedded in the audio/video or image files.
For encrypting and decrypting the data/information we have used DES algorithm.
Hiding the text or file inside least significant of an image. By using this intruder could not be
able to see the content since there is no change will be seen compare to original images.
DES algorithm is used to encrypt the message which is hided in the image.
DES is used to give the extra protection for a data which has to be hide.
Compression technology has been used to compress the size of the message in order to save
memory.
Modules:
1. Hiding Test in image
a. Compression
b. Encryption
2. Decryption
a. Decrypting
Encryption Module:
In this module we can hide the text in side the image using least significant bit algorithm.
Before that user has to encrypt the message using DES algorithm. And then he can compress it.
Decryption Module:
In this module user will take care of reading the hidden message from Image and that
message can be decrypted.
System Environment:
Hardware Requirements:
Hard disk : 40 GB
RAM : 512 MB
Processor Speed : 3.00GHz
JDK 1.5 and more
Java Swing – front end
Image Processing Editor
PURPOSE OF THE PROJECT:
Image Processing comes with a GUI (graphical user interface) program that lets us play with its
various features. The program is based on AWT (the Abstract Windowing Toolkit) so that more
people can run it. All that is required is an installed Java 1.1 Runtime Environment and a system
that can be put into some sort of graphics mode or work online with Internet Browser.
PROBLEM IN EXISTING SYSTEM:
• Available systems are for any one Operating System

• Available systems supports only some Formats of images and uses color settings from
system.
• Available systems are only for stand alone systems.
SCOPE OF THE PROJECT:
As there is lot of crazy towards graphics, photos or images editing, processing is very important
in that process. This application is accessible on any system and any platform. This application
can be used to change the setting of old photos, creating a new type of icons to add them into
applications and web sites. This application can be used to change the format of images from
one file type to another in simple way so that users or programmers can use one image in any
format according to compatibility and accessibility in their applications.
Modules of this Product are as follows:

1. Image Color Processing:
This Module is responsible for processing the Color of picture. The following are the
sub processes of this module:
Adjustment
Brightness
Contrast
Gamma
Histogram
Colors Used
Equalize
Normalize
Save histogram
Convert to Grayscale
Invert
Promote
Reduce
Invert
Convert to minimum color type
The above are the operations conducted by the Image Color Processing Module.
2. Image Geometry Module:

This Module allows the user to apply Geometry for pictures the following are operations
conducted by this module:
• Mirroring
• Flip
• Rotate left
• Rotate right
• Rotate(180)
• Crop
• Scale
• Shear
3. Filters Module:
This Module applies Filter operations to the pictures the following are the operations conducted
by this module:
• Blur
• Sharpen
• Edge Detection
• Emboss
• Psychedelic distillation
• Lithograph
• Horizontal sobel
• Vertical sobel
• Horizontal prewitt
• Vertical prewitt
• Minimum
• Maximum
• Median
• Oil paint
4. View Module:
This Module performs Zoom-in, Zoom-out and Original size Operations.
5. HARDWARE & SOFTWARE SPECIFICATIONS

Environment : Java Runtime Environment 1.1d above
Operating System : Any with compatible JVM
Hard disk : 4 GB
Processor : PII or higher
Browser : Mozilla Compact
Secure Data Transmission
Objective:
The system deals with security during transmission of data. Commonly used technology is
cryptography. This system deals with implementing security-using Steganography.
Description:
In this technology, the end user identifies an image which is going to act as the carrier of data.
The data file is also selected and then to achieve greater speed of transmission the data file and
image file are compressed and sent. Prior to this the data is embedded into the image and then
sent. The image if hacked or interpreted by a third party user will open up in any image
previewer but not displaying the data. This protects the data from being invisible and hence be
secure during transmission. The user in the receiving end uses another piece of code to retrieve
the data from the image.
Steganography is the art and science of hiding that communication is happening. Classical
Steganography systems depend on keeping the encoding system secret, but modern
Steganography is detectable only if secret information is known, e.g. a secret key. Because of
their invasive nature, Steganography systems leave detectable traces within a medium's
characteristics. This allows an eavesdropper to detect media that has been modified, revealing
that secret communication is taking place. Although the secrecy of the information is not
degraded, its hidden nature is revealed, defeating the main purpose of Steganography.
For JPEG images, Outguess preserves statistics based on frequency counts. As a result,
statistical tests based on frequency counts are unable to detect the presence of steganographic
content. Before embedding data into an image, Outguess can determine the maximum message
size that can be hidden while still being able to maintain statistics based on frequency counts.
Outguess uses generic iterators object to select which bits in the data should be modified. A
seed can be used to modify the behavior of the iterator. It is embedded in the data along with
the rest of the message. By altering the seed, Outguess tries to find a sequence of bits that
minimizes the number of changes in the data that have to be made.
Compression reduces the average code length used to represent the symbols of an alphabet.
Symbols of the source alphabet which occur frequently are assigned with short length codes.
The general strategy is to allow the code length to vary from character to character and to
ensure that the frequently occurring character have shorter codes. In Radix64 compression
technique, maps arbitrary input into printable character output. The form of encoding has the
following relevant characteristics.
The range of the function is a character set that is universally re-presentable at all sites, not a
specific binary encoding of that character set. Thus, the characters themselves can be encoded
into whatever form is needed by a specific system. For instance, the character 'E' is represented
in ASCII system as a hexadecimal 45 and in EDCDIC- based system as hexadecimal- c5.
The character set consists of 65 printable characters, one of which is used for padding. With
2^6 = 64 available characters, each character can be used to represent 6 bits of input. No
control characters are included in the set. Thus, the message encoded in Radix-64 can traverse
mail-handling system. That scans the data stream for control characters. The hyphen character
"-” is not included.
CRCSET is an anti-virus utility. Its purpose is to protect programs from third parties
manipulation .CRC set is the most effective weapons against computer viruses. This the Cyclic
Redundancy Check, or CRC, is an error-checking algorithm used in many types of computer
operations, especially in data transfer.
Before transmitting the data, the utility want to calculate the CRC value and attach with data. In
receiving end, the CRC recalculated and based on that calculated value, it will specify the
acceptation or rejection.
Module Description:
This project contains five modules. They are
Graphical User Interface
Data Embed and Retrieve
Compression and Decompression
CRC generation.
CRC Verification
Software Requirements:
Operating System : window 2000 or XP
Software : jdk 1.4 or above
Intrusion Detection System (IDS)
Objective:
The project titled Intrusion Detection System in Networking Using Genetic

Algorithm (IDS) is for Global Techno Solutions. The main objective of this system shows how
real time network connection behavior can be modeled as chromosomes and how the
parameters in genetic algorithm can be defined in this respect.
Description:
The project titled Intrusion Detection System in Networking Using Genetic

Algorithm (IDS) is to identify the intruder and block the data from the intruder to avoid the
system attack by the virus. This new system is a replacement of the existing system. In existing
system, at run time it will not create a set of rules. The major components of the system are
creating new set of rules during run time.
Interest and knowledge about computer and network security is growing along
with the need for it. This interest is, no doubt, due to the continued expansion of the Internet
and the increase in the number of businesses that are migrating their sales and information
channels to the Internet. The growth in the use of networked computers in business, especially
for e-mail, has also fueled this interest. Many people are also presented with the post-mortems
of security breaches in high-profile companies in the nightly news and are given the impression
that some bastion of defense had failed to prevent some intrusion. One result of these
influences is that that many people feel that Internet security and Internet firewalls are
synonymous. Although we should know that no single mechanism or method will provide for
the entire computer and network security needs of an enterprise, many still put all their
network security eggs in one firewall basket.
Modules:
Modules here designed are:

• Server
• Client
• New Entry
• Anomaly User
• Normal User
Hardware:
Processor : Intel Pentium II or above
Memory : 128 MB or above
Hard Disk Drive : 10 GB or above
Keyboard : 108 Keys
Efficient key Agreement for Large and Dynamic Multicast
Groups (IEEE)
Secure multicast represents the core component of many web and multimedia applications such
as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main
challenge for secure multicast is scalability, efficiency and authenticity. In this project, we
propose a scalable, efficient, authenticated group key agreement scheme for large and dynamic
multicast systems. The proposed key agreement scheme is identity-based which uses the
bilinear map over the elliptic curves. Compared with the previously published schemes, our
scheme provides group member authenticity without imposing extra mechanism. Furthermore,
we give a scalability solution based on the subgroups, which has advantages over the existing
schemes. Security analysis shows that our scheme satisfies both forward secrecy and backward
secrecy.
Project Objective:
The objectives of the project are as follows:
• Design the single multicast group.
• Generation of session keys and unique private keys of users.
• Encoding and decoding of text message
• Secure transmission of session key by using encryption algorithm data encryption
standard (DES).
• Design the multi group with multiple data stream in such a way that reduced overhead
of key server.
• Implementing and testing the techniques in a simulation environment.
Existing System:
In the Existing system we use Iolus approach proposed the notion of hierarchy subgroup for
scalable and secure multicast. In this method, a large communication group is divided into
smaller subgroups. Each subgroup is treated almost like a separate multicast group and is
managed by a trusted group security intermediary (GSI). GSI connect between the subgroups
and share the subgroup key with each of their subgroup members. GSIs act as message relays
and key translators between the subgroups by receiving the multicast messages from one
subgroup, decrypting them and then re multicasting them to the next subgroup after encrypting
them by the subgroup key of the next subgroup. The GSIs are also grouped in a top-level group
that is managed by a group security controller (GSC),
When group members join or leave only affect subgroup only while the other subgroup will not
be affected. It has the drawback of affecting data path. This occurs in the sense that there is a
need for translating the data that goes from one subgroup, and thereby one key, to another.
This becomes even more problematic when it takes into account that the GSI has to manage
the subgroup and perform the translation needed. The GSI may thus become the bottleneck.
Proposed System:
The advantages over the existing system are, we use an identity tree instead of key tree in our
scheme. Each node in the identity tree is associated with an identity. The leaf node’s identity is
corresponding to the user’s identity and the intermediate node’s identity is generated by its
children’s identity. Hence, in an identity tree, an intermediate node represents set users in the
sub tree rooted at this node.
In our scheme, even though a subgroup controller fails, it does not affect its subgroup.
Because every user in the subgroup can act as the subgroup group controller.
The keys used in each subgroup can be generated by a group of key generation centers (KGCs)
in parallel. All the members in the same subgroup can compute the same subgroup key though
the keys for them are generated by different KGCs. This is a desirable feature especially for the
large-scale network systems, because it minimizes the problem of concentrating the workload
on a single entity.
System Requirement Specification

1. User Interface
Java Swing:
Swing is a set of classes that provides more powerful and flexible components
that are possible with AWT. In addition to the familiar components, such as button checkboxes
and labels, swing supplies several exciting additions, including tabbed panes, scroll panes,
trees and tables.
Applet - Applet is a dynamic and interactive program that can run inside a web page
displayed by a java capable browser such as hot java.
Hardware Interface
Hard disk : 40 GB
RAM : 512 MB
Processor Speed : 3.00GHz
Software Interface
JDK 1.5
Java Swing
SQL Server
Conclusion:
The Proposed system is an efficient, authenticated, scalable key agreement for large and
dynamic multicast systems, which is based on the bilinear map. Compared with the Existing
system, we use an identity tree to achieve the authentication of the group member. Further, it
solves the scalability problem in multicast communications. Since a large group is divided into
many small groups. Each subgroup is treated almost like a separate multicast group with its
own subgroup key. All the keys used in each subgroup can be generated by a group of KGC’s in
parallel. The intuitively surprising aspect of this scheme is that, even the subgroup controller
aborts, it does not affect the users in this subgroup. Because every user in the subgroup can
act as a subgroup controller. This is a significant feature especially for the mobile and ad hoc
networks. From the security analysis we can see that our scheme satisfies both forward and
backward secrecy.
Multihoming Route Control
Abstract
Multihoming is increasingly being employed by large enterprises and data centers to

extract good performance and reliability from their ISP connections. Multihomed end networks
today can employ a variety of route control products to optimize their Internet access
performance and reliability. However, little is known about the tangible benefits that such
products can offer the mechanisms they employ and their trade-offs. This paper makes two
important contributions. First, we present a study of the potential improvements in Internet
round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our
analysis shows that multihoming to three or more ISPs and cleverly scheduling traffic across the
ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively.
However, a careful selection of ISPs is important to realize the performance improvements.
Second, focusing on large enterprises, we propose and evaluate a wide-range of route control
mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a
Linux-based Web proxy and perform a trace-based evaluation of their performance. We show
that both passive and active measurement-based techniques are equally effective and could
improve the Web response times of enterprise networks by up to 25% on average, compared to
using a single ISP. We also outline several “best common practices” for the design of route
control products.
Existing System:
First, we present a study of the potential improvements in Internet round-trip times

(RTTs) and transfer speeds from employing multihoming route control. However, over the past
few years, multihoming has been increasingly leveraged for improving wide-area network
performance, lowering bandwidth costs, and optimizing the way in which upstream links are
used [1]. A number of products provide these route control capabilities to large enterprise
customers which have their own public AS number and advertise their IP address prefixes to
upstream ISPs using BGP.recognizing that not all enterprises are large enough to warrant BGP
peering with ISPs, another class of products extends these advantages to smaller multihomed
organizations which do not use BGP.l of these products use a variety of mechanisms and
policies for route control but aside from marketing statements, little is known about their
quantitative benefits.
Proposed System:
In this paper, we study mechanisms for improving Internet performance of enterprise

networks via route control. Several research studies and products have considered other
benefits of multihoming route control. In a study closely related to ours, the authors conduct
trace-driven experiments to evaluate several design options using a commercial multihoming
device. The evaluation focuses on the ability of several algorithms to balance load over multiple
broadband-class links to provide service similar to a single higher-bandwidth link. The authors
find that the effectiveness of hash-based link selection (i.e., hashing on packet header fields) in
balancing load is comparable to load-based selection. Andersen et al. similarly consider various
mechanisms for improving the reliability of Web access for DSL clients in.
Requirement Analysis:
SOFTWARE REQUIREMENTS:-
• Jdk1.5
• Java Swing
• Windows 98 or more.
HARDWARE REQUIREMENTS:-
Hard disk : 40 GB
RAM : 128mb
Processor : Pentium

IEEE - Java - 2010

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IEEE - Java - 2010

Uploaded by

Copyright:

Available Formats

A personal Authentication Based on IRIS Recognition

Existing Biometric Technology

What is the Iris?

Improved connectivity by taking advantage of the unidirectional links

CUSTOMER FEED CUSTOMER INFORMATION

BUILD CUS BUILD DECISION

NET PROFIT CALCULATION FOR NET PROFIT FOR

Advantages of Proposed System

solution is cumbersome in real time environment, which is full of devices of multimedia

Gateway handles the following tasks:

receiver is not available.

J2ME Multimedia Messaging Service (JMMS) is an application designed to provide Multimedia

supply and network support.

• Sun Java 1.4.2

• Windows 98 and above.

Scope & Limitations:

3. Special attention is needed regarding complexities of network limitations.

As the Internet takes an increasingly central role in our communications infrastructure,

Scope & Limitations:

Networking Two-way, wireless, possibly intermittent, with limited bandwidth.

Power Limited power, typically battery-operated.

1. Paying Bills of Electricity, Water bills, Municipality. Etc.

Scope & Limitations:

PROBLEM IN EXISTING SYSTEM:

• Available systems are for any one Operating System

SCOPE OF THE PROJECT:

Modules of this Product are as follows:

2. Image Geometry Module:

5. HARDWARE & SOFTWARE SPECIFICATIONS

The project titled Intrusion Detection System in Networking Using Genetic

The project titled Intrusion Detection System in Networking Using Genetic

Modules here designed are:

System Requirement Specification

Multihoming is increasingly being employed by large enterprises and data centers to

First, we present a study of the potential improvements in Internet round-trip times

In this paper, we study mechanisms for improving Internet performance of enterprise

You might also like