Feasibility Study of Radiation Pyrometer for Nuclear Rocket Application Final Report

Radiation pyrometer for nuclear applicatio

Inductive Reasoning Games as Influenza Vaccination Models: Mean Field Analysis

We define and analyze an inductive reasoning game of voluntary yearly vaccination in order to establish whether or not a population of individuals acting in their own self-interest would be able to prevent influenza epidemics. We find that epidemics are rarely prevented. We also find that severe epidemics may occur without the introduction of pandemic strains. We further address the situation where market incentives are introduced to help ameliorating epidemics. Surprisingly, we find that vaccinating families exacerbates epidemics. However, a public health program requesting prepayment of vaccinations may significantly ameliorate influenza epidemics.Comment: 20 pages, 7 figure

Structure of d(TGCGCA)(2) and a comparison with other DNA Hexamers

The X-ray crystal structure of d(TGCGCA)(2) has been determined at 120 K to a resolution of 1.3 Angstrom. Hexamer duplexes, in the Z-DNA conformation, pack in an arrangement similar to the 'pure spermine form' [Egli et al. (1991). Biochemistry, 30, 11388-11402] but with significantly different cell dimensions. The phosphate backbone exists in two equally populated discrete conformations at one nucleotide step, around phosphate 11. The structure contains two ordered cobalt hexammine molecules which have roles in stabilization of both the Z-DNA conformation of the duplex and in crystal packing. A comparison of d(TGCGCA)(2) with other Z-DNA hexamer structures available in the Nucleic Acid Database illustrates the elusive nature of crystal packing. A review of the interactions with the metal cations Na+, Mg2+ and Co3+ reveals a relatively small proportion of phosphate binding and that close contacts between metal ions are common. A prediction of the water structure is compared with the observed pattern in the reported structure

Parsimonious Kernel Fisher Discrimination

By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coefficients to provide a parsimonious solution. The algorithm is simple, easily programmed and is shown to perform as well as or better than a number of leading machine learning algorithms on a substantial benchmark. It is then applied to a set of extreme small-sample-size problems in virtual screening where it is found to be less accurate than a currently leading approach but is still comparable in a number of cases