Markov Decision Processes (MDPs) provide an extensive theoretical background for problems of decision-making under uncertainty. In order to maintain computational tractability, however, real-world problems are typically discretized in states and actions as well as in time. Assuming synchronous state transitions and actions at fixed rates may result in models which are not strictly Markovian, or...

We describe a new 28 view, 25 inch, autostereoscopic display which combines both time sequential and multi-projector technology. It is constructed from four time sequential subsystems, which abut behind a single ferroelectric liquid crystal shutter. The display has a resolution of 512×384 pixels in 24-bit colour. It allows multiple viewers to simultaneously view stereoscopic images without the ...

We examine the robustness of networks under attack when the attacker sequentially selects from a number of different attack strategies, each of which removes one node from the network. Network robustness refers to the ability of a network to maintain functionality under attack, and the problem-dependent context implies a number of robustness measures exist. Thus, we analyse four measures: (1) e...

Investigations of multi-digit number processing typically focus on two-digit numbers. Here, we aim to investigate the generality of results from two-digit numbers for four- and six-digit numbers. Previous studies on two-digit numbers mostly suggested a parallel processing of tens and units. In contrast, the few studies examining the processing of larger numbers suggest sequential processing of ...

The polygon construction is the emphasis and difficulty for constructing the topological relationship of spatial data. Many scholars continuous study and innovate for the algorithm. The traditional computational process mainly involves three steps in algorithms: (1) Determining the relationship between adjacent arcs. (2) Searching polygons. (3) Determining the topological relationship between a...

Large amounts of data are generated while students interact with computer based learning systems. These data can be analysed through data mining techniques to find patterns or train models that can help tutoring systems or teachers to provide better support. Yet, how can we exploit students’ data when they perform small-group face-to-face activities in the classroom? We propose a novel approach...

The use of sequential decoding in multiple access channels is considered. The Fano metric, which achieves all achievable rates in the one-user case, fails to do so in the multiuser case. A new metric is introduced and an inner bound is given to its achievable rate region. This inner bound region is large enough to encourage the use of sequential decoding in practice. The new metric is optimal, ...

Suffix trees have recently become very successful data structures in handling large data sequences such as DNA or Protein sequences. Consequently parallel architectures have become ubiquitous. We present a novel alphabet-dependent parallel algorithm which attempts to take advantage of the perverseness of the multicore architecture. Microsatellites are important for their biological relevance he...

In this report, we investigate the data transmission model in which a sequence of data is broadcasted to a number of receivers. The receivers, which have different channel capacities, wish to decode the data sequentially at different rates. Our results are applicable to a wide range of scenarios. For instance, it can be employed in the broadcast streaming of a video clip through the internet, s...

The sequential Context Tree Weighting procedure [6] achieves the asymptotically optimal redundancy behavior of k/2 · (log n)/n, where k is the number of free parameters of the source and n is the sequence length. For FSMX sources with an alphabet A, this number, k, is (|A| − 1) · |Ka|. However, especially the FSMX sources often use only a few possible letters in every state. It would be nice if...