Measurements of the free stream fluctuations above a turbulent boundary layer

This paper investigates the velocity fluctuations in the free stream above an incompressible turbulent boundary layer developing at constant pressure. It is assumed that the fluctuations receive contributions from three statistically independent sources: (1) one-dimensional unsteadiness, (2) free stream turbulence, and (3) the potential motion induced by the turbulent boundary layer. Measurements were made in a wind tunnel with a root-mean-square level of the axial velocity fluctuations of about 0.2 percent. All three velocity components were measured using an X-wire probe. The unsteadiness was determined from the spanwise covariance of the axial velocity, measured using two single wire probes. The results show that it is possible to separate the contributions to the r.m.s. level of the velocity fluctuations, without resorting to the dubious technique of high-pass filtering. The separation could be extended to the spectral densities of the contributions, if measurements of sufficient accuracy were available. The Appendix provides a general guide for the measurement of small free stream fluctuation levels

Thomassen's Choosability Argument Revisited

Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {\v{S}}krekovski (1998) and He et al. (2008), who proved that every $K_5$-minor-free graph is 5-choosable. Both proofs rely on the characterisation of $K_5$-minor-free graphs due to Wagner (1937). This paper proves the same result without using Wagner's structure theorem or even planar embeddings. Given that there is no structure theorem for graphs with no $K_6$-minor, we argue that this proof suggests a possible approach for attacking the Hadwiger Conjecture

Error correction and diversity analysis of population mixtures determined by NGS

The impetus for this work was the need to analyse nucleotide diversity in a viral mix taken from honeybees. The paper has two findings. First, a method for correction of next generation sequencing error in the distribution of nucleotides at a site is developed. Second, a package of methods for assessment of nucleotide diversity is assembled. The error correction method is statistically based and works at the level of the nucleotide distribution rather than the level of individual nucleotides. The method relies on an error model and a sample of known viral genotypes that is used for model calibration. A compendium of existing and new diversity analysis tools is also presented, allowing hypotheses about diversity and mean diversity to be tested and associated confidence intervals to be calculated. The methods are illustrated using honeybee viral samples. Software in both Excel and Matlab and a guide are available at http://www2.warwick.ac.uk/fac/sci/systemsbiology/research/software/,the Warwick University Systems Biology Centre software download site.Publisher PDFPeer reviewe

Closed-Cycle, Frequency-Stable CO2 Laser Technology

These proceedings contain a collection of papers and comments presented at a workshop on technology associated with long-duration closed-cycle operation of frequency-stable, pulsed carbon dioxide lasers. This workshop was held at the NASA Langley Research Center June 10 to 12, 1986. The workshop, jointly sponsored by the National Aeronautics and Space Administration (NASA) and the Royal Signals and Radar Establishment (RSRE), was attended by 63 engineers and scientists from the United States and the United Kingdom. During the 2 1/2 days of the workshop, a number of issues relating to obtaining frequency-stable operation and to the catalytic control of laser gas chemistry were discussed, and specific recommendations concerning future activities were drafted

A linear-time algorithm for finding a complete graph minor in a dense graph

Let g(t) be the minimum number such that every graph G with average degree d(G) \geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) \in \Theta(t*sqrt{log t}). This article shows that for all fixed \epsilon > 0 and fixed sufficiently large t \geq t(\epsilon), if d(G) \geq (2+\epsilon)g(t) then we can find this K_{t}-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) \geq 2^{t-2}.Comment: 6 pages, 0 figures; Clarification added in several places, no change to arguments or result

Cultural Considerations: Pharmacological and Nonpharmacological Means for Improving Blood Pressure Control among Hispanic Patients

Cardiovascular disease is a leading cause of morbidity and mortality in the United States, and its prevention and treatment remain a priority for the medical community. Ethnic variations account for some differences in the prevalence of hypertension and blood pressure (BP) control rates among Hispanics, indicating the need for culturally appropriate management models. Aggressive treatment strategies are key to achieving optimal BP control in high-risk Hispanic patients. Hypertension in this ethnic group continues to be a major health concern. Of note, when provided access to comprehensive care, Hispanics demonstrate similar response rates to treatment as the majority of non-Hispanic whites. This highlights the importance of effective, culturally responsive hypertension management among high-risk Hispanic patients for achieving observable, positive health outcomes

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c.Comment: v3: referees' comments incorporate

Rare-isotope and kinetic studies of Pt/SnO2 catalysts

Closed-cycle pulsed CO2 laser operation requires the use of an efficient CO-O2 recombination catalyst for these dissociation products which otherwise would degrade the laser operation. The catalyst must not only operate at low temperatures but also must operate efficiently for long periods. In the case of the Laser Atmospheric Wind Sounder (LAWS) laser, an operational lifetime of 3 years is required. Additionally, in order to minimize atmospheric absorption and enhance aerosol scatter of laser radiation, the LAWS system will operate at 9.1 micrometers with an oxygen-18 isotope CO2 lasing medium. Consequently, the catalyst must not only operate at low temperatures but must also preserve the isotopic integrity of the rare-isotope composition in the recombination mode. Several years ago an investigation of commercially available and newly synthesized recombination catalysts for use in closed-cycle pulsed common and rare-isotope CO2 lasers was implemented at the NASA Langley Research Center. Since that time, mechanistic efforts utilizing both common and rare oxygen isotopes have been implemented and continue. Rare-isotope studies utilizing commercially available platinum-tin oxide catalyst have demonstrated that the catalyst contributes oxygen-16 to the product carbon dioxide thus rendering it unusable for rare-isotope applications. A technique has been developed for modification of the surface of the common-isotope catalyst to render it usable. Results of kinetic and isotope label studies using plug flow, recycle plug flow, and closed internal recycle plug flow reactor configuration modes are discussed

Layout of Graphs with Bounded Tree-Width

A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-number}. A \emph{three-dimensional (straight-line grid) drawing} of a graph represents the vertices by points in $\mathbb{Z}^3$ and the edges by non-crossing line-segments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of three-dimensional drawing of a graph $G$ is closely related to the queue-number of $G$. In particular, if $G$ is an $n$-vertex member of a proper minor-closed family of graphs (such as a planar graph), then $G$ has a $O(1)\times O(1)\times O(n)$ drawing if and only if $G$ has O(1) queue-number. (2) It is proved that queue-number is bounded by tree-width, thus resolving an open problem due to Ganley and Heath (2001), and disproving a conjecture of Pemmaraju (1992). This result provides renewed hope for the positive resolution of a number of open problems in the theory of queue layouts. (3) It is proved that graphs of bounded tree-width have three-dimensional drawings with O(n) volume. This is the most general family of graphs known to admit three-dimensional drawings with O(n) volume. The proofs depend upon our results regarding \emph{track layouts} and \emph{tree-partitions} of graphs, which may be of independent interest.Comment: This is a revised version of a journal paper submitted in October 2002. This paper incorporates the following conference papers: (1) Dujmovic', Morin & Wood. Path-width and three-dimensional straight-line grid drawings of graphs (GD'02), LNCS 2528:42-53, Springer, 2002. (2) Wood. Queue layouts, tree-width, and three-dimensional graph drawing (FSTTCS'02), LNCS 2556:348--359, Springer, 2002. (3) Dujmovic' & Wood. Tree-partitions of $k$-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 200