Is team training in briefings for surgical teams feasible in simulation?

We developed a module for surgical team training using briefings in simulated crisis scenarios and here we report preliminary findings. Nine surgical teams (34 trainees) participated in a pre-training simulation, followed by an interactive workshop on briefing and checklists, and then a post-training simulation. Both technical and non-technical skills were assessed via observation during simulations by expert trainers who provided feedback on performances at the end of simulation. Trainees also reported their attitudes to briefings and evaluated the training. Pre-training attitudes to briefing were positive, some of which improved post-training and trainees’ evaluation of the training was positive. Surgeons’ technical skill improved significantly post-training, but their decision-making skill was rated lower than other non-technical skills, compared to other trainees. The training did not appear to greatly improve non-technical skill performance. Training surgical teams in simulation is feasible but much more work is needed on measurement development and training strategy to confirm its efficacy and utility.     

Instrument-Specific Harmonic Atoms for Mid-Level Music Representation

Several studies have pointed out the need for accurate mid-level representations of music signals for information retrieval and signal processing purposes. In this paper, we propose a new mid-level representation based on the decomposition of a signal into a small number of sound atoms or molecules bearing explicit musical instrument labels. Each atom is a sum of windowed harmonic sinusoidal partials whose relative amplitudes are specific to one instrument, and each molecule consists of several atoms from the same instrument spanning successive time windows. We design efficient algorithms to extract the most prominent atoms or molecules and investigate several applications of this representation, including polyphonic instrument recognition and music visualization.     

The effects of container size, frequency and extended horizontal reach on maximum acceptable weights of lifting for female industrial workers

In the development of our present manual materials handling (MMH) guidelines (Snook, S.H., Ciriello, V.M., 1991. The design of manual tasks: revised tables of maximum acceptable weights and forces. Ergonomics 34, 1197-1213), the assumption was made that the effects of frequency on maximum acceptable weights (MAWs) of lifting with a large box (hand distance, 38 cm from chest) were similar to that of lifting with a small box (hand distance, 17 cm from chest). The first purpose of the present experiment was to investigate this assumption with female industrial workers. The second purpose was to study the effects of extended horizontal reach lifting (hand distance, 44.6 cm from chest) on MAWs as a confirmation of the results of a previous studies on this variable with males (Ciriello, V.M., Snook, S.H., Hughes, G.J., 1993. Further studies of psychophysically determined maximum acceptable weights and forces. Hum. Factors 35(1), 175-186; Ciriello, V.M., 2003. The effects of box size, frequency, and extended horizontal reach on maximum acceptable weights of lifting. Int. J. Ind. Ergon. 32, 115-120). Lastly, we studied the effects of high frequency (20 lifts/min) on MAWs of lifting. Ten female industrial workers performed 15 variations of lifting using our psychophysical methodology whereby the subjects were asked to select a workload they could sustain for 8h without "straining themselves or without becoming unusually tired weakened, overheated or out of breath". The results confirmed that MAWs of lifting with the large box was significantly effected by frequency. The frequency factor pattern in this study was similar to the frequency pattern from a previous study using the small box (Ciriello, V.M., Snook, S.H., 1983. A study of size distance height, and frequency effects on manual handling tasks. Hum. Factors 25(5), 473-483) for all fast frequencies down to one lift every 2 min with deviations of 7%, 15%, and 13% for the one lift every 5 and 30 min tasks and the one lift in 8h task, respectively. The effects of lifting with an extended horizontal reach decreased MAW 22% and 18% for the mid and center lift and the effects of the 20 lifts/min frequency resulted in a MAW that was 47% of a 1 lift/min MAW. Incorporating these results in future guidelines should improve the design of MMH tasks for female workers.     

Snap-stabilization and PIF in tree networks

The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h ²) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic algorithm from O(h ²) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states. WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular, infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the specification of the problem. The correctness proofs conform to this basic property.     

Efficient and robust shot change detection

In this article, we deal with the problem of shot change detection which is of primary importance when trying to segment and abstract video sequences. Contrary to recent experiments, our aim is to elaborate a robust but very efficient (real-time even with uncompressed data) method to deal with the remaining problems related to shot change detection: illumination changes, context and data independency, and parameter settings. To do so, we have considered some adaptive threshold and derivative measures in a hue-saturation colour space. We illustrate our robust and efficient method by some experiments on news and football broadcast video sequences.

Anatomical structure modeling from medical images

Some clinical applications, such as surgical planning, require volumetric models of anatomical structures represented as a set of tetrahedra. A practical method of constructing anatomical models from medical images is presented. The method starts with a set of contours segmented from the medical images by a clinician and produces a model that has high fidelity with the contours. Unlike most modeling methods, the contours are not restricted to lie on parallel planes. The main steps are a 3D Delaunay tetrahedralization, culling of non-object tetrahedra, and refinement of the tetrahedral mesh. The result is a high-quality set of tetrahedra whose surface points are guaranteed to match the original contours. The key is to use the distance map and bit volume structures that were created along with the contours. The method is demonstrated on computed tomography, MRI and 3D ultrasound data. Models of 170,000 tetrahedra are constructed on a standard workstation in approximately 10s. A comparison with related methods is also provided.     

An efficient and generic extension to ITK to process arbitrary shaped regions of interest

The paper describes a software method to extend ITK (Insight ToolKit, supported by the National Library of Medicine), leading to ITK++. This method, which is based on the extension of the iterator design pattern, allows the processing of regions of interest with arbitrary shapes, without modifying the existing ITK code. We experimentally evaluate this work by considering the practical case of the liver vessel segmentation from CT-scan images, where it is pertinent to constrain processings to the liver area. Experimental results clearly prove the interest of this work: for instance, the anisotropic filtering of this area is performed in only 16 s with our proposed solution, while it takes 52 s using the native ITK framework. A major advantage of this method is that only add-ons are performed: this facilitates the further evaluation of ITK++ while preserving the native ITK framework.     

Justification for inclusion dependency normal form

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. In this paper, we address the issue of normalization in the presence of FDs and INDs and, in particular, the semantic justification for an inclusion dependency normal form (IDNF), which combines the Boyce-Codd normal form with the restriction on the INDs that they be noncircular and key-based. We motivate and formalize three goals of database design in the presence of FDs and INDs: noninteraction between FDs and INDs, elimination of redundancy and update anomalies, and preservation of entity integrity. We show that (as for FDs), in the presence of INDs, being free of redundancy is equivalent to being free of update anomalies. Then, for each of these properties, we derive equivalent syntactic conditions on the database design. Individually, each of these syntactic conditions is weaker than IDNF and the restriction that an FD is not embedded in the right-hand side of an IND is common to three of the conditions. However, we also show that, for these three goals of database design to be satisfied simultaneously, IDNF is both a necessary and a sufficient condition