This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition with other definitions of encoding and expressiveness found in the literature, and illustrate it on a case study: comparing the expressive power of CCS and CSP.

Strongly sequential spaces were introduced and studied to solve a problem of Tanaka concerning the product of sequential topologies. In this paper, further properties of strongly sequential spaces are investigated.

The paper investigates the impact of the institutional aspects of the innovation±adoption process on the success of its implementation. More speci®cally, we concentrate on the adoption of ®ve information technologies using a data set from the aerospace and defense industries. We investigate such factors as advocacy, breadth of support, time of adoption, and intraorganizational communications. S...

In this paper, we consider the patient similarity matching problem over a cancer cohort of more than 220,000 patients. Our approach first leverages on Word2Vec framework to embed ICD codes into vector-valued representation. We then propose a sequential algorithm for case-control matching on this representation space of diagnosis codes. The novel practice of applying the sequential matching on t...

We present a complete axiomatisation for four-valued sequential logic. It consists of nine axioms, from which all valid laws can be derived by equational reasoning. These nine axioms are independent of each other. © 2011 Elsevier B.V. All rights reserved.

In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in the database. When the items are frequently updated, the traditional way of counting support in sequential pattern mining may lead to incorrect (or, at least incomplete), conclusions. For example, if we are looking for ...