Results

1 - 25 of 35
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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 ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Today's technology-enhanced learning practices cater to students and teachers who use many different learning tools and environments and are used to a paradigm of interaction derived from open, ubiquitous, and socially oriented services. In this context, a crucial issue for education system...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
This paper outlines our experiences with applying collaborative tagging in e-learning systems to supplement more traditional metadata gathering approaches. Over the last 10 years, the learning object paradigm has emerged in e-learning and has caused standards bodies to focus on creating metadata...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Today’s technology enhanced learning practices cater to students and teachers who use many different learning tools and environments and are used to a paradigm of interaction derived from open, ubiquitous, and socially-oriented services. In this context, a crucial issue for education systems in ge...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
This paper presents a novel method to study the evolution of Linux kernel components using complex networks to understand how Linux kernel components evolve over time. After analyzing the node degree distribution, clustering coefficient, and average path length of the call graphs corresponding to th...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish v...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Data gathering in sensor networks is required to be efficient, adaptable and robust. Recently, compressive sensing (CS) based data gathering shows promise in meeting these requirements. Existing CS-based data gathering solutions require that a transform that best sparsifies the sensor readings shoul...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Background: Piscine reovirus (PRV) is a newly discovered fish reovirus of anadromous and marine fish ubiquitous among fish in Norwegian salmon farms, and likely the causative agent of heart and skeletal muscle inflammation (HSMI). HSMI is an increasingly economically significant disease in Atlantic ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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,...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
In this paper we study the language of the words that, for a given language L, distinguish between pairs of different left-quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from clo...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Quite often, trivial problems stated for deterministic finite automata (DFA) are surprisingly difficult for the non-deterministic case (NFA). In any non-minimal DFA for a given regular language, we can find two equivalent states which can be “merged” without changing the accepted language. This ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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 ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal Deterministic Finite Automata (DFA) for the same language L, this technique see...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
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 ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We study the shuffle quotient operation and introduce equivalence relations it defines with respect to a (regular) language. Corresponding to an arbitrary shuffle decomposition we construct a normalized decomposition that is defined in terms of maximal languages. Using closure properties of the norm...