Instrument development, data collection, and characteristics of practices, staff, and measures in the Improving Quality of Care in Diabetes (iQuaD) Study

Peer reviewedPublisher PD

Complexity of Restricted and Unrestricted Models of Molecular Computation

In [9] and [2] a formal model for molecular computing was proposed, which makes focused use of affinity purification. The use of PCR was suggested to expand the range of feasible computations, resulting in a second model. In this note, we give a precise characterization of these two models in terms of recognized computational complexity classes, namely branching programs (BP) and nondeterministic branching programs (NBP) respectively. This allows us to give upper and lower bounds on the complexity of desired computations. Examples are given of computable and uncomputable problems, given limited time

Stable Marriage with Ties and Bounded Length Preference Lists

We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that weakly stable matchings can have different sizes. This motivates the problem of finding a maximum cardinality weakly stable matching, which is known to be NP-hard in general. We show that this problem is solvable in polynomial time if each man's list is of length at most 2 (even for women's lists that are of unbounded length). However if each man's list is of length at most 3, we show that the problem becomes NP-hard and not approximable within some d > 1, even if each woman's list is of length at most 4

Modelling of a roof runoff harvesting system: The use of rainwater for toilet flushing

The water balance of a four-people family rainwater harvesting system was calculated in a case study. The experimental water saving efficiency (WSE) was calculated as 87 %. A simple computer model was implemented to simulate the behaviour of the rainwater harvesting system. In general, the rainwater collector volumes predicted by the daily model had shown a good correlation with the experimental values. The difference between the experimental and the predicted values for the stored volume can be explained by the lack of maintenance of the system that can affect its performance. On the basis of a long-term simulation of 20-year rainfall data, the following parameters were calculated: rainfall, water demand, mains water, rainwater used, over-flow and WSE. The collection of rainwater from roofs, its storage and subsequent use for toilet flushing can save 42 m3 of potable water per year for the studied system. The model was also used to find the optimal size of the tank for the single-family household: a storage capacity of approximately 5 m3 was found to be appropriate. The storage capacity and tank size were distinguished. The importance to take into account the dead volume of the tank for the sizing was indeed highlighted

Systems of mutually unbiased Hadamard matrices containing real and complex matrices

We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and com- plex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard ma- trices (MUHs) in any dimension cannot contain more than one real Hadamard matrix. We also give new proofs of several known structural results in low dimensions