BACKGROUND In 2008 the Cystic Fibrosis (CF) Foundation launched the Respiratory Therapy Mentoring Program, which pairs a respiratory therapist (RT) relatively new to CF (apprentice) with a highly experienced RT (mentor) from a similar CF care center. We wished to determine if we had achieved our short-term goal of increasing CF-specific knowledge among the apprentices who participated in the pr...

Background and aims: Visit quality is a crucial component of patient-physician interaction that its inadequacy can negatively influence the diagnosis and treatment efficiency. The waiting time and visit length are important determinants of quality in the outpatient care setting. Thus, the aim of this study was to determine waiting time and visit length and to compare them befor...

We survey three recent breakthroughs in algebraic combinatorics. The first is the proof by Knutson and Tao, and later Derksen and Weyman, of the saturation conjecture for Littlewood-Richardson coefficients. The second is the proof of the n! and (n + 1)n−1 conjectures by Haiman. The final breakthrough is the determination by Baik, Deift, and Johansson of the limiting behavior of the length of th...

Let u(d, n) denote the number of permuations in the symmetric group Sn with no increasing subsequence of length greater than d. u(d, n) may alternatively be interpreted as the number of closed Z-lattice walks which begin and end at the origin and take n positive steps followed by n negative steps while remaining confined to the Weyl chamber W = {(t1, t2, . . . , td) ∈ R : t1 ≥ t2 ≥ · · · ≥ td}....

Karlin and Altschul in their statistical analysis for multiple highscoring segments in molecular sequences introduced a distribution function which gives the probability there are at least r distinct and consistently ordered segment pairs all with score at least x. For long sequences this distribution can be expressed in terms of the distribution of the length of the longest increasing subseque...

The Mallows measure on the symmetric group Sn is the probability measure such that each permutation has probability proportional to q raised to the power of the number of inversions, where q is a positive parameter and the number of inversions of π is equal to the number of pairs i < j such that πi > πj . We prove a weak law of large numbers for the length of the longest increasing subsequence ...