IRIS SOLUTIONS - IEEE 2012 ENGINEERING PROJECT TITLES FOR CSE, IT

Iris Solutions
Project Titles For ME, M.Tech, BE, B.Tech, M.Sc, MCA

TABLE OF CONTENTS

ABOUT IRIS 2

JAVA
IEEE TRANSACTIONS ON NETWORKING 3
IEEE TRANSACTIONS ON NETWORK SECURITY 6
IEEE TRANSACTIONS ON DATA MINING 9
IEEE TRANSACTIONS ON MOBILE COMPUTING 13
IEEE TRANSACTIONS ON IMAGE PROCESSING 15
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 16
IEEE TRANSACTIONS ON CLOUD COMPUTING 17
IEEE TRANSACTIONS ON GRID COMPUTING 18
J2EE
IEEE TRANSACTIONS 19
ANDROID
DOTNET
IEEE TRANSACTIONS ON NETWORKING 21
IEEE TRANSACTIONS ON NETWORK SECURITY 24
IEEE TRANSACTIONS ON DATA MINING 27
IEEE TRANSACTIONS ON MOBILE COMPUTING 30
IEEE TRANSACTIONS ON IMAGE PROCESSING 33
IEEE TRANSACTIONS ON CLOUD COMPUTING 34
IEEE TRANSACTIONS ON GRID COMPUTING 35
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 36
DOTNET APPLICATION PROJECTS (NON-IEEE) 38
NS2
1

Page

#73/1, 3rd Floor, Salai Road, Thillai Nagar, Trichy-18 Ph: 0431-4023660
Mail: info@irisprojects.com website: www.irisprojects.com,
Our branches: Kovai: 9943 357 357, Tanjore: 9943 317 317, , Trichy: 9943 314 314,
Chennai, Madurai, Nellai, Erode, Salem

Iris Solutions
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.
2
Page


Iris Solutions

CONTACT DETAILS
Trichy:

Iris Solutions,
#73/1, 3rd Floor, Salai Road,
Thillai Nagar, [Near Hotel Kannappa]
Trichy-18.
Ph: 0431- 4023660,
Mob: 9943 314 314

Kovai:

Iris Solutions,
#165, 5th Street, [Near Hotel LALA]
Gandhipuram,
Coimbatore-12.
Ph: 0422- 4372816
Mob: 9943 357 357

Tanjore:

Iris Solutions,
#1520,South Rampart,
[ Near Siva Siva Chidambaram Jewellery]
Tanjore -1.
Ph : 04362-300609
Mob : 9943 317 317
3
Page


Iris Solutions

JAVA
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON NETWORKING

SNO P.CODE TITLES DESCRIPTION YEAR
1 ISJNW01 Balancing the Trade-Offs In This Project, we propose schemes to 2012
between Query Delay and Data balance the trade-offs between data
Availability in MANETs 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
2 ISJNW02 MeasuRouting: A Framework In this paper we present a theoretical 2012
for Routing Assisted Traffic framework for MeasuRouting.
Monitoring. Furthermore, as proofs-of-concept, we
present synthetic and practical
monitoring applications to showcase the
utility enhancement achieved with
MeasuRouting.
3 ISJNW03 Cooperative Profit Sharing in We model Optimal cooperation using 2012
Coalition-Based Resource the theory of transferable payoff
Allocation in Wireless coalitional games. We show that the
Networks. optimum cooperation strategy, which
involves the acquisition, deployment,
and allocation of the channels and base
stations (to customers), can be
computed as the solution of a concave
or an integer optimization. We next
show that the grand coalition is stable in
many different settings.
4 ISJNW04 Bloom Cast: Efficient Full-Text In this paper we propose Bloom Cast, 2012
Retrieval over Unstructured an efficient and effective full-text
P2Ps with Guaranteed Recall retrieval scheme, in unstructured P2P
networks. Bloom Cast is effective
because it guarantees perfect recall rate
with high probability.
4
Page


Iris Solutions
5 ISJNW05 On Optimizing Overlay We propose a novel overlay formation 2012
Topologies for Search in algorithm for unstructured P2P
Unstructured Peer-to-Peer networks. Based on the file sharing
Networks. pattern exhibiting the power-law
property, our proposal is unique in that
it poses rigorous performance
guarantees.
6 ISJNW06 An MDP-Based Dynamic In this paper, we propose an automated
Optimization Methodology for Markov Decision Process (MDP)-based
Wireless Sensor Networks methodology to prescribe optimal
sensor node operation to meet
application requirements and adapt to
changing environmental stimuli. 2012
Numerical results confirm the
optimality of our proposed methodology
and reveal that our methodology more
closely meets application requirements
compared to other feasible policies.
7 ISJNW07 Obtaining Provably Legitimate In this paper, we address The Internet
Internet Topologies Topology Problems by providing a
framework to generate small, realistic,
and policy-aware topologies. We
propose HBR, a novel sampling
method, which exploits the inherent
2012
hierarchy of the policy-aware Internet
topology. We formally prove that our
approach generates connected and
legitimate topologies, which are
compatible with the policy-based
routing conventions and rules.
8 ISJNW08 Extrema Propagation: Fast This paper introduces Extrema
Distributed Estimation of Sums Propagation, a probabilistic technique
and Network Sizes. for distributed estimation of the sum of
positive real numbers. The technique
relies on the exchange of duplicate
insensitive messages and can be applied
in flood and/or epidemic settings, where
multipath routing occurs; it is tolerant of
message loss; it is fast, as the number of
2012
message exchange steps can be made
just slightly above the theoretical
minimum; and it is fully distributed,
with no single point of failure and the
result produced at every node.
5
Page


Iris Solutions
9 ISJNW09 Latency Equalization as a New We propose a Latency Equalization
Network Service Primitive. (LEQ) service, which equalizes the
perceived latency for all clients
participating in an interactive network 2012
application. To effectively implement
the proposed LEQ service, network
support is essential.
10 ISJNW10 Grouping-Enhanced Resilient This paper proposes a scheme, referred
Probabilistic En-Route Filtering to as Grouping-enhanced Resilient
of Injected False Data in WSNs Probabilistic En-route Filtering
(GRPEF). In GRPEF, an efficient
distributed algorithm is proposed to
group nodes without incurring extra
2012
groups, and a multi axis division based
approach for deriving location-aware
keys is used to overcome the threshold
problem and remove the dependence on
the sink immobility and routing
protocols
11 ISJNW11 On Achieving Group-Strategy A multicast scheme is stragegyproof if
proof Multicast. no receiver has incentive to lie about
her true valuation. It is further group
strategyproof if no group of colluding
2012
receivers has incentive to lie. We study
multicast schemes that target group
strategyproofness, in both directed and
undirected networks.
12 ISJNW12 Distributed -Optimal User In this paper, we develop a framework
Association and Cell Load for user association in infrastructure-
Balancing in Wireless based wireless networks, specifically
Networks. focused on flow-level cell load
balancing under spatially in
homogeneous traffic distributions. Our 2012
work encompasses several different user
association policies: rate-optimal,
throughput-optimal, delay-optimal, and
load-equalizing, which we collectively
denote α-optimal user association
13 ISJNW13 Opportunistic Flow-Level In this paper, we propose Consistent
Latency Estimation Using Net Flow (CNF) architecture for
Consistent Net Flow measuring per-flow delay
measurements within routers. CNF
utilizes the existing Net Flow
2012
architecture that already reports the first
and last timestamps per flow, and it
proposes hash-based sampling to ensure
6

that two adjacent routers record the
Page

same flows.

Iris Solutions
14 ISJNW14 Metadata Distribution and This paper makes two contributions.
Consistency Techniques for First, we present a dynamic metadata
Large-Scale Cluster File distribution policy (DDG) to improve
Systems the metadata throughput by using a
triple-defined distribution. Second, 2011
S2PC-MP reduces the overhead of
failure-free execution and ensures quick
recovery in the presence of metadata
server failures or client failures.
15 ISJNW15 Self-Reconfigurable Wireless Cooperative Cache can improve the
Mesh Networks system performance in wireless P2P
networks. We propose a novel
asymmetric cooperative cache 2011
approach, where the data requests are
transmitted to the cache layer on every
node.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY

16 ISJNS01 Design and Implementation of We have designed and implemented 2012
TARF: A Trust-Aware Routing TARF, a robust trust-aware routing
Framework for WSNs framework for dynamic wireless sensor
networks (WSN). Without tight time
synchronization or known Geographic
information, TARF provides
trustworthy and energy-efficient route.
Most importantly, TARF proves
effective against those harmful attacks
developed out of identity deception; the
resilience of TARF is verified through
extensive evaluation with both
simulation and empirical experiments
on large-scale WSNs under various
scenarios including mobile and RF-
shielding network conditions.
17 ISJNS02 Risk-Aware Mitigation for In this paper, we propose a risk-aware 2012
MANET Routing Attacks response mechanism to systematically
Cope with the identified routing attacks.
Our risk-aware approach is based on an
extended Dempster-Shafer
mathematical theory of Evidence
introducing a notion of importance
factors.
7
Page


Iris Solutions
18 ISJNS03 Survivability Experiment and In this paper, we study survivability 2012
Attack Characterization for issues for RFID. We first present an
RFID. RFID survivability experiment to define
a foundation to measure the degree of
survivability of an RFID system under
varying attacks. Then we model a series
of malicious scenarios using stochastic
process algebras and study the different
effects of those attacks on the ability of
the RFID system to provide critical
services even when parts of the system
have been damaged.
19 ISJNS04 Detecting and Resolving In this paper, we represent an 2012
Firewall Policy Anomalies innovative policy anomaly management
framework for firewalls, adopting a
rule-based segmentation technique to
identify policy anomalies and derive
effective anomaly resolutions. In
particular, we articulate a grid-based
representation technique, providing an
intuitive cognitive sense
about policy anomaly.
20 ISJNS05 Automatic Reconfiguration for In this paper, we present a complete 2012
Large-Scale Reliable Storage solution for dynamically changing
Systems 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.
21 ISJNS06 Detecting Anomalous Insiders In this paper, we introduce the 2012
in Collaborative Information community anomaly detection system
Systems. (CADS), an unsupervised learning
framework to detect insider threats
based on the access logs of
collaborative environments. The
framework is based on the observation
that typical CIS users tend to form
community structures based on the
subjects accessed
22 ISJNS07 An Extended Visual Conventional visual secret sharing 2012
Cryptography Algorithm for schemes generate noise-like random
General Access Structures. pixels on shares to hide secret images. It
suffers a management problem. In this
paper, we propose a general approach to
solve the above- mentioned problems;
the approach can be used for binary
8

secret images in non computer-aided
Page

decryption environments.

Iris Solutions
23 ISJNS08 Mitigating Distributed Denial of In this paper, we extend port-hopping to 2012
Service Attacks in Multiparty support multiparty applications, by
Applications in the Presence of proposing the BIGWHEEL algorithm,
Clock Drift for each application server to
communicate with multiple clients in a
port-hopping manner without the need
for group synchronization. Furthermore,
we present an adaptive algorithm,
HOPERAA, for enabling hopping in the
presence of bounded asynchrony,
namely, when the communicating
parties have clocks with clock drifts.
24 ISJNS09 On the Security and Efficiency Content distribution via network coding 2012
of Content Distribution via has received a lot of attention lately.
Network Coding 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.
Therefore, content verification is an
important and practical issue when
network coding is employed.
25 ISJNS10 Packet-Hiding Methods for In this paper, we address the problem 2012
Preventing Selective Jamming of selective jamming attacks in wireless
Attacks. networks. In these attacks, the adversary
is active only for a short period of time,
selectively targeting messages of high
importance.
26 ISJNS11 Stochastic Model of Multi virus In this paper, we study multi virus 2012
Dynamics spreading dynamics, where multiple
viruses attempt to infect computers
while possibly combating against each
other because, for example, they are
controlled by multiple botmasters.
27 ISJNS12 Peering Equilibrium Multipath Our scheme relies on a game theory 2012
Routing: A Game Theory modeling, with a non-cooperative
Framework for Internet Peering potential game considering both routing
Settlements and congestions costs. We compare
different PEMP policies to BGP
Multipath schemes by emulating a
realistic peering scenario.
28 ISJNS13 Modeling and Detection of Our scheme uses the Power Spectral 2011
Camouflaging Worm Density (PSD) distribution of the scan
traffic volume and its corresponding
Spectral Flatness Measure (SFM) to
9

distinguish the C-Worm traffic from
Page

background traffic. The performance

Iris Solutions
data clearly demonstrates that our
scheme can effectively detect the C-
Worm propagation.two heuristic
algorithms for the two sub problems.
29 ISJNS14 Analysis of a Botnet Takeover We present the design of an advanced 2011
hybrid peer-to-peer botnet. Compared
with current botnets, the proposed
botnet is harder to be shut down,
monitored, and hijacked. It provides
individualized encryption and control
traffic dispersion.
30 ISJNS15 Efficient Network Modification As real-time traffic such as video or 2011
to Improve QoS Stability at voice increases on the Internet, ISPs are
Failures 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.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON DATA MINING

31 ISJDM01 A Survival Modeling Approach In this paper, we propose a survival 2012
to Biomedical modeling approach to promoting
Search Result Diversification ranking diversity for biomedical
Using Wikipedia information retrieval. The proposed
approach concerns with finding relevant
documents that can deliver more
different aspects of a query. First, two
probabilistic models derived from the
survival analysis theory are proposed
for measuring aspect novelty.
32 ISJDM02 A Fuzzy Approach for In this paper, we propose a new fuzzy 2012
Multitype Relational clustering approach for multitype
Data Clustering relational data (FC-MR). In FC-MR,
different types of objects are clustered
simultaneously. An object is assigned a
large membership with respect to a
cluster if its related objects in this
cluster have high rankings.
10
Page


Iris Solutions
33 ISJDM03 Anonimos: An LP-Based We present Anonimos, a Linear 2012
Approach for Programming-based technique for
Anonymizing Weighted Social anonymization of edge weights that
Network Graphs preserves linear properties of graphs.
Such properties form the foundation of
many important graph-theoretic
algorithms such as shortest paths
problem, k-nearest neighbors, minimum
cost spanning Tree and maximizing
information spread.
34 ISJDM04 A Methodology for Direct and In this paper, we tackle discrimination 2012
Indirect Discrimination prevention in data mining and propose
Prevention in Data Mining new techniques applicable for direct or
indirect Discrimination prevention
individually or both at the same time.
We discuss how to clean training
datasets and outsourced datasets in such
a way that direct and/or indirect
discriminatory decision rules are
converted to legitimate (non-
discriminatory) Classification rules.
35 ISJDM05 Mining Web Graphs for In this paper, aiming at providing a 2012
Recommendations general framework on mining Web
graphs for recommendations, (1) we
first propose a novel diffusion method
which propagates similarities between
different nodes and generates
recommendations; (2) then we illustrate
how to generalize different
recommendation problems into our
graph diffusion framework.
36 ISJDM06 Prediction of User’s Web- Predicting user's behavior while serving 2012
Browsing Behavior: the Internet can be applied effectively in
Application of Markov Model various critical applications. Such
application has traditional tradeoffs
between modeling complexity and
prediction accuracy. In this paper, we
analyze and study Markov model and
all- Kth Markov model in Web
prediction. We propose a new modified
Markov model to alleviate the issue of
scalability in the number of paths.
37 ISJDM07 Prototype Selection for Nearest This paper provides a survey of the 2012
Neighbor prototype selection methods proposed
Classification: Taxonomy and in the literature from a theoretical and
11

Empirical Study empirical point of view. Considering a
theoretical point of view, we propose a
Page

taxonomy based on the main

Iris Solutions
characteristics presented in prototype
selection and we analyze their
advantages and drawbacks, the nearest
neighbor classifier suffers from several
drawbacks such as high storage
requirements, low efficiency in
classification response, and low noise
Tolerance.
38 ISJDM08 Query Planning for Continuous We present a low-cost, scalable 2012
Aggregation technique to answer continuous
Queries over a Network of Data aggregation queries using a network of
Aggregators aggregators of dynamic data items. In
such a network of data aggregators,
each data aggregator serves a set of data
items at specific coherencies.
39 ISJDM09 Revealing Density-Based In this paper, we introduce a novel 2012
Clustering Structure density-based network clustering
from the Core-Connected Tree method, called gSkeletonClu (graph-
of a Network skeleton based clustering). By
projecting an undirected network to its
core-connected maximal spanning tree,
the clustering problem can be converted
to detect core connectivity components
on the tree.
40 ISJDM10 Scalable Learning of Collective This study of collective behavior is to 2012
Behavior understand how individuals behave in a
social networking environment. Oceans
of data generated by social media like
Facebook, Twitter, Flickr, and YouTube
present opportunities and challenges to
study collective behavior on a large
scale. In this work, we aim to learn to
predict collective behavior in social
media
41 ISJDM11 Weakly Supervised Joint This paper proposes a novel 2012
Sentiment-Topic probabilistic modeling framework
Detection from Text called joint sentiment-topic
(JST) model based on latent Dirichlet
allocation (LDA), which detects
sentiment and topic simultaneously
from text. A reparameterized version of
the JST model called Reverse-JST,
obtained by reversing the sequence of
sentiment and topic generation in the
modeling process, is also studied.
12
Page


Iris Solutions
42 ISJDM12 Effective Navigation of Query Ranking and categorization, which can 2011
Results Based on Concept also be combined, have been proposed
Hierarchies to alleviate this information overload
problem. Results categorization for
biomedical databases is the focus of this
work. A natural way to organize
biomedical citations is according to
their MeSH annotations.
43 ISJDM13 Automatic Discovery of We propose a novel, automatically 2011
Personal Name Aliases from the extracted lexical pattern-based approach
Web to efficiently extract a large set of
candidate aliases from snippets
retrieved from a web search engine. We
define numerous ranking scores to
evaluate candidate aliases using three
approaches: lexical pattern frequency,
word co-occurrences in an anchor text
graph, and page counts on the web
44 ISJDM14 IR-Tree: An Efficient Index for Given a geographic query that is 2011
Geographic Document Search composed of query keywords and a
location, a geographic search engine
retrieves documents that are the most
textually and spatially relevant to the
query keywords and the location,
respectively, and ranks the retrieved
documents according to their joint
textual and spatial relevances to the
query.
45 ISJDM15 Anonymous Publication of The problem of anonymizing sparse, 2011
Sensitive Transactional Data high dimensional transactional data is
solved through methods based on 1)
local NN-search and 2) global data
reorganization.

46 ISJDM16 Managing Multidimensional A P2P-based framework supporting the 2011
Historical Aggregate Data in extraction of aggregates from historical
Unstructured P2P Networks multidimensional data is proposed, which
provides efficient robust query evaluation
13
Page


Iris Solutions
TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING

47 ISJMC01 The Boomerang Protocol: We present the boomerang protocol to 2012
Tying Data to Geographic efficiently retain information at a
Locations in Mobile particular geographic location in a
Disconnected Networks sparse network of highly mobile nodes
without using infrastructure networks.
To retain information around certain
physical location, each mobile device
passing that location will carry the
information for a short while.
48 ISJMC02 Nature-Inspired Self- In this paper, we present new models 2012
Organization, Control, and and algorithms for control and
Optimization in Heterogeneous optimization of a class of next
Wireless Networks generation communication networks:
Hierarchical Heterogeneous Wireless
Networks (HHWNs), under real-world
physical constraints. Two biology-
inspired techniques, a Flocking
Algorithm (FA) and a Particle Swarm
Optimizer (PSO), are investigated in
this context.
49 ISJMC03 A Cost Analysis Framework for In this paper, we have developed 2012
NEMO analytical framework to measure the
Prefix Delegation-Based costs of the basic protocol for Network
Schemes Mobility (NEMO), and four
representative prefix delegation-based
schemes. Our results show that cost of
packet delivery through the partially
optimized route dominates over other
costs.
50 ISJMC04 OMAN: A Mobile Ad Hoc In this paper, we present a high-level 2012
Network Design System view of the OMAN architecture, review
specific mathematical models used in
the network representation, and show
how OMAN is used to evaluate
tradeoffs in MANET design.
Specifically, we cover three case studies
of optimization. 1-robust power control
under uncertain channel information for
a single physical layer snapshot. 2-
scheduling with the availability of
directional radiation patterns. 3-
14

optimizing topology through movement
Page

planning of relay nodes.


Iris Solutions
51 ISJMC05 Energy-Efficient Cooperative In this paper, we formulate the resource 2012
Video Distribution with allocation problem for general multihop
Statistical QoS Provisions over multicast network flows and derive the
Wireless Networks optimal solution that minimizes the total
energy consumption while guaranteeing
a statistical end-to-end delay bound on
each network path.
52 ISJMC06 Leveraging the Algebraic In this paper, we consider the 2012
Connectivity implications of spectrum heterogeneity
of a Cognitive Network for on connectivity and routing in a
Routing Design Cognitive Radio Ad Hoc Network
(CRAHN). We study the Laplacian
spectrum of the CRAHN graph when
the activity of primary users is
considered. We introduce the cognitive
algebraic connectivity, i.e., the second
smallest eigenvalue of the Laplacian of
a graph, in a cognitive scenario.
53 ISJMC07 Efficient Virtual Backbone In this paper, we will study a directional 2012
Construction virtual backbone (VB) in the network
with Routing Cost Constraint in where directional antennas are used.
Wireless When constructing a VB, we will take
Networks Using Directional routing and broadcasting into account
Antennas since they are two common operations
in wireless networks. Hence, we will
study a VB with guaranteed routing
costs, named α Minimum rOuting Cost
Directional VB (α-MOC-DVB).
54 ISJMC08 Stateless Multicast Protocol for In this paper, we have developed a 2012
Ad Hoc Networks. stateless receiver-based multicast
(RBMulticast) protocol that simply uses
a list of the multicast members' (e.g.,
sinks') addresses, embedded in packet
headers, to enable receivers to decide
the best way to forward the multicast
traffic.
55 ISJMC09 Detection of Selfish CCA tuning can be exploited by selfish 2012
Manipulation of Carrier nodes to obtain an unfair share of the
Sensing in 802.11 Networks available bandwidth. Specifically, a
selfish entity can manipulate the CCA
threshold to ignore ongoing
transmissions; this increases the
probability of accessing the medium
and provides the entity a higher, unfair
share of the bandwidth.
15

56 ISDMC10 Message-Efficient Location A better prediction model can 2011
Prediction for Mobile Objects in significantly reduce power consumption
Page

Wireless Sensor Networks in a wireless sensor network because

Iris Solutions
Using a Maximum Likelihood fewer redundant sensors will be
Technique activated to keep monitoring the object.
The Gauss-Markov mobility model is
best mobility models to describe object
trajectory because it can capture the
correlation of object velocity in time.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING

57 ISJIP01 Anomaly Detection and The popular RX anomaly detector is 2012
Reconstruction from Random derived for the case in which global
Projections anomalies are to be identified directly in
the random-projection domain, and it is
determined via both random simulation,
as well as empirical observation that
strongly anomalous vectors are likely to
be identifiable by the projection-domain
RX detector even in low-dimensional
projections.
58 ISJIP02 Web and Personal Image In this paper, we propose a new 2012
Annotation by Mining Label inductive algorithm for image
Correlation with Relaxed Visual annotation by integrating label
Graph Embedding correlation mining and visual similarity
mining into a joint framework. We first
construct a graph model according to
image visual features. A multilabel
classifier is then trained by
simultaneously uncovering the shared
structure common to different labels
and the visual graph embedded label
prediction matrix for image annotation.
59 ISJIP03 An Alternating Minimization In this paper, we propose a new 2012
Algorithm for Binary Image minimization model by making use of a
Restoration new variable to enforce the image to be
binary. Based on the proposed
minimization model, we present a fast
alternating minimization algorithm for
binary image restoration. We prove the
convergence of the proposed alternating
minimization algorithm
60 ISJIP04 Efficient Relevance Feedback Content-based image retrieval is the 2011
mainstay of image retrieval systems.
Relevance feedback techniques were
16

incorporated into CBIR such that more
Page

precise results can be obtained by
taking user’s Feedbacks into account.

Iris Solutions
61 ISJIP05 High-quality Reflection Deal with a problem of separating the 2011
Separation using Polarized effect of reflection from images
Images captured behind glass. The input
consists of multiple polarized images
captured from the same view point but
with different polarizer angles. The
output is the high quality separation of
the reflection layer and the background
layer from the images.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING

62 ISJSE01 Automated Behavioral Testing We present a technique to test Java 2012
of Refactoring Engines refactoring engines. It automates test
input generation by using a Java
program generator that exhaustively
generates programs for a given scope of
Java declarations. The refactoring
under2test is applied to each generated
program. The technique uses
SAFEREFACTOR, a tool for detecting
behavioral changes, as oracle to
evaluate the correctness of these
transformations.
63 ISJSE02 Towards Comprehensible This study contributes to the literature 2012
Software Fault Prediction by considering 15 different Bayesian
Models Using Bayesian Network (BN) classifiers and
Network Classifiers comparing them to other popular
machine learning techniques.
Furthermore, the applicability of the
Markov blanket principle for feature
selection, which is a natural extension
to BN theory, is investigated.
64 ISJSE03 Using Dependency Structures In this paper, we present a family of test 2012
for Prioritisation of Functional case prioritisation techniques that use
Test Suites the dependency information from a test
suite to prioritise that test suite. The
nature of the techniques preserves the
dependencies in the test ordering.
65 ISJSE04 Genetic Algorithms for A system which uses a genetic 2011
Randomized Unit Testing algorithm to find parameters for
randomized unit testing that optimize
test coverage. Designing GAs is
17

somewhat of a black art. We therefore
use a feature subset selection tool to
Page

assess the size and content of the

Iris Solutions
representations within the GA.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON CLOUD COMPUTING

66 ISJCC01 pCloud: A Distributed System In this paper we present pCloud, a 2012
for Practical PIR 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. Using a striping
technique, we distribute the database to
a number of cooperative peers, and
leverage their computational resources
to process cPIR queries in parallel. We
implemented pCloud on the PlanetLab
network, and experimented extensively
with several system parameters. results
67 ISJCC02 A Gossip Protocol for Dynamic We address the problem of dynamic 2012
Resource Management in Large resource management for a large-scale
Cloud Environments. cloud environment. Our contribution
includes outlining a distributed
middleware architecture and presenting
one of its key elements: a gossip
protocol that (1) ensures fair resource
allocation among sites/applications, (2)
dynamically adapts the allocation to
load changes and (3) scales both in the
number of physical machines and
sites/applications.
68 ISJCC03 A Novel Process Network In this paper, we explore a novel 2012
Model for Interacting Context- approach to model dynamic behaviors
aware Web Services of interacting context-aware web
services. It aims to effectively process
and take advantage of contexts and
realize behavior adaptation of web
services, further to facilitate the
development of context-aware
application of web services.
69 ISJCC04 Multicloud Deployment of We deploy a computing cluster on the 2011
Computing Clusters for Loosely top of a multicloud infrastructure, for
Coupled MTC Applications solving loosely coupled Many-Task
Computing applications. In this way,
18

the cluster nodes can be provisioned
with resources from different clouds to
Page

improve the cost effectiveness of the

Iris Solutions
deployment, or to implement high-
availability strategies.
70 ISJCC05 Enabling Public Auditability To achieve efficient data dynamics, we 2011
and Data Dynamics for Storage improve the existing proof of storage
Security in Cloud Computing models by manipulating the classic
Merkle Hash Tree construction for
block tag authentication. To support
efficient handling of multiple auditing
tasks, the technique of bilinear
aggregate signature to extend our main
result into a multiuser setting, where
TPA can perform multiple auditing
tasks simultaneously.

TECHNOLOGY: JAVA
DOMAIN : IEEE TRANSACTIONS ON GRID COMPUTING

71 ISJGC01 Business-OWL (BOWL)—A This paper introduces the Business- 2012
Hierarchical Task Network OWL (BOWL), an ontology rooted in
Ontology for Dynamic Business the Web Ontology Language (OWL),
Process Decomposition and and modeled as a Hierarchical Task
Formulation Network (HTN) for the dynamic
formation of business processes
72 ISJGC02 Detecting And Resolving The advent of emerging computing 2012
Firewall Policy Anomalies technologies such as service-oriented
architecture and cloud computing has
enabled us to perform business services
more efficiently and effectively.
73 ISJGC03 Online System for Grid In this paper, we present the design and 2012
Resource Monitoring and evaluation of system architecture for
Machine Learning-Based grid resource monitoring and prediction.
Prediction We discuss the key issues for system
implementation, including machine
learning-based methodologies for
modeling and optimization of resource
prediction models.
74 ISJGC04 SOAP Processing Performance SOAP communications produce 2011
and Enhancement considerable network traffic, making
them unfit for distributed, loosely
coupled and heterogeneous computing
environments such as the open Internet.
They introduce higher latency and
processing delays than other
19

technologies, like Java RMI & CORBA.
WS research has recently focused on
Page

SOAP performance enhancement.

Iris Solutions
75 ISJGC05 Weather data sharing system: Intelligent agents can play an important 2011
an agent-based distributed data role in helping achieve the ‘data grid’
management vision. In this study, the authors present
a multi-agent-based framework to
implement manage, share and query
weather data in a geographical
distributed environment, named weather
data sharing system

J2EE
TECHNOLOGY: J2EE
DOMAIN : IEEE TRANSACTIONS

1 ISJ2EE1 A Link-Based Cluster Ensemble The paper presents an analysis that 2012
Approach for Categorical Data suggests this problem degrades the
Clustering quality of the clustering result, and it
presents a new link-based approach,
which improves the conventional matrix
by discovering unknown entries through
similarity between clusters in an
ensemble.
2 ISJ2EE2 Low-Rank Kernel Matrix In this paper, we propose ECKF, a 2012
Factorization for Large-Scale general framework for evolutionary
Evolutionary Clustering clustering large-scale data based on
low-rank kernel matrix factorization. To
the best of our knowledge, this is the
first work that clusters large
evolutionary data sets by the
amalgamation of low-rank matrix
approximation methods and matrix
factorization-based clustering.
3 ISJ2EE3 Prediction of User’s Web- In this paper, we analyze and study 2012
Browsing Behavior: Markov model and all- Kth Markov
Application of Markov Model model in Web prediction. We propose a
new modified Markov model to
alleviate the issue of scalability in the
number of paths.
4 ISJ2EE4 Integrating Visual Saliency and Visual saliency. From visual aspect, it is 2011
Consistency for Re-ranking obvious that salient images would be
Image Search Results easier to catch users eyes and it is
observed that these visually salient
20

images in the front pages are often
Page

relevant to the users query.


Iris Solutions
5 ISJ2EE5 Matching Estimates of the We compare the use of OLS regression 2011
Effect of College Attendance on and propensity score matching methods,
Individual Income and incorporate the role of ldquo
common support .rdquo Using data
from the CHFLS
6 ISJ2EE6 Research on B2B E-Business The model to B2B E-Business System 2010
System of Bookshop Based on of Bookshop, which includes the
Web Service management subsystem of order, book
information, bookshop information, bill
information, and customer relations.

ANROID
TECHNOLOGY: ANROID

1 ISAI01 Proteus: Multi-flow Diversity A novel approach to achieve co- 2012
Routing for Wireless Networks operative transmission links in VMISO
with Cooperative Transmissions (Virtual Multi Input and Single Output),
here we use a proteus an adaptive
diversity routing protocol to overcome
the number transmitter for each and its
diversity.
2 ISAI02 A Framework for Personal A technique to mining and prediction of 2012
Mobile Commerce mobile users behavior in order to
Pattern Mining and Prediction recommend the stores with a Personal
Mobile Commerce Pattern Mine
(PMCP-Mine) algorithm.

3 ISAI03 Privacy control in smart phones This framework shows by embedding a 2012
using semantically semantically rich policy based on a
rich reasoning and context device context in the smart phone
modeling framework, a policy based system that
reasons over a user’s dynamic context
and constrains the
information flow among applications by
extending the open
source Android framework
21
Page


Iris Solutions

DOTNET
TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON NETWORKING

1 ISDNW01 An Efficient Adaptive A deadlock-free minimal routing 2012
Deadlock-Free Routing algorithm called clue is first proposed
Algorithm for Torus for VCT (virtual cut-through)-switched
Networks. tori. Only two virtual channels are
required. One channel is applied in the
deadlock-free routing algorithm for the
mesh sub network based on a known
base routing scheme, such as, negative-
first or dimension-order routing.
2 ISDNW02 The Three-Tier Security This Paper describes a three-tier general 2012
Scheme in Wireless Sensor framework that permits the use of any
Networks with Mobile Sinks pairwise key predistribution scheme as
its basic component. The new frame-
work requires two separate key pools,
one for the mobile sink to access the
network, and one for pairwise key
establishment between the sensors.
3 ISDNW03 Efficient Error Estimating This paper proposes the novel concept 2012
Coding: Feasibility and of error estimating coding (EEC).
Applications Without correcting the errors in the
packet, EEC enables the receiver of the
packet to estimate the packet’s bit error
rate, which is perhaps the most
important meta-information of a
partially correct packet.
4 ISDNW04 Independent Directed Acyclic In this paper. Link-independent (node- 2012
Graphs for Resilient Multipath independent) DAGs satisfy the property
Routing that any path from a source to the root
on one DAG is link-disjoint (node-
disjoint) with any path from the source
to the root on the other DAG. Given a
network, we develop polynomial-time
algorithms to compute link-independent
and node-independent DAGs.

5 ISDNW05 Modeling and Analysis of Multi cluster systems have emerged as a 2012
22

Communication Networks in promising infrastructure for
Page

Multicluster Systems under provisioning of cost-effective high-


Iris Solutions
Spatio-Temporal Bursty Traffic performance computing and
communications. Analytical models of
communication networks in cluster
systems have been widely reported.
6 ISDNW06 Improving End-to-End Routing We propose a topology aware routing 2012
Performance of Greedy (TAR) protocol that efficiently encodes
Forwarding in Sensor Networks a network topology into a low-
dimensional virtual coordinate space
where hop distances between pairwise
nodes are preserved. Based on precise
hop distance comparison, TAR can
assist greedy forwarding to find the
right neighbor that is one hop closer to
the destination and achieve high success
ratio of packet delivery without location
information.
7 ISDNW07 DCS: Distributed In this paper, we propose distributed 2012
Asynchronous Clock asynchronous clock synchronization
Synchronization in Delay (DCS) protocol for Delay Tolerant
Tolerant Networks Networks (DTNs). Different from
existing clock synchronization
protocols, the proposed DCS protocol
can achieve global clock
synchronization among mobile nodes
within the network over asynchronous
and intermittent connections with long
delays.
8 ISDNW08 Semantic-Aware Metadata This paper proposes a novel 2012
Organization Paradigm in decentralized semantic-aware metadata
Next-Generation File Systems organization, called Smart Store, which
exploits semantics of files’ metadata to
judiciously aggregate correlated files
into semantic-aware groups by using
information retrieval tools.
9 ISDNW09 A Greedy Link Scheduler for In this paper, we address the problem of 2012
Wireless Networks With link scheduling in multihop wireless
Gaussian Multiple-Access and networks containing nodes with BC and
Broadcast Channels MAC capabilities. We first propose an
interference model that extends protocol
interference models, originally designed
for point-to-point channels, to include
the possibility of BCs and MACs.

10 ISDNW10 Finding Cheap Routes in Prot- In this paper, we explore the economic 2012
23

Driven Opportunistic Spectrum aspects of routing/relaying in a proﬁt-
Access Networks: A Truthful driven opportunistic spectrum access
Page

Mechanism (OSA) network. In this network,

Iris Solutions
Design Approach primary users lease their licensed
spectrum to secondary radio (SR)
providers, who in turn provide
opportunistic routing/relaying service to
end-users if this service is portable.
11 ISDNW11 MeasuRouting: A Framework In this paper we present a theoretical 2012
for Routing Assisted Traffic framework for MeasuRouting.
Monitoring Furthermore, as proofs-of-concept, we
present synthetic and practical
monitoring applications to showcase the
utility enhancement achieved with
MeasuRouting.
12 ISDNW12 AMPLE: An Adaptive Traffic In this article, we introduce AMPLE - 2012
Engineering System Based on an efficient traffic engineering and
Virtual Routing Topologies management system that performs
adaptive traffic control by using
multiple virtualized routing topologies
13 ISDNW13 Research on cloud computing A traditional method of using load 2011
application in the peer-to-peer balancing and multiple buffer servers
based video–on-demand we found that the performance of
systems Hadoop framework was improved
significantly in feasibility and
efficiency when dealing with large data.
14 ISDNW14 A Secure Communication A four terminal network with a source, 2011
Game with a Relay Helping the a destination, an eavesdropper and a
Eavesdropper jammer relay is investigated. The
source and the jammer relay have
conflicting interests. This problem is
formulated as a non-cooperative two-
player zero sum continuous game. Two
cases are studied: 1) the jammer relay
does not hear the source, and 2) the
jammer relay is given the source signal.
15 ISDNW15 Optical Layer Security in Fiber- Our goal is the security threats in an 2011
Optic Networks optical network as well as present
several existing optical techniques to
improve the security. In the first part of
this paper, we discuss various types of
security threats that could appear in the
optical layer of an optical network,
including jamming, physical
infrastructure attacks, eavesdropping
and interception.
16 ISDNW16 Predictive Resource The monitoring system preserves a high 2011
24

Management of Multiple degree of flexibility, increasing the
Monitoring Application range of applications and network
Page

scenarios where it can be used. We


Iris Solutions
implemented our load-shedding-based
resource management scheme in an
existing network monitoring system and
deployed it in a large research and
educational network.
17 ISDNW17 Active Monitoring and Alarm It focuses the error locations 2010
Management for Fault (Localization) which is occurring on the
Localization in Transparent Optical Networks and when we
All-Optical Networks monitoring the fault localization, we
arrange the alarm to make active the users.
18 ISDNW18 Logoot-Undo: Distributed This project presents the Logoot-Undo 2010
Collaborative Editing System Commutative Replicated Data Type
on P2P Networks algorithm, which integrates the “undo
anywhere, anytime” feature on the
replicated data’s in peer to peer network
for reducing the cost of undo feature.
19 ISDNW19 Multiuser Diversity Gain in An large cognitive networks granted 2010
Cognitive Networks concurrent spectrum access with
license-holding users and Dynamic
allocation of resources to the best link
in multiuser n/w.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY

20 ISDNS01 Extending Attack Graph-Based The attack graph is an abstraction that 2012
Security Metrics and reveals the ways an attacker can
Aggregating Their Application 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.
21 ISDNS02 Secured Trust: A Dynamic We present in this paper a dynamic trust 2012
Trust Computation Model for computation model called
Secured Communication "SecuredTrust.” In this paper, we first
in Multi agent Systems analyze the different factors related to
evaluating the trust of an agent and then
propose a comprehensive quantitative
model for measuring such trust. We also
propose a novel load-balancing
algorithm based on the different factors
defined in our model.
25

22 ISDNS03 Persuasive Cued Click-Points: This paper presents an integrated 2012
Page

Design, Implementation, and evaluation of the Persuasive Cued


Iris Solutions
Evaluation of a Click-Points graphical password
Knowledge-Based scheme, including usability and security
Authentication Mechanism evaluations, and implementation
considerations. An important usability
goal for knowledge-based
authentication systems is to support
users in selecting passwords of higher
security, in the sense of being from an
expanded effective security space.
23 ISDNS04 Detecting Spam Zombies by We develop an effective spam zombie 2012
Monitoring Outgoing Messages detection system named SPOT by
monitoring outgoing messages of a
network. SPOT is designed based on a
powerful statistical tool called
Sequential Probability Ratio Test,
which has bounded false positive and
false negative error rates.
24 ISDNS05 Iterative Trust and Reputation In this paper, we introduce the first 2012
Management Using Belief application of the belief propagation
Propagation algorithm in the design and evaluation
of trust and reputation management
systems. We approach the reputation
management problem as an inference
problem and describe it as computing
marginal likelihood distributions from
complicated global functions of many
variables.
25 ISDNS06 Data-Provenance Verification Malicious software typically resides 2012
For Secure Hosts stealthily on a user’s computer and
interacts with the user’s computing
resources. Our goal in this work is to
improve the trustworthiness of a host
and its system data. Specifically, we
provide a new mechanism that ensures
the correct origin or provenance of
critical system information and prevents
adversaries from utilizing host
resources.
26 ISDNS07 Risk-Aware Mitigation for In this paper, we propose a risk-aware 2012
MANET Routing Attacks response mechanism to systematically
cope with the identified routing attacks.
Our risk-aware approach is based on an
extended Dempster-Shafer
mathematical theory of evidence
introducing a notion of importance
26

factors.
27 ISDNS08 Characterizing the Efficacy of The Naval Research Laboratory (NRL) 2012
Page

the NRL Network Pump in Network Pump, or Pump, is a standard

Iris Solutions
Mitigating Covert Timing for mitigating covert channels that arise
Channels in a multilevel secure (MLS) system
when a high user (HU) sends
acknowledgements to a low user (LU).
The issue here is that HU can encode
information in the “timings” of the
acknowledgements.
28 ISDNS09 Detecting and Resolving The advent of emerging computing 2012
However, we still suffer from
unintended security leakages by
unauthorized actions in business
services
29 ISDNS10 A Generic Framework for A well designed three-factor 2011
Three-Factor Authentication: authentication protocol can greatly
Preserving Security and improve the information assurance in
Privacy in Distributed Systems distributed systems. Three-factor
authentication is introduced to
incorporate the advantages of the
authentication based on password,
smart-card and biometrics.
30 ISDNS11 Online Intrusion Alert Alert aggregation is an important 2011
Aggregation with Generative subtask of intrusion detection. The goal
Data Stream Modeling is to identify and to cluster different
alerts produced by low-level intrusion
detection systems, firewalls, etc.,
31 ISDNS12 Replica Placement for Route Distributed hash tables share storage 2011
Diversity in Tree-Based and routing responsibility among all
Routing Distributed Hash nodes in a peer-to-peer network. These
Tables networks have bounded path length
unlike unstructured networks. The
impact of Max Disjoint on routing
robustness compared to other
placements when nodes are compromi-
sed at random or in a contiguous run.
32 ISDNS13 Nymble: Blocking Anonymizing networks such as Tor 2011
Misbehaving Users in allow users to access Internet services
Anonymzing Networks privately by using a series of routers to
hide the client's IP address from the
server. Nymble, a system in which
servers can “blacklist” misbehaving
users, there by blocking users without
27

compromising their anonymity.
Page

33 ISDNS14 Improving Security and We propose a novel Cipher text policy 2010


Iris Solutions
Efficiency in Attribute-Based attribute-based encryption (CP-ABE)
Data Sharing scheme for a data sharing system by
exploiting the characteristic of the
system architecture. The proposed
scheme achievements:1) The key
escrow problem could be solved by
escrow-free key issuing protocol.2)
Fine-grained user revocation per each
attribute could be done by proxy
encryption which takes advantage of the
selective attribute group key
distribution on top of the ABE.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON DATAMINING

SNO P. CODE PROJECT TITLES DESCRIPTION YEAR
34 ISDDM01 Scalable Learning Of This study of collective behavior is to 2012
Collective Behavior understand how individuals behave in a
social networking environment. Oceans
of data generated by social media like
Facebook, Twitter, Flickr, and YouTube
present opportunities and challenges to
study collective behavior on a large
scale. we aim to learn to predict
collective behavior in social media
35 ISDDM02 Outsourced Similarity Search This paper considers a cloud computing 2012
on Metric Data Assets setting in which similarity querying of
metric data is outsourced to a service
provider. The data is to be revealed only
to trusted users, not to the service
provider or anyone else. Users query the
server for the most similar data objects
to a query example. Outsourcing offers
the data owner scalability and a low-
initial investment.
36 ISDDM03 Semi-Supervised Maximum This paper presents an analysis that 2012
Margin Clustering With suggests this problem degrades the
Pairwise Constraints quality of the clustering result, and it
presents a new link-based approach,
which improves the conventional matrix
by discovering unknown entries through
similarity between clusters in an
ensemble. In particular, an efficient
28

link-based algorithm is proposed for the
underlying similarity assessment
Page

37 ISDDM04 Multiparty Access Control for In this paper, we propose an approach 2012

Iris Solutions
Online Social Networks: to enable the protection of shared data
Model and Mechanisms associated with multiple users in Online
social networks. We formulate an
access control model to capture the
essence of multiparty authorization
requirements, along with a multiparty
policy speciﬁcation scheme and a policy
enforcement mechanism
38 ISDDM05 Manifold Adaptive In this paper, we propose a novel active 2012
Experimental Design for Text learning algorithm which is performed
Categorization 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
39 ISDDM06 TSCAN: A Content Anatomy This paper defined as a seminal event or 2012
Approach to Temporal Topic activity along with all directly related
Summarization events and activities. It is represented
by a chronological sequence of
documents published by different
authors on the Internet. In this study, we
define a task called topic anatomy,
which summarizes and associates the
core parts of a topic temporally so that
readers can understand the content
easily
40 ISDDM07 Mining Group Movement Encryption & multiplexing technique 2011
Patterns for Tracking Moving not only enhances the security of
Objects Efficiently confidential fingerprint information by
making the information inaccessible to
any intruder having a random code, but
also improves the system resource
utilization by reducing the storage and
/or transmission bandwidth requirement

41 ISDDM08 Efficient Relevance Feedback A novel method NPRF to achieve the 2011
for Content-Based Image high efficiency and effectiveness of
Retrieval by Mining User CBIR in coping with the large-scale
Navigation Patterns image data. In terms of efficiency, the
iterations of feedback are reduced
substantially by using the navigation
patterns discovered from the user query
log. Our proposed search use 3 kinds of
query refinement strategies QPM, QR
29

and QEX to converge the search space
toward the user’s intention effectively.
Page


Iris Solutions
42 ISDDM09 Authenticated Multistep NN We are using NN concept to provide 2011
Nearest Neighbor Search similarity search results with trustiness
to proof the result correctness. A client
gives NN queries to a server that
maintains a database signed by a trusted
authority.
43 ISDDM10 Optimizing Bloom Filter In this paper, we address the problem of 2011
Settings in optimizing the settings of a Bloom
Peer-to-Peer Multi keyword Filter (BF). We show that the optimal
Searching setting of BF in terms of traffic cost is
determined by the statistical
information of the involved inverted
lists.
44 ISDDM11 Extended XML Tree Pattern We research a large set of XML tree 2011
Matching: Theories and pattern, called extended XML tree
Algorithms pattern, which may include P-C, A-D
relationships, negation functions,
wildcards, and order restriction. We
establish a theoretical framework about
“matching cross” which demonstrates
the intrinsic reason in the proof of
optimality on holistic algorithms.
45 ISDDM12 Bridging Domains Using A novel transfer learning approach, 2010
World Wide Knowledge for called BIG (Bridging information Gap),
Transfer Learning to effectively extract useful knowledge
in a worldwide knowledge base.
46 ISDDM13 Closing the Loop in Webpage This project focuses on the concept of 2010
Understanding information extraction is processing
from a web page and its content.
47 ISDDM14 Knowledge-Based Interactive A new interactive approach to prune 2010
Post mining of Association and filter discovered rules.1) Integration
Rules Using Ontologies of user knowledge in the post
processing task. 2) The Rule Schema
formalism extending the specification
language for user expectations

48 ISDDM15 Filtering Data flow for Query tolerance is expressed as a 2010
Continuous Queries numerical value, which may be difficult
to specify. We observe that in many
situations, users may not be concerned
with the actual value of an answer, but
rather which object satisfies a query. In
this paper We develop fraction-based
tolerance for two major classes of
30

entity-based queries
Page


Iris Solutions
49 ISDDM16 Through Linking for Transfer Our approach at automatically adapting 2010
Learning Using Web the information extraction knowledge
previously learned from a source Web
site to a new unseen site and
discovering previously unseen
attributes. Two kinds of text-related
clues from the source Web site are
considered. The first clue is obtained
from the extraction pattern contained in
the previously learned wrapper. The
second clue is derived from the
previously extracted or collected items.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING

50 ISDMC01 Toward Reliable Data This paper addresses the problem of 2012
Delivery for Highly Dynamic delivering data packets for highly
Mobile Ad Hoc Networks. dynamic mobile ad hoc networks in a
reliable and timely manner. Most
existing ad hoc routing protocols are
susceptible to node mobility, especially
for large-scale networks. Driven by this
issue, we propose an efficient Position-
based Opportunistic Routing (POR)
protocol which takes advantage of the
stateless property of geographic routing
and the broadcast nature of wireless
medium.
51 ISDMC02 Hop-by-Hop Routing in Wireless Mesh Network (WMN) has 2012
Wireless Mesh Networks with become an important edge network to
Bandwidth Guarantees. 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. Due to
interference among links, bandwidth, a
well-known bottleneck metric in wired
networks, is neither concave nor
additive in wireless networks.
31
Page


Iris Solutions
52 ISDMC03 Fast Data Collection in Tree- We investigate the following 2012
Based Wireless Sensor fundamental question—how fast can
Networks information be collected from a wireless
sensor network organized as tree? To
address this, we explore and evaluate a
number of different techniques using
realistic simulation models under the
many-to-one communication paradigm
known as converge cast. We first
consider time scheduling on a single
frequency channel with the aim of
minimizing the number of time slots
required (schedule length) to complete a
converge cast.
53 ISDMC04 Energy-Efficient Strategies for Distributed Information Sharing (DISH) 2012
Cooperative Multichannel is a new cooperative approach to
MAC Protocols designing multichannel MAC protocols.
It aids nodes in their decision making
processes by compensating for their
missing information via information
sharing through neighboring nodes.
This approach was recently shown to
significantly boost the throughput of
multichannel MAC protocols.
54 ISDMC05 Soft-TDMAC: A Software- We implement a new software-based 2012
Based 802.11 Overlay TDMA multi-hop TDMA MAC protocol (Soft-
MAC with Microsecond TDMAC) with microsecond
Synchronization. synchronization using a novel system
interface for development of 802.11
overlay TDMA MAC protocols (SySI-
MAC). SySI-MAC provides a kernel
independent message-based interface
for scheduling transmissions and
sending and receiving 802.11 packets.
55 ISDMC06 Link Positions Matter: A Non We revisit the problem of computing 2012
commutative Routing Metric the path with the minimum cost in terms
for Wireless Mesh Networks. of the expected number of link layer
transmissions) in wireless mesh
networks. Unlike previous efforts, such
as the popular ETX, we account for the
fact that MAC protocols incorporate a
finite number of transmission attempts
per packet. This in turn leads to our key
observation: the performance of a path
depends not only on the number of the
links on the path and the quality of its
32

links, but also, on the relative positions
Page

of the links on the path


Iris Solutions
56 ISDMC07 A Policy Enforcing Mechanism The design and implementation of a 2011
for Trusted Ad Hoc Networks policy enforcing mechanism based on
Satem, a kernel-level trusted execution
monitor built on top of the Trusted
Platform Module. Under this
mechanism, each application or
protocol has an associated policy. Two
instances of an application running on
different nodes may engage in
communication only if these nodes
enforce the same set of policies for both
the application and the underlying
protocols used by the application.
57 ISDMC08 An Adaptive Network Coded An adaptive scheme that maintains the 2011
Retransmission Scheme for highest bandwidth efficiency obtainable
Single-Hop Wireless Multicast by both opportunistic and full network
Broadcast Services coding schemes in wireless MBS. The
proposed scheme adaptively selects,
between these 2 schemes, 1) To achieve
the better bandwidth efficiency
performance. 2) Using random graph
theory.
58 ISDMC09 Localization of Mobile Nodes Wireless sensor networks are an 2011
in Wireless Networks with inherent part of decision making, object
Correlated in Time tracking, and location awareness
Measurement Noise systems. This work is focused on
simultaneous localization of mobile
nodes based on received signal strength
indicators (RSSIs) with correlated in
time measurement noises.
59 ISDMC10 Load Shedding in Mobile The CQ server must receive and process 2011
Systems with MobiQual frequent position updates from the
mobile nodes. It is difficult to obtain
fresh and accurate CQ results
simultaneously, due to 1) limited
resources in computing and
communication and 2) fast-changing
load conditions caused by continuous
mobile node movement. The MobiQual
approach leads to much higher
freshness and accuracy in the query
results in all cases.
60 ISDMC11 Cooperative Channelization in A health metric is proposed to allow 2010
Wireless Networks with comparison of need for channelization
Network Coding of different multicast links. Cooperative
33

channelization considers the impact of
channelization on overall network
Page

performance before resource reservation

Iris Solutions
is triggered. Our results show that
cooperative channelization improves
overall network performance while
being well suited for wireless networks
using network coding.
61 ISDMC12 Secure Distance-Based We attempt to answer these and other 2010
Localization in the Presence of related questions by following a careful
Cheating Beacon Nodes analytical approach. Specifically, we
first show that when the number of
cheating beacon nodes is greater than or
equal to a given threshold, there do not
exist any two-dimensional distance-
based localization algorithms that can
guarantee a bounded error.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING

SNO P.CODE PROJECT TITLES DESCRIPTION YEAR
62 ISDIP01 Semi supervised Biased In this paper, we propose a biased 2012
Maximum Margin Analysis for maximum margin analysis (BMMA)
Interactive Image Retrieval and a semi supervised BMMA
(SemiBMMA) for integrating the
distinct properties of feedbacks and
utilizing the information of unlabeled
samples for SVM-based RF schemes
For Image Retrieval process.
63 ISDIP02 Active Visual Segmentation In This Paper, we propose a method to 2012
segment the object of interest by finding
the “optimal” closed contour around the
fixation point in the polar space,
avoiding the perennial problem of scale
in the Cartesian space. The proposed
segmentation process is carried out in
two separate steps: First, all visual cues
are combined to generate the
probabilistic boundary edge map of the
scene; second, in this edge map, the
“optimal” closed contour around a
given fixation point is found.
64 ISDIP03 A Novel Data Embedding This paper proposes a new data-hiding 2012
Method Using Adaptive Pixel method based on pixel pair matching
Pair Matching (PPM). The basic idea of PPM is to use
the values of pixel pair as a reference
34

coordinate, and search a coordinate in
the neighborhood set of this pixel pair
Page

according to a Given message digit.

Iris Solutions
65 ISDIP04 High-quality Reflection A problem of separating the effect of 2011
Separation using Polarized reflection from images captured behind
Images glass. The input consists of multiple
polarized images captured from the same
view point but with different polarizer
angles. The output is the high quality
separation of the reflection layer and the
background layer from the images. We
propose a framework that allows us to
fully exploit the mutually exclusive
image information in our input data.
66 ISDIP05 Sparse Bayesian Learning of A framework for expanding a given 2010
Filters for Efficient Image image using an interpolator that is
Expansion trained in advance with training data,
based on sparse Bayesian estimation.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON CLOUD COMPUTING

67 ISDCC01 Performance Analysis of Cloud In this paper, we requests, we describe a 2012
Computing Centers novel approximate analytical model for
Using M/G/m/m+r Queuing performance evaluation of cloud server
farms and solve it to obtain accurate
Systems
estimation of the complete probability
distribution of the request response time
and other important performance
indicators.
68 ISDCC02 Enabling Secure and Efficient In this paper, we define and solve the 2012
Ranked Keyword Search over problem of secure ranked keyword
Outsourced Cloud Data search over encrypted cloud data.
Ranked search greatly enhances system
usability by enabling search result
relevance ranking instead of sending
undifferentiated results, and further
ensures the file retrieval accuracy
69 ISDCC03 A Secure Erasure Code-Based We propose a threshold proxy re- 2012
Cloud Storage System with encryption scheme and integrate it with
Secure Data Forwarding a decentralized erasure code such that a
secure distributed storage system is
formulated. The distributed storage
system not only supports secure and
robust data storage and retrieval, but
also lets a user forward his data in the
35

storage servers to another user without
retrieving the data back.
Page


Iris Solutions
70 ISDCC04 Toward Secure and We propose in this paper a flexible 2012
Dependable Storage Services distributed storage integrity auditing
in Cloud Computing mechanism, utilizing the homomorphic
token and distributed erasure-coded
data. The proposed design allows users
to audit the cloud storage with very
lightweight communication and
computation cost.
71 ISCC05 Optimal Multiserver In this paper, we study the problem of 2012
Configuration for Profit optimal multiserver configuration for
Maximization in Cloud profit maximization in a cloud
Computing 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.
72 ISDCC06 A Venture Perspective on Cloud and mobile computing appear to 2011
Cloud Computing represent yet another software
architecture change. Recognizing the
changes in how customers and developers
evaluate and adopt solutions, many start-
ups are building new software services
that can leverage cost advantages of
massive scale while also taking advantage
of online marketing to drive highly
efficient customer adoption & retention.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON GRID COMPUTING

73 ISDGC01 Using Rules and Data This paper presents a recovery 2012
Dependencies for the Recovery algorithm for service execution failure
of Concurrent Processes in the context of concurrent process
in a Service-Oriented execution. The recovery algorithm was
Environment specifically designed to support a rule-
based approach to user-defined
correctness in execution environments
that support a relaxed form of isolation
for service execution.
36
Page


Iris Solutions
74 ISDGC02 Business-OWL (BOWL)—A This paper introduces the Business- 2012
Hierarchical Task Network OWL (BOWL), an ontology rooted in
Ontology for Dynamic the Web Ontology Language (OWL),
Business Process and modeled as a Hierarchical Task
Decomposition and Network (HTN) for the dynamic
Formulation formation of business processes. An
ontologized extension and augmentation
of traditional HTN, BOWL describes
business processes as a hierarchical
ontology of decomposable business
tasks encompassing all possible
decomposition permutations
75 ISDGC03 Detecting And Resolving The advent of emerging computing 2012
76 ISDGC04 ABACS: An Attribute-Based ABACS for emergency services with 2011
Access Control System for security assurance over VANETs.
Emergency Services over ABACS aims to improve the efficiency
Vehicular Ad Hoc Networks of rescues mobilized via emergency
Communications over VANETs.
ABACS can select the emergency
vehicles that can most appropriately deal
with an emergency and securely delegate
the authority to control traffic facilities
to the assigned emergency vehicles.
77 ISDGC05 Information Theoretic Aspects This paper proposes an application of 2010
of Users’ Activity in a Wyner- multiuser information theory to the
Like Cellular Model study of the uplink of a communication
system with Randomly activated users.

TECHNOLOGY: DOTNET
DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING


78 ISDSE01 A Theoretical and Empirical In this paper, we analyze the role that 2012
Analysis of the Role of Test the length plays in software testing, in
Sequence Length in Software particular branch coverage. We show
Testing for Structural that, on “difficult” software testing
Coverage Bench marks, longer test sequences
make their testing trivial. Hence, we
argue that the choice of the length of the
test sequences is very important in
37

software testing.
Page


Iris Solutions
79 ISDSE02 Comparing Semi-Automated This paper presents an empirical study 2012
Clustering comparing the performance of existing
Methods for Persona qualitative and quantitative clustering
Development techniques for the task of identifying
personas and grouping system users into
those personas. A method based on
Factor (Principal Components) Analysis
performs better than two other methods
which use Latent Semantic Analysis
and Cluster Analysis as measured by
similarity to expert manually defined
clusters
80 ISDSE03 An Autonomous Engine for This paper proposes to support the 2012
Services Configuration and configuration and deployment of
Deployment services with an automated Closed
control loop. The automation is enabled
by the definition of a generic
information model, which captures all
the information relevant to the
management of the services with the
same abstractions, describing the
runtime elements, service dependencies
and business objectives.
81 ISDSE04 Automatic Detection In this paper, we present the first 2012
of Unsafe Dynamic automated technique to detect
Component Loadings 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
82 ISDSE05 Exploiting the Essential In this paper, we propose problem 2012
Assumptions solving method that has been assessed
of Analogy-Based Effort in cost estimation. The resemblance
Estimation measures among pairs of projects play
a critical role in the analogy-based
Software effort estimation models.
Such a model calculates a distance
between the software project being
estimated and each of the historical
Software projects.

83 ISDSE06 Comparing the Defect We compared the software defect rates 2011
Reduction Benefits of Code and implementation costs associated
with two methods of software defect
38

Inspection and Test-Driven
reduction: code inspection and test-
Development
driven development.
Page


Iris Solutions
DOTNET APPLICATION PROJECTS
TECHNOLOGY: DOTNET
DOMAIN : NON IEEE BASED PROJECTS
SNO P.CODE PROJECT TITLE
1 ISNID01 Random Password Generation For Automatic
Teller Machine Through Gsm
2 ISNID02 A Secure Recognition Based Graphical Password By Watermarking
3 ISNID03 Three-Step Authentication Method For Bank Processing
4 ISNID04 Multipurpose Card Using Rf-Id Tag
5 ISNID05 Voice Based Pc Control
6 ISNID06 Ontology Search Engines Based On Web Page Rank
7 ISNID07 Crack Removal Based On Edge Detection Method
8 ISNID08 Credit Card Fraud Detection During The Online Shopping
9 ISNID09 De-Noising The Dermatological Image
10 ISNID10 Student Marks Information Through Gsm
11 ISNID11 Refactoring-Aware Software Configuration Management
12 ISNID12 Integrated Marketing Communication Through Campaign Information System
13 ISNID13 Constructing Concept Lexica With Small Semantic Gaps
14 ISNID14 Predicting Missing Items In Shopping Carts
15 ISNID15 Grid Services For Distributed System Integration

16 ISNID16 Worldwide Net Ranking System
17 ISNID17 Multi Level Marketing System
18 ISNID18 Defense Mechanism Against DDos Attacks
19 ISNID19 Privacy In Healthcare Management System
20 ISNID20 Online Self Assessment Test
21 ISNID21 Hidden Picture Game
22 ISNID22 Institution Administration System
23 ISNID23 Job Gateway Scheme

24 ISNID24 Secure Socket Layer Based File Download
39

25 ISNID25 Traffic Analysis Attacks on Anonymity Networks
Page


Iris Solutions

NS2
TECHNOLOGY: NS2


01 ISNS01 A Novel Hybrid Multi-Hop In this paper, we propose HYbrid Multi- 2012
Routing Algorithm to Improve hop routiNg (HYMN) algorithm, which
the Longevity of WSNs is a hybrid of the two contemporary
multi-hop routing algorithm
architectures, namely, flat multi-hop
routing that utilizes efficient
transmission distances, and hierarchical
multi-hop routing algorithms that
capitalizes on data aggregation.
02 ISNS02 Power Minimization of Power minimization of a cooperative 2012
Cooperative Relay decode-and-forward (DF) half-duplex
Transmission with Relay's relaying is considered in this paper. In
Private Information the system considered, two source
nodes (S) try to communicate with one
destination (D). Recognizing the
difference in link qualities, one of
source nodes not only transmits its own
information to D but also acts as a relay
for the others.
03 ISNS03 An Investigation of Block In many communication channels, the 2012
Coding for Laplacian Noise ambient disturbance is known through
experimental evidence as well as
theoretical considerations to deviate
strongly from the Gaussian model. In
order to evaluate the performance of
digital signaling in such channels, the
non-Gaussian noise must be properly
modeled.
04 ISNS04 Resource Allocation with In this paper, we propose FLEC, a novel 2012
Flexible Channel Cooperation flexible channel cooperation scheme. It
in Cognitive Radio Networks allows secondary users to freely
optimize the use of channels for
transmitting primary data along with
their own, in order to maximize
performance.
05 ISNS05 Modeling and Analysis for In this paper, we present an analytical 2012
40

Spectrum Handoffs in framework to evaluate the latency
Cognitive Radio Networks performance of connection-based
Page

spectrum handoffs in cognitive radio

Iris Solutions
(CR) networks. During the transmission
period of a secondary connection,
multiple interruptions from the primary
users result in multiple spectrum
handoffs and the need of
predetermining a set of target channels
for spectrum handoffs.
06 ISNS06 Detection of Selfish We focus on AP-client(s) 2012
Manipulation of Carrier configurations, proposing a novel
Sensing in 802.11 Networks approach to detect this misbehavior. A
misbehaving client is unlikely to
recognize low power receptions as
legitimate packets
07 ISNS07 Self-Adaptive On-Demand In this work, we propose two self- 2012
Geographic Routing for adaptive on-demand geographic routing
Mobile Ad Hoc Networks schemes which build efficient paths
based on the need of user applications
and adapt to various scenarios to
provide efficient and reliable routing.
08 ISNS08 Declarative Policy-Based This paper presents DAWN, a 2012
Adaptive Mobile Ad Hoc declarative platform that creates highly
Networking adaptive policy-based mobile ad hoc
network (MANET) protocols. DAWN
leverages declarative networking
techniques to achieve extensible routing
and forwarding using declarative
languages. We make the following
contributions.
09 ISNS09 Design of Wireless Sensor We propose an optimization framework 2012
Networks for Mobile Target for selecting the positions of wireless
Detection sensors to detect mobile targets
traversing a given area. We propose two
problem versions: the minimization of
the sensors installation cost while
guaranteeing a minimum exposure, and
the maximization of the exposure of the
least-exposed path subject to a budget
on the sensors installation cost.
10 ISNS10 Polynomial-Time Algorithms In this paper, we present a new routing 2012
for Multirate Anypath Routing paradigm that generalizes opportunistic
in Wireless Multihop Networks routing for wireless multihop networks.
In multirate anypath routing, each node
uses both a set of next-hops and a
selected transmission rate to reach a
destination
41
Page


IRIS SOLUTIONS - IEEE 2012 ENGINEERING PROJECT TITLES FOR CSE, IT

More Related Content

What's hot

Similar to IRIS SOLUTIONS - IEEE 2012 ENGINEERING PROJECT TITLES FOR CSE, IT

Recently uploaded

IRIS SOLUTIONS - IEEE 2012 ENGINEERING PROJECT TITLES FOR CSE, IT