Electronics Project

IEEE PROJECTS
DOTNET & JAVA
K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

Our Corporate Site WWW.PLCTECHNOLOGIES.IN Mail: info@plctechnologies.in Our Project Site WWW.PROJECTS-IEEE.IN
IEEE DOTNET / JAVA PROJECTS
CLOUD COMPUTING
Technology : Dotnet / Java
S.No
Code
Title
Abstract
PLCDCC01
Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage
Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy.
PLCDCC02
Dynamic Audit Services for Outsourced Storages in Clouds
In this paper, we propose a dynamic audit service for verifying the integrity of an untrusted and outsourced storage. Our audit service is constructed based on the techniques, fragment structure, random sampling and index-hash table, supporting provable updates to outsourced data and timely anomaly detection
PLCDCC03
THEMIS: A Mutually Verifiable Billing System for the Cloud Computing Environment
With the widespread adoption of cloud computing, the ability to record and account for the usage of cloud resources in a credible and verifiable way has become critical for cloud service providers and users alike. The success of such a billing system depends on several factors: the billing transactions must have integrity and nonrepudiation capabilities; the billing transactions must be nonobstructive and have a minimal computation cost; and the service level agreement (SLA) monitoring should be provided in a trusted manner. Existing billing systems are limited in terms of security capabilities or computational overhead.
PLCDCC04
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


5 PLCDCC05 Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Encryption Personal health record (PHR) is an emerging patient-centric model of health information exchange, which is often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacy concerns as personal health information could be exposed to those third party servers and to unauthorized parties. To assure the patients control over access to their own PHRs, it is a promising method to encrypt the PHRs before outsourcing. Yet, issues such as risks of privacy exposure, scalability in key management, flexible access and efficient user revocation, have remained the most important challenges toward achieving fine-grained, cryptographically enforced data access control
PLCDCC06
SMTP Based Resource Allocation on multi cloud inter domain network
In this paper, we propose a service decision making system for inter domain service transfer to balance the computation loads among multiple cloud domains. Our system focuses on maximizing the rewards for both the cloud system and the users by minimizing the number of service rejections that degrade the user satisfaction level significantly. To this end, we formulate the service request decision making process as a semi-Markov decision process. The optimal service transfer decisions are obtained by jointly considering the system incomes and expenses. Extensive simulation results show that the proposed decision making system can significantly improve the system rewards and decrease service disruptions compared with the greedy approach.
PLCDCC07
Optimization of Resource Provisioning Cost in Cloud Computing
In cloud computing, cloud providers can offer cloud consumers two provisioning plans for computing resources, namely reservation and on-demand plans. To address this problem, an optimal cloud resource provisioning (OCRP) algorithm is proposed by formulating a stochastic programming model. The OCRP algorithm can provision computing resources for being used in multiple provisioning stages as well as a long-term plan, e.g., four stages in a quarter plan and twelve stages in a yearly plan. The demand and price uncertainty is considered in OCRP. In this paper, different approaches to obtain the solution of the OCRP algorithm are considered including deterministic equivalent formulation, sample-average approximation, and Benders decomposition. Numerical studies are extensively performed in which the results clearly show that with the OCRP algorithm, cloud consumer can successfully minimize total cost of resource provisioning in cloud computing environments.
PLCDCC08
Access Control Mechanisms for Outsourced Data in Cloud
Cloud Computing poses new security and access control technique and (2) Multilinear map. In these schemes, challenges as the users outsource their sensitive data onto cloud storage. The outsourced data should be protected from unauthorized users access including the honest-but-curious cloud servers those hosts the data. In this paper, we propose two access control mechanisms based on (1)


Polynomial interpolation the authorized user need to store only a single key material irrespective of number of data items to which he has authorized access.
PLCDCC09
Resource Provisioning with Budget Constraints for Adaptive Applications in Cloud Environments
The recent emergence of clouds is making the vision of utility computing realizable, i.e. computing resources and services can be delivered, utilized, and paid for as utilities such as water or electricity. This, however, creates new resource provisioning problems. Because of the pay-as-you-go model, resource provisioning should be performed in a way to keep resource costs to a minimum, while meeting an applications needs. In this work, we focus on the use of cloud resources for a class of adaptive applications, where there could be application specific flexibility in the computation that may be desired. Furthermore, there may be a fixed time-limit as well as a resource budget. Within these constraints, such adaptive applications need to maximize their Quality of Service (QoS), more precisely, the value of an application-specific benefit function,by dynamically changing adaptive parameters.
10
PLCDCC10
Data integrity proofs in cloud storage
Cloud computing has been envisioned as the de-facto solution to the rising storage costs of IT Enterprises. With the high costs of data storage devices as well as the rapid rate at which data is being generated it proves costly for enterprises or individual users to frequently update their hardware. Apart from reduction in storage costs data outsourcing to the cloud also helps in reducing the maintenance. Cloud storage moves the users data to large data centers, which are remotely located, on which user does not have any control. However, this unique feature of the cloud poses many new security challenges which need to be clearly understood and resolved. We provide a scheme which gives a proof of data integrity in the cloud which the customer can employ to check the correctness of his data in the cloud. This proof can be agreed upon by both the cloud and the customer and can be incorporated in the Service level agreement (SLA).
11
PLCDCC11
A Secured Cost-effective MultiCloud Storage in Cloud Computing
The end of this decade is marked by a paradigm shift of the industrial information technology towards a pay-per- use service business model known as cloud computing. Cloud data storage redefines the security issues targeted on customers outsourced data (data that is not stored/retrieved from the costumers own servers). In this work we observed that, from a customers point of view, relying upon a solo SP for his outsourced data is not very promising. In addition, providing better privacy as well as ensure data availability, can be achieved by dividing the users data block into data pieces and distributing them among the available SPs in such a way that no less than a threshold number of SPs can take part in successful retrieval of the whole data block. In this paper, we propose a secured cost-effective multi-cloud storage (SCMCS) model in cloud computing which holds an economical distribution


of data among the available SPs in the market, to provide customers with data availability as well as secure storage. Our results show that, our proposed model provides a better decision for customers according to their available budgets. 12 PLCDCC12 Optimal pricing service for cloud cache Web applications that offer data management services are emerging. Web supports caching of data in order to provide quality query services. The users can query the web data, paying the price for the infrastructure they use. Web management necessitates an economy that manages the service of multiple users in an efficient, but also, resource economic way that allows for web profit. Naturally, the maximization of web profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects the correlation of cache structures involved in the queries. Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. Existing webs focus on the provision of web services targeted to developers, such as Amazon Elastic Compute web (EC2), or the deployment of servers, such as Go Grid. There are two major challenges when trying to define an optimal pricing scheme for the web caching service that is based on the speed (20gb).. This paper proposes a novel price-demand model designed for a web cache and a dynamic pricing scheme for queries executed in the web cache. The pricing solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner. The experimental study shows the efficiency of the solution 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 the cloud computing environment, as users often store sensitive information with cloud storage providers but these 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 cloudof-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 multi-cloud 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.
13
PLCDCC13
Cloud Computing Security: From Single to Multi-Clouds


14 PLCDCC14 Optimizing Cloud Resources for Delivering IPTV Services through Virtualization Virtualized cloud-based services can take advantage of statistical multiplexing across applications to yield significant cost savings. However, achieving similar savings with real-time services can be a challenge. In this paper, we seek to lower a providers costs for real-time IPTV services through a virtualized IPTV architecture and through intelligent time-shifting of selected services. Using Live TV and Video-on-Demand (VoD) as examples, we show that we can take advantage of the different deadlines associated with each service to effectively multiplex these services. We provide a generalized framework for computing the amount of resources needed to support multiple services, without missing the deadline for any service. We Construct the problem as an optimization formulation that uses a generic cost function. We consider multiple forms for the cost function (e.g., maximum, convex and concave functions) reflecting the cost of providing the service. The solution to this formulation gives the number of servers needed at different time instants to support these services. We implement a simple mechanism for time-shifting scheduled jobs in a simulator and study the reduction in server load using real traces from an operational IPTV network. Our results show that we are able to reduce the load by _ 24% (compared to a possible _ 31%). We also show that there are interesting open problems in designing mechanisms that allow time-shifting of load in such environments. Or wireless adoption to continue growing, mobile devices' capabilities may have to expand, particularly in areas such as video streaming, gaming, and graphics-intensive applications. Cloud streaming promises to let resource-constrained mobile devices provide such capabilities.
15
PLCDCC15
Cloud Streaming Brings Video to Mobile Devices
16
PLCDCC16
Cloud Data Protection for the Masses
Offering strong data protection to cloud users while enabling rich applications is a challenging task. Researchers explore a new cloud platform architecture called Data Protection as a Service, which dramatically reduces the per-application development effort required to offer data protection, while still allowing rapid development and maintenance.
17
PLCDCC17
A Price- and-Time-SlotNegotiation Mechanism for Cloud Service Reservations
When making reservations for Cloud services, consumers and providers need to establish service-level agreements through negotiation. Whereas it is essential for both a consumer and a provider to reach an agreement on the price of a service and when to use the service, to date, there is little or no negotiation support for both price and time-slot negotiations (PTNs) for Cloud service reservations. This paper presents a multi-issue negotiation mechanism to facilitate the following: 1) PTNs between Cloud agents and 2) trade-off between price and time-slot utilities. Unlike many existing negotiation mechanisms in which a negotiation agent can only make one proposal at a time, agents in this work are designed to concurrently make multiple proposals in a negotiation round that generate the same aggregated utility, differing only in terms of individual price and time-slot utilities.


Another novelty of this work is formulating a novel time-slot utility function that characterizes preferences for different time slots. These ideas are implemented in an agent-based Cloud tested. Using the tested, experiments were carried out to compare this work with related approaches. Empirical results show that PTN agents reach faster agreements and achieve higher utilities than other related approaches. A case study was carried out to demonstrate the application of the PTN mechanism for pricing Cloud resources 18 PLCDCC18 Fair-Share for Fair Bandwidth location in Cloud Computing Current mechanisms for controlling network resources cannot prevent users from interfering with each other in a shared cloud environment. Proposals made to rectify this, use mechanisms which require interrupts with high timing precision, and usually unevenly distribute bandwidth to TCP flows. We propose the use of an alternative mechanism to manage network resources and compare the performance of both Cloud computing promises to significantly change the way we use computers and access and store our personal and business information. With these new computing and communications paradigms arise new data security challenges. Existing data protection mechanisms such as encryption have failed in preventing data theft attacks, especially those perpetrated by an insider to the cloud provider. We propose a different approach for securing data in the cloud using offensive decoy technology. We monitor data access in the cloud and detect abnormal data access patterns. When unauthorized access is suspected and then verified using challenge questions, we launch a disinformation attack by returning large amounts of decoy information to the attacker. This protects against the misuse of the users real data. Experiments conducted in a local file setting provide evidence that this approach may provide unprecedented levels of user data security in a Cloud environment. A key approach to secure cloud computing is for the data owner to store encrypted data in the cloud, and issue decryption keys to authorized users. Then, when a user is revoked, the data owner will issue re-encryption commands to the cloud to re-encrypt the data, to prevent the revoked user from decrypting the data, and to generate new decryption keys to valid users, so that they can continue to access the data. However, since a cloud computing environment is comprised of many cloud servers, such commands may not be received and executed by all of the cloud servers due to unreliable network communications. In this paper, we solve this problem by proposing a time based re-encryption scheme, which enables the cloud servers to automatically re-encrypt data based on their internal clocks. Our solution is built on top of a new encryption scheme, attributes based encryption, to allow fine-grain access control, and does not require perfect clock synchronization for correctness.
19
PLCDCC19
Fog Computing: Mitigating Insider Data Theft Attacks in the Cloud
20
PLCDCC20
Reliable Re-encryption in Unreliable Clouds


21 PLCDCC21 An SMDP-based Service Model for Inter-domain Resource Allocation in Mobile Cloud Networks Mobile cloud computing is a promising technique that shifts the data and computing service modules from individual devices to geographically distributed cloud service architecture. A general mobile cloud computing system is comprised of multiple cloud domains and each domain manages a portion of cloud system resources, such as CPU, memory and storage, etc. How to efficiently manage the cloud resources across multiple cloud domains is critical for providing continuous mobile cloud services. In this paper, we propose a service decision making system for inter-domain service transfer to balance the computation loads among multiple cloud domains. Our system focuses on maximizing the rewards for both the cloud system and the users, by minimizing the number of service rejections which degrade the user satisfaction level significantly. To this end, we formulate the service request decision making process as a Semi-Markov Decision Process (SMDP). The optimal service transfer decisions are obtained by jointly considering the system incomes and expenses. Extensive simulation results show that the proposed decision making system can significantly improve the system rewards and decrease service disruptions compared with the greedy approach.
22
PLCDCC22
A Distributed Access Control Architecture for Cloud Computing
The growing popularity of cloud computing draws attention to its security challenges, which are particularly exacerbated due to resource sharing.1 Cloud computings multitenancy and virtualization features pose unique security and access control challenges due to sharing of physical resources among potential untrusted tenants, resulting in an increased risk of side-channel attacks.2 Additionally, the interference of multitenancy computation can result in unauthorized information flow. Heterogeneity of services in cloud computing environments demands varying degrees of granularity in access control mechanisms. Therefore, an inadequate or unreliable authorization mechanism can significantly increase the risk of unauthorized use of cloud resources and services. In addition to preventing such attacks, a fine-grained authorization mechanism can assist in implementing standard security measures. Such access control challenges and the complexities associated with their management call for a sophisticated security architecture that not only adequately captures access management requirements but also ensures secure interoperation across multiple clouds. We present distributed access control architecture for multitenant and virtualized environments. The design of this architecture is based on the principles from security management and software engineering. From a security management perspective, the goal is to meet cloud users access control requirements. From a software engineering perspective, the goal is to generate detailed specifications of such requirements.


23 PLCDCC23 On-demand security architecture for cloud computing Strong security always consumes IT resource and increase difficult of use. In order not only to provide enough security, but also to mitigate the IT consumption and the difficult of use, on-demand security architecture is proposed to provide differentiated security for various services in cloud computing. The architecture is driven by security policy which is based on three inputs, i.e., risk of access network, type of service and security level. According to the inputs, the security policy can produce security parameters which are used to configure security mechanism (security algorithms as well as protocols) at every security domain for protection of specific service. The architecture can fulfil the diverse security req. from users and services in cloud computing. AbstractCloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, such a service is also relinquishing users physical possession of their outsourced data, which inevitably poses new security risks towards the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose in this paper a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost. The auditing result not only ensures strong cloud storage correctness guarantee, but also simultaneously achieves fast data error localization, i.e., the identification of misbehaving server. Considering the cloud data are dynamic in nature, the proposed design further supports secure and efficient dynamic operations on outsourced data, including block modification, deletion, and append. Analysis shows the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks.
24
PLCDCC24
Towards Secure and Dependable Storage Services in Cloud Computing
25
PLCDCC25
Cloud TPS: Scalable Transactions for Web Applications in the Cloud
NoSQL Cloud data services provide scalability and high availability properties for web applications but at the same time they sacrice data consistency. However, many applications cannot a ord any data inconsistency. CloudTPS is a scalable transaction manager to allow cloud database services to execute the ACID transactions of 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: Bigtable and SimpleDB. Performance evaluation on top of HBase (an open-source version of Bigtable) in our local cluster and Amazon SimpleDB in the Amazon cloud shows that our system scales linearly at least up to 40 nodes in our local cluster and 80 nodes in the Amazon cloud. Infrastructure as a Service (IaaS) cloud computing has revolutionized the way we think of acquiring resources by introducing a simple change: allowing users to lease computational
26
PLCDCC26
Going Back and Forth: Efficient Multideployment and ultisnapshotting on Clouds


resources from the cloud providers datacentre for a short time by deploying virtual machines (VMs) on these resources. This new model raises new challenges in the design and development of IaaS middleware. One of those challenges is the need to deploy a large number (hundreds or even thousands) of VM instances simultaneously. Once the VM instances are deployed, another challenge is to simultaneously take a snapshot of many images and transfer them to persistent storage to support management tasks, such as suspend- resume and migration. With datacenters growing rapidly and configurations becoming heterogeneous, it is important to enable efficient concurrent deployment and snap shotting that are at the same time hypervisor independent and ensure a maximum compatibility with different configurations. This paper addresses these challenges by proposing a virtual file system specifically optimized for virtual machine image storage. It is based on a lazy transfer scheme coupled with object versioning that handles snapshotting transparently in a hypervisorindependent fashion, ensuring high portability for different configurations. Large-scale experiments on hundreds of nodes demonstrate excellent performance results: speedup for concurrent VM deployments ranges from a factor of 2 up to 25, with a reduction in bandwidth utilization of as much as 90%.
KNOWLEDGE & DATA ENGG
Technology: Dotnet / Java
S.No
Code
Title
Abstract
PLCDDM01
Mining Online Reviews for Predicting Sales Performance: A Case Study in the Movie Domain
Posting reviews online has become an increasingly popular way for people to express opinions and sentiments toward the products bought or services received. Analyzing the large volume of online reviews available would produce useful actionable knowledge that could be of economic values to vendors and other interested parties. In this paper, we conduct a case study in the movie domain, and tackle the problem of mining reviews for predicting product sales performance. Our analysis shows that both the sentiments expressed in the reviews and the quality of the reviews have a significant impact on the future sales performance of products in question. For the sentiment factor, we propose Sentiment PLSA (S-PLSA), in which a review is considered as a document generated by a number of hidden sentiment factors, in order to capture the complex nature of sentiments. We present Temporal Pattern Search (TPS), a novel algorithm for searching for temporal patterns of events in historical personal histories. The traditional method of searching for such patterns uses an automaton-based approach over a single array of events, sorted by time stamps. Instead, TPS operates on a set of arrays, where each array contains all events of the same type, sorted by
PLCDDM02
A Temporal Pattern Search Algorithm for Personal History Event Visualization


time stamps. TPS searches for a particular item in the pattern using a binary search over the appropriate arrays. Although binary search is considerably more expensive per item, it allows TPS to skip many unnecessary events in personal histories. We show that TPSs running time is bounded by Om2n lgn, where m is the length of (number of events) a search pattern, and n is the number of events in a record (history). Although the asymptotic running time of TPS is inferior to that of a non-deterministic finite automaton (NFA) approach (O(mn)), TPS performs better than NFA under our experimental conditions.
PLCDDM03
Slicing: A New Approach for Privacy Preserving Data Publishing
Several systems that rely on consistent data to offer high -quality services, such as digital libraries and e-commerce brokers, may be affected by the existence of duplicates, quasi replicas, or near duplicate entries in their repositories. Because of that, there have been significant investments from private and government organizations for developing methods for removing replicas from its data repositories. This is due to the fact that clean and replica free repositories not only allow the retrieval of higher quality information but also lead to more concise data and to potential savings in computational time and resources to process this data. In this paper, we propose a genetic programming approach to record deduplication that combines several different pieces of evidence extracted from the data content to find a deduplication function that is able to identify whether two entries in a repository are replicas or not. Extended Boolean retrieval (EBR) models were proposed nearly three decades ago, but have had little practical impact, despite their significant advantages compared to either ranked keyword or pure Boolean retrieval. In particular, EBR models produce meaningful rankings; their query model allows the representation of complex concepts in an and-or format; and they are scriptable, in that the score assigned to a document depends solely on the content of that document, unaffected by any collection statistics or other external factors. These characteristics make EBR models attractive in domains typified by medical and legal searching, where the emphasis is on iterative development of reproducible complex queries of dozens or even hundreds of terms. This paper considers a cloud computing setting in which similarity querying of metric data is outsourced to a service provider. The data is to be revealed only to trusted users, not to the service provider or anyone else. Users query the server for the most similar data objects to a query example. Outsourcing offers the data owner scalability and a low initial investment. The need for privacy may be due to the data being sensitive (e.g., in medicine), valuable (e.g., in astronomy), or otherwise confidential. Given this setting, the paper presents techniques that transform the data prior to supplying it to the service provider for similarity queries on the transformed data.
PLCDDM04
Efficient Extended Boolean Retrieval
PLCDDM05
Outsourced Similarity Search on Metric Data Assets


6 PLCDDM06 Publishing Search LogsA Comparative Study of Privacy Guarantees Search engine companies collect the database of intentions, the histories of their users search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper, we analyse algorithms for publishing frequent keywords, queries, and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by differential privacy unfortunately does not provide any utility for this problem. We then propose an algorithm ZEALOUS and show how to set its parameters to achieve ; P-probabilistic privacy. We also contrast our analysis of ZEALOUS with an analysis l. that achieves 0; 0indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to kanonymity while at the same time achieving much stronger privacy guarantees. A fundamental problem for peer-to-peer (P2P) applications in mobile-pervasive computing environment is to efficiently identify the node that stores particular data items and download them while preserving battery power. In this paper, we propose a P2PMinimum Boundary Rectangle (PMBR, for short) which is a new spatial index specifically designed for mobile P2P environments. A node that contains desirable data item (s) can be easily identified by reading the PMBR index. Then, we propose a selective tuning algorithm, called Distributed exponential Sequence Scheme (DSS, for short), that provides clients with the ability of selective tuning of data items, thus preserving the scarce power resource. The proposed algorithm is simple but efficient in supporting linear transmission of spatial data and processing of location-aware queries. The results from theoretical analysis and experiments show that the proposed algorithm with the PMBR index is scalable and energy efficient in both range queries and nearest neighbour queries.
PLCDDM07
Energy Efficient Data Access in Mobile P2P Networks
PLCDDM08
A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments
We address the problem of dynamic resource management for a large-scale cloud environment. Our contribution includes outlining distributed middleware architecture and presenting one of its key elements: a gossip protocol that (1) ensures fair Resource allocation among sites/applications, (2) dynamically adapts the allocation to load changes and (3) scales both in the number of physical machines and sites/applications. We formalize the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. We first present a protocol that computes an optimal solution without considering memory constraints and prove correctness and convergence properties. Then, we extend that protocol to provide an efficient heuristic solution for the complete problem, which includes


minimizing the cost for adapting an allocation. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed gossip protocols do. We evaluate the heuristic protocol through simulation and find its performance to be well-aligned with our design goals. 9 PLCDDM09 Resilient Identity Crime Detection Identity crime is well known, prevalent, and costly; and credit application fraud is a specific case of identity crime. The existing no data mining detection system of business rules and scorecards, and known fraud matching have limitations. To address these limitations and combat identity crime in real time, this paper proposes a new multi-layered detection system complemented with two additional layers: communal detection (CD) and spike detection (SD). CD finds real social relationships to reduce the suspicion score, and is tamper resistant to synthetic social relationships. It is the whitelist-oriented approach on a fixed set of attributes. SD finds spikes in duplicates to increase the suspicion score, and is probe-resistant for attributes. It is the attributeoriented approach on a variable-size set of attributes. Together, CD and SD can detect more types of attacks, better account for changing legal behaviour, and remove the redundant attributes. Given a data point set D, a query point set Q, and an integer k, the Group Nearest Group (GNG) query finds a subset w (|w|<=k) of points from D such that the total distance from all points in Q to the nearest point in w is not greater than any other subset w' w (|w|<=k) of points in D. GNG query is a partition-based clustering problem which can be found in many real applications and is Nphard. In this paper, Exhaustive Hierarchical Combination (EHC) algorithm and Subset Hierarchical Refinement (SHR) algorithm are developed for GNG query processing. While EHC is capable to provide the optimal solution for k = 2, SHR is an efficient approximate approach that combines database techniques with local search heuristic. The processing focus of our approaches is on minimizing the access and evaluation of subsets of cardinality k in D since the number of such subsets is exponentially greater than |D|. To do that, the hierarchical blocks of data points at high level are used to find an intermediate solution and then refined by following the guided search direction at low level so as to prune irrelevant subsets. The comprehensive experiments on both real and synthetic data sets demonstrate the superiority of SHR in terms of efficiency and quality. Motivated by the needs such as group relationship analysis, this paper introduces a new operation on graphs, named top -k path join, which discovers the top-k simple shortest paths between two given node sets. Rather than discovering the top-k simple paths between each node pair, this paper proposes a holistic join method which answers the top-k path join by finding constrained top-k simple shortest paths between two nodes, and then devises an efficient method to handle the latter problem. Specifically, we transform the graph by encoding the precomputed shortest paths to the target node, and use the transformed graph in the candidate path searching. We show that the candidate path searching on the
10
PLCDDM10
On Group Nearest Group Query Processing
11
PLCDDM11
Holistic Top-k Simple Shortest Path Join in Graphs


transformed graph not only has the same result as that on the original graph but also can be terminated much earlier with the aid of precomputed results. We also discuss two other optimization strategies, including considering the join constraint in the candidate path generation as early as possible and pruning search space in each candidate path generation with an adaptively determined threshold. The final extensive experimental results also show that our method offers a significant performance improvement over existing ones. 12 PLCDDM12 Ranking Model Adaptation for Domain-Specific Search With the explosive emergence of vertical search domains, applying the broad-based ranking model directly to different domains is no longer desirable due to domain differences, while building a unique ranking model for each domain is both laborious for labelling data and time consuming for training models. In this paper, we address these difficulties by proposing a regularizationbased algorithm called ranking adaptation SVM (RA-SVM), through which we can adapt an existing ranking model to a new domain, so that the amount of labelled data and the training cost is reduced while the performance is still guaranteed. Our algorithm only requires the prediction from the existing ranking models, rather than their internal representations or the data from auxiliary domains. In addition, we assume that documents similar in the domain-specific feature space should have consistent rankings, and add some constraints to control the margin and slack variables of RA-SVM adaptively. Finally, ranking adaptability measurement is proposed to quantitatively estimate if an existing ranking model can be adapted to a new domain. Experiments performed over Letor and two large scale data sets crawled from a commercial search engine demonstrate the applicabilities of the proposed ranking adaptation algorithms and the ranking adaptability measurement. Modern distributed applications are embedding an increasing degree of dynamism, from dynamic supply-chain management, enterprise federations, and virtual collaborations to dynamic resource acquisitions and service interactions across organizations. Such dynamism leads to new challenges in security and dependability. Collaborating services in a system with a ServiceOriented Architecture (SOA) may belong to different security realms but often need to be engaged dynamically at runtime. If their security realms do not have a direct cross-realm authentication relationship, it is technically difficult to enable any secure collaboration between the services. A potential solution to this would be to locate intermediate realms at runtime, which serve as an authentication path between the two separate realms. However, the process of generating an authentication path for two distributed services can be highly complicated. It could involve a large number of extra operations for credential conversion and require a long chain of invocations to intermediate services. In this paper, we address this problem by designing and implementing a new cross-realm authentication
13
PLCDDM13
Dynamic Authentication for Cross-Realm SOA-Based Business Processes


protocol for dynamic service interactions, based on the notion of service-oriented multiparty business sessions. Our protocol requires neither credential conversion nor establishment of any authentication path between the participating services in a business session. The correctness of the protocol is formally analyzed and proven, and an empirical study is performed using two production-quality Grid systems, Globus 4 and CROWN. 14 PLCDDM14 A Genetic Programming Approach to Record Deduplication Several systems that rely on consistent data to offer high-quality services, such as digital libraries and e-commerce brokers, may be affected by the existence of duplicates, quasi replicas, or nearduplicate entries in their repositories. Because of that, there have been significant investments from private and government organizations for developing methods for removing replicas from its data repositories. This is due to the fact that clean and replicafree repositories not only allow the retrieval of higher quality information but also lead to more concise data and to potential savings in computational time and resources to process this data. In this paper, we propose a genetic programming approach to record deduplication that combines several different pieces of evidence extracted from the data content to find a deduplication function that is able to identify whether two entries in a repository are replicas or not. As shown by our experiments, our approach outperforms an existing state-of-the-art method found in the literature. Moreover, the suggested functions are computationally less demanding since they use fewer evidence. In addition, our genetic programming approach is capable of automatically adapting these functions to a given fixed replica identification boundary, freeing the user from the burden of having to choose and tune this parameter As keyword search algorithms do not differentiate between the possible informational needs represented by a keyword query, users may not receive adequate results. This paper presents IQP a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP enables a user to start with an arbitrary keyword query and incrementally refine it into a structured query through an interactive interface. The enabling techniques of IQP include: 1) a probabilistic framework for incremental query construction; 2) a probabilistic model to assess the possible informational needs represented by a keyword query; 3) an algorithm to obtain the optimal query construction process. This paper presents the detailed design of IQP , and demonstrates its effectiveness and scalability through experiments over real-world data and a user study.
15
PLCDDM15
A Probabilistic Scheme for Keyword-Based Incremental Query Construction


16 PLCDDM16 Document Clustering in Correlation Similarity Measure Space This paper presents a new spectral clustering method called correlation preserving indexing (CPI), which is performed in the correlation similarity measure space. In this framework, the documents are projected into a low-dimensional semantic space in which the correlations between the documents in the local patches are maximized while the correlations between the documents outside these patches are minimized simultaneously. Since the intrinsic geometrical structure of the document space is often embedded in the similarities between the documents, correlation as a similarity measure is more suitable for detecting the intrinsic geometrical structure of the document space than euclidean distance. Consequently, the proposed CPI method can effectively discover the intrinsic structures embedded in highdimensional document space. The effectiveness of the new method is demonstrated by extensive experiments conducted on various data sets and by comparison with existing document clustering methods. In this paper, we introduce the first application of the belief propagation algorithm in the design and evaluation of trust and reputation management systems. We approach the reputation management problem as an inference problem and describe it as computing marginal likelihood distributions from complicated global functions of many variables. However, we observe that computing the marginal probability functions is computationally prohibitive for large-scale reputation systems. Therefore, we propose to utilize the belief propagation algorithm to efficiently (in linear complexity) compute these marginal probability distributions; resulting a fully iterative probabilistic and belief propagation-based approach (referred to as BP-ITRM). BP-ITRM models the reputation system on a factor graph. By using a factor graph, we obtain a qualitative representation of how the consumers (buyers) and service providers (sellers) are related on a graphical structure. The Machine Learning field has gained its thrust in almost any domain of research and just recently has become a reliable tool in the medical domain. The experiential domain of automatic learning is used in tasks such as medical decision support, medical imaging, protein-protein interaction, extraction of medical knowledge, and for overall patient management care. ML is envisioned as a tool by which computer-based systems can be integrated in the healthcare field in order to get a better, wellorganized medical care. It 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. Our evaluation results for these tasks show that the proposed methodology obtains reliable outcomes that could be integrated in an application to be used in the medical care domain. The potential value of this paper stands in the ML settings that we propose and in the fact that we outperform previous results on the same data set
17
PLCDDM17
Iterative Trust and Reputation Management Using Belief Propagation
18
PLCDDM18
A machine learning approach for identifying diseasetreatment relations in short texts


19 PLCDDM19 Authenticated Multi-Step nearest Neighbor Search Let Database (DB) be a D-dimensional dataset. Each record belongs to the dataset which is contains collection of data in matched and unmatched manner. Here this project proposes the data mining concept Nearest Neighbor which is searching the accurate information from the dataset. We focus on authenticated multi step NN search for application that requires a proof of result correctness. For instance, argues that the most cost effective way for medical facilities to maintain radiology images is to outsource all image management tasks to specialized commercial provider. The latter returns the result set and additional verification information, based on which the client establishes that the result is indeed correct i.e., it contains and that these records of DB that satisfy the query condition and that these records indeed originate from legitimate data source. The GEMINI is a framework which is the most common approach for performing similarity search over high dimensional data. In this setting, clients issue NN queries to a server that maintains a database signed by a trusted authority. The server returns the NN set along with information that permits result verification using the dataset signature. A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data is leaked and found in an unauthorized place (e.g., on the web or somebodys laptop). The distributor must assess the likelihood that the leaked data came from one or more agents, as opposed to having been independently gathered by other means. We propose data allocation strategies (across the agents) that improve the probability of identifying leakages. These methods do not rely on alterations of the released data (e.g., watermarks). In some cases we can also inject realistic but fake data records to further improve our chances of detecting leakage and identifying the guilty party. A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. Such a neighborhood concept can be specified by the user via different functions. It can be an explicit circular region within a given distance from the flat. Another intuitive definition is to assign higher weights to the features based on their proximity to the flat. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Extensive evaluation of our methods on both real and synthetic data reveals that an optimized branch-andbound solution is efficient and robust with respect to different parameters.
20
PLCDDM20
Data Leakage Detection
21
PLCDDM21
Ranking Spatial Data by Quality Preferences


22 PLCDDM22 Usher: Improving Data Quality with Dynamic Forms Data quality is a critical problem in modern databases. Data-entry forms present the first and arguably best opportunity for detecting and mitigating errors, but there has been little research into automatic methods for improving data quality at entry time. In this paper, we propose USHER, an end-to-end system for form design, entry, and data quality assurance. Using previous form submissions, USHER learns a probabilistic model over the questions of the form. USHER then applies this model at every step of the data-entry process to improve data quality. Before entry, it induces a form layout that captures the most important data values of a form instance as quickly as possible and reduces the complexity of error-prone questions. During entry, it dynamically adapts the form to the values being entered by providing real-time interface feedback, reasking questions with dubious responses, and simplifying questions by reformulating them. After entry, it revisits question responses that it deems likely to have been entered incorrectly by reasking the question or a reformulation thereof. We evaluate these components of USHER using two realworld data sets. Our results demonstrate that USHER can improve data quality considerably at a reduced cost when compared to current practice. Search engine companies collect the database of intentions, the histories of their users search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by differential privacy unfortunately does not provide any utility for this problem. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to kanonymity while at the same time achieving much stronger privacy guarantees. The intrusion response component of an overall intrusion detection system is responsible for issuing a suitable response to an anomalous request. This paper propose the notion of database response policies to support our intrusion response system tailored for a DBMS. Our interactive response policy language makes it very easy for the database administrators to specify appropriate response actions for different circumstances depending upon the nature of the anomalous request. The two main issues that are address in context of such response policies are that of policy matching, and policy administration. For the policy matching problem, this paper propose two algorithms that efficiently search the policy database for policies that match an anomalous request. We also extend the PostgreSQL DBMS with our policy matching mechanism, and report experimental results. The experimental evaluation shows that our techniques are very efficient. The other issue that we address is that of administration
23
PLCDDM23
Publishing search logs a comparative study of privacy guarantees
24
PLCDDM24
Design and implementation of an intrusion response system for relatinal database


of response policies to prevent malicious modifications to policy objects from legitimate users. The proposed system introduces a novel Joint Threshold Administration Model (JTAM) that is based on the principle of separation of duty. The key idea in JTAM is that a policy object is jointly administered by at least k database administrator (DBAs), that is, any modification made to a policy object will be invalid unless it has been authorized by at least k DBAs. This paper present design details of JTAM which is based on a cryptographic threshold signature scheme, and show how JTAM prevents malicious modifications to policy objects from authorized users. 25 PLCDDM25 A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification Feature clustering is a powerful method to reduce the dimensionality of feature vectors for text classification. In this paper, we propose a fuzzy similarity-based self-constructing algorithm for feature clustering. The words in the feature vector of a document set are grouped into clusters, based on similarity test. Words that are similar to each other are grouped into the same cluster. Each cluster is characterized by a membership function with statistical mean and deviation. When all the words have been fed in, a desired number of clusters are formed automatically. We then have one extracted feature for each cluster. The extracted feature, corresponding to a cluster, is a weighted combination of the words contained in the cluster. By this algorithm, the derived membership functions match closely with and describe properly the real distribution of the training data. Besides, the user need not specify the number of extracted features in advance,and trialand-error for determining the appropriate number of extracted features can then be avoided. Experimental results show that our method can run faster and obtain better extracted features than other methods. Many data mining techniques have been proposed for mining useful patterns in text documents. However, how to effectively use and update discovered patterns is still an open research issue, especially in the domain of text mining. Since most existing text mining methods adopted term-based approaches, they all suffer from the problems of polysemy and synonymy. Over the years, people have often held the hypothesis that pattern (or phrase)based approaches should perform better than the term-based ones, but many experiments do not support this hypothesis. This paper presents an innovative and effective pattern discovery technique which includes the processes of pattern deploying and pattern evolving, to improve the effectiveness of using and updating discovered patterns for finding relevant and interesting information. Substantial experiments on RCV1 data collection and TREC topics demonstrate that the proposed solution achieves encouraging performance
26
PLCDDM26
Effective Pattern Discovery for Text Mining


27 PLCDDM27 Practical Efficient String Mining In recent years, several algorithms for mining frequent and emerging substring patterns from databases of string data (such as proteins and natural language texts) have been discovered, all of which traverse an enhanced suffix array data structure. All of these algorithms lie at either extreme of the efficiency spectrum; they are either fast and use enormous amounts of space, or they are compact and orders of magnitude slower. In this paper, we present an algorithm that achieves the best of both these extremes, having runtime comparable to the fastest published algorithms while using less space than the most space efficient ones. This excellent practical performance is underpinned by theoretical guarantees. Our main mechanism for keeping memory usage low is to build the enhanced suffix array incrementally, in blocks. Once built, a block is traversed to output patterns with required support before its space is reclaimed to be used for the next bloc With the increasing of the information on Internet, more and more electronic data are appearing. Then, how should we immidiately discover useful knowledge and improve the utilization rate of information without being confused in the sea of information? Data mining come up with a new way of dealing with such problem. This paper sets force web data mining sources in ecommerce, the flow process and some techniques in dealing with web data mining. Finally, analyses the functions of web data mining used in e-commerce Detecting performance anomalies and finding their root causes are tedious tasks requiring much manual work. Functionality enhancements in DBMS development as in most software development often introduce performance problems in addition to bugs. To detect the problems as soon as they are introduced, which often happens during the early phases of a development cycle, we adopt performance regression testing early in the process. In this paper, we describe a framework that we developed to manage performance anomalies after establishing a set of conditions for a problem to be considered an anomaly. The framework uses Statistical Process Control (SPC) charts to detect performance anomalies and differential profiling to identify their root causes. By automating the tasks within the framework we were able to remove most of the manual overhead in detecting anomalies and reduce the analysis time for identifying the root causes by about 90 percent in most cases. The tools developed and deployed based on the framework allow us continuous, automated daily monitoring of performance in addition to the usual functionality monitoring in our DBMS development A fundamental problem for peer-to-peer (P2P) applications in mobile-pervasive computing environment is to efficiently identify the node that stores particular data items and download them while preserving battery power. In this paper, we propose a P2P Minimum Boundary Rectangle (PMBR, for short) which is a new spatial index specifically designed for mobile P2P environments. A node that contains desirable data item (s) can be easily identified by reading the PMBR index. Then, we propose a selective tuning
28
PLCDDM28
The application of Web data mining in the electronic commerce
29
PLCDDM29
A Performance Anomaly Detection and Analysis Framework for DBMS Development
30
PLCDDM30
Energy Efficient Data Access in Mobile P2P Networks


algorithm, called Distributed exponential Sequence Scheme (DSS, for short), that provides clients with the ability of selective tuning of data items, thus preserving the scarce power resource. The proposed algorithm is simple but efficient in supporting linear transmission of spatial data and processing of location-aware queries. The results from theoretical analysis and experiments show that the proposed algorithm with the PMBR index is scalable and energy efficient in both range queries and nearest neighbour queries. Semantic similarity measures play important roles in information retrieval and Natural Language Processing. Previous work in semantic web related applications such as community mining, relation extraction, and automatic meta data extraction have used various semantic similarity measures. Despite the usefulness of semantic similarity measures in these applications, robustly measuring semantic similarity between two words (or entities) remains a challenging task. We propose a robust semantic similarity measure that uses the information available on the Web to measure similarity between words or entities. The proposed method exploits page counts and text snippets returned by a Web search engine. We dene various similarity scores for two given words P and Q, using the page counts for the queries P, Q and P AND Q. Moreover, we propose a novel approach to compute semantic similarity using automatically extracted lexico-syntactic patterns from text snippets. These dierent similarity scores are integrated using support vector machines, to leverage a robust semantic similarity measure. Experimental results on MillerCharles benchmark dataset show that the proposed measure outperforms all the existing web-based semantic similarity measures by a wide margin, achieving a correlation coeffcient of 0:834. E-mail communication is indispensable nowadays, but the e-mail spam problem continues growing drastically. In recent years, the notion of collaborative spam filtering with near-duplicate similarity matching scheme has been widely discussed. The primary idea of the similarity matching scheme for spam detection is to maintain a known spam database, formed by user feedback, to block subsequent near-duplicate spams. On purpose of achieving efficient similarity matching and reducing storage utilization, prior works mainly represent each e-mail by a succinct abstraction derived from e-mail content text. However, these abstractions of e-mails cannot fully catch the evolving nature of spams, and are thus not effective enough in near-duplicate detection. In this paper, we propose a novel e-mail abstraction scheme, which considers e-mail layout structure to represent emails. We present a procedure to generate the e-mail abstraction using HTML content in e-mail, and this newly devised abstraction can more effectively capture the near-duplicate phenomenon of spams. Moreover, we design a complete spam detection system Cosdes (standing for COllaborative Spam Detection System), which possesses an efficient near-duplicate matching scheme and a progressive update scheme.
31
PLCDDM31
Measuring Semantic Similarity between Words Using Web Search Engines
32
PLCDDM32
Cosdes: A Collaborative Spam Detection System with a Novel E-Mail Abstraction Scheme


33 PLCDDM33 Decision Tree For Uncertain Data Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information. Value uncertainty arises in many applications during the data collection process. Example sources of uncertainty include measurement/quantization errors, data staleness, and multiple repeated measurements. With uncertainty, the value of a data item is often represented not by one single value, but by multiple values forming a probability distribution. Rather than abstracting uncertain data by statistical derivatives (such as mean and median), we discover that the accuracy of a decision tree classifier can be much improved if the complete information of a data item (taking into account the probability density function (PDF)) is utilized. We extend classical decision tree building algorithms to handle data tuples with uncertain values. Cloud applications that offer data management services are emerging. Such clouds support caching of data in order to provide quality query services. The users can query the cloud data, paying the price for the infrastructure they use. Cloud management necessitates an economy that manages the service of multiple users in an efficient, but also, resourceeconomic way that allows for cloud profit. Naturally, the maximization of cloud profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects the correlation of cache structures involved in the queries. Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. This paper proposes a novel price-demand model designed for a cloud cache and a dynamic pricing scheme for queries executed in the cloud cache. The pricing solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner. The experimental study shows the efficiency of the solution. Resource allocation and scheduling are fundamental issues in a Workflow Management System (WfMS).Effective resource management in WfMS should examine resource allocation together with task scheduling since these problems impose mutual constraints. Optimization of the one factor is subject to the other constraints and vice versa. Thus, an ideal algorithm should take into account not only performance metrics of the infrastructure, such as the number of resources and their utilization, but also quality criteria such as the percentage of tasks undergone violation in their temporal restrictions. In this paper, we propose an innovative algorithm which jointly optimizes the two aforementioned contradictory criteria. The algorithm, called 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. To achieve the optimization, 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
34
PLCDDM34
Optimal service pricing for a cloud cache
35
PLCDDM35
Optimizing Resource Conflicts in Workflow Management Systems


achieve runtime integration of our algorithm into a functional WfMS, while experimental results under different load environments and tasks assumption reveal the superiority of the proposed strategy than the other conventional approaches.
MOBILE COMPUTING /WRELESS COMMUNICATION
S.No 1
Code PLCDMC01
Title Resource-Aware Video Multicasting via Access Gateways in Wireless Mesh Networks
Abstract This paper studies video multicasting in large-scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy and low-capacity multihop wireless paths. A set of heuristic-based algorithms is described that together aim to maximize reliable network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link-controlled routing tree algorithm, and the dynamic group management algorithm. These algorithms use different approaches to arrange nodes involved in video multicasting into a clustered and two-tier integrated architecture in which network protocols can make use of multiple gateways to improve system throughput. This paper presents positioning algorithms for cellular networkbased vehicle tracking in severe non-line-of-sight (NLOS) propagation scenarios. The aim of the algorithms is to enhance positional accuracy of network-based positioning systems when the GPS receiver does not perform well due to the complex propagation environment. A one-step position estimation method and another two-step method are proposed and developed. Constrained optimization is utilized to minimize the cost function which takes account of the NLOS error so that the NLOS effect is significantly reduced. Vehicle velocity and heading direction measurements are exploited in the algorithm development, which may be obtained using a speedometer and a heading sensor, respectively. The developed algorithms are practical so that they are suitable for implementation in practice for vehicle applications. It is observed through simulation that in severe NLOS propagation scenarios, the proposed positioning methods outperform the existing cellular network based positioning algorithms significantly. Further, when the distance measurement error is modelled as the sum of an exponential bias variable and a Gaussian noise variable, the exact expressions of the CRLB are derived to benchmark the performance of the positioning algorithms.
PLCDMC02
Geometry and Motion-Based Positioning Algorithms for Mobile Tracking in NLOS Environments


3 PLCDMC03 Stateless Multicast Protocol for Ad Hoc Networks Multicast routing protocols typically rely on the a priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In dynamic networks with bursty traffic, where long periods of silence are expected between the bursts of data, this multicast state maintenance adds a large amount of communication, processing, and memory overhead for no benefit to the application. Thus, we have developed a stateless receiver-based multicast (RBMulticast) protocol that simply uses a list of the multicast members (e.g., sinks) addresses, embedded in packet headers, to enable receivers to decide the best way to forward the multicast traffic. This protocol, called Receiver-Based Multicast, exploits the knowledge of the geographic locations of the nodes to remove the need for costly state maintenance (e.g., tree/mesh/neighbor table maintenance), making it ideally suited for multicasting in dynamic networks. RBMulticast was implemented in the OPNET simulator and tested using a sensor network implementation. Both simulation and experimental results confirm that RBMulticast provides high success rates and low delay without the burden of state maintenance. This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR. Both theoretical analysis and simulation results show that POR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well. Faulty components in a network need to be localized and repaired to sustain the health of the network. In this paper, we propose a novel approach that carefully combines active and passive measurements to localize faults in wireless sensor networks. More specifically, we formulate a problem of optimal sequential testing guided by end-to-end data. This problem determines an optimal testing sequence of network components based on end-to-end data in sensor networks to minimize expected testing cost. We prove that this problem is NP-hard, and propose a recursive approach to solve it. This approach leads to a polynomial-time optimal algorithm for line topologies while requiring exponential running time for general topologies. We further develop two
PLCDMC04
Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
PLCDMC05
Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor Networks


polynomial-time heuristic schemes that are applicable to general topologies. Extensive simulation shows that our heuristic schemes only require testing a very small set of network components to localize and repair all faults in the network. Our approach is superior to using active and passive measurements in isolation. It also outperforms the state-of-the-art approaches that localize and repair all faults in a network. 6 PLCDMC06 Event Driven Web Video SummarizationA Cooperative Communication Scheme Based on Coalition Formation Game in Clustered wireless Sensor Networks In this work, we study the problem of how tostrike a balance between the QoS provisioning and the energ efficiency when a cooperative communication scheme is applied to a clustered wireless sensor network. Specifically, we first characterize the tradeoff by a multi-variable optimization problem, with the goal of balancing the outage performance and the network lifetime. Then, we horizontally decompose the problem into the concatenation of two subproblems: i) the longhaul transmit power per sensor node, and ii) the set of assisting cluster nodes. For the former one, an optimal long-haul transmit power solution is proposed based on the Lambert W function. The latter one is modeled as a coalition formation game, where the characteristic function is designed based on the combination of the former subproblems results. Furthermore, an optimal algorithm is proposed by using a dynamic coalition formation process based on the best-reply process with trial opportunity. Extensive simulation results are presented to demonstrate the effectiveness of our proposed scheme. Sensing and power strategy optimizations are important research topics in cognitive radio systems that hold the promise of advancing green communication. This letter gives a brief overview of the existing power allocation design in the literature and unifies them into a general power allocation framework. Based on the closed-form solution derived for this general problem, the impact of network topology on the system performance is highlighted, which motivates us to propose a novel location-aware strategy that intelligently utilizes frequency and space opportunities and minimizes the overall power consumption while maintaining the quality of service of the primary system. This work shows that in addition to exploring spectrum holes in time and frequency domains, spatial opportunities can be utilized to further enhance energy efficiency for CR systems. In this paper, we present a distributive heuristic algorithm for maximizing the network throughput in adaptive power and adaptive rate spatial-TDMA wireless mesh networks.At each step of our algorithm, the link with highest receive Signal-toInterference and Noise Ratio in its neighborhood is included in the schedule that is set for the underlying time slot, configuring its Modulation/Coding Scheme so that it transmits at the highest feasible power and rate levels. The transmitting node of the winning link announces the current receive power margin of its links receiver to its neighbors. The transmitters of unscheduled links subsequently calculate the maximum potential Signal-toInterference and Noise Ratio level at which their links could operate if scheduled next. The process repeats until the
PLCDMC07
A Framework for Location-Aware Strategies in Cognitive Radio Systems
PLCDMC08
A Robust Distributive Approach to Adaptive Power and Adaptive Rate Link Scheduling in Wireless Mesh Networks


announced power margins of scheduled links do not allow more additions to the schedule at the underlying time slot. We show the performance of this distributive algorithm to be within 5-10% of that exhibited by our recently developed centralized algorithm, while inducing a much lower computational complexity. We also demonstrate the robustness and energy efficiency of our distributive algorithm by applying it to schedule a new set of links on top of an existing schedule. For the examined scenarios, we show that the throughput rate achieved by using such an incremental scheduling scheme is within 15% of the throughput rate attained when a complete scheduling of all the links is carried out, while reducing the control traffic overhead rate and achieving a more energy efficient operation. 9 PLCDMC09 An Autonomous Resource Block Assignment Scheme for OFDMABased Relay-Assisted Cellular Networks Terminal relaying offers an effective means for improving the performance of OFDMA-based wireless networks. However, with the increase in the number of relaying terminals (RTs), their coordination becomes a cumbersome task. To address this drawback, in this paper an autonomous scheme is proposed whereby the RTs assign resource blocks (RBs) to incoming wireless terminals (WTs) in a way that minimizes the number of hit occurrences at which the same RB is assigned to multipleWTs. The proposed scheme uses cyclic group generators to determine the sequence of RBs to be assigned by each RT. This scheme is particularly beneficial in terminal relaying systems in which the distribution of the WTs is nonuniform and the channel quality indicators are not available. Simulation results show that the proposed scheme performs significantly better than currently available autonomous assignment schemes. Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. However, as the node density grows, the overhead incurred in the process of relay selection grows significantly. As such, end-to-end performance in terms of energy and latency is adversely impacted. With the motivation of developing a packet forwarding mechanism that is tolerant to variation in node density, an alternative position-based protocol is proposed in this paper. In contrast to existing beaconless protocols, the proposed protocol is designed such that it eliminates the need for potential relays to undergo a relay selection process. Rather, any eligible relay may decide to forward the packet ahead, thus significantly reducing the underlying overhead. The operation of the proposed protocol is empowered by exploiting favorable features of orthogonal frequency division multiplexing (OFDM) at the physical layer. The end-to-end performance of the proposed protocol is evaluated against existing beaconless position-based protocols analytically and as well by means of simulations. The proposed protocol is demonstrated in this paper to be more efficient. In particular, it is shown that for the same amount of energy the proposed protocol transports one bit from source to destination much quicker. We investigate bandwidth allocation in next generation cellular
10
PLCDMC10
An Efficient Multi-Carrier Position-Based Packet Forwarding Protocol for Wireless Sensor Networks
11
PLCDMC11
Bandwidth Sharing for Relaying


in Cellular Systems systems employing relays similar to LTE advanced systems with type I relays. We jointly optimize the bandwidth and power usage under constraints on required rate, bandwidth and transmit power. We study scenarios wherein, the relay acts as a forwarder for multiple User Equipments (UEs/users) in both uplink and/or downlink. This includes scenarios when the relay has its own data to send along with forwarding the data of other users. We examine the weighted power minimization problem for relaying with multiple users. We also show specific results with user scenario and also single user case in order to understand how the bandwidth and power are allocated. Numerical evaluations with users on a three sector LTE-A cell employing Fractional Frequency Reuse (FFR) indicate that power savings of at least 3 dB can be achieved by optimizing over both bandwidth and power. Although topology control has received much attention in stationary sensor networks by effectively minimizing energy consumption, reducing interference, and shortening endto- end delay, the transience of mobile nodes in Mobile Ad hoc Networks (MANETs) renders topology control a great challenge. To circumvent the transitory nature of mobile nodes, kedge connected topology control algorithms have been proposed to construct robust topologies for mobile networks. However, uniformly using the value of k for localized topology control algorithms in any local graph is not effective because nodes move at different speeds. Moreover, the existing k-edge connected topology control algorithms need to determine the value of k a priori, but moving speeds of nodes are unpredictable, and therefore, these algorithms are not practical in MANETs. A dynamic method is proposed in this paper to effectively employ kedge connected topology control algorithms in MANETs. The proposed method automatically determines the appropriate value of k for each local graph based on local information while ensuring the required connectivity ratio of the whole network. The results show that the dynamic method can enhance the practicality and scalability of existing k-edge connected topology control algorithms while guaranteeing the network connectivity AbstractIn this work we investigate whether it is preferable to have a large number of short single-hop links or a small number of long single-hops in a multi-hop wireless network. We derive analytical expressions to compute the metric aggregate multi-hop information efficiency under different hopping strategies, and analyze the trade-off involving robustness of single-hop links, interference and hopping strategy. Index TermsAggregate multihop information efficiency, ad hoc networks, stochastic geometry. AbstractPower efficiency is an important design issue in mobile devices with limited power supplies. In this paper, we study a reward-based packet scheduling problem in wireless environments. We consider a general scenario in which a transmitter Communicates with multiple receivers periodically. To guarantee timely transmission of data, each packet is associated with a delay constraint. The periodic data streams have different
12
PLCDMC12
On Minimizing the Impact of Mobility on Topology Control in Mobile Ad Hoc Networks
13
PLCDMC13
Efficiency of Wireless Networks under Different Hopping Strategies
14
PLCDMC14
Maximizing Rewards in Wireless Networks with Energy and Timing Constraints for Periodic Data Streams


importance levels, power functions, and levels of data sizes. The more data a transmitter delivers the more rewards it obtains. Our objective is to develop schemes that selectively transmit data streams of different data sizes at different transmission rates so that the system reward can be maximized under given time and energy constraints. We show that the problem is NP-hard and develop a dynamic programming algorithm for the optimal solution in pseudopolynomial time. A fast polynomial-time heuristic approach based on clustering of states in state space is presented to achieve close approximation. Simulation results demonstrate the effectiveness of the optimal solution and show that the proposed polynomial-time approach can achieve nearoptimal results. Both approaches make a significant improvement over other approaches adapted from existing studies at a marginal runtime overhead. 15 PLCDMC15 Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes AbstractSecure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significant research efforts in this direction, some fundamental questions still remain unaddressed: In the presence of cheating beacon nodes, what are the necessary and sufficient conditions to guarantee a bounded error during two-dimensional distance-based location estimation? Under these necessary and sufficient conditions, what class of localization algorithms can provide this error bound? In this paper, 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. Furthermore, when the number of cheating beacons is below this threshold, we identify a class of distance-based localization algorithms that can always guarantee a bounded localization error. Finally, we outline three novel distance-based localization algorithms that belong to this class of bounded error localization algorithms. We verify their accuracy and efficiency by means of extensive simulation experiments using both simple and practical distance estimation error models. With the widespread adoption of cloud computing, the ability to record and account for the usage of cloud resources in a credible and verifiable way has become critical for cloud service providers and users alike. The success of such a billing system depends on several factors: the billing transactions must have integrity and nonrepudiation capabilities; the billing transactions must be nonobstructive and have a minimal computation cost; and the service level agreement (SLA) monitoring should be provided in a trusted manner. Existing billing systems are limited in terms of security capabilities or computational overhead.AbstractWireless mesh networks are a promising area for the deployment of new wireless communication and networking technologies. In this paper, we address the problem of enabling effective peer-to-peer resource sharing in this type of networks. Starting from the well-known Chord protocol for resource sharing in wired networks, we propose a specialization that accounts for peculiar features of
16
PLCDMC16
Enabling Efficient Peer-to-Peer Resource Sharing in Wireless Mesh Networks


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. Through extensive packetlevel simulations, we investigate the separate effects of location awareness and MAC layer cross-layering, and of their combination, on the performance of the P2P application. The combined protocol, MESHCHORD, reduces message overhead of as much as 40 percent with respect to the basic Chord design, while at the same time improving the information retrieval performance. Notably, differently from the basic Chord design, our proposed MESHCHORD specialization displays information retrieval performance resilient to the presence of both CBR and TCP background traffic. Overall, the results of our study suggest that MESHCHORD can be successfully utilized for implementing file/resource sharing applications in wireless mesh networks. 17 PLCDMC17 VEBEK: Virtual Energy-Based Encryption and Keying for Wireless Sensor Networks AbstractDesigning cost-efficient, secure network protocols for Wireless Sensor Networks (WSNs) is a challenging problem because sensors are resource-limited wireless devices. Since the communication cost is the most dominant factor in a sensors energy Consumption, we introduce an energy-efficient Virtual Energy-Based Encryption and Keying (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. VEBEK is a secure communication framework where sensed data is encoded using a scheme based on a permutation code generated via the RC4 encryption mechanism. The key to the RC4 encryption mechanism dynamically changes as a function of the residual virtual energy of the sensor. Thus, a onetime dynamic key is employed for one packet only and different keys are used for the successive packets of the stream. The intermediate nodes along the path to the sink are able to verify the authenticity and integrity of the incoming packets using a predicted value of the key generated by the senders virtual energy, thus requiring no need for specific rekeying messages. VEBEK is able to efficiently detect and filter false data injected into the network by malicious outsiders. The VEBEK framework consists of two operational modes (VEBEK-I and VEBEK-II), each of which is optimal for different scenarios. In VEBEK-I, each node monitors its one-hop neighbors where VEBEK-II statistically monitors downstream nodes. We have evaluated VEBEKs feasibility and performance analytically and through simulations. Our results show that VEBEK, without incurring transmission overhead (increasing packet size or sending control messages for rekeying), is able to eliminate malicious data from the network in an energyefficient manner. We also show that our framework performs better than other comparable schemes in the literature with an overall 60-100 percent improvement in energy savings without the assumption of a reliable medium access control layer.


IMAGE PROCESSING S.No 1 Code PLCDIP01 Title A Kalman-Filtering Approach to High Dynamic Range Imaging for Measurement Applications Technology: Dotnet / Java Abstract High dynamic range imaging (HDRI) methods in computational photography address situations where the dynamic range of a scene exceeds what can be captured by an image sensor in a single exposure. HDRI techniques have also been used to construct radiance maps in measurement applications; unfortunately, the design and evaluation of HDRI algorithms for use in these applications have received little attention. In this paper, we develop a novel HDRI technique based on pixel-bypixel Kalman filtering and evaluate its performance using objective metrics that this paper also introduces. In the presented experiments, this new technique achieves as much as 9.4-dB improvement in signal-to-noise ratio and can achieve as much as a 29% improvement in radiometric accuracy over a classic method. Active contour models (ACMs) integrated with various kinds of external force fields to pull the contours to the exact boundaries have shown their powerful abilities in object segmentation. However, local minimum problems still exist within these models, particularly the vector fields equilibrium issues. Different from traditional ACMs, within this paper, the task of object segmentation is achieved in a novel manner by the Poincar map method in a defined vector field in view of dynamical systems. An interpolated swirling and attracting flow (ISAF) vector field is first generated for the observed image. Then, the states on the limit cycles of the ISAF are located by the convergence of Newton Raphson sequences on the given Poincar sections. Meanwhile, the periods of limit cycles are determined. Consequently, the objects boundaries are represented by integral equations with the corresponding converged states and periods. Experiments and comparisons with some traditional external force field methods are done to exhibit the superiority of the proposed method in cases of complex concave boundary segmentation, multiple-object segmentation, and initialization flexibility. In addition, it is more computationally efficient than traditional ACMs by solving the problem in some lower dimensional subspace without using level-set methods.
PLCDIP02
Image Segmentation Based on the Poincar Map Method


3 PLCDIP03 A Generalized Logarithmic Image Processing Model Based on the Gigavision Sensor Model The logarithmic image processing (LIP) model is a mathematical theory providing generalized linear operations for image processing. The gigavision sensor (GVS) is a new imaging device that can be described by a statistical model. In this paper, by studying these two seemingly unrelated models, we develop a generalized LIP (GLIP) model .With the LIP model being its special case, the GLIP model not only provides new insights into the LIP model but also defines new image representations and operations for solving general image processing problems that are not necessarily related to the GVS. A new parametric LIP model is also developed. To illustrate the application of the new scalar multiplication operation, we propose an energy-preserving algorithm for tone mapping, which is a necessary step in image dehazing. By comparing with results using two state-of-the-art algorithms, we show that the new scalar multiplication operation is an effective tool for tone mapping. We consider the problem of decomposing a video sequence into a superposition of (a given number of) moving layers. For this problem, we propose an energy minimization approach based on the coding cost. Our contributions affect both the model (what is minimized) and the algorithmic side (how it is minimized). The novelty of the coding-cost model is the inclusion of a refined model of the image formation process, known as super resolution. This accounts for camera blur and area averaging arising in a physically plausible image formation process. It allows us to extract sharp high-resolution layers from the video sequence. The algorithmic framework is based on an alternating minimization scheme and includes the following innovations. 1) A video labeling, we optimize the layer domains. This allows regularizing the shapes of the layers and a very elegant handling of occlusions. 2) We present an efficient parallel algorithm for extracting super-resolved layers based on TV filtering. In recent years Steganography plays an important role in secure communication. Steganography is a technique of embedding secret information into cover media, like image, video, audio and text, so that only the sender and the authorized recipient can detect the presence of secret information. In this paper we propose Spatial Domain Steganography using 1-Bit Most Significant Bit (MSB) with chaotic manner. The cover image is decomposed into blocks of 8*8 matrix of equal size. The first block of cover image is embedded with 8 bits of upper bound and lower bound values required for retrieving payload at the destination. The mean of median values and difference between consecutive pixels is determined to embed payload in 3bits of Least Significant Bit (LSB) and one bit of MSB in chaotic manner. It is observed that the capacity and security is improved compared to the existing methods with reasonable PSNR.
PLCDIP04
A Coding-Cost Framework for Super-Resolution Motion Layer Decomposition
PLCDIP05
Chaos based Spatial Domain Steganography using MSB

NETWORKING S.No 1 Code PLCDNW01 Title Packet-Hiding Methods for Preventing Selective Jamming Attacks
Technology: Dotnet / Java Abstract 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 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. Packet dropping and modification are common attacks that can be launched by an adversary to disrupt communication in wireless multihop sensor networks. Many schemes have been proposed to mitigate or tolerate such attacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose a simple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensive analysis and simulations have been conducted to verify the effectiveness and efficiency of the scheme. Emerging applications of wireless sensor networks (WSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. Due to the nondeterministic impacts of the wireless channel and queuing mechanisms, probabilistic analysis of QoS is essential. One important metric of QoS in WSNs is the probability distribution of the end-to-end delay. Compared to other widely used delay performance metrics such as the mean delay, delay variance, and worst-case delay, the delay distribution can be used to obtain the probability to meet a specific deadline for QoS-based communication in WSNs. To investigate the end-to-end delay distribution, in this paper, a comprehensive cross-layer analysis framework, which employs a stochastic queueing model in realistic channel environments, is developed. This framework is generic and can be parameterized for a wide variety of MAC protocols and routing protocols. Case studies with the CSMA/CAMAC protocol and an anycast protocol are conducted to illustrate how the developed framework can analytically predict the distribution of the end-to-end delay. Extensive test-bed experiments and simulations are performed to validate the accuracy of the framework for both deterministic and random deployments. Moreover, the effects of various network parameters on the
PLCDNW02
Catching Packet Droppers and Modifiers in Wireless Sensor Networks
PLCDNW03
Cross-Layer Analysis of the Endto-End Delay Distribution in Wireless Sensor Networks


distribution of end-to-end delay are investigated through the developed framework. 4 PLCDNW04 Selfish Overlay Network Creation and Maintenance A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of the network formation In this paper, we unify the aforementioned thrusts by defining and studying the selfish neighbour selection (SNS) game and its application to overlay routing. At the heart of SNS stands the restriction that peers are allowed up to a certain number of neighbors. This makes SNS substantially different from existing network formation games that impose no bounds on peer degrees. Having bounded degrees has important practical consequences as it permits the creation of overlay structures that require instead of link monitoring overhead. We show that a nodes best response wiring strategy amounts to solving a median problem on asymmetric distance. Best-response wirings have substantial practical utility as they permit selfish nodes to reap substantial performance benefits when connecting to overlays of no selfish nodes. A more intricate consequence is that even no selfish nodes can benefit from the existence of some selfish nodes since the latter, via their local optimizations, create a highly optimized backbone, upon which even simple heuristic wirings yield good performance. Recently, cloud computing has been extensively used worldwide and network slicing has attracted attentions for improving the access to the cloud platform. We have recently proposed a tag based slicing mechanism for coordinated wide area packet processing, called OpenTag. In this paper, we introduce a viable application on top of an OpenTag slice to demonstrate the usefulness and benefit of OpenTag architecture and tag-based resource slicing for high-speed packet processing. Our contributions are three-fold: (1) designing the OpenTag architecture for enabling user-oriented packet processing, (2) implementing a prototype of OpenTag system with all the components along end-to-end paths, (3) evaluating the feasibility of applications on top of OpenTag for improving the robustness of the access to cloud platforms. Peer-to-Peer multikeyword searching requires distributed intersection/union operations across wide area networks, raising a large amount of traffic cost. Existing schemes commonly utilize Bloom Filters (BFs) encoding to effectively reduce the traffic cost during the intersection/union operations. In this paper, we address the problem of optimizing the settings of a BF. We show, through mathematical proof, that the optimal setting of BF in terms of traffic cost is determined by the statistical information of the involved inverted lists, not the minimized false positive rate as claimed by previous studies. Through numerical analysis, we demonstrate how to obtain optimal settings. To better evaluate the performance of this design, we conduct comprehensive simulations on TREC WT10G test collection and query logs of a major commercial web search engine. Results show that our design significantly reduces the search traffic and latency of the existing approaches.
PLCDNW05
Applications of wide-area network slicing for improving cloud platform access by OpenTag
PLCDNW06
Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching


7 PLCDNW07 Improving Energy Saving and Reliability in Wireless Sensor Networks Using a Simple CRTBased Packet-Forwarding Solution This paper deals with a novel forwarding scheme for wireless sensor networks aimed at combining low computational complexity and high performance in terms of energy efficiency and reliability. The proposed approach relies on a packet-splitting algorithm based on the Chinese Remainder Theorem (CRT) and is characterized by a simple modular division between integers. An analytical model for estimating the energy efficiency of the scheme is presented, and several practical issues such as the effect of unreliable channels, topology changes, and MACoverhead are discussed. The results obtained show that the proposed algorithm outperforms traditional approaches in terms of power saving, simplicity, and fair distribution of energy consumption among all nodes in the network. Systems exploiting network coding to increase their throughput suffer greatly from pollution attacks, which consist of injecting malicious packets in the network. The pollution attacks are amplified by the network coding process, resulting in a greater damage than under traditional routing. In this paper, we address this issue by designing an unconditionally secure authentication code (that is, which does not rely on computational assumptions) suitable for multicast network coding, where the keying material is initially computed and distributed by a trusted authority to the destinations and intermediate nodes. The proposed scheme allows not only destinations, but also intermediate nodes, to verify the integrity and origin of the packets received without having to decode, and thus detect and discard the malicious messages in transit that fail the verification. This way, the pollution is canceled out before reaching the destinations. The proposed scheme is robust against pollution attacks from outsiders, as well as coalitions of malicious insider nodes, which have the ability to perform the integrity check, but instead get corrupted and use their knowledge to themselves attack the network. We analyze the performance of the scheme in terms of both throughput and goodput and show that the price to pay for tolerating inside attackers is a high decrease in throughput (it is inversely proportional to the number of insider attackers that can collude). We finally discuss applications to file distribution. A distributed adaptive opportunistic routing scheme for multihop wireless adhoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. 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 success probabilities. In particular, this learning framework leads to a stochastic routing scheme that optimally explores and exploits the opportunities in the network.
PLCDNW08
An Authentication Code Against Pollution Attacks
PLCDNW09
Adaptive Opportunistic Routing for Wireless Ad Hoc Networks


10 PLCDNW10 Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels This paper studies the bottleneck link capacity under the Gaussian channel model in strongly connected random wireless ad hoc networks, with nodes independently and uniformly distributed in a unit square. We assume that each node is equipped with two transceivers (one for transmission and one for reception) and allow all nodes to transmit simultaneously. We draw lower and upper bounds, in terms of bottleneck link capacity, for homogeneous networks (all nodes have the same transmission power level) and propose an energy-efficient power assignment algorithm (CBPA) for heterogeneous networks (nodes may have different power levels), with a provable bottleneck link capacity guarantee of, where is the channel bandwidth. In addition, we develop a distributed implementation of CBPA with message complexity and provide extensive simulation results. Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glance, existing social networkbased Sybil defense schemes can be divided into two categories: Sybil detection and Sybil tolerance. These two categories of systems both leverage global properties of the underlying social graph, but they rely on different assumptions and provide different guarantees: Sybil detection schemes are applicationindependent and rely only on the graph structure to identify Sybil identities, while Sybil tolerance schemes rely on applicationspecific information and leverage the graph structure and transaction history to bound the leverage an attacker can gain from using multiple identities. In this paper, we take a closer look at the design goals, models, assumptions, guarantees, and limitations of both categories of social network-based Sybil defence systems. In many network applications, the computation takes place on the minimum-cost spanning tree (MST) of the network G; unfortunately, a single link or node failure disconnects the tree. The ALL NODES REPLACEMENT (ANR) problem is the problem of precomputing, for each node u in G, the new MST should u fail. This problem has been extensively investigated for serial and parallel settings, and efficient solutions have been designed for those environments. The situation is surprisingly different in distributed settings. In fact, no distributed solution exists to date which performs better than the brute-force repeated application of MST construction. In this paper, we consider for the first time the problem of computing all the replacement minimum-cost spanning trees distributively. We design a solution protocol, and we prove that the total amount of communication exchanges taking place is On, each exchange using at most On data items. Hence, the total amount of data items communicated during the computation (the data complexity) is On2. We also show how the simpler problem ALL EDGES REPLACEMENT (AER) dealing with single edge failures, which can be solved with the same costs using some existing techniques In order to achieve resilient multipath routing, we introduce the concept of independent directed acyclic graphs (IDAGs) in this paper. Link-independent (node-independent) DAGs satisfy the
11
PLCDNW11
Exploring the design space of social network-based Sybil defences
12
PLCDNW12
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
13
PLCDNW13
Independent Directed Acyclic Graphs for Resilient Multipath Routing-networking


property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. Given a network, we develop polynomialtime algorithms to compute link-independent and nodeindependent DAGs. The algorithm developed in this paper: 1) provides multipath routing; 2) utilizes all possible edges; 3) guarantees recovery from single link failure; and 4) achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming edge. We show the effectiveness of the proposed IDAGs approach by comparing key performance indices to that of the independent trees and multiple pairs of independent trees techniques through extensive simulations. 14 PLCDNW14 Congestion-Dependent Pricing and Forward Contracts for Complementary Segments of a Communication Networknetworking Congestion-dependent pricing is a form of traffic Management that ensures the efficient allocation of bandwidth between users and applications. As the unpredictability of congestion prices creates revenue uncertainty for network providers and cost uncertainty for users, it has been suggested that forward contracts could be used to manage these risks. We develop a novel gametheoretic model of a multiprovider communication network with two complementary segments and investigate whether forward contracts would be adopted by service providers. Service on the upstream segment is provided by a single Internet service provider (ISP) and priced dynamically to maximize profit, while several smaller ISPs sell connectivity on the downstream network segment, with the advance possibility of entering into forward contracts with their users for some of their capacity. We show that the equilibrium forward contracting volumes are necessarily asymmetric, with one downstream provider entering into fewer forward contracts than the other competitors, thus ensuring a high subsequent downstream price level. In practice, network providers will choose the extent of forward contracting strategically based not only on their risk tolerance, but also on the market structure in the interprovider network and their peers actions. Given a positive value r, a distance based range query returns the objects that lie within the distance r of the query location. In this paper, we focus on the distance based range queries that continuously change their locations in a Euclidean space. We present an efficient and effective monitoring technique based on the concept of a safe zone. The safe zone of a query is the area with a property that while the query remains inside it, the results of the query remain unchanged. Hence, the query does not need to be re-evaluated unless it leaves the safe zone. Our contributions are as follows. 1) We propose a technique based on powerful pruning rules and a unique access order which efficiently computes the safe zone and minimizes the I/O cost. 2) We theoretically determine and experimentally verify the expected distance a query moves before leaving the safe zone and, for majority of queries, the expected number of guard objects. 3) Our experiments demonstrate that the proposed approach is close to optimal and is an order of magnitude faster than a nave algorithm. 4) We also extend our technique to monitor the queries in a road network. Our algorithm is up to two order of magnitude
15
PLCDNW15 Continuous Monitoring of Distance Based Range Queries


faster than a nave algorithm 16 PLCDNW16 Cross-Layer Jamming Detection and Mitigation in Wireless Broadcast Networks An effective countermeasure to the jamming attack is increasing the bandwidth of the spectrum of the communication system and using spread spectrum as part of the modulation technique. In spread-spectrum systems, a transmitter takes advantage of the increased bandwidth to redundantly encode information using a spreading code. To receive a message, a spread-spectrum receiver decodes the incoming signal by correlating the signal with the spreading code. Spread-spectrum codes are thus inherently symmetric; that is, the transmitter and the receiver use the same information for encoding and for decoding. Without knowing the spreading code used by a pair of a transmitter and receiver, unintended signals such as jamming or self-interference will likely appear noise-like upon decoding, and most of the unintended signal power can then be rejected by filtering. However, if a jammer discovers the spreading code in use (for example, by compromising the receiver), all benefit it of using spread spectrum against jamming is lost. In our system, the transmitter has more information than any proper subset of receivers. Each receiver cooperates with the transmitter to detect any jamming that affects that receiver. Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. An effective model of delaycontrolled load distribution becomes essential to efficiently utilize such parallel paths for multimedia data transmission and real-time applications, which are commonly known to be sensitive to packet delay, packet delay variation, and packet reordering. Recent research on load distribution has focused on load balancing efficiency, bandwidth utilization, and packet order preservation; however, a majority of the solutions do not address delay-related issues. This paper proposes a new load distribution model aiming to minimize the difference among end-to-end delays, thereby reducing packet delay variation and risk of packet reordering without additional network overhead. In general, the lower the risk of packet reordering, the smaller the delay induced by the packet reordering recovery process, i.e., extra delay induced by the packet reordering recovery process is expected to decrease. Therefore, our model can reduce not only the end-to-end delay but also the packet reordering recovery time. Finally, our proposed model is shown to outperform other existing models, via analysis and simulations.
17
PLCDNW17
Effective Delay-Controlled Load Distribution over Multipath Networks


18 PLCDNW18 LIVE STREAMING WITH RECEIVER-BASED PEER-DIVISION MULTIPLEXING In this paper we describe the network architecture of Zattoo, one of the largest production live streaming providers in Europe at the time of writing, and present a large-scale measurement study of Zattoo using data collected by the provider. Peer-Division Multiplexing to minimize per-packet processing time of a stream, the Zattoo protocol sets up a virtual circuit with multiple fan outs at each peer. Peer joins a TV channel it establishes a peer -division multiplexing (PDM) scheme amongst a set of neighboring peers, by building a virtual circuit to each of the neighboring peers. We represent a peer as a packet buffer, called the MDC, fed by sub streams incoming from the PDM constructed as described in a local media player if one is running. As packets from each sub-stream arrive at the peer, they are stored in the MDC for reassembly to reconstruct the full stream. Many wireless communication systems such as IS- 54, enhanced data rates for the GSM evolution (EDGE), worldwide interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted low-density parity-check (LDPC), tailbiting convolutional, and turbo codes as the forward error correcting codes (FEC) scheme for data and overhead channels. Therefore, many efficient algorithms have been proposed for decoding these codes. However, the different decoding approaches for these two families of codes usually lead to different hardware architectures. Since these codes work side by side in these new wireless systems, it is a good idea to introduce a universal decoder to handle these two families of codes. The present work exploits the parity-check matrix (H) representation of tailbiting convolutional and turbo codes, thus enabling decoding via a unified belief propagation (BP) algorithm. Indeed, the BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes as well as turbo codes. During their lifetime, multi-hop wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, dynamic obstacles and/or applications bandwidth demands. These failures cause severe performance degradation in WMNs or require expensive, manual network management for their realtime recovery. This paper presents an Autonomous network Reconfiguration System (ARS) that enables a multi-radio WMN to autonomously recover from local link failures to preserve network performance. By using channel and radio diversities in WMNs, ARS generates necessary changes in local radio and channel assignments in order to recover from failures. Next, based on the thus-generated configuration changes, the system cooperatively reconfigures network settings among local mesh routers. ARS has been implemented and evaluated extensively on our IEEE 802.11based WMN test-bed as well as through ns-2-based simulation. Our evaluation results show that ARS outperforms existing failurerecovery schemes in improving channel-efficiency by more than 90%and in the ability of meeting the applications bandwidth demands by an average of 200%.
19
PLCDNW19
Maelstrom: Transparent Error Correction for Communication between Data Canter
20
PLCDNW20
Self-Reconfigurable Wireless Mesh Networks


21 PLCDNW21 Secure High-Throughput Multicast Routing in Wireless Mesh Networks Recent work in multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute the path metric and forward data. The assumption that all nodes are honest and behave correctly during metric computation, propagation, and aggregation, as well as during data forwarding, leads to unexpected consequences in adversarial networks where compromised nodes act maliciously. In this work, we identify novel attacks against high-throughput multicast protocols in wireless mesh networks. The attacks exploit the local estimation and global aggregation of the metric to allow attackers to attract a large amount of traffic. We show that these attacks are very effective against multicast protocols based on high-throughput metrics. We conclude that aggressive path selection is a double-edged sword: While it maximizes throughput, it also increases attack effectiveness in the absence of defense mechanisms. Our approach to defend against the identified attacks combines measurementbased detection and accusation-based reaction techniques. The solution accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. Routing traffic subject to hose model constraints has been of much recent research interest. Two-phase routing has been proposed as a mechanism for routing traffic in the hose model. It has desirable properties in being able to statically preconfigure the transport network and in being able to handle constraints imposed by specialized service overlays. In this paper, we investigate whether the desirable properties of two-phase routing come with any resource overhead compared to: 1) direct source-destination path routing; and 2) optimal scheme among the class of all schemes that are allowed to even make the routing dynamically dependent on the traffic matrix. In the pursuit of this endeavor, we achieve several milestones. First, we develop a polynomial-size linear programming (LP) formulation for maximum throughput routing of hose traffic along direct source-destination paths. Second, we develop a polynomial-size LP formulation for maximum throughput two-phase routing of hose traffic for a generalized version of the scheme proposed in our previous work. Third, we develop a polynomial-size LP formulation for minimum-cost two-phase routing of hose traffic for the generalized version of the scheme. We also give a second (simpler) LP formulation and fast combinatorial algorithm for this problem using an upper bound on the end-to-end traffic demand. Brute force and dictionary attacks on password-only remote login services are now widespread and ever increasing. Enabling convenient login for legitimate users while preventing such attacks is a difficult problem. Automated Turing Tests (ATTs) continue to be an effective, easy-to-deploy approach to identify automated malicious login attempts with reasonable cost of inconvenience to users. In this paper, we discuss the inadequacy of existing and proposed login protocols designed to address large -scale online dictionary attacks (e.g., from a botnet of hundreds of thousands of
22
PLCDNW22
Traffic-Oblivious Routing in the Hose Model
23
PLCDNW23
Revisiting Defenses against Large-Scale Online Password Guessing Attacks


nodes). We propose a new Password Guessing Resistant Protocol (PGRP), derived upon revisiting prior proposals designed to restrict such attacks. While PGRP limits the total number of login attempts from unknown remote hosts to as low as a single attempt per username, legitimate users in most cases (e.g., when attempts are made from known, frequently-used machines) can make several failed login attempts before being challenged with an ATT. We analyze the performance of PGRP with two real-world data sets and find it more promising than existing proposals. 24 PLCDNW24 ROC: Resilient Online Coverage for Surveillance Applications We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor covers (subsets of nodes that cover the field) to efficiently exploit redundant node deployment and tolerate unexpected node failures. Little attention was given to studying the tradeoff between fault tolerance and energy efficiency in sensor coverage. In this work, our objectives are twofold. First, we aim at rapidly restoring field coverage under unexpected sensor failures in an energy-efficient manner. Second, we want to flexibly support different degrees of redundancy in the field without needing centralized control. To meet these objectives, we propose design guidelines for applications that employ distributed cover-selection algorithms to control the degree of redundancy at local regions in the field. In addition, we develop a new distributed technique to facilitate switching between active covers without the need for node synchronization. Demonstrate the effectiveness of ROC in operational scenarios and compare its performance with previous surveillance techniques. In wireless sensor networks, when a sensor node detects events in the surrounding environment, the sensing period for learning detailed information is likely to be short. However, the short sensing cycle increases the data traffic of the sensor nodes in a routing path. Since the high traffic load causes a data queue overflow in the sensor nodes, important information about urgent events could be lost. In addition, since the battery energy of the sensor nodes is quickly exhausted, the entire lifetime of wireless sensor networks would be shortened. In this paper, to address these problem issues, a new routing protocol is proposed based on a lightweight genetic algorithm. In the proposed method, the sensor nodes are aware of the data traffic rate to monitor the network congestion. In addition, the fitness function is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets in a genetic algorithm, the proposed method selects suitable data forwarding sensor nodes to avoid heavy traffic congestion. In experiments, the proposed method demonstrates efficient data transmission due to much less queue overflow and supports fair data transmission for all sensor nodes.
25
PLCDNW25
Traffic-aware routing protocol for wireless sensor networks


26 PLCDNW26 Integration of False Data Detection With Data Aggregation and Confidential Transmission in Wireless Sensor Networks AbstractIn wireless sensor networks, compromised sensor nodes can inject false data during both data aggregation and data forwarding. The existing false data detection techniques consider false data injections during data forwarding only and do not allow any change on the data by data aggregation. However, this paper presents a data aggregation and authentication protocol, called DAA, to integrate false data detection with data aggregation and confidentiality. To support data aggregation along with false data detection, the monitoring nodes of every data aggregator also conduct data aggregation and compute the corresponding smallsize message authentication codes for data verification at their pairmates. To support confidential data transmission, the sensor nodes between two consecutive data aggregators verify the data integrity on the encrypted data rather than the plain data. Performance analysis shows that DAA detects any false data injected by up to compromised nodes, and that the detected false data are not forwarded beyond the next data aggregator on the path. Despite that false data detection and data confidentiality increase the communication overhead, simulation results show That DAA can still reduce the amount of transmitted data by up to 60% with the help of data aggregation and early detection of false data. AbstractWe consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo flat fading. Spectral resources are to be divided among the users in order to maximize total user utility.We show that this problem can be cast as a nonlinear convex optimization problem, and describe an # algorithm to solve it. Computational experiments show that the algorithm typically converges in around 25 iterations,where each iteration has a cost that is #, with a modest constant. When the algorithm starts from an initial resource allocation that is close to optimal, convergence typically takes even fewer iterations. Thus, the algorithm can efficiently track the optimal resource allocation as the channel conditions change due to fading. We also show how our techniques can be extended to solve resource allocation problems that arise in wideband networks with frequency selective fading and when the utility of a user is also a function of the resource allocations in the past. AbstractIn this paper, we are interested in minimizing the delay and maximizing the lifetime o event-driven wireless sensor networks for which events occur infrequently. In such systems, most of the energy is consumed when the radios are on, waiting for a packet to arrive. Sleepwake scheduling is an effective mechanism to prolong the lifetime of these energy-constrained wireless sensor networks. However, sleepwake scheduling could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An interesting line of work attempts to reduce these delays by developing anycastbased packet forwarding schemes, where each node opportunistically forwards a packet to the first neighboring node that wakes up among multiple candidate nodes. In this paper, we
27
PLCDNW27
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
28
PLCDNW28
Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks With Anycast


first study how to optimize the any cast forwarding schemes for minimizing the expected packet-delivery delays from the sensor nodes to the sink. Based on this result, we then provide a solution to the joint control problem of how to optimally control the system parameters of the sleepwake scheduling protocol and the any cast packet-forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet-delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under practical scenarios where there are obstructions, e.g., a lake or a mountain, in the coverage area of the wireless sensor network. 29 PLCDNW29 Replication Routing in DTNs: A Resource Allocation Approach AbstractRouting protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, and so these approaches have only an incidental effect on such routing metrics as maximum or average delivery delay. In this paper, we present RAPID, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into perpacket utilities that determine how packets should be replicated in the system. We evaluate RAPID rigorously through a prototype deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real outdoor DTN. Our results suggest that RAPID significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads, RAPID is within 10% of the optimal performance.

NETWORK SECURITY
S.No 1
Code PLCDNS01
Title Risk-Aware Mitigation for MANET Routing Attacks
Abstract 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 natve fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and natve fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk-aware response mechanism to systematically cope with the identified routing attacks. Our riskaware 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. In order to realize scalable, flexible, and fine-grained access control of outsourced data in cloud computing, in this paper, we propose hierarchical attribute-set-based encryption (HASBE) by extending ciphertext-policy attribute-set-based encryption (ASBE) with a hierarchical structure of users. The proposed scheme not only achieves scalability due to its hierarchical structure, but also inherits flexibility and fine-grained access control in supporting compound attributes of ASBE. In addition, HASBE employs multiple value assignments for access expiration time to deal with user revocation more efficiently than existing schemes. We formally prove the security of HASBE based on security of the ciphertextpolicy attribute-based encryption (CP-ABE) scheme by Bethencourt et al. and analyze its performance and computational complexity. Brute force and dictionary attacks on password-only remote login services are now widespread and ever increasing. Enabling convenient login for legitimate users while preventing such attacks is a difficult problem. Automated Turing Tests (ATTs) continue to be an effective, easy-to-deploy approach to identify automated malicious login attempts with reasonable cost of inconvenience to users. In this paper, we discuss the inadequacy of existing and proposed login protocols designed to address largescale online dictionary attacks (e.g., from a botnet of hundreds of thousands of nodes). We propose a new Password Guessing Resistant Protocol (PGRP), derived upon revisiting prior proposals designed to restrict such attacks. While PGRP limits the total number of login attempts from unknown remote hosts to as low as a single attempt per
PLCDNS02
HASBE: A Hierarchical AttributeBased Solution for Flexible and Scalable Access Control in Cloud Computing
PLCDNS03
Revisiting Defences against Large-Scale Online Password Guessing Attacks


username, legitimate users in most cases (e.g., when attempts are made from known, frequently-used machines) can make several failed login attempts before being challenged with an ATT. 4 PLCDNS04 Exploring the design space of social network-based Sybil defences Recently, there has been significant research interesting leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glance, existing social networkbased Sybil defence schemes can be divided into two categories: Sybil detection and Sybil tolerance. These two categories of systems both leverage global properties of the underlying social graph, but they rely on different assumptions and provide different guarantees: Sybil detection schemes are applicationindependent and rely only on the graph structure to identify Sybil identities, while Sybil tolerance schemes rely on applicationspecific information and leverage the graph structure and transaction history to bound the leverage an attacker can gain from using multiple identities. In this paper, we take a closer look at the design goals, models, assumptions, guarantees, and limitations of both categories of social network-based Sybil defence systems Content distribution via network coding has received a lot of attention lately. However, direct application of network coding may be insecure. In particular, attackers can inject bogus data to corrupt the content distribution process so as to hinder the information dispersal or even deplete the network resource. Therefore, content verification is an important and practical issue when network coding is employed. When random linear network coding is used, it is infeasible for the source of the content to sign all the data, and hence, the traditional hash-and-sign methods are no longer applicable. Recently, a new on-the-fly verification technique has been proposed by Krohn et al. (IEEE S&P 04), which employs a classical homomorphic hash function. However, this technique is difficult to be applied to network coding because of high computational and communication overhead. We explore this issue further by carefully analyzing different types of overhead, and propose methods to help reducing both the computational and communication cost, and provides provable security at the same time. Security and privacy issues have become critically important with the fast expansion of multiagent systems. Most network applications such as pervasive computing, grid computing, and P2P networks can be viewed as multiagent systems which are open, anonymous, and dynamic in nature. Such characteristics of multiagent systems introduce vulnerabilities and threats to providing secured communication. One feasible way to minimize the threats is to evaluate the trust and reputation of the interacting agents. Many trust/reputation models have done so, but they fail to properly evaluate trust when malicious agents start to behave in an unpredictable way. Moreover, these models are ineffective in providing quick response to a malicious agents oscillating behaviour. Another aspect of multivalent systems which
PLCDNS05
On the Security and Efficiency of Content Distribution via Network Coding
PLCDNS06
SecuredTrust: A Dynamic Trust Computation Model for Secured Communication in Multiagent Systems


is becoming critical for sustaining good service quality is the even distribution of workload among service providing agents. Most trust/reputation models have not yet addressed this issue. So, to cope with the strategically altering behavior of malicious agents and to distribute workload as evenly as possible among service providers; we present in this paper a dynamic trust computation model called SecuredTrust. In this paper, we first analyze the different factors related to evaluating the trust of an agent and then propose a comprehensive quantitative model for measuring such trust. We also propose a novel load-balancing algorithm based on the different factors defined in our model. Simulation results indicate that our model compared to other existing models can effectively cope with strategic behavioral change of malicious agents and at the same time efficiently distribute workload among the service providing agents under stable condition.
PLCDNS07
A Stochastic Model of Multivirus Dynamics
Understanding the spreading dynamics of computer viruses (worms, attacks) is an important research problem, and has received much attention from the communities of both computer security and statistical physics. However, previous studies have mainly focused on single-virus spreading dynamics. In this paper, we study multivirus spreading dynamics, where multiple viruses attempt to infect computers while possibly combating against each other because, for example, they are controlled by multiple botmasters. Specifically, we propose and analyze a general model (and its two special cases) of multivirus spreading dynamics in arbitrary networks (i.e., we do not make any restriction on network topologies), where the viruses may or may not coreside on computers. Our model offers analytical results for addressing questions such as: What are the sufficient conditions (also known as epidemic thresholds) under which the multiple viruses will die out? What if some viruses can rob others? What characteristics do the multivirus epidemic dynamics exhibit when the viruses are (approximately) equally powerful? The analytical results make a fundamental connection between two types of factors: defense capability and network connectivity. This allows us to draw various insights that can be used to guide security defence. Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve one bit from a database, without the server inferring any information about the queried bit. These protocols are too costly in practice because they invoke complex arithmetic operations for every bit of the database. In this paper, we present pCloud, a distributed system that constitutes the first attempt toward practical cPIR. Our approach assumes a disk-based architecture that retrieves one page with a single query. Using a striping technique, we distribute the database to a number of cooperative peers, and leverage their computational resources to process cPIR queries in parallel. We implemented pCloud on the PlanetLab network, and experimented extensively with several system parameters. Our results indicate that pCloud reduces considerably the query response time compared to the traditional client/server model, and has a very low communication overhead.
PLCDNS08
pCloud: A Distributed System for Practical PIR


Additionally, it scales well with an increasing number of peers, achieving a linear speedup. 9 PLCDNS09 Dynamic Security Risk Management Using Bayesian Attack Graphs Security risk assessment and mitigation are two vital processes that need to be executed to maintain a productive IT infrastructure. On one hand, models such as attack graphs and attack trees have been proposed to assess the cause-consequence relationships between various network states, while on the other hand, different decision problems have been explored to identify the minimum-cost hardening measures. However, these risk models do not help reason about the causal dependencies between network states. Further, the optimization formulations ignore the issue of resource availability while analysing a risk model. In this paper, we propose a risk management framework using Bayesian networks that enable a system administrator to quantify the chances of network compromise at various levels. We show how to use this information to develop a security mitigation and management plan. In contrast to other similar models, this risk model lends itself to dynamic analysis during the deployed phase of the network. A Multi objective optimization platform provides the administrator with all trade-off information required to make decisions in a resource constrained environment. Compromised machines are one of the key security threats on the Internet; they are often used to launch various security attacks such as spamming and spreading malware, DDoS, and identity theft. Given that spamming provides a key economic incentive for attackers to recruit the large number of compromised machines, we focus on the detection of the compromised machines in a network that are involved in the spamming activities, commonly known as spam zombies. We develop an effective spam zombie detection system named SPOT by monitoring outgoing messages of a network. SPOT is designed based on a powerful statistical tool called Sequential Probability Ratio Test, which has bounded false positive and false negative error rates. In addition, we also evaluate the performance of the developed SPOT system using a two-month e-mail trace collected in a large US campus network. Our evaluation studies show that SPOT is an effective and efficient system in automatically detecting compromised machines in a network. For example, among the 440 internal IP addresses observed in the e-mail trace, SPOT identifies 132 of them as being associated with compromised machines. Out of the 132 IP addresses identified by SPOT, 126 can be either independently confirmed (110) or highly likely (16) to be compromised. Moreover, only seven internal IP addresses associated with compromised machines in the trace are missed by SPOT. In addition, we also compare the performance of SPOT with two other spam zombie detection algorithms based on the number and percentage of spam messages originated or forwarded by internal machines, respectively, and show that SPOT outperforms these two detection algorithms. Modern distributed applications are embedding an increasing degree of dynamism, from dynamic supply-chain management, enterprise federations, and virtual collaborations to dynamic
10
PLCDNS10
Detecting Spam Zombic By monitoring Outgoing Messages
11
PLCDNS11
Dynamic Authentication for Cross-Realm SOA-Based Business Processes


resource acquisitions and service interactions across organizations. Such dynamism leads to new challenges in security and dependability. Collaborating services in a system with a ServiceOriented Architecture (SOA) may belong to different security realms but often need to be engaged dynamically at runtime. If their security realms do not have a direct cross-realm authentication relationship, it is technically difficult to enable any secure collaboration between the services. A potential solution to this would be to locate intermediate realms at runtime, which serve as an authentication path between the two separate realms. However, the process of generating an authentication path for two distributed services can be highly complicated. It could involve a large number of extra operations for credential conversion and require a long chain of invocations to intermediate services. In this paper, we address this problem by designing and implementing a new cross-realm authentication protocol for dynamic service interactions, based on the notion of service-oriented multiparty business sessions. Our protocol requires neither credential conversion nor establishment of any authentication path between the participating services in a business session. The correctness of the protocol is formally analyzed and proven, and an empirical study is performed using two production-quality Grid systems, Globus 4 and CROWN. The experimental results indicate that the proposed protocol and its implementation have a sound level of scalability and impose only a limited degree of performance overhead, which is for example comparable with those securityrelated overheads in Globus 4. 12 PLCDNS12 Adaptive Fault-Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks Data sensing and retrieval in wireless sensor systems have a widespread application in areas such as security and surveillance monitoring, and command and control in battlefields. In querybased wireless sensor systems, a user would issue a query and expect a response to be returned within the deadline. While the use of fault tolerance mechanisms through redundancy improves query reliability in the presence of unreliable wireless communication and sensor faults, it could cause the energy of the system to be quickly depleted. Therefore, there is an inherent trade-off between query reliability versus energy consumption in query-based wireless sensor systems. In this paper, we develop adaptive fault-tolerant quality of service (QoS) control algorithms based on hop-by-hop data delivery utilizing source and path redundancy, with the goal to satisfy application QoS requirements while prolonging the lifetime of the sensor system. We develop a mathematical model for the lifetime of the sensor system as a function of system parameters including the source and path redundancy levels utilized. We discover that there exists optimal source and path redundancy under which the lifetime of the system is maximized while satisfying application QoS requirements. Numerical data are presented and validated through extensive simulation, with physical interpretations given, to demonstrate the feasibility of our algorithm design.


13 PLCDNS13 Predictive Network Anomaly Detection and Visualization Various approaches have been developed for quantifying and displaying network traffic information for determining network status and in detecting anomalies. Although many of these methods are effective, they rely on the collection of long-term network statistics. Here, we present an approach that uses shortterm observations of network features and their respective time averaged entropies. Acute changes are localized in network feature space using adaptive Wiener filtering and auto-regressive moving average modeling. The color-enhanced datagram is designed to allow a network engineer to quickly capture and visually comprehend at a glance the statistical characteristics of a network anomaly. First, average entropy for each feature is calculated for every second of observation. Then, the resultant short-term measurement is subjected to first- and second-order time averaging statistics. These measurements are the basis of a novel approach to anomaly estimation based on the well-known Fisher linear discriminant (FLD). Average port, high port, server ports, and peered ports are some of the network features used for stochastic clustering and filtering. We empirically determine that these network features obey Gaussian-like distributions. The proposed algorithm is tested on real-time network traffic data from Ohio Universitys main Internet connection. In this paper, we propose a novel mechanism for IP traceback using information theoretical parameters, and there is no packet marking in the proposed strategy; we, therefore, can avoid the inherited shortcomings of the packet marking mechanisms. In this paper, 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 advantagesit is memory nonintensive, efficiently scalable, robust against packet pollution, and independent of attack traffic patterns. The deterministic packet marking mechanism tries to mark the spare space of a packet with the packets initial routers information, e.g., IP address. The results of extensive experimental and simulation studies are presented to demonstrate the effectiveness and efficiency of the proposed method. In this paper, we propose a novel mechanism for IP traceback using information theoretical parameters, and there is no packet marking in the proposed strategy; we, therefore, can avoid the inherited shortcomings of the packet marking mechanisms. Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect the two basic methodologies used to achieve loadbalancing: Iterative key redistribution between neighbors and node migration. We identify these two key mechanisms and describe their relative advantages and disadvantages. Based on
14
PLCDNS14
TRACE BACK OF DDOS ATTACKS USING ENTROPY VARIATIONS
15
PLCDNS15
Fast and Cost-Effective Online Load Balancing in Distributed Range- Queriable Systems


this analysis, we propose NIXMIG, a hybrid method that adaptively utilizes these two extremes to achieve both fast and cost-effective load-balancing in distributed systems that support range queries. We theoretically prove its convergence and as a case study, we offer an implementation on top of a Skip Graph, where we thoroughly validate our findings in a variety of static, dynamic and realistic workloads. We compare NIXMIG with an existing loadbalancing algorithm proposed by Karger and Ruhl [1] and our experimental analysis shows that, NIXMIG can be as much as three times faster, requiring only one sixth and one third of message and item exchanges, respectively, to bring the system to a balanced state. 16 PLCDNS16 Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking Network based intruders seldom attack their victims directly from their own computer. Often, they stage their attacks through intermediate stepping stones in order to conceal their identity and origin. To identify the source of the attack behind the stepping stone(s), it is necessary to correlate the incoming and outgoing flows or connections of a stepping stone. To resist attempts at correlation, the attacker may encrypt or otherwise manipulate the connection traffic. Timing based correlation approaches have been shown to be quite effective in correlating encrypted connections. However, timing based correlation approaches are subject to timing perturbations that may be deliberately introduced by the attacker at stepping stones. Anonymity has received increasing attention in the literature due to the users awareness of their privacy nowadays. Anonymity provides protection for users to enjoy network services without being traced. While anonymity-related issues have been extensively studied in payment-based systems such as e-cash and peer-to-peer (P2P) systems, little effort has been devoted to wireless mesh networks (WMNs). On the other hand, the network authority requires conditional anonymity such that misbehaving entities in the network remain traceable. In this paper, we propose security architecture to ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in WMNs. The proposed architecture strives to resolve the conflicts between the anonymity and traceability objectives, in addition to guaranteeing fundamental security requirements including authentication, confidentiality, data integrity, and nonrepudiation. Thorough analysis on security and efficiency is incorporated, demonstrating the feasibility and effectiveness of the proposed architecture.s Privacy threat is one of the critical issues in multihop wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. Network coding has the potential to thwart these attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. On the other hand, the coding/mixing nature precludes the feasibility of employing the existing privacy-
17
PLCDNS17
SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
18
PLCDNS18
Network Coding Based Privacy Preservation against Traffic Analysis in Multi-Hop Wireless Networks


preserving techniques, such as Onion Routing. In this paper, we propose a novel network coding based privacy-preserving scheme against traffic analysis in multihop wireless networks. With homomorphic encryption, the proposed scheme offers two significant privacy-preserving features, packet flow untraceability and message content confidentiality, for efficiently thwarting the traffic analysis attacks. Moreover, the proposed scheme keeps the random coding feature. Theoretical analysis and simulative evaluation demonstrate the validity and efficiency of the proposed scheme. 19 PLCDNS19 Edge Adaptive Image Steganography Based on LSB Matching Revisited AbstractThe least-significant-bit (LSB)-based approach is a popular type of stenographic algorithms in the spatial domain. However, we find that in most existing approaches, the choice of embedding positions within a cover image mainly depends on a pseudorandom number generator without considering the relationship between the image content itself and the size of the secret message. Thus the smooth/flat regions in the cover images ill inevitably be contaminated after data hiding even at a low embedding rate, and this will lead to poor visual quality and low security based on our analysis and extensive experiments, especially for those images with many smooth regions. In this paper, we expand the LSB matching revisited image steganography and propose an edge adaptive scheme which can select the embedding regions according to the size of secret message and the difference between two consecutive pixels in the cover image. For lower embedding rates, only sharper edge regions are used while keeping the other smoother regions as they are. When the embedding rate increases, more edge regions can be released adaptively for data hiding by adjusting just a few parameters. The experimental results evaluated on 6000 natural images with three specific and four universal steganalytic algorithms show that the new scheme can enhance the security significantly compared with typical LSB-based approaches as well as their edge adaptive ones, such as pixel-value-differencing-based approaches, while preserving higher visual quality of stego images at the same time. response and hash index hierarchy. AbstractVarious approaches have been developed for quantifying and displaying network traffic information for determining network status and in detecting anomalies. Although many of these methods are effective, they rely on the collection of long-term network statistics. Here, we present an approach that uses short-term observations of network features and their respective time averaged entropies. Acute changes are localized in network feature space using adaptive Wiener filtering and autoregressive moving average modeling. The color-enhanced datagram is designed to allow a network engineer to quickly capture and visually comprehend at a glance the statistical characteristics of a network anomaly. First, average entropy for each feature is calculated for every second of observation. Then, the resultant short-term measurement is subjected to first- and second-order time averaging statistics. These measurements are
20
PLCDNS20
Predictive Network Anomaly Detection and Visualization


the basis of a novel approach to anomaly estimation based on the well-known Fisher linear discriminant (FLD). Average port, high port, server ports, and peered ports are some of the network features used for stochastic clustering and filtering. We empirically determine that these network features obey Gaussian-like distributions. The proposed algorithm is tested on real-time network traffic data from Ohio Universitys main Internet connection. Experimentation has shown that the presented FLDbased scheme is accurate in identifying anomalies in network feature space, in localizing anomalies in network traffic flow, and in helping network engineers to prevent potential hazards. Furthermore, its performance is highly effective in providing a colorized visualization chart to network analysts in the presence of bursty network traffic. 21 PLCDNS21 SVD-Based Universal Spatial Domain Image Steganalysis AbstractThis paper is concerned with the universal (blind) image steganalysis problem and introduces a novel method to detect especially spatial dom ain steganographic methods. The proposed steganalyzer models linear dependencies of image rows/columns in local neighborhoods using singular value decomposition transform and employs content independency provided by a Wiener filtering process. Experimental results show that the novel method has superior performance when compared with its counterparts in terms of spatial domain steganography. Experiments also demonstrate the reasonable ability of the method to detect discrete cosine transform-based steganography as well as the perturbation quantization method.
PARALLEL & DISTRIBUTED SYS.
S.No 1
Code PLCDPD01
Title EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks
Abstract Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area so as to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through


extensive simulation experiments. Finally, the integrated performance of the full potential-based energy-balanced routing algorithm is evaluated through numerous simulations in a random deployed network running event-driven applications, the impact of the parameters on the performance is examined and guidelines for parameter settings are summarized. Our experimental results show that there are significant improvements in energy balance, network lifetime, coverage ratio, and throughput as compared to the commonly used energy-efficient routing algorithm. 2 PLCDPD02 Link-Stability and Energy Aware Routing Protocol in Distributed Wireless Networks Energy awareness for computation and protocol management is becoming a crucial factor in the design of protocols and algorithms. On the other hand, in order to support node mobility, scalable routing strategies have been designed and these protocols try to consider the path duration in order to respect some QoS constraints and to reduce the route discovery procedures. Often energy saving and path duration and stability can be two contrasting efforts and trying to satisfy both of them can be very difficult. In this paper, a novel routing strategy is proposed. This proposed approach tries to account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of the proposed solution a biobjective optimization formulation has been designed and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed. This novel routing scheme has been compared with other three protocols: PERRA, GPSR, and E-GPSR. The protocol performance has been evaluated in terms of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average energy consumption. Current scientific applications have been producing large amounts of data. The processing, handling and analysis of such data require large-scale computing infrastructures such as clusters and grids. In this area, studies aim at improving the performance of data-intensive applications by optimizing data accesses. In order to achieve this goal, distributed storage systems have been considering techniques of data replication, migration, distribution, and access parallelism. However, the main drawback of those studies is that they do not take into account application behaviour to perform data access optimization. This limitation motivated this paper which applies strategies to support the online prediction of application behaviour in order to optimize data access operations on distributed systems, without requiring any information on past executions. In order to accomplish such a goal, this approach organizes application behaviours as time series and, then, analyses and classifies those series according to their properties. By knowing properties, the approach selects modelling techniques to represent series and perform predictions, which are, later on, used to optimize data access operations. This new approach was implemented and evaluated using the OptorSim simulator, sponsored by the LHCCERN project and widely employed by the scientific community. Experiments confirm this new approach reduces application execution time in about 50
PLCDPD03
An Online Data Access Prediction and Optimization Approach for Distributed Systems


percent, especially when handling large amounts of data. 4 PLCDPD04 The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However, in sensor networks that make use of the existing key pre distribution schemes for pairwise key establishment and authentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates a new security challenge: in the basic probabilistic and qcomposite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network by deploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier general framework that permits the use of any pairwise key pre distribution scheme as its basic component. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise key establishment between the sensors. To further reduce the damages caused by stationary access node replication attacks, we have strengthened the authentication mechanism between the sensor and the stationary access node in the proposed framework. Through detailed analysis, we show that our security framework has higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme. In-network data aggregation is a useful technique to reduce redundant data and to improve communication efficiency. Traditional data aggregation schemes for wireless sensor networks usually rely on a fixed routing structure to ensure data can be aggregated at certain sensor nodes. However, they cannot be applied in highly mobile vehicular environments. In this paper, we propose an adaptive forwarding delay control scheme, namely Catch-Up, which dynamically changes the forwarding speed of nearby reports so that they have a better chance to meet each other and be aggregated together. The Catch-Up scheme is designed based on a distributed learning algorithm. Each vehicle learns from local observations and chooses a delay based on learning results. The simulation results demonstrate that our scheme can efficiently reduce the number of redundant reports and achieve a good trade-off between delay and communication overhead. Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wide range of defence strategies. In this paper, we focus on developing mechanisms to localize a jammer by exploiting neighbour changes. We first conduct jamming effect analysis to examine how the communication range alters with the jammers location and transmission power using free-space model. Then, we show that a nodes affected communication range can be estimated purely by examining its neighbour changes caused by jamming attacks and thus, we can perform the jammer location estimation by solving a least-squares (LSQ) problem that exploits the
PLCDPD05
Adaptive Forwarding Delay Control for VANET Data Aggregation
PLCDPD06
Exploiting Jamming-Caused Neighbour Changes for Jammer Localization


changes of communication range. Compared with our previous iterative-search-based virtual force algorithm, our LSQ-based algorithm exhibits lower computational cost (i.e., one step instead of iterative searches) and higher localization accuracy. Furthermore, we analyse the localization challenges in real systems by building the log-normal shadowing model empirically and devising an adaptive LSQ-based algorithm to address those challenges. The extensive evaluation shows that the adaptive LSQ-based algorithm can effectively estimate the location of the jammer even in a highly complex propagation environment 7 PLCDPD07 Toward P2P-Based Multimedia Sharing in User Generated Contents Online forums have long since been the most popular platform for people to communicate and share ideas. Nowadays, with the boom of multimedia sharing, users tend to share more and more with their online peers within online communities such as forums. The server-client model of forums has been used since its creation in the mid-1990s. However, this model has begun to fall short in meeting the increasing need of bandwidth and storage resources as an increasing number of people share more and more multimedia content. In this work, we first investigate the unique properties of forums based on the data collected from the Disney discussion boards. According to these properties, we design a scheme to support P2P-based multimedia sharing in forums called Multimedia Board (MBoard). Extensive trace-driven simulation results utilizing real trace data show that MBoard can significantly reduce the load on the server while maintaining a high quality of service for the users. This paper presents an innovative router design, called Rotary Router, which successfully addresses CMP cost/ performance constraints. The router structure is based on two independent rings, which force packets to circulate either clockwise or counter clockwise, traveling through every port of the router. These two rings constitute a completely decentralized arbitration scheme that enables a simple, but efficient way to connect every input port to every output port. The proposed router is able to avoid network deadlock, livelock, and starvation without requiring data-path modifications. The organization of the router permits the inclusion of throughput enhancement techniques without significantly penalizing the implementation cost. In particular, the router performs adaptive routing, eliminates HOL blocking, and carries out implicit congestion control using simple arbitration and buffering strategies. Additionally, the proposal is capable of avoiding end-to-end deadlock at coherence protocol level with no physical or virtual resource replication, while guaranteeing inorder packet delivery. This facilitates router management and improves storage utilization. Using a comprehensive evaluation framework that includes full-system simulation and hardware description, the proposal is compared with two representative router counterparts. The results obtained demonstrate the Rotary Routers substantial performance and efficiency advantages.
PLCDPD08
Balancing Performance &Cost in Inter Conn N/w


9 PLCDPD09 Self-Protection in a Clustered Distributed System Self-protection refers to the ability for a system to detect illegal behaviours and to fight-back intrusions with countermeasures. This article presents the design, the implementation, and the evaluation of a self-protected system which targets clustered distributed applications. Our approach is based on the structural knowledge of the cluster and of the distributed applications. This knowledge allows detecting known and unknown attacks if an illegal communication channel is used. The current prototype is a self-protected JEE infrastructure (Java 2 Enterprise Edition) with firewall-based intrusion detection. Our prototype induces lowperformance penalty for applications. Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and have recently proposed unstructured P2P networks that organize participating peers by exploiting their similarity. The resultant networks may not perform searches efficiently and effectively because existing overlay topology construction algorithms often create unstructured P2P networks without performance guarantees. Thus, we propose a novel overlay formation algorithm for unstructured P2P networks. Based on the file sharing pattern exhibiting the power-law property, our proposal is unique in that it poses rigorous performance guarantees. Theoretical performance results conclude that in a constant probability, 1) searching an object in our proposed network efficiently takes Olnc N hops (where c is a small constant), and 2) the search progressively and effectively exploits the similarity of peers. In addition, the success ratio of discovering an object approximates 100 percent. We validate our theoretical analysis and compare our proposal to competing algorithms in simulations. Based on the simulation results, our proposal clearly outperforms the competing algorithms in terms of 1) the hop count of routing a query message, 2) the successful ratio of resolving a query, 3) the number of messages required for resolving a query, and 4) the message overhead for maintaining and formatting the overlay. In this paper, we show that the hexagonal mesh networks developed in the early 1990s are a special case of the EJ networks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh networks. We also extend the known efficient one-to-all broadcasting algorithm on hexagonal mesh networks to algorithms for one-toone personalized broadcasting, all-to-all broadcasting, and all-toall personalized broadcasting algorithms. Their time complexity and optimality are analyzed.
10
PLCDPD10
An optimizing overlay topologies for search in unstructured peer to peer networks
11
PLCDPD11
Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks


12 PLCDPD12 An Efficient Prediction-Based Routing in Disruption-Tolerant Networks Routing is one of the most challenging, open problems in disruption-tolerant networks (DTNs) because of the short-lived wireless connectivity environment. To deal with this issue, researchers have investigated routing based on the prediction of future contacts, taking advantage of nodes mobility history. However, most of the previous work focused on the prediction of whether two nodes would have a contact, without considering the time of the contact. This paper proposes predict and relay (PER), an efficient routing algorithm for DTNs, where nodes determine the probability distribution of future contact times and choose a proper next-hop in order to improve the end-to-end delivery probability. The algorithm is based on two observations: one is that nodes usually move around a set of well-visited landmark points instead of moving randomly; the other is that node mobility behaviour is semi-deterministic and could be predicted once there is sufficient mobility history information. Specifically, our approach employs a time-homogeneous semiMarkov process model that describes node mobility as transitions between landmarks. Then, we extend it to handle the scenario where we consider the transition time between two landmarks. A simulation study shows that this approach improves the delivery ratio and also reduces the delivery latency compared to traditional DTN routing schemes. In recent years ad hoc parallel data processing has emerged to be one of the killer applications for Infrastructure-as-a-Service (IaaS) clouds. Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio, making it easy for customers to access these services and to deploy their programs. However, the processing frameworks which are currently used have been designed for static, homogeneous cluster setups and disregard the particular nature of a cloud. Consequently, the allocated compute resources may be inadequate for big parts of the submitted job and unnecessarily increase processing time and cost. In this paper, we discuss the opportunities and challenges for efficient parallel data processing in clouds and present our research project Nephele. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by todays IaaS clouds for both, task scheduling and execution. Particular tasks of a processing job can be assigned to different types of virtual machines which are automatically instantiated and terminated during the job execution. Based on this new framework, we perform extended evaluations of MapReduce-inspired processing jobs on an IaaS cloud system and compare the results to the popular data processing framework Hadoop. The number and complexity of attacks on computer systems are increasing. This growth necessitates proper defense mechanisms. Intrusion detection systems play an important role in detecting and disrupting attacks before they can compromise software. Multivariant execution is an intrusion detection mechanism that executes several slightly different versions, called variants, of the same program in lockstep. The variants are built to have identical behavior under normal execution conditions. However, when the variants are under attack, there are detectable differences in their execution behavior. At runtime, a monitor compares the
13
PLCDPD13
Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud
14
PLCDPD14
Runtime Defense against Code Injection Attacks Using Replicated Execution


behavior of the variants at certain synchronization points and raises an alarm when a discrepancy is detected. We present a monitoring mechanism that does not need any kernel privileges to supervise the variants. Many sources of inconsistencies, including asynchronous signals and scheduling of multithreaded or multiprocess applications, can cause divergence in behavior of variants. These divergences cause false alarms. We provide solutions to remove these false alarms. Our experiments show that the multivariant execution technique is effective in detecting and preventing code injection attacks. The empirical results demonstrate that dual-variant execution has on average 17 percent performance overhead when deployed on multicore processors.
15
PLCDPD15
Autonomic Trust Management for a Component-Based Software System
Trust plays an important role in software systems, especially component-based systems in which components or their environments vary. This paper introduces an autonomic trust management solution for a component-based software system. We propose an adaptive trust control model to specify, evaluate, establish, and ensure the trust relationships among system entities. This model concerns the quality attributes of the entity and a number of trust control modes supported by the system. In particular, its parameters can be adaptively adjusted based on runtime trust assessment in order to reflect real system context and situation. Based on this model, we further develop a number of algorithms that can be adopted by a trust management framework for autonomic management of trust during component execution. We verify the algorithms feasibility through simulations and demonstrate the effectiveness and benefits of our solution. We also discuss the issues for successful deployment of our solution in a component software platform.
16
PLCDPD16
An Intelligent Task Allocation Scheme for Multihop Wireless Networks
AbstractEmerging applications in Multihop Wireless Networks (MHWNs) require considerable processing power which often may be beyond the capability of individual nodes. Parallel processing provides a promising solution, which partitions a program into multiple small tasks and executes each task concurrently on independent nodes. However, multihop wireless communication is inevitable in such networks and it could have an adverse effect on distributed processing. In this paper, an adaptive intelligent task mapping together with a scheduling scheme based on a genetic algorithm is proposed to provide realtime guarantees. This solution enables efficient parallel processing in a way that only possible node collaborations with cost-effective communications are considered. Furthermore, in order to alleviate the power scarcity of MHWN, a hybrid fitness function is derived and embedded in the algorithm to extend the overall network lifetime via workload balancing among the collaborative nodes, while still ensuring the arbitrary application deadlines. Simulation results show significant performance improvement in various testing environments over existing mechanisms.


AbstractEfficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P systems to effectively locate items with guaranteed recall. Second, existing schemes to improve search success rate often rely on replicating a large number of item replicas across the wide area network, incurring a large amount of communication and storage costs. In this paper, we propose BloomCast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. By leveraging a hybrid P2P protocol, BloomCast replicates the items uniformly at random across the P2P networks, achieving a guaranteed recall at a communication cost of O , where N is the size of the network. Furthermore, by casting Bloom Filters instead of the raw documents across the network, BloomCast significantly reduces the communication and storage costs for replication. We demonstrate the power of BloomCast design through both mathematical proof and comprehensive simulations based on the query logs from a major commercial search engine and NIST TREC WT10G data collection. Results show that BloomCast achieves an average query recall of 91 percent, which outperforms the existing WP algorithm by 18 percent, while BloomCast greatly reduces the search latency for query processing by 57 percent. Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Except for a few cases, it is not possible to find declustering schemes that are optimal for all spatial range queries. As a result of this, most of the researches on declustering have focused on finding schemes with low worst case additive error. Number-theoretic declustering techniques provide low additive error and high threshold. In this paper, we investigate equivalent disk allocations and focus on number-theoretic declustering. Most of the number-theoretic disk allocations are equivalent and provide the same additive error and threshold. Investigation of equivalent allocations simplifies schemes to find allocations with desirable properties. By keeping one of the equivalent disk allocations, we can reduce the complexity of searching for good disk allocations under various criteria such as additive error and threshold. Using proposed scheme, we were able to collect the most extensive experimental results on additive error and threshold in 2, 3, and 4 dimensions.
17
PLCDPD17
BloomCast: Efficient and Effective Full-Text Retrieval in Unstructured P2P Networks
18
PLCDPD18
Equivalent Disk Allocations


19 PLCDPD19 Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks AbstractThe wireless mesh network is an emerging technology that provides high quality service to end users as the last mile of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. This paper proposes two multicast algorithms: the Level Channel Assignment (LCA) algorithm and the Multichannel Multicast (MCM) to improve the throughput for multichannel and multiinterface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using Partially overlapping channels can further diminish the interference. Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.
GRID COMPUTING
S.No 1
Code PLCDGC01
Title Online System for Grid Resource Monitoring and Machine Learning-Based Prediction
Abstract Resource allocation and job scheduling are the core functions of grid computing. These functions are based on adequate information of available resources. Timely acquiring resource status information is of great importance in ensuring overall performance of grid computing. This 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 modelling 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.

IEEE DOTNET PROJECTS

2 PLCDGC02 Coordinated Energy Cost Management of Distributed Internet Data Centres in Smart Grid This paper addresses the problem of electricity cost management for Internet service providers with a collection of spatially distributed data centers. As the demand on Internet services drastically increases in recent years, the electricity consumed by Internet data centers (IDCs) has been skyrocketing. While most existing research focuses on reducing electric energy consumption of IDCs at one specific location, the problem of reducing the total electricity cost has been overlooked. This is an important problem faced by service providers, especially in the present multi-electricity-market environment, where the price of electricity may exhibit temporal and spatial diversities. Further, for these service providers, guaranteeing the quality of service (i.e., service level objectives) such as service delay guarantees to the end users is of critical importance. This paper studies the problem of minimizing the total electricity cost under multiple electricity markets environment while guaranteeing the quality of service geared to the location diversity and time diversity of electricity price. The problem is modeled as a constrained mixedinteger programming and an efficient solution algorithm is proposed. Extensive evaluations based on real-world electricity price data for multiple IDC locations illustrate the efficiency and efficacy of our approach.

IEEE PROJECTS
ANDROID

IEEE ANDROID PROJECTS
ANDROID IEEE
JAVA
S.No 1
Code PLCJAA01
Title Event Driven Summarization Web Video
Abstract With the explosive growth of web videos on the Internet, it becomes challenging to efficiently browse hundreds or even thousands of videos. When searching an event query, users are often bewildered by the vast quantity of web videos returned by search engines. Exploring such results will be time consuming and it will also degrade user experience. In this paper, we present an approach for event driven web video summarization by tag localization and key-shot mining. We first localize the tags that are associated with each video into its shots. Then, we estimate the relevance of the shots with respect to the event query by matching the shot-level tags with the query. After that, we identify a set of key-shots from the shots that have high relevance scores by exploring the repeated occurrence characteristic of key sub-events. We provide two types of summaries, i.e., threaded video skimming and visual-textual storyboard. Experiments are conducted on a corpus that contains 60 queries and more than 10,000 web videos. The evaluation demonstrates the effectiveness of the proposed approach. Personal health record (PHR) is an emerging patient-centric model of health information exchange, which is often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacy concerns as personal health information could be exposed to those third party servers and to unauthorized parties. To assure the patients control over access to their own PHRs, it is a promising method to encrypt the PHRs before outsourcing. Yet, issues such as risks of privacy exposure, scalability in key management, flexible access and efficient user revocation, have remained the most important challenges toward achieving fine-grained, cryptographically enforced data access control. In this paper, we propose a novel patient-centric framework and a suite of mechanisms for data access control to PHRs stored in semi-trusted servers. To achieve fine-grained and scalable data access control for PHRs, we leverage attribute based encryption (ABE) techniques to encrypt each patients PHR file. Different from previous works in secure data outsourcing, we focus on the multiple data owner scenario, and divide the users in the PHR system into multiple security domains that greatly reduces the key management complexity for owners and users. A high degree of patient privacy is guaranteed simultaneously by exploiting multi-authority ABE. Our scheme also enables dynamic modification of access policies or file attributes, supports efficient on-demand user/attribute revocation and break-glass access under emergency scenarios.
PLCJAA02
Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Encryption


Extensive analytical and experimental results are presented which show the security, scalability and efficiency of our proposed scheme. 3 PLCJAA03 Efficient Retrieval Extended Boolean Extended Boolean retrieval (EBR) models were proposed nearly three decades ago, but have had little practical impact, despite their significant advantages compared to either ranked keyword or pure Boolean retrieval. In particular, EBR models produce meaningful rankings; their query model allows the representation of complex concepts in an and-or format; and they are scrutable, inthat the score assigned to a document depends solely on the content of that document, unaffected by any collection statistics or other external factors. These characteristics make EBR models attractive in domains typified by medical and legal searching, where the emphasis is on iterative development of reproducible complex queries of dozens or even hundreds of terms. However, EBR is much more computationally expensive than the alternatives. We consider the implementation of the p-norm approach to EBR, and demonstrate that ideas used in the max-score and wand exact optimization techniques for ranked keyword retrieval can be adapted to allow selective bypass of documents via a low-cost screening process for this and similar retrieval models. Compromised machines are one of the key security threats on the Internet; they are often used to launch various security attacks such as spamming and spreading malware, DDoS, and identity theft. Given that spamming provides a key economic incentive for attackers to recruit the large number of compromised machines, we focus on the detection of the compromised machines in a network that are involved in the spamming activities, commonly known as spam zombies. We develop an effective spam zombie detection system named SPOT by monitoring outgoing messages of a network. SPOT is designed based on a powerful statistical tool called Sequential Probability Ratio Test, which has bounded false positive and false negative error rates. In addition, we also evaluate the performance of the developed SPOT system using a two-month e-mail trace collected in a large US campus network. Our evaluation studies show that SPOT is an effective and efficient system in automatically detecting compromised machines in a network. For example, among the 440 internal IP addresses observed in the e-mail trace, SPOT identifies 132 of them as being associated with compromised machines. Out of the 132 IP addresses identified by SPOT, 126 can be either independently confirmed (110) or highly likely (16) to be compromised. Moreover, only seven internal IP addresses associated with compromised machines in the trace are missed by SPOT. In addition, we also compare the performance of SPOT with two other spam zombie detection algorithms based on the number and percentage of spam messages originated or forwarded by internal machines, respectively, and show that SPOT outperforms these two detection algorithms.
PLCJAA04
Detecting Spam Zombies by Monitoring Outgoing Messages


5 PLCJAA05 Web-based services for real estate: model and implementation E-commerce's impact on real estate is just as significant and multifaceted as in other areas. Its momentum springs from two factors: an increasing population of online customers and increased involvement and investment from the real estate industry. The online real estate business' growing demand for application development has created a new market for application service providers (ASPs) who developed standardized Internet application systems and information services supporting a specific set of business processes. Ecommerce success stories have taught companies that every successful e-business must have a feasible business plan that complies with a model. CommRex (Commercial Real Estate Exchange, http://www.commrex.com), a Web-based real estate information system, and offers case studies in one such service. CommRex's performance in terms of four characteristics scalability, portability, operation ability, and availability - is satisfactory, owing to its multiorganization data allocation scheme. During this evolutionary process, the multilevel service model and multiorganization data management structure have been proven an effective choice for such an evolutionary process. Given a data point set D, a query point set Q, and an integer k, the Group Nearest Group (GNG) query finds a subset w (|w|<=k) of points from D such that the total distance from all points in Q to the nearest point in w is not greater than any other subset w' w(|w|<=k) of points in D. GNG query is a partition-based clustering problem which can be found in many real applications and is Nphard. In this paper, Exhaustive Hierarchical Combination (EHC) algorithm and Subset Hierarchial Refinement (SHR) algorithm are developed for GNG query processing. While EHC is capable to provide the optimal solution for k = 2, SHR is an efficient approximate approach that combines database techniques with local search heuristic. The processing focus of our approaches is on minimizing the access and evaluation of subsets of cardinality k in D since the number of such subsets is exponentially greater than |D|. To do that, the hierarchical blocks of data points at high level are used to find an intermediate solution and then refined by following the guided search direction at low level so as to prune irrelevant subsets. The comprehensive experiments on both real and synthetic data sets demonstrate the superiority of SHR in terms of efficiency and quality.
PLCJAA06


7 PLCJAA07 Optimization of Provisioning Cost Computing Resource in Cloud In cloud computing, cloud providers can offer cloud consumers two provisioning plans for computing resources, namely reservation and on-demand plans. In general, cost of utilizing computing resources provisioned by reservation plan is cheaper than that provisioned by on-demand plan, since cloud consumer has to pay to provider in advance. With the reservation plan, the consumer can reduce the total resource provisioning cost. However, the best advance reservation of resources is difficult to be achieved due to uncertainty of consumers future demand and providers resource prices. To address this problem, an optimal cloud resource provisioning (OCRP) algorithm is proposed by formulating a stochastic programming model. The OCRP algorithm can provision computing resources for being used in multiple provisioning stages as well as a long-term plan, e.g., four stages in a quarter plan and twelve stages in a yearly plan. The demand and price uncertainty is considered in OCRP. In this paper, different approaches to obtain the solution of the OCRP algorithm are considered including deterministic equivalent formulation, sample-average approximation, and Benders decomposition. Numerical studies are extensively performed in which the results clearly show that with the OCRP algorithm, cloud consumer can successfully minimize total cost of resource provisioning in cloud computing environments.

APPLICATION PROJECTS
DOTNET

APPLICATION DOTNET PROJECTS

APPLICATIONS DOTNET
S.No 1
Code PLCDA01 EPOST
Title
Abstract Target groups of customer of the Electronic Service System for Post Office are predominantly little and middle-class business (SMEs). The customers can have The Electronic Service System for Post Office is the shopping portal of the world-renowned postal service on the Internet and an additional distribution channel. It sells Stamps, Postcards, Packets, Cartons and has services like courier, registering for electricity vendors, selling mobile cards, etc. Under this website many products and services can be ordered, that are also available in a "normal" branch. The product prices are identical with the prices of their normal branches. As by making to a web-based process the firm will be getting the complete record from the bank and also the criteria for getting the help from the bank. The back order process for the requirements also will be handled by the banking sector and the information will be providing to the client. The default mailing procedure will be followed in which the mail will be applied within the intranet of the webapplication. The application also maintains the client details of the company and also the banking sector details up to date. The on-line processing of ordering the resource requirements to the bank and the file transfer within the web server will be followed based on the authentication provided to the user.
PLCDA02
I factor
The project deals with the I-Factor followed for an IT firm and also with the profit and process management followed for a firm. The Software companies will be in need of the hardware resources from the different client and the problem faced by the company is they will be unable to get the complete requirements of the hardware as due to finance to solve this, the company focus on the banking sector. The company directly will be having the direct investment on the banking sector and with the help of bank the company will be getting the hardware resources from the client. As by making to a web-based process the firm will be getting the complete record from the bank and also the criteria for getting the help from the bank. The back order process for the requirements also will be handled by the banking sector and the information will be providing to the client. The default mailing procedure will be followed in which the mail will be applied within the intranet of the web application. The application also maintains the client details of the company and also the banking sector details up to date.


3 PLCDA03 ISO auditing Audit is the examination of records and reports of a company, in order to check that what is provided is relevant, and closest to the reality. That is to say, all assets and liabilities are properly recorded in the balance sheet, and, all profits and losses are properly assessed. This assess ment is done through 2 methods, by assessing internal control procedures and by checking the consistency of items in the books. This system meets the minimum training required by Quality for internal auditors. It provides delegates who intend to perform internal audits with the knowledge and skills necessary to assess and report on the conformance and effective implementation of processes, through internal audits, and to contribute to the continual improvement of the management system. 4 PLCDA04 Nautical telematics system Nautical Telematics system is a web based system. This is a marine based Telematics system designed to give marine operators access for navigation, maintenance and emergency services via web-based application so that the ship and the response centers details can be maintained and updated frequently. It helps to track, manage, monitor and control all assets in sea. Through this system the marine company can communicate with the ship, and will be able to track status and the stability of the ship. There will be a database administrator in the company who will be monitoring the ship details through the system 24 hours. All the data about marine will be maintained in a centralized database and the administrator will be having the rights to do the data manipulation. 5 PLCDA05 Performance accessing system The main objective of the project is to maintain the software, which is developed and given to their respective clients. In any organization the software is developed and supplied according to the client requirements. The occurrence of errors or complaints or maintenance of the software is very much natural. So in order to monitor all these complaints from their clients this software is an automated system, which is very essential. The main scope of this project is to monitor the complaints more quickly and the company can keep a correct time to deliver after maintenance. This project involves a critical activity while developing an software application that is it involves the study of existing system and interacting with users which determines user requirements and the various expectation of an proposed system. Cost of incorporating changes required by the user is very less at this stage, which steeply increases a development of project.

PLCDA06
The small world of file sharing
File sharing softwares are emerging abundantly nowadays. This has made file sharing one of the top uses of any network. But the current software provides a poor security feature. This Project describes about the design, development and evaluation of a file sharing system that proposes a novel solution to the shared file security problem. The system will allow users to share files in a secure manner and comprises of client and server applications The client allows users to connect to a server and share their files amongst all other system users. The client also gives users the ability to search for files shared by the other system users, and when a file is found it could be transferred from the other user securely, as the file would be encrypted. The server allows valid users to connect, records their shared file list and enables connected users to search this list. The server authenticates connected users by performing a test that only a valid user can respond to in the correct manner The system to be developed uses certain techniques to implement a framework in which to model system security, including authentication of system users and the files that they share. A major objective of the system is to provide a model that can easily scaled with a number of clients. The tests performed show that the response time of the system remains fairly linear to the number of concurrent clients.
PLCDA07
Tracking and resolving of S/W issues
This project provides Bug Tracking, Help Desk Ticketing, issue raising, search facility, help information, and issue resolution. Issues related to software projects can be raised, tracked and resolved by Employees of different departments. Resolved issues can be allowed to access from Knowledge Base as Knowledge elements. The different groups and representatives can interact each other through emails. The issue tracking system does all the jobs that are done in conventional system but, here, everything is done in more formal and efficient manner. All the users of organization can interact with each other through the Issue Tracking System. This system acts as an interface between the employees thereby enabling them to forward their issues to the centralized Issue tracking system. Hence, making the work easy for both the issue raiser and the resolver. It totally avoids the involvement of middlemen in getting resolution for a particular issue.
PLCDA08
On line Income tax Service management System
The project has named online income tax management system for income tax is a tax paid to the central government on personal income. Income tax is a tax levied on the income of individuals or business (corporations or other legal entities). Various income tax systems exist, with varying degrees of tax incidence. Income taxation can be progressive, proportional, or regressive. Individual income taxes often tax the total income


of the individual (with some deductions permitted); various systems define income differently, and often allow notional reductions of income (such as a reduction based on number of children supported). 9 PLCDA09 Library management system This project is aimed at developing Library Information Management System (LiMS) for the college library. This is an Intranet based application that can be accessed throughout the campus. This system can be used to search for books/magazines, reserve books, find out who is having a particular book, put in requests to buy a new book etc. This is one integrated system that contains both the user component and the librarian component. There are features like email notifications/reminders, report generators etc in this system. Our project works on any platform, we are used windows XP and coded in JAVA language. We use jdk1.5 and SQL Server 2000 database to store and retrieve the data. Record matching, which identifies the records that represent the same real-world entity, is an important step for data integration. Most state-of-the-art record matching methods are supervised, which requires the user to provide training data. These methods are not applicable for the Web database scenario, where the records to match are query results dynamically generated onthe-fly. Such records are query-dependent and a prelearned method using training examples from previous query results may fail on the results of a new query. To address the problem of record matching in the Web database scenario, we present an unsupervised, online record matching method, UDE,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 no duplicate records from the same source can be used as training examples alleviating the burden of users h a v i n g t o manually label training examples. Starting from the no duplicate set, we use two cooperating classifiers, a weighted component similarity summing classifier and an SVM classifier, to iteratively identify duplicates in the query results from multiple Web databases. Experimental results show that UDE works well for the Web database scenario where existing supervised methods do not apply Online share trading system is developed for the share brokerage firm in the process of their activities to automate their operations. The system is dealing with the selling and buying the shares. Online brokers allow one to buy and sell shares via Internet. The Online share trading system includes several modules. They are described below as follows. Stock Exchange Module , Customer Information Module, Investment Information Module, Bank Transaction Module, Trade Management Module, Brokerage Module
10
PLCDA10
Record matching over query results from multiple database
11
PLCDA11
Online Share trading


This system helps the user to view detailed information about all the shares in their place and trade according to their convenience. The user can obtain the current values of all the available shares in the market and this in turn helps the user to sell their shares or to buy new shares in NSE (National Stock Exchange) and in BSE (Bombay Stock Exchange) or in MSE (Madras Stock Exchange) 12 PLCDA12 Social network system We plan to develop a live video chatting module based on the group. Basically our project works on LAN while the real social networking works on internet. But the basic idea behind it is the same as facebook that is to provide the user with an enjoyable and good-to-look means of communication. . Like in real, user will create his own account containing a unique username and password, which only can access by that user. If the user is a new one, then he has to fill application form containing his personal information. Then only the user can log on to the system. The user can write scrap to any member of that particular organization at any point of time. He is also eligible to upload the photo of his choice, which can be viewed by all the members of (our project). Also users are allowed to upload only one photo of his choice, which will be displayed on his homepage .The user, on finding his friend as member of (our project) can send a friends request to him. Now it depends on users friend whether to accept him as a friend or to reject him.this is totally in hands of the users friend!!! If the user is currently online, then he has to refresh the page constantly so as to view the new changes made to his account (not his personal info) for e.g.: if new scrap is written by his friend, then the user has to refresh his scrapbook page so as to view this new scrapthus chatting can be done on. We propose a live video chatting module in this project to make the customer experience visual communication to his friend. 13 PLCDA13 LAN:Search engine LAN Search Engine is use to create with assistance of many computer and network professionals who search files and folders on daily basis. Thus, the program comes with great number of very flexible search settings - masks, filters, search locations, file types, names and sizes. - All of these items can be customized for each individual search. LAN Search Engine is capable of searching through the file content as well. LAN Search Engine is an effective and flexible LAN file search utility that produces exact matches to your search criteria quickly and reliably, regardless of the network size. This multithreaded utility lets users set several masks at the same time and conduct multiple searches simultaneously. The other great features are hidden resources search, flexible domain search result export options. LAN Search Engine is a full-scale search engine for the Local Area Networks (LANs). This is not a simple utility, but rather a feature-stuffed application with muchneeded capabilities, such as automatic search items. The program is capable of performing multithreaded search and


generating comprehensive reports. 14 PLCDA14 Project Scheduler Project Scheduler is a simple, fast, accurate and easy to use with flexible options for viewing the essential details. The solution is best suited for individuals working on various projects, which helps to keep track of all the Projects and their Schedules. Project Scheduler also helps you to back & restore your work in a file so that you can always have a backup file to be restored to the application just in case you lose your data accidentally. You can add any number of schedules to be done for each existing projects using the Project scheduler. In This system each schedule can be tracked from the start till the end of the Project cycle. You can track the below details for each schedule Project for whom the schedule is to be done, Youre Rate/Hour for this particular work to be done. Start and End date of the project. Total working hours of a day (adjusted with the break time option). Current status and Percentage of work completed (Progress Bar). Payment amount pending from the project (Out of Scope) 15 PLCDA15 Role Based Access Control A businesss success depends on its ability to protect valuable business assets in an increasingly hostile environment. Protecting information requires a cost, not only in purchasing security components, but also in ensuring that those security components are properly managed. Role Based Access Control (RBAC) shows promise for making security administration easier, thus reducing the cost of managing security components. RBAC provides a convenient layer of abstraction by describing access control patterns. This paper presents an RBAC framework comprised of seven abstract layers. Multiple layers allow users to work with a layer they understand. Thus a balance can be struck between fine grained access control and ease of management. The goal is to provide easy security management for a wide variety of network applications. The most popular intranet application is obviously inter-office chat. This capability allows the employees of a company to communicate with each other swiftly and easily. If the intranet has access to the Internet, chat can be accessed through the Internet connection. If the intranet is running without the Internet, special chat software packages can be bought and installed so that employees can take advantage of its many benefits. Every type of company has to deal with forms of some sort. This is another area where paperwork can become a problem for a business. Intranet servers can be equipped with programs that allow for forms to be filled out online. They could also be downloaded and printed out by the users themselves, which would cut down on the time it would take to distribute these forms manually The Manpower Administration Resource Suite (MARS) is an application that provides easy-to-use Desktop based interface
16
PLCDA16
Intranet Chatting
17
PLCDA17
Employment tracking system


for manpower planning and scheduling for the various organizations. MARS architecture and design allows to be extended to other organization divisions that need manpower planning tools. MARS provides a complete history of data transactions. Enables administrative users to easily track the user responsible for each data entry, date and time the transaction occurred. Functionality includes pre-set reports to track system entries. Data maintained for each data input includes data, time, and user ID. Some of the main key features and capabilities of MARS include: 1. 2. 3. 4. 5. 6. Tracks employee information Allows inputting of changes to take place on a future date Month-at-a-glance viewing of employees schedule Unlimited number of user-customizable exception codes Checks for conflicts when entering new exception Creates mandatory overtime lists
Today Computers are used in reporting to make the computation easier, faster, and reliable accurate, moreover they are not being utilized for providing integrated information would surely help in accurate reporting of the demand data and maintenance. A smooth flow of information is a basic necessity for better Administration. 18 PLCDA18 Digital watermarking for tamper proofing and authentication in images In this application, we consider the problem of digital watermarking to ensure the credibility of multimedia. We specically address the problem of fragile digital watermarking for the tamper proong of still images. Applications of our problem include authentication for courtroom evidence, insurance claims, and journalistic photography. We present a novel fragile watermarking approach which embeds a watermark in the discrete wavelet domain of the image by quantizing the corresponding coefcients. Tamper detection is possible in localized spatial and frequency regions. Unlike previously proposed techniques, this novel approach provides information on specic frequencies of the image that have been modied. This allows the user to make applicationdependent decisions concerning whether an image, which is JPEG compressed for instance, still has credibility. Analysis is provided to evaluate the performance of the technique to varying system parameters. In addition, we compare the performance of the proposed method to existing fragile watermarking techniques to demonstrate the success and potential of the method for practical multimedia tamper proong and authentication.


19 PLCDA19 Performance Report System The project aims to develop the performance report of the student. The main objective of the Performance Report is to calculate the growth of the student in the respective subjects. Database technology has become an essential tool for managing the vast information, which emanates from different sources and subjects at different points. The information required to be processed relates to quick online retrieval for planning, monitoring, decision-making and follow up of important organizations activities. The main function of Performance Report is to know the exact status of the student whether the student has the growth in the educational studies. If the student does not shown a growth, the respective faculty need to check that students drawback in the studies and based upon that he needs to plan for the coaching classes. It also helps the management to allocate the subjects to the faculty based upon the performance. Design of the management information would follow the establishment of a database. Needless to say, to maintain the various types and volumes of data for each student collectively would be enormous, as each department would be generating data at their own locations, which may have to be preserved for present and future usage at a centrally located storage. Smart card validation is simulated by system itself. Not go for any external device. 20 PLCDA20 ERP for small business Enterprise Resource Planning is used to manage the resource to the fullest extent. Enterprise Resource Planning is an Inventory Control. Here we can maintain any number of Account books. There is option to open a new book or the existing book. While opening the existing book a complete list will be show of the available books on that the needed book can be selected. The book contains fixed datas, Entries, Reports and Help menu option. The Fixed data contains the company details, address, account numbers, number of branches, bank name and other related details of the company. Client details will contain all the information about the client, like client address, their currency, contact person and all the necessary fields Supplier details will contain all the information about the Supplier, like Supplier address, their currency, contact person and all the necessary fields Inventory details contain the information about all the products, their cost and all. The main purpose that banks have been serving since their inception is keeping our money safe for us. While keeping our money safe, they also let us earn a certain amount of interest on the money deposited with them. Traditional banks have been doing this, and internet banks continue the same function. The only difference is in the way the transactions are made. We all know about internet banking and most of us use it quite often as well, but few of us actually understand about the history of internet banking and how it all came out. Knowing the history of internet banking can be incredibly
21
PLCDA21
Secure Internet Banking


useful, especially since it will allow us to have more respect for the little things that we take for granted. Computers themselves have really come an enormous way since their initial establishment, as the earliest electronic computers were so large that they would take up the entire area of a room, while today some are so small that they can hardly be seen at all. In today's world, computers play an incredibly large role in the way the world exists in general, and the majority of tasks could actually not be completed if not for the use of computers. 22 PLCDA22 Forest management system The objective of the project is to develop a system that provides functionalities to maintain the details of forestry and related activities. The system allows one to perform all major operations and to manage data effectively. The Forest Management Information System (FMIS) is envisaged as an integrated system which will be used to support the planning, implementation and monitoring of multi-objective forest management activities. The FMIS can be used for strategic, statistical and operational planning and implementation, and operational control in and across administrative units and levels of the organizational hierarchy. Besides the databases and models required to support decision-making in the many programs of the Department, the FMIS also has the ability to maintain current forest inventories and generate maps of spatially-oriented data ( e.g. attributes of entities depicted on a map, such as population of a village, whose location can be fixed on a map). The components of the FMIS, which will necessarily be linked, are a Monitoring Information System (MIS), a Geographic Information System (GIS), and an Image Processing System. The sustainable funding review arose as a response by various parties to a perceived need for a better understanding of the funding requirements of the ambulance service. It was considered highly preferable that this understanding be shared by those on both sides of the negotiating table, both funders and providers, without the process of achieving this understanding being itself a negotiation. The main parties involved in initiating this review were the Ministry of Health, ACC and Ambulance New Zealand as signatories of a Memorandum of Understanding that establishes a forum for high level discussion of common ambulance issues. The spokesgroup for District Health Boards (DHBs), DHB NZ, was also invited to be involved. DHBs have an interest in these services both as funders of inter-hospital transfers and as the main delivery point for emergency transports.
23
PLCDA23
Ambulance service provider


24 PLCDA24 Cargo management Cargo Management system is a comprehensive cargo management module, designed for addressing the areas of General cargo, Bulk cargo operations. All the aspects of cargo like documentation handling, movement, and storage are addressed in this module. The Cargo Management System (CMS) is a web-based facility that has been developed For efficient processing of exporting and importing. The system has evolved from a ship loading management tool to a fully fledged Cargo Management System with the ability to manage multiple locations /cargo types (including bulk, break-bulk and containers) and transportation mediums. The intranet with messaging facilities, SHEQ, and Document/image modules compliment the systems features With the ever-increasing popularity and accessibility of the Internet, it is only natural that the educational community should want to make use of this tremendous resource. Use of the Internet and Web are leading to significant changes in Recruitment models. Effective exploitation of these changes requires adequate attention to understanding the skill set, the recruitment processes and issues, Dead line; etc.This application automates the human resource procurement procedure. It mainly aims at computerizing the recruitment process. This computerized application automates operations of job search and job posting online. The company can post a job, as well as the candidate can post his resume. This application makes the searching process more efficient. This application provides global service, so that anybody around the world can access the information. The candidate, anywhere in the world can get to know about the job openings This provides online information on job posting and job searching. This application helps the company helps to place qualified and eligible candidates. Any company can put their advertisement in this site, so that they improve their sales and viewers will get more information about the company. They will be charged to put their dvertisements. 1. 2. 3. 4. 5. Reduce the cost of searching jobs of the candidates. Helps the company to place eligible and qualified candidates. Reduce the time for searching jobs. It helps in reducing the time of the company in searching for an employer Candidates anywhere in the world can get to know the job openings
25
PLCDA25
On line job portal application


26 PLCDA26 Sophisticated sheltered structure Sophisticated sheltered structure deals with the Server based Information and Maintenance of the Server. This system is used to reduce the workload of the server. It provides mail services, chat services between the clients and it also response to the client requests. This system is designed as a middleman between the client and the server. This system provides all kinds of services to the clients like file transfer, mail, chat etc... This system is cost-effective and provides a security like firewall to the server. Though there are any software available in the market there is no popular server in terms of cost and providing services. Developed in asp platform will be an advantage to this software. The main objective of this software is to Speed up the data transfer Check for virus file Provide mail, chat services Strong authentication Sharing resources 27 PLCDA27 Medical Diagnostic System The Machine Learning field has gained its thrust in almost any domain of research and just recently has become a reliable tool in the medical domain. The experiential domain of automatic learning is used in tasks such as medical decision support, medical imaging, protein-protein interaction, extraction of medical knowledge, and for overall patient management care. ML is envisioned as a tool by which computer-based systems can be integrated in the healthcare field in order to get a better, well-organized medical care. It 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. Our evaluation results for these tasks show that the proposed methodology obtains reliable outcomes that could be integrated in an application to be used in the medical care domain. The potential value of this paper stands in the ML settings that we propose and in the fact that we outperform previous results on the same data set. The aim of this project is to develop an online crime report and managing system which is easily accessible to the public. The police department and the administrative department This system registers the complaints from people through online and it will also helpful to police department in catching criminals, in system and person can give any complaint at any tie The Corporate Strategies and Information Management System is developed for automating the complete operations of M/S SRM Systems and Software Private Limited. The Project is composed of Four Major Modules namely Training Management, Marketing Management, Administration and Financial Management. The Training Management module deals with Maintaining information about students, faculties, Batches, Courses, Training aids, Infrastructure, Computers,
28
PLCDA28
On line Crime Reporting
29
PLCDA29
Corporate strategic information and management system


Peripherals, Student & Faculties Skill Sets, Course Materials, Breaks, Transfers and Dropouts. The Training Management Module is also responsible for Maintaining information about Staffs like Personnel Management, Skill Sets, Timings, Weekly Shift Schedules, Salary Details, Incentives & Allowances, Appraisals, Leave and Transfers. 30 PLCDA30 Geo Spatial system Geospatial analysis is an approach to applying statistical analysis and other informational techniques to geographically based data. Such analysis employs spatial software and analytical methods with terrestrial or geographic datasets, including geographic information systems and geometrics. Local bodies are classified into Municipal Corporations, Municipalities of different grades depending upon the population and income of the Urban Local Body. These Urban Local Bodies have been constituted with the objective of discharging certain. In this project, we are going to develop project for Chennai Corporation where, whole process of Chennai municipalities are automated, and the datas related to every field is stored in the centralized database. In this proposed system, the details like bill collection, issues of particular area are stored in a centralized database and this database can be accessed by various authority of Chennai corporation. This will provide easy access to manipulate database in online by accessing centralized database. The authorized person in Chennai corporation can view the issues of particular area from online itself, will provide solution for that. The centralized database will be used in such situation to refer various details of every urban in chennai corporation.
31
PLCDA31
Tourism Management System
The website offers the information to the tourists regarding specific Country or city. The system provides information regarding about hotels, apartments and restaurants that for rental purpose. By this system the visitor or tourist can make a request to system on his wishing one. And the system also provides that how much charge for the serviced apartments or Hotels that may be as per day charges or Monthly charges The tourist can know the information regarding any serviced cottages or apartments through physically likes through brokers or any agency centers. The existing system only displays the information. To make any request to the system that is not possible in the existing system. Here The User went to some new places. He dont have an idea about the tourisms. At that time first we have to registered in the Registration. The Tourism Guide he Saw The All those tourism list details. In that admin we store the all those details of the tourist information. The tourism guide show the different environments places to tourists. In this application project, Online gas system services the user an book gas through online. The main purpose of this application is to reduce the time consuming and they can buy the product and pay the payment through credit and also can make liquid cash payment. The main details of the project are
32
PLCDA32
On line Gas Services


to buy gas, maintain Customer details, Purchase Bill, Account Transaction and Reports. In this fast moving world everything became online and all purchases are made online, so this project is an innovative idea to purchase the gas cylinder through internet. Here we have the site by which the gas is booked like any other online purchasing, the user who purchases the gas connection is provided an online account (username & password) the user can get into the site with the given username, password. The user can book the gas and they can view the booking details, they can make complaints in case if they have any problem with respect to the delivery or company. 33 PLCDA33 Farmers Buddy This is a web based project which is useful for farmers and agricultural students. This is an open discussion portal providing solutions to small farmers and agricultural students. It also provides soil analysis for all regions and suggestions on which fertilizers to use where and how much? And which crop, herb or vegetable to be grown where and in which season? It also helps to make decisions on market and best prices. Information about major crop markets and their current price for the crop will be published daily. NGOs are trying to spread messages to make agriculture more eco-friendly through this site. This also includes training scheduled by agricultural officers. Training is requested by students, general public. Training provides information about crops, fertilizers, and market details that are requested. Online query handlings for all users. Queries can be posted by students, general public through mails. Queries can be directed to a particular officer. Information pages should be dynamic so that agricultural officers and administrator can change it. Online testing System test our site based your requested query and provides the result retrieved information size in bytes , cpu memory and processor speed . The professional web-based testing service is an easy-to-use, customizable online test maker for business, training. Custom web-based testing services from ClassMarker allow you to easily create secure online exams to your exact requirements using multiple choices, short answer, essay and more question types.
34
PLCDA34
On line Testing Site
35
PLCDA35
Intranet Chatting
The project Intranet Chatting is designed using Microsoft Visual Studio.Net 2005 as front end which works in .Net framework version 2.0. The coding language used is C# .Net .Private network used within the company. An intranet serves the internal needs of the business entity. Intranet users are able to access the Internet, but firewalls keep outsiders from accessing confidential data. It makes use of the infrastructure and standards of the Internet and the Web. Intranets use lowcost Internet tools, are easy to install, and offer flexibility. If the intranet has access to the Internet, chat can be accessed through the Internet connection. If the intranet is running


without the Internet, special chat software packages can be bought and installed so that employees can take advantage of its many benefits. Every type of company has to deal with forms of some sort. This is another area where paperwork can become a problem for a business. Intranet servers can be equipped with programs that allow for forms to be filled out online. They could also be downloaded and printed out by the users themselves, which would cut down on the time it would take to distribute these forms manually. While somewhat complicated, intranets can be equipped with software to allow for live chat rooms or instant messages so that employees can communicate with each other online about work-related subjects 36 PLCDA36 Hospital Management System Hospital Management. The administrator can register new employees and give the required rights to them. Room allocation, medicine, prescriptions, payments, etc will be controlled through this. Credit Card Fraud Detection Desktop is a free standalone Windows application that allows instant detection of fraudulent online credit card order transactions using Windows GUI. It automates all processes of creating credit card informations and maintains it. The project is developed to evaluate the tender amount for e-substation construction projects. Thus the system automatically estimates the cost of executing each project. The date, project name and date of completion of the project is manually entered by the user and the user has to select the type of project they are to execute which directly relate to the materials used for the project. So, the user can cost the percentage of profit needs. From which the project costing is generated automatically. This amount includes only the material cost. To make it complete the system enables the user to feed the cost of labour and other cost to complete the project. The tender quotation can be generated with a common TID (Tender IDentification Number).In addition; the system keeps track of detail regarding the materials that are used for constructing electricity substations. The system the PO (purchase order). It also provides the functionality to add, delete and update the material details. The system generates a PO and release it PO. Each PO is assigned a unique PO Number automatically. Once the PO is raised, it can be released to the vendor. This system also provide the functionality of maintaining details such as bending payment details, stocks available at the warehouse, date of purchase of each material and the company details from where the materials were purchased. This materials detail plays a vital role in the tender cost evaluation process. To provide full user friendliness the system integrates the payment details
37
PLCDA37
Smart card Fraud detection using Unicode
PLCDA38 38
Tender System


39 PLCDA39 Medical diagnostic system The Medical diagnostic system field has gained its thrust in almost any domain of research and just recently has become a reliable tool in the medical domain. The experiential domain of automatic learning is used in tasks such as medical decision support, medical imaging, protein-protein interaction, extraction of medical knowledge, and for overall patient management care. ML is envisioned as a tool by which computer-based systems can be integrated in the healthcare field in order to get a better, well-organized medical care. It 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. Our evaluation results for these tasks show that the proposed methodology obtains reliable outcomes that could be integrated in an application to be used in the medical care domain. The potential value of this paper stands in the ML settings that we propose and in the fact that we outperform previous results on the same data set. Graphical passwords provide a promising alternative to traditional alphanumeric passwords. They are attractive since people usually remember pictures better than words. In this extended abstract, we propose a simple graphical password authentication system. A graphical password is an authentication system that works by having the user select from images, in a specific order, presented in a graphical user interface . For this reason, the graphical-password approach is sometimes called graphical user authentication (GUA). Graphical passwords may offer better security than text-based passwords because many people, in an attempt to memorize text-based passwords, The system combines graphical and text-based passwords trying to achieve the best of both worlds. It also provides multi-factor authentication in a friendly intuitive system. The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity that is conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called Truth Finder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that Truth Finder successfully finds true facts among conflicting
40
PLCDA40
Graphical Password Authentication System
41
PLCDA41
Truth Discovery with Multiple Conflicting Information Providers on the Web.


information, and identifies trustworthy web sites better than the popular search engines. 42 PLCDA42 Applicant Tracking System ATS provides a powerful tool to help human resource professionals master the facts. ATS can store the full text of resumes, internal hiring policies, and a wide variety of other information. ATS tracks each contact you have with the applicant along with your notes on the conversation. Once information is placed in ATS, you can locate the details you need quickly and easily through powerful search and reporting capabilities. ATS helps save you time and make the recruitment process more efficient. ATS is a tool to organize the information that crosses your desk. It doesn't matter whether you deal with sticky notes, memos, phone messages, faxes, resumes, depositions, newspaper articles, or e-mail. All contain information that you need to track. With ATS we provide a solution. Knowledge Management (KM) refers to a range of practices used by organizations to identify, create, represent, and distribute knowledge for reuse, awareness and learning across the organization. Knowledge Management programs are typically tied to organizational objectives and are intended to lead to the achievement of specific outcomes such as shared intelligence, improved performance, competitive advantage, or higher levels of innovation. Here we are looking at developing an online intranet knowledge management system that is of importance to either an organization or an educational institute. The system (KMS) is an Intranet based application that can be accessed throughout the institute or a specified group or department. This system can be used as a knowledge/information management system for the institute. Students/Staff logging in should be able to upload any kind of educational information. Students/staff logging in may also access/search any information put up by others. KMS should facilitate knowledge sharing from the grass root level like project teams to departments to the entire college.
43
PLCDA43
Knowledge Management System
44
PLCDA44
Call Center Executives system
Call center management is an increasingly important skill as the use of call centers becomes a popular method of centralizing information services, streamlining order taking and providing valuable customer support. The skills required to successfully set-up and manage a call center encompass everything from staff recruitment and personnel management, to technical understanding of the options available, and the all -important customer relationship management. From small customer service departments to large call centers, the importance of developing successful call center management is vital for building a valued relationship with customers to support longterm business growth.This system (Call Center Management) is useful to the organization, it maintains the information about the employees and it also contains the necessary information of the customer and their phone Numbers, their services also. It also


maintains the employee roaster details.This system will track the employees login details. And also maintains the data the employee attend the call and his behavior with customer and the speech will be recorded into file. Sometimes customer request for service to the organization. This data also maintains the system. 45 PLCDA45 Digital Library System Management The project Laboratory management is designed for the Online Lab. The objectives of this project are to do a web page, which is used for on line Laboratory management. The Laboratory management means the Lab. maintains every detail through this web page. The web page is mainly used for maintain all patient record of a Lab. The project registers the new patient for the tests. The user module gives security to misuse the data of the Lab. The project has an administrator who is retain the power to add user to access the data. The project store the patient detail and various type of test detail. According to the patient it stores the result of the test they have done. The project shows the report of the tests of patient in report module. Laboratory management, which keeps all the detail of a Lab, is helpful in quick service to customer. It also keeps records of the employee of the Lab. E-bank Information Maintenance and Recovery System is to be developed for improving the efficiency of the system thereby increasing the performance of the system. This Project deals with the development of an Archival and Retrieval System for eBankWorks. eBankWorks maintains logs of the customers in its local database for data repudiation. The system is to be integrated with eBankWorks and to archive four main types of logs, which are generated by the eBankWorks. Online banking or e-banking can be defined as online systems which allow customers to plug into a host of banking services from a personal computer by connecting with the banks computer over telephone wires. Technology continues to make online banking easier for average consumers. Banks use a variety of names for online banking services, such as PC banking, home banking, electronic banking or Internet banking. Regardless of the name, these systems offer certain advantages over traditional banking methods. 47 PLCDA47 Inventory assessment system A company may have many branches all over India and overseas. The company needs to know information about the company their staff, materials they buy and sell and the vendors who form those transactions. This cannot be achieved unless the company is provided with IT system or project which works on network environment to provide various analysis inventory reports for the management, otherwise it is going to be time consuming.Suppose consider that the staff need to know information about a particular warehouse and the materials present in it .It is unnecessary for a staff to go through the entire warehouse and find out the solution. Hence we provide a solution for this task with comprehensive query.
46
PLCDA46
e-banking


This project involves web enabling IT operations of the company. As it is centralized system employee can access information anywhere anytime provided they have access privilege. This is done by Query tuning for faster response time. This project involves the 3-tier architecture (Web Server, SQL Ser ver, Client). Only the needed information are being got through this process hence data access is very fast. The following modules are being created for solving these kinds of problems. This has been necessitated due to the fact that the company has offices all over India and overseas and the fact that there is an increasing demand for employees to have instant access to data. 48 PLCDA48 OrbiLending Orbi One Lending is a comprehensive loan life cycle management solution for Shensei Bank.Lending business is traditionally characterized by time consuming, paper and laborintensive processes. The recent boom in business due to interest rate decline has resulted in a surge in transaction volumes that has further aggravated processing delays. Lending solutions used today are motley of disparate solutions existing on different technology platforms. To add to the problems, the front-end systems do not communicate efficiently with back end technologies and third parties are often not integrated into the process electronically. Orbi One Lending is a comprehensive loan life cycle management solution that is business user friendly and provides flexibility of configuration to ensure faster launch of new lending products and speedier response to customer and competitive requirements.Besides addressing the standard loan life cycle management features, the solution offers lead and application management, configurable workflow, credit decisioning, credit line management and tracking, collateral management, repayment structures and automated delinquency management. It has multi lingual and multi currency capability and supports multiple channels. Seating Arrangement System is software developed for the students who give exams in colleges and institutes. It facilitates to access the examination information of a particular student in a particular class. The information is sorted by the operators, which will be provided by the teacher for a particular class. This system will also help in evaluating examination eligibility criteria of a student. The purpose of developing Seating management system is to computerized the traditional way of taking exams. Another purpose for developing this software is to generate the report automatically about the Seating arrangement during exams at the end of the session or in the between of the session. The scope of the project is the system on which the software is installed, i.e. the project is developed as a desktop application, and it will work for a particular institute. But later on the project can be modified to operate it online Sophisticated sheltered structure deals with the Server
49
PLCDA49
Seating Arrangement system
50
PLCDA50
sophisticated sheltered


structure based Information and Maintenance of the Server. This system is used to reduce the workload of the server. It provides mail services, chat services between the clients and it also response to the client requests. This system is designed as a middleman between the client and the server. This system provides all kinds of services to the clients like file transfer, mail, chat etc... This system is cost-effective and provides a security like firewall to the server. Though there are any software available in the market there is no popular server in terms of cost and providing services. Developed in asp platform will be an advantage to this software. The main objective of this software is to: 1. 2. 3. 4. 5. 51 PLCDA51 Fin Corp Cash Controller Speed up the data transfer Check for virus file Provide mail, chat services Strong authentication Sharing resources
This project is mainly developed for the Account Division of a Banking sector to provide better interface of the entire banking transactions. This system is aimed to give a better out look to the user interfaces and to implement all the banking transactions like: 1. 2. 3. 4. 5. 6. 7. 8. Supply of Account Information New Account Creations Deposits Withdraws Check book issues Stop payments Transfer of accounts Report Generations.
This service is open only to savings bank customers and not for current account holders. The customer is privileged to use most of the system only as a viewing phase, the only online transactions the customer can do are Check book requisition and fund transfer among his personal accounts. The project has been planned to be having the view of distributed architecture, with centralized storage of the database.


52 PLCDA52 CLIENT SERVER BASED LIVE MEETING This project is mainly developed for the communication of Employees of organization located at different locations. The project entitled Live Meeting set of platform for the project leaders and administrator to send messages to keep constant interaction with the programmers. In the proposed system is the administrator can sit at his system and communicate with the project leaders, programmers and can also maintain the login time, logout time. He can chat about the project going on with both the programmers and project leaders. This project also maintains offline messages. The administrator sees the IP address of the system of project leader/programmer he is interested and chat with the people .The project leader gives the instant report about the project to the administrator. Through this Communication System, Whenever user logs-in into the system then login time is recorded in the administrators system automatically. This project makes the most of the tedious and mundane deskwork to minimize. This facilitates the user to concentrate more on the project and less on the managing of these tasks. The software is fully integrated with CRM (Customer Relationship Management) as well as CMS (Content Management System) solution and developed in a manner that is easily manageable, time saving and relieving one from manual works. 53 PLCDA53 AdRealize Management Printmedia Advertising is a form of communication used to influence individuals to purchase products or services or support political candidates or ideas. Frequently it communicates a message that includes the name of the product or service and how that product or service could potentially benefit the consumer. Advertising often attempts to persuade potential customers to purchase or to consume a particular brand of product or service. Modern advertising developed with the rise of mass Production in the late 19th and early 20th centuries. Commercial advertisers often seek to generate increased consumption of their products or services through branding, which involves the repetition of an image or product name in an effort to associate related qualities with the brand in the minds of consumers. Edo period advertising flyer from1806 for a traditional medicine called Kinseitan. A company wanted to revive its brand image, so it hired an ad agency for it. The ad agency came up with brilliant ideas for marketing. They created ads of all types like audio, video, print media etc.The task of managing these ads was huge and they wanted a software developed to manage the process better. Mingle Box is a marketplace where people who need custom software developed can find coders in a safe and businessfriendly environment. Buyers can pick from a pool of registered coders...enabling them to hire a coder across the country or across the globe from the comfort of their computers.
54
PLCDA54
Mingle Box


Coders and buyers both can be benefited from this Bidding. Buyers who wish to hire internationally, can take advantage of favorable overseas exchange rates, resulting in work being done for 50-90% less than if the project were done in-country. Coders are also given access to a huge pool of potential work and have the ability to work independently from their homes rather than for a company 55 PLCDA55 Mital Management System Jewellery Management System is a system built to automate the functioning of an Jewellery shop Jewellery Management System This software supports following functionalities
Keeping track of the customer Bill generation and printing. Creating backup of the data Keeping track of the new items and managing fluctuating markets. Utilities

56 PLCDA56 Beneficiary System
Back Up Database Change Password Employee Details Customer Details Supplier Details Jewellery Type The EMI Distribution Software is used to calculate the annual and monthly payment of employees. For these calculations the following are the Mandatory fields. 1. Date of birth 2. Account Balance 3. Interest Rate. In the Date of Birth field the participant age should be in the range of 35-59 Years old and the Interest Rate should be a reasonable rate. This software also produces reports for: 1.Distribution Information, 2.Projected values 3.Beneficiary Information
57
PLCDA57
AN EFFICIENT SHARED DISK FILE SYSTEM FOR LARGE COMPUTNG CLUSTERS
In this paper, we consider users have similar interests if the intersection of their recent request sets is larger than some predefined threshold. The size of the intersection defines the edge weight. In this context, two users are linked in the interest-sharing graph if they display similar tagging activity over time. Web caches, content distribution networks, peer-topeer file-sharing networks, distributed file systems, and data


grids all have in common that they involve a community of users who use shared data. In each case, overall system performance can be improved significantly by first identifying and then exploiting the structure of communitys data access patterns. We propose a novel perspective for analyzing data access workloads that considers the implicit relationships that form among users based on the data they access. We show that this approach leads to improved information dissemination performance. 58 PLCDA58 Enterprise Resource Planning for Small Business ERP is a powerful human resource tool for maintaining employee and company information. More than a data storage program, ERP helps you manage your employees. ERP offers a wide variety of Reports that give you exactly the information you need. View payroll information by department, or find everyone who is receiving company Benefits. ERP gives you the power of information with different report categories. ERP allows you to add and remove employees from the program and provides access to all employee information categories from Address History to Work Information. Organization files keep track of your company information. From this screen you can create, modify, and Remove company data. You can adjust data for company benefits, departments, evaluation categories, and Positions. It is a good idea to define your departments and positions before adding employees. You must also set up your company benefits and evaluations before adding them to your employee files. When you create a new category such as an Additional department or position, it is immediately available for selection in every applicable employee screen. Checklists assist you in office management by creating a list of items that need to be completed for a particular event. For example, you may want to make a checklist of everything that needs to be done when someone is hired. eProperty is an Real Estate Management System is a user friendly contact and property manager for real estate professionals. Save time and sell more by empowering to easily keep track of leads, manage listings, and market to new prospects. Real Estate Management System eProperty is complete end to end solution to cover all aspects of Estate Agent day to day activity and Property buying selling procedure for small and large organization. The basic objective of developing this project is: Maintain client details line contact details, required property details, client type like residential and commercial client. Price limit.Preference. Maintain property details, registration of property for sale includes property address, property description, price, facilities available. Store property floor plan, property documents. Creation of thumbnail of property images for brochure.
59
PLCDA59
eProperty A Real Property Dealing Site
Estate

System has powerful logical access management in place, each user must be identified by login id and strict password policy is applied to secure the system Generate property thumbnail and details in html file to send client via email. Knowledge Management (KM) refers to a range of practices used by organizations to identify, create, represent, and distribute knowledge for reuse, awareness and learning across the organization. Knowledge Management programs are typically tied to organizational objectives and are intended to lead to the achievement of specific outcomes such as shared intelligence, improved performance, competitive advantage, or higher levels of innovation. Here we are looking at developing an online intranet knowledge management system that is of importance to either an organization or an educational institute. The system (KMS) is an Intranet based application that can be accessed throughout the institute or a specified group or department. This system can be used as a knowledge/information management system for the institute. Students/Staff logging in should be able to upload any kind of educational information. Students/staff logging in may also access/search any information put up by others. KMS should facilitate knowledge sharing from the grass root level like project teams to departments to the entire college. User Features
60
PLCDA60
Knowledge System
Management
A user should be able to register giving basic information. Login to the system and change the password (if required) after logging in. Post documents/information and edit/delete his contributions. Access/ Search documents/information posted by others (only read access). Rate the content posted by others. Search information by different parameters rating/key words/relevance/category Internetworking is the livewire of todays world, it has ushered in a whole new era of evolution, that has brought about a sea of change to this New World. With the advent of new concepts and technologies, the whole world has been linked into one single cobweb of information. Key to this evolution is the developments of Networking and Information Sharing. This is a project of ACTIVITY MANAGEMENT SYSTEM for a PRUDENTIAL bank. The client is the person who comes for the sake of getting premium from the agent of a prudential bank. (Here agent is the one who gets the premium from the client. The duty of the agent is not only to get the premium from the client but agent sees how the client can be convinced to pay the premium.) The system is to automate agents reports. This can be used for maintaining and evaluation of sales activities. It allows the life
61
PLCDA61
ActivityManagement system


advisor to set goals and accomplish them. It is very useful to motivate the advisor to do better, with reference of his previous progress. 62 PLCDA62 WebMine A project is nothing but a collection of tasks that are to be completed in a specified time limit.The consolidation of all the phases of the lifecycle of the system will result in what we refer in the IT jargon as a PRODUCT .A product is nothing but the very core of the project that contains all the very essentials of the system. This product will after customization, when and where required be converted into fully-fledged application software. This project work aims to provide an information retrieval framework that promotes graphical displays, which make documents in the computer visualizable in 1D(One dimension), 2D(Two dimension). It gives the information retrieval framework that promotes graphical displays, which make documents in the computer visualizable in 1D (One dimension), 2D (Two dimensions). Phase I of the project mainly deals with visualizing the contents of document space in 1D and 2D. Sets of legal documents are collected and the documents are compared with the stop words list file to eliminate the unnecessary terms. Then the keywords are extracted from the documents by comparing the documents file with predefined legal dictionary. The document vector is constructed by plotting the keywords against the documents. Visualizing the contents in 1D deal with the repeated searching in the document vector and considering any one attribute. Visualizing the contents in 2D deals with mapping from a high dimensional document space to a two dimensional space. Finally the maps are constructed for document retrieval systems that will provide the user with richer visual information. And the complete details of case and the clients are maintained. All these details are maintained in a database in order to retrieve when required. The information can be retrieved by using the options either case or client details. And all the necessary operations like add, delete and update can be done by using the options. So that we can maintain the complete database of the cases and clients. The main research issue underlying the construction of the visualization of the document space is information retrieval from the documents and then visualizing the contents .Two frameworks are available for information retrieval. One is the current retrieval system based on query and the other is the fuzzy logic
63
PLCDA63
Visalization Of Doc Space


64 PLCDA64 image Editor The project's goal is to design and implement an image editor with number of standard image processing functions (dithering, edge detection etc.). The main features of the application are: o o o o o o 65 PLCDA65 Cyber Job Mela Convenient user interface. Support of standard image files formats (BMP,JPG etc.) Saving in different formats. Zoom in/out, resizing, rotation and mirroring. Basic image processing algorithms. Adding graphics and/or text to an image. To provide a common platform for the job seekers and the job providers. To provide a search engine capable of helping both the candidate to find the job and the corporate companies in finding the right person.Cyber Job Mela maintains information about the different job providers as well as the job seekers.It notifies every job seeker with the availability of the job as per the category in which the job seeker has registered user's . The admin also notifies the job provider with the information about the persons registered under the category required by the job provider. It also maintains a specialized search engine which provides instant availability of the jobs as the user's category. The admin maintains information of the users who have registered with the site .After searching the required job on the site the seekers can directly apply to the job. Developed to provide solution to companies that is doing business of providing funds to their clients. We have provided five forms as Client form, Sub Broker form, Transaction form, MIS Entries form, Report form. The most interesting part of the software is that you can create report at any time and especially you can create report of the profit or growth of company between specific intervals. Event Management System is a management science for planning and executing various events. The event includes any concert, function, occasion, etc.it deals with sub-contracting various aspects of the event for e.g. Arrangement of Chairs etc. for commercial events advertisement is another important aspect. It includes all the kinds of media including print, television etc. The Event Management System also deals with Accounts planning for the events for maximum profits. E-commerce is one of the largest driving forces behind the Internet. Even in the Internets earliest days, many sites featured a shop where you could order products and have them shipped to your home. With the advent of server-side techniques, such as ASP and ASP.NET, it has been much easier and cheaper for smaller sites to offer their products and services online. Despite the large diversity in the goods these sites offer, they all have one thing in common. To allow customers to select the products they want to order, they all feature a product catalog and a shopping cart where products are stored during the shopping process. At checkout time,
66
PLCDA66
eFund Management
67
PLCDA67
Event Management System
68
PLCDA68
Online Mobile Shop


these products are taken from the cart and usually stored in a database so the order can be processed later. The Online Mobile Shop is no exception; this chapter shows you how to create a web shop with a shopping cart in ASP.NET 2.0. The chapter starts off with a quick tour of the Online Mobile Shop from an end-users point of view. It guides you through the process of browsing articles and adding them to a shopping cart, and shows you how the shopping cart is saved in the database as an order. Finally, this chapter also explains how you can manage the product catalog for the Online Mobile Shop. 69 PLCDA69 Resume Builder Application For automating the process of Resume Writing. This would be facilitating the employees to make and print their resumes in a proper format. In addition, it will be facilitating the higher management to search the employees depending upon their skills sets and other attributes. The Basic Requirement is to have a centralized repository of all the skill-holders in the organization so that an employee with a particular skill set Can be immediately found in case of urgent requirement. . Road Transport Authority (RTA) is an on line information source developed for Road Transport Authority to facilitate the users in applying for various licenses and registrations. This tool has been designed to facilitate the flow of information within the organization. RTA provides the facility the users to apply on line for driving license, registration of vehicles, collection of tax, RTO forms, and booking slot and where the administrator can view the applications of the booking slot for Learners Driving License, test drive and for vehicle registration and it also shows the details of the members who have applied for Learning License, Test Drive and for vehicle registration. 71 PLCDA71 Web based supply chain management system a ASP.Net Project This project Web based supply chain management system a ASP.Net Project is based on a web based supply chain managements. This is an integrated approach for stock Transfer across warehouses and the distributors are located all over the country. The order processing module aids in the generation of purchase orders and submit the order to the stock depot. The packing list module creates packing list by stock depots on the basis of orders by distributors. The invoicing module creates Invoices based on packing lists which is dispatched to distributors and prepared by stock depots. The reporting and analyzing module keeps the track of the entire process. 72 PLCDA72 VEHICLE MANAGEMENT SYSTEM VEHICLE MANAGEMENT SYSTEM, The ideal solution for Vehicle Management, is specially designed for Vehicle-Operators who operate a fleet of vehicles for hire. The vehicles maybe Cars, pickup vans, buses, etc. VMS enables you to manage demandsupply position of vehicles, keep a cab on the mileage and reduce maintenance expenditure and operating costs. It
70
PLCDA70
Road Transport Authority (RTA)


automates your entire front-office operations like accepting customer bookings, allocation of vehicles & drivers prepare customer invoices. The system also takes care of all back-office operations like capturing of maintenance costs incurred, fuel purchase, accident records, service log etc. Admin Module handles the entire Master forms such as vehicledetails, customerdetails, employee details and other scenarios. 73 74 PLCDA73 PLCDA74 Photo Album Management of Group of Hotels Creates a photo album in web An easy to operate user friendly, economically priced software that Committed to meet the all requirements to manage small, medium and big scale hotels. Hotel Management System is one of the leading software for complete management of your Hotel; it can manage the reception, restaurant, inventory and accounts excellently. The hotel management software provides all kinds of record keeping feature required in a hotel like day books, daily business book, Preparation of OFI and many more automatically. Graphical passwords provide a promising alternative to traditional alphanumeric passwords. They are attractive since people usually remember pictures better than words. In this extended abstract, we propose a simple graphical password authentication system. A graphical password is an authentication system that works by having the user select from images, in a specific order, presented in a graphical user interface (GUI). For this reason, the graphical-password approach is sometimes called graphical user authentication (GUA). Graphical passwords may offer better security than text-based passwords because many people, in an attempt to memorize text-based passwords, The system combines graphical and text-based passwords trying to achieve the best of both worlds. It also provides multi-factor authentication in a friendly intuitive system.
75
PLCDA75
A Graphical Password Authentication System

JAVA

APPLICATION JAVA PROJECTS

APPLICATIONS JAVA
S.No 1
Code PLCJA01
Title A Scalable Method of visual Cryptographic Key Management
Abstract A visual cryptography scheme (VCS) is a kind of secret sharing scheme allows the encoding of a secret image into shares distributed to participants. The beauty of such a scheme is that a set of qualified participants is able to recover the secret image without any cryptographic knowledge and computation devices. An extended visual cryptography scheme (EVCS) is a kind of VCS which consists of meaningful shares (compared to the random shares of traditional VCS). In this paper, we propose a construction of EVCS which is realized by embedding random shares into meaningful covering shares, and we call it the embedded EVCS. Experimental results compare some of the well-known EVCSs proposed in recent years systematically, and show that the proposed embedded EVCS has competitive visual quality compared with many of the well-known EVCSs in the literature. In addition, it has many specific advantages against these well-known EVCSs, respectively. In order to manage and thereby reduce your telecommunication expenditures, you need to establish a system for accountability. Accountability means that the users of service, departments and individual users are held accountable for the use of telecommunications is by using a cost allocation model. In this model individual departments must pay for their budget. Managers must also be given information that lets them make decisions on how these dollars being used. Call accounting reports can provide this information. Significant cost savings can be found by simply sending each departmental manager a copy of their call accounting reports on a monthly basis. Once managers see what they are spending, they can reduce these expenditures. Studies have shown that installing a call accounting system can yield a ten to thirty percent reduction in telecommunication costs. This small reduction can pay for a accounting in a relatively short period of time. AS THE SCALE of a decentralized distributed system increases, the presence of malicious behaviour (e.g., Byzantine failures) becomes the norm rather than the exception. Most designs against such malicious behaviour rely on the assumption that a certain fraction of the nodes in the system are honest. For example, virtually all protocols for tolerating Byzantine failures assume that at least 2/3 of the nodes are honest. This makes these protocols vulnerable to sybil attacks [1], in which a malicious user takes on multiple identities and pretends to be multiple, distinct nodes (called sybil nodes or sybil identities) in the system. With sybil nodes comprising a large fraction (e.g., more than 1/3) of the nodes in the system, the malicious user is able to out vote the honest users, effectively breaking previous defences against malicious behaviours. Thus, an
PLCJA02
Call accounting System
PLCJA03
Design a Guard System for Sybil Attack


effective defence against sybil attacks would remove a primary practical obstacle to collaborative tasks on peer-to-peer (p2p) and other decentralized systems 4 PLCJA04 Truth Discovery with Multiple Conflicting Information Providers on the Web. The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity that is conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called Truth Finder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that Truth Finder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines. Corporate Recruitment System CRS is web-based tool to reduce communication gap between Job providers and job seekers. Especially in fast growing IT market technologies are changing very fast, based on technology trend Organizations has to recruit the people. This process will make recruitment process very easy and fast. The main objective of this solution is to make easy the recruitment process of any organization. This system is designed by keeping in mind both parties like Job providers and Job Seekers. System allows job seekers to register their details like skills and experience with the system, and then on the other hand even it allows job providers to post their requirements with the system. Most of the schemes introduced by the Government go into dustbin just because the officials who implement the schemes could not make them available to suitable people. So there is a secured and transparent system needed which enable an ordinary person to directly apply for a scheme and track the status from time to time and know whether he is entitled to receive the fruit or his application is rejected by the officials. In any case, the applicant should be able to know the reason for rejection openly. This catches trust in the Government from the people and avoids mis-utilization of funds. This system design is modularized into various categories covering the internal official management concepts associated with the information of the panchayats and user applications with different levels of abstraction
PLCJA05
Corporate Recruitment System (CRS)
PLCJA06
Enterprise Scheme Planner and Monitoring System


7 PLCJA07 Management of Group of Hotels An easy to operate user friendly, economically priced software that Committed to meet the all requirements to manage small, medium and big scale hotels. Hotel Management System is one of the leading software for complete management of your Hotel; it can manage the reception, restaurant, inventory and accounts excellently. The hotel management software provides all kinds of record keeping feature required in a hotel like day books, daily business book, Preparation of OFI and many more automatically. The Easy-Leave is an Intranet based application that can be accessed throughout the organization or a specified group/Dept. This system can be used to automate the workflow of leave applications and their approvals. The periodic crediting of leave is also automated. There are features like email notifications, cancellation of leave, automatic approval of leave, report generators etc in this Tool. Graphical passwords provide a promising alternative to traditional alphanumeric passwords. They are attractive since people usually remember pictures better than words. In this extended abstract, we propose a simple graphical password authentication system. A graphical password is an authentication system that works by having the user select from images, in a specific order, presented in a graphical user interface (GUI). For this reason, the graphical-password approach is sometimes called graphical user authentication (GUA). Graphical passwords may offer better security than textbased passwords because many people, in an attempt to memorize text-based passwords, The system combines graphical and text-based passwords trying to achieve the best of both worlds. It also provides multi-factor authentication in a friendly intuitive system. The project titled as Online Crimefile Management is a web based application. This software provides facility for reporting online crimes, complaints, missing persons, show mostwanted person details mailing as well as chatting. Any Number of clients can connect to the server. Each user first makes their login to sever to show their availability. The server can be any Web Server. An SMTP Server must be maintained for temporary storage of emails and chat jar files for enable the chatting facilities.The main modules in this project The main aim of this project is to create a web application which maintains the Database and the information about various services which can be useful for various gated way communities. Mainly there will be 3 roles that will be interacting with the system such as user, client and Administrator. The main functionalities of user are registered with entire details, login into site, sending request for services and receiving response from client. The client will be registered in the specific community, receiving request from User and providing service to them. Administrator will be mediator between client and User, maintaining entire database.
PLCJA08
Online leave request system
PLCJA09
A Graphical Password Authentication System
10
PLCJA10
Online Crimefile Management
11
PLCJA11
Gateway community


Gated communities are residential areas, ranging in size from individual streets and neighbourhoods to entire cities, enclosed by walls and gates that are intended to prevent unauthorized entry by non-residents. In many gated communities further protection against the outside world is provided by private security guards and electronic security systems. This system mainly involves the maintaining the details about the users queries and their feedback in a community, if any visitor wants to visit our website then that information gathered during the feedback. In this project we have to maintain clients also for getting services from clients. Any client can registered in our site and provide their services according to request sand by a user. In this project every information will be maintained in the database. Scope:This system can be used by any gated way community which wants to maintain the database and utilize the various services provided by the application.
12
PLCJA12
VISUAL JAVA EDITOR
This application VISUAL JAVA EDITOR is developed using JAVA. It is basically an editor with some additional options. This editor is designed in such a way to fulfil the complete needs of the java Integrated Development Environment or java development using SUN JDK under windows98 and above, Compilation and execution can be done in command prompt only. This application helps to do compilation and execution in editor itself. So that user can identify the warning(s) and error(s) in the editor itself. This editor reduces the users time. It is easy to compile and run the programs. This editor is more flexible and user friendly. This application is developed in java language using the following concepts AWT, FRAME, SWING, and IO & NETWORKING. This is a project of ACTIVITY MANAGEMENT SYSTEM for a PRUDENTIAL bank. The client is the person who comes for the sake of getting premium from the agent of a prudential bank. (Here agent is the one who gets the premium from the client. The duty of the agent is not only to get the premium from the client but agent sees how the client can be convinced to pay the premium.) The system is to automate agents reports. This can be used for maintaining and evaluation of sales activities. It allows the life advisor to set goals and accomplish them. It is very useful to motivate the advisor to do better, with reference of his previous progress.
13
PLCJA13
Business Activity Management System


14 PLCJA14 Integrated Application for Employee Monitoring System Integrated application for employee in organization is a computerized solution for employee tasks which can be implemented in different organizations. The main functionality of this system is to integrate the task of pay slips, appraisals and meetings within the organization among the employees of different levels with maintaining the details of the project, clients and employees. Present system requires lot of man power and time consuming. It creates a problem where employees has to maintain a record to note all the details of the task like employee pay slips, employee appraisals, meetings etc and more over they have to maintain separate record for each individual task, Which consumes lot of time. Proposed System will integrate the task of pay slips, appraisals and meetings within the organization by maintaining particular software which allows the organization to maintain the track of employee activities. It maintains the database by storing the details of the project, clients and employees.The purpose of this project is to make the organization activities easy and faster by maintaining the database and providing privileges to the employees. 15 PLCJA15 Medicate search This project aims at providing medical assistance for common people who have minimal computer knowledge and need not have any medical knowledge. The main purpose of developing this system is to provide a place where several information related to medicines can be known by general public and it provides an environment where medicos from different experience levels can interact with each other. NoSQL Cloud data stores provide scalability and high availability properties for web applications, but at the same time they sacrifice data consistency. However, many applications cannot afford any data inconsistency. 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: Bigtable and SimpleDB. The objective of this project is to draw nodes in the specified network.we can add nodes,delete nodes,change the weight of the node ,remove the node By changing the weight of the node to zero. We can also find the best path for the designed network.The vision of the mobile ad-hoc networking is to support robust and efficient operation in mobile wireless networks by incorporating routing functionality into mobile nodes. With this increasing popularity and deployment, the demands on the wireless network are going to increase in future.
16
PLCJA16
Scalable Transactions for Web Applications in the Cloud
17
PLCJA17
Finding Shortest Path in Network Using bandwidth routing protocol for quality-of-service (QoS)


18 PLCJA18 Online Energy Billing Our project basically deals with developing an application EBS (Energy Billing System). The Energy Billing System is an Executive Information System that could be used for entering, calculating and monitoring the Billing details of the Electricity Consumers. It provides environment to maintain the consumer details starting from getting new connection, receiving bill, payments etc., and performance information to the management. An educational timetabling is a multi-dimensional and highly constrained problem. Generating educational timetables manually often involves numerous rounds of changes before they can be satisfactory. Usually such a process takes several days, and often the quality of the timetables is compromised due to pressure to release the timetables on time. Automatic generation of timetables then seems to be an attractive to manual approach. But this approach is not without problems. In fact, most timetabling problems are NP-complete and most researchers are interested in investigating efficient algorithms for solving the problem. In this paper, a university timetable problem formulation is introduced followed by recent approaches for solving the problem. After that, a genetic algorithm (GA) is presented to efficiently and effectively solve the problem. The proposed GA has a flexible representation that handles all the college timetables at once. It incorporates repair strategies to always guarantee the creation of a feasible timetable which satisfies constraints that must not be broken. The algorithm is implemented and applied to create timetables for the college of computing at the Arab Academy for Science and Technology (AAST) in Egypt and it shows promising results. Intranet mail system is developed using jsp/servlet , this projects main idea is to implement a mail software which can be used inside organization for fast communication. As technology is playing a important role in our daily life to reduce work and time therefore developing this application will be a alternative method for organizations which are using manual methods for communication between departments. A certain number of mobile agent-based monitoring mechanisms have actively been developed to monitor largescale and dynamic distributed networked systems adaptively and efficiently. Among them, some mechanisms attempt to adapt to dynamic changes in various aspects such as network traffic patterns, resource addition and deletion, network topology and so on. However, failures of some domain managers are very critical to providing correct, real-time and efficient monitoring functionality in a large-scale mobile agentbased distributed monitoring system. In this paper, we present a novel fault tolerance mechanism to have the following advantageous features appropriate for large-scale and dynamic hierarchical mobile agent-based monitoring organizations. It supports fast failure detection functionality with low failure-free
19
PLCJA19
Automatic College Time Table Generator
20
PLCJA20
Intranet dynamic operation system
21
PLCJA21
Fault-tolerant Mobile Agent based Monitoring Mechanism for Highly Dynamic Distributed Networks


overhead by each domain manager transmitting heart-beat messages to its immediate higher-level manager. Also, it minimizes the number of non-faulty monitoring managers affected by failures of domain managers. Moreover, it allows consistent failure detection actions to be performed continuously in case of agent creation, migration and termination, and is able to execute consistent takeover actions even in concurrent failures of domain managers. 22 PLCJA22 Developing intranet application for Multi-client chatting The project Developing intranet application for Multiclient Chatting is designed using Private network used within the company. An intranet serves the internal needs of the business entity. Intranet users are able to access the Internet, but firewalls keep outsiders from accessing confidential data. It makes use of the infrastructure and standards of the Internet and the Web. Intranets use low-cost Internet tools, are easy to install, and offer flexibility. The most popular intranet application is obviously inter-office chat. This capability allows the employees of a company to communicate with each other swiftly and easily. If the intranet has access to the Internet, chat can be accessed through the Internet connection. If the intranet is running without the Internet, special chat software packages can be bought and installed so that employees can take advantage of its many benefits. Every type of company has to deal with forms of some sort. This is another area where paperwork can become a problem for a business. Intranet servers can be equipped with programs that allow for forms to be filled out online. They could also be downloaded and printed out by the users themselves, which would cut down on the time it would take to distribute these forms manually. While somewhat complicated, intranets can be equipped with software to allow for live chat rooms or instant messages so that employees can communicate with each other online about work-related subjects. If a company is considering this form of communication, they should first form a policy about what can be discussed in an intranet chat. Chat room moderators and software to log the chats for future reference should also be considered. Despite these options, it is still difficult to see live online chats replacing traditional company meetings anytime soon. The intrusion response component of an overall intrusion detection system is responsible for issuing a suitable response to an anomalous request. We propose the notion of database response policies to support our intrusion response system tailored for a DBMS. Our interactive response policy language makes it very easy for the database administrators to specify appropriate response actions for different circumstances depending upon the nature of the anomalous request. The two main issues that we address in context of such response policies are that of policy matching, and policy administration. For the policy matching problem, we propose two algorithms that efficiently search the policy database for policies that match an anomalous request. We also extend the PostgreSQL DBMS with
23
PLCJA23
ONLINE INTRUSION AND DETECTION FOR RELATIONAL DATA BASE


our policy matching mechanism, and report experimental results. The experimental evaluation shows that our techniques are very efficient. The other issue that we address is that of administration of response policies to prevent malicious modifications to policy objects from legitimate users. We propose a novel Joint Threshold Administration Model (JTAM) that is based on the principle of separation of duty. The key idea in JTAM is that a policy object is jointly administered by at least k database administrator (DBAs), that is, any modification made to a policy object will be invalid unless it has been authorized by at least k DBAs. We present design details of JTAM which is based on a cryptographic threshold signature scheme, and show how JTAM prevents malicious modifications to policy objects from authorized users. We also implement JTAM in the PostgreSQL DBMS, and report experimental results on the efficiency of our techniques. 24 PLCJA24 Record Matching over Query Result from multiple Database Today, more and more databases that dynamically generate Web pages in response to user queries are available on the Web. These Web databases compose the deep or hidden Web, which is estimated to contain a much larger amount of high quality, usually structured information and to have a faster growth rate than the static Web. Most Web databases are only accessible via a query interface through which users can submit queries. Once a query is received, the Web server will retrieve the corresponding results from the back-end database and return them to the user. To build a system that helps users integrate and, more importantly, compare the query results returned from multiple Web databases, a crucial task is to match the different sources records that refer to the same real-world entity. We propose the problem of record matching in the Web database scenario, we present an unsupervised, online record matching method, UDD(Unsupervised Duplicate Detection), which, for a given query, can effectively identify duplicates from the query result records of multiple Web databases 25 PLCJA25 SMART SYSTEM FOR TENDER COST EVALUATION USED IN ESUBSTATION CONSTRUCTION PROJECTS The project is developed to evaluate the tender amount for e-substation construction projects. Thus the system automatically estimates the cost of executing each project. The date, project name and date of completion of the project is manually entered by the user and the user has to select the type of project they are to execute which directly relate to the materials used for the project. So, the user can cost the percentage of profit needs. From which the project costing is generated automatically. This amount includes only the material cost. To make it complete the system enables the user to feed the cost of labour and other cost to complete the project. The tender quotation can be generated with a common TID (Tender I Densification Number).


26 PLCJA26 Bug tracking system Bug Tracking System is the system which enables to detect the bugs. It not merely detects the bugs but provides the complete information regarding bugs detected. Bug Tracking System ensures the user of it who needs to know about a provide information regarding the identified bug. Using this no bug will be unfixed in the developed application. The developer develops the project as per customer requirements. In the testing phase the tester will identify the bugs. Whenever the tester encounters n number of bugs he adds the bug id and information in the database. The tester reports to both project manager and developer. The bug details in the database table are accessible to both project manager and developer. When a customer puts request or orders for a product to be developed. The project manager is responsible for adding users to Bus Tracking System and assigning projects to the users. Bug Tracking System plays an vital role in the testing phase. But it supports assigning projects for the developer, tester by the project manager. The Bug Tracking System maintains the different users separately i.e., it provides separate environments for project manager, developer and tester. The system provides different access rights and login for the users such as administrator, travel agency and registered members. The proposed system helps the Administrator to configure the basic settings details. The system also provides facility for the entering bus details such as bus type bus model and adding new bus. The administrator is also responsible for adding rout details such as route name, break point details. Route scheduling and bus scheduling is also done by administrator. Ticket cancellation rule and commission details for the travel agency are also set by administrator. Online Training and Placement project is aimed at developing an online application for the Training and Placement Dept. of the college. The system is an online application that can be accessed throughout the organization and outside as well with proper login provided. Online Training and Placement can be used as an application for the TAPO of the college to manage the student information with regards to placement. Students logging should be able to upload their information in the form of a CV. Visitors/Company representatives logging in may also access/search any information put up by Students
27
PLCJA27
Bus Scheduling And Booking System
28
PLCJA28
Placement Office Automation


29 PLCJA29 Hospital Management Our project Advanced Hospital Management System includes registration of patients, storing their details into the system and also computerized billing in the pharmacy, and labs. Our software has the facility to give a unique id for every patient and stores the details of every patient and the staff automatically. It includes a search facility to know the current status of each room. User can search availability of a doctor and the details of a patient using the id. The Advanced Hospital Management System can be entered using a username and password. It is accessible either by an administrator or receptionist. Only they can add data into the database. The data can be retrieved easily. The interface is very user-friendly. The data are well protected for personal use and makes the data processing very fast. The purpose of the College Library Record Application system is mainly to provide automation to the library. The categories of users provided are: Admin: He can read or write the information about any member and can update, delete or create a membership plan. Operator:He can open the account of membership to the new members. The Scope of the application is wide and can be used with Any education institute and also can be used in offices with the necessary modifications done. 31 PLCJA31 Human Resource Management System Human Resource Management System is aimed to integrate the activities of Human Resource Department. The Human Resource Management System maintains the following core activities and core processes, Personal Information Management Personal Training Management Recruitment Process Management Project Management The company can post a job, as well as the candidate can post his resume. This application makes the searching process more efficient. This application provides global service, so that anybody around the world can access the information. The candidate any where in the world can get to know about the job openings, this provides online information on job posting and job searching. This application helps the company helps to place qualified and eligible candidates. Any company can put their advertisement in this site, so that they improve their sales and viewers will get more information about the company. They will be charged to put their advertisements.
30
PLCJA30
College Library Application
Record


32 PLCJA32 Online Exam This Web Application provides facility to conduct online examination worldwide. It saves time as it allows number of students to give the exam at a time and displays the results as the test gets over, so no need to wait for the result. It is automatically generated by the server. Administrator has a privilege to create, modify and delete the test papers and its particular questions.User can register, login and give the test with his specific id, and can see the results as well.
33
PLCJA33
Port Scanner
The term "port scanning" refers to the technique or attempt to identify open ports and available services on a network host. It can be used by security professionals to audit network computers for likely vulnerabilities. It can also be used by attackers to check victim hosts for possible exploits. The intrusion response component of an overall intrusion detection system is responsible for issuing a suitable response to an anomalous request. We propose the notion of database response policies to support our intrusion response system tailored for a DBMS. Our interactive response policy language makes it very easy for the database administrators to specify appropriate response actions for different circumstances depending upon the nature of the anomalous request. The two main issues that we address in context of such response policies are that of policy matching, and policy administration. For the policy matching problem, we propose two algorithms that efficiently search the policy database for policies that match an anomalous request. We also extend the PostgreSQL DBMS with our policy matching mechanism, and report experimental results. The experimental evaluation shows that our techniques are very efficient. The other issue that we address is that of administration of response policies to prevent malicious modifications to policy objects from legitimate users. We propose a novel Joint Threshold Administration Model (JTAM) that is based on the principle of separation of duty. The key idea in JTAM is that a policy object is jointly administered by at least k database administrator (DBAs), that is, any modification made to a policy object will be invalid unless it has been authorized by at least k DBAs. We present design details of JTAM which is based on a cryptographic threshold signature scheme, and show how JTAM prevents malicious modifications to policy objects from authorized users. We also implement JTAM in the PostgreSQL DBMS, and report experimental results on the efficiency of our techniques.
34
PLCJA34
DESIGN AND IMPLEMENTATION OF INTRUSION RESPONSE SYSTEM FOR RELATIONAL DATABASES

PHP

APPLICATION PHP PROJECTS

APPLICATIONS PHP
S.No 1
Code PLCPA01
Title Corporate Strategies and Information Management System
Abstract The Corporate Strategies and Information Management System are developed for automating the complete operations of M/S SRM Systems and Software Private Limited. The Project is composed of Four Major Modules namely Training Management, Marketing Management, Administration and Financial Management. The Training Management module deals with Maintaining information about students, faculties, Batches, Courses, Training aids, Infrastructure, Computers, Peripherals, Student & Faculties Skill Sets, Course Materials, Breaks, Transfers and Dropouts. The Training Management Module is also responsible for maintaining information about Staffs like Personnel Management, Skill Sets, Timings, Weekly Shift Schedules, Salary Details, Incentives & Allowances, Appraisals, Leave and Transfers. The System also contains a Library Management Module, which consists of maintaining Library books, which are broadly, classified into two categories namely Reference and Loan able books. Students and Staff members can borrow books from the Library and Keep it for 3 days. Every fourth day they should renew the book failing which a fine amount is calculated and levied. Students and Staff members can also reserve books, extend their reservations and cancel their reservations. The Administration Module deals with Maintenance of Faculty Load Charts, Student Attendance, Weekly Shift Schedule for Staffs, Course Allocations, Classroom Allocations, Login Id creation for students, Issuing ID Cards for the students, Maintaining reservations & Cancellations for the Night Lab, etc. Various Reports viz. Weekly Marketing Report, Weekly Financial Report, Daily Financial Report, Inventory Movement Report, Peripherals Utilization Report, Enquiries by Area Report, Faculty Load Chart, Faculties Performance Report, Student Performance Report, Monthly Attendance Report, Lab Machine Allocation Report and Defaulters Report are generated. The Financial Management deals with maintaining data about collection, billing, miscellaneous expenses, conveyance, invoices, Cash/Cheque transactions, Fine Amount Collection and Internal Rate of Return.


2 PLCPA02 Exploration 2 Overhaul The project named Exploration 2 Overhaul is developed to fill the real time gap between one who need a project and one who can deliver a project. Here one can add his project details in the portal; hence he can get a wide area of the viewers who are visiting the site. On the other hand a project seeker can search the site for his kind of project and he can select a project for a better price. Stream Line Data Routers is used to track the progress of each activity in the software development life cycle, from the inspection of a project until it is discarded. It consists of modules like Data Conversion Operators (DC), Data Management, Administrator, Quality control (QC), and Reports etc. The objective is to create a system, which will help the management in the SDLC process starting from Login to Reports. This system will be Client/Server based, so that the project details can be available to the clients and top management easily all the time. With this system, the management can track the Data details like Uploading Downloading, Working days, etc. effectively and can use these Report for future. 4 PLCPA04 Tracking and Resolving Issues of Softwares This project provides Bug Tracking, Help Desk Ticketing, issue raising, search facility, help information, and issue resolution. Issues related to software projects can be raised, tracked and resolved by Employees of different departments. Resolved issues can be allowed to access from Knowledge Base as Knowledge elements. The different groups and representatives can interact each other through emails. The issue tracking system does all the jobs that are done in conventional system but, here, everything is done in more formal and efficient manner. All the users of organization can interact with each other through the Issue Tracking System. This system acts as an interface between the employees thereby enabling them to forward their issues to the centralized Issue tracking system. Hence, making the work easy for both the issue raiser and the resolver. It totally avoids the involvement of middlemen in getting resolution for a particular issue. The Issue Tracking system is an intranet application, which provides information about issues in software projects, in detail. This product develops a system that can be used by all the departments of a software organization. In the conventional method, all the issues are dealt manually .The progress of the issues are also checked in person, which is a tedious task. Here, in Issue Tracking, it fulfils different requirements of administrator and employees of a software development organization efficiently. The specific purpose of the system is to gather and resolve issues that arise in different projects handled by the organization.
PLCPA03
Stream Line Data Routers


5 PLCPA05 ATM SIMULATOR In this Project ATM Simulator allows banks to view ATM downloads directly from their desktop PC, exactly as they would appear on a real ATM. ATM Simulator connects as a virtual ATM into your existing host system, and behaves in exactly the same way as a real ATM. Through the unique use of ATM hardware "personalities", any type of ATM can be simulated in this way, avoiding the need for costly ATM hardware simply to test transactions. ATM Simulator allows banks to automate the regression testing of their ATM transactions. ATM Simulator allows banks to automate the testing of their ATM transactions. No longer must bank staff spend time manually testing transactions on real ATMs, and simulating hardware faults by jamming the ATM devices. Test scripts can be replayed at any time without the intervention of an operator, and the results tabulated in a graphical easy-to-read format. ATM Simulator provides a complete WYSIWYG emulation of any type of ATM. By using your mouse and keyboard, you can interact with the ATM exactly like a customer. All actions are graphically represented exactly as they are on the ATM. Actions like card entry and cash dispensing are animated to provide a realistic user interface. The objective of this project is to design and develop an ATM SIMULATOR for that can be used for testing ATM transactions and the switch software and thus to increase the productivity. 6 PLCPA06 College Alumni System An alumni Association is the association of graduates or more broadly, of former students. Alumni if colleges schools universities fraternities and sororities often from groups with alumni from same organization. This association often organizes social events; publish newsletter or magazines raise funds for the organization. Many provide a variety of benefits and services that help alumni maintain connections to their educational institution and fellow graduates. Additionally, such groups often support new alumni, and provide a forum to form new friendship and business relationship with people of similar background. Alumni associations are mainly organized around universities or departments of universities, but many also be organized among students that studied in a certain country. In the past, they were often considered to be the university's or schools old boy network.

ANDROID

APPLICATION ANDROID PROJECTS

APPLICATIONS ANDROID
S.No 1
Code PLCJAAA01
Title Account Tracker
Abstract This Android application allows user to keep track of current balance in different bank accounts held by the user and the transactions of those accounts The following are the major operations in this application. List of bank accounts Adding new bank account Updating an existing bank account Deleting a bank account List of transactions related to a bank accounts List of recent 10 transactions from all accounts Search Transactions by date and amount Showing all details of a single transaction Deleting a transaction Given a data point set D, a query point set Q, and an integer k, the Group Nearest Group (GNG) query finds a subset w(|w|<=k) of points from D such that the total distance from all points in Q to the nearest point in w is not greater than any other subset w' w(|w|<=k) of points in D. GNG query is a partition-based clustering problem which can be found in many real applications and is Nphard. In this paper, Exhaustive Hierarchical Combination (EHC) algorithm and Subset Hierarchial Refinement (SHR) algorithm are developed for GNG query processing. While EHC is capable to provide the optimal solution for k = 2, SHR is an efficient approximate approach that combines database techniques with local search heuristic. The processing focus of our approaches is on minimizing the access and evaluation of subsets of cardinality k in D since the number of such subsets is exponentially greater than |D|. To do that, the hierarchical blocks of data points at high level are used to find an intermediate solution and then refined by following the guided search direction at low level so as to prune irrelevant subsets. The comprehensive experiments on both real and synthetic data sets demonstrate the superiority of SHR in terms of efficiency and quality. This thesis will discuss the development of an Android Sudoku application, for use on Smartphones or Tablet Computers. The application was designed for an average user who wishes to play games. The thesis will describe the basics of the Sudoku game and its history. It will go on to describe technologies, development tools and basics of the Android operating system. The development of the application began with the creation of an appropriate graphical user interface using mostly XML and some Java. The game's logic is implemented in Java programming language. It was important to ensure that the Sudoku application would be superior to others available on the market. Therefore, it was developed to include accessories to help users solve the puzzle. To achieve this, the game includes a column, row and mini-grid elimination algorithm.
PLCJAAA02
PLCJAAA03
Sudoku game application for Android

APPLICATION ANDROID PROJECTS

4 PLCJAAA04 Advancement in Mobile Communication using Android This paper deals about the introduction of android in mobile devices. The recent trends in android give the future develop ment in software development kit (SDK) which is ubiquitous in all mobile phones. With this use of android in our mobile phone the compatibility accessibility and the interface of the mobile phone version ones has been considerably increased. The latest of android allows the speech recognition facility in the mobile devices. With this further development of android allows us to install video or picture recognition with moving sensors in our mobile phones. To determine whether a Minesweeper conguration is consistent was proved NP-complete by Kaye. Here the complexity of Minesweeper is investigated and three game playing strategies are developed. The two decision problems:Does a conguration have a unique solution?" and Is a given move safe? are proved complete in DP, and the problem of counting the number of solutions to a conguration complete in P. Three Minesweeper strategies are presented, the best of which uses probability estimates to assist in guessing when required. This strategy is capable of winning 25% of games at expert level. The strategies are implemented in a framework developed specially for automated Minesweeper playing. Keywords: Minesweeper, complexity, DP-completeness, #P-completeness, game strategy development, probability estimation. E-commerce's impact on real estate is just as significant and multifaceted as in other areas. Its momentum springs from two factors: an increasing population of online customers and increased involvement and investment from the real estate industry. The online real estate business' growing demand for application development has created a new market for application service providers (ASPs) who developed standardized Internet application systems and information services supporting a specific set of business processes. Ecommerce success stories have taught companies that every successful e-business must have a feasible business plan that complies with a model. CommRex (Commercial Real Estate Exchange, www.commrex.com), a Web-based real estate information system, and offers cases study in one such service. CommRex's performance in terms of four characteristics scalability, portability, operation ability, and availability is satisfactory, owing to its multiorganization data allocation scheme. During this evolutionary process, the multilevel service model and multiorganization data management structure have been proven an effective choice for such an evolutionary process. Simple yet fully functional employee directory app. The primary goal is to demonstrate how to build Flex apps for Android. The app can be used as is. The code is provided so you can also modify it to fit your needs. Comes with a demo database. You can also import your own data.
PLCJAAA05
Minesweeper game application for Android
PLCJAAA06
Web-based services for real estate: model and implementation
PLCJAAA07
Employee Directory


Electronics Project

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Electronics Project

Uploaded by

Copyright:

Available Formats

IEEE PROJECTS

DOTNET & JAVA

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Technology : Dotnet / Java

Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage

Dynamic Audit Services for Outsourced Storages in Clouds

Ensuring Distributed Accountability for Data Sharing in the Cloud

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

SMTP Based Resource Allocation on multi cloud inter domain network

Optimization of Resource Provisioning Cost in Cloud Computing

Access Control Mechanisms for Outsourced Data in Cloud

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Data integrity proofs in cloud storage

A Secured Cost-effective MultiCloud Storage in Cloud Computing

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Cloud Computing Security: From Single to Multi-Clouds

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Cloud Streaming Brings Video to Mobile Devices

Cloud Data Protection for the Masses

A Price- and-Time-SlotNegotiation Mechanism for Cloud Service Reservations

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Fog Computing: Mitigating Insider Data Theft Attacks in the Cloud

Reliable Re-encryption in Unreliable Clouds

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

A Distributed Access Control Architecture for Cloud Computing

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Towards Secure and Dependable Storage Services in Cloud Computing

Cloud TPS: Scalable Transactions for Web Applications in the Cloud

Going Back and Forth: Efficient Multideployment and ultisnapshotting on Clouds

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

KNOWLEDGE & DATA ENGG

Technology: Dotnet / Java

A Temporal Pattern Search Algorithm for Personal History Event Visualization

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Slicing: A New Approach for Privacy Preserving Data Publishing

Efficient Extended Boolean Retrieval

Outsourced Similarity Search on Metric Data Assets

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Energy Efficient Data Access in Mobile P2P Networks

A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

On Group Nearest Group Query Processing

Holistic Top-k Simple Shortest Path Join in Graphs

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Dynamic Authentication for Cross-Realm SOA-Based Business Processes

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

A Probabilistic Scheme for Keyword-Based Incremental Query Construction

K.K.Nagar: 9677012733 | T.Nagar: 9884606888 | Anna Nagar: 9094778817

IEEE DOTNET / JAVA PROJECTS

Iterative Trust and Reputation Management Using Belief Propagation