In this paper, we propose CDL, a Combined and Differentiated Localization approach for localization that exploits the strength of range-free approaches and range-based approaches using received signal strength indicator (RSSI). A critical observation is that ranging quality greatly impacts the overall localization accuracy. To achieve a better ranging quality, our method CDL incorporates virtual-hop localization, […]
ONLINE SOCIAL NETWORK USER CONTROL OVER THE UNWANTED MESSAGE
In this paper, we have presented a system to filter undesired messages from OSN walls .One fundamental issue in today’s Online Social Networks (OSNs) is to give users the ability to control the messages posted on their own private space to avoid that unwanted content is displayed. Up to now, OSNs provide little support to […]
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related […]
Secure Multi-Party algorithm for Mining of Association Rule in Databases
We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton . The main ingredients in our protocol are two novel secure multi-party algorithms — one that computes the union of private subsets that each of the interacting players hold, and another […]
Sequential Clustering Anonymization of Centralized and Distributed Social Networks
We presented sequential clustering algorithms for anonymizing social networks. Those algorithms produce anonymizations by means of clustering with better utility than those achieved by existing algorithms. The goal is to arrive at an anonymized view of the unified network without revealing to any of the data holders information about links between nodes that are controlled […]
Optimal Multiserver Configuration for Profit Maximization in Cloud Computing
As cloud computing becomes more and more popular, understanding the economics of cloud computing becomes critically important. To maximize the profit, a service provider should understand both service charges and business costs, and how they are determined by the characteristics of the applications and the configuration of a multiserver system. The problem of optimal multiserver […]
Discovery and Resolution of Anomalies in Web Access Control Policies
Emerging computing technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effectively. However, we still suffer from unintended security leakages by unauthorized actions in business services while providing more convenient services to Internet users through such a cutting-edge technological growth. Furthermore, designing and managing […]
ALERT: An Anonymous Location-Based Efficient Routing Protocol in MANETs
Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high […]
A generic framework for constructing encounter-based social Networks
In this paper, we explore the functional and security requirements for these new systems, such as availability, security, and privacy, and present several design options for building secure encounter-based social networks. To highlight these challenges we examine one recently proposed encounter-based social network design and compare it to a set of idealized security and functionality […]
Memory access virtualization to deal with stack buffer overflow attacks
In this paper we presented Memory access virtualization is a key mechanism we used to deal with stack buffer overflow attacks. The key technique of our solution is to virtualize memory accesses and move the vulnerable buffer into protected memory regions, which provides a fundamental and effective protection against recurrence of the same attack without […]
- « Previous Page
- 1
- …
- 9
- 10
- 11
- 12
- 13
- …
- 15
- Next Page »