University of Paderborn

About: University of Paderborn is a education organization based out in Paderborn, Nordrhein-Westfalen, Germany. It is known for research contribution in the topics: Control reconfiguration & Software. The organization has 6684 authors who have published 16929 publications receiving 323154 citations.

Are high-performance work practices related to individually perceived stress? A job demands-resources perspective

Abstract: This study investigates the relationship between high-performance work practices (HPWP) and individually perceived stress. Contrary to most past research, which evaluates HPWPs positively, this study emphasizes the potential downside of HPWPs, and suggests that some HPWPs are more strongly associated with enhanced stress than others. Drawing on the job demands-resources model, we differentiate between challenge demand HPWPs (i.e., performance evaluation systems, continuing education) and job resource HPWPs (i.e., flexible working hours, participation in decision-making). We then analyze 197 employees and their work environments, demonstrating that there is a positive relationship between challenge demands and individual stress among employees. Contrary to what we predicted, no empirical evidence indicates that the two analyzed job resources relate negatively to stress.

Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation

Abstract: Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more naturally to some physical implementations, such as linear optics. Numerous authors have considered walks with one or two walkers, on one-dimensional graphs, and several experimental demonstrations have been performed. In this paper, we discuss generalizing the model of discrete time quantum walks to the case of an arbitrary number of walkers acting on arbitrary graph structures. We present a formalism that allows for the analysis of such situations, and several example scenarios for how our techniques can be applied. We consider the most important features of quantum walks—measurement, distinguishability, characterization and the distinction between classical and quantum interference. We also discuss the potential for physical implementation in the context of linear optics, which is of relevance to present-day experiments.

Locally bounded global solutions to a chemotaxis consumption model with singular sensitivity and nonlinear diffusion

Abstract: We show the existence of locally bounded global solutions to the chemotaxis system \[ u_t = abla\cdot(D(u) abla u) - abla\cdot(\frac{u}{v} abla v) \] \[ v_t = \Delta v - uv \] with homogeneous Neumann boundary conditions and suitably regular positive initial data in smooth bounded domains $\Omega \subset \mathbb{R}^N$, $N\geq2$, for $D(u)\geq \delta u^{m-1}$ with some $\delta>0$, provided that $m>1+\frac N4$.

All-neural Online Source Separation, Counting, and Diarization for Meeting Analysis

Abstract: Automatic meeting analysis comprises the tasks of speaker counting, speaker diarization, and the separation of overlapped speech, followed by automatic speech recognition. This all has to be carried out on arbitrarily long sessions and, ideally, in an online or block-online manner. While significant progress has been made on individual tasks, this paper presents for the first time an all-neural approach to simultaneous speaker counting, diarization and source separation. The NN-based estimator operates in a block-online fashion and tracks speakers even if they remain silent for a number of time blocks, thus learning a stable output order for the separated sources. The neural network is recurrent over time as well as over the number of sources. The simulation experiments show that state of the art separation performance is achieved, while at the same time delivering good diarization and source counting results. It even generalizes well to an unseen large number of blocks.