Information Literacy Instruction in an English Capstone Course: A Study of Student Confidence, Perception, and Practice

An English professor and an instruction librarian at the University of New Hampshire at Manchester felt that the college\u27s new English Capstone course for majors provided a unique opportunity to assess the information literacy skill levels of graduating English majors. They therefore engaged in a three-year study to evaluate the IL competency of these students, to gauge their perceptions of library instruction provided during the Capstone course and throughout their academic careers, and to determine students\u27 confidence and self-efficacy with respect to these skills. The researchers sought to determine the ways in which the IL program for English majors effectively met established IL goals and to identify areas for improvement

Combinatorial batch codes

In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of [n] items among [m] devices (servers) in such a way that any [k] items can be retrieved by reading at most [t] items from each of the servers. It is of interest to devise batch codes that minimize the total storage, denoted by [N] , over all [m] servers. We restrict out attention to batch codes in which every server stores a subset of the items. This is purely a combinatorial problem, so we call this kind of batch code a ''combinatorial batch code''. We only study the special case [t=1] , where, for various parameter situations, we are able to present batch codes that are optimal with respect to the storage requirement, [N] . We also study uniform codes, where every item is stored in precisely [c] of the [m] servers (such a code is said to have rate [1/c] ). Interesting new results are presented in the cases [c = 2, k-2] and [k-1] . In addition, we obtain improved existence results for arbitrary fixed [c] using the probabilistic method

Gravity-driven draining of a thin rivulet with constant width down a slowly varying substrate

The locally unidirectional gravity-driven draining of a thin rivulet with constant width but slowly varying contact angle down a slowly varying substrate is considered. Specifically, the flow of a rivulet in the azimuthal direction from the top to the bottom of a large horizontal cylinder is investigated. In particular, it is shown that, despite behaving the same locally, this flow has qualitatively different global behaviour from that of a rivulet with constant contact angle but slowly varying width. For example, whereas in the case of constant contact angle there is always a rivulet that runs all the way from the top to the bottom of the cylinder, in the case of constant width this is possible only for sufficiently narrow rivulets. Wider rivulets with constant width are possible only between the top of the cylinder and a critical azimuthal angle on the lower half of the cylinder. Assuming that the contact lines de-pin at this critical angle (where the contact angle is zero) the rivulet runs from the critical angle to the bottom of the cylinder with zero contact angle, monotonically decreasing width and monotonically increasing maximum thickness. The total mass of fluid on the cylinder is found to be a monotonically increasing function of the value of the constant width

A thin rivulet or ridge subject to a uniform transverse\ud shear stress at its free surface due to an external airflow

We use the lubrication approximation to analyse three closely related problems involving a thin rivulet or ridge (i.e. a two-dimensional droplet) of fluid subject to a prescribed uniform transverse shear stress at its free surface due to an external airflow, namely a rivulet draining under gravity down a vertical substrate, a rivulet driven by a longitudinal shear stress at its free surface, and a ridge on a horizontal substrate, and find qualitatively similar behaviour for all three problems. We show that, in agreement with previous numerical studies, the free surface profile of an equilibrium rivulet/ridge with pinned contact lines is skewed as the shear stress is increased from zero, and that there is a maximum value of the shear stress beyond which no solution with prescribed semi-width is possible. In practice, one or both of the contact lines will de-pin before this maximum value of the shear stress is reached, and so we consider situations in which the rivulet/ridge de-pins at one or both contact lines. In the case of de-pinning only at the advancing contact line, the rivulet/ridge is flattened and widened as the shear stress is increased from its critical value, and there is a second maximum value of the shear stress beyond which no solution with a prescribed advancing contact angle is possible. In contrast, in the case of de-pinning only at the receding contact line, the rivulet/ridge is thickened and narrowed as the shear stress is increased from its critical value, and there is a solution with a prescribed receding contact angle for all values of the shear stress. In general, in the case of de-pinning at both contact lines there is a critical “yield” value of the shear stress beyond which no equilibrium solution is possible and the rivulet/ridge will evolve unsteadily. In an Appendix we show that an equilibrium rivulet/ridge with prescribed flux/area is quasi-statically stable to two-dimensional perturbations

Identification and characterisation of 17 polymorphic candidate genes for response to parasitic nematode (Trichostrongylus tenuis) infection in red grouse (Lagopus lagopus scotica)

Acknowledgements This study was funded by a BBSRC studentship (MA Wenzel) and NERC Grants NE/H00775X/1 and NE/D000602/1 (SB Piertney). We are grateful to Jacob Hoglund for providing willow grouse samples, Mario Roder, Keliya Bai, Marianne James, Matt Oliver, Gill Murray-Dickson, Francois Mougeot and Jesus Martınez-Padilla for help with fieldwork, and all grouse estate factors, owners and keepers, most particularly Alistair Mitchell, Shaila Rao, Christopher Murphy, Richard Cooke and Fred Taylor, for providing access to estate game larders.Peer reviewedPostprin

Workshop on the Polar Regions of Mars: Geology, Glaciology, and Climate History, part 1

Papers and abstract of papers presented at the workshop are presented. Some representative titles are as follows: Glaciation in Elysium; Orbital, rotational, and climatic interactions; Water on Mars; Rheology of water-silicate mixtures at low temperatures; Evolution of the Martian atmosphere (the role of polar caps); Is CO2 ice permanent; Dust transport into Martian polar latitudes; Mars observer radio science (MORS) observations in polar regions; and Wind transport near the poles of Mars (timescales of changes in deposition and erosion)

Distinct difference configurations: multihop paths and key predistribution in sensor networks

A distinct difference configuration is a set of points in Z2 with the property that the vectors (difference vectors) connecting any two of the points are all distinct. Many specific examples of these configurations have been previously studied: the class of distinct difference configurations includes both Costas arrays and sonar sequences, for example. Motivated by an application of these structures in key predistribution for wireless sensor networks, we define the k-hop coverage of a distinct difference configuration to be the number of distinct vectors that can be expressed as the sum of k or fewer difference vectors. This is an important parameter when distinct difference configurations are used in the wireless sensor application, as this parameter describes the density of nodes that can be reached by a short secure path in the network. We provide upper and lower bounds for the k-hop coverage of a distinct difference configuration with m points, and exploit a connection with Bh sequences to construct configurations with maximal k-hop coverage. We also construct distinct difference configurations that enable all small vectors to be expressed as the sum of two of the difference vectors of the configuration, an important task for local secure connectivity in the application

Implementation of the Crisis Resolution Team model in adult mental health settings: a systematic review.

Crisis Resolution Teams (CRTs) aim to offer an alternative to hospital admission during mental health crises, providing rapid assessment, home treatment, and facilitation of early discharge from hospital. CRTs were implemented nationally in England following the NHS Plan of 2000. Single centre studies suggest CRTs can reduce hospital admissions and increase service users' satisfaction: however, there is also evidence that model implementation and outcomes vary considerably. Evidence on crucial characteristics of effective CRTs is needed to allow team functioning to be optimised. This review aims to establish what evidence, if any, is available regarding the characteristics of effective and acceptable CRTs

Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs

We study a method for key predistribution in a network of n users where pairwise keys are computed by hashing users’ IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A communication graph G can be specified to indicate which pairs of users should be able to compute keys. We determine necessary and sufficient conditions for schemes of this type to be secure. We also consider the problem of minimizing the storage requirements of such a scheme; we are interested in the total storage as well as the maximum storage required by any user. Minimizing the total storage is NP-hard, whereas minimizing the maximum storage required by a user can be computed in polynomial time