Publications

Abstract

Demonstrative terms (e.g., this and that) are key to understanding how a language constructs and interprets spatial relationships. They are tricky to pin down, typically having functions that do not match “idealized” uses, and that can become invisible in narrow elicitation settings. This questionnaire is designed to identify the range(s) of use of certain spatial demonstrative terms, and help assess the roles played by gesture, access, attention, and addressee knowledge in demonstrative use. The stimuli consist of 25 diagrammed “elicitation settings” to be created by the researcher.

Abstract

Angelika Wittek untersuchte Zustandsveränderungsverben bei vier- bis sechsjährigen Kindern. Englischsprechende Kinder verstehen bis zum Alter von 8 Jahren diese Verben als Bewegungsverben und ignorieren, daß sie zusätzlich die Information über einen Endzustand im Sinne der Negation des Ausgangszustands beeinhalten. Wittek zeigte, daß entgegen der Erwartung transparente, morphologisch komplexe Formen (wachmachen), in denen die Partikel den Endzustand explizit macht, nicht besser verstanden werden als Simplizia (wecken). Zudem diskutierte sie, inwieweit die Verwendung des Adverbs wieder in restitutiver Lesart Hinweise auf den Erwerb dieser Verben geben kann.

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.