Gastrointestinal lavage reduces total body water

BACKGROUND: The aim of this study was to measure changes in total body water (TBW) in surgical patients after gastrointestinal lavage. METHODS: In a prospective, controlled study we used bioelectrical impedance to calculate the change in TBW in two groups of general surgical patients in the pre-operative period: the colonic lavage group consisted of patients fasted overnight who received 3 L of gastrointestinal lavage solution (GLS; n = 30), and the control group consisted of patients fasted overnight only (n = 30). Total body water was measured before and after either lavage and fasting (lavage group) or fasting alone (control group). RESULTS: The lavage group had a mean TBW loss of 729 mL +/- s.e. 217 and the control group a mean loss of 84 mL +/- s.e. 93 (P < 0.01 unpaired t-test). CONCLUSIONS: The results suggest that GLS results in a net loss of TBW. Although this fluid loss is modest, it may be important in surgical patients who have minimal cardiovascular reserve.     

Evidence for McKusick''s hypothesis of deficient collagen cross-linking in patients with homocystinuria

Fractionation of the venom of the spider Phoneutria nigriventer revealed that it was a mixture of several neurotoxic peptides. The peptides so far characterized either inhibited or induced neurotransmitter release. These effects were mediated by Ca2+ channels or increasing Na+ permeability through voltage sensitive Na(+)-channels, respectively. The pooled toxic components (fraction P4) showed stimulatory effects on acetylcholine release from brain cortical slices. In addition, a component of the observed effects resembling that of alpha-latrotoxin was identified, which was characterized by the ability to provoke release of acetylcholine (ACh) at low temperature and in a manner independent of extracellular Ca2+ and of voltage sensitive Na(+)-channels.     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.