A computer science student is required to progress from a novice programmer to a proficient developer through the programming fundamentals sequence of subjects. This paper deals with the capturing and representation of learning progression. The key contribution is a web-based interactive tutorial that enables computer science tutors and lecturers to practice applying the Bloom Taxonomy in class...

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is controlled. Bloom filters have been used in database applications since the 1970s, but only in recent years have they become popular in the ne...

Bloom Filters are widely used in many applications including database management systems. With a certain allowable error rate, this data structure provides an efficient solution for membership queries. The error rate is inversely proportional to the size of the Bloom filter. Currently, Bloom filters are stored in main memory because the low locality of operations makes them impractical on secon...

Privacy-preserving record linkage with Bloom filters has become increasingly popular in medical applications, since Bloom filters allow for probabilistic linkage of sensitive personal data. However, since evidence indicates that Bloom filters lack sufficiently high security where strong security guarantees are required, several suggestions for their improvement have been made in literature. One...

This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a feed-forward Bloom filter is also able to reduce the set of patterns needed for the exact matching phase. We show that this technique, along with a CPU architecture aware design of the Bloom filter, can provide speedups b...

Sporadic algal bloom development within a 10 year monitoring program in Virginia tidal tributaries of Chesapeake Bay is reviewed. These blooms were common events, characteristically producing a color signature to the surface water, typically short lived, occurring mainly from spring into autumn throughout different salinity regions of these rivers, and were produced primarily by dinoflagellates...

DNA, as all molecules in the cell, is constantly agitated through thermal energy and bombardment from water and neighboring masses. Through super-resolution tracking of DNA in live cells and simulation of the statistical mechanics of polymers we are building intuition into the function of DNA loops. We have discovered that the normal kinetics of replication fork progression allows time for ther...

Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic schemes are hash compaction and the bitstate method, which stores states in a Bloom filter. Bloom filters have been criticized for being slow, inaccurate, and memory-inefficient, but in this paper, we show how to obtain Bloom filters...

Gradient-based routing using Bloom filters is an effective mechanism to enable data-driven queries in multi-hop networks. A node compressively describes its data items as a Bloom filter, which is then diffused away to the other nodes with information decay. The Bloom filters form an information potential that eventually navigates queries to the source node by ascending the potential field. The ...