In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is O(Kr(m+n log n)), which is also the best-known complexity to solve this problem. The worst-case memory complexity is O(Kn), which improves the existing algorithms. Finally, com...

We study a continuous time Bayesian quickest detection problem in which observation times are a scarce resource. The agent, limited to making a finite number of discrete observations, must adaptively decide his observation strategy to minimize detection delay and the probability of false alarm. Under two different models of observation rights, we establish the existence of optimal strategies, a...

1 CSE Department. Hong Kong UST, [email protected] 2 CE Department. Sharif University of Technology, [email protected] 1 CSE Department. Hong Kong UST, [email protected] Abstract Dynamic Flows were introduced by Ford and Fulkerson in 1958 to model flows over time. They differ from standard network flows by defining edge capacities to be the total amount of flow that can enter an edge in one...

Pulse oximetry may be useful during neonatal resuscitation. A randomised crossover study was performed to determine the most efficient method of applying the sensor. Applying it to the infant before connecting to the oximeter resulted in quickest acquisition of accurate heart rate. This technique should be preferred during resuscitation.