IEEE 2014 Project Titles for ME,M.Tech,BE,B.Tech,M.Sc,MCA,IEEE Java Project titles With Abstract, IEEE Dotnet Project Titles, CSE, IT Projects

#73/1, 3rd Floor, Salai Road, Thillai Nagar, Trichy-18 Ph: 0431-4023660
Mail: info@irisprojects.com website: www.irisprojects.com,www.irissolutions.org
Our branches: Kovai: 9943 357 357, Tanjore: 9943 317 317, Trichy: 9943 314 314
Chennai, Madurai, Nellai, Erode, Salem
Page1
TABLE OF CONTENTS
ABOUT IRIS 2
JAVA
IEEE TRANSACTIONS ON NETWORKING 3
IEEE TRANSACTIONS ON NETWORK SECURITY 5
IEEE TRANSACTIONS ON DATA MINING 8
IEEE TRANSACTIONS ON CLOUD COMPUTING 9
IEEE TRANSACTIONS ON GRID COMPUTING 11
IEEE TRANSACTIONS ON MOBILE COMPUTING 12
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 14
IEEE TRANSACTIONS ON MULTI MEDIA 15
IEEE TRANSACTIONS ON IMAGE PROCESSING 15
J2EE
IEEE TRANSACTIONS WEB SERVICES & PERVASIVE COMPUTING 16
ANDROID
IEEE TRANSACTIONS ON CLOUD COMPUTING & CONTEXT AWARE 18
IEEE TRANSACTIONS ON MOBILE COMPUTING, DATA ENGINEERING 19
DOTNET
IEEE TRANSACTIONS ON NETWORKING 20
IEEE TRANSACTIONS ON NETWORK SECURITY 23
IEEE TRANSACTIONS ON DATA MINING 27
IEEE TRANSACTIONS ON CLOUD COMPUTING 30
IEEE TRANSACTIONS ON MOBILE COMPUTING 32
IEEE TRANSACTIONS ON IMAGE PROCESSING 33
IEEE TRANSACTIONS ON GRID COMPUTING 34
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 35
IEEE TRANSACTIONS ON MULTI MEDIA 36
NS2 39

Page2
About Iris
"Iris Solutions - A Boon for Young Technocrats"
Global presence of technocrats is no more a dream in this world. We make it possible by
ensuring all the quality standards within an individual which has to be the identity of a successful
technocrat.
Irrespective of the technologies and the domain in which a particular project gets shaped,
we support all kind of student needs in terms of monetary values as well as the time factor.
Students apart from doing a particular project should know how the project is getting shaped. We
are aware in making this thing to happen.
Research and Development plays a vital role in enhancing one’s self development in
terms of up gradation and moving forward. When you are searching for a good channel to inhibit
yourself with such a platform, IRIS comes handy. Apart from providing simulation based
training, we also provide industrial experts in sharing their valuable suggestions and even
Industry oriented training at required cases.
In short we strive hard to fulfill the student requirements in terms of each and every
department of the developing their skills.

Page3
Java
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON NETWORKING
SNO P.CODE TITLES DESCRIPTION YEAR
1 ISJNW 01 An Error Minimizing
Framework for Localizing
Jammers in Wireless Networks
In this paper, we aim to design a frame
work that can localize one or multiple
jammers with a high accuracy. Most of
existing jammer-localization schemes
utilizes indirect measurements affected
by jamming attacks, which makes it
difficult to localize jammers accurately.
2013
2 ISJNW 02 Incentive-Driven and Privacy-
Preserving Message
Dissemination in Large Scale
Mobile Networks
In this paper, we propose a new type of
incentive-driven and privacy-preserving
systems for large scale message
dissemination in mobile networks. To
distribute incentives which encourage
forwarding behaviors, such as monetary
rewards, we want to keep track of the
forwarder list.
2013
3 ISJNW 03 Understanding Multi-Task
Schedulability in Duty-Cycling
Sensor Networks
Here, We investigate a fundamental
scheduling problem of both theoretical
and practical importance, called multi-
task schedulability problem, i.e., given
multiple data forwarding tasks, to
determine the maximum number of
tasks that can be scheduled within their
deadlines and work out such a schedule.
2013
4 ISJNW 04 Cluster-Based Certificate
Revocation with Vindication
Capability for Mobile Ad Hoc
Networks
In this paper, we focus on the issue of
certificate revocation to isolate
attackers from further participating in
network activities. For quick and
accurate certificate revocation, we
propose the Cluster-based Certificate
Revocation With Vindication
Capability scheme.
2013
5 ISJNW 05 Enabling Efficient WiFi-Based
Vehicular Content Distribution
In this paper, we introduce Cooperative
Content Distribution System for
2013

Page4
Vehicles which operates upon a
network of infrastructure APs to
collaboratively distribute contents to
moving vehicles.
6 ISJNW 06 Balancing the Trade-Offs
between query Delay and data
availability in MANETs
In This Project, we propose schemes to
Balance the trade –offs between data
availability and query delay under
different system settings and
requirements. Mobile nodes in one
partition are not able to access data
hosted by nodes in other partitions, and
hence significantly degrade the
performance of data access. To deal
with this problem, we apply data
replication techniques.
2013
7 ISJNW 07 Rake: Semantics Assisted
Network-Based Tracing
Framework
The ability to trace request execution
paths is critical for diagnosing
performance faults in large-scale
distributed systems. Previous black-box
and white-box approaches are either
inaccurate or invasive. We present a
novel semantics-assisted gray-box
tracing approach, called Rake, which
can accurately trace individual request
by observing network traffic.
2013
8 ISJNW 08 Uncoordinated Cooperative
Jamming for Secret
Communications
We consider a Gaussian wiretap
channel model with a single-antenna
source, destination and eavesdropper.
The communication is assisted by
multiple multi antenna helpers that
transmit noise to confound the
eavesdropper.
2013
9 ISJNW 09 Achieving Efficient Cooperative
Message Authentication in
Vehicular Ad Hoc Networks
Vehicular Ad-Hoc Networks have
emerged as a promising approach to
increase road safety and efficiency, as
well as improve driving experience.
This can be accomplished in a variety
of applications that involve
communication between vehicles, such
as warning other vehicles about
emergency braking; however, if we do
not take security and privacy issues into
2013

Page5
consideration, the attractive features of
VANETs will inevitably result in
higher risks for abuse, even before the
wide deployment of such networks.
10 ISJNW 10 MeasuRouting:A Framework
For Routing Assisted Traffic
Monitoring.
In this paper we present a theoretical
framework for Misrouting.
Furthermore, as proofs-of-concept, we
present synthetic and practical
monitoring applications to showcase
the utility enhancement achieved with
MeasuRouting.
2012
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY
11 ISJNS 01 SORT: A Self-Organizing Trust
Model for Peer-to-Peer Systems
This paper presents distributed
algorithms that enable a peer to reason
about trustworthiness of Other peers
based on past interactions and
recommendations. Peers create their
own trust network in their proximity by
using local Information available and
do not try to learn global trust
information.
2013
12 ISJNS 02 Unprivileged Black-Box
Detection of User-Space Key
loggers
We propose a new detection technique
that simulates carefully crafted
keystroke sequences in input and
observes the behavior of the keylogger
in output to unambiguously identify it
among all the running processes. We
have prototyped our technique as an
unprivileged application, hence
matching the same ease of deployment
of a keylogger executing in
unprivileged mode
2013
13 ISJNS 03 Automatic Reconfiguration for
Large-Scale Reliable Storage
Systems
In this paper, we present a complete
solution for dynamically changing
system membership in a large-scale
Byzantine-fault-tolerant system. We
present a service that tracks system
membership and periodically notifies
other system nodes of changes
2013

Page6
14 ISJNS 04 On the Security and Efficiency
of Content Distribution via
Network Coding
Content distribution via network coding
Has received a lot of attention lately.
However, direct application of network
Coding may be insecure. In particular,
attackers can inject "bogus” data to
corrupt the content distribution process
so as to hinder the information dispersal
Or even deplete the network resource.
2013
15 ISJNS 05 Snoop-Forge-Replay Attacks on
Continuous Verification With
Keystrokes
We present a new attack called the
snoop-forge-replay attack on keystroke-
based continuous verification systems.
The snoop-forge-replay is a sample-
level forgery attack and is not specific
to any particular keystroke-based
continuous verification method.
2013
16 ISJNS 06 COKE Crypto-Less Over-the-
Air Key Establishment
In this paper, we present a novel
probabilistic protocol (COKE) to allow
two wireless communicating parties to
commit over-the-air (OTA) on a shared
secret, even in the presence of a
globally eavesdropping adversary. The
proposed solution leverages no crypto
but just plaintext messages exchange.
2013
17 ISJNS 07 Performance of Virtual
Machines Under Networked
Denial of Service Attacks:
Experiments and Analysis
The use of virtual machines (VMs) to
provide computational infrastructure
and services to organizations is
increasingly prevalent in the modern IT
industry. The growing use of this
technology has been driven by a desire
to increase utilization of resources
through server consolidation..
2013
18 ISJNS 08 Physical-Layer Security in
Distributed Wireless Networks
Using Matching Theory
We consider the use of physical-layer
security in a wireless communication
system where multiple jamming nodes
assist multiple source-destination nodes
in combating unwanted eavesdropping
from a single eavesdropper.we propose
a distributed algorithm that matches
each source-destination pair with a
particular jammer.
2013

Page7
19 ISJNS 09 Security Games for Node
Localization through Veriﬁable
Multilateration
Most applications of Wireless Sensor
Networks (WSNs) rely on data about
the positions of sensor nodes, which are
not necessarily known beforehand.
Several localization approaches have
been proposed but most of them omit to
consider that WSNs could be deployed
in adversarial settings, where hostile
nodes under the control of an attacker
coexist with faithful ones.
2013
20 ISJNS 10 Packet-Hiding Methods for
Preventing Selective Jamming
Attacks.
In this paper, we address the problem
Of selective jamming attacks in
wireless networks. In these attacks, the
adversary is active only for a short
period of time, selectively targeting
messages of high importance.
2013
21 ISJNS 11 Efficient Network Modification
to Improve QoS Stability at
Failures
As real-time traffic such as video or
voice increases on the Internet, ISPs are
required to provide stable quality as
Well as connectivity at failures. For
ISPs, how to effectively improve the
stability of these qualities at failures
with the minimum investment cost is an
important issue, and they need to
effectively select a limited number of
locations to add link facilities
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON DATA MINING
22 ISJDM 01 Tweet Analysis for Real-Time
Event Detection and Earthquake
Reporting System Development
Twitter has received much attention
recently. An important characteristic of
Twitter is its real-time nature. We
investigate the real-time interaction of
events such as earthquakes in Twitter
and propose an algorithm to monitor
tweets and to detect a target event.
2013

Page8
23 ISJDM 02 A Fast Clustering-Based
Feature Subset Selection
Algorithm for High-
Dimensional Data
Feature selection involves identifying a
subset of the most useful features that
produces compatible results as the
original entire set of features. A feature
selection algorithm may be evaluated
from both the efficiency and
effectiveness points of view.
2013
24 ISJDM 03 A Genetic Programming
Approach to Record
Deduplication
In this paper, we propose a genetic
programming approach to record
deduplication that combines several
different pieces of evidence extracted
from the data content to find a
deduplication function that is able to
identify whether two entries in a
repository are replicas or not.
2013
25 ISJDM 04 Clustering Sentence-Level Text
Using a Novel Fuzzy Relational
Clustering Algorithm
This paper presents a novel fuzzy
Clustering algorithm that operates on
relational input data; i.e., data in the
form of a square matrix of pair wise
similarities between data Objects. The
algorithm uses a graph representation of
the data, and operates in an Expectation
Maximization framework in which the
graph centrality of an object in the
graph is interpreted as a likelihood.
2013
26 ISJDM 05 Dynamic Personalized
Recommendation on Sparse
Data
In this paper, a novel dynamic
personalized recommendation algorithm
is proposed, in which information
contained in both ratings and profile
contents are utilized by exploring Latent
relations between ratings, a set of
dynamic features are designed to
describe user preferences in multiple
phases, and finally a recommendation is
made by adaptively weighting the
features.
2013
27 ISJDM 06 Maximum Likelihood
Estimation from Uncertain
Data in the Belief Function
Framework
We consider the problem of parameter
estimation in statistical models in the
case where data are uncertain and
Represented as belief functions. The
proposed method is based on the
maximization of a generalized
2013

Page9
likelihood criterion, which can be
Interpreted as a degree of agreement
between the statistical model and the
uncertain observations.
28 ISJDM 07 Ranking on Data Manifold with
Sink Points
In this paper, we introduce a novel
Approach, Manifold Ranking with Sink
Points (MRSPs), to address diversity as
well as relevance and importance in
ranking. Specifically, our approach uses
a manifold ranking process over the
data manifold, which can naturally find
the most relevant and Important data
objects.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON CLOUD COMPUTING
29 ISJCC 01 Dynamic Resource Allocation
Using Virtual Machines for
Cloud Computing Environment
In this paper, we present a system
that uses virtualization technology to
allocate data center resources
dynamically based on application
demands and support green
Computing by optimizing the number of
servers in use.
2013
30 ISJCC 02 Scalable and Secure Sharing of
Personal Health Records in
Cloud Computing Using
Attribute-Based Encryption
We propose a novel patient-centric
framework and a suite of mechanisms
for data access control to PHRs stored
in semi trusted servers. To achieve fine-
grained and scalable data access control
for PHRs, we leverage attribute-based
encryption (ABE) techniques to encrypt
each patient’s PHR file.
2013
31 ISJCC 03 PACK: Prediction-Based Cloud
Bandwidth and Cost Reduction
System
In this paper, we present PACK, a novel
end-to-end traffic redundancy
elimination (TRE) system, designed for
cloud computing customers. Cloud-
based TRE needs to apply a judicious
use of cloud resources so that the
bandwidth cost reduction combined
with the additional cost of TRE
computation And storage would be
optimized.
2013

Page10
32 ISJCC 04 ANTELOPE: A Semantic-
aware Data Cube Scheme for
Cloud Data Center Networks
we present ANTELOPE, a scalable
distributed data-centric scheme in cloud
data centers, in which we systematically
Take into account both the property of
network architecture and the
optimization of data placement.
2013
33 ISJCC 05 Attribute-Based Access to
Scalable Media in Cloud-
Assisted Content Sharing
Networks
This paper presents a novel Multi-
message Ciphertext Policy Attribute-
Based Encryption technique, and
employs the MCP-ABE to design an
access control scheme for sharing
scalable media based on data consumers
attributes rather than an explicit list of
the consumers’ names.
2013
34 ISJCC 06 Dynamic Scheduling and
Pricing in Wireless Cloud
Computing
In this paper, we consider a wireless
cloud computing system in which the
wireless service provider operates a data
center and provides cloud services to its
subscribers at dynamic prices. We
propose a joint optimization of
scheduling and pricing decisions for
delay-tolerant batch services to
maximize the service provider’s proﬁt.
2013
35 ISJCC 07 A Load Balancing Model Based
on Cloud Partitioning
for the Public Cloud
This Project introduces a better load
balance model for the public cloud
based on the cloud partitioning concept
with a switch mechanism to choose
different strategies for different
situations.
36 ISJCC 08 Optimizing energy consumption
with task consolidation in
clouds
In this paper, we present an energy-
aware task consolidation (ETC)
technique that minimizes energy
consumption. ETC achieves this by
restricting CPU use below a specified
peak threshold. ETC does this by
consolidating tasks amongst virtual
clusters.
2013

Page11
37 ISJCC 09 Profit-driven scheduling for
cloud services with data access
awareness
In this paper, we address the recon -
ciliation of these conflicting objectives
by scheduling service requests with the
dynamic creation of service instances.
Specifically, our scheduling algorithms
attempt to maximize profit within the
satisfactory level of service quality
specified by the service consumer.
2013
38 ISJCC 10 pCloud: A Distributed System
for Practical PIR
Here, we present pCloud, a distributed
system that constitutes the ﬁrst attempt
towards practical cPIR. Our approach
assumes a disk-based architecture that
retrieves one page with a single query.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON GRID COMPUTING
39 ISJGC 01 On the Design of Mutually
Aware Optimal Pricing and
Load Balancing Strategies for
Grid Computing Systems
Managing resources and cleverly
pricing them on computing systems is a
challenging task. Resource sharing
demands careful load balancing and
often strives to achieve a win-win
situation between resource providers
and users. Toward this goal, we
consider a joint treatment of load
balancing and pricing.
2013
40 ISJGC 02 Multilayer Consensus ECC-
Based Password Authenticated
Key-Exchange (MCEPAK)
Protocol for Smart Grid System
This paper aims at providing a key
agreement protocol for smart grid to
cope with access control of appliances
/devices located inside a Home Area
Network (HAN) by a set of controllers
outside the HAN.
2013
41 ISJGC 03 Evolving Smart Grid
Information Management Cloud
ward: A Cloud Optimization
Perspective
We propose a cloud-based Smart Grid
information management model and
present a cloud and network resource
optimization framework to solve the cost
reduction problem in cloud-based
SG information storage and computation.
2013

Page12
42 ISJGC 04 A Merge-and-Split Mechanism
for Dynamic Virtual
Organization Formation in
Grids
Executing large scale application
programs in grids requires resources
from several Grid Service Providers
(GSPs). These providers form Virtual
Organizations (VOs) by pooling their
resources together to provide the
required capabilities to execute the
application.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING
43 ISJMC 01 Channel Assignment for
Throughput Optimization in
Multichannel Multiradio
Wireless Mesh Networks Using
Network Coding
Compared to single-hop networks such
as Wi-Fi, multihop infrastructure wire -
less mesh networks (WMNs) can
potentially embrace the broadcast
benefits of a wireless medium in a more
flexible manner. Rather than being point-
to-point, links in the WMNs may
originate from a single node and reach
more than one other node.
2013
44 ISJMC 02 Discovery and Verification of
Neighbor Positions in Mobile
Ad Hoc Networks
In this paper, we address the issues by
proposing a fully distributed co -
operative solution that is robust against
independent and colluding adversaries,
and can be impaired only by an
overwhelming presence of adversaries.
2013
45 ISJMC 03 Distributed Cooperative
Caching in Social Wireless
Networks
This paper introduces cooperative
caching policies for minimizing
electronic content provisioning cost in
Social Wireless Networks (SWNET).
SWNETs are formed by mobile
devices, such as data enabled phones,
electronic book readers etc.,
2013

Page13
46 ISJMC 04 EAACK—A Secure Intrusion-
Detection System for MANETs
In this paper, we propose & implement
a new intrusion-detection system named
Enhanced Adaptive acknowledgment
specially designed for MANETs.
Compared to contemporary approaches,
EAACK demonstrates higher malicious
-Behavior-detection rates in certain
circumstances while does not greatly
affect the network performances.
2013
47 ISJMC 05 EMAP: Expedite Message
Authentication Protocol for
Vehicular Ad Hoc Networks
We propose an expedite Message
Authentication Protocol (EMAP) for
VANETs, which replaces the time-
consuming CRL checking process by an
efficient revocation checking process.
2013
48 ISJMC 06 Adaptive Mobile Cloud
Computing to Enable Rich
Mobile Multimedia
Applications
In this paper, we look at early trends,
and opportunities and beneﬁts for new
CMM applications and services. We
analyze the challenges imposed by
mobile cloud computing that need to be
addressed to make CMM applications
viable, including response time, user
experience, cloud computing cost,
mobile network bandwidth, and
scalability to large number of
CMMusers, besides other important
cloud computing issues like energy
consumption, privacy, and security.
2013
49 ISJMC 07 Pulse Switching: Toward a
Packet-Less Protocol Paradigm
for Event Sensing
This paper presents a novel pulse
switching protocol framework for ultra
light-weight wireless network
applications. The key Idea is to abstract
a single Ultra Wide Band pulse as the
information switching granularity.
2013
50 ISJMC 08 WiCop: Engineering WiFi
Temporal White-Spaces for
Safe Operations of Wireless
Personal Area Networks in
Medical Applications
This paper exploits the Clear Channel
Assessment mechanism in WiFi devices
and proposes novel policing framework,
WiCop that can effectively control the
temporal white-spaces between WiFi
transmissions.Such temporal white-
spaces can be utilized for delivering low
duty cycle WPAN trafﬁc.
2013

Page14
51 ISJMC 09 Quality-Differentiated Video
Multicast in Multirate Wireless
Networks
In this work, we investigate a rate-
adaptive video multicast scheme that
can provide heterogeneous clients
differentiated visual qualities matching
their channel conditions.
2013
52 ISJMC 10 Toward Privacy Preserving and
Collusion Resistance in a
Location Proof Updating
System
We propose A Privacy-Preserving
location proof Updating System
(APPLAUS) in which co located
Bluetooth enabled mobile devices
mutually generate location proofs and
send updates to a location proof server.
2013
53 ISJMC 11 Vampire Attacks: Draining Life
from Wireless Ad Hoc Sensor
Networks
This paper explores resource depletion
attacks at the routing protocol layer,
which permanently disable networks by
quickly draining nodes’ battery power.
These “Vampire” attacks are not
specific to any specific protocol, but
rather rely on the properties of many
popular classes of routing Protocols.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
54 ISJSE 01 Ant Colony Optimization for
Software Project Scheduling
and Staffing with an Event-
Based Scheduler
This paper develops a novel approach
with an event-based Scheduler (EBS)
and an ant colony optimization (ACO)
algorithm. The proposed approach
represents a plan by a task list and a
Planned employee allocation matrix.
2013
55 ISJSE 02 Identifying and Summarizing
Systematic Code Changes via
Rule Inference
This paper proposes a rule-based
program differencing approach that
automatically discovers and Represents
systematic changes as logic rules.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON MULTI MEDIA
56 ISJMM 01 Beyond Text QA: Multimedia
Answer Generation by
Harvesting Web Information
In this paper, we propose a scheme that
is able to enrich textual answers in QA
with appropriate media data. Our
scheme consists of three components:
2013

Page15
answer medium selection, query
generation for multimedia search, and
multimedia data selection and
presentation. This approach
automatically determines which type of
media information should be added for
a textual answer.
57 ISJMM 02 Hessian Regularized Support
Vector Machines for Mobile
Image Annotation on the Cloud
In this paper, we present a scheme for
image annotation on the cloud, which
transmits mobile images compressed by
Hamming, compressed sensing to the
cloud and conducts semantic annotation
through a novel Hessian regularized
support vector machine on the cloud.
2013
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING
58 ISJIP 01 Colorization Based Compression
Using Optimization
In this paper, we formulate the
colorization-based coding problem into
an optimization problem. In colorization
based coding, the encoder chooses a few
representative pixels (RP) for which the
chrominance values and the positions are
sent to the decoder whereas in the
decoder, the chrominance values for all
the pixels are reconstructed by
colorization methods.
2013
59 ISJIP 02 Personal Photo Enhancement
using Internet Photo Collections
In this paper, we propose a framework
to overcome the imperfections of
personal photos of tourist sites using the
rich information provided by large scale
Internet photo collections.
2013
J2EE
TECHNOLOGY: J2EE
DOMAIN : WEB SERVICES

Page16
SNO P.CODE TITLES YEAR
1 ISJ2E 01 Toward Trustworthy Coordination of Web Services Business Activities 2013
2 ISJ2E 02
Constructing a Global Social Service Network
for Better Quality of Web Service Discovery
2013
3 ISJ2E 03
Instant Recommendation for Web Services
Composition
2013
4 ISJ2E 04
Evolution of Social Networks
Based on Tagging Practices
2013
5 ISJ2E 05
Security-aware Service Composition with Fine-grained Information Flow
Control
2013
6 ISJ2E 06
Verification of Semantic Web Service Annotations Using Ontology-
Based Partitioning
2013
DOMAIN : PERVASIVE COMPUTING
7 ISPC 01 From Context Awareness to Socially Aware Computing 2013
8 ISPC 02 An Intelligent Coaching System for Therapy Adherence 2013
9 ISPC 03
Designing for Engaging Experiences in Mobile
Social-Health Support Systems
2013
10 ISPC 04
Context-Based Applications in Converged Networks: Beyond SIMPLE
Presence
2013
JAVA APPLICATION PROJECTS
TECHNOLOGY : JAVA
DOMAIN : NON IEEE BASED PROJECTS
SNO P.CODE PROJECT TITLE
1 ISNIJ 01 Inventory Management System
2 ISNIJ 02 Human Capital Management System

Page17
TECHNOLOGY: ANDROID
3 ISNIJ 03 CMS Measures Management System
4 ISNIJ 04 MIS For Alumni Students
5 ISNIJ 05 A Conceptual View Of Web Based E-Learning System
6 ISNIJ 06 Marking large scale deliberation online management system
7 ISNIJ 07 Printed Work To Spoken Vibration Converter
8 ISNIJ 08 Quiver: Consistent And Scalable Sharing For Edge Services
9 ISNIJ 09 Design And Implementation Of Scalable Edge Based Admission
10 ISNIJ 10 Strong Barrier Coverage For Intrusion Detection In Wireless Sensor Network
11 ISNIJ 11 A Dynamic Path Identification Mechanism To Defend Against DDos
12 ISNIJ 12 Mittigating Performance Degradation In Congested Sensor Networks
13 ISNIJ 13 Efficient Dynamic Probabilistic Packet Marking Scheme
14 ISNIJ 14 Dynamic Adaptation Of Checkpoints And Rescheduling In Grid
15 ISNIJ 15
Fully Predictable HPC Infrastructure Using Admission Control With
Virtualization
16 ISNIJ 16 E Compiler For Java With Security Editor
17 ISNIJ 17 Change Point Monitoring For Detection Of Dos Attacks
18 ISNIJ 18
Bi-Criteria Scheduling With Dynamic Instantiation For Workflow Execution On
Grids
19 ISNIJ 19 Eight Times Acceleration Of Geospatial Data Archiving
20 ISNIJ 20 Automatic Reconfiguration In Wireless Mesh Networks

Page18
1 ISACC 01 A Review on Distributed
Application Processing
Frameworks in Smart Mobile
Devices for Mobile Cloud
Computing
It proposes thematic taxonomy of
current DAPFs, reviews current
ofﬂoading frameworks by using
thematic taxonomy and analyzes the
implications and critical aspects of
current offloading frameworks.
2013
2 ISACC 02 A Network and Device Aware
QoS Approach for Cloud-
Based Mobile Streaming.
In this study presented a network and
QoS approach that provides multimedia
data suitable for a terminal unit
environment via interactive mobile
streaming services.
2013
3 ISACS 01 A Survey on Context-Aware
Mobile and Wireless
Networking: On Networking
and Computing Environments’
Integration
In this survey paper, we aim to
assemble all the ”puzzle-pieces” of
the emerging research area of Context
Aware Mobile and Wireless
Networking in order to provide the
reader aholistic representation of the
work having been done in the past
emphasizing in recent research effort.
2013
4 ISACS 02 Cloud-Based Augmentation for
Mobile Devices: Motivation,
Taxonomies, and Open
Challenges
The objectives of this study are to
highlight the effects of remote
resources on the quality and reliability
of augmentation processes and discuss
the challenges and opportunities of
employing varied cloud-based.
TECHNOLOGY: ANDROID
5 ISAMC 01 Wireless Machine-to-Machine
Healthcare Solution Using
Android Mobile Devices in
Global Networks
This paper presents a prototype
machine-to machine (M2M) healthcare
solution that combines mobile and IPv6
techniques in a wireless sensor network
2013
TECHNOLOGY: ANDROID
DOMAIN : CONTEXT AWARE SERVICES

Page19
to monitor the health condition of
patients and provide a wide range of
effective, comprehensive, and
convenient healthcare services.
6 ISAMC 02 Trafﬁc Signature-based Mobile
Device Location Authentication
In this paper, We describe a prototype
non-cryptographic location
authentication system we constructed,
and explain how to design both voice
and data transmissions with distinct,
discernible trafﬁc signatures.
2013
TECHNOLOGY: ANDROID
DOMAIN : IEEE TRANSACTIONS ON DATA ENGINEERING
7 ISADE 01 PMSE: A Personalized Mobile
Search Engine
In this paper, We propose a
personalized mobile search engine
(PMSE) that captures the users’
preferences in the form of concepts by
mining their click through data.
2013
8 ISADE 02 Smartphone-Based Industrial
Informatics Projects and
Laboratories
In this paper, smart phones and
multimedia technologies are proposed
as an innovative way to tackle the
formation of students, at different
levels.
2013
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON NETWORKING

Page20
1 ISDNW 01 Dynamic Service Contract
Enforcement in Service-
Oriented Networks
In this paper, we propose and validate
DoWSS, a doubly weighted algorithm
for service traffic shaping. We show
via simulation that Do WSS possesses
several advantages: It eliminates the
approximation issues, prevents
starvation, and contains the rapid
credit consumption issue in existing
credit-based approaches.
2013
2 ISDNW 02 Vulnerability of Network
Mechanisms to Sophisticated
DDoS Attacks
Our approach is based on proposing a
metric that evaluates the
vulnerability of a system. We then use
our vulnerability metric to evaluate a
data structure which is commonly used
in network mechanisms-the Hash table
data structure.
2013
3 ISDNW 03 IP-Geolocation Mapping for
Moderately Connected Internet
Regions
In this paper, however, we investigate a
large region of moderately connected
Internet and find the delay-distance
correlation is weak. But we discover a
more probable rule—with high
probability the shortest delay comes
from the closest distance.
2013
4 ISDNW 04 Detection and Localization of
Multiple Spoofing Attackers in
Wireless Networks
In this paper, we propose to use spatial
information, a physical property
associated with each node, hard to
falsify, and not reliant on
cryptography, as the basis for 1)
detecting spoofing attacks; 2)
determining the no of attackers when
multiple adversaries masquerading as
the same node identity
and 3)localizing multiple adversaries.
2013

Page21
5 ISDNW 05 Robust Tracking of Small-Scale
Mobile Primary User in
Cognitive Radio Networks
In this paper, we propose a new
framework, called Sequential Monte
Carlo combined with shadow-fading
estimation (SOLID), for accurate,
attack/fault-tolerant tracking of small-
scale mobile primary users. The key
idea underlying SOLID is to exploit the
temporal shadow fading
correlation in sensing results induced by
the primary user's mobility.
2013
6 ISDNW 06 Attacks and Defenses in the
Data Plane of Networks
We demonstrate-to our knowledge
the first practical attack that exploits a
vulnerability in packet processing
software to launch a devastating
denial-of service attack from within
the network infrastructure. This
attack uses only a single attack packet
to consume the full link bandwidth
of the router's outgoing link.
2013
7 IDSNW 07 A Decentralized Privacy
Preserving Reputation Protocol
for the Malicious Adversarial
Model
In this paper, We present
a privacy preservingreputation protocol
for the malicious adversarial model. Th
e malicious users in this model actively
attempt to learn the private feedback
values of honest users as well as to
disrupt the protocol. Our protocol does
not require centralized entities, trusted
third parties, or specialized platforms,
such as anonymous networks and
trusted hardware.
2013
8 ISDNW 08 Privacy Vulnerability of
Published Anonymous Mobility
Traces
In this paper, we investigate how an
adversary, when equipped with a small
amount of the snapshot information
termed as side information, can infer an
extended view of the whereabouts of a
victim node appearing in an anonymous
trace. Our results quantify the loss of
victim nodes’ privacy as a function of
the nodal mobility, the inference
strategies of adversaries, and any noise
that may appear in the trace or the side
information.
2013

Page22
9 ISDNW 09 Security Analysis of a Single
Sign-On Mechanism for
Distributed Computer Networks
In this paper, however, we
demonstrative that their scheme is
actually insecure as it fail s to meet
credential privacy and soundness of
authentication. Specifically, we present
two impersonation attacks. The first
attack allows a malicious service
provider, who has successfully
communicated with a legal user twice,
to recover the user’s credential and then
to impersonate the user to access
resources and services offered by other
service providers.
2013
10 ISDNW 10 Identity-Based Secure
Distributed Data Storage
Schemes
In this paper, we propose two identity-
based secure distributed data storage
(IBSDDS) schemes. Our schemes can
capture the following properties: (1)
The file owner can decide the access
permission independently without the
help of the private key generator
(PKG); (2) For one query, a receiver
can only access one file, instead of all
files of the owner; (3) Our schemes are
secure against the collusion attacks,
namely even if the receiver can
compromise the proxy servers, he
cannot obtain the owner’s secret key.
2013
11 ISDNW 11 Detecting Influential Spreaders
in Complex, Dynamic Networks
A hybrid of node degree and k-shell
index is more effective at identifying
influential spreaders and has less
computational overhead than either of
these traditional measures
2013
12 ISDNW 12 Empirical Evaluation and New
Design for Fighting Evolving
Twitter Spammers
In this paper, we first make a
comprehensive and empirical analysis
of the evasion tactics utilized by Twitter
spammers. We further design several
new detection feature s to detect more
Twitter spammers.
2013

Page23
13 ISDNW 13 Dynamic Authentication with
Sensory Information for the
Access Control Systems
In this work, we introduce a dynamic
authentication with sensory information
for the access control systems. By
combining sensory information
obtained from onboard sensors on the
access cards as well as the original
encoded identification information, we
are able to effectively tackle the
problems such as access card loss,
stolen and duplication. Our solution is
backward-compatible with existing
access
2013
TECHNOLOGY : DOTNET
DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY
14 ISDNS 01 Cooperative Message
Authentication in Vehicular
Cyber-Physical Systems
In this paper, we address the issue of
large computation overhead caused by
the safety message authentication.
Specially, a cooperative message
authentication protocol (CMAP) is
developed to alleviate vehicles’
computation burden. With CMAP, all
the vehicles share their verification
results with each other in a cooperative
way, so that the number of safety
messages that each vehicle needs to
verify reduces significantly
2013
15 ISDNS 02 SORT: A Self-Organizing Trust
Model for Peer-to-Peer Systems
This paper presents distributed
algorithms that enable a peer to reason
about trustworthiness of other peers
based on past interactions and
recommendations. Peers create their
own trust network in their proximity by
using local information available and do
not try to learn global trust information.
2013
16 ISDNS 03 Predicting Architectural
Vulnerability on Multithreaded
Processors under Resource
Contention and Sharing
This paper proposes a scalable two-
level predictive mechanism capable of
predicting a program’s AVF on a
SMT/CMP architecture from easily
measured metrics.
2013

Page24
17 ISDNS 04 NICE: Network Intrusion
Detection and Countermeasure
Selection in Virtual Network
Systems
Cloud security is one of most important
issues that has attracted a lot of research
and development effort in past few
years. Particularly, attackers can explore
vulnerabilities of a cloud system and
compromise virtual machines to deploy
further large-scale Distributed Denial-
of-Service (DDoS).
2013
18 ISDNS 05 Modeling Propagation Dynamics
of Social Network Worms
Social network worms, such as email
worms and facebook worms, pose a
critical security threat to the Internet.
Modeling their propagation dynamics is
essential to predict their potential
damages and develop countermeasures.
Although several analytical models have
been proposed for modeling propagation
dynamics of social network worms,
there are two critical problems unsolved:
temporal dynamics and spatial
dependence.
2013
19 ISDNS 06 On the Security of End-to-End
Measurements Based on Packet-
Pair Dispersions
In this paper, we explore the security of
measurements based on the packet-pair
technique. We propose lightweight
countermeasures to detect attacks on
bandwidth measurements; our technique
can detect whether delays were inserted
within t he transmission of a packet-pair
2013
20 ISDNS 07 Authorization Control for a
Semantic Data Repository
through an Inference Policy
Engine
In this paper, we design an
authorization security model enforced on
a semantic model’s entities (concepts)
and also propagate on their individuals
in the OWL database through an
inference policy engine. We provide
TBox access control for the construction
of a TBox family and propagate this
based on the construction of concept
taxonomies.
2013

Page25
21 ISDNS 08 A large-scale study of the time
required to compromise a
computer system
The paper also analyzes whether time to
compromise increase for each successful
intrusion of a computer system. The
results regarding this property suggest
that time to compromise decrease along
the number of intrusions of a system.
2013
22 ISDNS 09 Secure Encounter-based Mobile
Social Networks: Requirements,
Designs, and Tradeoffs
In this paper, we explore the functional
and security requirements for these new
systems, such as availability, security,
and privacy, and present several design
options for building secure encounter-
based social networks. To highlight
these challenges we examine one
recently proposed encounter-based
social network design and compare it to
a set of idealized security and
functionality requirements.
2013
23 ISDNS 10 Secrecy Capacity Enhancement
With Distributed Precoding in
Multirelay Wiretap Systems
In this paper, where an eavesdropper is
present. Distributed pre coding through
multiple relay nodes can be used to
enhance the received signal power a t
the destination node and to mitigate the
signal leakage to the eavesdropper,
simultaneously.
2013
24 ISDNS 11 Strong Secrecy in Bidirectional
Broadcast Channels With
Conﬁdential Messages
To increase the spectral efficiency of
future wireless networks, it is important
to wisely integrate multiple services at
the physical layer. Here the efficient
integration of confidential services in the
three node bidirectional relay
Channel is studied. A relay node
establishes a bidirectional communication
between two other nodes using a decode-
and-forward protocol, which is also
known as two-way relaying.
2013

Page26
25 ISDNS 12 Entrusting Private Computation
and Data to Untrusted Networks
This paper focuses specifically on NP-
complete problems and demonstrates
how sTile-based systems can solve
important real-world problems, such as
protein folding, image recognition, and
resource allocation. We present the
Algorithms involved in sTile and
formally prove that sTile-based
systems preserve privacy.
2013
26 ISDNS 13 Discovery and Resolution of
Anomalies in Web Access
Control Policies
In this paper, we represent an
innovative policy anomaly analysis
approach for Web access control
policies, focusing on XACML policy.
We introduce a policy based
segmentation technique to accurately
identify policy anomalies and derive
Effective anomaly resolutions, along
with an intuitive visualization
representation of analysis results.
2013
27 ISDNS 14 Extending Attack Graph-Based
Security Metrics and
Aggregating Their Application
The attack graph is an abstraction that
reveals the ways an attacker can
leverage vulnerabilities in a network to
violate a security policy. When used
with attack graph-based security
metrics, the attack graph may be used
to quantitatively assess security
relevant aspects of a network.
2012
28 ISDNS 15 Dynamic Authentication with
Sensory Information for the
Access Control Systems
Access card authentication is critical and
essential for many modern access
control systems, which have been
widely deployed in various
government, commercial and
residential environments
29 ISDNS 16 AMPLE: An Adaptive
Traffic Engineering
System Based on Virtual
Routing Topologies
In this article, we introduce AMPLE -
an efficient traffic engineering and
management system that performs
adaptive traffic control by using
multiple virtualized routing topologies
2012

Page27
30 ISDNS 17 MeasuRouting: A Framework
for Routing Assisted Traffic
Monitoring
In this paper we present a theoretical
framework for MeasuRouting.
Furthermore, as proofs-of-concept, we
present synthetic and practical
monitoring applications to showcase the
utility enhancement achieved with
MeasuRouting.
2012
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON DATAMINING
SNO P. CODE PROJECT TITLES DESCRIPTION YEAR
31 ISDDM01 Transductive Multilabel
Learning via Label Set
Propagation
In this paper, we study the problem
of transductive multilabel learning and
propose a novel solution, called
Trasductive Multilabel Classification
(TraM), to effectively assign a set of
multiple labels to each instance.
2013
32 ISDDM02 Maximum Likelihood Estimation
from Uncertain Data in the
Belief Function Framework
The proposed method is based on the
maximization of a generalized
likelihood criterion, which can be
interpreted as a degree of agreement
between the statistical model
and the uncertain observations.
2013
33 ISDDM03 Mining User Queries with
Markov Chains: Application to
Online Image Retrieval
We propose a novel method for
automatic annotation, indexing and
annotation-based retrieval of images.
The new method, that we call
Markovian Semantic Indexing (MSI), is
presented in the context of an online
image retrieval system.
2013
34 ISDDM04 A Rough-Set-Based Incremental
Approach for Updating
Approximations under Dynamic
Maintenance Environments
This paper focuses on a new incremental
method for updating approximations of
VPRS while objects in the information
system dynamically alter. It discusses
properties of information granulation
and approximations under the dynamic
environment while objects in the
universe evolve over time.
2013

Page28
35 ISDDM05 Radio Database Compression for
Accurate Energy-Efficient
Localization in Fingerprinting
Systems
The aim of the proposed technique is to
reduce the computation cost and
transmission load in the mobile-based
implementations. The presented method
may be called Block-based Weighted
Clustering (BWC) technique, which is
applied in a concatenated location-
radio signal space, and attributes
different weight factors to the location
and radio components.
2013
36 ISDDM06 Fuzzy Web Data Tables
Integration Guided by an
Ontological and Terminological
Resource
In this paper, we present the design of
ONDINE system which allows the
loading and the querying of a data
warehouse opened on the Web,
guided by an Ontological and
Terminological Resource (OTR).
2013
37 ISDDM07 A New Algorithm for Inferring
User Search Goals with
Feedback Sessions
We propose a framework to discover
different user search goals for a query by
clustering the proposed feedback
sessions. Feedback sessions are
constructed from user click-through logs
and can efficiently reflect the
information needs of users.
2013
38 ISDDM08 Information-Theoretic Outlier
Detection for Large-Scale
Categorical Data
In this paper, we propose a formal
definition of outliers and an optimization
model of outlier detection via a new
concept of holoentropy that takes both
entropy and total correlation into
consideration. We propose two practical
1-parameter outlier detection methods,
named ITB-SS and ITB-SP, which
require no user-defined parameters
for deciding whether an object is
an outlier.
2013
39 ISDDM09 Efficient Service Skyline
Computation for Composite
Service Selection
Service composition is emerging as an
effective vehicle for integrating existing
web services to create value-added and
personalized composite services. We
propose to exploit the dominance
relationship among Service providers
to find a set of “best” possible
composite services, referred to as
a composite service skyline.
2013

Page29
40 ISDDM10 Secure Provenance Transmission
for Streaming Data
In this paper, we propose a novel
approach to securely transmit
provenance for streaming data by
embedding provenance into the
interpacket timing domain while
addressing the above mentioned issues.
As provenance is hidden in another host-
medium, our solution can be
conceptualized as watermarking
technique.
2013
41 ISDDM11 Generative Models for Item
Adoptions Using Social
Correlation
We propose a social correlation
framework that considers a social
correlation matrix representing the
degrees of correlation from every user
to the user’s friends, in addition to a set
of latent factors representing topics of
interests of individual users. Based on
the framework, we develop two
generative models, namely sequential
and unified, and the corresponding
parameter estimation approaches.
2013
42 ISDDM12 Scalable Evaluation of
Trajectory Queries over
Imprecise Location Data
In this paper, we study how to efﬁciently
evaluate trajectory queries over
imprecise objects, by proposing a novel
concept, u-bisector, which is an
extension of bisector speciﬁed for
imprecise data.
2013
43 ISDDM13 Optimizing Bloom Filter
Settings in Peer-to-Peer Multi
keyword Searching
In this paper, we address the problem of
optimizing the settings of a Bloom
Filter (BF). We show that the optimal
setting of BF in terms of traffic cost is
determined by the statistical infor of
the involved inverted lists.
2012
TECHNOLOGY: DOTNET

Page30
44 ISDCC 01 Scalable and Secure Sharing of
Personal Health Records in
Cloud Computing Using
Attribute-Based Encryption
In this paper, we propose a novel
patient-centric framework and a suite of
mechanisms for data access control to
PHRs stored in semitrusted servers. To
achieve fine-grained and scalable data
access control for PHRs, we leverage
attribute-based encryption (ABE)
techniques to encrypt each patient’s
PHR file.
2013
45 ISDCC 02 A Hierarchical Approach for the
Resource Management of Very
Large Cloud Platforms
The goal of this paper is to devise
resource allocation policies for
virtualized cloud environments that
satisfy performance and availability
guarantees and minimize energy costs in
very large cloud service centers. We
present a scalable distributed
hierarchical framework based on a
mixed-integer non-linear optimization of
resource management acting at multiple
time-scales.
2013
46 ISDCC 03 Toward Secure Multikeyword
Top-kk Retrieval over Encrypted
Cloud Data
In this paper, we focus on addressing
data privacy issues using SSE. For the
first time, we formulate the privacy issue
from the aspect of similarity relevance
and scheme robustness. We observe that
server-side ranking based on order-
preserving encryption (OPE) inevitably
leaks data privacy.
2013
47 ISDCC 04 On the Performance of Byzantine
Fault-Tolerant MapReduce
MapReduce is often used for critical
data processing; However, there is
evidence in the literature that there are
arbitrary (or Byzantine) faults that may
corrupt the results of MapReduce
without being detected.
2013

Page31
48 ISDCC 05 BtrPlace: A Flexible
Consolidation Manager for
Highly Available Applications
The massive amount of resources found
in datacenters makes it possible to
provide high availability to multi-tier
applications. Virtualizing these
applications makes it possible to
consolidate them on servers, reducing
runtime costs. We present BtrPlace, a
flexible consolidation manager that is
customized through configuration scripts
written by the application and datacenter
administrators.
2013
49 ISDCC 06 Optimal Multiserver
Configuration for Profit
Maximization in Cloud
Computing
In this paper, we study the problem of
optimal multiserver configuration for
profit maximization in a cloud
computing environment. To maximize
the profit, a service provider should
understand both service charges and
business costs, and how they are
determined by the characteristics of the
applications and the configuration of a
multiserver system.
2013
50 ISDCC 07 Performance Analysis of Cloud
Computing Centers Using
M/G/m/m+r Queuing Systems
In this paper, we requests, we describe a
novel approximate analytical model for
performance evaluation of cloud server
farms and solve it to obtain accurate
estimation of the complete probability
distribution of the request response time
and other important performance
indicators.
2012
TECHNOLOGY: DOTNET
51 ISDMC01 EAACK—A Secure Intrusion
Detection System for MANETs
In this paper, Access card
authentication is critical and
essential for many modern access
control systems, which have been widely
deployed in various governments,
commercial and residential
environments.
2013

Page32
52 ISDMC02 Design and Performance
Evaluation of Overhearing-Aided
Data Caching in Wireless Ad
Hoc Networks
In this paper, we propose an efficient
data caching algorithm which makes use
of the overhearing property of wireless
communication to improve caching
performance.
2013
53 ISDMC03 Toward Privacy Preserving and
Collusion Resistance in a
Location Proof Updating System
We propose A Privacy-Preserving
Location proof Updating System
(APPLAUS) in which collocated
Bluetooth enabled mobile devices
mutually generate location proofs and
send updates to a location proof server.
2013
54 ISDMC04 Game-Based Broadcast over
Reliable and Unreliable Wireless
Links in Wireless Multihop
Networks
This paper addresses the minimum
transmission broadcast problem in
wireless networks and presents efficient
solutions, including an optimal
broadcast scheme and a distributed
game-based algorithm. Distinct from
related work in the literature which
typically assumes wireless links are
reliable, we address the issue of
broadcasting over both reliable wireless
links and unreliable
wireless links.
2013
55 ISDMC05 Performance Modeling of Delay-
Tolerant Network Routing via
Queuing Petri Nets
With the advent of wireless technologies
such as Wi-Fi Direct and Near Field
Communication (NFC), infrastructure-
less Peer-to-Peer (P2P) content sharing
among mobile devices is set to become
more ubiquitous. Delay-Tolerant
Networks (DTNs), with their
opportunistic message forwarding
strategy, can be leveraged to provide
seamless connectivity in such scenarios.
2013
56 ISDMC06 United We Stand: Intrusion
Resilience in Mobile Unattended
WSNs
In this paper, we focus on intrusion
resilience in Mobile Unattended
Wireless Sensor Networks (_UWSNs),
where sensors move according to some
mobility models. Note that such a
mobility feature could be independent
from security
2013
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING

Page33
57 ISDIP 01 Image Denoising With Dominant
Sets by a Coalitional Game
Approach
Dominant sets are a new graph partition
method for pairwise data clustering
proposed by Pavan and Pelillo. We
address the problem of dominant sets
with a coalitional game model, in which
each data point is treated as a player
and similar data points are encouraged
to group together for cooperation.
2013
58 ISDIP 02 Hierarchical super-resolution-
based inpainting
This paper introduces a novel
framework for examplar-based
inpainting. It consists in performing
ﬁrst the inpainting on a coarse version
of the input image. A hierarchical
super-resolution algorithm is then used
to recover details on the missing areas.
2013
59 ISDIP 03 A Novel Joint Data-Hiding and
Compression Scheme Based on
SMVQ and Image Inpainting
In this paper, we propose a novel joint
data-hiding and compression scheme
for digital images using side match
vector quantization and image
inpainting. The two functions of data
hiding and image compression can be
integrated into one single module
seamlessly.
2013
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON GRID COMPUTING
60 ISDGC01 Evolving Smart Grid
Information Management
Cloudward: A Cloud
Optimization Perspective
In this paper, we study an optimization
problem of leveraging the cloud domain
to reduce the cost of information
management in the SG. We propose a
cloud-based SG information
management model and present a cloud
and network resource optimization
framework to solve the cost reduction
problem in cloud-based SG information
storage and computation.
2013

Page34
61 ISDGC02 Swarm Fuzzy Systems:
Knowledge Acquisition in
Fuzzy Systems and its
Applications in Grid Computing
This work proposes the use of bio-
inspired knowledge acquisition for
Fuzzy Systems founded on Swarm
Intelligence Particle Swarm
Optimization (SI-PSO). Swarm-based
models consider knowledge entities as
particles that move in the space to reach
the higher quality.
2013
62 ISDGC03 CONSUMER: A Novel Hybrid
Intrusion Detection System for
Distribution Networks in Smart
Grid.
This paper is thus motivated to
investigate the currently-studied FDI
attack by introducing the Combination
SUM of Energy proﬁles
(CONSUMER) attack in a coordinated
manner on a number of customers’
smart meters that results in lower
energy consumption reading for the
attacker and higher for the others in a
neighborhood
2013
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
SNO P.CODE PROJECT TITLES DESCRIPTION YEAR
63 ISDSE 01 Self-Organizing Roles on Agile
Software Development Teams
Self-organizing teams have been
recognized and studied in various forms
as autonomous groups in socio-technical
systems, enablers of organizational
theories, agents of knowledge
management, and as examples of
complex-adaptive systems.
2013
64 ISDSE 02 Generating Test Cases for
Real-Time Systems Based on
Symbolic Models
In this paper, a symbolic model for
conformance testing of real-time
systems software named TIOSTS that
addresses both data and time
symbolically is presented. Moreover, a
test case generation process is deﬁned to
select more general test cases with
variables and parameters that can be
instantiated at testing execution time.
2013

Page35
65 ISDSE 03 A Theoretical and Empirical
Analysis of the Role of Test
Sequence Length in Software
Testing for Structural Coverage
In this paper, we analyze the role that
the length plays in software testing, in
particular branch coverage. We show
that, on “difficult” software testing
Bench marks, longer test sequences
make their testing trivial.
2013
66 ISDSE 04 Automatic Detection of
Unsafe Dynamic Component
Loadings
In this paper, we present the first
automated technique to detect
vulnerable and unsafe dynamic
component loadings. Our analysis has
two phases: 1) apply dynamic binary
instrumentation to collect runtime
information on component loading and
2) analyze the collected information to
detect vulnerable component loadings.
2013
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON MULTIMEDIA
SNO P.CODE PROJECT TITLES DESCRIPTION YEAR
67 ISDMM01 Group Delay based Methods for
Speaker Segregation and its
Application in Multi-medi
Information Retrieval
A novel method of single channel
speaker segregation using the group
delay cross correlation function is
proposed in this paper. The group
delay function, which is the negative
derivative of the phase spectrum yields
robust spectral estimates.
2013
68 ISDMM02 Query-Adaptive Image Search
With Hash Codes
This paper introduces an approach that
enables query-adaptive ranking of the
returned images with equal Hamming
distances to the queries. This is
achieved by ﬁrstly offline learning
bitwise weights of the hash codes for a
diverse set of predeﬁned semantic
concept classes.
2013

Page36
69 ISDMM03 Robust Spatial Consistency Graph
Model for Partial Duplicate Image
Retrieval
Partial duplicate images often have
large non-duplicate regions and small
duplicate regions with random
rotation, which lead to the following
problems: 1) large number of noisy
features from the nonduplicate
regions; 2) small number of
representative features from the
duplicate regions; 3) randomly rotated
or deformed duplicate regions.
2013
DOTNET APPLICATION PROJECTS
TECHNOLOGY : DOTNET
DOMAIN : NON IEEE BASED PROJECTS
SNO P.CODE PROJECT TITLE
1 ISNID 01 Security Evaluation For Graphical Password
2 ISNID 02 Multi Level Authentication Method For Banking Applications
3 ISNID 03 Spoken Vibration To Access Personal Computer
4 ISNID 04 Effective Software Merging In The Presence Of Object-Oriented Refactoring
5 ISNID 05 Electronic Money Market Management System
6 ISNID 06 Website Positioning System.
7 ISNID 07 Online Financial Protection Management System
8 ISNID 08
The Effect of Virtual Community Culture & Group Cohesion on Knowledge
Sharing
9 ISNID 09 Knowledge-Based Integrated Financial Forecasting System
10 ISNID 10 Multi Track Trading Sytem.
11 ISNID 11
Grid Accounting Services Architecture (Gasa) For Distributed Systems Sharing
and Integration

Page37
12 ISNID 12
Reducing Transfer Time In Wireless Networks By Simultaneous Multiple Packet
Transmission
13 ISNID 13 Detecting Lost Items In Shopping Carts
14 ISNID 14 Systematized Collection Of Student Using Internet And Intranet
15 ISNID 15 Load Balancing In Parallel Computers
16 ISNID 16 Supervised Neighborhood Topology Learning For Human Action Recognition
17 ISNID 17 Enhancing Download Performance In An Intranet
18 ISNID 18 Synthesis Of Few-Layer Gase Nanosheets For High Performance Photo detectors.
19 ISNID 19 The Color Blindness Removal Technique In Image
21 ISNID 20 Enhanced Security Control System In The Online Exam
22 ISNID 21 Webpage Understanding Beyond Page Level Search
23 ISNID 22
A Novel Framework For Semantic Annotation And Personalized Retrieval Of
Sports Video
24 ISNID 23 Anticipating Digitized Pictures From Cracks Based On Edge Detection Method
25 ISNID 24 Enhanced Hierarchical Multi Pattern Matching Algorithm
26 ISNID 25 Characterizing Files In The Modern Gnutella Network
27 ISNID 26 Semantics-Based Access Control Approach For Web Service
28 ISNID 27 Web Services Such As E-Commerce Applications
29 ISNID 28 Detecting Traffic Anomalies Through Aggregate Analysis Of Packet Header Data
30 ISNID 29 Managing Central Monitoring In Distributed Systems
31 ISNID 30 Semantic Web Technologies for E-Learning
32 ISNID 31 Bridging Information Gap
33 ISNID 32
Downlink Performance Of Wireless Networks Using MPT [Multiple Packet
Trans]
34 ISNID 33 Mobility Reduces Uncertainty In Manets
35 ISNID 34 Post-Mining Of Association Rules Using Ontologies
36 ISNID 35 Authentication Protocol for Wireless Sensor Networks
37 ISNID 36
Keyword Ranking Analysis for Orthogonal Data Embedding For Binary Images
In Morphological Transform Domain A High Capacity Approach
38 ISNID 37 Identification And Removal Of Cracks In Digital Images
39 ISNID 38 Proactive Data Quality Management For Data Warehouse Systems .
40 ISNID 39 Path-History-Based Access Control For Mobile Agents

Page38
NS2
41 ISNID 40 Distributed Collaborative Distributed Editing System
42 ISNID 41 Web Ranking Software
43 ISNID 42
Evaluating The Scalability Of P2P Based Video On Demand Service Using Real
Traces
44 ISNID 43 Efficient Learning-Based Image Enhancement
45 ISNID 44 Virtual Observers In A Mobile Surveillance System
46 ISNID 45 Image Watermarking Systems
47 ISNID 46 Content-Based Routing In Mobile Ad Hoc Networks
48 ISNID 47 Human Resources Software Systems
49 ISNID 48 A Path Identiﬁcation Mechanism To Defend Against DDos Attacks
50 ISNID 49 The Effect of Pairs in Program Design Tasks
TECHNOLOGY : NS2
DOMAIN : IEEE TRANSACTIONS MOBILE AD HOC NETWORKS
SNO P.CODE PROJECT TITLE YEAR
01 ISNMA 01
Cluster –Based Certificate Revocation With Vindication Capability For
Mobile Ad- Hoc Networks
2013
02 ISNMA 02 Eaack- A Secure Intrusion –Detection System For Manets 2013
03 ISNMA 03 Genetic Algorithm For Energy Efficient Qos Multicast Routing 2013
04 ISNMA 04 Evolving Network Model with Local-Area Preference for MANTET 2013
05 ISNMA 05 Light Weight Sybil Attack Detection In Manets 2013
06 ISNMA 06 Self –Organizing Seamless Multimedia Streaming In Dense Manets 2013
07 ISNMA 07
A Neighbor Coverage – Based Probabilistic Rebroadcast For Reducing
Routing Overhead In Mobile Ad –Hoc Networks
2013
08 ISNMA 08 Routing Protocol Based On Grover’s Searching Algorithm For MANET 2013
09 ISNMA 09 New Approach For MANET Unity Issue In Auspicious Environment 2013
10 ISNMA 10 New Power –Aware Multicast Algorithm For MANET 2013
11 ISNMA 11 Enhanced Olsr For Defense Against Dos Attack In Ad Hoc Networks 2013
12 ISNMA 12
An Adaptive Hello Messaging Scheme For Neighbor Discovery In On-
Demand Manet Routing Protocols
2013

Page39
TECHNOLOGY : NS2
DOMAIN : IEEE TRANSACTIONS ON WIRELESS SENSOR NETWORK
16 ISNWS 01 Vampire Attacks: Draining Life From Wireless Ad Hoc Sensor Networks 2013
17 ISNWS 02
Classification And Experimental Analysis For Clone Detection
Approaches In Wireless Sensor Networks
2013
18 ISNWS 03
Channel Aware Encryption And Decision Fusion For Wireless Sensor
Network
2013
19 ISNWS 04
Energy Efficient Transmission Scheme For Mobile Data Gathering In
Wireless Sensor Networks
2013
20 ISNWS 05
Path Planning Algorithm For Mobile Anchor –Based Localization In
Wireless Sensor Net Works
2013
21 ISNWS 06
Decentralized Hypothesis Testing In Wireless Sensor Networks In The
Presence Of Misbehaving Nodes
2013
22 ISNWS 07
Tour Planning For Mob Data- Gathering Mechanisms In Wireless Sensor
Network
2013
23 ISNWS 08
Joint Contention And Sleep Control For Lifetime Maximization In
2013
24 ISNWS 09
Exploiting Ubiquitous Data Collection For Mob Users In Wireless Sensor
Network
2013
25 ISNWS 10
Enhancement Of Lifetime Using Duty Cycle And Network Coding In
2013
26 ISNWS 11
Clustering Algorithm For Non-Uniformly Distributed Nodes In wireless
Sensor Network
2013
27 ISNWS 12 Energy –Efficient Routing Protocols In Wireless Sensor Networks Survey 2013
28 ISNWS 13
Load Balanced Clustering Algorithm With Distributed Self – Organization
for Wireless Sensor Network
2013
29 ISNWS 14 A Light Weight Dependable Trust System For Clustered WSN 2013
13 ISNMA 13
Hybrid Flooding Scheme For Mobile Ad Hoc Networks –March 2013eight
Sybil Attack Detection In Manets
2013
14 ISNMA 14 Self –Organising Seamless Multimedia Streaming In Dense Manets 2013
15 ISNMA 15
A Neighbor Coverage – Based Probabilistic Rebroadcast For Reducing
Routing Overhead In Mobile Ad –Hoc Networks 2013

Page40
TECHNOLOGY : NS2
DOMAIN : IEEE TRANSACTIONS ON VEHICULAR AD HOC NETWORKS
30 ISNVA 01
EMAP: Expedite Message Authentication Protocol For Vehicular Ad Hoc
Network
2013
31 ISNVA 02
Evaluation Of The Use Of Guard Nodes For Securing The Routing In
Vanet
2013
32 ISNVA 03
TEAM: Trust Extended Authentication Mechanism for Vehicular Ad Hoc
Network
2013
33 ISNVA 04 Discovery And Verification Of Neighbor Positions In MANET 2013
MORE TITLES VISIT OUR WEBSITE: www.irisprojects.com

IEEE 2014 Project Titles for ME,M.Tech,BE,B.Tech,M.Sc,MCA,IEEE Java Project titles With Abstract, IEEE Dotnet Project Titles, CSE, IT Projects

More Related Content

What's hot

Similar to IEEE 2014 Project Titles for ME,M.Tech,BE,B.Tech,M.Sc,MCA,IEEE Java Project titles With Abstract, IEEE Dotnet Project Titles, CSE, IT Projects

Recently uploaded

IEEE 2014 Project Titles for ME,M.Tech,BE,B.Tech,M.Sc,MCA,IEEE Java Project titles With Abstract, IEEE Dotnet Project Titles, CSE, IT Projects