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 109 records · Page 6Linked to original sources

PubMed1992

A new algorithm for the identification of multiple input Wiener systems.

Multiple-input Wiener systems consist of two or more linear dynamic elements, whose outputs are transformed by a multiple-input static non-linearity. Korenberg (1985) demonstrated that the linear elements of these systems can be estimated using either a first order input-output cross-covariance or a slice of the second, or higher, order input-output cross-covariance function. Korenberg's work used a multiple input LNL structure, in which the output of the static nonlinearity was then filtered by a linear dynamic system. In this paper we show that by restricting our study to the slightly simpler Wiener structure, it is possible to improve the linear subsystem estimates obtained from the measured cross-covariance functions. Three algorithms, which taken together can identify any multiple-input Wiener system, have been developed. We present the theory underlying these algorithms and detail their implementation. Simulation results are then presented which demonstrate that the algorithms are robust in the presence of output noise, and provide good estimates of the system dynamics under a wide set of conditions.

Algorithms↗

PubMed1991

[Algorithms, brains, computer. What they know and what not. II].

In order to say something substantial about the fundamental limits of machines (especially of computers) and of human calculations, we must explicate the concept of algorithm. Such an explication is provided by the Turing machine. Thus, problems have been discovered which cannot be solved algorithmically. For other problems there are problem-solving procedures, but no elegant algorithms. That men are fundamentally superior to machines has not been shown as yet.

Algorithms↗

PubMed1992

An O (N2 log N) restriction map comparison and search algorithm.

We present an O (R log P) time, O (M+P2) space algorithm for searching a restriction map with M sites for the best matches to a shorter map with P sites, where R, the number of matching site pairs, is bounded by MP. As first proposed by Waterman et al. (1984, Nucl. Acids Res. 12, 237-242) the objective function used to score matches is additive in the number of unaligned sites and the discrepancies in the distances between adjacent aligned sites. Our algorithm is basically a sparse dynamic programming computation in which "candidate lists" are used to model the future contribution of all previously computed entries to those yet to be computed. A simple modification to the algorithm computes the distance between two restriction maps with M and N sites, respectively, in O (MN (log M+log N)) time.

Algorithms↗

PubMed1990

Breath detection algorithm in digital computers.

An algorithm for the detection and delineation of breaths is described. The proposed algorithm takes into account the different, common modes of ventilation like the pressure controlled, volume controlled and patient triggered modes of ventilation. Airway flow curve is used as the basic delineator and the airway pressure and the Co2 concentration curves are used to confirm the delineation. A flow chart is also included to explain the algorithm. The detailed explanation and modifications, for additional confirmation and for the selections of constants, to check for the rise or fall of the pressure and Co2 curves, are also included.

Algorithms↗

PubMed2025

Optimising parent selection in plant breeding: comparing metaheuristic algorithms for genotype building.

Stacking desirable haplotypes across the genome to develop superior genotypes has been implemented in several crop species. A major challenge in Optimal Haplotype Selection is identifying a set of parents that collectively contain all desirable haplotypes, a complex combinatorial problem with countless possibilities. In this study, we evaluated the performance of metaheuristic search algorithms (MSAs)-genetic algorithm (GA), differential evolution (DE), particle swarm optimisation (PSO), and simulated annealing (SA) for optimising parent selection under two genotype building (GB) objectives: Optimal Haplotype Selection (OHS) and Optimal Population Value (OPV). Using a diverse wheat population of 583 lines genotyped for 29,972 SNPs, forming 7645 haplotype blocks and phenotyped for stripe rust scores, we assessed each algorithm's performance across fitness optimisation, convergence speed, and computational efficiency. GA consistently achieved high fitness and rapid convergence, while DE showed robustness but required longer runtime and careful tuning. PSO performed well under the OHS criterion but was less effective for OPV. SA, although computationally lighter, was less consistent in finding optimal solutions. Simulation over 100 breeding cycles showed that OHS outperformed both OPV and GEBV-based selection in long-term genetic gain and diversity retention. OHS maintained heterozygosity and additive variance, which are key for sustainable improvement, while GEBV selection led to early allele fixation. Our findings underscore the potential of GB strategies that prioritise the collective performance of parent sets rather than individual ranking to enhance selection outcomes in genomic-assisted breeding programmes.

Plant Breeding↗

PubMed1991

Determination of pulse wave velocities with computerized algorithms.

Careful determination of pulse wave velocity is important in the study of arterial viscoelastic properties, wave reflections, and ventricular-arterial interactions. In spite of its increasingly widespread use, there is as yet no standardized method for its determination. Most studies have manually identified the transit time of the pressure wave front as it travels over a known distance in the arterial system, but the issues of accuracy and reproducibility have not been addressed. This study was designed to investigate the efficacy of four computerized algorithms in the determination of pulse wave velocities in invasive as well as in noninvasive pressure determinations. The four methods were the identification of: (1) the point of minimum diastolic pressure, (2) the point at which the first derivative of pressure is maximum, (3) the point at which the second derivative of pressure is maximum, and (4) the point yielded by the intersection of a line tangent to the initial systolic upstroke of the pressure tracing and a horizontal line through the minimum point. High-fidelity aortic pressure recordings were obtained in 26 patients with a multi-sensor micromanometer catheter. Noninvasive brachial and radial pressure waveforms were recorded in 11 volunteers with external piezoelectric transducers. The results show that the first derivative method consistently provided results that were different from the other methods for both the invasive and noninvasive methods because of changes in the structure of the upstroke as the arterial pulse propagates distally. Although the minimum method worked well for the invasive determinations, it was erratic with the noninvasive determinations, probably because of the higher amount of noise and reflection in the latter. Among the four algorithms, the second derivative and the intersecting tangents methods worked well with both invasive and noninvasive determinations with mean variation coefficients of less than 7% and correlation coefficients between the methods of greater than 0.90 for all data. In conclusion, computerized algorithms allow accurate determination of pulse wave velocity in invasively and noninvasively measured arterial pressure waveforms.

Adult↗

PubMed1992

Echocardiographic algorithms for admission and predischarge prediction of mortality in acute myocardial infarction.

To develop improved prognostic algorithms for routine bedside use in acute myocardial infarction (AMI), the prognostic value concerning 2- and 12-month mortality of an early (within 72 hours after AMI) resting echocardiogram was defined in 201 consecutive patients. The relation between (1) the clinical variables (age, sex, prior and repeat AMI, arrhythmias, cardiac arrest, early [less than 72 hours after AMI] and late heart failure, early and maximal in-hospital Killip class, and maximal creatine kinase-MB isoenzyme), (2) early myocardial performance by echocardiography, and (3) mortality was characterized by Kaplan-Meier survival curves and receiver-operating characteristic curves based on Cox regression model. Only age and clinical heart failure in terms of the maximal in-hospital Killip class had independent predictive value of death (p less than 0.05) when an early echocardiographic estimate of left ventricular ejection fraction (LVEF) was included in the multivariate statistical models. The following 2 optimized algorithms for admission and predischarge calculation of risk of mortality at 2 and 12 months were developed based on the Cox model, using combinations of age, maximal Killip class and early echocardiographic LVEF: mortality at 2 months = 1 - exp - [0.051 x exp [0.044 x (age -60) - (0.117 x (LVEF - 40)]]; and mortality at 1 year = 1 - exp - [0.101 x exp [0.408 x (maxKillip - 1) - (0.061 x (LVEF - 40)]]. Discriminative power for prediction of mortality of the predischarge algorithm in an independent population of 195 patients 5 days after AMI compared favorably with that obtained in the original population, confirming the validity of the proposed method of prognostication.

Adult↗

PubMed1992

Analysis of the circular dichroism spectrum of proteins using the convex constraint algorithm: a practical guide.

Due to the time scale of circular dichroism (CD) measurements, it is theoretically possible to deconvolute such a spectrum if the pure CD spectra differ significantly from one another. In the last decade several methods have been published aiming at obtaining the conformational weights, or percentages (which are the coefficients for a linear combination) of the so-called typical secondary structural elements making up the three-dimensional structure of proteins. Two methods that can be used to determine the secondary structures of proteins are described here. The first method, called LINCOMB, is a simple algorithm based on a least-squares fit with a set of reference spectra representing the known secondary structures and yielding an estimation of weights attributed to alpha-helix, beta-pleated sheet (mainly antiparallel), beta-turns, unordered form, and aromatic/disulfide (or nonpeptide) contributions of the protein being analyzed. This method requires a "template" or reference curve set, which was obtained from the second method. The second method, "convex constraint analysis," is a general deconvolution method for a CD spectra set of any variety of conformational type. The algorithm, based on a set of three constraints, is able to deconvolute a set of CD curves to its common "pure"-component curves and conformational weights. To analyze a single CD spectrum with this method, the spectrum is appended to the data set used as a reference data set. As a way to determine the reliability of the algorithm and provide a guideline to its usage, some applications are presented.

Algorithms↗

PubMed1990

Utility of an algorithm in differentiating spontaneous from secondary bacterial peritonitis.

To prospectively assess the value of an algorithm in differentiating spontaneous from secondary bacterial peritonitis, we performed serial paracenteses in 43 episodes of ascitic fluid infection (28 spontaneous and 15 secondary) in 40 patients. The algorithm involved identification of (a) secondary peritonitis associated with gut perforation, based on previously proposed criteria in patients with neutrocytic ascites (ascitic fluid total protein greater than 1 g/dl, glucose less than 50 mg/dl, and lactate dehydrogenase greater than the upper limit of normal for serum) and (b) separation of spontaneous from secondary peritonitis (unassociated with perforation) based on the response of the ascitic fluid cell count to antibiotic therapy. The perforation criteria had 100% sensitivity in detecting episodes of actual gut perforation; their specificity, however, was low (45%). After 48 h of treatment the concentration of ascitic fluid neutrophils was below the baseline pretreatment value in all episodes of spontaneous peritonitis but in only two thirds of the patients with secondary peritonitis. This algorithm is useful in (a) identifying patients who have infected ascites associated with perforation of an intraabdominal viscus, and (b) differentiating spontaneous from nonperforation secondary peritonitis on the basis of the response of the ascitic fluid cell count to appropriate antibiotic therapy. The optimal time for repeat paracentesis in patients with infected ascites appears to be 48 h after initiation of treatment.

Algorithms↗

PubMed1992

Inductive learning of thyroid functional states using the ID3 algorithm. The effect of poor examples on the learning result.

The ID3 algorithm for inductive learning was tested using preclassified material for patients suspected to have a thyroid illness. Classification followed a rule-based expert system for the diagnosis of thyroid function. Thus, the knowledge to be learned was limited to the rules existing in the knowledge base of that expert system. The learning capability of the ID3 algorithm was tested with an unselected learning material (with some inherent missing data) and with a selected learning material (no missing data). The selected learning material was a subgroup which formed a part of the unselected learning material. When the number of learning cases was increased, the accuracy of the program improved. When the learning material was large enough, an increase in the learning material did not improve the results further. A better learning result was achieved with the selected learning material not including missing data as compared to unselected learning material. With this material we demonstrate a weakness in the ID3 algorithm: it can not find available information from good example cases if we add poor examples to the data.

Algorithms↗

PubMed1990

Utility of an algorithm to diagnose ectopic pregnancy.

In recent years, algorithms have been proposed to evaluate ectopic gestations. To determine the usefulness of an algorithm for a large county hospital, a surveillance project was initiated. During 2 years, 4045 women were screened in the emergency room for pregnancy. Of these, 1648 (41%) were noted to be pregnant, initially detected by rapid enzyme immunoassay for urinary human chorionic gonadotropin, and later confirmed using quantitative radioimmunoassay for serum human chorionic gonadotropin. Within this group, 249 women were diagnosed with ectopic pregnancies. Hemoperitoneum was discovered by culdocentesis in 128 of 249 cases of ectopic gestations, all operated upon acutely. A discriminatory zone for ultrasound was diagnostic of ectopic pregnancy in only 33 cases, as the majority of women presented with human chorionic gonadotropin levels below 6500 mIU/ml. Uterine curettage performed when abnormal serial levels of chorionic gonadotropin were observed detected an additional 46 cases. Early diagnosis permitted treatment prior to tubal rupture in 147 instances with conservation of the fallopian tube in 125 (50%). We conclude: (1) even in a busy county emergency room, algorithms are useful for expediting the diagnosis of ectopic pregnancy; (2) when ectopics are diagnosed early, conservative tubal surgery is possible in many patients.

Algorithms↗

PubMed1990

Real-time tracking of parameters of lung mechanics: emphasis on algorithm tuning.

We consider the problem of tracking rapid changes in the viscous and elastic properties of the respiratory system by using mouth flow and transpulmonary pressure data measured during mechanical ventilation. A recursive least-squares algorithm with adjustable compensator is used for online estimation of an R-C model of the breathing mechanics. Specific simulation experiments are presented to provide guidelines to select suitable values for the key variable, which controls the compromise between tracking ability and noise sensitivity. The results obtained confirm the critical role of the optimum tuning in relation to the noise level. Experimental results obtained from data measured on mechanically-ventilated dogs, in which respiratory distress syndrome was intravenously induced by oleic acid, demonstrate that the tuned algorithm is able to track appropriately both the viscous and elastic properties of lung mechanics. Parameter estimates are consistent with those obtained by standard and robust offline algorithms and their time course is in qualitative agreement with known physiopathological behaviour.

Airway Resistance↗

PubMed1990

A flexible FFT algorithm for processing biomedical signals using a personal computer.

The aim was to demonstrate the possibility of using personal computer PC-DOS (or generally MS-DOS) for real-time (or quasi real-time) biomedical signal processing by adding a simple A/D conversion card and the mathematical coprocessor XXX87. We have realized an assembly written fast Fourier transform (FFT) routine derived from a radix-4 algorithm, which is autogenerated, i.e. an algorithm modified by another algorithm running off-line according to the number of FFT points. The program is implemented as a subroutine to be called upon by high-level language in different procedures. This approach reduces the computational time, which is particularly useful when many Fourier transforms on different data arrays are required. Reported here are two different applications of the routine as applied to the spectral analysis of Doppler ultrasound velocimetry and surface electromyography.

Algorithms↗

PubMed1992

A practical evaluation of five dose-volume histogram reduction algorithms.

A unifying approach to cumulative dose-volume histogram (CDVH) reduction analysis is presented, utilising two weighted linear interpolation models (VWD, DWV), two weighted probability models (VWP, DWP) and a novel integral probability model (IPM). As a test of their predictive value these algorithms were applied to CDVH data generated from lung doses, measured by TLD arrays in a female anthropomorphic phantom. Three arbitrary configurations of breast size and location of "target volume" within the breast were "treated", using an appropriate electron field (Varian Clinac 1800) or double-plane iridium-192 implant. Calculated effective doses from each of the reduction algorithms showed the iridium implant to be dosimetrically the most favourable in two the three configurations. Likewise, complication probabilities, based on a logistic dose-volume response function showed lung complication probabilities to be lower for the interstitial technique in the same situations. All algorithms tested showed reasonable consistency, with the exception of the VWD. The rationale and value of comparative rather than absolute dose-volume histogram analyses are discussed.

Algorithms↗

PubMed1992

An algorithm for tight glycaemic control in diabetic infarct survivors.

An algorithm has been developed to provide predictable control of blood glucose for 48 h following acute myocardial infarction. In 29 diabetic patients intravenous infusion of soluble insulin was started upon admission to hospital and the rate adjusted hourly on the basis of bedside capillary glucose estimations. Insulin infusion rates related to glycaemia were higher in obese patients and those with severe cardiac failure. For all patients mean admission glucose levels were reduced from 18.3 +/- 5.9 mmol l-1 to 9.1 +/- 3.3 mmol l-1 at 4 h and to 8.8 +/- 2.5 mmol l-1 at 6 h. Mean glucose concentrations for 48 h after admission were 8.2 +/- 1.3 mmol l-1 for all patients. Admission glucose levels were slightly higher in patients with severe, compared to those without or mild, cardiac failure (P less than 0.1), but levels over the following 48 h were similar. Doubling insulin infusion rates before meals did not achieve tighter glycaemic control. Hypoglycaemia (glucose less than 3 mmol l-1) occurred on 11 occasions in six patients; only two episodes were symptomatic and only two episodes occurred when the insulin rates were doubled before meals. This algorithm produced tighter glycaemic control than previously published protocols, particularly in patients with severe cardiac failure. Hypoglycaemia is uncommon and the algorithm easy to administer by nursing staff.

Algorithms↗

PubMed1992

An algorithmic approach to the management of cutaneous burns.

An algorithm of fluid resuscitation for cutaneous burns is presented. The management of these cases entails an initial process of evaluation followed, when appropriate, by the administration of intravenous fluids. The fluid requirements are prospectively calculated and subsequently modified by using closed loop feedback with monitoring of urine output, plasma deficit, osmolality and vital signs. Three 'problem boxes' have been incorporated into the algorithm to outline the management of: 1. fluid deficit and excess; 2. acute renal failure; 3. the critically ill patient. An algorithm such as this can never be complete, but in its present form it provides both a teaching tool for junior staff as well as a valuable clinical aid for those involved in the acute management of burns patients.

Algorithms↗

PubMedDate not supplied

Image segmentation in digital mammography: comparison of local thresholding and region growing algorithms.

Local thresholding and region-growing algorithms are developed and applied to digitized mammograms to quantify the parenchymal densities. The algorithms are first evaluated and optimized on phantom images reflecting varying image contrast, X-ray exposure conditions, and time-related changes. The difference between the segmentation results of the two techniques is less than 6% on the phantom images and 11% on the mammograms. The agreement between the computerized procedures and a manual one is in the range of 74-98%, depending on the breast parenchymal pattern and segmentation algorithm. The results show that computerized parenchymal classification of digitized mammograms is possible and independent of exposure.

Algorithms↗

PubMedDate not supplied

Do Doppler color flow algorithms for mapping disturbed flow make sense?

It has been suggested that a major advantage of Doppler color flow mapping is its ability to visualize areas of disturbed ("turbulent") flow, for example, in valvular stenosis or regurgitation and in shunts. To investigate how various color flow mapping instruments display disturbed flow information, color image processing was used to evaluate the most common velocity-variance color encoding algorithms of seven commercially available ultrasound machines. In six of seven machines, green was reportedly added by the variance display algorithms to map areas of disturbed flow. The amount of green intensity added to each pixel along the red and blue portions of the velocity reference color bar was calculated for each machine. In this study, velocities displayed on the reference color bar ranged from +/- 46 to +/- 64 cm/sec, depending on the Nyquist limit. Of note, changing the Nyquist limits depicted on the color reference bars did not change the distribution of the intensities of red, blue, or green within the contour of the reference map, but merely assigned different velocities to the pixels. Most color flow mapping algorithms in our study added increasing intensities of green to increasing positive (red) or negative (blue) velocities along their color reference bars. Most of these machines also added increasing green to red and blue color intensities horizontally across their reference bars as a marker of increased variance (spectral broadening). However, at any given velocity, marked variations were noted between different color flow mapping instruments in the amount of green added to their color velocity reference bars.(ABSTRACT TRUNCATED AT 250 WORDS)

Algorithms↗