Internal working papers DIUF

Internal working papers DIUF
The DIUF Working Papers collection is a series of research papers edited by the Department of Informatics of the University of Fribourg (Switzerland). This series exists since 1958, and is available in its entirety in electronic form since 2015. The content of the publications fits into the research themes of informatics, operational research and statistics.
The collection has been published under the names of the Institute of Automation (IAUF) from 1958 to 1995, the Laboratory of Informatics (LIUF) from 1986 to 1995, and the Institute of Informatics (IIUF) from 1995 to 2000.

Refine my results

Institution

Language

Université de Fribourg

Gesturing on the steering wheel, a comparison with speech and touch interaction modalities

Angelini, Leonardo ; Baumgartner, Jürgen ; Carrino, Francisco ; Carrino, Stefano ; Caon, Maurizio ; Abou Khaled, Omar ; Sauer, Jürgen ; Lalanne, Denis ; Mugellini, Elena ; Sonderegger, Andreas

(Internal working papers DIUF ; 15-03)

This paper compares an emergent interaction modality for the In-Vehicle Infotainment System (IVIS), i.e., gesturing on the steering wheel, with two more popular modalities in modern cars: touch and speech. We conducted a betweensubjects experiment with 20 participants for each modality to assess the interaction performance with the IVIS and the impact on the driving performance. Moreover, we...

Université de Fribourg

The no-wait job shop with regular objective : a method based on optimal job insertion

Gröflin, Heinz ; Bürgy, Reinhard

(Internal working papers DIUF ; 15-02)

The no-wait job shop problem (NWJS-R) considered here is a version of the job shop scheduling problem where, for any two operations of a job, a fixed time lag between their starting times is prescribed. Also, sequence-dependent set-up times between consecutive operations on a machine can be present. The problem consists in finding a schedule that minimizes a general regular objective function. We...

Université de Fribourg

Complementing Büchi automata with a subset-tuple construction

Allred, Joel ; Ultes-Nitsche, Ulrich

(Internal working papers DIUF ; 15-01)

Complementation of Büchi automata is well known for being difficult. In the worst case, a state-space growth of (0:76n)n is unavoidable. Recent studies suggest that “simpler” algorithms perform better than more involved ones on practical cases. In this paper, we present a simple “direct” algorithm for complementing Büchi automata. It involves a structured subset construction (using...