mobile computing projects,mobile comp/uting projects in java, mobile computing projects in...

TTA

FINAL YEAR PROJECTS TITLES

WITH ABSTRACT

IEEE 2011, 2010, 2009, 2008 , etc…

Projects for B.E/B.Tech/M.E/Bsc/Msc

For complete base paper, call now and talk

to our expert

89397 22135 | 89397 22145 | 044 4218 1385

TTA Final year projects by IT professionals

For base paper and detailed discussion, call 89397 22135 |

89397 22145 | 044 4218 1385 Web: www.talhunt.co.in

JAVA - DOMAIN : MOBILE COMPUTING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

YJM01 Reliability Improvement

Using Receive Mode

Selection in the Device-

to-Device Uplink Period

Under laying Cellular

Networks

A new interference management scheme is

proposed to improve the reliability of

a device-to-device (D2D)

communication in the uplink (UL) period wit

hout reducing the power of cellular user

equipment (UE). To improve

the reliability of the D2D receiver, two

conventional receive techniques and one

proposed method are introduced. One

IEEE 2011

YJM02 Map-Based Location and

Tracking in Multipath

Outdoor Mobile Networks

Technical enhancements

of mobile technologies are paving the way to

the definition of high-quality and accurate

geolocation solutions based on data

collected and managed by

GSM/3G networks. We present a technique

that provides geolocation and mobility

prediction both at network and service level,

does not require any change to the

existing mobile network infrastructure, and i

s entirely performed on

the mobile network side

IEEE 2011

YJM03 Distributed lgorithms for

Environment Partitioning

in Mobile Robotic

Networks

A widely applied strategy for workload

sharing is to equalize the workload assigned

to each resource. In mobilemultiagent

systems, this principle directly leads to

equitable partitioning policies whereby: 1)

the environment is equitably divided into

subregions of equal measure; 2) one agent

is assigned to each subregion; and 3) each

agent is responsible for service requests

originating within its own subregion.

IEEE 2011

YJM04 Photo Retrieval based on

Spatial Layout with

Hardware Acceleration for

Mobile Devices

In this paper

new photo retrieval system for mobile device

s is proposed. The system can be used to

search for photos withsimilar spatial layouts

efficiently, and it adopts an image

segmentation algorithm that extracts

features of image regions based on K-Means

clustering. Since K-Means is computationally

intensive for real-time applications and

prone to generate clustering

IEEE 2011




results with local optima,

parallel hardware architectures are designed

to meet the real-time requirement of

the retrieval process.

YJM05 Hop-by-hop Routing in

Wireless Mesh Networks

with Bandwidth

Guarantees

Wireless Mesh Network (WMN) has become

an important edge network to provide

Internet access to remote areas

and wireless connections in a metropolitan

scale. In this paper, we study the problem of

identifying the maximum

available bandwidth path, a fundamental

issue in supporting quality-of-

service in WMNs

IEEE 2011

YJM06 Cooperating with

Smartness: Using

Heterogeneous Smart

Antennas in Multi-hop

Wireless Networks

The use of smart antennas in multi-

hop wireless networks (MWNs) has garnered

significant attention over the last few years.

While homogeneous MWNs with all nodes

having the same antenna capabilities will

have certain applications, we argue that

MWNs with nodes

having heterogeneous antenna capabilities

are more likely to be the norm due to a

variety of motivating factors.

IEEE 2011

YJM07 Local Greedy

Approximation for

Scheduling in Multi-hop

Wireless Networks

In recent years, there has been a significant

amount of work done in developing low-

complexity schedulingschemes to achieve

high performance in multi-

hop wireless networks. A centralized sub-

optimal schedulingpolicy,

called Greedy Maximal Scheduling (GMS) is

a good candidate because its empirically

observed performance is close to

optimal in a variety of network settings.

IEEE 2011

YJM08 Network Connectivity

with a Family of Group

Mobility Models

We investigate the communication

range of the nodes necessary

for network connectivity, which we call bi-

directional connectivity, in a simple setting.

Unlike in most of existing studies, however,

the locations ormobilities of the nodes may

be correlated through group mobility: Nodes

are broken

into groups, with each groupcomprising the

same number of nodes, and lie on a unit

circle. The locations of the nodes in the

same group are not mutually independent,

but are instead conditionally independent

given the location of the group. We examine

the distribution of the smallest

communication

IEEE 2011




YJM09 Towards Reliable Data

Delivery for Highly

Dynamic Mobile Ad Hoc

Networks

This paper addresses the problem of

delivering data packets for highly dynamic m

obile ad hoc networks in areliable and timely

manner. Most existing ad hoc routing

protocols are susceptible to node mobility,

especially forlarge-scale networks. Driven by

this issue, we propose an efficient Position

based Opportunistic Routing protocol (POR)

which takes advantage of the stateless

property of geographic routing and the

broadcast nature of wireless medium.

IEEE 2011

YJM10 Local Broadcast

Algorithms in Wireless Ad

Hoc Networks: Reducing

the Number of

Transmissions

There are two main approaches, static and

dynamic, in broadcast algorithms in wireless

ad hoc networks. In thestatic

approach, local algorithms determine the sta

tus (forwarding/non-forwarding) of each

node proactively based on local topology

information and a globally known priority

function. In this paper, we first show

that localbroadcast algorithms based

on the static approach cannot achieve a

good approximation factor to the optimum

solution (an NP-hard problem).

IEEE 2011

YJM11 A Privacy-Preserving

Location Monitoring

System for Wireless

Sensor Networks

Monitoring personal locations with a potentia

lly untrusted server poses privacy threats to

the monitored individuals. To this end, we

propose a privacy-

preserving location monitoring system for wi

reless sensornetworks. In our system, we

design two in-

network location anonymization algorithms,

namely, resource and quality-aware

algorithms, that aim to enable the system to

provide high-

quality location monitoring services forsyste

m users,

while preserving personal location privacy

IEEE 2011

YJM12 Optimal Stochastic

Location Updates in

Mobile Ad Hoc Networks

We consider

the location service in a mobile ad-

hoc network (MANET), where each node

needs to maintain itslocation information by

1) frequently updating

its location information within its

neighboring region, which is called

neighborhood update (NU), and 2)

occasionally updating its location information

to certain

distributedlocation server in the network,

which is called location server update (LSU).

IEEE 2011




YJM13 Supporting Efficient and

Scalable Multicasting over

Mobile Ad Hoc Networks

Group communications are important

in Mobile Ad hoc Networks (MANETs).

Multicast is an efficient method for

implementing group communications.

However, it is challenging to

implement efficient and scalable multicast in

MANET due to the difficulty in group

membership management and multicast

packet forwarding over a dynamic topology.

We propose a novel Efficient Geographic

Multicast Protocol (EGMP).

IEEE 2011

JAVA - DOMAIN : KNOWLEDGE AND DATA ENGINEERING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

YJK01 Motion Segmentation

using the Hadamard

Product and Spectral

Clustering

Group communications are important

in Mobile Ad hoc Networks (MANETs).

Multicast is an efficient method for

implementing group communications.

However, it is challenging to

implement efficient and scalable multicas

t in MANET due to the difficulty in group

membership management and multicast

packet forwarding over a dynamic

topology

IEEE 2011

YJK02 A Unified Probabilistic

Framework for Name

Disambiguation in Digital

Library

In this paper, we formalize the

problem in a unified probabilisticframewo

rk, which incorporates both attributes

and relationships. Specifically, we

define a disambiguationobjective

function for the problem and

propose a two-step parameter estimation

algorithm. We also investigate adynamic

approach for estimating the number of

people K.

IEEE 2011

YJK03 Improving Aggregate

Recommendation

Diversity

Using Ranking-Based

Techniques

In this paper, we introduce and explore a

number of item ranking techniques that

can generate recommendations that

have substantially

higher aggregate diversity across all

users while maintaining comparable

levels of recommendation accuracy.

Comprehensive empirical evaluation

consistently shows the diversity gains of

IEEE 2011




the proposed techniques using several

real-world rating datasets and different

rating prediction algorithms.

YJK04 Publishing Search Logs –

A Comparative Study of

Privacy Guarantees

In this paper we analyze algorithms

for publishing frequent keywords, queries

and clicks of a search log. We first show

how methods that achieve variants of k-

anonymity are vulnerable to active

attacks. We then demonstrate that the

stronger guarantee ensured by epsilon-

differential privacy unfortunately does

not provide any utility for this problem.

We then propose a novel algorithm

ZEALOUS and show how to set its

parameters to achieve (epsilon, delta)-

probabilistic privacy.

IEEE 2011

YJK05 Cluster Oriented

Ensemble Classifier:

Impact of Multi-cluster

Characterization on

Ensemble Classifier

Learning.

This paper presents a

novel cluster oriented ensemble classifier

. The proposed ensemble classifier is

based onoriginal concepts such

as learning of cluster boundaries by the

base classifiers and

mapping of clusterconfidences to class

decision using a fusion classifier. The

categorised data set is characterised into

multipleclusters and fed to a

number of distinctive base classifiers.

IEEE 2011

YJK06 Visual Role Mining: A

Picture Is Worth a

Thousand Roles

This paper offers a new role engineering

approach to Role-Based Access Control

(RBAC), referred to as visualrole mining.

The key idea is to graphically represent

user-permission assignments to enable

quick analysis and elicitation of

meaningful roles. First, we formally

define the problem by

introducing a metric for the quality of the

visualization.

IEEE 2011

YJK07 A Knowledge-Driven

Approach to Activity

Recognition in Smart

Homes

This paper introduces a knowledge-

driven approach to real-time,

continuous activity recognition based on

multi-sensor data

streams in smart homes.

The approach goes beyond the

traditional data-centric methods

for activityrecognition in three ways.

Firstly, it makes extensive use of

domain knowledge in the lifecycle

of activityrecognition. Secondly, it uses

IEEE 2011




ontologies for explicit context

and activity modeling and

representation. Thirdly and finally, it

exploits semantic reasoning and

classification for activity inferencing, thus

enabling both coarse-grained and fine-

grained activity recognition.

YJK08 Finding Top-k Answers in

Keyword Search over

Relational Databases

Using Tuple Units

in this paper, we study how to integrate

multiple related tuple units to

effectively answerkeyword queries. To

achieve a high performance, we devise

two novel indexes, single-keyword-based

structure-aware index and keyword-pair-

based structure-aware index, and

incorporate structural relationships

between different tuple units into the

indexes. We use the indexes to efficiently

identify the answers of

integrated tupleunits.

IEEE 2011

YJK09 Efficient Iceberg Query

Evaluation using

Compressed Bitmap Index

In this paper, we exploited the

property of bitmap index and

developed a very

effective bitmappruning strategy

for processing iceberg queries.

Our index-pruning based

approach eliminates the need of

scanning and processing the

entire data set (table) and thus

speeds up

the iceberg query processing

significantly. Experiments show

that our approach is much

more efficient than existing

algorithms commonly used in

row-oriented and column-oriented

databases

IEEE 2011

YJK10 Improving Security and

Efficiency in Attribute-

Based Data Sharing

in this study, we propose a novel CP-ABE

scheme for a data sharing system by

exploiting the characteristic of the

system architecture. The proposed

scheme features the following

achievements: (1) the key escrow

problem could be solved by escrow-free

key issuing protocol, (2) fine-grained

user revocation per each attribute could

IEEE 2011




be done by proxy encryption which takes

advantage of the

selective attribute group key distribution

on top of the ABE.

YJK11 Clustering with Multi-

Viewpoint based

Similarity Measure

In this paper, we introduce a

novel multi-

viewpoint based similarity measure and

two related clustering methods. The

major difference between a traditional

dissimilarity/similarity measure and ours

is that the former uses only a

single viewpoint, which is the origin,

while the latter utilizes many different

viewpoints, which are objects assumed

to not be in the same cluster with the

two objects being measured. Using

multiple viewpoints, more informative

assessment of similarity could be

achieved.

IEEE 2011

YJK12 Manifold Adaptive

Experimental Design for

Text Categorization

In this paper, we propose a novel active

learning algorithm which is performed in

the data manifold adaptive kernel space.

The manifold structure is incorporated

into the kernel space by using graph

Laplacian. This way,

the manifold adaptive kernel space

reflects the underlying geometry of the

data.

IEEE 2011

YJK13 Multi-resolution Web link

analysis using generalised

link relations

In this paper, we generalize the

multiresolution popularity analysis to use

any form of Web page link relations. We

provide results for both the

PageRank relations and the In-

degree relations. By utilizing the

multiresolution popularity lists, we

achieve a 13 percent and 25 percent

improvement in mean average precision

over In-degree and PageRank,

respectively.

IEEE 2011

YJK14 Distributed Processing of

Probabilistic Top-k

Queries in Wireless

Sensor Networks

In this paper, we introduce the

notion of sufficient set and necessary set

for distributed processing ofprobabilistic t

op-k queries in cluster-

based wireless sensor networks. These

two concepts have very nice properties

that can facilitate localized data

pruning in clusters. Accordingly, we

develop a suite of algorithms, namely,

sufficient set-based (SSB), necessary

IEEE 2011




set-based (NSB) and boundary-based

(BB), for inter-

cluster queryprocessing with bounded

rounds of communications.

YJK15 Cost-aware rank join with

random and sorted access

We address the problem of joining

ranked results produced by two or more

services on the Web. We consider

services endowed with two kinds

of access that are often available:

i) sorted access, which returns

tuplessorted by score; ii) random access,

which returns tuples matching a

given join attribute

value. Rank joinoperators combine

objects of multiple relations and output

the K combinations with the highest

aggregate score.

IEEE 2011

YJK16 Joint Top-K Spatial

Keyword Query

Processing

Web users and content are increasingly

being geo-positioned, and increased

focus is being given to serving local

content in response to web queries. This

development calls

for spatial keyword queries that take into

account both the locations and textual

descriptions of content. We study the

efficient, joint processing of multiple top-

kspatial keyword queries.

Such joint processing is attractive during

high query loads and also occurs when

multiplequeries are used to obfuscate a

user's true query.

IEEE 2011

YJK17 Adaptive Provisioning of

Human Expertise

in Service-oriented

Systems

IEEE 2011

YJK18 Improving Aggregate

Recommendation

Diversity Using Ranking-

Based Techniques

In this paper, we introduce and explore a

number of item ranking techniques that

can generate recommendations that

have substantially

higher aggregate diversity across all

users while maintaining comparable

levels of recommendation accuracy.

Comprehensive empirical evaluation

consistently shows the diversity gains of

the proposed techniques using several

real-world rating datasets and different

rating prediction algorithms.

IEEE 2011

YJK19 Publishing Search Logs –

A Comparative Study of

In this paper we analyze algorithms

for publishing frequent keywords, queries

IEEE 2011




Privacy Guarantees and clicks of a search log. We first show

how methods that achieve variants of k-

anonymity are vulnerable to active

attacks. We then demonstrate that the

stronger guarantee ensured by epsilon-

differential privacy unfortunately does

not provide any utility for this problem.

YJK20 A Link-Analysis Extension

of Correspondence

Analysis for Mining


This work

introduces a link analysis procedure for d

iscovering relationships

in a relational database or a graph,

generalizing both simple and

multiple correspondence analysis. It is

based on a random walk model through

thedatabase defining a Markov chain

having as many states as elements in

the database. Suppose we are interested

in analyzing the relationships between

some elements (or records) contained in

two different

tables ofthe relational database

IEEE 2011

YJK21 Adaptive Cluster Distance

Bounding for High

Dimensional Indexing

We consider approaches for similarity

search in correlated, high-

dimensional data sets, which are derived

within a clustering framework. We note

that indexing by “vector approximation”

(VA-File), which was proposed as a

technique to combat the “Curse of

Dimensionality,” employs scalar

quantization, and hence necessarily

ignores dependencies across dimensions,

which represents a source of

suboptimality.

IEEE 2011

YJK22 Discovering Conditional

Functional Dependencies

In this paper, we present the BioNav

system, a novel search interface that

enables the user to navigate large

number of query results by organizing

them using the MeSH concept hierarchy.

First, the query results are organized into

a navigation tree. At each node

expansion step, BioNav reveals only a

small subset of the concept nodes,

selected such that the expected

user navigationcost is minimized.

IEEE 2011

YJK23 Effective Navigation of

Query Results Based on

Concept Hierarchies

In this paper, we propose a novel

algorithm, called Semisupervised Semi-

RiemannianMetric Map (S3RMM),

following the geometric framework

of semi Riemannian manifolds. S3RMM

IEEE 2011




maximizes the discrepancy of the

separability and similarity measures of

scatters formulated by using semi-

Riemannian metric tensors.

YJK24 Learning Semi-

Riemannian Metrics for

Semi supervised Feature

Extraction


algorithm, called Semisupervised Semi-

RiemannianMetric Map (S3RMM),

following the geometric framework

of semi Riemannian manifolds. S3RMM

maximizes the discrepancy of the

separability and similarity measures of

scatters formulated by using semi-

Riemannian metric tensors. The metric

tensor of each sample is learned via

semisupervised regression

IEEE 2011

YJK25 Load Shedding in Mobile

Systems with Mobi Qual

IEEE 2011

YJK26 Ranking Spatial Data by

Quality Preferences

A spatial preference query ranks objects

based on the qualities of features in

their spatial neighborhood. For example,

using a real estate agency database of

flats for lease, a customer may want to

rank the flats with respect to the

appropriateness of their location, defined

after aggregating the qualities of other

features (e.g., restaurants, cafes,

hospital, market, etc.) within

their spatial neighborhood. Such a

neighborhood concept can be

specified by the user via different

functions

IEEE 2011

DOMAIN : NETWORK SECURITY

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

YJS01 Secret Key Agreement

from Vector Gaussian

Sources by Rate Limited

Public Communication

We investigate

the secret key agreement from correlate

d vector Gaussian sources in which

legitimate parties can

use public communication with limited ra

te. For the class of protocols with one-

way public communication, we show that

IEEE 2011




the optimal trade-off between

the rate of key generation and

the rate of the publiccommunication is

characterized as an optimization problem

of a Gaussian random variable.

YJS02 Detecting Recompression

of JPEG Images via

Periodicity Analysis of

Compression Artifacts for

Tampering Detection

In this paper, we present a new

technique to discover traces caused

by recompression. We assume all

source images are in JPEG format and

propose to formulate the periodic

characteristics of JPEG images both in

spatial and transform domains. Using

theoretical analysis, we design a

robust detection approach which is able

to detect either block-aligned or

misaligned recompression.

IEEE 2011

YJS03 Privacy-Preserving ECG

Classification With

Branching Programs and

Neural Networks

The paper deals with all the

requirements anddifficulties related to

working with data that must stay

encrypted during all the computation

steps, including the necessity of

working with fixed point

arithmetic with no truncation while

guaranteeing the same performance of a

floating point implementation in the plain

domain.

IEEE 2011

YJS04 Restoring Degraded Face

Images: A Case Study in

Matching Faxed, Printed,

and Scanned Photos

The purpose of this paper is to illustrate

the complexity

of face recognition in such realistic

scenarios and to provide a viable solution

to it. The contributions of this work are

two-fold. First, a database

of face images is assembled and used to

illustrate the challenges associated

with matching severely degraded face im

ages. Second, a preprocessing scheme

with low computational complexity is

developed in order to eliminate the noise

present in degraded images and restore

their quality.

IEEE 2011

YJS05 Keys Through ARQ:

Theory and Practice

This paper develops a novel framework

for sharing secret keys using the

Automatic Repeat reQuest (ARQ)

protocol. We first characterize the

underlying information theoretic limits,

under different assumptions on the

channel spatial and temporal correlation

function. Our analysis reveals a novel

role of “dumb antennas” in overcoming

IEEE 2011




the negative impact of spatial correlation

on the achievable secrecy rates.

YJS06 Digital Image

Authentication From JPEG

Headers

It is often desirable to determine if

an image has been modified in any

way from its original recording.

The JPEGformat affords engineers many

implementation trade-offs which give rise

to widely varying JPEG headers. We

exploit these variations

for image authentication.

IEEE 2011

YJS07 A Message-Passing

Approach to Combating

Desynchronization Attacks

We propose a new paradigm for blind

watermark decoding in the presence

of desynchronization attacks. Employing

Forney-style factor graphs to model the

watermarking system, we cast the blind

watermark decoding problem

as a probabilistic inference problem

on a graph, and solve it via message-

passing.

IEEE 2011

YJS08 Nonlinearity Estimation

for Specific Emitter

Identification in Multipath

Channels

We present a radio frequency (RF) front-

end nonlinearity estimator that is based

on the knowledge of a training sequence

to

perform specific emitter identification (SE

I), which discerns radio emitters of

interest. Design and fabrication

variations provide unique signal

signatures for each emitter, and we

extract those characteristics through

the estimation of

transmitter nonlinearity coefficients.

IEEE 2011

YJS09 Physical-Layer Secret Key

Agreement in Two-Way

Wireless Relaying

Systems

In thissystem, Alice and Bob

share secret keys generated from

measured radio propagation

characteristics with the help of the

relay in the presence of an

eavesdropper. We present

four secret key agreement schemes: an

amplify-and-forward (AF) scheme, a

signal-combining amplify-and-forward

(SC-AF) scheme, a multiple-access

amplify-and-forward (MA-AF) scheme,

and an amplify-and-forward with artificial

noise (AF with AN) scheme

IEEE 2011

YJS10 Secure Type-Based

Multiple Access

We consider data confidentiality in a

distributed detection scenario with

a type-based multiple-access (TBMA)

protocol where a large set of sensors

sends local measurements to an ally

IEEE 2011




fusion center (FC) over an insecure

wireless medium called the main

channel.

YJS11 Key Agreement Over

Multiple Access Channel

In this paper, a

generalized multiple access channel (MA

C) model for secret key sharing between

three terminals is considered. In this

model, there are two transmitters and a

receiver where all three terminals receive

noisychannel outputs.

IEEE 2011

YJS12 Strongly Secure

Communications Over the

Two-Way Wiretap

Channel

We consider the problem

of secure communications over the two-

way wiretap channel under a strong

secrecy criterion. We improve existing

results by developing an achievable

region based on strategies that exploit

boththe interference

at the eavesdropper's terminal and

cooperation between legitimate users.

IEEE 2011

YJS13 Using a Knowledge-Based

Approach to Remove

Blocking Artifacts in Skin

Images

for Forensic Analysis

In this paper, a knowledge-

based (KB) approach, which

simultaneouslyremoves JPEG blocking art

ifacts, and recovers skin features, is

proposed. Given a training set containing

both original and

compressed skin images, the relationship

between original blocks and compressed

blocks can be established. This prior

information is used to infer the original

blocks of compressed evidence images.

IEEE 2011

YJS14 Improved Differential

Fault Analysis

on AES Key Schedule

Differential Fault Analysis (DFA) finds

the key of a block cipher

using differential information between

correct and faulty ciphertexts obtained

by inducing faults during the

computation of ciphertexts. Among many

ciphers Advanced Encryption Standard

(AES) has been the main target of DFA

due to its popularity.

IEEE 2011

YJS15 Blind Forensics of Median

Filtering

in Digital Images

This paper proposes a novel approach for

detecting median filtering in digitalimage

s, which can 1) accurately

detect median filtering in arbitrary image

s, even reliably

detect median filteringin low-resolution

and JPEG compressed images; 2) reliably

detect tampering when part of a median-

filtered imageis inserted into a non-

median-filtered image, or vice versa.

IEEE 2011




YJS16 Improved Radiometric

Identification of

Wireless Devices using

MIMO Transmission

This paper experimentally

demonstratesimproved identification acc

uracy and reduced sensitivity

to identification parameters when such

techniques are applied to the multiple

transmitters within multiple-input

multiple-output devices. It further

studies an information theoretic

technique for determining

which radiometric features are most

effective in discriminating devices and

analyzes the identification performance

as a function of the number of features

used.

IEEE 2011

YJS17 Robust Image

Watermarking Based on

Multi scale Gradient

Direction Quantization

We propose a robust quantization-

based image watermarking scheme,

called

the gradient direction watermarking(GD

WM), based on the

uniform quantization of

the direction of gradient vectors. In

GDWM, the watermark bits are

embedded by quantizing the angles of

significant gradient vectors at multiple

wavelet scales.

IEEE 2011

DOMAIN : NETWORKING

CODE

PROJECT TITLE

REFERENCE

YJS01 Cluster-Based Back-Pressure

Routing Algorithm

the back-pressure algorithmrequires

routers to maintain a separate queue

for each destination, which precludes its

implementation in large-scale networks.

In this paper, we propose a

distributed cluster-based back-

pressure routing algorithm that retains

the adaptability of back-

pressure routing while significantly

reducing the number of queues that

have to be maintained at each node.

IEEE 2011

YJS02 Impact of Correlated Mobility on

Delay-Throughput

Performance in Mobile Ad-Hoc

Networks

We extend the analysis of the scaling

laws of wireless ad hoc networks to the

case of correlated nodes movements,

which are commonly

found in real mobility processes. We

IEEE 2011




consider a simple version of the

Reference Point

Group Mobility model, in which nodes

belonging to the same group are

constrained to lie in a disc area, whose

center moves uniformly across

the network

YJS03 On the Price of Security in

Large-Scale Wireless Ad Hoc

Networks

In this paper, based on a general

random network model, theasymptotic

behaviors of secure throughput and

delay with the common transmission

range rn and the probability

pf of neighboring nodes having a

primary security association are

quantified when the network size n is

sufficiently large. The costs and

benefits of secure-link-augmentation

operations on the secure throughput

and delay are also analyzed.

IEEE 2011

YJS04 Cross-Layer Designs in Coded

Wireless Fading

Networks With Multicast

A cross-layer design along with an

optimal resource allocation framework is

formulated for wireless fadingnetworks,

where the nodes are allowed to

perform network coding. The aim is to

jointly optimize end-to-end transport-

layer rates, network code design variabl

es, broadcast link flows, link capacities,

average power consumption, and short-

term power allocation policies.

IEEE 2011

YJS05 Link-State Routing With Hop-

by-Hop Forwarding Can Achieve

Optimal Traffic Engineering

This paper settles an open

question with a positive

answer: Optimal traffic engineering (or

optimalmulticommodity flow) can be

realized using just link-

state routing protocols with hop-by-

hop forwarding. Today's typical versions

of these protocols, Open Shortest Path

First (OSPF) and Intermediate System-

Intermediate System (IS-IS),

split traffic evenly over shortest paths

based on link weights.

IEEE 2011

YJS06 Stability and Benefits of Network utility maximization has been IEEE 2011




Suboptimal Utility Maximization widely used to model resource

allocation and network architectures.

However, in practice, often it cannot be

solved optimally due to complexity

reasons. Thus motivated, we address

the following two questions in this

paper: 1)

Can suboptimal utility maximization mai

ntain queue stability? 2) Can

underoptimization of utility objective

function in fact benefit other network

design objectives?

YJS07 A New Estimation Scheme for

the Effective Number

of Users in Internet Congestion

Control

Many congestion control protocols have

been recently proposed in order to

alleviate the problems encountered by

TCP in high-speed networks and

wireless links. Protocols utilizing an

architecture that is in the same spirit

asthe ABR service in ATM networks

require

estimates of the effective number of use

rs utilizing each link in thenetwork to

maintain

stability in the presence of delays. In thi

s paper, we

propose a novel estimation algorithm

that is based on online parameter

identification techniques and is shown

through analysis and simulations to

converge

to the effective number of users utilizing

each link

IEEE 2011

YJS08 Multichannel Scheduling and

Spanning Trees: Throughput–

Delay Tradeoff for Fast

DataCollection in Sensor

Networks

In this paper, we utilize multiple

frequency channels and design an

efficient link scheduling protocol that

gives a constant factor approximation

on the optimal throughput in delivering

aggregated data from all the nodes to

the sink. To minimize the

maximum delay subject to a

given throughput bound, we also design

an $(alpha, beta)$-bicriteria

approximation algorithm to construct a

Bounded-Degree Minimum-

Radius Spanning Tree, with the radius

of thetree at most $beta$ times the

minimum possible radius for a given

degree bound $Delta^*$, and the

IEEE 2011




degree of any node at most $Delta^* +

alpha$ , where $alpha$ and $beta$ are

positive constants.

YJS09 DAC: Generic and Automatic

Address Configuration for Data

Center Networks

In this paper, we present DAC,

a generic andautomatic Data center Add

ress Configuration system. With an

automatically generated blueprint that

defines the connections of

servers and switches labeled by logical

IDs, e.g., IP addresses, DAC first learns

the physical topology labeled by device

IDs, e.g., MAC addresses.

IEEE 2011

YJS10 Distributed -Optimal User

Association and Cell Load

Balancing in Wireless Networks

In this paper, we develop a framework

for user association in infrastructure-

based wireless networks, specifically

focused on flow-

level cell load balancing under spatially

inhomogeneous traffic distributions. Our

work encompasses several

different user association policies: rate-

optimal, throughput-optimal, delay-

optimal, andload-equalizing, which we

collectively denote $alpha$-

optimal user association.

IEEE 2011

YJS11 MeasuRouting: A Framework for

Routing Assisted Traffic

Monitoring

Monitoring transit traffic at one or more

points in a network is of interest to

network operators for reasons

oftraffic accounting, debugging or

troubleshooting, forensics,

and traffic engineering. Previous

research in the area has focused on

deriving a placement of monitors across

the network toward the end of

maximizing the monitoringutility of the

network

operator for a given traffic routing.

However, both traffic characteristics and

measurement objectives can

dynamically change over time,

rendering a previously optimal

placement of monitors suboptimal.

IEEE 2011

YJS12 Automatic Generation of

Assertions from System Level

Design Using Data Mining

System level modeling is widely

employed at early

stages of system development for

IEEE 2011




simplifying designverification and

architectural

exploration. Assertion based verification

has become a well established

part of RTL verification methodology. In

the traditional assertion based

verification flow, assertions are

manually written. In this paper, we

generate assertions from system level d

esigns using GoldMine,

an automatic assertion generationengin

e that uses data mining and static

analysis.

YJS13 Spatial Correlation and Mobility-

Aware Traffic Modeling for

Wireless Sensor Networks

In this paper, a

novel trafficmodeling scheme for capturi

ng these dynamics is proposed that

takes into account the statistical

patterns of

node mobility and spatial correlation.

The contributions made in this paper are

twofold. First, it is shown that the joint

effects

of mobility and spatial correlation can

lead to bursty traffic. More specifically,

high mobilityvariance and small spatial c

orrelation can give rise to pseudo-long-

range-dependent (LRD) traffic (high

burstytraffic), whose autocorrelation

function decays

slowly and hyperbolically up to a certain

cutoff time lag.

IEEE 2011

YJS14 Jamming-Aware Traffic

Allocation for Multiple-Path

Routing Using Portfolio

Selection

Multiple-path source routing protocols

allow a data source node to distribute

the total traffic among available paths.

In this paper, we consider the problem

of jamming-aware source routing in

which the source node

performs traffic allocation based on

empirical jamming statistics at

individual network nodes. We formulate

thistraffic allocation as a lossy network

flow optimization

problem using portfolio selection theory

from financial statistics.

IEEE 2011

YJS15 A Unified Approach to

Optimizing Performance in

Networks serving

In this work, we develop the

mathematical framework and novel

design methodologies needed to support

IEEE 2011




Heterogeneous Flows such heterogeneous requirements and

propose provably

optimal network algorithms that account

for the multilevel interactions between

the flows. To that end, we first

formulate a network optimization

problem that incorporates the above

throughput and service prioritization

requirements of the two traffic types.

We, then develop a distributed joint

load-balancing and congestion control

algorithm that achieves the dual goal of

maximizing the aggregate utility gained

by the elastic flows while satisfying the

fixed throughput and prioritization

requirements of the inelastic flows

YJS16 Delay Analysis and Optimality

of Scheduling Policies for

Multi-Hop Wireless Networks

This paper focuses on

designing and analyzing throughput-

optimal scheduling policies that avoid

using per-flow or per-destination

information, maintain a single data

queue for each link, exploit only local

information, andpotentially improve

the delay performance, for multi-

hop wireless networks under general

interference constraints

IEEE 2011

YJS17 Selfish Overlay Network

Creation and Maintenance

In this paper, we unify the

aforementioned thrusts by

defining and studying

the selfish neighbor selection (SNS)

game and its application

to overlay routing. At the heart of SNS

stands the restriction that peers are

allowed up to a certain number of

neighbors. This makes SNS substantially

different from existingnetwork formation

games that impose no bounds on peer

degrees. Having bounded degrees has

important practical consequences as it

permits

the creation of overlay structures that

require $O(n)$ instead of $O(n^2)$link

monitoring overhead.

IEEE 2011




DOMAIN : PARALLEL DISTRIBUTION

CODE

PROJECT TITLE

REFERENCE

YJP01 EBRP: Energy-Balanced

Routing Protocol for Data

Gathering in Wireless Sensor

Networks

n this paper, enlightened by the

concept of potential in common

physics, we design an Energy-

Balanced Routing Protocol (EBRP) by

constructing a mixed virtual potential

field, including depth, energy density

and residual energy to force packets to

move towards the sink through the

dense energy area so as to protect the

nodes with relatively low

residual energy. The design principle

and guidelines are presented in detail.

IEEE 2011

YJP02 Effective Delay-Controlled

Load Distribution over

Multipath Networks

This paper proposes a

new load distribution model aiming to

minimize the difference among end-to-

end delays, thereby reducing

packet delay variation and risk of

packet reordering without

additional network overhead. In

general, the lower the risk of packet

reordering, the smaller

the delay induced by the packet

reordering recovery process, i.e.,

extra delay induced by the packet

reordering recovery process is

expected to decrease.

IEEE 2011

YJP03 Tracking Dynamic Boundaries

using Sensor Network

We examine the problem

of tracking dynamic boundaries occurri

ng in natural

phenomena using a network of

range sensors. Two main challenges of

the boundary tracking problem are

accurate boundary estimation from

noisy observations and

continuous tracking of the boundary.

We

propose Dynamic Boundary Tracking (

DBTR), an algorithm that combines the

spatial estimation and temporal

IEEE 2011




estimation techniques.

YJP04 CACAO: Distributed Client-

Assisted Channel Assignment

Optimizationfor

Uncoordinated WLANs

In CACAO, the clients feed back traffic

information to their APs. This leads to

better network condition knowledge

and

betterchannel assignment decisions at

the APs. We conduct extensive

simulation study and comparisons

using Network Simulator 2 (NS2). Our

results show that CACAO outperforms

other traditional and recent schemes in

terms of TCP and UDP throughputs

with a similar level of fairness.

IEEE 2011

YJP05 Athanasia: A User-

Transparent and Fault-

Tolerant System

for Parallel Applications

This article presents Athanasia, a user-

transparent and fault-

tolerant system, for parallel application

s running on large-scale

cluster systems. Cluster systems have

been regarded as a de facto standard

to achieve multitera-flop computing

power. These cluster systems, as we

know, have an inherent failure factor

that can cause computation failure. The

reliability issue

in parallel computing systems,

therefore, has been

studied for arelatively long time in the

literature, and we have seen many

theoretical promises arise from the

extensive research.

IEEE 2011

YJP06 BECAN: A Bandwidth-Efficient

Cooperative Authentication

Scheme for Filtering Injected

False Data in Wireless Sensor

Networks

Inthis paper, we

propose a novel bandwidth-

efficient cooperative authentication (BE

CAN) scheme for filteringinjected false

data. Based on the random graph

characteristics of sensor node

deployment and the cooperativebit-

compressed authentication technique,

the proposed BECAN scheme can save

energy by early detecting

andfiltering the majority

of injected false data with minor extra

overheads at the en-route nodes.

IEEE 2011




YJP07 Delay Constrained Subtree

Homeomorphism Problem

with Applications

Virtual world and other

collaborative applications are

increasingly becoming popular among

Internet users. In such applications,

users interact with each other through

digital entities or avatars. In order to

preserve the user experience, it is

important that certain Quality of

Service (QoS) requirements

(e.g. delay, bandwidth) are satisfied by

the interactions. These QoS

requirements are usually defined by

the application designer.

Whenapplications with such QoS

requirements are being deployed on a

network of servers, an appropriate set

of servers capable of satisfying the QoS

constraints of the interactions must be

identified.

IEEE 2011

YJP08 Efficient communication

algorithms in hexagonal

mesh interconnection

networks

In this article we show

the hexagonal mesh networks develope

d in the early 1990s are a special case

of the EJnetworks that have been

considered more recently. Using a node

addressing scheme based on the EJ

number system, we give a shortest

path

routing algorithm for hexagonal mesh n

etworks.

IEEE 2011

YJP09 An Efficient Prediction-based

Routing in Disruption-

Tolerant Networks

This paper proposes predict and relay

(PER), an efficient routing algorithm for

DTNs, where nodes determine the

probability distribution of future contact

times and choose a proper next-

hop in order to improve the end-to-end

delivery probability. The algorithm

is based on two observations: one is

that nodes usually move around a set

of well-visited landmark points instead

of moving randomly; the other is that

node mobility behavior is semi-

deterministic and could be predicted

once there is sufficient mobility history

information.

IEEE 2011

YJP10 Bounding the Impact of Self-stabilization is a versatile approach IEEE 2011




Unbounded Attacks

in Stabilization

to fault-tolerance since it permits a

distributed system to recover from any

transient fault that arbitrarily

corrupts the contents of all

memories in the system. Byzantine

tolerance is an attractive

feature of distributed systems that

permits to cope with arbitrary

malicious behaviors. Combining these

two properties proved difficult: it is

impossible to

contain the spatial impact of Byzantine

nodes in a self-stabilizing context for

global tasks such as tree orientation

and tree construction.

YJP11 Stability Analysis of

Reservation-Based

Scheduling Policies in

Wireless Networks

In this paper, we propose a policy that

allows links to transmit data in any

future frame by means of frame

reservations. The new, reservation-

based distributed scheduling approach

will improve the capacity of the system

and provide greater throughput.

IEEE 2011

YJP12 Fast Secure Communications

in Shared Memory

Multiprocessor Systems

This paper proposes three

authentication schemes to remove

those security vulnerabilities. First, we

prevent replay attacks on data

messages by inserting Request Counter

(RC) into request messages. Second,

we also use RC to detect integrity

attacks on control messages. Third, we

propose a new counter, referred to as

GCC Counter (GC), to protect the

global counter messages. We simulated

our design with SPLASH-2 benchmarks

on up to 16-

processor sharedmemory multiprocess

or systems by using Simics with

Wisconsin multifacet General

Execution-

drivenMultiprocessor Simulator

(GEMS).

IEEE 2011




DOMAIN : IMAGE PROCESSING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

YJI01 A Generalized Accelerated

Proximal Gradient Approach

for Total Variation-Based

Image Restoration

This paper

proposes a generalized accelerated

proximal gradient (GAPG) approach

for solving total variation(TV)-

based image restoration problems.

The GAPG algorithm generalizes the

original APG algorithm by replacing

the Lipschitz constant with an

appropriate positive-definite matrix,

resulting in faster

convergence. For TV-

basedimage restoration problems,

we further introduce two auxiliary

variables that approximate the

partial derivatives. Constraints on

the variables can easily be imposed

without modifying the algorithm

much, and the TV regularization

can be either isotropic or

anisotropic.

IEEE 2011

YJI02 Residues Cluster Based

Segmentation and Outlier-

Detection Method for Large-

Scale Phase Unwrapping

In this paper,

the phase unwrappingproblem is

abstracted as solving a large-

scale system of inconsistent linear

equations. With the difficulties

oflarge-

scale phase unwrapping analyzed, L0-norm criterion is found to have

potentials in efficient image

tiling andsplicing. Making use of the

clustering characteristic

of residue distribution, a tiling

strategy is proposed for L0-norm

criterion. Unfortunately, L0-norm is

an NP-hard problem, which is very

difficult to find an exact solution in

a polynomial time.

IEEE 2011

YJI03 An a priori shading correction

technique for contact imaging

devices

Digital imaging devices are increasingly

used for color measurements in fields

such as forensics, the food industry,

and ecological and medical research.

Especially concerning the skin, in the

follow-up of benign or malignant

IEEE 2011




lesions, it is crucial to ensure that the

measured colors are accurate and

reproducible. Several color calibration

methods having been presented over

the last few years

YJI04 Spread Spectrum Image

Watermarking Based on

Perceptual Quality Metric

Efficient image watermark calls for

full exploitation of

the perceptual distortion constraint.

Second-order statistics of visual

stimuli are regarded as critical

features for perception. This paper

proposes a second-order statistics

(SOS) based image quality metric,

which considers the texture

masking effect and the contrast

sensitivity in Karhunen-Loève

transform domain.

IEEE 2011

YJI05 Memory-Efficient Architecture

for Hysteresis Thresholding

and Object Feature Extraction

Hysteresis thresholding is a method

that offers

enhanced object detection. Due to

its recursive nature, it is time

consuming and requires a lot

of memory resources. This makes it

avoided in streaming processors

with limitedmemory. We propose

two versions of a memory-

efficient and fast architecture for hy

steresis thresholding: a high-

accuracy pixel-

based architecture and a faster

block-based one at the expense of

some loss in the accuracy.

IEEE 2011

YJI06 Generalized Random Walks

for Fusion of Multi-Exposure

Images


probabilistic model-

based fusion technique for multi-

exposure images. Unlike

previousmulti-

exposure fusion methods, our

method aims to achieve an optimal

balance between two quality

measures, i.e., local contrast and

color consistency, while combining

the scene details revealed under

different exposures.

IEEE 2011

YJI07 Edge Strength Filter Based

Color Filter Array

We propose an orientation-

free edge strength lter and apply it

IEEE 2011




Interpolation to the demosaicing

problem. Edge strength lter output

is utilized both to improve the initial

green channel interpolation and to

apply the constant color dierence

rule adaptively. This

simple edge directed method yields

visually pleasing results with high

CPSNR.

YJI08 Towards a Unified Color

Space for Perception-Based

Image Processing

mage processing methods that

utilize characteristics of the human

visual system

require color spaces with certain

properties to operate effectively.

After analyzing different types

of perception-

based image processingproblems,

we present a list of

properties a unified color space sho

uld have. Due to contradictory

perceptual phenomena and

geometric

issues a color space cannot

incorporate all these properties.

IEEE 2011

YJI09 Model-guided Adaptive

Recovery of Compressive

Sensing

In compressive sensing (CS) a

challenge is to find a space in which

the signal is sparse and hence

recoverable faithfully. Since many

natural signals such as images have

locally varying statistics, the sparse

space varies in time/spatial domain. As

such, CS recovery should be conducted

in locally adaptive, signal-dependent

spaces to counter the fact that the CS

measurements are global and

irrespective of signal structures

IEEE 2011

DOMAIN : MOBILE COMPUTING

CODE

PROJECT TITLE

REFERENCE

YDM01 Providing Secure Integrity in

Peer-to-peer Oriented Mobile

Environments

IEEE

YDM02 RAM: Rate Adaptation in

Mobile Environments

IIEEE




YDM03 Robust Relative Location

Estimation in Wireless Sensor

Networks with Inexact

Position Problems

IEEE

YDM04 On the Cost of Knowledge of

Mobility in

Dynamic Networks: An

Information-Theoretic

Approach

IEEE

YDM05 A Novel MAC Scheme for

Multi-Channel Cognitive Radio

Ad Hoc Networks

IEEE

YDM06 Efficient Virtual Backbone

Construction with Routing

Cost Constraint in Wireless

Networks using Directional

Antennas

IEEE

YDM07 Color Based Fruits

Classification Using GPU

IIEEE

YDM08 Wireless Multicast

Optimization : A Cross-Layer

Approach

IEEE

YDM09 Web Content Recommender

System based on Consumer

Behavior Modeling

IEEE

YDM10 STORM: A Framework for

Integrated Routing,

Scheduling and Traffic

Management in Ad Hoc

Networks

IEEE

YDM11 Throughput Optimization in

Mobile Backbone Networks

IEEE

DOMAIN : KNOWLEDGE AND DATA ENGINEERING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

YDK01 Motion Segmentation in the

Presence of Outlying,

Incomplete, or Corrupted

Trajectories

IEEE

YDK02 Segmentation and Sampling

of Moving Object

Trajectories based on

Representativeness

IIEEE

YDK03 A Query Formulation

Language for the Data Web

IEEE

YDK04 Optimizing Multiway Joins in IEEE




a Map-Reduce Environment

YDK05 A Survey on Graphical

Methods for

Classification Predictive

Performance Evaluation

IEEE

YDK06 Efficient and Accurate

Discovery of Patterns in

Sequence Data Sets

IEEE

YDK07 Energy Efficient Schemes for

Accuracy-Guaranteed

Sensor Data Aggregation

using Scalable Counting

IIEEE

YDK08 Optimizing the Calculation of

Conditional Probability Tables

in Hybrid BayesianNetworks

using Binary Factorization

IEEE

YDK09 A performance anomaly

detection and analysis

framework for DBMS

development

IEEE

YDK10 Increasing retrieval quality in

conversational

recommenders

IEEE

YDK11 Optimizing Multiway Joins in

a Map-Reduce

Environment

IEEE

YDK12 Coupled Behavior Analysis

with Applications

IEEE

YDK13 Cascading spatio-temporal

pattern discovery

IEEE

YDK14 Mining Order-Preserving

Submatrices from Data with

Repeated Measurements

IIEEE

YDK15 Network Similarity

Decomposition (NSD): A Fast

and Scalable Approach to

NetworkAlignment

IEEE

YDK16 Data Integrity Proofs in Cloud

Storage

IEEE

YDK17 Efficient Computation of

Range Aggregates

against Uncertain Location

Based Queries

IEEE

YDK18 Exploring Application-Level

Semantics for Data

Compression

IEEE

YDK19 Monitoring Service Systems

from a Language-Action

Perspective

IEEE




YDK20 One Size Does Not Fit All:

Towards User- and Query-

Dependent Ranking For Web

Databases

IEEE

YDK21 Optimal service pricing for a

cloud cache

IIEEE

YDK22 A Personalized Ontology

Model for Web Information

Gathering

IEEE

YDK23 Scalable Learning of

Collective Behavior

IEEE

YDK24 The World in a Nutshell:

Concise Range Queries

IIEEE

YDK25 Decision Trees for Uncertain

Data

IEEE

YDK26 The CoQUOS Approach to

Continuous Queries in

Unstructured Overlays

IEEE

DOMAIN : MOBILE COMPUTING(j)

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SJM01 Continuous Monitoring

of Spatial Queries in

Wireless Broadcast

IEEE-2009

SJM02 Energy Maps For

Mobile Wireless

networks coherence

Time Versues

Spreding Period

IEEE-2009

SJM03 Energy-Efficient SINR-

Based Routing for

Multihop Wireless

IEEE-2009

SJM04 Mitigation of Control

Channel Jamming

Under Node Capture

Attacks

IEEE-2009

SJM05 Mobility Management IEEE-2009




Approaches for Mobile

IP Networks

SJM06 SIMPS Using

Sociology for Personal

Mobility

IEEE-2009

SJM07 Intrusion Detection in

Homogeneous and

Heterogeneous

Wireless Sensor

Networks

IEEE-2008

SJM08 Bandwidth Estimation

for IEEE 802.11-

Based Ad Hoc

Networks

IEEE-2008

SJM09 Location Based

Spatial Query

Processing In Wireless

Broadcast

Environments

IEEE-2008

SJM10 Bandwidth Efficient

Video Multicasting in

Multiradio

Muilticellular Wireless

IEEE-2008

DOMAIN : NETWORK COMPUTING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SJN01 Measuring Capacity

Bandwidth of

Targeted Path

Segments

IEEE-2009

SJN02 Evaluating the

Vulnerability of

Network Traffic Using

Joint

IEEE-2009




SJN03 Capturing Router

Congestion and Delay

IEEE-2009

SJN04 Multiple Routing

Configurations for

Fast IP Network

Recovery

IEEE-2009

SJN05 Residual-Based

Estimation of Peer

and Link Lifetimes in

P2P Networks

IEEE-2009

SJN06 Spatio-Temporal

Network Anomaly

Detection by

Assessing Deviations

of Empirical Measures

IEEE-2009

SJN07 A Geometric Approach

to Improving Active

Packet Loss

Measurement

IEEE-2009

SJN08 Benefit Based Data

Caching In Ad Hoc

Networks

IEEE-2009

SJN09 Minimizing File

Download Time in

Stochastic Peer-to-

Peer Networks

IEEE-2009

SJN10 Rate & Delay

Guarantees Provided

By Close Packet

Switches with Load

Balancing

IEEE-2009

SJN11 Performance of a

Speculative

Transmission Scheme

for Scheduling-

Latency Reduction

IEEE-2009




SJN12 Dual-Link Failure

Resiliency through

Backup Link Mutual

Exclusion

IEEE-2009

SJN13 BRA A Bidirectional

Routing Abstraction

for Asymmetric Mobile

Ad Hoc Networks

IEEE-2009

SJN14 Securing User-

Controlled Routing

Infrastructures

IEEE-2009

SJN15 Two Techniques for

Fast Computation of

Constrained Shortest

Paths

IEEE 2008

SJN16 Predictive Job

Scheduling in a

Connection Limited

System using Parallel

Genetic Algorithm

IEEE-2005

SJN17 A Distributed

Database Architecture

for Global Roaming in

Next-Generation

Mobile Networks

IEEE-2004

SJN18 Location Aided

Routing In Mobile AD-

HOC Networks

IEEE-2004

SJN19 An Acknowledgment-

Based Approach For

The Detection Of

Routing Misbehavior

In MANETs

IEEE-2007

SJN20 XTC: A Practical

Topology Control

Algorithm for Ad-Hoc

Networks

IEEE-2004

SJN21 A near-optimal

multicast scheme for

mobile ad hoc

IEEE-2005




networks using a

hybrid genetic

algorithm

SJN22 Network border

patrol: preventing

congestion collapse

and promoting

fairness in the

Internet

IEEE-2004

SJN23 An Agent Based

Intrusion Detection,

Response and

Blocking using

signature method in

Active Network.

IEEE-2006

SJN24 ITP: An Image

Transport Protocol for

the Internet

IEEE-2002

SJN25 Performance

Evaluation of RMI

IEEE REFERENCE

SJN26 Genetic Algorithm

Based Train

Simulation Using

Concurrent

Engineering

IEEE REFERENCE

SJN27 Public Key Validation

for DNS security

Extension

IEEE REFERENCE

SJN28 Homogenous Network

Control and

Implementation

IEEE REFERENCE

DOMAIN : DISTRIBUTE COMPUTING(j)

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SJD01 Detecting Malicious

Packet Losses

IEEE-2009




SJD02 A Distributed Stream

Query Optimization

Framework through

Integrated Planning

and Deployment

IEEE-2009

SJD03 QUIVER Consistent

Object Sharing For

Edge Services

IEEE-2008

SJD04 Efficient and Secure

Content Processing

and Distribution by

Cooperative

Intermediaries

IEEE-2008

SJD05 Efficient and Secure

Content Processing

and Distribution by

Cooperative

Intermediaries

IEEE-2008

SJD06 Distributed cache

updating for the

Dynamic source

routing protocol

IEEE-2006

DOMAIN : SECURE COMPUTING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SJS01 Flexible Rollback

Recovery in Dynamic

Heterogeneous Grid

Computing

IEEE-2009

SJS02 Dynamic Routing with

Security

Considerations

IEEE-2009

SJS03 Modeling &

Automated

Containment of

Worms

IEEE-2008

SJS04 Controlling IP IEEE-2008




Spoofing Through

Inter Domain Packet

Filters

SJS05 Protection of

Database Security via

Collaborative

Inference Detection

IEEE-2008

SJS06 A Precise Termination

Condition of the

Probabilistic Packet

Marking Algorithm

IEEE-2008

SJS07 An Adaptive

Programming Model

for Fault-Tolerant

Distributed Computing

IEEE-2007

SJS08 Hybrid Intrusion

Detection with

Weighted Signature

Generation over

Anomalous Internet

Episodes (HIDS)

IEEE-2007

SJS09 Application of BPCS

steganography to

wavelet compressed

video

IEEE-2004


CODE

PROJECT TITLE

REFERENCE

SJI01 Adaptive Fuzzy IEEE-2009




Filtering for Artifact

Reduction in

Compressed Images

and Videos

SJI01 Facial Recognition

using multisensor

images based on

localized kernel eigen

spaces

IEEE-2009

SJI03 Face Recognition

Using Laplacian faces

IEEE-2005

SJI04 Noise Reduction by

Fuzzy Image Filtering

Image Processing

IEEE-2006

SJI05 Online Handwritten

Script Recognition

Image Processing

IEEE-2004

SJI06 Structure and Texture

Filling-In of Missing

Image Blocks in

Wireless Transmission

and Compression App

IEEE-2004

SJI07 Image Stream

Transfer Using Real-

Time Transmission

Protocol

IEEE-2006

SJI08 Personal Identification

Based On Iris Texture

Analysis

IEEE-2003

SJI09 Personal

Authentication Using

3-D Finger Geometry

IEEE-2006

SJI10 Image Compression IEEE REFERENCE




and De-compression

SJI11 Java water marking

and image combustion

IEEE REFERNCE

DOMAIN : DATA MINING

SJDM01 Online Index

Recommendations for

High-Dimensional

Databases Using

Query Workloads

IEEE-2008

SJDM02 A Signature-Based

Indexing Method for

Efficient Content-

Based Retrieval of

Relative Temporal

Pattern

IEEE-2008

SJDM03 An Efficient

Association Rule

Mining Algorithm In

Distributed Databases

IEEE-2008

SJDM04 Truth Discovery with

multiple Conflicting

Information Providers

on web

IEEE-2008

SJDM05 ODAM: An Optimized

Distributed Association

Rule Mining Algorithm

IEEE-2004

SJDM06 GHIC A Hierarchical

Pattern-Based

Clustering Algorithm

for Grouping Web

Transactions

IEEE-2005

DOMAIN : MULTIMEDIA

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE




SJMUO1 Mobile Agents In

Distributed Multimedia

Database Systems

IEEE-2004


CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDM01 A Gen2-based RFID

Authentication

Protocol for Security

and Privacy

IEEE-2009

SDM02 A Tabu Searching

Algorithm For Cluster

Building in Wireless

Sensor Networks

IEEE

SDM03 Biased Random Walks

in Uniform Wireless

Networks

IEEE

SDM04 Cell Breathing

Techniques for Load

Balancing in Wireless

LANs

IEEE

SDM05 Greedy Routing with

Anti-Void Traversal for

Wirless Sensor

Networks

IEEE

SDM06 Information Content-

Based Sensor

Selection and

Transmission Power

Adjustment for

Collaborative Target

IEEE




Tracking

SDM07 Local Construction of

Near-Optimal Power

Spanners for Wireless

Ad Hoc Networks

IEEE

SDM08 On the Planning of

Wireless Sensor

Networks Energy-

Efficient Clustering

under the Joint Rout

IEEE

SDM09 Random Cast An

Energy Efficient

Communication

Scheme for Mobile Ad

Hoc Networks

IEEE

SDM10 Route Stability in

MANETs under the

Random Direction

Mobility Model

IEEE

SDM11 Large Connectivity for

Dynamic Random

Geometric Graphs

IEEE


CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDN01 Analysis of Shortest

Path Routing for Large

Multi-Hop Wireless

Networks

IEEE-2009

SDN02 Delay Analysis for

Maximal Scheduling

With Flow Control in

Wireless Networks

With Bursty Traffic

IEEE-2009

SDN03 Explicit Load

Balancing Technique

for NGEO Satellite Ip

Networks With On-

Board Processing

Capabilities

IEEE-2009

SDN04 Resequencing Analysis

of Stop-and-Wait ARQ

IEEE-2009




for Parallel

Multichannel

Communications

SDN05 PRESTO Feedback-

Driven Data

Management in

Sensor Networks

IEEE-2009

SDN06 Resource Allocation in

OFDMA Wireless

Communications

Systems Supporting

Multimedia Services

IEEE-2009

SDN07 Secure and Policy-

Complaint Source

Routing

IEEE-2009

SDN08 Single-Link Failure

Detection in All-

Optical Networks

Using

IEEE-2009

SDN09 Two Blocking

Algorithm on Adaptive

Binary Splitting Single

and Pair Resolutions

for RFID Tag

Identification

IEEE-2009

SDN10 Virus Spread in

Networks

IEEE-2009

SDN11 Rate Allocation &

Network Lifetime

Problem for Wireless

Sensor Networks

IEEE-2008

SDN12 Probabilistic Packet

Marking For Large

Scale IP Trace Back

IEEE-2008

SDN13 Statistical Techniques

for Detecting Traffic

Anomalies through

Packet Header Data

IEEE-2008

SDN14 Efficient Broadcasting IEEE-2005




with Guaranteed

Coverage in Mobile Ad

Hoc Networks

SDN15 Multiple Ant Colonies

Optimization for Load

Balancing in

Distributed Systems

IEEE REFERNCE

DOMAIN : DISTRIBUTE COMPUTING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDD01 Compaction of

Schedules and a Two-

Stage Approach for

Duplication-Based

DAG Scheduling

IEEE-2009

SDD02 Enforcing Minimum-

Cost Multicast Routing

against Shelfish

Information Flows

IEEE-2009

SDD03 Movement-Assisted

Connectivity

Restoration in

Wireless Sensor and

IEEE-2009

SDD04 HBA Distributed

Metadata Management

for Large Cluster-

Based Storage

Systems

IEEE


CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDS01 Performance of

Orthogonal

Fingerprinting Codes

under Worst-Case

Noise

IEEE-2009

SDS02 Spread-Spectrum

Watermarking

Security

IEEE-2009




SDS03 The Effectiveness of

Checksums for

Embedded Control

Networks

IEEE-2009

SDS04 On the Security of

Route Discovery in

MANETs

IEEE-2009

SDS05 Steganography for

Hiding Data in Wave

Audio Files

IEEE REFERNCE

SDS06 Hiding messages in

the Noise of a Picture

IEEE REFERNCE


CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDJ01 Adaptive Fuzzy

Filtering for Artifact

Reduction in

Compressed Images

and Videos

IEEE-2009

SDJ02 Facial Recognition

using multisensor

images based on

localized kernel eigen

spaces

IEEE-2009

SDJ03

Active Learning

Methods for

Interactive Image

Retrieval

IEEE-2008

SDJ04 Vision Based

Processing For Real-

Time 3-D Data

Acquisition Based On

Coded Structured

Light

IEEE-2008




SDJ05 Efficient 2-D

Grayscale

Morphological

Transformations With

Arbitraly Flat

Structuring Elements

IEEE-2008

SDJ06 Image Processing

Techniques for the

Detection and

Removal of Cracks in

Digitized Paintings

IEEE-2006

SDJ07 Neural Networks

for Unicode Optical

Character Recognition

IEEE-2004

SDJ08 Back Propagation

Neural Network for

Image Recognition

IEEE REFERENCE

SDJ09 Image Processing for

Edge Detection

IEEE REFERENCE

SDJ10 Hopfield model of

neural network for

pattern recognition

IEEE REFERENCE

DOMAIN :

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDDM01 Hardware enhanced

association rule

mining with Hashing

and Pipelining

IEEE-2008

SDDM02 Watermarking


Using Optimization

Based Techniques

IEEE-2008

SDDM03

Workflow Mining

Discovering Process

Models from Event

Logs

IEEE-2004




DOMAIN : NETWORKING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDN01 Efficient Routing In

Intermittently

Connected Mobile

Networks The Multiple

Copy Case

IEEE 2008

DOMAIN : MULTIMEDIA

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDMU01 Orthogonal Data

Embedding for

Binary Images in

Morphological

Transform Domain-

A High-Capacity

Approach

IEEE2008

DOMAIN : TRANSPORTATION SYSTEM

CODE

PROJECT TITLE

REFERENCE

SDT01 Fuzzy Control Model

Optimization for

Behavior-Constent

Traffic Routing

Under Information

Provision

IEEE-2008

DOMAIN : SOFTWARE ENGINEERING

CODE

PROJECT TITLE

DESCRIPTION

REFERENCE

SDSE01 Estimation of

Defects Based On

Defect Decay Model

ED3M

IEEE-2008

DOMAIN : DATA MINING

CODE

PROJECT TITLE DESCRIPTION

REFERENCE




JJD01 Answering Frequent

Probabilistic Inference

Queries in Databases

IEEE

JJD02 A Dual Framework and

Algorithms for

Targeted Online Data

Delivery

IEEE

JJD03 A Fuzzy Self-

Constructing Feature

Clustering Algorithm

for Text Classification

IEEE

JJD04 A Link-Analysis

Extension of

Correspondence

Analysis for Mining

RDs

IEEE

JJD05 Adaptive Cluster

Distance Bounding for

High Dimensional

Indexing

IEEE

JJD06 Adaptive Provisioning

of Human Expertise in

Service-oriented

Systems

IEEE

JJD07 Data Integrity Proofs

in Cloud Storage

IEEE

JJD08 Decision Trees for

Uncertain Data

IEEE

JJD09 Discovering

Conditional Functional

Dependencies

IEEE

JJD10 Effective Navigation of

Query Results Based

on Concept

Hierarchies

IEEE

JJD11 Efficient Computation

of Range Aggregates

against Uncertain

Location Based

Queries

IEEE

JJD12 Exploring Application-

Level Semantics for

Data Compression

IEEE

JJD13 Extended XML Tree

Pattern Matching:

Theories and

Algorithms

IEEE

JJD14 Improving Aggregate

Recommendation

IEEE




Diversity Using

Ranking-Based

Techniques

JJD15 Integration of Sound

Signature in Graphical

Password

Authentication System

IEEE

JJD16 Learning Semi-

Riemannian Metrics

for Semi supervised

Feature Extraction

IEEE

JJD17 One Size Does Not Fit

All: Towards User- and

Query-Dependent

Ranking For Web

Databases

IEEE

JJD18 Ranking Spatial Data

by Quality Preferences

IEEE

JJD19 Scalable Learning of

Collective Behavior

IEEE

JJD20 The CoQUOS

Approach to

Continuous Queries in

Unstructured Overlays

IEEE

JJD21 The World in a

Nutshell:Concise

Range Queries

IEEE

JJD22 Estimating the

Helpfulness and

Economic Impact of

Product Reviews:

MiningText and

Reviewer

Characteristics

IEEE

JJD23 Publishing Search

Logs – A Comparative

Study of Privacy

Guarantees

IEEE




DOMAIN : CLOUD COMPUTING

CODE

PROJECT TITLE DESCRIPTION REFERENCE

JJC01 Going Back and Forth:

Efficient

Multideployment and

Multisnapshotting on

Clouds

IEEE

JJC02 Improving Utilization

of Infrastructure

IEEE

JJC03 26 Secure and

Practical Outsourcing

of Linear Programming

in Cloud Computing

IEEE

JJC04 Optimal service pricing

for a cloud cache

IEEE

JJC05 Automated

Certification for

Compliant Cloud-

based Business

Processes

IEEE

DOMAIN : SERVICE COMPUTING

CODE


REFERENCE

JJS01 Vulnerability Analysis

in SOA-based

Business Processes

IEEE

DOMAIN : WEB SERVICE

CODE


REFERENCE

JJW01 A Personalized

Ontology Model for

Web Information

Gathering

IEEE





CODE


JJM01 A Privacy-Preserving

Location Monitoring

System for Wireless

Sensor Networks

IEEE

JJM02 Optimal Stochastic

Location Updates in

Mobile Ad Hoc

Networks

IEEE

JJM03 Supporting Efficient

and Scalable

Multicasting over

Mobile Ad Hoc

Networks

IEEE

JJM04 Throughput

Optimization in Mobile

Backbone Networks

IEEE

JJM05 Load Shedding in

Mobile Systems with

MobiQual

IEEE

JJM06 Cognitive Radio based

Wireless Sensor

Network Architecture

for Smart Grid Utility

IEEE

JJM07 A Cooperative

Diversity- Based

Robust MAC Protocol

in Wireless Ad Hoc

IEEE

JJM08 Performance C

haracterization for

IEEE 802.11p Network

With Single Channel

Devices

IEEE

JJM09 Energy Efficiency of

MAC protocols in

Wireless Sensor

Networks

IEEE

JJM10 Energy efficient

localized routing

algorithm for Wireless

Sensor Networks

IEEE

JJM011 Energy Efficient

Routing Protocol for

Wireless Sensor

Networks with Node

and Sink

Mobility

IEEE




JJM012 Dynamic Location

Update Scheme for

Mobile Sinks in

Wireless Sensor

Networks

IEEE

JJM013 98 Modeling and

Improving TCP

Performance over

Cellular Link with

Variable Bandwidth

IEEE

JJM014 Expected Routing

Overhead for Location

Service in MANETs

under Flat Geographic

Routing

IEEE

JJM015 Temporal Link

Signature

Measurements for

Location Distinction

IEEE

DOMAIN : NETWORK AND SERVICE MANAGEMENT

CODE


JJN01 Locating Equivalent

Servants over P2P

Networks

IEEE


CODE


JJN01 Improved division by

invariant integers

IEEE

DOMAIN : PARALLEL AND DISTRIBUTED COMPUTING

CODE





JJP01 A Generic Framework

for Three-Factor

Authentication:

Preserving Security and

Privacy in Distributed

Systems

IEEE

JJP02 Exploiting Dynamic

Resource Allocation for

Efficient Parallel Data

Processing in the

Cloud

IEEE


CODE


JJS01 A Distributed Algorithm

for Finding All Best

Swap Edges of a

Minimum Diameter

Spanning Tree

IEEE

JJS02 A Fault-Tolerant Token-

Based Atomic

Broadcast Algorithm

IEEE

JJS03 A Policy Enforcing

Mechanism for Trusted

Ad Hoc Networks

IEEE

JJS04 A Tamper-Resistant

Programming Language

System

IEEE

JJS05 Adaptive Fault Tolerant

QoS Control Algorithms

for Maximizing System

Lifetime of

Query-Based Wireless

Sensor Networks

IEEE

JJS06 Balancing Revocation

and Storage Trade-Offs

in Secure Group

Communication

IEEE




JJS07 Chip Self-Organization

and Fault-Tolerance in

Massively Defective

Multicore Arrays

IEEE

JJS08 Comparative Evaluation

of Spoofing Defenses

IEEE

JJS09 48 Mechanism Design-

Based Secure Leader

Election Model for

Intrusion Detection in

MANET

IEEE

JJS10 Modeling and Detection

of Camouflaging Worm

IEEE

JJS11 Nymble: Blocking

Misbehaving Users in

Anonymizing Networks

IEEE

JJS12 RITAS: Services for

Randomized Intrusion

Tolerance

IEEE

JJS13 Robust Correlation of

Encrypted Attack Traffic

through Stepping

Stones by Flow

Watermarking

IEEE

JJS14 SAT: A Security

Architecture

AchievingAnonymity

and Traceability in

Wireless Mesh

Networks

IEEE

JJS15 The Geometric Efficient

Matching Algorithm for

Firewalls

IEEE

JJS16 Analyzing a Family of

Key Protection

Schemes against

Modification Attacks

IEEE

JJS17 Distributed Detection of

Clone Attacks in

Wireless Sensor

Network

IEEE

JJS18 Prime: Byzantine

Replication under

Attack

IEEE

JJS19 Securing Topology

Maintenance Protocols

for Sensor Networks

IEEE

JJS20 ELMO: Energy Aware

Local Monitoring in

IEEE




Sensor Networks

DOMAIN : SOFTWARE ENGINEERING

CODE PROJECT TITLE DESCRIPTION REFERENCE

JJSE01 A Comparative Study of

Software Model

Checkers as Unit

Testing Tools:An

Industrial Case

Study

IEEE

JJSE02 Developing a Single

Model and Test

Prioritization Strategies

for Event-Driven

Software

IEEE

JJSE03 Genetic Algorithms for

Randomized Unit

Testing

IEEE

JJSE04 Semi-Proving: An

Integrated Method for

Program Proving,

Testing, and Debugging

IEEE

JJSE05 Software Module

Clustering as a Multi–

Objective Search

Problem

IEEE

JJSE06 The Awareness

Network, To Whom

Should I Display My

Actions? And, Whose

Actions

Should I Monitor?

IEEE

JJSE07 Verifying the Evolution

of Probability

Distributions Governed

by a DTMC

IEEE

DOMAIN : WIRELESS COMMUNICATION





JJW01 A Spatiotemporal

Approach for Secure

Range Queries in Tiered

Sensor Networks

IEEE

JJW02 A Threshold-Selective

Multiuser Downlink

MACscheme for

802.11n Wireless

Networks

IEEE

JJW03 Blind Channel

Estimation for STBC

Systems Using Higher-

Order Statistics

IEEE

JJW04 Distributed Adaptation

of Quantized Feedback

for Downlink Network

MIMO Systems

IEEE

JJW05 Fundamental Limits of

Information

Dissemination in

Wireless Ad Hoc

Networks–Part II:

Multi-Packet Reception

IEEE

JJW06 Generalized Analysis of

a Distributed Energy

Efficient Algorithm for

Change Detection

IEEE

JJW07 Improving the

Performance of Wireless

Ad Hoc Networks

Through MAC Layer

Design

IEEE

JJW08 Network Coding Based

Privacy Preservation

against Traffic Analysis

in Multi-hop Wireless

Networks

IEEE

JJW09 Throughput

Optimization in High

Speed DownlinkPacket

Access (HSDPA)

IEEE

JJW10 Utility-Optimal Multi-

Pattern Reuse in Multi-

Cell Networks

IEEE

JJW11 Weighted Energy

Detection for

Noncoherent Ultra-

Wideband Receiver

IEEE




Design

DOMAIN : NETWORKING


JJN01 A Unified Approach to

Optimizing Performance

in Networks serving

Heterogeneous

Flows

IEEE

JJN02 Buffer Sizing for 802.11

Based Networks

IEEE

JJN03 Continuous Neighbor

Discovery in

Asynchronous Sensor

Networks

IEEE

JJN04 Delay Analysis and

Optimality of

Scheduling Policies for

Multi-Hop Wireless

Networks

IEEE

JJN05 Is Cloned Code older

than Non-Cloned Code?

IEEE

JJN06 Jamming-Aware Traffic

Allocation for Multiple-

Path Routing Using

Portfolio Selection

IEEE

JJN07 Live Streaming with

Receiver-based Peer-

division Multiplexing

IEEE

JJN08 Monitoring Service

Systems from a

Language-Action

Perspective

IEEE

JJN09 ProgME: Towards

Programmable Network

Measurement

IEEE

JJN10 Selfish Overlay Network

Creation and

Maintenance

IEEE

JJN11 SPAF: Stateless FSA-

based Packet Filters

IEEE

JJN12 Topological

Transformation

Approaches to TCAM-

Based Packet

Classification

IEEE

JJN13 Achieving Bounded IEEE




Matching Delay and

Maximized Throughput

in Information

MATLAB

JM01

Scalable Face Image Retrieval with Identity-

Based

Quantization and Multi-Reference Re-ranking

IEEE 2011

JM02

No-Reference Metric Design With Machine

Learning for Local Video Compression Artifact

Level

IEEE 2011

JM03

Enhanced Assessment of the Wound-Healing

Process by Accurate Multiview Tissue

Classification

IEEE 2011

JM04

Enhanced Assessment of the Wound-Healing

Process by Accurate Multiview Tissue

Classification

IEEE 2011

JM05

Face Recognition by Exploring Information

Jointly in Space, Scale and Orientation

IEEE 2011

JM06

Mixture of Gaussians-Based Background

Subtraction for Bayer-Pattern Image

Sequences

IEEE 2011

JM07

A Novel 3-D Color Histogram Equalization

Method With Uniform 1-D Gray Scale

Histogram

IEEE 2011

JM08

Color Extended Visual Cryptography

Using Error Diffusion

IEEE 2011

JM09

Using a Visual Discrimination Model for the

Detection of Compression Artifacts in Virtual

Pathology Images

IEEE 2011

JM10

Detection of Architectural Distortion

in Prior Mammograms

IEEE 2011

JM11

A Differential Geometric Approach to

Automated Segmentation of Human Airway

Tree

IEEE 2011




JM12

A Supervised Framework for the

Registration and Segmentation of White

Matter Fiber Tracts

IEEE 2011

JM13

Curvature Interpolation Method for Image

Zooming

IEEE 2011

JM14

IMAGE Resolution Enhancement by Using

Discrete and

Stationary Wavelet Decomposition

IEEE 2011

JM16

Text Segmentation for MRC Document

Compression

IEEE 2011

NON IEEE

JNIEEJD01 Airline Reservation System

JNIEEJD02 Appointment Scheduler

JNIEEJD03 B2C-Ecommerce Portal

JNIEEJD04 E RP for Small Business

JNIEEJD05 Workflow Automation System

JNIEEJD06 Website Search Engine

JNIEEJD07 Web portal for Internet and Intranet

JNIEEJD08 Warehouse Management System

JNIEEJD09 Webportal on online community System

JNIEEJD10 Travel Management System

JNIEEJD11 Payroll Processing System

JNIEEJD12 Resume Tracking Sys tem

JNIEEJD13 Purchase Order System

JNIEEJD14 Online File Uploading System

JNIEEJD15 Quality Function Deployment

JNIEEJD16 Operation Scheduling

JNIEEJD17 Online-Shopping

JNIEEJD18 Banking

JNIEEJD19 Browsing Centre Automation

JNIEEJD20 Boutique Management System




JNIEEJD21 Call Management System

JNIEEJD22 Cement Dealer Management System

JNIEEJD23 Civil supply maintenance System

JNIEEJD24 Consensus of commission agency

JNIEEJD25 Electricity

JNIEEJD26 Firm Management system

JNIEEJD27 Hotel Management System

JNIEEJD28 Insurance

JNIEEJD29 Journal Management

JNIEEJD30 L IC

JNIEEJD31 Management Information System

JNIEEJD32 Mobile service Provider System

JNIEEJD33 Multiplexx

JNIEEJD34 Production and Planning Control

JNIEEJD35 Project Cargo

JNIEEJD36 Stock Inventory System

JNIEEJD37 Super Market

JNIEEJD38 Trade Management System

JNIEEJD39 B U S Reservation System

JNIEEJD40 IT Tutor Automation

JNIEEJD41 Online Certification Exam

JNIEEJD42 Civil Registry System

JNIEEJD43 Hospital Medi Fedora

JNIEEJD44 Budget Analyzer

JNIEEJD45 Centralized Vendor Management Portal

JNIEEJD46 Digital Library Management System

JNIEEJD47 Railway Management System

JNIEEJD48 Sniffer Mail

JNIEEJD49 Bar Coding System

JNIEEJD50 E-Fund Transfer

JNIEEJD51 Chat Engine in E-Banking

JNIEEJD52 FTP and S MTP Server

SYSTEM /NETWORK PROJECT TITLE




JNIEENS01 Advanced File Splitter and Merger(System)

JNIEENS02 ATM Network Simulation(System)

JNIEENS03 Communication Management Protocol Library

JNIEENS04 COOL-PIE(System)

JNIEENS05 Enumerating Login Session(System)

JNIEENS06 Execute Application on Remote System(System)

JNIEENS07 Firewall Protection(System)

JNIEENS08 File Management(System)

JNIEENS09 File Transfer(System)

JNIEENS10 File Watch(System)

JNIEENS11 File Spy(System)

JNIEENS12 HTTP Tunneling(System)

JNIEENS13 Image Compression(System)

JNIEENS14 Image Compression Using Port (System)

JNIEENS15 HTML Editor (Application)

JNIEENS16 J-Messenger(Application)

JNIEENS17 Net Watchman(System)

JNIEENS18 NetBIOS Enumerator(System)

JNIEENS19 Network Analyzer(System)

JNIEENS20 Mini Server(System)

JNIEENS21 Port Scanner(System)

JNIEENS22 Proxy Server

JNIEENS23 Remote Control PC Through Internet

JNIEENS24 Remote Control PC Through LAN

JNIEENS25 Remote Processes and Machine Control

We are open to prepare and guide any new ideas

on any domain/Technology. If you have any topics that should be done, please send the topic

to [email protected]

mobile computing projects,mobile comp/uting projects in java, mobile computing projects in...

Education