Skiveprojects - Software Project Titles 2011

PROJECT TOPICS
IEEE 2011-2012
IEEE TRANSACTION ON CLOUD COMPUTING Domain: Dot. Net
Sl.No Project Code

1 SDCC01
Project Titles
Year
EduCloud: PaaS Versus IaaS Cloud Usage for an Advanced Computer Science Course
Description: Demonstrates that platform clouds are valued by both students and professors to achieve the course objectives and that clouds offer a significant improvement over the previous situation in labs where much effort was devoted to setting up the software necessary for course activities
2011
SDCC02
CloudTPS: Scalable Transactions for Web Applications in the Cloud

Description: CloudTPS is a scalable transaction manager which guarantees full ACID properties for multi-item transactions issued by Web applications, even in the presence of server failures and network partitions. We implement this approach on top of the two main families of scalable data layers:
2011
Fabsys Technologies Pvt.Ltd | 1 IEEE Projects Software
SDCC03
A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability
Description: Proposed protocol supports public verifiability without help of a third party auditor. In addition, the proposed protocol does not leak any private information to third party verifiers. Through a formal analysis, we show the correctness and security of the protocol
2011
SDCC04
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Description: Identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for the seamless integration of these two salient features in our protocol design.
2011
SDCC05
Optimal Service Pricing for a Cloud Cache

Description: A novel SOA-aware approach with a special focus on the data flow. The tight interaction of new cloud technologies with SOA technologies enables us to optimize the execution of data-intensive service applications by reducing the data exchange tasks to a minimum.
2011
SDCC06
Failure Avoidance through Fault Prediction Based on Synthetic Transactions

Description: enhance an online services reliability, availability and performance. Synthetic transactions in pre-production environments, and combined with data-mining on compact, specialized logs for predicting the failures in the system, and the environment conditions that that correlate to failures.
2011
SDCC07
Multi-level
Intrusion
Detection
system
and
Log
2011
Management in Cloud Computing

Description: A method that enables cloud computing systems both effectiveness of using system resource and system strength of security. 8 SDCC08
Using Cloud Technologies to Optimize Data-Intensive Service Applications

Description: The tight interaction of new cloud technologies with SOA technologies enables us to optimize the execution of data-intensive service applications by reducing the data exchange tasks to a minimum.
2010
IEEE TRANSACTION ON MOBILE COMPUTING Domain: Dot. Net
Sl.No
Project Code
Project Titles
Year
SDMC01 Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks
Description: Efficient Geographic Multicast Protocol -uses a virtualzone-based structure to implement scalable and efficient group membership management.
2011
SDMC02 Enabling Efficient Peer-to-Peer Resource Sharing in Wireless Mesh Networks

Description: Starting from the well-known Chord protocol for resource sharing in wired networks, it propose a specialization that accounts for peculiar features of wireless mesh networks: namely, the availability of a wireless infrastructure, and the 1-hop broadcast nature of wireless communication, which bring to the notions of location awareness and MAC layer cross-layering.
2010
SDMC03 A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks
Description: A distributed and scalable scheduling access scheme that mitigates high data loss in data-intensive sensor networks and can also handle some mobility. It alleviates transmission collisions by employing virtual grids that adopt Latin Squares characteristics to time slot assignments.
2011
SDMC04 Secure High-Throughput Multicast Routing in Wireless Mesh Networks

Description: Identify novel attacks against high throughput multicast protocols in wireless mesh networks.
2011
SDMC05
Message Authentication in Computationally Constrained Environments

Description:An approach to implement a compact HMAC by the use of stream ciphering is presented in this paper.
2010
SDMC06
Efficient Broadcasting in Mobile AD-Hoc Network

Description:the first broadcasting algorithm that constructs a CDS "on
2010
the fly" and can guarantee both full delivery and a constant approximation ratio to the optimal solution.
SDMC07
Multicasting with Localized Control in Wireless AD-Hoc Network

Description: The proposed scheme combines the layered multicast concept with the routing-based congestion avoidance idea to reduce the aggregated rate of multicast flows when they use excessive bandwidth on a wireless link.
2010
IEEE TRANSACTION ON DEPENDABLE AND SECURE COMPUTING,

NETWORK SECURITY
Domain: Dot. Net
Sl.NO 1.
Code SDNS01
Project titles SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless
Description: Ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in WMNs.
Year 2011
2.
SDNS02
Replica Placement for Route Diversity in Tree-based Routing Distributed Hash Tables
Description: Tree-based routing DHTs and define MAXDISJOINT, that creates route diversity for these DHTs.
2011
3.
SDNS03
Privacy-Preserving
Updates
to
Anonymous
and
2011
Confidential Databases
Description: Protocols solving suppression-based and generalizationbased k-anonymous and confidential databases. And it will rely on wellknown cryptographic assumptions.
4.
SDNS04
Revisiting Defenses Against Large-Scale Online Password Guessing Attacks

Description: Propose a new Password Guessing Resistant Protocol
2011
(PGRP), derived upon revisiting prior proposals designed to restrict such attacks.
5.
SDNS05
Balancing Revocation and Storage Trade-Offs in Secure Group Communication

Description: Trade-offs between storage cost and rekeying cost for secure multicast. Hybrid key management algorithm
2011
6.
SDNS06
Nymble: Blocking Misbehaving Users in Anonymizing Networks

Description: Servers can blacklist misbehaving users, thereby blocking users without compromising their anonymity. Nymble Tickets and Credentials, Blacklist.
2011
7.
SDNS07
Blind
Authentication:
Secure
Crypto-Biometric
2010
Verification Protocol
Description: we propose a Provably secure and blind biometric authentication protocol, which addresses the concerns of users privacy, template protection, and trust issues. The protocol is blind in the sense that it reveals only the identity, and no additional information about the user or the biometric to the authenticating server or vice-versa. As the protocol is based on asymmetric encryption of the biometric data, it captures the advantages of biometric authentication as well as the security of public key cryptography. The authentication protocol can run over public networks and provide non reputable identity verification.
8.
SDNS08
An Architectural Approach to Preventing Code Injection Attacks

Description: We propose a change to the memory architecture of
2010
modern processors that addresses the code injection problem at its very root by virtually splitting memory into code memory and data memory such that a processor will never be able to fetch injected code for execution. This virtual split memory system can be implemented as a software-only patch to an operating system and can be used to supplement existing schemes for improved protection.
9.
SDNS09
Authenticated Group Key Transfer Protocol Based on Secret Sharing

Description: we propose an authenticated key transfer protocol based on secret sharing scheme that KGC can broadcast group key information to all group members at once and only authorized group members can recover the group key; but unauthorized users cannot recover the group key. The confidentiality of this transformation is information theoretically secure.
2010
10.
SDNS10
Beyond Output Voting: Detecting Compromised Replicas Using HMM-Based Behavioral Distance
Description: we present a novel approach to behavioral distance measurement using a new type of Hidden Markov Model, and present an architecture realizing this new approach. We evaluate the detection capability of this approach using synthetic workloads and recorded workloads of production web and game servers, and show that it detects intrusions with substantially greater accuracy than a prior proposal on measuring behavioral distance.
2009
11.
SDNS11
Flexible and Rollback recovery for grid environment

Description: This paper presents two fault-tolerance mechanisms called Theft-Induced Checkpointing and Systematic Event Logging. These are transparent protocols capable of overcoming problems associated with
2009
both benign faults, i.e., crash faults, and node or subnet volatility. Specifically, the protocols base the state of the execution on a dataflow graph, allowing for efficient recovery in dynamic heterogeneous systems as well as multithreaded applications.
12.
SDNS12
Accurately Measuring Denial of Service in Simulation and Testbed Experiments

Description: We propose several DoS impact metrics that measure the quality of service experienced by users during an attack. Our metrics are quantitative: they map QoS requirements for several applications into measurable traffic parameters with acceptable, scientifically determined thresholds.
2009
13.
SDNS13
Credit card fraud detection using hidden Markov model

Description: An HMM is initially trained with the normal behavior of a cardholder. If an incoming credit card transaction is not accepted by the trained HMM with sufficiently high probability, it is considered to be fraudulent.
2009
IEEE TRANSACTION ON KNOWLEDGE AND DATA ENGINEERING, DATAMINING Domain: Dot. Net
Sl.No 1.
Code
Project Titles
Year 2011
SDDM01 Mining Group Movement Patterns For Tracking Moving Objects Efficiently
Description: Comprises a local mining phase and a cluster ensembling phase to finds movement patterns based on local trajectories. Then, based on the derived patterns, similarity measure to compute the similarity of moving objects and identify the local group relationships.
2.
SDDM02 Efficient Periodicity Mining In Time Series Databases Using Suffix Trees
Description: Detect symbol, sequence (partial), and segment (full cycle) periodicity in time series. The algorithm uses suffix tree as the underlying data structure;
2011
3.
SDDM03 Automatic Discovery of Personal Name Aliases From the Web

Description: Automatically extracted lexical pattern-based approach to efficiently extract a large set of candidate aliases from snippets retrieved from a web search engine. Lexical pattern frequency, Word cooccurrences in an anchor text graph, and Page counts on the web.
2011
4.
SDDM04 Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems
Description: Facilitate the management of large-scale computing systems. The utilization of management experiences in one system to benefit the same management task in other systems (or current systems).
2011
Bayesian network to model configuration dependencies.
5.
SDDM05 A Web Search Engine-Based Approach to Measure Semantic Similarity between Words
Description: An empirical method to estimate semantic similarity using page counts and text snippets retrieved from a web search engine for two words. Word co-occurrence using page counts and Integrate those with lexical patterns extracted from text snippets.
2011
6.
SDDM06 Data Leakage Detection

Description: Propose data allocation strategies that improve the probability of identifying leakages and develop a model for assessing the guilt of agents. That improves chances of identifying a leaker
2011
7.
SDDM07 A Machine Learning Approach for Identifying DiseaseTreatment Relations in Short Texts
Description: Describes a ML-based methodology for building an application that is capable of identifying and disseminating healthcare information. It extracts sentences from published medical papers that mention diseases and treatments, and identifies semantic relations that exist between diseases and treatments.
2011
8.
SDDM08 Authenticated Multistep Nearest Neighbor Search

Description: The multistep NN algorithm incurs prohibitive network overhead due to the transmission of false hits, but are nevertheless necessary for its verification.
2011
9.
SDDM09 Optimizing Resource Conflicts in Workflow Management
2011
Systems
Description: Resource Conflicts Joint Optimization (Re.Co.Jo.Op.) minimizes resource conflicts subject to temporal constraints and simultaneously optimizes throughput or utilization subject to resources constraints.
10. SDDM10 Closeness: A New Privacy Measure for Data Publishing

Description: we propose a new notion of privacy called "closeness." We first present the base model -closeness, which requires that the
2010
distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold propose a more flexible privacy model called higher utility. ). We then
-closeness that offers
11. SDDM11 Record Matching over Query Results from Multiple Web Databases
Description: we present an unsupervised, online record matching method, UDD, which, for a given query, can effectively identify duplicates from the query result records of multiple Web databases. After removal of the same-source duplicates, the "presumed" nonduplicate records from the same source can be used as training examples
2010
12. SDDM12 Towards an Effective XML Keyword Search

Description: we design novel formulae to identify the search for nodes and search via nodes of a query, and present a novel XML TF*IDF ranking strategy to rank the individual matches of all possible search intentions.
2010
13. SDDM13 Bridging Domains Using World Wide Knowledge for Transfer Learning
Description: we design a novel transfer learning approach, called BIG (Bridging Information Gap), to effectively extract useful knowledge in a worldwide knowledge base, which is then used to link the source and target domains for improving the classification performance. BIG works when the source and target domains share the same feature space but different underlying data distributions.
2010
14. SDDM14 Personalizing web directories with the aid of web usage data
Description: we introduce a novel methodology that combines the users' browsing behavior with thematic information from the Web directories. Following this methodology, we enhance the clustering and probabilistic approaches presented in previous work and also present a new algorithm that combines these two approaches. The resulting community models take the form of Community Web Directories.
2010
15. SDDM15 Filter-Based Data Partitioning for Training Multiple Classifier Systems
Description: To assess the effectiveness of different types of training partitions, we generated a large number of disjoint training partitions with distinctive distributions. Then, we empirically assessed these training partitions and their impact on the performance of the system by utilizing the proposed feature-based and class-based measures. We applied the findings of this analysis and developed a new partitioning method called "Clustering, Declustering, and Selection" (CDS).
2010
16. SDDM16 FiVaTech:
Page-Level
Web
Data
Extraction
from
2010
Template Pages
Description: We propose an unsupervised, page-level data extraction approach to deduce the schema and templates for each individual Deep Website, which contains either singleton or multiple data records in one Webpage. FiVaTech applies tree matching, tree alignment, and mining techniques to achieve the challenging task.
17. SDDM17 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems

Description: we present a general framework, HiGLOB, for global load balancing in structured P2P systems. Each node in HiGLOB has two key components: 1) a histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system, and 2) a loadbalancing manager that redistributes the load whenever the node becomes overloaded or under loaded.
2009
18. SDDM18 Interactive
Correction
and
Recommendation
for
2009
Computer Language Learning and Training

Description: We present an automated learning and skills training system for a database programming environment that promotes procedural knowledge acquisition and skills training. The system provides meaningful knowledge-level feedback such as correction of student solutions and personalized guidance through recommendations.
19. SDDM19 Optimal Lot Sizing Policies for Sequential Online Auctions
Description: We first present a goal programming approach for estimating the bid distribution for the bidder population from the observed bids, readily available in these auctions. We then develop models to compute optimal lot sizes for both stationary and nonstationary bid distributions. For stationary bid distributions, we present closed-form
2009
solutions and structural results.
20. SDDM20 Intrusion Detection System based on Data Mining

Description: The system that performs anomaly detection can detect intrusions known and unknown, reduce omissions and misstatements, improve accuracy and speed of intrusion detection and has good adaptive capacity and scalability.
2009
21. SDDM21 Fast Query Point Movement Techniques for Large CBIR Systems
Description: We propose a new index structure and query processing technique to improve retrieval effectiveness and efficiency. We also consider strategies to minimize the effects of users' inaccurate RF. Extensive experiments in simulated and realistic environments show that our approach significantly reduces the number of required iterations and improves overall retrieval performance.
2009
22. SDDM22 Exact Knowledge Hiding Through Database Extension

Description: In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent item sets by 1) minimally extending the original database by a synthetically generated database partthe database extension, 2) formulating the creation of the database extension as a constraint satisfaction problem, 3) mapping the constraint satisfaction problem to an equivalent binary integer programming problem, 4) exploiting underutilized synthetic transactions to proportionally increase the support of nonsensitive item sets, 5) minimally relaxing the constraint satisfaction problem to provide an approximate solution close to the optimal one when an ideal solution does not exist, and 6) using a partitioning in the universe of the items to increase the efficiency of the
2009
proposed hiding algorithm.
23. SDDM23 Hierarchical distribute p2p document clustering and clustering summarization
Description: we propose a Hierarchically distributed Peer-to-Peer (HP2PC) architecture and clustering algorithm. The architecture is based on a multilayer overlay network of peer neighborhoods. Super-nodes, which act as representatives of neighborhoods, are recursively grouped to form higher level neighborhoods. Within a certain level of the hierarchy, peers cooperate within their respective neighborhoods to perform P2P clustering.
2009
IEEE TRANSACTION ON IMAGE PROCESSING Domain: Dot. Net
Sl.No 1.
Code SDIP01
Project Titles Transforms for the Motion Compensation Residual

Description: we provide an adaptive auto-covariance characterization for the MC-residual that shows some statistical differences between the MC-residual and the image.
Year 2011
2.
SDIP02
A Stochastic Approach to Image Retrieval Using Relevance Feedback and Particle Swarm Optimization
2011
Description: In this paper, an innovative approach is proposed that combines a relevance feedback (RF) approach with an evolutionary stochastic algorithm, called particle swarm optimizer (PSO), as a way to grasp user's semantics through optimized iterative learning. The retrieval uses human interaction to achieve a twofold goal: 1) to guide the swarm particles in the exploration of the solution space towards the cluster of relevant images; 2) to dynamically modify the feature space by appropriately weighting the descriptive features according to the users' perception of relevance.
3.
SDIP03
Contourlet-Based Image Watermarking Using Optimum Detector in a Noisy Environment

Description: In the presented scheme, watermark data is embedded in directional subband with the highest energy. By modeling the contourlet coefficients with General Gaussian Distribution (GGD), the distribution of watermarked noisy coefficients is analytically calculated. The tradeoff between the transparency and robustness of the watermark data is solved in a novel fashion. At the receiver, based on the Maximum Likelihood (ML) decision rule, an optimal detector by the aid of channel side information is proposed. In the next step, a blind extension of the suggested algorithm is presented using the patchwork idea.
2010
4.
SDIP04
Latent Finger print matching

Description: We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton.
2010
5.
SDIP05
Reversible Image Watermarking Using Interpolation
2010
Technique
Description: we present a novel reversible watermarking scheme using an interpolation technique, which can embed a large amount of covert data into images with imperceptible modification. we utilize the interpolation-error, the difference between interpolation value and corresponding pixel value, to embed bit ??1?? or ??0?? by expanding it additively or leaving it unchanged.Due to the slight modification of pixels, high image quality is preserved.
6.
SDIP06
Generic Lossless visible Watermarking

Description: The method is based on the use of deterministic one-toone compound mappings of image pixel values for overlaying a variety of visible watermarks of arbitrary sizes on cover images. The compound mappings are proved to be reversible, which allows for lossless recovery of original images from watermarked images.
2010
IEEE TRANSACTION ON DISTRIBUTED NETWORKING

Domain: Dot. Net
Sl.No 1.
Code
Project Titles
Year 2011
SDNW01 An Authentication Code Against Pollution Attacks in Network Coding
Description: Unconditionally secure authentication code for multicast network coding, where the trusted authority gives the key rights to the destinations and intermediate nodes. A digital signature, A message authentication code or An authentication code
2.
SDNW02 Network-Coding Guarantees
Multicast
Networks
With
QoS
2011
Description: Each edge node admits not more than a specified amount of traffic; the network will never experience link congestion. A non blocking unicast network and a multicast network share the same optimal paths, and that a nonblocking multicast network with network coding can admit the same amount of traffic as a nonblocking unicast network.
3.
SDNW03 A Practical Adaptive Pacing Scheme for TCP in Multihop Wireless Networks
Description: Denote as TCP with Adaptive Pacing (TCP-AP), implements rate-based scheduling of transmissions within the TCP Congestion window.
2011
4.
SDNW04 On the Fair Coexistence of Loss-and Delay-Based TCP

Description: A novel delay-based additive increase, multiplicative decrease (AIMD) congestion control algorithm. Algorithm depends on a nonzero average queuing delay. Low standing queues and delay in homogeneous environments, Fair coexistence of delay- and loss based flows in heterogeneous environments. Delay-based flows behave as loss-based flows when loss-based flows are present in the network;
2011
5.
SDNW05 Energy-Efficient Protocol for Cooperative Networks

Description: Derive the upper bound of the capacity of the protocol, and we analyze the end-to-end robustness of the protocol to data-packet loss, along with the tradeoff between energy consumption and error rate.
2011
6.
SDNW06 DTRAB: Combating Against Attacks on Encrypted Protocols Through Traffic-Feature Analysis
Description: we propose an anomaly-based detection system by using strategically distributed monitoring stubs (MSs). We have categorized various attacks against cryptographic protocols. The MSs, by sniffing the encrypted traffic, extract features for detecting these attacks and construct normal usage behavior profiles. Upon detecting suspicious activities due to the deviations from these normal profiles, the MSs notify the victim servers, which may then take necessary actions.
2010
7.
SDNW07 Efficient and Dynamic Routing Topology Inference From End-to-End Measurements
Description: we propose a general framework for designing topology inference algorithms based on additive metrics. The framework can flexibly fuse information from multiple measurements to achieve better estimation accuracy. We develop computationally efficient (polynomialtime) topology inference algorithms based on the framework
2010
8.
SDNW08 A Queuing Model for Evaluating the Transfer Latency of Peer-to-Peer Systems
Description: The main contribution of this paper is a modeling framework for the peers that accounts for the file size distribution, the search time, load distribution at peers, and number of concurrent downloads allowed by a peer. We propose a queuing model that models
2010
the nodes or peers in such systems as M/G/1/K processor sharing queues. The model is extended to account for peers which alternate between online and offline states.
9.
SDNW09 An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems
Description: This paper presents an Efficient and adaptive
2010
decentralized file replication algorithm (EAD) that achieves high query efficiency and high replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to non-uniform and time-varying file popularity and node interest.
10. SDNW10 Traceback of DDoS Attacks Using Entropy Variations

Description: we propose a novel traceback method for DDoS attacks that is based on entropy variations between normal and DDoS attack traffic, which is fundamentally different from commonly used packet marking techniques. In comparison to the existing DDoS traceback methods, the proposed strategy possesses a number of advantages - it is memory nonintensive, efficiently scalable, robust against packet pollution, and independent of attack traffic patterns.
2010
11. SDNW11 POPI: A User-Level Tool for Inferring Router Packet Forwarding Priority
Description: we present an end-to-end approach for PFP inference and its associated tool, POPI. This is the first attempt to infer router packet forwarding priority through end-to-end measurement. POPI enables users to discover such network policies through measurements of packet losses of different packet types.
2010
12. SDNW12 A Directory Service for Perspective Access Networks

Description: Our vision of a perspective access network (PAN) is a peer-to-peer overlay network that incorporates routing and directory services that allow network perspective-sharing and nonhierarchical organization of the Internet.
2010
13. SDNW13 Web User-Session Inference by Means of Clustering Techniques

Description: By applying clustering techniques, we define a novel methodology to identify Web user-sessions without requiring an a priori definition of threshold values. We define a clustering based approach, we discuss pros and cons of this approach, and we apply it to real traffic traces.
2010
14. SDNW14 Mitigating Attacks on Open Functionality in SMSCapable Cellular Networks

Description: In this paper, we use a combination of modeling and simulation to demonstrate the feasibility of targeted text messaging attacks. Under realistic network conditions, we show that adversaries can achieve blocking rates of more than 70% with only limited resources.
2010
15. SDNW15 Plexus-A scalable p2p Protocol enabling efficient subset search
Description: Plexus, a peer-to-peer search protocol that provides an efficient mechanism for advertising a bit-sequence (pattern), and discovering it using any subset of its 1-bits. A pattern (e.g., Bloom filter) summarizes the properties (e.g., keywords, service description) associated with a shared object (e.g., document, service). Plexus has a
2009
partially decentralized architecture involving super-peers. It adopts a novel structured routing mechanism derived from the theory of error correcting codes (ECC).
16. SDNW16 Incentive-Based
Scheduling
for
Market-Like
2009
Computational Grids
Description: We present an incentive-based scheduling scheme, which utilizes a peer-to-peer decentralized scheduling framework, a set of local heuristic algorithms, and three market instruments of job announcement, price, and competition degree.
IEEE TRANSACTION ON PARALLEL AND DISTRIBUTED
17. SDNW17 Multiple Routing Configurations for Fast IP Network Recovery

Description: MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions.
2009
COMPUTING
Domain: Dot. Net
Sl.No
Project Code
Project Titles
Year
SDP01
A Cooperative Diversity-Based Robust MAC Protocol in Wireless Ad hoc Networks

Description: Cooperative Diversity MAC, which exploits the
2011
cooperative communication capability of the physical layer to improve robustness in wireless ad hoc networks.
SDP02
Collective Applications
Receiver-Initiated
Multicast
for
Grid
2011
Description: Present Robber, a collective, receiver-initiated, highthroughput multicast approach inspired by the Bit Torrent protocol to maximize the throughput between multiple cluster computers.
SDP03
Compressing Network Access Control Lists

Description: ACL Compressor, a framework that can significantly reduce the number of rules in an access control list while maintaining the same semantics
2011
SDP04
A Distributed Algorithm for the Replica Placement Problem

Description: Improve the efficiency of object replication within a given
2011
distributed replication group.
SDP05
A Generic Framework for Three-Factor Authentication: Preserving Security and Privacy in Distributed Systems
Description: Investigates a systematic approach for authenticating clients by three factors, namely password, smart card, and biometrics. A generic and secure framework is proposed to upgrade two-factor authentication to three-factor authentication.
2011
SDP06
TASA: Tag-Free Activity Sensing using RFID Tag Arrays

Description: For location sensing and frequent route detection. TASA can locate objects more accurately.
2011
SDP07
Flexible Robust Group key Agreement

Description: A robust group key agreement protocol (GKA) allows a set of players to establish a shared secret key, regardless of network/node failures. It provides authorized group key to the grouporiented security mechanisms over insecure network channels.
2011
SDP08
Symmetric Key Approaches to Securing BGP-A Little Bit Trust is Enough

Description: Trade-off between efficiency and security by giving a little dose of trust to BGP routers.
2011
JAVA:
IEEE TRANSACTION ON MOBILE COMPUTING
Sl.No Project Code 1
Project Titles
Year
SJMC01 Channel-Aware Routing in Manets with Route Handoff

Description: This proposes a novel channel adaptive routing protocol which extends the Ad hoc On-Demand
2011
Multipath Distance Vector (AOMDV) routing protocol to accommodate channel fading. This avoids the fluctuation of packets transferring over the inter-related networks.
SJMC02 Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks using Sequential Hypothesis Testing
Description: We propose a fast and effective mobile replica node detection scheme using the Sequential Probability Ratio Test. This is the best work to tackle the problem of replica node attacks in mobile sensor networks.
2011
SJMC03 Decentralized
QoS-Aware
Checkpointing
2010
Arrangement in Mobile Grid Computing
SJMC04 Distributed
Algorithms
for
Minimum
Cost
2010
Multicast with Network Coding in Wireless Networks 5 SJMC05 SSUM: Smart Server Update Mechanism for Maintaining Environments 6 SJMC06 CAR: context aware adaptive routing for delay tolerant mobile networks 2010 Cache Consistency in Mobile 2010
IEEE TRANSACTION ON DATAMINING Domain: Java
Sl.No Project Code

1. 2. SJDM01 SJDM02
Project Titles
Year
Authenticated Multistep Nearest Neighbor Search A Machine Learning Approach for Identifying Disease-Treatment Relations in Short Texts
Description: Describes a ML-based methodology for building an application that is capable of identifying and disseminating healthcare information. It extracts
2011 2011
sentences from published medical papers that mention diseases and treatments, and identifies semantic relations that exist between diseases and treatments.
3.
IEEE TRANSACTION ON DEPENDABLE AND SECURE COMPUTING,

NETWORK SECURITY
Domain: Java
Sl.No Project Code 1 2
Project Titles
Year
SJNS01 Flexible Robust Group Key Agreement SJNS02 Replica Placement for Route Diversity in TreeBased Routing Distributed Hash Tables
Description: Tree-based routing DHTs and define
2011 2011
MAXDISJOINT, that creates route diversity for these DHTs.
SJNS03 Design and Implementation of an Intrusion Response System for Relational Databases
2011
SJNS04 A
Puzzle-Based
Defense
Strategy
Against
2010
Flooding Attacks Using Game Theory 5 SJNS05 Layered Approach Using Conditional Random Fields for Intrusion Detection 6 SJNS06 An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks 2010 2010
IEEE TRANSACTION ON PARALLEL AND DISTRIBUTED COMPUTING
Domain: Java
Sl.No Project Code 1 SJP01
Project Titles
Year
Joint Optimization of Complexity and Overhead for the Routing in Hierarchical Networks
Description: The main contribution of this paper is to analyze the routing complexity and the routing table size in the hierarchical network by using routing algorithm known as area-based link-vector algorithm (ALVA) was proposed to allow more flexible Topologies and to remove the network bottleneck.
2011
SJP02
Rumor Riding: Anonymizing Unstructured Peerto-Peer Systems(S)

Description: Existing anonymity approaches are mainly path-based. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity
2011
protocol for decentralized P2P systems. This is also known as the Mutual path for data transferring and avoiding the collision.
SJP03
Cooperative
Channelization
in
Wireless
2011
Networks with Network Coding

Description: we address congestion of multicast traffic in multi-hop wireless networks .Network coding reduces the number of transmissions required in multicast flows. In this paper, we propose cooperative channelization, in
which portions of the transmission media are allocated to links that are congested at the point.
SJP04
Load Balance with Imperfect Information in Structured Peer-to-Peer Systems

Description: In this study, we are interested in solving the load balancing problem in a fully decentralized manner. In this paper, that the reallocation of a virtual server from a source peer to a destination peer can be simply done by simulating the leave and join operations offered by a typical DHT. We intend to distribute loads to participating peers evenly with the minimum movement cost.
2011
IEEE TRANSACTION ON DISTRIBUTED NETWORKING Domain: Java
Sl.No
Project Code
Project Titles
Year
SJNW01 Energy-Efficient Protocol for Cooperative Networks

Description: We analyze the end-to-end robustness of the protocol to data-packet loss, along with the tradeoff between energy consumption and error rate. We evaluated the
2011
performance of cooperative transmission, and an energyefficient cooperative protocol, and we analyzed the robustness of the protocol to data packet loss.
SJNW02 Parametric Methods for Anomaly Detection in Aggregate Traffic

Description: We have developed the bi-variate Parametric Detection Mechanism (bPDM), which can detect anomalies and low-rate attacks in a few seconds. It uses both traffic-rate and packet-size statistics, yielding a bi-variate model that eliminates most false positives.
2011
SJNW03 Self-Reconfigurable Wireless Mesh Networks

Description: This paper presented an autonomous network reconfiguration system (ARS) that enables a multi-radio WMN to autonomously recover from
2011
wireless link failures. Network channels cause significant and varying degrees of losses or collisions in packet transmissions
SJNW04 Rumor Riding: Anonymizing Unstructured Peer-toPeer Systems
2011
Joint Optimization of Complexity and Overhead for the Routing in Hierarchical Networks Cooperative Channelization in Wireless Networks with Network Coding Load Balance with Imperfect Information in Structured Peer-to-Peer Systems
SJNW05 Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation
2010
SJNW06 Normalized queuing delay: congestion control jointly utilizing delay and marking
2010
SJNW07 Multiple routing configurations for fast ip network recovery
2009
SJNW08 Differentiated bandwidth allocation with TCP protection in core routers
2009
SJNW09 Node isolation model and age-based neighbor selection in unstructured p2p networks
2009
10
SJNW10 A traffic engineering approach for placement and selection of network
2009
11 12
SJNW11 Dynamic routing with security consideration SJNW12 Coloured tree
2009 2009
Application Project Titles:

Web and Windows Application:
REALTIME APPLICATION PROJECT TITLES
SINO
PROJECT CODE
TITLES
LANGUAG E
1 2 3 4
Effective blogger with XML interchange Alert based monitoring and scheduling on Proportional shares An Architectural Approach to Preventing Code Injection Attacks
Dotnet Dotnet Dotnet
FiVaTech: Page-Level Web Data Extraction from Template Dotnet Pages
Record Matching over Query Results from Multiple Web Dotnet/Ja Databases va Dotnet
6 7
Web User-Session Inference by Means of Clustering Techniques
An Intelligent tutoring system with web enhanced training Dotnet assessments
Role Engineering via role based access control
Dotnet
9 10 11 12 13 14 15
A Relation-Based Page Ranking in Web Search Engines Credit card fraud detection using HMM model Database Enterprise manager Online Bug tracking System Trace back of DoS Attacks using Entropy Variations Exact Knowledge hiding for automobiles industry
Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet
Authenticated Group Key Transfer Protocol Based on Secret Dotnet Sharing
16 17 18
Efficient Property Interpretor Personalizing web directories with the aid of web usage data
Dotnet Dotnet
A new steganographic method based on information sharing via Dotnet PNG images
19 20 21 22 23 24 25
Step Construction of Visual Cryptography Schemes Perspective Access Management Generic Lossless Visible WatermarkingA New Approach Efficient Compression of Encrypted Grayscale Images Latent Fingerprint Matching Online Data leakage detection
Bridging Domains Using World Wide Knowledge for Transfer Dotnet Learning
26 27 28 29 30 31 32 33 34 35 36 37
Intrusion Detection System based on Data Mining Optimal Lot Sizing Policies for Sequential Online Auctions Credit card fraud detection using hidden Markov model Efficient Broadcasting in Mobile AD-Hoc Network Online Buying and Selling System. Reversible Image Watermarking Using Interpolation Technique Email Proxy Server with Secure Service Secure Mobile health care for rural with electronic alerts Southern Railway Recruitment Portal Development Of A Campaign Information System Fast Firewall Implementations
Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet Dotnet
Web-based Recruitment Process System for the HR group for a Dotnet company
38 39 40 41 42 43
Medical anonymity processing and publishing Global roaming and target tracking in mobile sensor network Fast Firewall Implementations Security and Privacy for Social Networks. Still to animation movie creation
Dotnet Dotnet Dotnet Dotnet Dotnet
A Queuing Model for Evaluating the Transfer Latency of Peer-to- Dotnet Peer Systems
44
File Replication Detection Algorithm in P2P File Sharing Dotnet Systems
45
Dynamic Routing Topology with Security Consideration
Dotnet/Ja va
46
Multiple Routing Configurations for Fast IP Network Recovery
Dotnet/Ja va
47
Incentive-Based Scheduling for Market-Like Computational Dotnet Grids
48 49 50
Approximate query processing in peer to peer networks Accurately Measuring Denial Of Service
Dotnet Dotnet
Normalized queuing delay: congestion control jointly utilizing Java delay and marking
51 52 53
Distributed Algorithm for Minimum path Path Diversity
Java Java
Node isolation model and age-based neighbor selection in Java unstructured p2p networks
54
An Identity-Based Security System for User Privacy in Vehicular Java Ad Hoc Networks
55
Layered Approach Using Conditional Random Fields for Java Intrusion Detection
56
A Puzzle based defense strategy against flooding attacks using Java game theory
57
Adaptive Join Operators for Result Rate Optimization on Java Streaming Inputs
58
Bin Rank: Scaling Dynamic Authority-Based Search Using Java Materialized Subgraphs
59 60
NNexus: An automatic linker for collaborative web based corpora Java SSUM: Smart Server Update Mechanism for Maintaining Cache Java Consistency in Mobile Environments
61
CAR: context aware adaptive routing for delay tolerant mobile Java networks
62 63 64 65
Generic LossLess Watermarking Unseen Visible WaterMarking Coloured tree
Java Java Java
QKDP: Provably secured third party authenticated quantum key Java distribution protocol
66 67 68
Controlling IP spoofing through inter-domain packet filters A service centric multicast architecture and routing protocol
Java Java
Enhancing search performance in unstructured p2p networks Java based on users common interest
69
Two Techniques for Fast computation of constrained shortest Java path
70
XML Based Ranking and Keyword Search
Dotnet
71 72 73 74 75 76
Secured Data Object Replication in data grid Blind Banking Transformation System Medical anonymity processing and publishing Object tracking system Lossless Visible Watermarking Secure data transformation system
PHP: WEB APPLICATION
SINO
PROJECT CODE
TITLES
1.
SPHP01
E-shopping with billing Management system
Real time
2.
SPHP02
Online auction Management system
Real time
3.
SPHP03
Freelancing auction Management
Real time
4.
SPHP04
Searching Engine optimizing analyzing
Real time
5.
SPHP05
Bug tracking system
Real time
6.
SPHP06
Online Real Estate portal
Real time
7.
SPHP07
Online Examination
Real time
8.
SPHP08
Online Matching portal
Real time
9.
SPHP09
Online knowledge portal for college students
Real time
10.
SPHP10
Online ERP Software for Manufacturing company
Real time

Skiveprojects - Software Project Titles 2011

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Skiveprojects - Software Project Titles 2011

Încărcat de

Drepturi de autor:

Formate disponibile

PROJECT TOPICS

Sl.No Project Code

CloudTPS: Scalable Transactions for Web Applications in the Cloud

Fabsys Technologies Pvt.Ltd | 1 IEEE Projects Software

Optimal Service Pricing for a Cloud Cache

Failure Avoidance through Fault Prediction Based on Synthetic Transactions

Fabsys Technologies Pvt.Ltd | 2 IEEE Projects Software

Management in Cloud Computing

Using Cloud Technologies to Optimize Data-Intensive Service Applications

IEEE TRANSACTION ON MOBILE COMPUTING Domain: Dot. Net

Fabsys Technologies Pvt.Ltd | 3 IEEE Projects Software

SDMC02 Enabling Efficient Peer-to-Peer Resource Sharing in Wireless Mesh Networks

SDMC04 Secure High-Throughput Multicast Routing in Wireless Mesh Networks

Message Authentication in Computationally Constrained Environments

Efficient Broadcasting in Mobile AD-Hoc Network

Fabsys Technologies Pvt.Ltd | 4 IEEE Projects Software

Multicasting with Localized Control in Wireless AD-Hoc Network

Fabsys Technologies Pvt.Ltd | 5 IEEE Projects Software

IEEE TRANSACTION ON DEPENDABLE AND SECURE COMPUTING,

Domain: Dot. Net

Revisiting Defenses Against Large-Scale Online Password Guessing Attacks

Fabsys Technologies Pvt.Ltd | 6 IEEE Projects Software

Balancing Revocation and Storage Trade-Offs in Secure Group Communication

Nymble: Blocking Misbehaving Users in Anonymizing Networks

An Architectural Approach to Preventing Code Injection Attacks

Fabsys Technologies Pvt.Ltd | 7 IEEE Projects Software

Authenticated Group Key Transfer Protocol Based on Secret Sharing

Flexible and Rollback recovery for grid environment

Fabsys Technologies Pvt.Ltd | 8 IEEE Projects Software

Accurately Measuring Denial of Service in Simulation and Testbed Experiments

Credit card fraud detection using hidden Markov model

Fabsys Technologies Pvt.Ltd | 9 IEEE Projects Software

SDDM03 Automatic Discovery of Personal Name Aliases From the Web

Fabsys Technologies Pvt.Ltd | 10 IEEE Projects Software

Bayesian network to model configuration dependencies.

SDDM06 Data Leakage Detection

SDDM08 Authenticated Multistep Nearest Neighbor Search

SDDM09 Optimizing Resource Conflicts in Workflow Management

Fabsys Technologies Pvt.Ltd | 11 IEEE Projects Software

10. SDDM10 Closeness: A New Privacy Measure for Data Publishing

-closeness that offers

12. SDDM12 Towards an Effective XML Keyword Search

Fabsys Technologies Pvt.Ltd | 12 IEEE Projects Software

16. SDDM16 FiVaTech:

Fabsys Technologies Pvt.Ltd | 13 IEEE Projects Software

17. SDDM17 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems

18. SDDM18 Interactive

Computer Language Learning and Training

Fabsys Technologies Pvt.Ltd | 14 IEEE Projects Software

solutions and structural results.

20. SDDM20 Intrusion Detection System based on Data Mining

22. SDDM22 Exact Knowledge Hiding Through Database Extension

Fabsys Technologies Pvt.Ltd | 15 IEEE Projects Software

proposed hiding algorithm.

IEEE TRANSACTION ON IMAGE PROCESSING Domain: Dot. Net

Project Titles Transforms for the Motion Compensation Residual

Fabsys Technologies Pvt.Ltd | 16 IEEE Projects Software

Contourlet-Based Image Watermarking Using Optimum Detector in a Noisy Environment

Latent Finger print matching

Reversible Image Watermarking Using Interpolation

Fabsys Technologies Pvt.Ltd | 17 IEEE Projects Software

Generic Lossless visible Watermarking