This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to defining three general families of models depending on the kind of trace that they use....

Tracing JIT compilation generates units of compilation that are easy to analyse and are known to execute frequently. The AJITPar project aims to investigate whether the information in JIT traces can be used to make better scheduling decisions or perform code transformations to adapt the code for a specific parallel architecture. To achieve this goal, a cost model must be developed to estimate t...

The idea that new memories are initially 'labile' and sensitive to disruption before becoming permanently stored in the wiring of the brain has been dogma for >100 years. Recently, we have revisited the hypothesis that reactivation of a consolidated memory can return it to a labile, sensitive state - in which it can be modified, strengthened, changed or even erased! The data generated from some...

Contract conformance is hard to determine statically, prior to the deployment of large pieces of software. A scalable alternative is to monitor for contract violations post-deployment: once a violation is detected, the trace characterising the offending execution is analysed to pinpoint the source of the offence. A major drawback with this technique is that, often, contract violations take time...

Groupware that provides a distributed shared workspace is becoming more and more common. However, it is often difficult in these systems to maintain awareness of other people’s actions and activities. One reason for this difficulty is that people’s representations in groupware are neither as noticeable nor as expressive as their bodies in the real world. The hypothesis in this research is that ...

Concurrent traces are sequences of computational steps where independent steps can be permuted and executed in any order. We study the problem of matching on concurrent traces. We give a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace. 1 State-Transition Concurrency Computation in a concurrent system results from the interactions of computing ...