Although manipulation under anesthesia (MUA) has been considered effective first-line treatment for stiff total knee arthroplasty (TKA), there is no consensus regarding the usefulness of repeated MUA. The purpose of this study was to investigate the usefulness of repeated MUA performed for patients in whom satisfactory range of motion (ROM) was not achieved by MUA. The authors retrospectively r...

BACKGROUND Long commutes by car are stressful. Most research studying health effects of commuting have summarized cross-sectional data for large regions. This study investigated whether the levels of stress and individual characteristics among 30-60 min car commuters were similar across different places within the county of Scania, Sweden, and if there were changes over time. METHODS The stud...

In the design of a randomized clinical trial with one pre and multiple post randomized assessments of the outcome variable, one needs to account for the repeated measures in determining the appropriate sample size. Unfortunately, one seldom has a good estimate of the variance of the outcome measure, let alone the correlations among the measurements over time. We show how sample sizes can be cal...

OBJECTIVES The objective of this investigation was to define for the first time the cardiorenal and humoral actions of repeated short-term administration of subcutaneous (SQ) brain natriuretic peptide (BNP) administration during the evolution of experimental heart failure. BACKGROUND The rationale of this study was based on BNP as a vasodilating, natriuretic, renin-inhibiting and lusitropic p...

We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More pre...

We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More pre...