Institution
University of Paderborn
Education•Paderborn, Nordrhein-Westfalen, Germany•
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.
Papers published on a yearly basis
Papers
More filters
••
94 citations
••
TL;DR: In this article, the authors analyzed the determinants of individual absenteeism focusing on the "strictness" of employment protection and the "generosity" of sickness benefits and found that the impact of the institutional framework is smaller than that of some individual worker characteristics.
Abstract: In this article, we analyze the determinants of individual absenteeism focusing on the “strictness” of employment protection and the “generosity” of sickness benefits. The data come from the “European Survey on Working Conditions” launched in 2000. Due to its coverage (the EU-14), the data enable us to identify the relative importance of the institutional framework for explaining differences in absence behavior across nations. Our results reveal that, first, employment protection does not influence the number of absence days while sickness benefits increase absenteeism. And, second, the impact of the institutional framework is smaller than that of some individual worker characteristics.
94 citations
••
TL;DR: The findings reveal a surprisingly sharp threshold behaviour for certain graphs, e.g., the d-dimensional torus with d>2 and hypercubes: there is a value T such that the speed-up is approximately min{T,k} for any 1=2, and the bounds are tight up to logarithmic factors.
94 citations
••
TL;DR: In this article, the authors compare the propagation paths predicted by two different criteria for three-point bending experiments performed on PMMA and conclude that the global criterion gives better results than the local type criterion.
Abstract: Whatever the external loading, a crack front in a solid tries to reach mode I loading conditions after propagation. In mode I + II, the crack kinks to annihilate mode II, kinking angle being well predicted by the principle of local symmetry (PLS) or by the maximum tangential stress criterion (MTS). In presence of mode III, the problem becomes three-dimensional and the proposed propagation criterion are not yet well proved and established. In particular in three point bending experiments (3PB) with an initially inclined crack, the crack twists around the direction of propagation to finally reach a situation of pure mode I. The aim of the paper is to compare the propagation paths predicted by two different criteria for 3PB fatigue experiments performed on PMMA. The first criterion developed by Schollmann et al. (Int J Fract 117(2):129–141, 2002), is a three-dimensional extension of the MTS criterion and predicts the local angles that annihilates mode II and III at each point of the front. The second one developed by Lazarus et al. (J Mech Phys Solids 49(7):1421–1443, 2001b), predicts an abrupt and then progressive twisting of the front to annihilate mode III. Due to presence of sign changing mode II and almost uniform mode III in the experiments, both criteria give good results. However, since mode III is predominant over mode II in the case under consideration, the global criterion gives better results. Nevertheless, the local type criterion seems to be of greater universality for practical engineering applications.
94 citations
••
TL;DR: Algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM) using several (two or three) hash functions to distribute the shared memory among the memory modules of the PRAM are presented.
Abstract: We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM). In a PRAM, memory conflicts occur only through concurrent access to the same cell, whereas the memory of a DMM is divided into modules, one for each processor, and concurrent accesses to the same module create a conflict. Thedelay of a simulation is the time needed to simulate a parallel memory access of the PRAM. Any general simulation of anm processor PRAM on ann processor DMM will necessarily have delay at leastm/n. A randomized simulation is calledtime-processor optimal if the delay isO(m/n) with high probability. Using a novel simulation scheme based on hashing we obtain a time-processor optimal simulation with delayO(log log(n) log*(n)). The best previous simulations use a simpler scheme based on hashing and have much larger delay: Θ (log(n)/log log(n)) for the simulation of an n processor PRAM on ann processor DMM, and Θ(log(n)) in the case where the simulation is time-processor optimal. Our simulations use several (two or three) hash functions to distribute the shared memory among the memory modules of the PRAM. The stochastic processes modeling the behavior of our algorithms and their analyses based on powerful classes of universal hash functions may be of independent interest.
94 citations
Authors
Showing all 6872 results
Name | H-index | Papers | Citations |
---|---|---|---|
Martin Karplus | 163 | 831 | 138492 |
Marco Dorigo | 105 | 657 | 91418 |
Robert W. Boyd | 98 | 1161 | 37321 |
Thomas Heine | 84 | 423 | 24210 |
Satoru Miyano | 84 | 811 | 38723 |
Wen-Xiu Ma | 83 | 420 | 20702 |
Jörg Neugebauer | 81 | 491 | 30909 |
Thomas Lengauer | 80 | 477 | 34430 |
Gotthard Seifert | 80 | 445 | 26136 |
Reshef Tenne | 74 | 529 | 24717 |
Tim Meyer | 74 | 548 | 24784 |
Qiang Cui | 71 | 292 | 20655 |
Thomas Frauenheim | 70 | 451 | 17887 |
Walter Richtering | 67 | 332 | 14866 |
Marcus Elstner | 67 | 209 | 18960 |