Decision-making in pediatrics: a practical algorithm to evaluate complementary and alternative medicine for children.

We herein present a preliminary practical algorithm for evaluating complementary and alternative medicine (CAM) for children which relies on basic bioethical principles and considers the influence of CAM on global child healthcare. CAM is currently involved in almost all sectors of pediatric care and frequently represents a challenge to the pediatrician. The aim of this article is to provide a decision-making tool to assist the physician, especially as it remains difficult to keep up-to-date with the latest developments in the field. The reasonable application of our algorithm together with common sense should enable the pediatrician to decide whether pediatric (P)-CAM represents potential harm to the patient, and allow ethically sound counseling. In conclusion, we propose a pragmatic algorithm designed to evaluate P-CAM, briefly explain the underlying rationale and give a concrete clinical example.

Practical algorithms for a family of waterfilling solutions

Many engineering problems that can be formulatedas constrained optimization problems result in solutionsgiven by a waterfilling structure; the classical example is thecapacity-achieving solution for a frequency-selective channel.For simple waterfilling solutions with a single waterlevel and asingle constraint (typically, a power constraint), some algorithmshave been proposed in the literature to compute the solutionsnumerically. However, some other optimization problems result insignificantly more complicated waterfilling solutions that includemultiple waterlevels and multiple constraints. For such cases, itmay still be possible to obtain practical algorithms to evaluate thesolutions numerically but only after a painstaking inspection ofthe specific waterfilling structure. In addition, a unified view ofthe different types of waterfilling solutions and the correspondingpractical algorithms is missing.The purpose of this paper is twofold. On the one hand, itoverviews the waterfilling results existing in the literature from aunified viewpoint. On the other hand, it bridges the gap betweena wide family of waterfilling solutions and their efficient implementationin practice; to be more precise, it provides a practicalalgorithm to evaluate numerically a general waterfilling solution,which includes the currently existing waterfilling solutions andothers that may possibly appear in future problems.

Class of correlated random networks with hidden variables

We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

Prediction of hemodynamic severity of coarctation by magnetic resonance imaging.

A published formula containing minimal aortic cross-sectional area and the flow deceleration pattern in the descending aorta obtained by cardiovascular magnetic resonance predicts significant coarctation of the aorta (CoA). However, the existing formula is complicated to use in clinical practice and has not been externally validated. Consequently, its clinical utility has been limited. The aim of this study was to derive a simple and clinically practical algorithm to predict severe CoA from data obtained by cardiovascular magnetic resonance. Seventy-nine consecutive patients who underwent cardiovascular magnetic resonance and cardiac catheterization for the evaluation of native or recurrent CoA at Children's Hospital Boston (n = 30) and the University of California, San Francisco (n = 49), were retrospectively reviewed. The published formula derived from data obtained at Children's Hospital Boston was first validated from data obtained at the University of California, San Francisco. Next, pooled data from the 2 institutions were analyzed, and a refined model was created using logistic regression methods. Finally, recursive partitioning was used to develop a clinically practical prediction tree to predict transcatheter systolic pressure gradient ≥ 20 mm Hg. Severe CoA was present in 48 patients (61%). Indexed minimal aortic cross-sectional area and heart rate-corrected flow deceleration time in the descending aorta were independent predictors of CoA gradient ≥ 20 mm Hg (p <0.01 for both). A prediction tree combining these variables reached a sensitivity and specificity of 90% and 76%, respectively. In conclusion, the presented prediction tree on the basis of cutoff values is easy to use and may help guide the management of patients investigated for CoA.

Numerical solutions of elliptic inverse problems via the equation error method

To estimate a parameter in an elliptic boundary value problem, the method of equation error chooses the value that minimizes the error in the PDE and boundary condition (the solution of the BVP having been replaced by a measurement). The estimated parameter converges to the exact value as the measured data converge to the exact value, provided Tikhonov regularization is used to control the instability inherent in the problem. The error in the estimated solution can be bounded in an appropriate quotient norm; estimates can be derived for both the underlying (infinite-dimensional) problem and a finite-element discretization that can be implemented in a practical algorithm. Numerical experiments demonstrate the efficacy and limitations of the method.

Training and search methods for speech recognition.

Speech recognition involves three processes: extraction of acoustic indices from the speech signal, estimation of the probability that the observed index string was caused by a hypothesized utterance segment, and determination of the recognized utterance via a search among hypothesized alternatives. This paper is not concerned with the first process. Estimation of the probability of an index string involves a model of index production by any given utterance segment (e.g., a word). Hidden Markov models (HMMs) are used for this purpose [Makhoul, J. & Schwartz, R. (1995) Proc. Natl. Acad. Sci. USA 92, 9956-9963]. Their parameters are state transition probabilities and output probability distributions associated with the transitions. The Baum algorithm that obtains the values of these parameters from speech data via their successive reestimation will be described in this paper. The recognizer wishes to find the most probable utterance that could have caused the observed acoustic index string. That probability is the product of two factors: the probability that the utterance will produce the string and the probability that the speaker will wish to produce the utterance (the language model probability). Even if the vocabulary size is moderate, it is impossible to search for the utterance exhaustively. One practical algorithm is described [Viterbi, A. J. (1967) IEEE Trans. Inf. Theory IT-13, 260-267] that, given the index string, has a high likelihood of finding the most probable utterance.

Neural networks for time-varying data

This paper reviews some basic issues and methods involved in using neural networks to respond in a desired fashion to a temporally-varying environment. Some popular network models and training methods are introduced. A speech recognition example is then used to illustrate the central difficulty of temporal data processing: learning to notice and remember relevant contextual information. Feedforward network methods are applicable to cases where this problem is not severe. The application of these methods are explained and applications are discussed in the areas of pure mathematics, chemical and physical systems, and economic systems. A more powerful but less practical algorithm for temporal problems, the moving targets algorithm, is sketched and discussed. For completeness, a few remarks are made on reinforcement learning.

Improved message passing for inference in densely connected systems

An improved inference method for densely connected systems is presented. The approach is based on passing condensed messages between variables, representing macroscopic averages of microscopic messages. We extend previous work that showed promising results in cases where the solution space is contiguous to cases where fragmentation occurs. We apply the method to the signal detection problem of Code Division Multiple Access (CDMA) for demonstrating its potential. A highly efficient practical algorithm is also derived on the basis of insight gained from the analysis. © EDP Sciences.

On the Vertex Separation of Cactus Graphs

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a \main theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.

Descripción del análisis microbológico realizado mediante maldi-tof en muestras de la fundación santa fe de Bogotá.

Introducción: La rápida detección e identificación bacteriana es fundamental para el manejo de los pacientes críticos que presentan una patología infecciosa, esto requiere de métodos rápidos para el inicio de un correcto tratamiento. En Colombia se usan pruebas microbiología convencional. No hay estudios de espectrofotometría de masas en análisis de muestras de pacientes críticos en Colombia. Objetivo general: Describir la experiencia del análisis microbiológico mediante la tecnología MALDI-TOF MS en muestras tomadas en la Fundación Santa Fe de Bogotá. Materiales y Métodos: Entre junio y julio de 2013, se analizaron 147 aislamientos bacterianos de muestras clínicas, las cuales fueron procesadas previamente por medio del sistema VITEK II. Los aislamientos correspondieron a 88 hemocultivos (60%), 28 urocultivos (19%), y otros cultivos 31 (21%). Resultados: Se obtuvieron 147 aislamientos con identificación adecuada a nivel de género y/o especie así: en el 88.4% (130 muestras) a nivel de género y especie, con una concordancia del 100% comparado con el sistema VITEK II. El porcentaje de identificación fue de 66% en el grupo de bacilos gram negativos no fermentadores, 96% en enterobacterias, 100% en gérmenes fastidiosos, 92% en cocos gram positivos, 100% bacilos gram negativos móviles y 100% en levaduras. No se encontró ninguna concordancia en bacilos gram positivos y gérmenes del genero Aggregatibacter. Conclusiones: El MALDI-TOF es una prueba rápida para la identificación microbiológica de género y especie que concuerda con los resultados obtenidos de manera convencional. Faltan estudios para hacer del MALDI-TOF MS la prueba oro en identificación de gérmenes.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)