This paper has three objectives. Firstly it describes the historical development of Distributed Interactive Applications. It then defines network latency. Finally it describes a new approach to masking network latency in Distributed Interactive Applications called the strategy model approach. This approach derives from the on-going PhD studies of one of the authors. A software application to ga...

Action-object phrases (e.g., "lift the bottle") are remembered better if they have been enacted rather than learned verbally. This enactment effect is largest in free recall for phrases with objects (e.g., "bottle") present because these phrases can be interactively encoded with those context objects (interactive context integration) that serve as retrieval cues. The current study investigated ...

The guessing game introduced by Riis [Electron. J. Combin. 2007] is a variant of the “guessing your own hats” game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirec...

The present study was an attempt to compare the effect of three VLSs, namely word-part strategy, word-card strategy and context-clue strategy on immediate and delayed English vocabulary retention of Iranian third grade high school students. To this end, 90 students, studying at three high schools in Tabriz, in three intact groups, were considered as the participants of the study. In order to en...

A singled out game for two players A and B is analysed. In this game, both players are trying to correctly guess answers to yes/no questions; the first player to answer n questions correctly wins the game. Player B has an advantage of knowing A’s answer before having to announce his own guess. We find the best strategy for both players and give formulas for winning probabilities. We also provid...

We consider the Brownian ‘‘spider,’’ a construct introduced in Dubins and Schwarz (1988) and in Barlow and Pitman (1989). In this note, the author proves the ‘‘spider’’ bounds by using the dynamic programming strategy of guessing the optimal reward function and subsequently establishing its optimality by proving its excessiveness. © 2016 The Author(s). Published by Elsevier B.V. This is an open...

In this paper we introduce the concept of an interactive mathematical document. We give a formal description of such a document, which enables us to introduce the notion of a context as user and time dependent information regarding both mathematical and personal data. We also describe the realization of interactive mathematical documents within the MathDox system developed at Eindhoven Universi...

Context: Software engineering has a problem in that when we empirically evaluate competing prediction systems we obtain conflicting results. Objective: To reduce the inconsistency amongst validation study results and provide a more formal foundation to interpret results with a particular focus on continuous prediction systems. Method: A new framework is proposed for evaluating competing predict...

In a security system that allows people to choose their own passwords those people tend to choose passwords that can be easily guessed This weakness exists in practically all widely used systems Instead of forcing users to choose well chosen secrets which are likely to be di cult to remember we propose solutions that maintain both user convenience and a high level of security at the same time T...