Humane risicobeoordeling in zicht : een inventarisatie van de mogelijkheden voor het optimaliseren van het gebruik van humane data bij de risicobeoordeling van chemische stoffen in de voeding

Het doel van deze studie was het identificeren van visies op het huidige risicobeoordelingsproces, het optimaliseren van het gebruik van humane data en de samenwerking tussen toxicologie en epidemiologie. Gegevens zijn verkregen middels 23 semigestructureerde interview

On Binary Matroid Minors and Applications to Data Storage over Small Fields

Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address this issue by developing theory towards code existence and design over a given field. This is done via exploiting recently established connections between linear locally repairable codes and matroids, and using matroid-theoretic characterisations of linearity over small fields. In particular, nonexistence can be shown by finding certain forbidden uniform minors within the lattice of cyclic flats. It is shown that the lattice of cyclic flats of binary matroids have additional structure that significantly restricts the possible locality properties of $\mathbb{F}_{2}$-linear storage codes. Moreover, a collection of criteria for detecting uniform minors from the lattice of cyclic flats of a given matroid is given, which is interesting in its own right.Comment: 14 pages, 2 figure

On the odd-minor variant of Hadwiger's conjecture

A {\it $K_l$ -expansion} consists of $l$ vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion {\it odd} if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every $l$, if a graph contains no odd $K_l$ -expansion then its chromatic number is $O(l \sqrt{\log l})$. In doing so, we obtain a characterization of graphs which contain no odd $K_l$ -expansion which is of independent interest. We also prove that given a graph and a subset $S$ of its vertex set, either there are $k$ vertex-disjoint odd paths with endpoints in $S$, or there is a set X of at most $2k − 2$ vertices such that every odd path with both ends in $S$ contains a vertex in $X$. Finally, we discuss the algorithmic implications of these results

Vascular uptake of rehydration fluids in hypohydrated men at rest and exercise

The purpose of this study was to formulate and to evaluate rehydration drinks, which would restore total body water and plasma volume (PV), for astronauts to consume before and during extravehicular activity, a few hours before reentry, and immediately after landing. In the first experiment (rest, sitting), five healthy men (23-41 yr), previously dehydrated for 24 hr., drank six (1a, 2, 4, 5, 6, 7) fluid formulations (one each at weekly intervals) and then sat for 70 min. Pre-test PV were measured with Evans blue dye and changes in PV were calculated with the hematocrit-hemoglobin transformation equation. This rest experiment simulated hypohydrated astronauts preparing for reentry. The second experiment (exercise, supine) followed the same protocol except four healthy men (30-46 yr) worked for 70 min. in the supine position on a cycle ergometer at a mean load of 71+/-1 percent of their peak aerobic work capacity. This exercise experiment simulated conditions for astronauts with reduced total body water engaging in extravehicular activity

On the odd-minor variant of Hadwiger's conjecture

A {\it $K_l$ -expansion} consists of $l$ vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion {\it odd} if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every $l$, if a graph contains no odd $K_l$ -expansion then its chromatic number is $O(l \sqrt{\log l})$. In doing so, we obtain a characterization of graphs which contain no odd $K_l$ -expansion which is of independent interest. We also prove that given a graph and a subset $S$ of its vertex set, either there are $k$ vertex-disjoint odd paths with endpoints in $S$, or there is a set X of at most $2k − 2$ vertices such that every odd path with both ends in $S$ contains a vertex in $X$. Finally, we discuss the algorithmic implications of these results

The effects of childbirth on the pelvic-floor

Basically, vaginal delivery is associated with the risk of pelvic floor damage. The pelvic floor sequelae of childbirth includes anal incontinence, urinary incontinence and pelvic organ prolapse. Pathophysiology, incidence and risk factors for the development of the respective problems are reviewed. Where possible, recommendations for reducing the risk of pelvic floor damage are given

Predicting urinary creatinine excretion and its usefulness to identify incomplete 24h urine collections

Studies using 24 h urine collections need to incorporate ways to validate the completeness of the urine samples. Models to predict urinary creatinine excretion (UCE) have been developed for this purpose; however, information on their usefulness to identify incomplete urine collections is limited. We aimed to develop a model for predicting UCE and to assess the performance of a creatinine index using para-aminobenzoic acid (PABA) as a reference. Data were taken from the European Food Consumption Validation study comprising two non-consecutive 24 h urine collections from 600 subjects in five European countries. Data from one collection were used to build a multiple linear regression model to predict UCE, and data from the other collection were used for performance testing of a creatinine index-based strategy to identify incomplete collections. Multiple linear regression (n 458) of UCE showed a significant positive association for body weight (ß = 0·07), the interaction term sex × weight (ß = 0·09, reference women) and protein intake (ß = 0·02). A significant negative association was found for age (ß = - 0·09) and sex (ß = - 3·14, reference women). An index of observed-to-predicted creatinine resulted in a sensitivity to identify incomplete collections of 0·06 (95 % CI 0·01, 0·20) and 0·11 (95 % CI 0·03, 0·22) in men and women, respectively. Specificity was 0·97 (95 % CI 0·97, 0·98) in men and 0·98 (95 % CI 0·98, 0·99) in women. The present study shows that UCE can be predicted from weight, age and sex. However, the results revealed that a creatinine index based on these predictions is not sufficiently sensitive to exclude incomplete 24 h urine collections