iris solutions- ieee 2011 project titles for me,m.tech,m.sc, mca, be,b.tech

Iris Solutions

#165, 1st Floor, 5th Street, Gandhipuram, Coimbatore-12 Ph: 0422-4372816

Mail: [email protected] website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357

Chennai, Madurai, Nellai, Erode, Salem

Pag

e1

IEEE 2011- JAVA, J2EE, DOTNET TITLES

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 11

IEEE TRANSACTIONS ON IMAGE PROCESSING 13

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 14

IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING 15

IEEE TRANSACTIONS ON J2EE 16

DOTNET

IEEE TRANSACTIONS ON NETWORKING 18

IEEE TRANSACTIONS ON NETWORK SECURITY 21

IEEE TRANSACTIONS ON DATA MINING 23

IEEE TRANSACTIONS ON MOBILE COMPUTING 25

IEEE TRANSACTIONS ON IMAGE PROCESSING 28

IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING 29

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 31

Coimbatore Trichy Thanjavur #165, 1st Floor, 5th Street, #73/1,3rd Floor, Salai road #1520, South Rampart, Gandhipuram, Thillai Nagar, Near Old Bus stand Coimbatore-12 Trichy-18 Thanjavur-1

Mob:9943 357 357 Mob:9943 314 314 Mob:9943 317 317

Iris Solutions




Pag

e2

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.

Iris Solutions




Pag

e3

JAVA

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON NETWORKING

SNO P.CODE TITLES DESCRIPTION YEAR

1 ISJNW01 Self-Reconfigurable Wireless

Mesh Networks

In this project, ARS outperforms existing

failure-recovery schemes in improving

channel-efficiency by more than 90% and in

the ability of meeting the application

bandwidth demands. Multihop wireless

mesh networks experience frequent link

failures caused by channel interference.

2011

2 ISJNW02 Delay-Optimal Opportunistic

Scheduling and Approximations

In this project, the design of multiuser

opportunistic packet schedulers for users

sharing a time-varying wireless channel

from performance and robustness points of

view. Markov decision process framework

used to compute and characterize mean-

delay-optimal scheduling policies.

2011

3 ISJNW03 Adaptive Fault-Tolerant QoS

Control Algorithms for

Maximizing System Lifetime of

Query-Based Wireless Sensor

Networks

Use of fault tolerance mechanisms through

redundancy improves query reliability in the

presence of unreliable wireless

communication and sensor faults; it cause

the energy of the system to be quickly

depleted.

2011

4 ISJNW04 Optimizing Resource Conflicts in

Workflow Management Systems

The two factors are formulated in a matrix

form and the optimal solution is found by

applying concepts of the generalized

eigenvalue analysis. A rough outline of an

agent-based architecture is proposed to

achieve runtime integration of our algorithm

into a functional WfMS.

2011

5 ISJNW05 Predictable high performance

Computing using Feedback and

admission control

In this project we present a design and

implementation of a predictable HPC

system using feedback control and

admission control. By creating a virtualized

application layer and opportunistically

multiplexing is the concurrent application.

2011

6 ISJNW06 Attribute-Based Access Control A cryptographic approach to enforce a fine- 2011

Iris Solutions




Pag

e4

with Efficient Revocation in Data

Outsourcing Systems

grained access control on the outsourced

data that is dual encryption protocol

exploiting the combined features of the

cipher text policy attribute-based encryption

and group key management algorithm.

7 ISJNW07 Load Balance with Imperfect

Information in Structured Peer-to-

Peer Systems

A novel load balancing algorithm that is

unique in that each participating peer is

based on the partial knowledge of the

system to estimate the probability

distributions of the capacities of peers and

the loads of virtual servers, resulting in

imperfect knowledge of the system state.

2011

8 ISJNW08 A Distributed Algorithm for

Finding All Best Swap Edges of a

Minimum-Diameter Spanning

Tree

A distributed algorithm used for computing

all best swap edges for a minimum-diameter

spanning tree. The best possible way of

reconnecting the network is to replace the

failed link by a single other link called a

swap link. A swap that minimizes the

diameter of the resulting swap tree.

2011

9 ISJNW09 Decomposing Workload Bursts

for Efficient Storage Resource

Management

We present a new framework for runtime

scheduling of a client‘s workload based on

decomposition and recombination of the

request stream. Finally, we show how the

framework can be used to improve estimates

of the aggregate resource requirements of

multiple concurrent clients.

2011

10 ISJNW10 Monitoring The Impact Of P2P

Users On A Broadband

Operator‘s Network Over time

We present an classification for broadband

users into a P2P and non-P2P group based

on the amount of communication partners

(―peers‖) they in a dedicated timeframe. We

derive their impact on network

characteristics like the number of active

users and their aggregate bandwidth.

2011

11 ISJNW11 Metadata Distribution and

Consistency Techniques for

Large-Scale Cluster File Systems

This paper makes two contributions. First,

we present a dynamic metadata distribution

policy (DDG) to improve the metadata

throughput by using a triple-defined

distribution. Second, S2PC-MP reduces the

overhead of failure-free execution and

ensures quick recovery in the presence of

metadata server failures or client failures.

2011

12 ISJNW12 Flexible Robust Group Key

Agreement

A novel 2-round GKA protocol that offers a

natural trade-off between message size and

2011

Iris Solutions




Pag

e5

the desired level of fault tolerance. The new

protocol is also the disruption attack by the

malicious insider.

13 ISJNW13 Site-Based Partitioning And

Repartitioning Techniques For

Parallel Page Rank Computation

The pagerank algorithm is an important

component. The pagerank computation

which is frequently repeated must be

performed in parallel with high-efficiency

and low-preprocessing overhead while

considering the initial distributed nature of

the web matrices.

2011

14 ISJNW14 Stabilization of Flood Sequencing

Protocols in Sensor Networks

In this project we discuss a family of four

flood sequencing protocols that use

sequence numbers to distinguish between

fresh and redundant flood messages.

2010

15 ISJNW15 A Near-Optimal Algorithm

Attacking the Topology Mismatch

Problem in Unstructured Peer-to-

Peer Networks.

In this project, we propose a novel topology

matching algorithm based on the

Metropolis-Hastings method. Our proposal

is guided by our insight analytical model

and is close to the optimal design.

2010

16 ISJNW16 A Dynamic Performance-Based

Flow Control Method for High-

Speed Data Transfer

A protocol, Performance Adaptive UDP

which aims to dynamically and

autonomously maximize performance under

different systems. A mathematical model

and related algorithms are proposed to

describe the theoretical basis behind

effective buffer and CPU management.

2010

17 ISJNW17 Priority of packet inference with

back up path

We present an end-to-end approach for PFP

inference and its associated tool, POPI

which enables users to discover such

network policies through measurements of

packet losses of different packet types.

2010

18 ISJNW18 On the Benefits of Cooperative

Proxy Caching for Peer-to-Peer

Traffic

Cooperative Cache can improve the system

performance in wireless P2P networks. We

propose a novel asymmetric cooperative

cache approach, where the data requests are

transmitted to the cache layer on every

node.

2010

Iris Solutions




Pag

e6

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY


1 ISJNS01 SAT: A Security Architecture

Achieving Anonymity and

Traceability in Wireless Mesh

Networks

In this project, we propose SAT, a security

architecture mainly consisting resolves the

conflicting security requirements of

unconditional anonymity for honest users

and traceability of misbehaving users.

2011

2 ISJNS02 Peering Equilibrium Multipath

Routing: A Game Theory

Framework for Internet Peering

Settlements

Our scheme relies on a game theory

modeling, with a non-cooperative potential

game considering both routing and

congestions costs. We compare different

PEMP policies to BGP Multipath schemes

by emulating a realistic peering scenario.

Our results show that the routing cost can be

decreased by roughly 10% with PEMP. The

stability of routes can be significantly

improved and that congestion can be

practically avoided on the peering links.

2011

3 ISJNS03 An Obfuscation-Based Approach

for Protecting Location Privacy

We address this problem and present a

solution based on different obfuscation

operators introduce an adversary model and

provide an analysis of the proposed

obfuscation operators to evaluate their

robustness against adversaries aiming to

reverse the obfuscation effects to retrieve a

location that better approximates the

location of the users

2011

4 ISJNS04 Providing Transaction Guarantees

in Asynchronous Systems with

No Assumptions on the Accuracy

of Failure Detection

Aims to demonstrate that randomization can

be a very competitive approach even in

hostile environments where arbitrary faults

can occur. A stack of randomized intrusion-

tolerant protocols is described and its

performance evaluated under several settings

in both local-area-network and wide-area-

network environments. The stack provides a

set of relevant services ranging from basic.

2011

5 ISJNS05 Modeling and Detection of

Camouflaging Worm

Our scheme uses the Power Spectral

Density (PSD) distribution of the scan

traffic volume and its corresponding

2011

Iris Solutions




Pag

e7

Spectral Flatness Measure (SFM) to

distinguish the C-Worm traffic from

background traffic. The performance data

clearly demonstrates that our scheme can

effectively detect the C-Worm propagation.

6 ISJNS06 Analysis of a Botnet Takeover We present the design of an advanced

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.

2011

7 ISJNS07 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.

2011

8 ISJNS08 Comparative Evaluation of

Spoofing Defenses

1) Formalizing the problem of spoofed

traffic filtering and defining novel

effectiveness measures, 2) observing each

defense as selfish or altruistic and

differentiating their performance goals, 3)

defining optimal core deployment points for

defenses that need core support, and 4)

evaluating all defenses in a common and

realistic setting.

2011

9 ISJNS09 Traceback of DDoS Attacks

Using Entropy Variations

We categorize packets that are passing

through a router into flows, which are

defined by the upstream router where a

packet came from, and the destination

address of the packet. In this project, we use

flow entropy variation or entropy variation

interchangeably.

2011

10 ISJNS10 Weak State Routing for Large-

Scale Dynamic Networks

Weak State Routing (WSR) is a novel

routing protocol that uses weak state along

with random directional walks for

forwarding packets. When a packet reaches

a node that contains a weak state about the

destination with higher confidence than that

held by the packet, the walk direction is

biased. The packet reaches the destination

2010

Iris Solutions




Pag

e8

via a sequence of directional walks,

punctuated by biasing decisions.

11 ISJNS11 On the Quality of Service of

Crash-Recovery Failure Detectors

Estimating the parameters of the failure

detector to achieve a required QoS to

configuring the crash-recovery failure

detector. We investigate the impact of the

dependability of the monitored process on

the QoS of our failure detector

2010

12 ISJNS12 An Advanced Hybrid Peer-to-

Peer Botnet

Compared with current botnets, the

proposed botnet is harder to be shut down,

monitored, and hijacked. It provides robust

network connectivity, individualized

encryption and control traffic dispersion,

limited botnet exposure by each bot, and

easy monitoring and recovery by its

botmaster.

2010

13 ISJNS13 Authenticated Group Key

Transfer Protocol Based on Secret

Sharing

Key transfer protocols rely on a mutually

trusted key generation center (KGC) to

select session keys and transport session

keys to all communication entities secretly.

In this paper, we propose an authenticated

key transfer protocol based on secret sharing

scheme that KC can broadcast group key

information to all group members at once

and only authorized group members can

recover the group key.

2010

14 ISJNS14 Secure Data Replication in Data

Grid

Secret sharing with cryptography

approaches have been used in distributed

storage systems to ensure the

confidentiality, integrity, and availability of

critical information. specifically, we

investigate the problem of optimal

allocation of sensitive data objects that are

partitioned by using secret sharing scheme

or erasure coding scheme and/or replicated.

We develop two heuristic algorithms for the

two sub problems.

2010

15 ISJNS15 Providing Witness Anonymity

Under Peer-to-Peer Settings

We introduce the concept of witness

anonymity for peer-to-peer systems, as well

as other systems with the peer-to-peer

nature. We propose the Secure Deep Throat

(SDT) protocol to provide anonymity for the

witnesses of malicious or selfish behavior to

enable such peers to report on this behavior

2010

Iris Solutions




Pag

e9

without fear of retaliation.

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON DATA MINING


1 ISJDM01 Effective Navigation of Query

Results Based on Concept

Hierarchies

Ranking and categorization, which can also

be combined, have been proposed 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.

2011

2 ISJDM02 Automatic Discovery of Personal

Name Aliases from the Web

We propose a novel, automatically extracted

lexical pattern-based approach 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.

2011

3 ISJDM03 An Efficient Index for Geographic Given a geographic query that is 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.

2011

4 ISJDM04 Anonymous Publication of

Sensitive Transactional Data

The problem of anonymizing sparse, high

dimensional transactional data is solved

through methods based on 1) local NN-

search and 2) global data reorganization.

2011

5 ISJDM05 Efficient Periodicity Mining in

Time Series Databases Using

Suffix Trees

A time series is a collection of data values

gathered generally at uniform interval of

time to reflect certain behavior of an entity.

Real life has several examples of time series

such as stock growth, transactions in a

superstore. A time series is mostly

characterized by being composed of

repeating cycles.

2011

Iris Solutions




Pag

e10

6 ISJDM06 Mining Iterative Generators and

Representative Rules for Software

Specification Discovery

The iterative pattern mining which outputs

patterns that are repeated frequently within a

program trace, or across multiple traces, or

both. Frequent iterative patterns reflect

frequent program behaviors that likely

correspond to software specifications.

2011

7 ISJDM07 Mining Web Graphs for

Recommendations

The recommender systems are based on

Collaborative Filtering which is a technique

that automatically predicts the interest of an

active user by collecting rating information

from other similar users or items

2011

8 ISJDM08 Managing Multidimensional

Historical Aggregate Data in

Unstructured P2P Networks

A P2P-based framework supporting the

extraction of aggregates from historical

multidimensional data is proposed, which

provides efficient and robust query evaluation

2010

9 ISJDM09 Multimodal Fusion for Video

Search Reranking

In this project, we present a flexible and

effective reranking method, called CR-

Reranking, to improve the retrieval

effectiveness. Specifically, multimodal

features are first utilized separately to rerank

the initial returned results at the cluster

level, and then all the ranked clusters from

different modalities are cooperatively used

to infer the shots with high relevance.

2010

10 ISJDM10 Prospective Infectious Disease

Outbreak Detection Using

Markov Switching Models

We considered the problem of identifying

outbreak patterns in a syndrome count time

series using Markov switching models. The

disease outbreak states are modeled as

hidden state variables which control the

observed time series.

2010

11 ISJDM11 LIGHT: A Query-Efficient yet

Low-Maintenance Indexing

Scheme over DHTs

LIGHT weight Hash Tree (LIGHT)—a

query-efficient yet low-maintenance

indexing scheme. LIGHT employs a novel

naming mechanism and a tree summarization

strategy for graceful distribution of its index

structure. We show through analysis that it

can support various complex queries with

near-optimal performance.

2010

12 ISJDM12 Deriving Concept-Based User

Profiles from Search Engine Logs

User profiling is a fundamental component

of any personalization applications. We

evaluate the proposed methods against our

previously proposed personalized query

clustering method. Experimental results

2010

Iris Solutions




Pag

e11

show that profiles which capture and utilize

both of the user‘s positive and negative

preferences perform the best.

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING


1 ISJMC01 Design and Performance Analysis

of Mobility Management

Schemes Based on Pointer

Forwarding for Wireless Mesh

Networks

Here we develop two per-user-based

mobility management schemes for WMNs,

namely, the static anchor scheme and

dynamic anchor scheme. Both schemes are

based on pointer forwarding. The optimal

threshold of the forwarding chain length is

determined for each individual mesh client

dynamically based on the mesh client‘s

specific mobility and service patterns.

2011

2 ISJMC02 Dynamic Conflict-Free

Transmission Scheduling for

Sensor Network Queries

DCQS, a novel transmission scheduling

technique specifically designed for query

services in wireless sensor networks. DCQS

features a planner and a scheduler. The

planner reduces query latency by

constructing transmission plans based on the

precedence constraints in in-network

aggregation. The scheduler improves

throughput by overlapping the transmissions

of multiple query instances concurrently

while enforcing a conflict-free schedule.

2011

3 ISJMC03 Multipath Routing and Max-Min

Fair QoS Provisioning under

Interference Constraints in

Wireless Multihop Networks

Ensure QoS, an interference-aware max-min

fair bandwidth allocation algorithm,

proposed where multiple paths (determined

by using the routing metric) coexist for each

user to the base station succeed in improving

network performance in terms of delay,

packet loss ratio, and bandwidth usage.

2011

4 ISJMC04 Detection of Selfish Manipulation

of Carrier Sensing in 802.11

Networks

CCA tuning can be exploited by selfish

nodes to obtain an unfair share of the

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.

2011

Iris Solutions




Pag

e12

5 ISJMC05 Message-Efficient Location

Prediction for Mobile Objects in

Wireless Sensor Networks Using a

Maximum Likelihood Technique

A better prediction model can significantly

reduce power consumption in a wireless

sensor network because fewer redundant

sensors will be 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.

2011

6 ISJMC06 Throughput-Lifetime Trade-Offs

in Multi hop Wireless Networks

under an SINR-Based

Interference Model

Operating a multi hop wireless network

while achieving both high throughput and

high lifetime is a highly desirable design

goal.

2011

7 ISJMC07 Efficient Load-Aware Routing

Scheme For Wireless Mesh

networks

A cluster head estimates traffic load in its

cluster. As the estimated load gets higher,

the cluster head increases the routing

metrics of the routes passing through the

cluster. Based on the routing metrics, user

traffic takes a detour to avoid overloaded

areas and, as a result, the WMN achieves

global load balancing

2010

8 ISJMC08 Secure Data Collection in

Wireless Sensor Networks Using

Randomized Dispersive Routes

We generate randomized multipath routes,

the routes taken by the ―shares‖ of different

packets change over time. The routing

algorithm becomes known to the adversary,

the adversary still cannot pinpoint the routes

traversed by each packet. Besides

randomness, the generated routes are also

highly dispersive and energy efficient,

making them quite capable of

circumventing black holes.

2010

9 ISJMC09 VEBEK: Virtual Energy-Based

Encryption and Keying for

Wireless Sensor Networks

We introduce an energy-efficient VEBEK

scheme for WSNs that significantly reduces

the number of transmissions needed for

rekeying to avoid stale keys. In addition to

the goal of saving energy, minimal

transmission is imperative for some military

applications of WSNs where an adversary

could be monitoring the wireless spectrum

2010

10 ISDMC10 MABS: Multicast Authentication

Based on Batch Signature

MABS, includes two schemes. The basic

scheme (MABS-B) eliminates the

correlation among packets and thus

provides the perfect resilience to packet

loss, and it is also efficient in terms of

latency, computation, and communication

2010

Iris Solutions




Pag

e13

overhead due to an efficient cryptographic

primitive called batch signature, which

supports the authentication of any number

of packets simultaneously.

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING


1 ISJIP01 Efficient Relevance Feedback Content-based image retrieval (CBIR) is the

mainstay of image retrieval systems.

Relevance feedback techniques were

incorporated into CBIR such that more

precise results can be obtained by taking

user‘s Feedbacks into account.

2011

2 ISJIP02 High-quality Reflection

Separation using Polarized Images

Deal with a problem of separating the effect

of reflection from 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.

2011

3 ISJIP03 Active Learning for Solving the

Incomplete Data Problem in

Facial Age Classification by the

Furthest Nearest-Neighbor

Criterion

The result on the face recognition database

and palm print palm vein database showed

that our approach can handle problems with

large number of classes. Our contributions

are twofold. 1. We proposed the FNN being

our novel idea, as a generic on-line or active

learning paradigm. 2. We showed that it can

be another viable tool for active learning of

facial age range classification.

2011

4 ISJIP04 Practical Bounds on Image

Denoising: From Estimation to

Information

The bound was computed directly from the

noise-free image that was assumed to be

available. We analyze the bounds formulation

to show that these two parameters are

interdependent and they, along with the

bounds formulation as a whole, have a nice

information-theoretic interpretation as well.

2011

5 ISJIP05 An Affine Symmetric Image

Model and Its Applications

The affine symmetry is exploited between

structural textures at a local level, the

objective being to find the minimum

2010

Iris Solutions




Pag

e14

residual error by estimating the affine

transform relating two patches of texture.

Having developed a local model, the

methodology is extended to the whole

image to estimate the global affine relation.

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING


1 ISJSE01 An Attack Surface Metric Formalize the notion of a system‘s attack

surface and introduce an attack surface

metric to measure the attack surface in a

systematic manner. Our measurement

method is agnostic to a software system‘s

implementation language and is applicable

to systems of all sizes.

2011

2 ISJSE02 Genetic Algorithms for

Randomized Unit Testing

A system which uses a genetic algorithm to

find parameters for randomized unit testing

that optimize test coverage. Designing GAs

is somewhat of a black art. We therefore use

a feature subset selection tool to assess the

size and content of the representations

within the GA.

2011

3 ISJSE03 Efficient Consistency

Measurement Based on

Behavioral Profiles of Process

Models

We use behavioral profiles for the definition

of a formal notion of consistency which is

less sensitive to model projections than

common criteria of behavioral equivalence

and allows for quantifying deviation in a

metric way. The derivation of behavioral

profiles and the calculation of a degree of

consistency have been implemented.

2011

4 ISJSE04 Web development Navigational

Development Techniques

We presents a general vision of NDT,

which is an approach to deal with

requirements in Web systems. It is based on

conclusions obtained in several comparative

studies and it tries to fill some gaps detected

by the research community.

2010

Iris Solutions




Pag

e15

TECHNOLOGY: JAVA

DOMAIN : IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING


1 ISJGC01 Adaptive grid risk-sensitive filter

for non-linear problems

Based on point-mass approximation, is

called the adaptive grid risk-sensitive filter.

Although risk-sensitive estimators have

been known to be robust compared to their

risk-neutral counterparts, the

implementation of risk-sensitive filters

(RSFs) is almost impossible except for very

trivial systems like linear Gaussian systems.

2011

2 ISJGC02 Multicloud Deployment of

Computing Clusters for Loosely

Coupled MTC Applications

We deploy a computing cluster on the top of

a multicloud infrastructure, for solving

loosely coupled Many-Task Computing

applications. In this way, the cluster nodes

can be provisioned with resources from

different clouds to improve the cost

effectiveness of the deployment, or to

implement high-availability strategies.

2011

3 ISJCC03 Enabling Public Auditability and

Data Dynamics for Storage

Security in Cloud Computing

To achieve efficient data dynamics, we

improve the existing proof of storage

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.

2011

4 ISJGC04 SOAP Processing Performance

and Enhancement

SOAP communications produce considerable

network traffic, making them unfit for

distributed, loosely coupled and

heterogeneous computing environments such

as the open Internet. Also, they introduce

higher latency and processing delays than

other technologies, like Java RMI and

CORBA. WS research has recently focused

on SOAP performance enhancement.

2011

Iris Solutions




Pag

e16

5 ISJGC05 An Improved Ant Algorithm for

Grid Scheduling Problem Using

Biased Initial Ants

Finding optimal schedules for such an

environment is an NP-hard problem, and so

heuristic approaches must be used. The goal

of grid task scheduling is to achieve high

system throughput and to allocate various

computing resources to applications. Many

different methods have been proposed to

solve this problem

2011

6 ISJGC06 Weather data sharing system: an

agent-based distributed data

management

Intelligent agents can play an important role

in helping achieve the ‗data grid‘ 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

2011

7 ISJGC07 Bi-Criteria Scheduling Of

Scientific Grid Workflows

Bi-criteria scheduling approaches for

scientific work flows are usually restricted

to certain criterion pairs and require the user

to define his preferences either as weights

assigned each criterion or as fixed

constraints defined for one criterion. The

first approach has the drawback that

combining multiple criteria into a single

objective function is not always intuitive to

the end-user, while the second requires a

priori knowledge about the result of the first

criteria scheduling result

2010

8 ISJGC08 A Distributed Protocol to Serve

Dynamic Groups For Peer-to-Peer

Streaming

We propose a distributed overlay

framework for dynamic groups where users

may frequently hop from one group to

another while the total pool of users remain

stable. SMesh first builds a relatively stable

mesh consisting of all hosts for control

messaging. The mesh supports dynamic host

joining and leaving, and will guide the

construction of delivery trees

2010

J2EE TECHNOLOGY: J2EE

DOMAIN : IEEE TRANSACTIONS ON J2EE


Iris Solutions




Pag

e17

1 ISJ2EE1 Integrating Visual Saliency and

Consistency for Re-ranking Image

Search Results

Visual saliency. From visual aspect, it is

obvious that salient images would be easier

to catch users eyes and it is observed that

these visually salient images in the front

pages are often relevant to the users query.

2011

2 ISJ2EE2 Information Security: End User

Behavior and Corporate Culture

(Employee Information

Management System)

Information security is to protect valuable

assets. The majority of information security

specialists believe that promoting good end

user behavior and constraining bad end user

behavior is an important component of an

effective ISMS. Implementing effective

information security involves understanding

security-related risk, then developing and

implementing appropriate controls.

2011

3 ISJ2EE3 Matching Estimates of the Effect

of College Attendance on

Individual Income

We compare the use of OLS regression and

propensity score matching methods, and

incorporate the role of ldquo common

support .rdquo Using data from the CHFLS

Survey, we estimate career outcomes.

2011

4 ISJ2EE4 Attention modeling for video

quality assessment: balancing

global quality and local quality

Overall quality of a distorted video is a

weighted average between the global quality

and the local quality. The proposed video

quality modeling algorithm can improve the

performance of image quality metrics on

video quality assessment compared to the

normal averaged spatiotemporal pooling.

2011

5 ISJ2EE5 Movie summarization based on

audiovisual saliency detection

Visual saliency is measured by means of a

spatiotemporal attention model driven by

various feature cues (intensity, color,

motion). Audio and video curves are

integrated in a single attention curve, where

events may be enhanced. The presence of

salient events is signified on this audiovisual

curve by geometrical features such as local

extreme, sharp transition points & level sets.

2011

6 ISJ2EE6 Research on B2B E-Business

System of Bookshop Based on

Web Service

The model to B2B E-Business System of

Bookshop, which includes the management

subsystem of order, book information,

bookshop information, bill information, and

customer relations.

2010

Iris Solutions




Pag

e18

DOTNET TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON NETWORKING


1 ISDNW01 Towards Realizable, Low-Cost

Broadcast Systems for Dynamic

Environments

In this project, popular broadcast scheduling

approaches are tested from an

implementation cost aspect, and the results

render them only conditionally realizable.

2011

2 ISDNW02 Research on cloud computing

application in the peer-to-peer

based video–on-demand systems

A traditional method of using load balancing

and multiple buffer servers we found that

the performance of Hadoop framework was

improved significantly in feasibility and

efficiency when dealing with large data.

2011

3 ISDNW03 A Secure Communication Game

with a Relay Helping the

Eavesdropper

A four terminal network with a source, a

destination, an eavesdropper and a 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 causally.

2011

4 ISDNW04 Optical Layer Security in Fiber-

Optic Networks

Our goal is the security threats in an 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.

2011

5 ISDNW05 Model-Based Identification of

Dominant Congested Links

A novel model-based approach for dominant

congested link identification that is based on

interpreting probe loss as an unobserved

(virtual) delay. We develop parameter

inference algorithms for hidden Markov

2011

Iris Solutions




Pag

e19

model (HMM) and Markov model with a

hidden dimension (MMHD) to infer this

virtual delay.

6 ISDNW06 Live Streaming With Receiver-

Based Peer-Division

Multiplexing

Packet traces are collected from a single or a

limited number of measurement points, to

infer various properties of traffic on the

control and data planes. Although such

studies are useful to compare different

systems from the end-user's perspective, it is

difficult to intuitively understand the

observed properties without fully reverse-

engineering the underlying systems.

2011

7 ISDNW07 Adjacent Link Failure

Localization With Monitoring

Trails in All-Optical Mesh

Networks

Being reported as the most general

monitoring structure for out-of-band failure

localization approach, the monitoring trail

(m-trail) framework has been witnessed with

great efficiency and promises to serve in the

future Internet backbone with all-optical

mesh wavelength division multiplex

(WDM) networks.

2011

8 ISDNW08 Predictive Resource Management

of Multiple Monitoring

Applications

The monitoring system preserves a high

degree of flexibility, increasing the range of

applications and network scenarios where it

can be used. We implemented our load-

shedding-based resource management

scheme in an existing network monitoring

system and deployed it in a large research

and educational network.

2011

9 ISDNW09 Active Monitoring and Alarm

Management for Fault

Localization in Transparent All-

Optical Networks

It focuses the error locations (Localization)

which is occurring on the Optical Networks

and when we monitoring the fault

localization, we arrange the alarm to make

active the users.

2010

10 ISDNW10 Logoot-Undo: Distributed

Collaborative Editing System on

P2P Networks

This project presents the Logoot-Undo

Commutative Replicated Data Type

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.

2010

11 ISDNW11 Multiuser Diversity Gain in

Cognitive Networks

An large cognitive networks granted

concurrent spectrum access with license-

holding users and Dynamic allocation of

resources to the best link in multiuser n/w.

2010

Iris Solutions




Pag

e20

12 ISDNW12 Correlation-Based Traffic

Analysis Attacks on Anonymity

Networks

This paper proposes attacks that exploit the

timing behavior and applications in low-

latency Anonymity networks.

2010

13 ISDNW13 Optimal Resource Placement in

Structured Peer-to-Peer Networks

This Paper proposes an optimal resource

(replica or link) placement strategy, which

can optimally trade off the performance gain

and paid cost in Peer-to-Peer Networks

2010

14 ISDNW14 SocioNet: A Social-Based

Multimedia Access System for

Unstructured P2P Networks

This paper proposes SocioNet, based on the

relationship form social network and share

contents by preference. Sharing takes place in

3 ways such as regular, small world, random.

2010

15 ISDNW15 Load Balancing for Parallel

Applications on Group Of

Systems

A communication-aware load- balancing

technique that is capable of improving the

performance of communication-intensive

applications by increasing the effective

utilization of networks in cluster

environments. We introduce a behavior

model for parallel applications with large

requirements of network, CPU, memory,

and disk I/O resources.

2010

16 ISDNW16 Cache Maintenance over Wireless

Ad Hoc Networks

The efficiency of data access in caching

systems largely depends on the cost for

maintaining cache consistency, which can

be high in wireless ad hoc networks due to

network dynamism. In this paper, we

propose a general consistency model called

Probabilistic Delta Consistency (PDC),

which integrates the flexibility granted by

existing consistency models, covering them

as special cases.

2010

17 ISDNW17 Any Cast Based Packet

Forwarding Scheme For MDML

We are interested in minimizing the delay

and maximizing the lifetime of event-driven

wireless sensor networks for which events

occur infrequently. Sleep–wake scheduling

could result in substantial delays because a

transmitting node needs to wait for its next-

hop relay node to wake up. To reduce delays

we use ―any cast‖-based packet forwarding

schemes.

2010

18 ISDNW18 Sharing Memory between

Byzantine Processes Using

Policy-Enforced Tulle Spaces

This system protecting shared memory from

the unauthorized node in Network by fine-

grained access policies and it will Transfer

the data‘s in a network using byzantine

2009

Iris Solutions




Pag

e21

process.

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITY


1 ISDNS01 A Generic Framework for Three-

Factor Authentication: Preserving

Security and Privacy in

Distributed Systems

A well designed three-factor authentication

protocol can greatly improve the

information assurance in distributed

systems. Three-factor authentication is

introduced to incorporate the advantages of

the authentication based on password,

smart-card and biometrics.

2011

2 ISDNS02 Deadlock-Free Adaptive Routing

in Meshes with Fault-Tolerance

Ability Based on Channel

Overlapping

A new deadlock-free adaptive routing

algorithm for meshes was proposed for 3D

meshes based on a new virtual network

partitioning scheme called channel

overlapping. The proposed deadlock-free

adaptive routing algorithm was extended to

a deadlock-free adaptive fault tolerant

routing algorithm in 3D meshes with the

same deadlock avoidance technique which

can outperform other previous methods.

2011

3 ISDNS03 RITAS: Services for Randomized

Intrusion Tolerance

A stack of randomized intrusion-tolerant

protocols is described and its performance

evaluated under several settings in both

LAN and wide-area-network environments.

The stack provides a set of relevant services

ranging from basic communication

primitives up to atomic broadcast.

2011

4 ISDNS04 Online Intrusion Alert

Aggregation with Generative

Data Stream Modeling

Alert aggregation is an important subtask of

intrusion detection. The goal is to identify

and to cluster different alerts—produced by

low-level intrusion detection systems,

firewalls, etc.—belonging to a specific

attack instance which has been initiated by

an attacker at a certain point in time.

2011

5 ISDNS05 Replica Placement for Route

Diversity in Tree-Based Routing

Distributed Hash Tables

Distributed hash tables share storage and

routing responsibility among all nodes in a

peer-to-peer network. These networks have

bounded path length unlike unstructured

networks. The impact of Max Disjoint on

2011

Iris Solutions




Pag

e22

routing robustness compared to other

placements when nodes are compromised at

random or in a contiguous run.

6 ISDNS06 Prime: Byzantine Replication

under Attack

This project demonstrates the extent of

performance degradation possible in some

existing protocols that do satisfy liveness

and that do perform well absent Byzantine

faults. We propose a new performance

oriented Correctness criterion that requires a

consistent level of performance, even with

Byzantine faults.

2011

7 ISDNS07 Nymble: Blocking Misbehaving

Users in Anonymzing Networks

Anonymizing networks such as Tor allow

users to access Internet services 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 compromising their anonymity.

2011

8 ISDNS08 Dynamics of Malware Spread in

Decentralized Peer-to-Peer

Networks

We formulate an analytical model to

characterize the spread of malware in

decentralized, Gnutella type peer-to-peer

(P2P) networks and study the dynamics

associated with the spread of malware.

Using a compartmental model, we derive the

system parameters or network conditions

under which the P2P network may reach a

malware free equilibrium.

2011

9 ISDNS09 Improving Security and

Efficiency in Attribute-Based

Data Sharing

We propose a novel Cipher text policy

attribute-based encryption (CP-ABE)

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.

2011

10 ISDNS10 Using Web-Referral

Architectures to Mitigate Denial-

of-Service Threats

We systematically design a security-driven

scheduling architecture that can dynamically

measure the trust level of each node in the

system by using differential equations

2010

Iris Solutions




Pag

e23

11 ISDNS11 Against Flooding Attacks Using

Game Theory based Puzzle

Approach

In recent years, a number of puzzle-based

defense mechanisms have been proposed

against flooding denial-of-service (DoS)

attacks in networks. This paper utilizes

game theory to propose a series of optimal

puzzle-based strategies for handling

increasingly sophisticated flooding attack

scenarios

2010

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON DATAMINING

SNO P. CODE PROJECT TITLES DESCRIPTION YEAR

1 ISDDM01 Mining Group Movement

Patterns for Tracking Moving

Objects Efficiently

Encryption and multiplexing technique not

only enhances the security of 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

2011

2 ISDDM02 Mining Iterative Generators and

Representative Rules for

Software Specification Discovery

We introduce a novel concept of

representative rules expressing forward,

backward, and in-between temporal

constraints. These rules characterize many

real-world constraints including those found

in software specifications and can be

constructed by pairing iterative generators

with closed iterative patterns.

2011

3 ISDDM03 On Computing Farthest

Dominated Locations

The concept of Data mining such as NN and

closest Pair is used. Based on the client‘s

query, the database will be giving the

nearest datasets and by the using Closest-

Pair concept, we can point the object (data)

location and neglect spatial location.

2011

4 ISDDM04 Efficient Relevance Feedback for

Content-Based Image Retrieval

by Mining User Navigation

Patterns

We propose a novel method NPRF to

achieve the high efficiency and effectiveness

of CBIR in coping with the large-scale

image data. In terms of efficiency, the

iterations of feedback are reduced

substantially by using the navigation

patterns discovered from the user query log.

2011

Iris Solutions




Pag

e24

Our proposed search use three kinds of

query refinement strategies QPM, QR and

QEX to converge the search space toward

the user‘s intention effectively.

5 ISDDM05 Authenticated Multistep NN

Nearest Neighbor Search

We are using NN concept to provide

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.

2011

6 ISDDM06 Missing Value Estimation for

Mixed-Attribute Data Sets

Missing data imputation aims at providing

estimations for missing values by reasoning

from observed data. Missing data imputation

is a key issue in learning from incomplete

data. Various techniques have been

developed with great successes on dealing

with missing values in data sets with

homogeneous attributes.

2011

7 ISDDM07 Extended XML Tree Pattern

Matching: Theories and

Algorithms

We research a large set of XML tree pattern,

called extended XML tree 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.

2011

8 ISDDM08 Bridging Domains Using World

Wide Knowledge for Transfer

Learning

A novel transfer learning approach, called

BIG (Bridging information Gap), to

effectively extract useful knowledge in a

worldwide knowledge base.

2010

9 ISDDM09 Closing the Loop in Webpage

Understanding

This project focuses on the concept of

information extraction is processing from a

web page and its content.

2010

10 ISDDM10 Knowledge-Based Interactive

Post mining of Association Rules

Using Ontologies

This paper proposes a new interactive

approach to prune and filter discovered

rules.1) Integration of user knowledge in the

post processing task. 2) The Rule Schema

formalism extending the specification

language for user expectations

2010

11 ISDDM11 Filtering Data flow for

Continuous Queries

Query tolerance is expressed as a 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

2010

Iris Solutions




Pag

e25

query. In this paper We develop fraction-

based tolerance for two major classes of

entity-based queries

12 ISDDM12 Through Linking for Transfer

Learning Using Web

Our approach at automatically adapting 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.

2010

13 ISDDM13 A Binary String Approach for

Updates XML Data

To facilitate XML query processing, several

labeling schemes have been proposed, in

which the ancestor-descendant and parent-

child relationships in XML queries can be

quickly determined without accessing the

original XML file. A novel labeling scheme,

called IBSL (Improved Binary String

Labeling), which supports order sensitive

updates without relabeling or recalculation.

2010

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING


1 ISDMC01 A Policy Enforcing Mechanism

for Trusted Ad Hoc Networks

The design and implementation of a 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.

2011

2 ISDMC02 Call Admission Control

Performance Analysis in Mobile

In efficient CAC scheme for mobile networks

that takes into account voice connections,

2011

Iris Solutions




Pag

e26

Networks Using Stochastic Well-

Formed Petri Nets

synchronous and asynchronous data

connections. Furthermore, we use SWNs to

model the system interaction, which consists

of several mobile nodes, gateways, cells, and

servers. We present analytical performance

results using the WNSIM symbolic simulator

of Great SPN tool.

3 ISDMC03 An Adaptive Network Coded

Retransmission Scheme for

Single-Hop Wireless Multicast

Broadcast Services

An adaptive scheme that maintains the

highest bandwidth efficiency obtainable by

both opportunistic and full network coding

schemes in wireless MBS. The proposed

scheme adaptively selects, between these

two schemes, i) To achieve the better

bandwidth efficiency performance. ii)

Using random graph theory.

2011

4 ISDMC04 An Optimal Algorithm for Relay

Node Assignment in Cooperative

Ad Hoc Networks

Our goal is we study the relay node

assignment problem in a cooperative ad hoc

network environment, where multiple

source–destination pairs compete for the

same pool of relay nodes in the network.

Our objective is to assign the available relay

nodes to different source–destination pairs

so as to maximize the minimum data rate

among all pairs.

2011

5 ISDMC05 Localization of Mobile Nodes in

Wireless Networks with

Correlated in Time Measurement

Noise

Wireless sensor networks are an inherent

part of decision making, object tracking, and

location awareness systems. This work is

focused on simultaneous localization of

mobile nodes based on received signal

strength indicators (RSSIs) with correlated

in time measurement noises.

2011

6 ISDMC06 Load Shedding in Mobile

Systems with MobiQual

The CQ server must receive and process

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.

2011

7 ISDMC07 Cooperative Channelization in

Wireless Networks with Network

Coding

A health metric is proposed to allow

comparison of need for channelization of

different multicast links. Cooperative

2011

Iris Solutions




Pag

e27

channelization considers the impact of

channelization on overall network

performance before resource reservation is

triggered. Our results show that cooperative

channelization improves overall network

performance while being well suited for

wireless networks using network coding.

8 ISDMC08 Uncertainty Modeling and

Reduction in MANETs

A technique to efficiently reduce uncertainty

and proactive Schemes exploit mobile nodes

to collect and broadcast trust information to

achieve trust convergence.

2010

9 ISDMC09 MABS: Multicast Authentication

Based on Batch Signature

The scheme (MABS-B) eliminates the

correlation among packets by using batch

signature. This supports the authentication

of any number of packets Simultaneously.

2010

10 ISDMC10 Detection of Hacking in Wireless

Using Access Points

We explore the use of clock skew of a

wireless local area network access point

(AP) as its fingerprint to detect unauthorized

APs quickly and accurately. The main goal

behind using clock skews is to overcome—

the inability to effectively detect Medium

Access Control (MAC) addresses spoofing.

We use two different methods for this

purpose—one based on linear programming

and the other based on least-square fit for

differentiating original packets from those

sent by the fake APs.

2010

11 ISDMC11 Secure Distance-Based

Localization in the Presence of

Cheating Beacon Nodes

We attempt to answer these and other related

questions by following a careful 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.

2010

12 ISDMC12 Multicast Based Efficient and

Distributed Replica Detection in

Large-Scale Sensor Networks

In a node replication attack, an adversary

can take advantage of the credentials of a

compromised node to surreptitiously

introduce replicas of that node into the

network. A novel distributed approach

called Localized Multicast for detecting

node replication attacks. The efficiency and

security of our approach are evaluated both

theoretically and via simulation.

2010

Iris Solutions




Pag

e28

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSING

SNO P.CODE PROJECT TITLES DESCRIPTION YEAR

1 ISDIP01 High-quality Reflection

Separation using Polarized

Images

A problem of separating the effect of

reflection from 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. We

propose a framework that allows us to fully

exploit the mutually exclusive image

information in our input data.

2011

2 ISDIP02 PSF Estimation via Gradient

Domain Correlation

An efficient method to estimate the PSF

(point spread function) of a blurred image

using image gradients spatial correlation. A

patch based image degradation model is

proposed for estimating the sample

covariance matrix of the gradient domain

natural image. The PSF is computed using

phase retrieval technique to remove the

ambiguity introduced by the absence of the

phase.

2011

3 ISDIP03 Practical Bounds on Image

Denoising: From Estimation to

Information

The bound was computed directly from the

noise-free image that was assumed to be

available. In this work, we extend the

formulation to the more practical case where

no ground truth is available. We show that

the parameters of the bounds, namely the

cluster co variances and level of redundancy

for patches in the image, can be estimated

directly from the noise corrupted image.

2011

4 ISDIP04 A New Chaos-Based

Cryptosystem for Secure

Transmitted Images

A novel and robust chaos-based

cryptosystem for secure transmitted images

and four other versions. In the proposed

block encryption/decryption algorithm, a 2D

chaotic map is used to shuffle the image

pixel positions.

2011

5 ISDIP05 An Optimum Land Cover Occurrence of shadowy pixels in remote 2011

Iris Solutions




Pag

e29

Mapping Algorithm in the

Presence of Shadows

sensing images is a common phenomenon

particularly with passive sensors. The main

purpose of this algorithm is to find the most

likely land cover map along with the

shadow-free image and light intensity image

as byproducts. Our results show that a large

number of misclassified pixels can be

corrected.

6 ISDIP06 In-Image Accessibility Indication An in-image accessibility indication scheme,

which aims to automatically point out

regions in which the content can hardly be

recognized by colorblind viewers in a

manually designed image. The proposed

method first establishes a set of points

around which the patches are not prominent

enough for colorblind viewers due to the

loss of color information.

2010

7 ISDIP07 Sparse Bayesian Learning of

Filters for Efficient Image

Expansion

A framework for expanding a given image

using an interpolator that is trained in

advance with training data, based on sparse

Bayesian estimation.

2010

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING


1 ISDCC01 Supply Chain as a Service: A

Cloud Perspective on Supply

Chain Systems

The idea of Cloud Computing for service

representation and service composition in

supply chain systems. The resulting models

allow for representing operations in supply

Chain systems as interconnected services

and describing compositions of such

services. Supply chains are characterized by

multiple firms providing their resources and

processes to meeting customer demand in an

efficient manner.

2011

2 ISDCC02 Performance Analysis of Cloud

Computing Services for Many-

Tasks Scientific Computing

We quantify the presence in real scientific

computing workloads of Many-Task

Computing (MTC) users, that is, of users

who employ loosely coupled applications

comprising many tasks to achieve their

scientific goals. We compare through trace-

based simulation the performance

2011

Iris Solutions




Pag

e30

characteristics and cost models of clouds

and other scientific computing platforms, for

general and MTC-based scientific

computing workloads.

3 ISDCC03 Enabling Public Auditability and

Data Dynamics for Storage

Security in Cloud Computing

We consider the task of allowing a third

party auditor (TPA), on behalf of the cloud

client, to verify the integrity of the dynamic

data stored in the cloud. The introduction of

TPA eliminates the involvement of the

client through the auditing of whether his

data stored in the cloud are indeed intact,

which can be important in achieving

economies of scale for Cloud Computing.

2011

4 ISDCC04 A Venture Perspective on Cloud

Computing

Cloud and mobile computing appear to

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 and retention.

2011

5 ISDGC05 Data Replication in Data

Intensive Scientific Applications

with Performance Guarantee

Data replication has been well adopted in

data intensive scientific applications to

reduce data file transfer time and bandwidth

consumption. In Grid simulator, we

demonstrate that the distributed caching

technique significantly outperforms an

existing popular file caching technique in

Data Grids, and it is more scalable and

adaptive to the dynamic change of file

access patterns in Data Grids.

2011

6 ISDGC06 Scheduling Grid Tasks in Face of

Uncertain Communication

Demands

Grid scheduling is essential to Quality of

Service provisioning, efficient management

of grid resources. The IPDT-FUZZY

scheduler, a scheduler which considers the

demands of grid applications with such

uncertainties. The scheduler uses fuzzy

optimization, and both computational and

communication demands are expressed as

fuzzy numbers. The results reinforce its

adequacy for dealing with the lack of

accuracy in the estimation of

communication demands.

2011

Iris Solutions




Pag

e31

7 ISDGC07 Reputation-Based Trust for a

Cooperative Agent-Based Backup

Protection Scheme

This paper explores integrating a reputation-

based trust mechanism with an agent-based

backup protection system to help protect

against malicious or byzantine failures. The

improved decision-making capability of

agents who incorporate this cooperative trust

method in the presence of failures in

neighboring relays.

2011

8 ISDGC08 ABACS: An Attribute-Based

Access Control System for

Emergency Services over

Vehicular Ad Hoc Networks

ABACS for emergency services with security

assurance over VANETs. ABACS aims to

improve the efficiency 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.

2011

9 ISDGC09 Information Theoretic Aspects of

Users‘ Activity in a Wyner-Like

Cellular Model

This paper proposes an application of

multiuser information theory to the study of

the uplink of a communication system with

Randomly activated users.

2010

10 ISDGC10 Multifunctional MIMO Systems:

A Combined Diversity And

Multiplexing Design Perspective

In this project, the concept MIMO which is

collecting the INPUT (data) of the Client to

provide the collected data to the receivers

through a single way.

2010

TECHNOLOGY: DOTNET

DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING

SNO P.CODE PROJECT TITLES DESCRIPTION YEAR

1 ISDSE01 Plat_Forms: A Web Development

Platform Comparison by an

Exploratory Experiment

Searching for Emergent Platform

Properties

Developing Web-based applications, there

exist several competing and widely used

technological platforms each with an

accompanying development culture and

style. In a nonrandomized, controlled

experiment, framed as a public contest

called ―Plat_Forms,‖ top-class teams of

three professional programmers competed to

implement the same requirements for a Web

based application.

2011

Iris Solutions




Pag

e32

2 ISDSE02 Software Module Clustering as a

Multi–Objective Search Problem

The multi-objective paradigm for automated

software module clustering is introduced.

Two formulations of the multiple objective

approaches are studied: the Equal-size

Cluster Approach (ECA) and the

Maximizing Cluster Approach (MCA).

2011

3 ISDSE03 Facilitating Trust in Privacy-

preserving E-learning

Environments

We present a privacy-preserving reputation

management system which allows secure

transfer of reputation. A prototypical

implementation of our reputation transfer

protocol and the successful experimental

deployment of our reputation management

solution in an e-learning discussion forum

serve as a proof of concept.

2011

4 ISDSE04 Comparing the Defect Reduction

Benefits of Code Inspection and

Test-Driven Development

We compared the software defect rates and

implementation costs associated with two

methods of software defect reduction: code

inspection and test-driven development.

2011

5 ISDSE05 Efficient Consistency

Measurement Based on

Behavioral Profiles of Process

Models

Engineering of process-driven business

applications can be supported by process

modeling efforts in order to bridge the gap

between business requirements and system

specifications. We use behavioral profiles

for the definition of a formal notion of

consistency which is less sensitive to model

projections than common criteria of

behavioral equivalence and allows for

quantifying deviation in a metric way.

2011

6 ISDSE06 Automated Test Generation From

A Behavioral Model

A fully automatic model-driven technique to

generate test cases for Graphical user

interfaces (GUIs)- based applications. The

technique uses feedback from the execution

of a ―seed test suite,‖ which is generated

automatically using an existing structural

event interaction graph model of the GUI.

During its execution, the runtime effect of

each GUI event on all other events pinpoints

event semantic interaction (ESI)

relationships, which are used to

automatically generate new test cases.

2010

iris solutions- ieee 2011 project titles for me,m.tech,m.sc, mca, be,b.tech

Technology