The moment’s estimator (Dekkers et al., 1989) has been used in extreme value theory to estimate the tail index, but it is not location invariant. The location invariant Hill-type estimator (Fraga Alves, 2001) is only suitable to estimate positive indices. In this paper, a new moment-type estimator is studied, which is location invariant. This new estimator is based on the original moment-type e...

This paper introduces a modeling approach for evaluating the performance of consistency models for Virtually Shared Memory systems. The proposed approach employs Deterministic and Stochastic Petri Nets (DSPNs) which provide a unified modeling tool for both qualitative and quantitative analysis. A DSPN of a sequential consistency model is presented which is employed for a quantitative performanc...

We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classification (e.g. of human activities) it is seldom used in boosting techniques. The recently proposed Temporal AdaBoost addresses the same problem but in a heuristic manner, first optimizing the weak learners without te...

We prove the correctness of a recently-proposed cache coherence protocol, Tardis, which is simple, yet scalable to high processor counts, because it only requires O(logN) storage per cacheline for an N processor system. We prove that Tardis follows the sequential consistency model and is both deadlockand livelock-free. Our proof is based on simple and intuitive invariants of the system and thus...

Building collaborative applications is still a challenging task. A collaborative application can be viewed as a class of distributed shared memory system. A distinctive property of these systems is their memory consistency model. In this paper, we argue that there is a relationship between different collaboration styles, on the one hand, and different memory consistency models, on the other. In...

This article is an evaluation of how caching-techniques from multiprocessor computers, can be used to improve the efficiency of distributed software, such as distributed persistent stores. It also describes the practical implementation of the weak cache consistency model in a distributed persistent store and presents a practical evaluation of this model compared to the sequential consistency mo...

We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unitpropagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.

The effectiveness of cheap talk advice is examined in recurrent relationships between a customer and multiple experts who provide differentiated professional services. The main findings are: (i) Full honesty is not sustainable if the profitability of service provision varies widely across problems. (ii) As there are more experts due to finer specialization, the maximum equilibrium honesty level...

Declarative process models define the behaviour of business processes as a set of constraints. Declarative process discovery aims at inferring such constraints from event logs. Existing discovery techniques verify the satisfaction of candidate constraints over the log, but completely neglect their interactions. As a result, the inferred constraints can be mutually contradicting and their interp...

A core problem in Model Driven Engineering is model consistency achievement: all models must satisfy relationships constraining them. Active consistency techniques monitor and control models edition for preventing inconsistencies, e.g., using automatic errors correction. The main problem of these approaches is that strict enforcement of consistency narrows the modeler’s possibilities for explor...