Sketch is a probabilistic data structure, and is widely used for per-flow measurement in network. The most common sketches are the CM sketch and its several variants. However, given a limited memory size, these sketches always significantly overestimate some flows, exhibiting poor accuracy. To address this issue, we proposed a novel sketch named the Bloom sketch, combining the sketch with the B...

Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants....

This paper presents a cache-aware Bloom Filter algorithm with improved cache behavior and a lower false positive rates compared to prior work. The algorithm relies on the power-of-two choice principle to provide a better distribution of set elements in a Blocked Bloom Filter. Instead of choosing a single block, we insert new elements into the least-loaded of two blocks to achieve a low false-po...

Blooms of the phytoplankton coccolithophorid Emiliania huxleyi can cause significant changes to both the inherent and the apparent optical properties within an oceanic column. Measurements made within such a bloom off the southwestern coast of England during July 1999 are reported. The multiple scattering properties of the bloom prevented accurate retrieval of absorption (a) and attenuation (c)...

A novel approach to performing context discovery in ad-hoc networks based on the use of attenuated Bloom filters is proposed in this report. In order to investigate the performance of this approach, a model has been developed. This document describes the model and its validation. The model has been implemented in Matlab, and results are also shown in this document. Attenuated Bloom filters appe...

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As with a Bloom filter, a CBF obtains space savings by allowing false positives. We provide a simple hashing-based alternative based on d-left hashing called a d-left CBF (dlCBF). The dlCBF offers the same functionality...

We consider the educational objective of learning how to prove a statement in a mathematically rigorous way and we break down this educational objective into several partial objectives following the standard taxonomy of Bloom, 1956]. Three advantages stem from this approach: rst, the partial objectives are more manageable in the process of curriculum development; second, it is easier to individ...

We explored the mapping between mass-count syntax and semantics, and how verb event semantics affect the meaning of derived nouns. In Experiment 1, we compared the interpretation of mass and count nouns derived from iterative verbs that describe bounded events (e.g., jump) and nouns derived from non-iterative verbs that describe unbounded events (e.g., dance). Participants based judgments prima...

The bloom filter method for privacy preserving record linkage [24] has been shown to be both efficient, and provide equivalent linkage quality to that achievable with unencoded identifiers [23]. However in some situations, the bloom filter method may be vulnerable to frequency attacks, which could potentially leak identifying information [18]. In this paper we extend the bloom filter protocol t...

The Bloom syndrome, caused by mutations in a single gene [BLM (15q26.1)], is a rare genomic instability syndrome. Despite its autosomal recessive transmission, it shows a male dominance, suggesting the possibility of a subgroup with X-linked recessive inheritance. In view of the latest molecular developments achieved in the other genomic instability syndromes, the potential functions of the X c...