Comparison of different radiography systems in an experimental study for detection of forearm fractures and evaluation of the Müller-AO and Frykman classification for distal radius fractures

OBJECTIVES: We sought to compare the diagnostic performance of screen-film radiography, storage-phosphor radiography, and a flat-panel detector system in detecting forearm fractures and to classify distal radius fractures according to the Müller-AO and Frykman classifications compared with the true extent, depicted by anatomic preparation. MATERIALS AND METHODS: A total of 71 cadaver arms were fractured in a material testing machine creating different fractures of the radius and ulna as well as of the carpal bones. Radiographs of the complete forearm were evaluated by 3 radiologists, and anatomic preparation was used as standard of reference in a receiver operating curve analysis. RESULTS: The highest diagnostic performance was obtained for the detection of distal radius fractures with area under the receiver operating curve (AUC) values of 0.959 for screen-film radiography, 0.966 for storage-phosphor radiography, and 0.971 for the flat-panel detector system (P > 0.05). Exact classification was slightly better for the Frykman (kappa values of 0.457-0.478) compared with the Müller-AO classification (kappa values of 0.404-0.447), but agreement can be considered as moderate for both classifications. CONCLUSIONS: The 3 imaging systems showed a comparable diagnostic performance in detecting forearm fractures. A high diagnostic performance was demonstrated for distal radius fractures and conventional radiography can be routinely performed for fracture detection. However, compared with anatomic preparation, depiction of the true extent of distal radius fractures was limited and the severity of distal radius fractures tends to be underestimated.

Scheduling in service systems: an application in the event-tourism industry

This paper deals with an event-bus tour booked by Bollywood film fans. During the tour, the participants visit selected locations of famous Bollywood films at various sites in Switzerland. Moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour; for organizational reasons, two or more buses cannot stay at the same location simultaneously. The planning problem is how to compute a feasible schedule for each bus such that the total waiting time (primary objective) and the total travel time (secondary objective) are minimized. We formulate this problem as a mixed-integer linear program, and we report on computational results obtained with the Gurobi solver.