Twitter has received much attention recently. In this paper, we investigated the real-time nature of Twitter, devoting particular attention to event detection. An important characteristic of Twitter is its real-time nature. We investigate the real-time interaction of events such as earthquakes in Twitter and propose an algorithm to monitor tweets and to detect a target […]
A Rank Correlation Based Detection against Distributed Reflection DoS Attacks
DDoS presents a serious threat to the Internet since its inception, where lots of controlled hosts flood the victim site with massive packets. Moreover, in Distributed Reflection DoS (DRDoS), attackers fool innocent servers (reflectors) into flushing packets to the victim. But most of current DRDoS detection mechanisms are associated with specific protocols and cannot be […]
Optimal Client-Server Assignment for Internet Distributed Systems
We investigate an underlying mathematical model and algorithms for optimizing the performance of a class of distributed systems over the Internet. Such a system consists of a large number of clients who communicate with each other indirectly via a number of intermediate servers. Optimizing the overall performance of such a system then can be formulated […]
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 […]
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 […]
Differentially-private data release for vertically partitioned Data between two parties
In this paper, we address the problem of private data publishing, where different attributes for the same set of individuals are held by two parties. In particular, we present an algorithm for differentially private data release for vertically-partitioned data between two parties in the semi-honest adversary model. To achieve thiss, we first present a two-party […]
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 […]
executing computations on untrusted machines in a trustworthy manner
We present sTile, a technique for building software systems that distribute large computations onto the cloud while providing guarantees that the cloud nodes cannot learn the computation’s private data. sTile is based on a nature-inspired, theoretical model of self-assembly. While sTile’s computational model is Turing universal, in this paper, we present a prototype implementation that […]
Detecting Distributed Reflection DoS Attacks based on Rank Correlation
DDoS presents a serious threat to the Internet since its inception, where lots of controlled hosts flood the victim site with massive packets. Moreover, in Distributed Reflection DoS (DRDoS), attackers fool innocent servers (reflectors) into flushing packets to the victim. But most of current DRDoS detection mechanisms are associated with specific protocols and cannot be […]
FUSION-BASED FAULT TOLERANT DATA STRUCTURES HOSTED ON DISTRIBUTED SERVER
In this paper, we present a technique referred to as fusion which combines the best of both these worlds to achieve the space efficiency of coding and the minimal update overhead of replication. Given a set of data structures, we maintain a set of fused backup data structures that can tolerate f crash faults among […]
- « Previous Page
- 1
- …
- 3
- 4
- 5
- 6
- Next Page »