BACKGROUND Although transcatheter aortic valve replacement (TAVR) is an effective treatment for aortic stenosis, long-term mortality after TAVR remains high and challenging to predict. The Kansas City Cardiomyopathy Questionnaire (KCCQ) is a health status measure, assessed directly from patients, that integrates 2 clinically relevant factors (symptoms and functional status) that may predict TAV...

Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays ma...

We develop a simple theory of flows to study the flow of data in real-time computing networks. Flow Theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows: smooth and uniform, and eight types of flow operators. We prove that, if the input flow to any of these operators is smooth or u...

With Weighted Fair Queuing, the link’s bandwidth is distributed among competing flows proportionally to their weights. In this paper we propose an extension of the DCF function of IEEE 802.11 to provide weighted fair queuing in Wireless LAN. Simulation results show that the proposed scheme is able to provide the desired bandwidth distribution independent of the flows aggressiveness and their wi...

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

The transport of real-time data flows over wireless channels can be optimized by cross-layer schedulers which serve the different users dependent on their traffic load and channel state. This paper investigates the delay performance of a two-stage cross-layer scheduler which has been designed to meet the above requirements. The well-known Weighted Fair Queuing Scheduler can tramsmit packets wit...

This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

With the advent of the IEEE 802.11 wireless networks that provide high speed connectivity, demand for supporting multiple real-time traffic applications over wireless LANs has been increasing. A natural question is how to provide fair resource allocation to real-time traffic in wireless LANs. Wireless networks are subject to unpredictable location-dependent error bursts, which is different from...

Background and Objective: Chronic obstructive pulmonary disease (COPD) is a common disease that causes 6% of deaths, 90% of which occur in low- and middle-income countries. Improving these patients' quality of life (QOL) is one of the primary treatment goals. The St. George's Respiratory Questionnaire (SGRQ) is used to measure the health status of patients with respiratory problems. This resear...