Publications

Abstract

Set is widely used as a kind of basic data structure. However, when it is used for large scale data set the cost of storage, search and transport is overhead. The bloom filter uses a fixed size bit string to represent elements in a static set, which can reduce storage space and search cost that is a fixed constant. The time-space efficiency is achieved at the cost of a small probability of false positive in membership query. However, for many applications the space savings and locating time constantly outweigh this drawback. Dynamic bloom filter (DBF) can support concisely representation and approximate membership queries of dynamic set instead of static set. It has been proved that DBF not only possess the advantage of standard bloom filter, but also has better features when dealing with dynamic set. This paper proposes a time-dependent multiple bit-strings bloom filter (TMBF) which roots in the DBF and targets on dynamic incremental set. TMBF uses multiple bit-strings in time order to present a dynamic increasing set and uses backward searching to test whether an element is in a set. Based on the system logs from a real P2P file sharing system, the evaluation shows a 20% reduction in searching cost compared to DBF.

Abstract

Although sign language-using communities exist in all areas of the world, few sign languages have been documented in detail. Sign languages occur in a variety of sociocultural contexts, ranging from sign languages used in closed village communities to officially recognized national sign languages. They may be grouped into language families on historical grounds or may participate in various language contact situations. Systematic cross-linguistic comparison reveals both significant structural similarities and important typological differences between sign languages. Focusing on information from non-Western countries, this article provides an overview of the sign languages of the world.