Java titles 2012 c

28,South Usman Road,, TNagar,
Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008
Web : www.temasolution.com
email : temasolution@gmail.com

S.NO PROJECT TITLES DOMAIN Plate
form /
YEAR
1 Cloud Computing Security From Single to Multi-Clouds

The use of cloud computing has increased rapidly in
many organizations. Cloud computing provides many
benefits in terms of low cost and accessibility of data. JAVA
Ensuring the security of cloud computing is a major factor in
the cloud computing environment, as users often store Cloud 2012
sensitive information with cloud storage providers but these computing
providers may be untrusted. Dealing with “single cloud”
providers is predicted to become less popular with
customers due to risks of service availability failure and the
possibility of malicious insiders in the single cloud. A
movement towards “multi-clouds”, or in other words,
“interclouds” or “cloud-ofclouds” has emerged recently.
This paper surveys recent research related to single and
multi-cloud security and addresses possible solutions. It is
found that the research into the use of multicloud providers
to maintain security has received less attention from the
research community than has the use of single clouds. This
work aims to promote the use of multi-clouds due to its
ability to reduce security risks that affect the cloud
computing user.

2 Efficient Audit Service Outsourcing for Data Integrity in
Clouds.
The use of cloud computing has increased rapidly in
many organizations. Cloud computing provides many
benefits in terms of low cost and accessibility of data.
Ensuring the security of cloud computing is a major factor in JAVA
the cloud computing environment, as users often store
sensitive information with cloud storage providers but these 2012
providers may be untrusted. Dealing with “single cloud”
providers is predicted to become less popular with
customers due to risks of service availability failure and the

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

possibility of malicious insiders in the single cloud. A
movement towards “multi-clouds”, or in other words, “inter
clouds” or “cloud-of clouds” has emerged recently.
This paper surveys recent research related to single and
multi-cloud security and addresses possible solutions. It is
found that the research into the use of multicloud providers
to maintain security has received less attention from the
research community than has the use of single clouds. This
work aims to promote the use of multi-clouds due to its
ability to reduce security risks that affect the cloud
computing user.
3. Active Visual Segmentation
Attention is an integral part of the human visual
system and has been widely studied in the visual attention
literature. The human eyes fixate at important locations in
the scene, and every fixation point lies inside a particular
region of arbitrary shape and size, which can either be an Image
entire object or a part of it. Using that fixation point as an processing
identification marker on the object, we propose a
method to segment the object of interest by finding the JAVA
“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 2012
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. Having two
separate steps also makes it possible to establish a simple
feedback between the mid-level cue (regions) and the low-
level visual cues (edges). In fact, we propose a segmentation
refinement process based on such a feedback process.
Finally, our experiments show the promise of the proposed
method as an automatic segmentation framework for a
general purpose visual system.
4. Persuasive Cued Click-Points.
This paper presents an integrated evaluation of the
Persuasive Cued Click-Points graphical password scheme, JAVA
including usability and security evaluations, and
implementation considerations. An important usability goal 2012
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. We use

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

persuasion to influence user choice in click-based graphical
passwords, encouraging users to select more random, and
hence more difficult to guess, click- points.
5. Visual Cryptography.
The visual cryptography (VC) is a secret sharing scheme
where a secret image is encoded into transparencies, and
the stacking of any out of transparencies reveals the secret
image. The stacking of or fewer transparencies is unable to JAVA
extract any information about the secret .We discuss the
additions and deletions of users in a dynamic user group. To
reduce the overhead of generating and distributing
transparencies in user changes, this paper proposes a VC 2012
scheme with unlimited based on the probabilistic model.
The proposed scheme allows to change dynamically in order
to include new transparencies without regenerating and
redistributing the original transparencies. Specifically, an
extended VC scheme based on basis matrices and a
probabilistic model is proposed. An equation is derived from
the fundamental definitions of the VC scheme, and then the
VC scheme achieving maximal contrast can be designed by
using the derived equation. The maximal contrasts with to
are explicitly solved in this paper.
6.
A Secure Intrusion detection system against DDOS attack
in Wireless Mobile Ad1
Wireless Mobile ad-hoc network (MANET) is an emerging
technology and have great strength to be applied in critical
situations like battlefields and commercial applications such
as building, traffic surveillance, MANET is infrastructure less,
with no any centralized controller exist and also each node
contain routing capability, Each device in a MANET is JAVA
independently free to move in any direction, and will
therefore change its connections to other devices
frequently. So one of the major challenges wireless mobile
ad-hoc networks face today is security, because no central 2012
controller exists.
MANETs are a kind of wireless ad hoc networks that usually
has a routable networking environment on top of a link
layer ad hoc network. Ad hoc also contains wireless sensor
network so the problems is facing by sensor network is also
faced by MANET. While developing the sensor nodes in
unattended environment increases the chances of various

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

attacks. There are many security attacks in MANET and
DDoS (Distributed denial of service) is one of them. Our
main aim is seeing the effect of DDoS in routing load, packet
drop rate, end to end delay, i.e. maximizing due to attack on
network. And with these parameters and many more also
we build secure IDS to detect this kind of attack and block it.
In this paper we discussed some attacks on MANET and
DDOS also and provide the security against the DDOS attack
.
7. Fast Data Collection in Tree-Based Wireless Sensor
Networks
We investigate the following fundamental question - how
fast can 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 JAVA
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 2012
minimizing the number of time slots required (schedule
length) to complete a converge cast. Next, we combine
scheduling with transmission power control to mitigate the
effects of interference, and show that while power control
helps in reducing the schedule length under a single
frequency, scheduling transmissions using multiple
frequencies is more efficient. We give lower bounds on the
schedule length when interference is completely eliminated,
and propose algorithms that achieve these bounds. We also
evaluate the performance of various channel assignment
methods and find empirically that for moderate size
networks of about 100 nodes, the use of multi-frequency
scheduling can suffice to eliminate most of the interference.
Then, the data collection rate no longer remains limited by
interference but by the topology of the routing tree. To this
end, we construct degree-constrained spanning trees and
capacitated minimal spanning trees, and show significant
improvement in scheduling performance over different
deployment densities. Lastly, we evaluate the impact of
different interference and channel models on the schedule
length
8. An Improved Geocast for Mobile Ad Hoc Networks
Geographic addressing of packets within mobile ad hoc
networks enables novel applications, including hard real-

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

time engagement simulation in military training systems,
geographic command and control functions in training and
emergency communications, and commercial messaging
applications as well. The most scalable implementation of
geoaddressing is via a geocast protocol, where nodes JAVA
selectively retransmit packets based on local decision rules.
Well-designed retransmission heuristics yield scalable
geographic flooding that outperforms alternative
geoaddressing approaches. However, previous geocast 2012
implementations, while effective, fall into two categories.
Approaches based on flooding are unscalable due to the
high load they generate. Scalable approaches, on the other
hand, have trouble in complex environments, lacking
sufficient intelligence about the necessary directionality of
packet flow. The present paper defines a novel geocast
heuristic, the Center Distance with Priority (CD-P) Heuristic,
which both significantly improves on reliability of existing
scalable geocasts and yet also remains scalable as scenario
complexity increases. This paper describes the new
technique as well as an evaluation study comparing it to
previous approaches .

9. View-invariant action recognition based on Artificial
Neural Networks

In this paper, a novel view invariant action recognition
method based on neural network representation and
recognition is proposed. The novel representation of action
videos is based on learning spatially related human body Nerual JAVA
posture prototypes using Self Organizing Maps (SOM). Fuzzy Networks
distances from human body posture prototypes are used to 2012
produce a time invariant action representation. Multilayer
perceptrons are used for action classification.
The algorithm is trained using data from a multi-camera
setup. An arbitrary number of cameras can be
used in order to recognize actions using a Bayesian
framework. The proposed method can also be applied to
videos depicting interactions between humans, without any
modification. The use
of information captured from different viewing angles leads
to high classification performance. The proposed method is
the first one that has been tested in challenging

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

experimental setups, a
fact that denotes its effectiveness to deal with most of the
open issues in action recognition..

10 An Efficient Caching Scheme and Consistency Maintenance
in Hybrid P2P System

In this paper, a distributed adaptive Networking JAVA
opportunistic routing scheme for multi-hop wireless ad-hoc
networks is proposed.The proposed scheme utilizes a 2012
reinforcement learning framework to opportunistically
route the packets even in the absenceof reliable knowledge
about channel statistics and networkmodel. This scheme is
shown to be optimal with respect to an
expected average per packet reward criterion.
The proposed routing scheme jointly addresses the issues of
learning and routing in an opportunistic context, where the
network structure is characterized by the transmission
successprobabilities. In particular, this learning framework
leads toa stochastic routing scheme which optimally
“explores” and“exploits” the opportunities in the network
11. FireCol A Collaborative Protection Network for the
Detection of Flooding DDoS Attacks
Distributed denial-of-service (DDoS) attacks remain a major
security problem, the mitigation of which is very hard
especially when it comes to highly distributed botnet-based
attacks. The early discovery of these attacks, although
challenging, is necessary to protect end-users as well as the
expensive network infrastructure resources.
In this paper, we address the problem of DDoS attacks and
present the theoretical foundation, architecture, and
algorithms of FireCol. The core of FireCol is composed of
intrusion prevention systems (IPSs) located at the Internet
service providers (ISPs) level.
The IPSs form virtual protection rings around the hosts to
defend and collaborate by exchanging selected traffic
information. The evaluation of FireCol using extensive
simulations and a real dataset is presented, showing FireCol
effectiveness and low overhead, as well as its support for
incremental deployment in real network
12. Load Balancing Multipath Switching System with Flow
Slice.

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

Multipath switching systems (MPS) are intensely used in
state-of-the-art core routers to provide terabit or even
petabit switching capacity.
One of the most intractable issues in designing MPS is how
to load balance traffic across its multiple paths while not
disturbing the intraflow packet orders. Previous packet-
based solutions suffer from delay penalties or lead to
OðN2Þ hardware complexity, hence do not scale.
Flow-based hashing algorithms also perform badly due to
the heavy-tailed flow-size distribution. In this paper, we
develop a novel scheme, namely, Flow Slice (FS) that cuts off
each flow into flow slices at every intraflow interval larger
than a slicing threshold and balances the load on a finer
granularity. Based on the studies of tens of real Internet
traces,
we show that setting a slicing threshold of 1 4 ms, the FS
scheme achieves comparative load-balancing performance
to the optimal one. It also limits the probability of out-of-
order packets to a negligible level (106) on three popular
MPSes at the cost of little hardware complexity and an
internal speedup up to two
13. Online System for Grid Resource Monitoring.
Resource allocation and job scheduling are the core
functions of grid computing. These functions are based on
adequate information of available resources. Timely Parallel and
acquiring resource status information is of great importance Distributed
in ensuring overall performance of grid computing. This Systems
work aims at building a distributed system for grid resource
monitoring and prediction. In this paper, we present the
design and evaluation of system architecture for grid
resource monitoring and prediction. We discuss the key
issues for system implementation, including machine
learning-based methodologies for modeling and
optimization of resource prediction models. Evaluations are
performed on a prototype system. Our experimental results
indicate that the efficiency and accuracy of our system meet
the demand of online system for grid resource monitoring
and prediction.

14. Defenses Against Large Scale Online Password Guessing
Attacks by using Persuasive click Points
This paper presents an integrated evaluation of the

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

Persuasive Cued Click-Points graphical password scheme,
including usability and security evaluations, and Secure
implementation considerations. An important usability goal Computing JAVA
for knowledge-based authentication systems is to support
users in selecting passwords of higher security, in the sense 2012
of being from an expanded effective security space. We use
persuasion to influence user choice in click-based graphical
passwords, encouraging users to select more random, and
hence more difficult to guess, click-points
15. Ensuring Distributed Accountability for Data Sharing in the
Cloud
Cloud computing enables highly scalable services to be
easily consumed over the Internet on an as-needed basis. A
major feature of the cloud services is that users' data are
usually processed remotely in unknown machines that users
do not own or operate. While enjoying the convenience
brought by this new emerging technology, users' fears of
losing control of their own data (particularly, financial and
health data) can become a significant barrier to the wide
adoption of cloud services. To address this problem, in this
paper, we propose a novel highly decentralized
information accountability framework to keep track
of the actual usage
of the users'data in the cloud. In particular, we propose an
object-centered approach that enables enclosing our
logging mechanism together with users' data and policies.
We leverage the JAR programmable capabilities to both
create a dynamic and traveling object, and to ensure that
any access to users' data will trigger authentication and
automated logging local to the JARs. To strengthen user's
control, we also provide distributed auditing mechanisms.
We provide extensive experimental studies that
demonstrate the efficiency and effectiveness ofthe proposed
approaches.

16. Packet-Hiding Methods for Preventing Selective
The open nature of the wireless medium leaves it vulnerable
to intentional interference attacks, typically referred to as
jamming. This intentional interference with wireless
transmissions can be used as a launchpad for mounting
Denial-of-Service attacks on wireless networks. Typically,
jamming has been addressed under an external threat

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

model. However, adversaries with internal knowledge of
protocol specifications and network secrets can launch low-
effort jamming attacks that are difficult to detect and
counter. In this work, we address the problem of selective
jamming attacks in wireless networks. In these attacks, the
adversary is active only for a short period of time, selectively
targeting messages of high importance. We illustrate the
advantages of selective jamming in terms of network
performance degradation and adversary effort by
presenting two case studies; a selective attack on TCP and
one on routing.We show that selective jamming attacks can
be launched by performing real-time packet classification at
the physical layer. To mitigate these attacks, we develop
three schemes that prevent real-time packet classification
by combining cryptographic primitives with physical-layer
attributes. We analyze the security of our methods and
evaluate their computational and communication overhead.

17. Risk-Aware_Mitigation for MANET Routing Attacks
Mobile Ad hoc Networks (MANET) have been highly
vulnerable to attacks due to the dynamic nature of its
network infrastructure. Among these attacks, routing
attacks have received considerable attention since it could
cause the most devastating damage to MANET.
Even though there exist several intrusions response
techniques to mitigate such critical attacks, existing
solutions typically attempt to isolate malicious nodes based
on binary or naıve fuzzy response decisions. However,
binary responses may result in the unexpected network
partition, causing additional damages to the network
infrastructure, and naıve fuzzy responses could lead to
uncertainty in countering routing attacks inMANET.

In this paper, we propose a risk-aware 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.
In addition, our experiments demonstrate the effectiveness
of our approach with the consideration of several
performance metrics.

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

18. Topology Control in Mobile Ad Hoc Networks with
Cooperative Communications
Cooperative communication has received tremendous
interest for wireless networks. Most existing works on
cooperative communications are focused on link-level
physical layer issues. Consequently, the impacts of Wireless
cooperative communications on Communication
network-level upper layer issues, such as topology control, JAVA
routing and network capacity, are largely ignored. In this
article, we propose a Capacity-Optimized Cooperative 2012
(COCO) topology control scheme to improve the network
capacity in MANETs by jointly considering both upper layer
network capacity and physical layer cooperative
communications.
Through simulations, we show that physical layer
cooperative communications have significant impacts on the
network capacity, and the proposed topology control
scheme can substantially improve the network capacity in
MANETs with cooperative communications.
19. Privacy- and Integrity-Preserving Range Queries in Sensor
Networks (1)
The architecture of two-tiered sensor networks, where
storage nodes serve as an intermediate tier between
sensors and a sink for storing data and processing queries,
has been widely adopted because of the benefits of power
and storage saving for sensors as well as the efficiency of
query processing. However, the importance of storage
nodes also makes them attractive to attackers. In this paper,
we propose SafeQ, a protocol that prevents attackers from Networking JAVA
gaining information from both sensor collected data and
sink issued queries. SafeQ also allows a sink to detect
compromised storage nodes when they misbehave. To 2012
preserve privacy, SafeQ uses a novel technique to encode
both data and queries such that a storage node can
correctly process encoded queries over encoded data
without knowing their values. To preserve integrity, we
propose two schemes—one using Merkle hash trees and
another using a new data structure called neighborhood
chains—to generate integrity verification information so
that a sink can use this information to verify whether the
result of a query contains exactly the data items that satisfy
the query. To improve performance, we propose an

Chennai-17. Ph : 044-43855940
Mobile : +91-9042085008

optimization technique using Bloom filters to reduce the
communication cost between sensors and storage nodes

Java titles 2012 c

Recomendados

Recomendados

Más contenido relacionado

Destacado

Destacado (8)

Similar a Java titles 2012 c

Similar a Java titles 2012 c (20)

Más de tema_solution

Más de tema_solution (20)

Último

Último (20)

Java titles 2012 c