Background and Objective: Anesthesiologists need to be familiar with perioperative changes in blood volume (BV); however, there is no standard method for repeated evaluation of BV over a short interval of time. We evaluated BV in the operation room using repeatable estimation methods. Method: Eighty-five ASA physical status I-II patients scheduled to undergo endoscopic urosurgery using irrigati...

This study tested the hypothesis that age-related postural control deficits are more clearly detected from force plate recordings when using postural control tasks with an explicitly defined goal as opposed to the frequently used quiet stance task. Eighteen older adults (over 65) and seventeen younger adults (under 30) stood on a force plate with visual feedback (VFB) of the center of pressure ...

There is no general consensus regarding which accelerometer cut-off point (CoP) is most acceptable to estimate the time spent in moderate-to-vigorous physical activity (MVPA) in children and choice of an appropriate CoP primarily remains a subjective decision. Therefore, this study aimed to analyze the influence of CoP selection on the mean MVPA and to define the optimal thresholds of MVPA deri...

The aim of this study was to investigate whether the interstitial colloid osmotic pressure (COP(i)) of peritoneum is of importance for peritoneal fluid reabsorption during peritoneal dialysis (PD). For testing this hypothesis, a method to isolate interstitial fluid from the peritoneal membrane and to measure the interstitial COP(i) in the normal peritoneum and directly after the initiation of P...

We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all c < 1 that almost all random graphs are stalemate for the cop and killer game, where each edge occurs with probability p such that 1 nc ≤ p ≤ 1 − 1 nc . We prove that a g...

We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for the cop in this problem depends only on the robber’s speed. We investigate the problem of finding the minimal robber’s speed which prevents the cop from winning. For this parameter we give tight bounds in terms of the li...