Seafood Safety and Trade

Food Consumption/Nutrition/Food Safety, International Relations/Trade,

A powerful test for linearity when the order of integration is unknown [Revised to become No. 07/06 above]

In this paper we propose a test of the null hypothesis of time series linearity against a nonlinear alternative, when uncertainty exists as to whether or not the series contains a unit root. We provide a test statistic that has the same limiting null critical values regardless of whether the series under consideration is generated from a linear I(0) or linear I(1) process, and is consistent against nonlinearity of either form, being asymptotically equivalent to the efficient test in each case. Finite sample simulations show that the new procedure has good size control and offers substantial power gains over the recently proposed robust linearity test of Harvey and Leybourne (2007).Nonlinearity testing; Wald tests; unit root tests; stationarity tests

Initial Experiences of Building Secure Access to Patient Confidential Data via the Internet

A project to enable health care professionals (GPs, practice nurses and diabetes nurse specialists) to access, via the Internet, confidential patient data held on a secondary care (hospital) diabetes information system, has been implemented. We describe the application that we chose to distribute (a diabetes register); the security mechanisms we used to protect the data (a public key infrastructure with strong encryption and digitally signed messages, plus a firewall); the reasons for the implementation decisions we made; the validation testing that we performed and the preliminary results of the pilot implementation

Average degree conditions forcing a minor

Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger's Conjecture, much research has focused on the average degree required to force a complete graph as a minor. Subsequently, various authors have consider the average degree required to force an arbitrary graph $H$ as a minor. Here, we strengthen (under certain conditions) a recent result by Reed and Wood, giving better bounds on the average degree required to force an $H$-minor when $H$ is a sparse graph with many high degree vertices. This solves an open problem of Reed and Wood, and also generalises (to within a constant factor) known results when $H$ is an unbalanced complete bipartite graph