In many application domains, transactions are the records of personal activities. Transactions always reveal personal behavior customs, so clustering the transactional data can divide individuals into different segments. Transactional data are often accompanied with a concept hierarchy, which defines the relevancy among all of the possible items in transactional data. However, most of clusterin...

In this paper, we propose a method of transactional behavior description in component-based software architectures. We fucus on the specification of transactional models employed in components. Especially, we try to specify the creation and canceling dependencies among transactions. For this purpose, we enhance the SOFA software architecture so that it can be dynamic: at runtime, new interface ...

Handling workflow transactional behavior remains a main problem to ensure a correct and reliable execution. It is obvious that the discovery, and the explanation of this behavior, would enable to better understand and control workflow recovery. Unfortunately, previous workflow mining works have concentrated their efforts on control flow aspects. Although powerful, these proposals are found lack...

In this document we present an overview of Transactional Memory models, as well as a comparison to traditional parallel frameworks. In this context, we follow with an analysis on the problem of self-tuning concurrency control in transactional memory, where different mechanisms are used to predict and adjust an application’s concurrency level with respect to available parallelism. We are particu...

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 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...

Todays process-aware information systems (PAIS) provide little support for explicit specification of transactional aspects. PAIS have to integrate events and data from various external sources as workflow relevant data. Furthermore, it should be aware of changes made externally and write consistently back data used and altered to external sources. To avoid inconsistencies within redundantly mai...

A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of transactions, a transactional workflow may be not wellformed. Moreover, only one workflow is allowed to execute a non-compensatable transaction with current scheduling protocol. In this paper, we present a transactional wor...

Interactive media, especially the internet, are often used in an economic context where interactions are actually transactions. We focus on artists who apply economic principles and coin those works as “transactional arts”. We will observe that many accomplished new media works actually have transactional features and that the characteristics of the internet economy seem to facilitate this kind...