Dynamic Mapping is an approach to cope with a loss of performance due to cache interference and to improve performance predictability of blocked algorithms for modern architectures. An example is matrix multiply: tiling matrix multiply for a data cache of 16KB using optimal tiles size achieves an average data-cache miss rate of 3%, but with peaks of 16% due to interference. Dynamic Mapping is a...

We question the validity of mapping the problem of two interacting particles in a random potential onto an effective random matrix model. We apply Shepelyansky’s mapping to Anderson models with additional perturbing random potentials which are known to reduce the localization length and show that the random matrix model incorrectly predicts an enhancement of the localization length. We conclude...

We introduce a 3 3 3 tensor H and its dual Hijk which represent the 2D projective mapping of points across three projections (views). The tensor H is a generalization of the well known 2D collineation matrix (homography matrix) and it concatenates two homography matrices to represent the joint mapping across three views. The dual tensor Hijk concatenates two dual homography matrices (mappings o...

We reinvestigate the validity of mapping the problem of two onsite interacting particles in a random potential onto an eeective random matrix model. To this end we rst study numerically how the non-interacting basis is coupled by the interaction. Our results indicate that the typical coupling matrix element decreases signiicantly faster with increasing single-particle localization length than i...

We introduce a couple of families of codi able languages and investigate properties of these families as well as interrelationships between di erent families. We also develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codi able context-free language. Finally, an attributed grammar that computes the values of the Parikh mat...

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are called “amiable”. The presented results extend the results obtained in [1] for the binary case. In particular it is shown that all the words having the same Parikh matrix can be obtained one from another by applying on...

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words having the same Parikh matrix; these words are called “amiable” or “M equivalent”. The presented paper uses the results obtained in [3] for the binary case. The aim is to distinguish the amiable words by using a morphism that provides additional information about...