OBJECTIVE Recurrence-based measures of communication determinism and pattern information are described and validated using previously collected team interaction data. BACKGROUND Team coordination dynamics has revealed that"mixing" team membership can lead to flexible interaction processes, but keeping a team "intact" can lead to rigid interaction processes. We hypothesized that communication ...

Reproducibility is an essential component of the scientific method. In order to validate the correctness or facilitate the extension of a computational result, it should be possible to re-run a published result and verify that the same results are produced. However, reproducing a computational result is surprisingly difficult: non-determinism and other factors may make it impossible to get the ...

We study the determinism checking problem for regular expressions extended with interleaving. There are two notions of determinism, i.e., strong and weak determinism. Interleaving allows child elements intermix in any order. Although interleaving does not increase the expressive power of regular expressions, its use makes the sizes of regular expressions be exponentially more succinct. We first...

The purpose of this article is to develop theoretical framework for defining technology education (TE) goals. First, approaches technocratic determinism, the determinism nature, voluntarism and aestheticism have been considered within same framework. Second, four alternative definitions (Freenberg, 2007) applied these approaches. Instrumentalism emphasises learners’ creative product production....

Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes deterministic automata for strings. The corresponding family of languages matches all the requirements of a robust deterministic class. Furthermore we show that, differently from the one-dimensional case, there exist many cla...

Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effec...

In Software Engineering, as in Computing Science, the topics that we teach to our students can be considered as falling into two broad categories: the deterministic, and the non-deterministic. Deterministic topics are those where a specific scenario or operation leads to outcomes that can be assessed in terms of true/false values, and so this classification encompasses large elements of compute...

Outside security, non-determinism is an important tool for specifying systems without fixing unnecessary details. In security, however, normal refinement of non-deterministic specifications is usually not applicable, in particular because it may invalidate secrecy properties. Especially simulatability-based security notions seem to require detailed deterministic or probabilistic specifications....

We describe the development of FAD-Plus, a 27-item measure of lay beliefs in free will and 3 closely related constructs: scientific determinism, fatalistic determinism, and unpredictability. Previously published measures included only a subset of these variables and tended to assume an a priori pattern of relations among these 4 beliefs. In Study 1, exploratory factor analyses suggested relativ...

We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted as an operational semantics for a realistic programming language. We restrict formulas and accordingly rene inf...