We describe the process of introducing RFID technology in the trauma bay of a trauma center to support fast-paced and complex teamwork during resuscitation. We analyzed trauma resuscitation tasks, photographs of medical tools, and videos of simulated resuscitations to gain insight into resuscitation tasks, work practices and procedures. Based on these data, we discuss strategies for placing RFI...

An important goal of the design of WDM (wavelength division multiplexing) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at ...

Multifunctional structures are a potentially disruptive technology that allows for significant mass savings on spacecraft. The specific concept addressed herein is that of a multifunctional power structure. In this paper, a parametric optimisation of the design of such a structure that uses commercially available battery cells is presented. Using numerical modelling, it was found that there exi...

To improve the scalability of the Web it is common practice to apply caching and replication techniques. Numerous strategies for placing and maintaining multiple copies of Web documents at several sites have been proposed. These approaches essentially apply a global strategy by which a single family of protocols is used to choose replication sites and keep copies mutually consistent. We propose...

We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be NP-hard, so most recent research has focused on heuristics and approximation methods. We evaluate our heuristics through experimentation, comparing the upper bounds on the optimal guard number given by our methods with com...

We consider the problem of optimally placing identical resources at the nodes of a weighted tree-shaped network of size N. The resources satisfy requests issued from the nodes of the network. The cost of a placement of the resources is the sum over all nodes of the network of the product of the node weight times the distance from the closest resource. The static problem consists in determining ...

This paper presents several results on the weighted region optimal path problem. An often-used approach to approximately solve this problem is to apply a discrete search algorithm to a graph G2 generated by a discretization of the problem; this graph guarantees to contain an 2-approximation of an optimal path between given source and destination points. We first provide a discretization scheme ...