User interaction with scatterplots on small screens--A comparative evaluation of geometric-semantic zoom and fisheye distortion

Existing information-visualization techniques that target small screens are usually limited to exploring a few hundred items. In this article we present a scatterplot tool for Personal Digital Assistants that allows the handling of many thousands of items. The application's scalability is achieved by incorporating two alternative interaction techniques: a geometric-semantic zoom that provides smooth transition between overview and detail, and a fisheye distortion that displays the focus and context regions of the scatterplot in a single view. A user study with 24 participants was conducted to compare the usability and efficiency of both techniques when searching a book database containing 7500 items. The study was run on a pen-driven Wacom board simulating a PDA interface. While the results showed no significant difference in task-completion times, a clear majority of 20 users preferred the fisheye view over the zoom interaction. In addition, other dependent variables such as user satisfaction and subjective rating of orientation and navigation support revealed a preference for the fisheye distortion. These findings partly contradict related research and indicate that, when using a small screen, users place higher value on the ability to preserve navigational context than they do on the ease of use of a simplistic, metaphor-based interaction style.     

Parameterized Intractability of Distinguishing Substring Selection

A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-complete Distinguishing Substring Selection problem (DSSS for short) which asks, given a set of "good" strings and a set of "bad" strings, for a solution string which is, with respect to the Hamming metric, "away" from the good strings and "close" to the bad strings. More precisely, given integers d_g, d_b, and L, we ask for a length-L string s such that s has Hamming distance at least d_g to every length-L substring of the good strings and such that every bad string has a length-L substring with Hamming distance at most d_b to s. Studying the parameterized complexity of DSSS, we show that, already for binary alphabet, DSSS is W[1]-hard with respect to its natural parameters. This, in particular, implies that a recently given polynomial-time approximation scheme (PTAS) by Deng et al. cannot be replaced by a so-called efficient polynomial-time approximation scheme (EPTAS) unless an unlikely collapse in parameterized complexity theory occurs. This is seemingly the first computational biology problem for which such a border between PTAS (which exists) and EPTAS (which is unlikely to exist) could be established. By way of contrast, for a special case of DSSS, we present an exact fixed-parameter algorithm solving the problem efficiently. In this way we also exhibit a sharp border between fixed-parameter tractability and intractability results.     

Construction of a quality model for machine learning systems

Software Quality Journal - Nowadays, systems containing components based on machine learning (ML) methods are becoming more widespread. In order to ensure the intended behavior of a software...     

A theoretical comparison of LRU and LRU-K

The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently Used (LRU). We compare LRU-2 and LRU theoretically, using both the standard competitive analysis and the newer relative worst order analysis. The competitive ratio for LRU-2 is shown to be 2k for cache size k, which is worse than LRU’s competitive ratio of k. However, using relative worst order analysis, we show that LRU-2 and LRU are comparable in LRU-2’s favor, giving a theoretical justification for the experimental results. Many of our results for LRU-2 also apply to its generalization, Least Recently Used Kth Last Request.     

Scalable parallel word search in multicore/multiprocessor systems

This paper presents a parallel algorithm for fast word search to determine the set of biological words of an input DNA sequence. The algorithm is designed to scale well on state-of-the-art multiprocessor/multicore systems for large inputs and large maximum word sizes. The pattern exhibited by many sequential solutions to this problem is a repetitive execution over a large input DNA sequence, and the generation of large amounts of output data to store and retrieve the words determined by the algorithm. As we show, this pattern does not lend itself to straightforward standard parallelization techniques. The proposed algorithm aims to achieve three major goals to overcome the drawbacks of embarrassingly parallel solution techniques: (i) to impose a high degree of cache locality on a problem that, by nature, tends to exhibit nonlocal access patterns, (ii) to be lock free or largely reduce the need for data access locking, and (iii) to enable an even distribution of the overall processing load among multiple threads. We present an implementation and performance evaluation of the proposed algorithm on DNA sequences of various sizes for different organisms on a dual processor quad-core system with a total of 8 cores. We compare the performance of the parallel word search implementation with a sequential implementation and with an embarrassingly parallel implementation. The results show that the proposed algorithm far outperforms the embarrassingly parallel strategy and achieves a speed-up’s of up to 6.9 on our 8-core test system.     

DuD Recht

Dud Recht

DuD Recht     

On reducing computational effort in topology optimization: we can go at least this far!

In this work, we attempt to answer the question posed in Amir O., Sigmund O.: On reducing computational effort in topology optimization: how far can we go? (Struct. Multidiscip. Optim. 44(1):25–29 2011). Namely, we are interested in assessing how inaccurately we can solve the governing equations during the course of a topology optimization process while still obtaining accurate results. We consider this question from a “PDE-based” angle, using a posteriori residual estimates to gain insight into the behavior of the residuals over the course of Krylov solver iterations. Our main observation is that the residual estimates are dominated by discretization error after only a few iterations of an iterative solver. This provides us with a quantitative measure for early termination of iterative solvers. We illustrate this approach using benchmark examples from linear elasticity and demonstrate that the number of Krylov solver iterations can be significantly reduced, even when compared to previous heuristic recommendations, although each Krylov iteration becomes considerably more expensive.     

Modeling context-aware and intention-aware in-car infotainment systems

It is fundamental to understand users’ intentions to support them when operating a computer system with a dynamically varying set of functions, e.g., within an in-car infotainment system. The system needs to have sufficient information about its own and the user’s context to predict those intentions. Although the development of current in-car infotainment systems is already model-based, explicitly gathering and modeling contextual information and user intentions is currently not supported. However, manually creating software that understands the current context and predicts user intentions is complex, error-prone and expensive. Model-based development can help in overcoming these issues. In this paper, we present an approach for modeling a user’s intention based on Bayesian networks. We support developers of in-car infotainment systems by providing means to model possible user intentions according to the current context. We further allow modeling of user preferences and show how the modeled intentions may change during run-time as a result of the user’s behavior. We demonstrate feasibility of our approach using an industrial case study of an intention-aware in-car infotainment system. Finally, we show how modeling of contextual information and modeling user intentions can be combined by using model transformation.     

Flexible drift-compensation system for precise 3D force mapping in severe drift environments

The acquisition of dense 3D data sets is of great importance, but also a challenge for scanning probe microscopy (SPM). Thermal drift often induces severe distortions in the data, which usually constrains the acquisition of dense data sets to experiments under ultra-high vacuum and low-temperature conditions. Atom tracking is an elegant approach to compensate for thermal drift and to position the microscope tip with highest precision. Here, we present a flexible drift compensation system which can easily be connected to existing SPM hardware. Furthermore, we describe a 3D data acquisition and position correction protocol, which is capable of handling large and non-linear drift as typically present in room temperature measurements. This protocol is based on atom-tracking for precise positioning of the tip and we are able to acquire dense 3D data sets over several hours at room temperature. The performance of the protocol is demonstrated by presenting 3D data taken on a CaCO(3)(10 ?14) surface with the data density being as large as 85×85×500 pixel.