Pediatric emergencies admitted in the resuscitation room of a swiss university hospital.

OBJECTIVES: Pediatric resuscitation is an intense, stressful, and challenging process. The aim of this study was to review the life-threatening pediatric (LTP) emergencies admitted in a Swiss university hospital with regards to patients' demographics, reason for admission, diagnosis, treatment, significant events, critical incidents, and outcomes. METHODS: A retrospective observational cohort study of prospectively collected data was conducted, including all LTP emergencies admitted over a period of 2 years in the resuscitation room (RR). Variables, including indication for transfer, mode of prehospital transportation, diagnosis, and time spent in RR, were recorded. RESULTS: Of the 60,939 pediatric emergencies treated in our university hospital over 2 years, a total of 277 LTP emergencies (0.46%) were admitted in the RR. They included 160 boys and 117 girls, aged 6 days to 15.95 years (mean, 6.69 years; median, 5.06). A medical problem was identified in 55.9% (n = 155) of the children. Of the 122 children treated for a surgical problem, 35 (28.3%) went directly from the RR to the operating room. Hemodynamic instability was noted in 19.5% of all LTP emergencies, of which 1.1% benefited from O negative transfusion. Admission to the intensive care unit was necessary for 61.6% of the children transferred from another hospital. The average time spent in the RR was 46 minutes. The overall mortality rate was 7.2%. CONCLUSIONS: The LTP emergencies accounted for a small proportion of all pediatric emergencies. They were more medical than surgical cases and resuscitation measures because of hemodynamic instability were the most frequent treatment.

Analysis of a finite volume element method for the Stokes problem

In this paper we propose a stabilized conforming finite volume element method for the Stokes equations. On stating the convergence of the method, optimal a priori error estimates in different norms are obtained by establishing the adequate connection between the finite volume and stabilized finite element formulations. A superconvergence result is also derived by using a postprocessing projection method. In particular, the stabilization of the continuous lowest equal order pair finite volume element discretization is achieved by enriching the velocity space with local functions that do not necessarily vanish on the element boundaries. Finally, some numerical experiments that confirm the predicted behavior of the method are provided.

A Bayesian network approach to the database serch problem in criminal proceedings

Background The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.

The subjectivist interpretation of probability and the problem of individualisation in forensic science

This paper presents and discusses further aspects of the subjectivist interpretation of probability (also known as the 'personalist' view of probabilities) as initiated in earlier forensic and legal literature. It shows that operational devices to elicit subjective probabilities - in particular the so-called scoring rules - provide additional arguments in support of the standpoint according to which categorical claims of forensic individualisation do not follow from a formal analysis under that view of probability theory.