Institution
University of Mannheim
Education•Mannheim, Germany•
About: University of Mannheim is a education organization based out in Mannheim, Germany. It is known for research contribution in the topics: Context (language use) & Politics. The organization has 4448 authors who have published 12918 publications receiving 446557 citations. The organization is also known as: Uni Mannheim & UMA.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: The Survey of Health, Ageing and Retirement in Europe (SHARE) as discussed by the authors is a baseline study that collects data on individual life circumstances of about 27,000 persons aged 50 and over in 11 European countries, ranging from Scandinavia across Western and Central Europe to the Mediterranean.
Abstract: This paper introduces the 'Survey of Health, Ageing and Retirement in Europe' (SHARE). The 2004 baseline study collects data on the individual life circumstances of about 27,000 persons aged 50 and over in 11 European countries, ranging from Scandinavia across Western and Central Europe to the Mediterranean. SHARE has made great efforts to deliver truly comparable data, so we can reliably study how differences in cultures, living conditions and policy approaches shape the life of Europeans just before and after retirement. We present first results from the three main research areas covered by SHARE, namely economics, sociology, and health. SHARE provides an infrastructure to help researchers better understand the individual and population ageing process: where we are, where we are heading to, and how we can influence the quality of life as we age – both as individuals and as societies.
228 citations
••
TL;DR: In this article, a diary study was conducted to examine the moderating effects of recovery efforts at work and detachment from work on the relationship between work-related flow and energy after work.
Abstract: In this diary study, we aimed to examine the moderating effects of the following: (i) recovery efforts at work and (ii) detachment from work on the relationship between work-related flow and energy after work. Specifically, we hypothesized that flow would be beneficial for energy after work when employees failed (versus managed) to recover during work breaks. Additionally, we predicted that when employees experience flow at work, they would be more vigorous (and less exhausted) at the end of the day when they detached from work in the evening compared with days when they failed to detach. The study tracked 83 participants who completed daily surveys over four consecutive days. Results of multilevel analyses indicated that some characteristics of flow, such as absorption and enjoyment, were significantly associated with energy after work. Recovery at work and detachment from work moderated the relationship between flow (specifically the enjoyment component) and after-work energy.
227 citations
••
01 Feb 1997TL;DR: The theoretic framework and applications of automatic audio content analysis, including analysis of amplitude, frequency and pitch, and simulations of human audio perception, are described.
Abstract: This paper describes the theoretic framework and applications of automatic audio content analysis. Research in multimedia content analysis has so far concentrated on the video domain. We demonstrate the strength of automatic audio content analysis. We explain the algorithms we use, including analysis of amplitude, frequency and pitch, and simulations of human audio perception. These algorithms serve us as tools for further audio content analysis. We use these tools in applications like the segmentation of audio data streams into logical units for further processing, the analysis of music, as well as the recognition of sounds indicative of violence like shots, explosions and cries.
227 citations
••
12 Dec 2002TL;DR: This paper gives a tour of Natix, a database management system designed from scratch for storing and processing XML data, showing how to design and optimize areas such as storage, transaction management - comprising recovery and multi-user synchronization - as well as query processing for XML.
Abstract: Several alternatives to manage large XML document collections exist, ranging from file systems over relational or other database systems to specifically tailored XML base management systems. In this paper we give a tour of Natix, a database management system designed from scratch for storing and processing XML data. Contrary to the common belief that management of XML data is just another application for traditional databases like relational systems, we illustrate how almost every component in a database system is affected in terms of adequacy and performance. We show how to design and optimize areas such as storage, transaction management - comprising recovery and multi-user synchronization - as well as query processing for XML.
227 citations
••
TL;DR: A model checking algorithm for verifying whether a concurrent probabilistic process satisfies a PBTL formula assuming fairness constraints is presented and adaptations of existing model checking algorithms for pCTL to obtain procedures for PBTL under fairness constraints are proposed.
Abstract: We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow non-deterministic choice between probability distributions. These systems can be decomposed into a collection of "computation trees" which arise by resolving the non-deterministic, but not probabilistic, choices. The presence of non-determinism means that certain liveness properties cannot be established unless fairness is assumed. We introduce a probabilistic branching time logic PBTL, based on the logic TPCTL of Hansson [30] and the logic PCTL of [55], resp. pCTL of [14]. The formulas of the logic express properties such as "every request is eventually granted with probability at least p". We give three interpretations for PBTL on concurrent probabilistic processes: the first is standard, while in the remaining two interpretations the branching time quantifiers are taken to range over a certain kind of fair computation trees. We then present a model checking algorithm for verifying whether a concurrent probabilistic process satisfies a PBTL formula assuming fairness constraints. We also propose adaptations of existing model checking algorithms for pCTL* [4, 14] to obtain procedures for PBTL* under fairness constraints. The techniques developed in this paper have applications in automatic verification of randomized distributed systems.
227 citations
Authors
Showing all 4522 results
Name | H-index | Papers | Citations |
---|---|---|---|
Andreas Kugel | 128 | 910 | 75529 |
Jürgen Rehm | 126 | 1132 | 116037 |
Norbert Schwarz | 117 | 488 | 71008 |
Andreas Hochhaus | 117 | 923 | 68685 |
Barry Eichengreen | 116 | 949 | 51073 |
Herta Flor | 112 | 638 | 48175 |
Eberhard Ritz | 111 | 1109 | 61530 |
Marcella Rietschel | 110 | 765 | 65547 |
Andreas Meyer-Lindenberg | 107 | 534 | 44592 |
Daniel Cremers | 99 | 655 | 44957 |
Thomas Brox | 99 | 329 | 94431 |
Miles Hewstone | 88 | 418 | 26350 |
Tobias Banaschewski | 85 | 692 | 31686 |
Andreas Herrmann | 82 | 761 | 25274 |
Axel Dreher | 78 | 350 | 20081 |