Reducing hospital associated infection : a role for social marketing

Purpose: Although hand hygiene is seen as the most important method to prevent the transmission of hospital associated infection in the UK, hand hygiene compliance rates appear to remain poor. This research aims to assess the degree to which social marketing methodology can be adopted by a particular organization to promote hand hygiene compliance. Design/Methodology/Approach: The research design is based on a conceptual framework developed from analysis of social marketing literature. Data collection involved taped interviews given by nursing staff working within a specific Hospital Directorate in Manchester, England. Supplementary data was obtained from archival records of the hand hygiene compliance rates. Findings: Findings highlighted gaps in the Directorate’s approach to the promotion of hand hygiene compared to what could be using social marketing methodology. Respondents highlighted how the Directorate failed to fully optimise resources required to endorse hand hygiene practice and this resulted in poorer compliance. Originality/Value: From the experiences and events documented, the study suggests how the emergent phenomena could be utilized by the Directorate to apply a social marketing approach which could positively influence hand hygiene compliance

Notes on research into some aspects of stall-warning devices

The problems of detecting and indicating an approaching stall have been investigated in flight on an “Anson” aircraft. A lower-surface flap near the leading-edge of the wing detects the approaching stall at a speed which depends critically on the length of the flap and on its location, but the margin of warning speed over stalling-speed is reasonably independent of landing-flap position and throttle setting. Continues

Real entire functions with real zeros and a conjecture of Wiman

If f is a real entire function and ff" has only real zeros then f belongs to the Laguerre-Polya class, the closure of the set of real polynomials with real zeros. This result completes a long line of development originating from a conjecture of Wiman in 1914.Comment: 17 pages, LaTe

Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths

A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (dom (D)) whenever (u, z) ϵ A (D) or (v, z) ϵ A (D) for any other vertex z ϵ A (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UGc (D) is the union of two disjoint paths

A Characterization of Connected (1,2)-Domination Graphs of Tournaments

Recently. Hedetniemi et aI. introduced (1,2)-domination in graphs, and the authors extended that concept to (1, 2)-domination graphs of digraphs. Given vertices x and y in a digraph D, x and y form a (1,2)-dominating pair if and only if for every other vertex z in D, z is one step away from x or y and at most two steps away from the other. The (1,2)-dominating graph of D, dom1,2 (D), is defined to be the graph G = (V, E ) , where V (G) = V (D), and xy is an edge of G whenever x and y form a (1,2)-dominating pair in D. In this paper, we characterize all connected graphs that can be (I, 2)-dominating graphs of tournaments

Kings and Heirs: A Characterization of the (2,2)-domination Graphs of Tournaments

In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach every other vertex in two or fewer steps. A (2,2)-domination graph of a digraph D, dom2,2(D), has vertex set V(D), the vertices of D, and edge uv whenever u and v each reach all other vertices of D in two or fewer steps. In this special case of the (i,j)-domination graph, we see that Maurer’s theorem plays an important role in establishing which vertices form the kings that create some of the edges in dom2,2(D). But of even more interest is that we are able to use the theorem to determine which other vertices, when paired with a king, form an edge in dom2,2(D). These vertices are referred to as heirs. Using kings and heirs, we are able to completely characterize the (2,2)-domination graphs of tournaments

A Personalized System for Conversational Recommendations

Searching for and making decisions about information is becoming increasingly difficult as the amount of information and number of choices increases. Recommendation systems help users find items of interest of a particular type, such as movies or restaurants, but are still somewhat awkward to use. Our solution is to take advantage of the complementary strengths of personalized recommendation systems and dialogue systems, creating personalized aides. We present a system -- the Adaptive Place Advisor -- that treats item selection as an interactive, conversational process, with the program inquiring about item attributes and the user responding. Individual, long-term user preferences are unobtrusively obtained in the course of normal recommendation dialogues and used to direct future conversations with the same user. We present a novel user model that influences both item search and the questions asked during a conversation. We demonstrate the effectiveness of our system in significantly reducing the time and number of interactions required to find a satisfactory item, as compared to a control group of users interacting with a non-adaptive version of the system

From Pine Cones to Read Clouds: Rescaffolding the Megagenome of Sugar Pine (Pinus lambertiana).

We investigate the utility and scalability of new read cloud technologies to improve the draft genome assemblies of the colossal, and largely repetitive, genomes of conifers. Synthetic long read technologies have existed in various forms as a means of reducing complexity and resolving repeats since the outset of genome assembly. Recently, technologies that combine subhaploid pools of high molecular weight DNA with barcoding on a massive scale have brought new efficiencies to sample preparation and data generation. When combined with inexpensive light shotgun sequencing, the resulting data can be used to scaffold large genomes. The protocol is efficient enough to consider routinely for even the largest genomes. Conifers represent the largest reference genome projects executed to date. The largest of these is that of the conifer Pinus lambertiana (sugar pine), with a genome size of 31 billion bp. In this paper, we report on the molecular and computational protocols for scaffolding the P. lambertiana genome using the library technology from 10× Genomics. At 247,000 bp, the NG50 of the existing reference sequence is the highest scaffold contiguity among the currently published conifer assemblies; this new assembly's NG50 is 1.94 million bp, an eightfold increase