PURPOSE We sought to test the effectiveness and application of a system for prioritizing corneal disease patients for corneal transplantation. METHODS All patients wait-listed for corneal transplantation in British Columbia in April 1995 were followed for 10 months to determine whether they received surgery and to assess the application of recently introduced priority criteria. RESULTS The ...

The paper presents energy efficient routing algorithms based on a novel integrated control plane platform. The centralized control plane structure enables the use of flexible heuristic algorithms for route selection in optical networks. Differentiated routing for various traffic types is used in our previous work. The work presented in this paper further optimizes the energy performance in the ...

Melodic alarms proposed in the IEC 60601-1-8 standard for medical electrical equipment were tested for learnability and discriminability. Thirty-three non-anaesthetist participants learned the alarms over two sessions of practice, with or without mnemonics suggested in the standard. Fewer than 30% of participants could identify the alarms with 100% accuracy at the end of practice. Confusions pe...

The priority inversion problem has been detected two decades ago. The decisive ideas to cope with this problem have been published one decade ago. In the meantime the vendors of operating systems and run–time systems have occupied this topic in providing certain protocols in order to avoid priority inversion. However, at a closer look there are considerable differences in the usage and the resu...

The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted ele...

In this research project the performance of two well-known scheduling policies for Real Time Systems based on fixed priority, namely Enhanced (m,k)-firm Guarantee and Weakly hard scheduling, will be compared in terms of the overall schedulibility of a number of randomly generated task sets . Both methods are based on the common assumptions. A new scheduling alogrithm will then be derived by com...

This paper presents the A ected Set Priority Ceiling Protocols (ASPCP) for concurrency control in real-time object-oriented systems. These protocols are based on a combination of semantic locking and priority ceiling techniques. This paper shows that the ASPCP protocols provide higher potential concurrency for object-oriented systems than existing Priority Ceiling protocols, while still boundin...

In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some perfor...

countries around the world are experiencing an ever-increasing need to make choices in investments in health and healthcare. this makes it incumbent upon them to have formal processes in place to optimize the legitimacy of eventual decisions. there is now growing experience among countries of the implementation of stakeholder participation, and a developing convergence of methods to support dec...