Final Year Students Projects VB Net Java J2ME J2EE VB Ieee Projects Zebros India

Voice of the Engineers
IEEE Projects
S.No. IEEE Project Titles Year

1. 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. 2008/Jav
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.
2. 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 2008/Jav
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
Corporate Office: ZEBROS INDIA PVT LTD,

ADDRESS # 12 A, M.G.Road, Shastri Nagar, Adyar, Chennai - 20.
E - zebros@live.com | zebrosindia@yahoo.com ; W - www.zebros.co.in | www.zebrosindia.com ;
T – 96000 96001 | 95000 75001; B - Madurai, Thirunelveli, Thanjavur, Erode;
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.
3. 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, 2008/Jav
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).
4. 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 2008/Jav
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.
5. Digital Image Processing Techniques for the Detection and Removal of
Cracks in Digitized Paintings
2008/.Ne
Abstract: An integrated methodology for the detection and removal of cracks on digitized
paintings is presented in this project. The cracks are detected by threshold the output of the
morphological top-hat transform. Afterward, the thin dark brush strokes which have been
misidentified as cracks are removed using either a median radial basis function neural network
on hue and saturation data or a semi-automatic procedure based on region growing. Finally,
crack filling using order statistics filters or controlled anisotropic diffusion is performed. The
methodology has been shown to perform very well on digitized paintings suffering from cracks.
6. 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 2008/Jav
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.
7. 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 2008/Jav
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.

8. Online Handwritten Script Recognition
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 2008/Jav
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.
9. ODAM: An Optimized Distributed Association Rule Mining Algorithm
Abstract: 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. 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 2008/Jav
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 sub-area 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. However, most DARM algorithms don't have an efficient message
optimization technique, so they exchange numerous messages during the mining process. We

have developed a distributed algorithm, called Optimized Distributed Association Mining, for
geographically distributed data sets. ODAM generates support counts of candidate item sets
quicker than other DARM algorithms and reduces the size of average transactions, data sets,
and message exchanges.
10. Protocol Scrubbing: Network Security Through Transparent Flow
Modification
Abstract: This paper describes the design and implementation of protocol scrubbers.
Protocol scrubbers are transparent, interposed mechanisms for explicitly removing network 2008/Jav
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 insertion 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.
11. 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

2008/Jav
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.
12. Workflow Mining: Discovering Process Models from Event Logs
Abstract: Contemporary workflow management systems are driven by explicit process

models, i.e., a completely specified workflow design is required in order to enact a given
workflow process. Creating a workflow design is a complicated time-consuming process and, 2008/.Ne
typically, there are discrepancies between the actual workflow processes and the processes as
perceived by the management. Therefore, we have developed techniques for discovering
workflow models. The starting point for such techniques is a so-called “workflow log” containing
information about the workflow process as it is actually being executed. We present a new
algorithm to extract a process model from such a log and represent it in terms of a Petri net.
However, we will also demonstrate that it is not possible to discover arbitrary workflow
processes. In this paper, we explore a class of workflow processes that can be discovered. We
show that the α-algorithm can successfully mine any workflow represented by a so-called SWF-
net.
13. An Agent Based Intrusion Detection, Response and Blocking using
signature method in Active Networks
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 2008/Jav
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.
14. 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. 2008/Jav
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.
15. ITP: An 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 byte stream 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 2008/Jav
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.

16. 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 2008/J2E
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.
17. Incremental deployment service of Hop by hop multicast routing protocol
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). 2008/Jav
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.
18. Network border patrol: preventing congestion collapse and promoting
fairness in the Internet
Abstract: The Internet's excellent scalability and robustness result in part from
2008/Jav
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 queueing
(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.
19. 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 2008/Jav
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.
20. Neural Networks for Handwritten character and Digits
Abstract: This article chronicles the development of an artificial neural network

designed to recognize handwritten digits. Although some theory of neural
networks is given here, it would be better if you already understood some
neural network concepts, like neurons, layers, weights, and backpropagation.
2008/VC
The neural network described here is not a general-purpose neural network,
and it's not some kind of a neural network workbench. Rather, we will focus on
one very specific neural network (a five-layer convolutional neural network) built
for one very specific purpose (to recognize handwritten digits).
The idea of using neural networks for the purpose of recognizing handwritten digits is not a new
one. The inspiration for the architecture described here comes from articles written by two
separate authors. The first is Dr. Yann LeCun, who was an independent discoverer of the basic
backpropagation algorithm. Dr. LeCun hosts an excellent site on his research into neural
networks. In particular, you should view his "Learning and Visual Perception" section, which
uses animated GIFs to show results of his research. The MNIST database (which provides the
database of handwritten digits) was developed by him. I used two of his publications as primary
source materials for much of my work, and I highly recommend reading his other publications
too (they're posted at his site). Unlike many other publications on neural networks, Dr. LeCun's
publications are not inordinately theoretical and math-intensive; rather, they are extremely
readable, and provide practical insights and explanations.
21. Selective Encryption of Still Image
Abstract: In some applications, it is relevant to hide the content of a message when it enters
an insecure channel. The accepted view among professional cryptographers is that the
encryption algorithm should be published, whereas the key must be kept secret. In the field of
image cryptography, the focus has been put on steganography, and in particular on
watermarking during the last years. Watermarking, as opposed to steganography, has the 2008/VB
additional requirement of robustness against possible image transformations. Watermarks are
usually made invisible and should not be detectable. In applications requiring transmission the Java

image is first compressed, because it saves bandwidth. Then the image is encrypted. There is
a need for a technique called selective encryption of compressed images with messages.
Initially it aims of image encryption and various methods. Usually, during encryption, all the
information is encrypted. But this is not mandatory, only a part of the image content will
encrypted with messages in order to be able to visualize the encrypted Images, although not
with full precision. This concept leads to techniques that can simultaneously provide security
functions and an overall visual check which might be suitable in some applications like
searching through a shared image database, distributed database for image storage etc., The
principle of selective encryption is first applied to compressed images with messages . This
technique is proven not to interfere with the de-coding process in the sense that it achieves a
constant bit rate and that bit streams remain compliant to the JPEG specifications.
22. An Acknowledgment-Based Approach For The Detection Of Routing
Misbehavior In MANETs
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 2008/Jav
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.
23. Neural Network-Based Face Detection
Abstract: We present a neural network-based upright frontal face detection system. A retinal
connected neural network examines small windows of an image, and decides whether each
window contains a face. The system arbitrates between multiple networks to improve 2008/VC
performance over a single network. We present a straightforward procedure for aligning positive
face examples for training. To collect negative examples, we use a bootstrap algorithm, which
adds false detections into the training set as training progresses. This eliminates the difficult

task of manually selecting non face training examples, which must be chosen to span the entire
space of non face images. Simple heuristics, such as using the fact that faces rarely overlap in
images, can further improve the accuracy. Comparisons with several other state-of-the-art face
detection systems are presented; showing that our system has comparable performance in
terms of detection and false-positive rates.
24. 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 2008/Jav
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.
25. 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. 2008/Jav
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.
26. XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks
Abstract: The XTC AD-HOC network topology control algorithm introduced shows three 2008/Jav
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.
27. A near-optimal multicast scheme for mobile ad hoc networks using a
hybrid genetic algorithm
Abstract: Multicast routing is an effective way to communicate among multiple hosts in a

network. It outperforms the basic broadcast strategy by sharing resources along general links,
while sending information to a set of predefined multiple destinations concurrently. However, it
is vulnerable to component failure in ad hoc network due to the lack of redundancy, multiple 2008/Jav
paths and multicast tree structure. Tree graph optimization problems (GOP) are usually difficult
and time consuming NP-hard or NP-complete problems. Genetic algorithms (GA) have been
proven to be an efficient technique for solving the GOP, in which well-designed chromosomes
and appropriate operators are key factors that determine the performance of the GAs. Limited
link, path constraints, and mobility of network hosts make the multicast routing protocol design
particularly challenging in wireless ad hoc networks. Encoding trees is a critical scheme in GAs
for solving these problems because each code should represent a tree. Prufer number is the
most representative method of vertex encoding, which is a string of n-2 integers and can be
transformed to an n-node tree. However, genetic algorithm based on Prufer encoding (GAP)

does not preserve locality, while changing one element of its vector causes dramatically change
in its corresponding tree topology. In this paper, we propose a novel GA based on sequence
and topology encoding (GAST) for multicast protocol is introduced for multicast routing in
wireless ad hoc networks and generalizes the GOP of tree-based multicast protocol as well as
three associated operators. It has revealed an efficient method of the reconstruction of multicast
tree topology and the experimental results demonstrated the effectiveness of GAST compare to
GAP technique.
28. Mobile Agents In Distributed Multimedia Database Systems
Abstract: The size of networks is increasing rapidly and this fact is not straitened to the
internet alone. Many intra and inter–organization networks are affected by this trend, too. A side
effect of this growth is the increase of network traffic. This development leads to new
challenges and we have to think about new technologies. Mobile agent systems are one
answer to these challenges. Mobile agents are an emerging technology attracting interest from
the fields of distributed systems, information retrieval, electronic commerce and artificial
intelligence. 2008/Jav
A mobile agent is an executing program that can migrate during execution from machine to
machine in a heterogeneous network. On each machine, the agent interacts with stationary
service agents and other resources to accomplish its task, returning to its home site with a final
result when that task is finished. Mobile agents are particularly attractive in distributed
information-retrieval applications. By moving to the location of an information resource, the
agent can search the resource locally, eliminating the transfer of intermediate results across the
network and reducing end-to-end latency. Mobile agents are goal-oriented, can communicate
with other agents, and can continue to operate even after the machine that launched them has
been removed from the network.
The mobile feature enables the agent to travel to the host where the data are physically stored.
This is obviously of great interest in a distributed multimedia database systems where we have
in most cases large binary objects. This Project integrates mobile agent technology in a
distributed database system. The advantage of this approach is the combination of mobile
agent features (e.g. autonomy, mobility, enhancement of functionality) and database services
such as recovery, transaction handling, concurrency and security. This projects aims at
facilitating storage and retrieval of multimedia data from the distributed multimedia database
using mobile agents based on host database which will provide the result to the user upon
request.
29. Image Stream Transfer Using Real-Time Transmission 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 byte-stream 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 2008/Jav
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-of-order 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.
30. 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, C# .Net
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.


Final Year Students Projects VB Net Java J2ME J2EE VB Ieee Projects Zebros India

Uploaded by

Document Information

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

Final Year Students Projects VB Net Java J2ME J2EE VB Ieee Projects Zebros India

Uploaded by

Copyright:

Available Formats

Voice of the Engineers

S.No. IEEE Project Titles Year

Abstract: The capability of dynamically adapting to distinct runtime conditions is an important

Corporate Office: ZEBROS INDIA PVT LTD,

We propose an appearance-based face recognition method called the Laplacianface approach.

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

Abstract: Automatic identification of handwritten script facilitates many important applications

Corporate Office: ZEBROS INDIA PVT LTD,

Abstract: An approach for filling-in blocks of missing data in wireless image

Corporate Office: ZEBROS INDIA PVT LTD,

Abstract: Contemporary workflow management systems are driven by explicit process

Abstract: As attackers use automated methods to inflict widespread damage on vulnerable

14. A Novel Secure Communication Protocol for Ad Hoc networks [SCP]

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

Abstract: This paper presents a steganography method using lossy

Abstract: This article chronicles the development of an artificial neural network

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

Homogenous Network of Workstations (HNOW systems) comprises of similar kinds of

Abstract: The current project is divided into four inter-dependent phases.

Corporate Office: ZEBROS INDIA PVT LTD,

Abstract: Multicast routing is an effective way to communicate among multiple hosts in a

Corporate Office: ZEBROS INDIA PVT LTD,

28. Mobile Agents In Distributed Multimedia Database Systems

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

Corporate Office: ZEBROS INDIA PVT LTD,

You might also like