Optimal dynamic multi-attribute hashing for range queries

This paper examines a partial match retrieval scheme which supports range queries for highly dynamic databases. The scheme relies on order preserving multi-attribute hashing. In general, designing optimal indexes is NP-hard. Greedy algorithms used to determine the optimal indexes for simple partial match queries are not directly applicable because there are a larger number of queries to consider in determining the optimal indexes. In this paper we present heuristic algorithms which provide near-optimal solutions. The optimisation scheme we propose can be used to design other dynamic file structures such as the grid file, BANG file and multilevel grid file to further enhance their retrieval performance taking into consideration the query distribution.     

On the Fourier Spectra of Distributions in Clifford Analysis

In recent papers by Brackx, Delanghe and Sommen, some fundamental higher dimensional distributions have been reconsidered in the framework of Clifford analysis, eventually leading to the introduction of four broad classes of new distributions in Euclidean space. In the current paper we continue the in-depth study of these distributions, more specifically the study of their behaviour in frequency space, thus extending classical results of harmonic analysis.     

Almost locatedness in uniform spaces

A weak form of the constructively important notion of locatedness is lifted from the context of a metric space to that of a uniform space. Certain fundamental results about almost located and totally bounded sets are then proved.     

Eine rasche Methode zur vollst?ndigen F?llung des Arsens als Pentasulfid und zur Trennung desselben von Wismuth, Blei, Antimon und ?hnlichen Metallen

Ohne ZusammenfassungIn englischer Sprache eingesandt. Aus dem Englischen übersetzt von der Redaction.     

Schwefelverbindungen

Ohne Zusammenfassung