In contrast to deterministic or nondeterministic computation, it is a fundamental open problem in randomized computation how to sepaxate different randomized time classes (at this point we do not even know how to sepa...
详细信息
In this paper we present an annotated corpus which can be used for training and testing algorithms to automatically extract information about diseases outbreaks from news and health reports. We also propose initial ap...
The goal of this paper is to permit secure outsourced system evaluation. We propose a method for generating synthetic databases and obfuscating a workload of queries in order to protect the sensitive information prese...
详细信息
The goal of this paper is to permit secure outsourced system evaluation. We propose a method for generating synthetic databases and obfuscating a workload of queries in order to protect the sensitive information present in the database. The synthetic database and workload can be used by a third party to accurately carry out performance tuning, index selection, or other system evaluation tasks. As a result, an untrusted third party can evaluate whether a new technology would benefit the data owner without the risk of a privacy breach. Our approach is to employ state-of-the-art privacy mechanisms to compute the sufficient statistics of a statistical model of the true database. These statistics are safe to release, so a third party can then use them to generate one or more synthetic databases to be used as a surrogate for the true database.
Document-centric XML document creation is a process of marking up textual content rather than typing text in a predefined structure. It turns out that, although the final document has to be valid with respect to the D...
详细信息
As there is no MAC layer acknowledgment from the receiver for broadcast/multicast transmission in the 802.11 network, using the lowest transmission rate is understandably the safest approach because it minimizes recep...
详细信息
ISBN:
(纸本)9781605587516
As there is no MAC layer acknowledgment from the receiver for broadcast/multicast transmission in the 802.11 network, using the lowest transmission rate is understandably the safest approach because it minimizes reception error for clients with the worst channel condition. On the contrary, the transmission rate for receivers with good channel conditions is unnecessarily limited. In the case of video streams being broadcast/multicast via 802.11, this approach will lead to poor received video at all clients. In this paper, we demonstrate that there isutility in activating rate adaptation for broadcast/multicast traffic. In particular, we implement a system that significantly improves the broadcast video quality in 802.11 network. This is achieved through an approach of joined broadcast/multicast rate adaptation and network-coded retransmission.
A key challenge in privacy-preserving data mining is ensuring that a data mining result does not inherently violate privacy. Ε-Differential Privacy appears to provide a solution to this problem. However, there are no...
详细信息
This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixe...
详细信息
This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixed order. Moreover, this approach treats the antecedent and consequent of a rule separately and allows time lag between them. Thus, rules discovered are useful in many applications for prediction.
We just released an Open Source receiver that is able to decode IEEE 802.11a/g/p Orthogonal Frequency Division Multiplexing (OFDM) frames in software. This is the first Software Defined Radio (SDR) based OFDM receiver...
详细信息
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server's goal is to maximize its total ...
详细信息
ISBN:
(纸本)9783959770422
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server's goal is to maximize its total revenue within a given time limit, T. We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm for the problem in a uniform metric space and a 6-competitive algorithm for the general case of weighted graphs (under reasonable assumptions about the input instance). We conclude with an experimental evaluation of our algorithm in simulated settings inspired by real-world Dial-a-Ride data. Experimental results show that our algorithm performs well when compared to an offline version of the algorithm and a greedy algorithm.
暂无评论