Results

[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.]
Patients typically undergo physiotherapy with the help of a physiotherapist who teaches, guides, and corrects the patients as they perform exercises. It would be nice if people could repeat these exercises at home, potentially improving their recovery rate. However, without guidance and/or correctiv...
[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.]
Most searchers do not know how to use Web search engines as effectively as possible. This is due, in part, to search engines not providing feedback about how search behavior can be improved. Because feedback is an essential part of learning, we created the Search Dashboard, which provides an int...
[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.]
Localization in mobile networks is of paramount importance to a variety of pervasive applications. Due to the limitations of GPS, such as high deployment cost, many researchers have devised a variety of different localization schemes based on the measurements of connectivity or distance between neig...
[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.]
In this paper we prove a lower bound for the maximum state complexity of Deterministic Finite Cover Automata (DFCAs) obtained from Non-deterministic Finite Automata (NFAs) of a given state complexity n, in case of a binary alphabet. We show, for binary alphabets, that the difference between maximum ...
[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.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We introduce a new variant of the heavily studied model of H systems. The new variant will use an external factor to determine the set of the active splicing rules. We improve the best known universality result for time-varying H systems with respect to the diameter of such a system and we prove tha...
[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.]
Regex are used in many programs such as Perl, Awk, Python, egrep, vi, emacs etc. It is known that regex are different from regular expressions. In this paper, we give regex a formal treatment. We make a distinction between regex and extended regex; while regex present regular languages, extended reg...
[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...