PURPOSE: To compare the accuracy of detection of artificial spine fractures with helical computed tomography (CT) versus conventional CT. MATERIALS AND METHODS: Twenty-six motion segments from 15 human cadaver thoracolumbar spines were imaged with helical and conventional CT both before and after fractures were artificially induced. The vertebrae were scanned with different collimations, reconstruction indexes, and exposure doses. A total of 900 images were analyzed by four radiologists, and a receiver operating characteristic (ROC) analysis was performed. RESULTS: ROC analysis showed a large area under the curve for conventional CT (0.913) than for helical CT (0.844) when 3-mm collimation was used. The ability to detect fractures with helical CT increased when collimation was decreased and exposure dose was increased. CONCLUSION: Conventional CT allows more accurate detection of artificial spine fractures than does helical CT. Helical CT requires thinner collimation for fracture detection comparable with...
Knowledge workers face an ever increasing flood of informa- tion in their daily lives. To counter this and provide better support for information management and knowledge work in general, we have been investigating solutions inspired by human forgetting since 2013. These solutions are based on Semantic Desktop (SD) and Managed Forgetting(MF) technology. A key concept of the latter is the so-called Memory Buoyancy (MB), which is intended to represent an information item’s current value for the user and allows to employ forgetting mechanisms. The SD thus continuously performs information value assessment up- dating MB and triggering respective MF measures. We extended an SD- based organizational memory system, which we have been using in daily work for over seven years now, with MF mechanisms directly embedding them in daily activities, too, and enabling us to test and optimize them in real-world scenarios. In this paper, we first present our initial version of MB and discuss success and failure stories we have been experiencing with it during three years of practical usage. We learned from cognitive psychology that our previous research on context can be beneficial for MF. Thus, we created an advanced MB version especially taking user context, and in particular context switches, into account. These enhancements as well as a first prototypical implementation are presented, too.
1 January 2004 in Methods of Information in Medicine
Objectives: Individual matching is frequently used in observational studies. Its main purpose lies in efficiency of study conduct and parameter estimation. Ideally, an individually matched index subject differs from the reference subject(s) only by the factor(s) of interest. Matching is used to select comparable subgroups on which further data analysis can then concentrate. Finding optimal subsets is then a closed problem, which may include a lot of guesswork. It is a task that begs an algorithmic solution that can be obtained automatically. Methods: The problem can be formalized as a minimization of a global loss function that summarizes the deviation from perfect agreement over different variables. Through the representation by a network formed by a bipartite graph of index and reference subjects, one can obtain a solution by finding a minimum cost flow in a certain network. We have implemented a Web-based application using the efficient CS2 algorithm. Results: Variations of the individual matching procedures that have been implemented comprise 1:N matching and matching with a variable number of controls. The user can upload own data, view the proposed result in a list and finally download the matching plan. Representation of quality of individual matches as background colors allows rapid checks for overall matching accuracy. Conclusions: The computer-assisted variation reduces the human interaction to the tuning of a few parameters, rather than individual decisions on forming separate matches. This not only saves a lot of work but also simplifies communicating the matching process. The program addresses a general class of matching problems. The use of this tool for special cases of matching, as caliper matching or exact category matching, is highlighted.