SEARCH · PubMed Health

Results for “Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 415 records · Page 23Linked to original sources

PubMed2000

Simplified algorithms for the estimation of 99Tcm-MAG3 clearance.

The aim of this study was to evaluate two formulae allowing the determination of MAG3 clearance by means of a single blood sample, namely Bubeck's formula and Russell's formula. As a first step, a simulation study was performed with the two single-sample algorithms to predict MAG3 clearance as a function of plasma concentration, using various times for blood sampling and various body surface areas. As a second step, a validation study on 47 adult patients with varying renal function allowed a clinical comparison between the reference technique, namely the multiple blood sample technique, and the two simplified techniques. The simplified algorithms were calculated using the fitted value at 44 min. In the simulation study, whatever the time of blood sampling or the level of correction introduced for body surface area, the results obtained by means of Bubeck's algorithm diverged significantly from those of Russell's algorithm, for low clearance values as well as for high clearance values. The curve of the differences between the two methods had a typical boomerang shape. In the clinical study, the difference between Russell's algorithm and the reference method was generally within 20 ml.min-1, with no systematic bias; with Bubeck's algorithm there was a marked underestimation, both in the low and high clearance ranges. We suggest Russell's single-sample method is the method of choice.

Adult↗

PubMed2001

Risk-based versus alternative algorithms for antibiotic prophylaxis among women seeking early suction abortion: a cost-effectiveness simulation.

BACKGROUND: Particularly in resource-poor settings, simple, inexpensive, and cost-effective algorithms are needed to direct antibiotic prophylaxis to prevent sequelae of infections with Chlamydia trachomatis, Neisseria gonorrhoeae, and bacterial vaginosis-associated organisms among women undergoing abortion. GOAL: To assess the prevalence of and risk factors for infections among women seeking abortion in Bali, Indonesia, and to use these data in designing a cost-effective risk-based prophylaxis algorithm. STUDY DESIGN: A cross-sectional analysis and data-based simulation of risk-based and alternative prophylaxis algorithms were performed. RESULTS: The risk-based algorithm would have provided prophylaxis to 70% (95% CI, 53-83%) of women with cervical infection, 64% (95% CI, 54-74%) of those with bacterial vaginosis, and 57% (95% CI, 42-72%) of those with trichomoniasis. For cervical infection, the algorithm was more cost effective than all others evaluated. The cost-effectiveness was acceptable for bacterial vaginosis. CONCLUSIONS: Risk-based algorithms may be cost effective in identifying women likely to benefit from preabortion prophylaxis. Prospective evaluation is needed to validate these findings.

Abortion, Induced↗

PubMed2003

Assessment of the validity of and adherence to sexually transmitted infection algorithms at a female sex worker clinic in Abidjan, Côte d'Ivoire.

BACKGROUND: Algorithms for sexually transmitted infection (STI) case management were designed in a female sex worker (FSW) clinic in Abidjan, Côte d'Ivoire, in 1993. GOAL: The goal was to evaluate the long-term validity of the algorithms for returning clients of the clinic and to assess the adherence of the health workers to their application. STUDY DESIGN: A cross-sectional study was conducted from 1999 to 2000 among FSWs attending as returning clients. RESULTS: The prevalences of genital infections were as follows: Neisseria gonorrhoeae and/or Chlamydia trachomatis, 8.2%; Trichomonas vaginalis, 16.7%; bacterial vaginosis, 62.3%; and Candida albicans, 6.2%. The sensitivity of the algorithms was 20% and the positive predictive value was 14% for cervical infection. The proportion of cases for which all steps of the algorithm were correctly applied was 30%. CONCLUSION: Algorithms for the treatment of STIs in FSWs should be periodically reevaluated and adapted to the changing population. To maintain healthcare workers' adherence to the algorithms, supervision should be ongoing and reinforced.

Adolescent↗

PubMed2001

Validation of a new algorithm for the BPM-100 electronic oscillometric office blood pressure monitor.

BACKGROUND: To test the accuracy of a new algorithm for the BPM-100, an automated oscillometric blood pressure (BP) monitor, using stored data from an independently conducted validation trial comparing the BPM-100(Beta) with a mercury sphygmomanometer. DESIGN: Raw pulse wave and cuff pressure data were stored electronically using embedded software in the BPM-100(Beta), during the validation trial. The 391 sets of measurements were separated objectively into two subsets. A subset of 136 measurements was used to develop a new algorithm to enhance the accuracy of the device when reading higher systolic pressures. The larger subset of 255 measurements (three readings for 85 subjects) was used as test data to validate the accuracy of the new algorithm. METHODS: Differences between the new algorithm BPM-100 and the reference (mean of two observers) were determined and expressed as the mean difference +/- SD, plus the percentage of measurements within 5, 10, and 15 mmHg. RESULTS: The mean difference between the BPM-100 and reference systolic BP was -0.16 +/- 5.13 mmHg, with 73.7% < or = 5 mmHg, 94.9% < or = 10 mmHg and 98.8% < or = 15 mmHg. The mean difference between the BPM-100 and reference diastolic BP was -1.41 +/- 4.67 mmHg, with 78.4% < or = 5 mmHg, 92.5% < or = 10 mmHg, and 99.2% < or = 15 mmHg. These data improve upon that of the BPM-100(Beta) and pass the AAMI standard, and 'A' grade BHS protocol. CONCLUSION: This study illustrates a new method for developing and testing a change in an algorithm for an oscillometric BP monitor utilizing collected and stored electronic data and demonstrates that the new algorithm meets the AAMI standard and BHS protocol.

Adolescent↗

PubMed2000

Evaluation of an algorithm for treatment of status epilepticus in adult patients undergoing video/EEG monitoring.

Convulsive or generalized tonic clonic status epilepticus (SE) is a neurological emergency that can lead to transient or permanent brain damage or even death. An algorithm was designed to aid nursing and medical staff members in decision making about the type of SE and pharmacological intervention needed to stop prolonged or repetitive seizures. Fifteen registered nurses at a northern New England medical center's epilepsy unit participated in educational sessions on classification of seizures and status epilepticus prior to use of the algorithm. A pretest-posttest design with an investigator-developed tool was used to measure SE knowledge before and after educational intervention. There was a significant improvement in scores on the posttest of the classification of status epilepticus (Z = -2.93, p = .003). Twenty-nine medical records of patients who had experienced SE between February 1992 and December 1997 were reviewed. Nineteen patients experienced SE before the algorithm was implemented, and 10 patients experienced SE after the algorithm was implemented. A total of 16 patients experienced generalized convulsive SE with 12 episodes occurring before and 4 episodes after algorithm implementation. The mean time taken to stop the episode of SE after pharmacologic treatment began was compared in both groups using a t-test. The mean difference between the groups was 235 minutes (t = 2.57, p = .026). The findings of this project demonstrate that combining a treatment algorithm with education of staff members on its use has benefits in the practice setting of an inpatient comprehensive epilepsy program. Episodes of SE are more accurately classified and successful treatment of the episodes occurs earlier.

Adolescent↗

PubMed2001

Algorithms for deriving crystallographic space-group information. II. Treatment of special positions.

Algorithms for the treatment of special positions in three-dimensional crystallographic space groups are presented. These include an algorithm for the determination of the site-symmetry group given the coordinates of a point, an algorithm for the determination of the exact location of the nearest special position, an algorithm for the assignment of a Wyckoff letter given the site-symmetry group, and an alternative algorithm for the assignment of a Wyckoff letter given the coordinates of a point directly. All algorithms are implemented in ISO C++ and are integrated into the Computational Crystallography Toolbox. The source code is freely available.

Algorithms↗

PubMed2003

Numerically stable algorithms for the computation of reduced unit cells.

The computation of reduced unit cells is an important building block for a number of crystallographic applications, but unfortunately it is very easy to demonstrate that the conventional implementation of cell reduction algorithms is not numerically stable. A numerically stable implementation of the Niggli-reduction algorithm of Krivý & Gruber [Acta Cryst. (1976), A32, 297-298] is presented. The stability is achieved by consistently using a tolerance in all floating-point comparisons. The tolerance must be greater than the accumulated rounding errors. A second stable algorithm is also presented, the minimum reduction, that does not require using a tolerance. It produces a cell with minimum lengths and all angles acute or obtuse. The algorithm is a simplified and modified version of the Buerger-reduction algorithm of Gruber [Acta Cryst. (1973), A29, 433-440]. Both algorithms have been enhanced to generate a change-of-basis matrix along with the parameters of the reduced cell.

Algorithms↗

PubMed1995

Two new algorithms for tracking arterial parameters in nonstationary noise conditions.

Two new algorithms with reduced sensitivity to the changing environment are applied to tracking arterial circulation parameters. They are variants of the Least-Squares (LS) algorithm with Variable Forgetting factor (LSVF), and of the Constant Forgetting factor-Covariance Modification (CFCM) LS algorithm, devised to overcome their main practical deficiencies related to noise level sensitivity and the high number of design variables, respectively. To this end, adaptive mechanisms are incorporated to estimate observation noise variance in LSVF and the rate of change for the different parameters in CFCM. Specific computer simulation experiments are presented to compare their effectiveness with the original counterparts and to provide guidelines for their optimal tuning at different noise levels. Moreover, algorithm performance degradation, consequent on changes in the noise level compared to that assumed during the tuning phase, is analyzed. In particular, it is shown that, when the noise level changes with respect to the tuning value, the new LSVF algorithm is much more robust than the original one, whose performance degrades rapidly. The new CFCM algorithm is characterized by a reduced number of design variables with respect to its original counterpart. Nevertheless, it can be preferred only when low noise signals are used for estimation.

Algorithms↗

PubMed1996

A novel family of compression algorithms for ECG and other semiperiodical, one-dimensional, biomedical signals.

In this paper, a novel family of compression algorithms is presented, which is designed to exploit the redundancy of one-dimensional (1-D) semiperiodical biomedical signals resulting from the cyclic nature of the underlying physical process. The basic idea is that a pool of past-seen cycles is maintained and cycles to be encoded can be stored as transformed versions of those residing in the pool. Conceptually, this approach is an extension of dictionary-based coding schemes used for text compression to signal patterns residing in an n-dimensional space. A cycle transformation method is introduced in order to render the pattern matching process practical and to enable cycle substitution. Based on the principles of the algorithmic family and this transformation method, an electrocardiogram (ECG)-oriented algorithm is implemented and thoroughly tested. The performance of this implementation is examined theoretically and deductions about the optimal algorithm settings are made. The ECG compression algorithm is superior to the average beat subtraction algorithm as proposed by Hamilton and Tompkins in cases where high compression ratios are required.

Algorithms↗

PubMed1999

Monotonic algorithms for transmission tomography.

We present a framework for designing fast and monotonic algorithms for transmission tomography penalized-likelihood image reconstruction. The new algorithms are based on paraboloidal surrogate functions for the log likelihood. Due to the form of the log-likelihood function it is possible to find low curvature surrogate functions that guarantee monotonicity. Unlike previous methods, the proposed surrogate functions lead to monotonic algorithms even for the nonconvex log likelihood that arises due to background events, such as scatter and random coincidences. The gradient and the curvature of the likelihood terms are evaluated only once per iteration. Since the problem is simplified at each iteration, the CPU time is less than that of current algorithms which directly minimize the objective, yet the convergence rate is comparable. The simplicity, monotonicity, and speed of the new algorithms are quite attractive. The convergence rates of the algorithms are demonstrated using real and simulated PET transmission scans.

Algorithms↗

PubMed2000

Reconstruction algorithm for polychromatic CT imaging: application to beam hardening correction.

This paper presents a new reconstruction algorithm for both single- and dual-energy computed tomography (CT) imaging. By incorporating the polychromatic characteristics of the X-ray beam into the reconstruction process, the algorithm is capable of eliminating beam hardening artifacts. The single energy version of the algorithm assumes that each voxel in the scan field can be expressed as a mixture of two known substances, for example, a mixture of trabecular bone and marrow, or a mixture of fat and flesh. These assumptions are easily satisfied in a quantitative computed tomography (QCT) setting. We have compared our algorithm to three commonly used single-energy correction techniques. Experimental results show that our algorithm is much more robust and accurate. We have also shown that QCT measurements obtained using our algorithm are five times more accurate than that from current QCT systems (using calibration). The dual-energy mode does not require any prior knowledge of the object in the scan field, and can be used to estimate the attenuation coefficient function of unknown materials. We have tested the dual-energy setup to obtain an accurate estimate for the attenuation coefficient function of K2 HPO4 solution.

Algorithms↗

PubMed1997

Segmentation algorithms for detecting microcalcifications in mammograms.

The presence of microcalcification clusters in mammograms contributes evidence for the diagnosis of early stages of breast cancer. In many cases, microcalcifications are subtle and their detection can benefit from an automated system serving as a diagnostic aid. The potential contribution of such a system may become more significant as the number of mammograms screened increases to levels that challenge the capacity of radiology clinics. Many techniques for detecting microcalcifications start with a segmentation algorithm that indicates all candidate structures for the subsequent phases. Most algorithms used to segment microcalcifications have aspects that might raise operational difficulties, such as thresholds or windows that must be selected, or parametric models of the data. We present a new segmentation algorithm and compare it to two other algorithms: the multi-tolerance region growing algorithm that operates without the aspects mentioned above, and the active contour model that has not been applied previously to segment microcalcifications. The new algorithm operates without threshold or window selection, or parametric data models, and it is more than an order of magnitude faster than the other two.

Algorithms↗

PubMed1997

Dynamic image data compression in spatial and temporal domains: theory and algorithm.

Advanced medical imaging requires storage of large quantities of digitized clinical data. These data must be stored in such a way that their retrieval does not impair the clinician's ability to make a diagnosis. In this paper, we propose the theory and algorithm for near (or diagnostically) lossless dynamic image data compression. Taking advantage of domain-specific knowledge related to medical imaging, the medical practice and the dynamic imaging modality, a compression ratio greater than 80:1 is achieved. The high compression ratios are achieved by the proposed compression algorithm through three stages: 1) addressing temporal redundancies in the data through application of image optimal sampling, 2) addressing spatial redundancies in the data through cluster analysis, and 3) efficient coding of image data using standard still-image compression techniques. To illustrate the practicality of the proposed compression algorithm, a simulated positron emission tomography (PET) study using the fluoro-deoxy-glucose (FDG) tracer is presented. Realistic dynamic image data are generated by "virtual scanning" of a simulated brain phantom as a real PET scanner. These data are processed using the conventional [8] and proposed algorithms as well as the techniques for storage and analysis. The resulting parametric images obtained from the conventional and proposed approaches are subsequently compared to evaluate the proposed compression algorithm. As a result of this study, storage space for dynamic image data is able to be reduced by more than 95%, without loss in diagnostic quality. Therefore, the proposed theory and algorithm are expected to be very useful in medical image database management and telecommunication.

Algorithms↗

PubMed2004

Partially supervised learning using an EM-boosting algorithm.

Training data in a supervised learning problem consist of the class label and its potential predictors for a set of observations. Constructing effective classifiers from training data is the goal of supervised learning. In biomedical sciences and other scientific applications, class labels may be subject to errors. We consider a setting where there are two classes but observations with labels corresponding to one of the classes may in fact be mislabeled. The application concerns the use of protein mass-spectrometry data to discriminate between serum samples from cancer and noncancer patients. The patients in the training set are classified on the basis of tissue biopsy. Although biopsy is 100% specific in the sense that a tissue that shows itself to have malignant cells is certainly cancer, it is less than 100% sensitive. Reference gold standards that are subject to this special type of misclassification due to imperfect diagnosis certainty arise in many fields. We consider the development of a supervised learning algorithm under these conditions and refer to it as partially supervised learning. Boosting is a supervised learning algorithm geared toward high-dimensional predictor data, such as those generated in protein mass-spectrometry. We propose a modification of the boosting algorithm for partially supervised learning. The proposal is to view the true class membership of the samples that are labeled with the error-prone class label as missing data, and apply an algorithm related to the EM algorithm for minimization of a loss function. To assess the usefulness of the proposed method, we artificially mislabeled a subset of samples and applied the original and EM-modified boosting (EM-Boost) algorithms for comparison. Notable improvements in misclassification rates are observed with EM-Boost.

Algorithms↗

PubMed1991

Counting algorithms for linkage: correction to Morton and Collins.

In a recent paper, Morton & Collins (1990) claimed: (1) that the Lander-Green algorithm for genetic linkage analysis is not the EM algorithm for finding the maximum likelihood map; and (2) that a proposed alternative algorithm does have these properties. Here, we show that these assertions are both incorrect: the Lander-Green algorithm is an EM algorithm, while the Morton-Collins algorithm is not. We note that Morton and Collins concur with these conclusions.

Algorithms↗

PubMed2000

The development and validation of an algorithm for real-time computerised fetal heart rate monitoring in labour.

OBJECTIVE: To develop and validate a computerised algorithm for the interpretation of the characteristics of fetal heart rate monitoring in labour. DESIGN: Prospective observational study. SETTING: Labour ward in a tertiary hospital. SAMPLE: Intrapartum cardiotocograms from 24 pregnancies. METHODS: A computerised algorithm was developed to assess the fetal heart baseline rate, variability, the number of accelerations and the number of decelerations. Twenty five minute segments of cardiotocograms were interpreted by the algorithm and also by seven expert reviewers independently. The reviewers were unaware of the outcome of labour. The reliability of the characteristics of cardiotocography and the validity of the computerised algorithm were assessed using the intraclass correlation coefficient and weighted kappa statistic for continuous and ordinal variables respectively. RESULTS: The inter rater reliability of the baseline fetal heart rate and the number and type of decelerations was good (intraclass correlation coefficient 0.93, 0.93 and 0.79, respectively). The reliability of baseline variability (kappa = 0.27) and accelerations (intraclass correlation coefficient = 0.27) was poor. The computerised algorithm had good agreement with the reviewers for the baseline fetal heart rate (intraclass correlation coefficient 0.91 to 0.98) and the number of decelerations (intraclass correlation coefficient 0.82 to 0.91), but was less valid as regards the number of late decelerations (intraclass correlation coefficient 0.68 to 0.85) and the number of accelerations (intraclass correlation coefficient 0.06 to 0.80), and was invalid as regards baseline variability (kappa 0.00 to 0.34). CONCLUSIONS: The high level of validity of the computerised algorithm for the estimation of the baseline fetal heart rate and the number of decelerations justifies its further technical development.

Adolescent↗

PubMed1988

Heart rate correlation, response time and effect of previous exercise using an advanced pacing rate algorithm for temperature-based rate modulation.

A temperature-based algorithm to produce pacing rate that resembles chronotropic response to activity was developed. Measurement criteria for the algorithm included workload dependent rate increases with activity and response time within 60 seconds of exercise onset. To evaluate the algorithm, right ventricular blood temperature was recorded during rest and treadmill exercise in 25 patients with implanted Kelvin 500 pacemakers (Cook Pacemaker). Patients included 16 males and nine females, ages 44-81 (mean 72). Indications for pacing were sinus node disease, atrioventricular block and atrial fibrillation with slow ventricular response. Temperature changes reflected physical activity as well as emotional stress. The algorithm was based on the rate of change (dT/dt), the relative change (delta T) and the baseline history (T) of temperature. At exercise onset, a rapid, brief drop in temperature (dT/dt) typically occurred due to peripheral vasodilation, causing prompt increase in pacing rate. As exercise continued, the increase in metabolic rate caused dT/dt as well as delta T to increase, further increasing pacing rate. After exercise, temperature returned to resting level which correspondingly decreased the pacing rate. Sensitivity of the algorithm to temperature variations, and the upper and lower pacing rate limits were programmable to adapt to individual patient needs. The rates produced by the algorithm mimicked intrinsic rate response for various activity levels and produced a mean response time of 16 seconds from exercise onset. Previous exercise had no significant effect on response time. Correlation between normal chronotropic response and simulated pacing rate from five exercise tests was 0.92. These results show good specificity and refute the statement that blood temperature yields a slow response.

Adult↗

PubMed1990

Endless-loop tachycardias: description and first clinical results of a new fully automatic protection algorithm.

Endless-loop tachycardia (ELT) is one of the most common pacemaker mediated tachycardia. An innovative ELT protection algorithm has proven to be clinically effective. A new improved version that will eliminate the need to program any parameter is now under clinical evaluation. Nine patients entered the study: six men and three women, aged 52 +/- 22 years. This automatic algorithm needs only 10 cycles to detect and confirm an ELT. Three hundred thirty-three ELTs lasting more than 9 cycles have been induced and analyzed. The total results are the following: mean duration: 6.7 sec +/- 3.1; mean ELT rate: 137 +/- 21.9 bpm, mean programmed upper rate limit (URL): 142.5 +/- 26.5 bpm (Only 70% of ELTs presented rates equal to programmed URL). (1) ELTs reduced by postventricular atrial refractory period (PVARP) extension on one cycle: 291 ELTs (87%). ELT rate: 128.5 +/- 18.2 bpm. (2) Retrograde block: algorithm operation may induce a retrograde block due to a short atrioventricular delay (AVD) applied during the confirmation phase to discriminate an ELT from a stable sinus rhythm. Thirty-two ELTs (10%) have been reduced and detected on a retrograde block occurrence. (3) Algorithm failure due to an unstable ventriculoatrial conduction time (VACT) even at fixed rate or to a retrograde Wenckebach behavior on AVD reduction during the confirmation phase. A total of 10 algorithms failed to detect or confirm an ELT have been recorded (3%). Mean duration: 8.2 +/- 4.2 sec, mean ELT rate: 148.9 +/- 14.3 bpm. This new fully automatic algorithm has reduced 97% of ELTs, including high rate episodes (100-175 bpm).(ABSTRACT TRUNCATED AT 250 WORDS)

Algorithms↗