It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...

Loading of data from slow persistent memory (disk storage) to main memory represents a bottleneck for current interactive visual data exploration applications, especially when applied to huge volumnes of data. Semantic caching of queries at the client-side is a recently emerging technology that can significantly improve the performance of such systems, though it may not in all cases fully achie...

A typical pervasive application executes in a changing environment: people, computing resources, software services and network connections come and go continuously. A robust pervasive application needs adapt to this changing context as long as there is an appropriate rewiring strategy that guarantees correct behavior. We combine the MERODE modeling methodology with the ReWiRe framework for crea...

The visual inspection of a hexahedral mesh with respect to element quality is difficult due clutter and occlusions that are produced when rendering all faces or their edges simultaneously. Current approaches overcome this problem by using focus on specific elements then rendered opaque, carving away occluding view. In work, we make use advanced GPU shader functionality generate focus+context hi...

We propose a new method for the calculation of the statistical properties, as e.g. the entropy, of unknown generators of symbolic sequences. The probability distribution p(k) of the elements k of a population can be approximated by the frequencies f(k) of a sample provided the sample is long enough so that each element k occurs many times. Our method yields an approximation if this precondition...

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from supercompactness to rank-to-rank embeddings. The majority of these large cardinals properties can be defined in terms of suitable elementary embeddings j : ...