999 resultados para Optimal Code


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Use of Reversions Report

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recent progress in medicine allow to provide treatment, to cure or to extend the lifespan of people that would have not survived before. Doctors and healthcare providers have become indispensable actors in Western societies. This is particularly true for children's health issues. With the new information technologies, knowledge is now available to everyone, which enables patients to dialog on an equal footing with the physician. Nowadays, therapeutic choices are discussed and negotiated. The new tensions caused by this relationship between therapist and patient have created the need for new regulations. The Swiss Confederation has modified its Civil Code with the objective of a better protection of vulnerable individuals. This article summarizes the consequences of the new regulations with regard to the care and treatment provided to children.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Code és una aplicaicó web per a permetre el comentari remot d'activitats de programació. La interfície web està desenvolupada usat el Google Web Toolkit (GWT) per aconseguir un alt nivell d'interactivitat.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Optimal robust M-estimates of a multidimensional parameter are described using Hampel's infinitesimal approach. The optimal estimates are derived by minimizing a measure of efficiency under the model, subject to a bounded measure of infinitesimal robustness. To this purpose we define measures of efficiency and infinitesimal sensitivity based on the Hellinger distance.We show that these two measures coincide with similar ones defined by Yohai using the Kullback-Leibler divergence, and therefore the corresponding optimal estimates coincide too.We also give an example where we fit a negative binomial distribution to a real dataset of "days of stay in hospital" using the optimal robust estimates.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

BACKGROUND: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA colonies. The processing and statistical analysis of such high-throughput data poses new challenges; currently a fair proportion of the tags are routinely discarded due to an inability to match them to a reference sequence, thereby reducing the effective throughput of the technology. RESULTS: We propose a novel base calling algorithm using model-based clustering and probability theory to identify ambiguous bases and code them with IUPAC symbols. We also select optimal sub-tags using a score based on information content to remove uncertain bases towards the ends of the reads. CONCLUSION: We show that the method improves genome coverage and number of usable tags as compared with Solexa's data processing pipeline by an average of 15%. An R package is provided which allows fast and accurate base calling of Solexa's fluorescence intensity files and the production of informative diagnostic plots.