Table of

The transactional interpretation of quantum mechanics is summarized and various points concerning the transactional interpretation and its relation to the Copenhagen interpretation are considered. Questions concerning mapping the transactional interpretation onto the Copenhagen interpretation, of advanced waves as solutions to proper wave equations, of collapse and the quantum formalism, and of...

transactional analysis (ta) is a theory of personality that can be applied in virtually all fields of psychology: educational, counseling, organizational and psychotherapy. the atmosphere that supports transactional analysis is one of comfort, security and respect. a positive relationship is forged between the clinician and the client in order to provide a model for subsequent relationships tha...

Transactional memory is a promising programming model to enable high performance programs with reasonable programmer effort on the parallel architectures favored by modern processor manufacturers. This paper introduces dependence-aware transactions, a new method for maintaining the conflict serializability safety property of memory transactions while allowing significant freedom for an implemen...

The problem of determining the optimal number of clusters is important but mysterious in cluster analysis. In this paper, we propose a novel method to find a set of candidate optimal number Ks of clusters in transactional datasets. Concretely, we propose Transactional-cluster-modes Dissimilarity based on the concept of coverage density as an intuitive transactional inter-cluster dissimilarity m...

The Web frequently suffers from failures which affect the performance and consistency of applications run over it. An important fault-tolerance technique is the use of atomic actions (atomic transactions) for controlling operations on services. Atomic actions guarantee the consistency of applications despite concurrent accesses and failures. Techniques for implementing transactions on distribut...

Many programming languages support different concurrency models. In practice these models are often combined, however the semantics of the combinations are not always well-defined. We studied the combination of futures and Software Transactional Memory. We introduce transactional tasks, a mechanism to create futures in a transaction. Transactional tasks allow the parallelism in a transaction to...

Previous workflow mining works have concentrated their efforts on process behavioral aspects. Although powerful, these proposals are found lacking in functionalities and performance when used to discover transactional workflow that cannot be seen at the level of behavioral aspects of workflow. Their limitations mainly come from their incapacity to discover the transactional dependencies between...

Transactional events are a recent concurrency abstraction that combines first-class synchronous message-passing events with allor-nothing transactions. While prior work gave a semantics and an implementation for transactional events, it provided no guarantees about which of the many non-deterministic executions might be exhibited by a program. For concurrent systems, like transactional events, ...