Previous work by Talbot and Osborne [2007] explored the use of randomized storage mechanisms in language modeling. These structures trade a small amount of error for significant space savings, enabling the use of larger language models on relatively modest hardware. Going beyond space efficient count storage, here we present the Talbot Osborne Morris Bloom (TOMB) Counter, an extended model for ...

The duplicate-insensitive and time-decayed sum of an arbitrary subset in a stream is an important aggregation for various analyses in many distributed stream scenarios. In general, precisely providing this sum in an unbounded and high-rate stream is infeasible. Therefore, we target at this problem and introduce a sketch, namely, time-decaying Bloom Filter (TDBF). The TDBF can detect duplicates ...

This paper arose from the happy connection between two research programmes. The first programme is the study of iteration theories, initiated by Calvin Elgot [4], and elaborated and extended in a long series of papers by Bloom and Ésik. (Most of their results are contained in the monograph [2].) The second programme is the development of a categorical, machine-based analysis of concurrency, by ...

The MapReduce framework has been widely used to process and analyze largescale datasets over large clusters. As an essential problem, join operation among large clusters attracts more and more attention in recent years due to the utilization of MapReduce. Many strategies have been proposed to improve the efficiency of distributed join, among which bloomfilter is a successful one. However, the b...

Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...

Context-aware ubiquitous learning has been recognized as being a promising approach that enables students to interact with real-world learning targets with supports from the digital world. Several researchers have indicated the importance of providing learning guidance or hints to individual students during the context-aware ubiquitous learning process. In this study, an expert system-based gui...

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...

a r t i c l e i n f o a b s t r a c t Bloom filters (BFs) are used in many applications for approximate check of set membership. Counting Bloom filters (CBFs) are an extension of BFs that enable the deletion of entries at the cost of additional storage requirements. Several alternatives to CBFs can be used to reduce the storage overhead. For example schemes based on d-left hashing or Cuckoo has...

Bloom filters are a type of data structure that is used to test whether or not an element member set. They known for being space-efficient and commonly employed in various applications, such as network routers, web browsers, databases. These work by allowing fixed probability incorrectly identifying the set, false positive rate (FPR). However, traditional bloom suffer from high FPR extensive me...

Many clients like to use the Web to discover product details in the form of online reviews. The reviews are provided by other clients and specialists. Recommender systems provide an important response to the information overload problem as it presents users more practical and personalized information facilities. Collaborative filtering methods are vital component in recommender systems as they ...