The Covid-19 pandemic confronts us with the vulnerability of our health, but no less important is psychological well-being. In this contribution I explore possible strength(s) – persons and religion(s). First, introduce work theologian Caroline Gustavsson who distinguishes between: “experienced vulnerability,” “narrated vulnerability” “induced vulnerability.” As examples il­lustrations these co...

We examine the power of quantum Turing machines (QTM’s) which compute string-valued functions of their inputs using small workspace. A (probabilistic or quantum) Turing machine has three tapes: A read-only input tape, a read/write work tape, and a “1.5-way" write-only output tape. Consider a partial function f : Σ 1 → Σ 2 , where Σ1 and Σ2 are the input and output tape alphabets, respectively. ...

We study space-efficient algorithm for computing a centerpoint for a set P of n points in R, where the points in P are given in a read-only array. We propose an algorithm that finds a centerpoint of P in O(T (n) log n) time using O(S(n)) extra space, where T (n) and S(n) are the time and extra space complexities of computing the median among a set of n elements stored in a read-only array.

Web applications have evolved from simple read-only websites to complex dataand operation-intensive systems. The main goal of this kind of application is to provide the users with services that assist them in carrying out activities according to a given set of business rules. The addition of transactions to modern web applications poses new challenges, such as managing the interplay between bus...

Current workflow management technology offers rich support for process-oriented coordination of distributed teamwork. In this paper, we evaluate the performance of an industrial workflow process where similar tasks can be performed by various actors at many different locations. We analyzed a large workflow process log with state-of-the-art mining tools associated with the ProM framework. Our an...

In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types ω0 . . . ωN−1. The opponent is assumed to adopt at every move one of the opponent types ωi according to the probability Pr(ωi). We hypothesize that PrOM search is a better search mechanism than Opponent-Model search (OM search) and Minimax search. In this paper we investigate two...