Snowboard traumatology: an epidemiological study

OBJECTIVE: To estimate the frequency of perioperative morbidities in patients who underwent anesthesia and a surgical procedure with no preoperative laboratory testing. MATERIAL AND METHODS: We conducted an electronic database search of medical records of 56,119 patients who underwent surgical or diagnostic procedures and anesthesia at Mayo Clinic Rochester in 1994 and found 5,120 who had no laboratory tests done within 90 days before the procedure. From this group, we randomly selected 1,044 patients (87 from each month) to document the absence of preoperative tests, the presence of preexisting disease (by organ system), the type of anesthetic agent, and the outcomes and tests intraoperatively and postoperatively. RESULTS: The 1,044 patients ranged in age from 0 to 95 years (median age, 21). No deaths or major perioperative morbidities occurred (0.0%; exact 95% confidence interval, 0.00 to 0.35%). Although 10 patients underwent blood typing and screening for antibodies immediately preoperatively, no blood transfusions were necessary. Intraoperatively, 17 laboratory tests and 1 electrocardiogram were obtained, and 3 results were abnormal. Postoperatively, 42 blood tests and 2 electrocardiographic procedures were performed. Five of the 42 blood tests showed abnormal results (hemoglobin levels in 3, serum sodium in 1, and arterial blood gases in 1). One electrocardiogram showed normal findings, and the other revealed normal results except for premature ventricular contractions. No laboratory test done intraoperatively or postoperatively was found to change surgical or medical management substantially. One patient who had unanticipated blood loss during an outpatient procedure was admitted to the hospital for observation. CONCLUSION: All 1,044 patients, 97% of whom were relatively healthy, with no recent laboratory testing safely underwent anesthesia and an operation. We conclude that patients who have been assessed by history and physical examination and determined to have no preoperative indication for laboratory tests can safely undergo anesthesia and operation with tests obtained only as indicated intraoperatively and post-operatively. Current anesthetic and medical practices rapidly identify perioperative indications for laboratory evaluation as they arise.     

Evaluating the impact of CASE: an empirical comparison of retrospective and cross-sectional survey approaches

The purpose of this paper is to evaluate two methods of assessing the productivity and quality impact of Computer Aided Software Engineering (CASE) and Fourth Generation Language (4GL) technologies: (1) by the retrospective method; and (2) the cross-sectional method. Both methods involve the use of questionnaire surveys. Developers' perceptions depend on the context in which they are expressed and this includes expectations about the effectiveness of a given software product. Consequently, it is generally not reliable to base inferences about the relative merits of CASE and 4GLs on a cross-sectional comparison of two separate samples of users. The retrospective method that requires each respondent to directly compare different products is shown to be more reliable. However, there may be scope to employ cross-sectional comparisons of the findings from different samples where both sets of respondents use the same reference point for their judgements, and where numerical rather than verbal rating scales are used to measure perceptions.     

Conditions for reliable dewatering systems based on voidless drainage in slightly permeable soils

Conclusions 1. Use of dewatering systems based on voidless drainage is most effective when dewatering slightly permeable soils in regions with a deep seasonal frost. 2. Two-story drainage with the upper and lower stories spaced 30 m apart accelerates the discharge of gravitational water from the arable layer. Results of observations on two-story drainage in experimental-production sections indicated that it discharges 2 – 3.8 times more water than systematic tubular drainage with an interdrain spacing of 10 m and a 0.2-m thick three-dimensional filter of a sandy-gravelly mixture. 3. It is recommended to use crushed stone and porous-clay gravel with a fineness of 10 – 20 mm as a filler. In that case, protection of the drain filler is, as a rule, required only from the intrusion of soil from above during construction in cohesive soils with a plasticity indexW _p≥7. 4. seepage rate in a voidless drain should be lower than the scouring velocity for the soil in which the voidless drainage is placed. In the opposite case, it is necessary to lower the grade of the drains or select a filler gradation such that the seepage rate in the drain be lower than the scouring velocity. Translated from Gidrotekhnicheskoe Stroitel’stvo, No. 8, pp. 41–43, August, 1998.     

Self and mutual admittance of slot antennas on a dielectric half-space

In this paper, an efficient implementation of the spectral domain moment technique is presented for computing the self and mutual coupling between slot antennas on a dielectric half-space. It is demonstrated that by the proper selection of the weighting functions in the method of moments, the analytic evaluation or simplification of the transverse moment integrals is enabled. This results into a significant reduction of the required computational labor. The method is then utilized in order to provide design data for the self and mutual admittances between two slot antennas on a dielectric substrate lens in the case of fused quartz (∈ _r =3.80), crystal quartz (∈ _r =4.53), silicon (∈ _r =11.9) and GaAs (∈ _r =12.8). The presented technique and associated results are useful when designing twin slot quasi-optical receivers, imaging arrays, phased arrays or power-combining arrays of slot elements at millimeter-wave frequencies.     

Presupposition failure — A comedy of errors

Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not. We first study presupposition in a very simple framework of updating propositional information, with examples of how presuppositions of complex propositional updates can be calculated. Next we move on to presuppositions and quantification, in the context of a dynamic version of predicate logic, suitably modified to allow for presupposition failure. In both the propositional and the quantificational case, presupposition failure can be viewed as error abortion of procedures. Thus, a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition.     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols     

Unstructured tree search on SIMD parallel computers

We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer