art unrealized – künstlerische Praxis aus dem Blickwinkel der Documenta11

"Ich möchte noch einmal über diese documenta schlendern, bei dem einen oder anderen stehen bleiben, Arbeiten und ihre Themen ins Gedächtnis rufen, nach dem künstlerischen Interesse und Tun, nach der künstlerischen Haltung fragen, die sich darin lesen lässt, und Stichworte sammeln, Knoten in den roten Fäden, die diese Ausstellung zusammengehalten haben.

Datenkompression mit deterministischen Experten und Systeme teilweise unabhängiger Zufallsvariablen

Balkenhol B. Datenkompression mit deterministischen Experten und Systeme teilweise unabhängiger Zufallsvariablen. Ergänzungsreihe / Universität Bielefeld, Sonderforschungsbereich 343, Diskrete Strukturen in der Mathematik ; 95-009. Bielefeld; 1995

Space Efficient Linear Time Computation Of The Burrows And Wheeler-Transformation

this paper, we further improve on [7], and show that a sux tree based method requires on average about the same amount of space as the non-linear methods mentioned above. The improvement is achieved by exploiting the fact, that in practice, the BW-algorithm processes long input strings in blocks of a limited size (for this reason some researchers use the notion of \Block-Sorting"-algorithm ). Assuming a maximal block size of

One attempt of a compression algorithm using the BWT

this paper

Problems in Sequential and Parallel Game Tree Search

The ff---fi-- algorithm is an efficient technique for searching game trees. As parallel computers become more available, it is important to have good parallel game tree search algorithms. Until now it is an open problem whether a linear speedup can be achieved with respect to sequential alpha-- beta. This note presents a sample of game trees with distinct leaf values, which are easy for sequential alpha--beta -- independent of the move ordering in the trees. We conjecture that these trees are difficult test cases for parallel algorithms. email:[email protected] CONTENTS 2 Contents 1 Introduction 2 2 Description of the problem 3 3 Motivation and known results 3 3.1 Bivalued trees : : : : : : : : : : : : : : : : : : : : : : : : : : 4 3.1.1 S--Solve and P--Solve : : : : : : : : : : : : : : : : : : 4 3.1.2 Known results on speedups for bivalued trees : : : : 6 3.2 Minimax trees : : : : : : : : : : : : : : : : : : : : : : : : : : 6 3.2.1 The sequential algorithm : :..

Parallel error correcting codes

Ahlswede R, Balkenhol B, Cai N. Parallel error correcting codes. IEEE TRANSACTIONS ON INFORMATION THEORY. 2002;48(4):959-962.We introduce the concept of "parallel error correcting" codes, the error correcting codes for parallel channels. Here, a parallel channel is a set of channels such that the additive error over a finite field occurs in one of its members at time T iff the same error occurs in all members at the same time. The set of codewords of a parallel error correcting code has to be a product set, if the messages transmitted are from independent information sources. We present a simple construction of optimal parallel error correcting codes based on ordinary optimal error correcting codes and a construction of optimal linear parallel codes for independent sources based on optimal ordinary linear error correcting codes. The decoding algorithms for these codes are provided as well

Some properties of fix-free codes

Ahlswede R, Balkenhol B, Khachatrian L. Some properties of fix-free codes. Presented at the Proc. 1st Int. Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia

Modifications of the Burrows and Wheeler Data Compression Algorithm

this paper we improve upon these previous results on the BW-algorithm. Based on the context tree model, we consider the specific statistical properties of the data at the output of the BWT. We describe six important properties, three of which have not been described elsewhere. These considerations lead to modifications of the coding method, which in turn improve the coding efficiency. We shortly describe how to compute the BWT with low complexity in time and space, using suffix trees in two different representations. Finally, we present experimental results about the compression rate and running time of our method, and compare these results to previous achievements. More references on the methods described in this paper can be found in [1, 5]

Aernout Mik : Primal Gestures, Minor Roles

" To do justice to the rich diversity of Mik's oeuvre, four authors were invited to write an essay for this book. Bernhard Balkenhol gives an account of the various and simultaneous layers of reality of Mik's oueuvre; ethologist Tijs Goldschmidt finds a connection between one of Mik's video works showing old men romping around and a biological experiment with chimpanzees in Burgers Zoo (in Arnhem); Mark Kremer, in a literary commentary, draws attentions to elements of alienation and disorientation analogous to Mik's work; and Maxine Kopsa looks at behavoural conventions and early cinema in relation to the work of Aernout Mik. " -- Back cover of the book