The lexicographic flow problem is a flow problem in which the edges are assigned priorities, and we wish to find a flow that is lexicographically maximum with respect to the priority assignment. The problem is reducible to a weighted flow problem, but we show that exponentially large weights are necessary in general. We then give an efficient direct algorithm that does not use weights.

BACKGROUND AND PURPOSE Traditionally, rehabilitation programs emphasize training balance under single-task conditions to improve balance and reduce risk for falls. The purpose of this case report is to describe 3 balance training approaches in older adults with impaired balance. CASE DESCRIPTIONS Three patients were randomly assigned to 1 of 3 interventions: (1) single-task balance training, ...

Both congestion control and Quality of Service (QoS) are important quality attributes in computer networks. Specifically, for the future Internet architecture known as Named Data Networking (NDN), solutions using hop-by-hop interest shaping have shown to cope with the traffic congestion issue. Ad-hoc techniques for implementing QoS in NDN have been proposed. In this paper, we propose a new QoS ...

Analysis provided for fixed priority pre-emptive scheduling enables a priori guarantees to be given regarding the timing requirements of critical tasks. By comparison, Best-Effort scheduling maximises system utility, but at best provides only probabilistic guarantees that time constraints will be met. In this paper, we show how these two schemes can be integrated. A new Adaptive Value-Density T...

BACKGROUND As no health system can afford to provide all possible services and treatments for the people it serves, each system must set priorities. Priority setting decision makers are increasingly involving the public in policy making. This study focuses on public engagement in a key priority setting context that plagues every health system around the world: wait list management. The purpose ...

................................................................................... 1 1. THE CONTEXT OF PUBLIC SECTOR REFORM......................... 2 1a. Components of Public Sector Reform.................................. 5 2. DEFINING ACCOUNTABILITY.................................................... 6 3. ACCOUNTABILITY OUTCOMES ASSOCIATED WITH NEW COMPUTERISED INFORMATION SYSTEMS.............

A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle i...

We propose a novel algorithm for the capacitated passenger assignment problem in public transportation where priority lists define the order in which passengers are assigned. The originality of our approach is to define the priority rules exogenously. Separating explicitly theses rules from the assignment procedure allows for a great deal of flexibility to model various priority rules. Computat...

Threaded interrupt handling is a common technique used in real-time operating systems since it increases system responsiveness and reduces priority inversions. The PREEMPT RT Linux kernel patch introduces aggressive threaded interrupt handling into the Linux kernel. However, under PREEMPT RT, interrupt handling threads must be assigned a single fixed scheduling priority. This can become a signi...

The advent of multiand many-core processors offers enormous performance potential for parallel tasks that exhibit sufficient intra-task thread-level parallelism. With a growth of novel parallel programming models (e.g., OpenMP, MapReduce), scheduling parallel tasks in the real-time context has received an increasing attention in the recent past. While most studies focused on schedulability anal...