Several different “hat games” have recently received a fair amount of attention. Typically, in a hat game, one or more players are required to correctly guess their hat colour when given some information about other players’ hat colours. Some versions of these games have been motivated by research in complexity theory and have ties to well-known research problems in coding theory, and some vari...

To enhance the overall performance of an application it is necessary to improve the cache access behavior. In this case, a cache visualizer is usually needed for fully understanding the runtime cache activities and the access pattern of applications. However, it does not suffice if only visualizing what happened. More importantly, a visualizer has to provide users with the knowledge about the r...

We study the problem of finding a point of maximal electrostatic potential inside an arbitrary triangle with homogeneous surface charge distribution. In this article we derive several synthetic and analytic relations for its location in the plane. Moreover, this point satisfies the definition of a triangle center, different from any of previously discovered centers in Clark Kimberling’s encyclo...

YAWL (Yet Another Workflow Language) workflow language supports the most frequent control-flow patterns found in the current workflow practice. As a result, most workflow languages can be mapped onto YAWL without the loss of control-flow details, even languages allowing for advanced constructs such as cancellation regions and OR-joins. Hence, a verification approach for YAWL is desirable, becau...

The study of relevance has gained considerable attent ion recently in areas as diverse as machine learning and knowledge representation. In this paper, we focus on one particular area, namely relevance in the context of logical theories. We are interested in answering questions like: when is a sentence (or theory) relevant to a set of propositions, or, when is one set of propositions relevant t...

In the traditional fuzzy logic, the expert’s degree of confidence d(A&B) in a complex statement A&B (or A∨B) is uniquely determined by his/her degrees of confidence d(A) and d(B) in the statements A and B, as f&(d(A), d(B)) for an appropriate “and”-operation (t-norm). In practice, for the same degrees d(A) and d(B), we may have different degrees d(A&B) depending on the relation between A and B....