News from the international study Control of Adolescent Smoking : Smoking in Scottish schools

This study was funded by EC BIOMED II grant BMH4-CT98-3721,Transnational variation in prevalence of adolescent smoking: the role of national tobacco policies and the school and family environments.Publisher PD

On a photon-counting array using the Fairchild CCD-201

The evaluation of certain performance parameters of the Fairchild CCD 201 and the proposed method of operation of an electron bombarded charge coupled device are described. Work in progress on the evaluation of the parameters relevant to remote, low noise operation is reported. These tests have been conducted using light input. The video data from the CCD are amplified, digitized, stored in a minicomputer memory, and then recorded on magnetic tape for analyzing. The device will be used in an array of sensors in the aperture plane of a telescope to discriminate between photoelectron events, and in the focal plane operating at single photoelectron sensitivity at a minimum of blooming and lag

News from the international study Control of Adolescent Smoking : Parental influences on smoking among Scottish adolescents

This study was funded by EC BIOMED II grant BMH4-CT98- 3721, Transnational variation in prevalence of adolescent smoking: the role of national tobacco policies and the school and family environments.Publisher PD

Binary words avoiding xx^Rx and strongly unimodal sequences

In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxx^R was intermediate between polynomial and exponential. We now show that the same holds for the growth of the number of binary words avoiding the pattern xx^Rx. Curiously, the analysis for xx^Rx is much simpler than that for xxx^R. We derive our results by giving a bijection between the set of binary words avoiding xx^Rx and a class of sequences closely related to the class of "strongly unimodal sequences."Comment: 4 page

Attainable lengths for circular binary words avoiding k-powers

We show that binary circular words of length n avoiding 7/3+ powers exist for every sufficiently large n. This is not the case for binary circular words avoiding k+ powers with k < 7/3https://projecteuclid.org/download/pdf_1/euclid.bbms/113379334

Avoidability index for binary patterns with reversal

For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.Comment: 15 pages, 1 figur