In this paper we consider the transformation from (minimal) non-deterministic finite automata (NFAs) to deterministic finite cover automata (DFCAs). We want to compare the two equivalent accepting devices with respect to their number of states; this becomes in fact a comparison between the expressio...

Petri net modeling enables us to verify the protocol of interest formally. However, aside from formal verification, a new protocol really needs to be tested in a relatively realistic environment in which it interworks (or at least co-exists) with earlier or different versions of the same or similar ...

The creation of learning resource metadata by instructors is a time consuming and error prone process. This paper outlines a broad research agenda to mitigate these issues.. The first part of this approach is to collect prescriptive metadata from various actors involved using ...

Pointing at displays from a distance is becoming a common method of interacting with computer applications and entertainment systems, using devices such as the Wii Remote, the PlayStation Move controller, or the Microsoft Kinect. These systems often implement relative forms of ray-cast pointing,...

This paper presents a systems approach to facilitate effective learning object acquisition through the use of communications, modeling, and the agent metaphor. By changing the emphasis that is usually placed on metadata creation and interpretation (which can be problematic) we instead focus on t...

Crisis command centres often gather data from disparate locations and collect it for visualization on a large, shared screen. However, the resulting visualization often lacks expressiveness: it fails to express nuanced mediating characteristics about the information, such as speci...

The nuclear reaction O-18 (d, 2n) F-18 and the separation of F-18 from the irradiated samples have been studied. For this reaction liquid H2O samples were irradiated with deuterons beam in the stainless steel cells cooled with water. The formed positron emiting F-18 was separated from (H2O)-O-18 by ...

We introduce a right congruence relation that is the analogy of the Nerode congruence when catenation is replaced by shuffle. Using this relation we show that for certain subclasses of regular languages the shuffle decomposition problem is decidable. We show that shuffle decomposition is undecidable...

A string x is random according to Kolmogorov [10] if, given its length, there is no stringy, sensibly shorter than x, by means of which a universal partial recursive function could produce x. This remarkable definition has been validated in several ways (see [12, 14, 2, 11]) including a topological ...