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 1,549 records · Page 86Linked to original sources

PubMed1997

Time quantified detection of fetal movements using a new fetal movement algorithm.

Primarily, the objective is to develop an automated ultrasound fetal movement detection system that will better characterize fetal movements. Secondarily, the objective is to develop an improved method of quantifying the performance of fetal movement detectors. We recorded 20-minute segments of fetal movement on 101 patients using a UAMS-developed fetal movement detection algorithm (Russell algorithm) and compared this to a Hewlett-Packard (HP) M-1350-A. Movements were recorded on a second-per-second basis by an expert examiner reviewing videotaped real-time ultrasound images. Videotape (86,592 seconds) was scored and compared with the electronic movement-detection systems. The Russell algorithm detected 95.53% of the discrete movements greater than 5 seconds, while the HP system (M-1350-A) detected only 86.08% of the discrete movements (p = 0.012). Both devices were less efficient at detecting the short discrete movements, obtaining sensitivities of 57.39 and 35.22, respectively. Neither system fully identifies fetal movement based on the second-per-second system. Improved methods of quantifying performance indicated that the Russell algorithm performed better than the HP on these patients.

Adolescent↗

PubMed2006

The finite state projection algorithm for the solution of the chemical master equation.

This article introduces the finite state projection (FSP) method for use in the stochastic analysis of chemically reacting systems. One can describe the chemical populations of such systems with probability density vectors that evolve according to a set of linear ordinary differential equations known as the chemical master equation (CME). Unlike Monte Carlo methods such as the stochastic simulation algorithm (SSA) or tau leaping, the FSP directly solves or approximates the solution of the CME. If the CME describes a system that has a finite number of distinct population vectors, the FSP method provides an exact analytical solution. When an infinite or extremely large number of population variations is possible, the state space can be truncated, and the FSP method provides a certificate of accuracy for how closely the truncated space approximation matches the true solution. The proposed FSP algorithm systematically increases the projection space in order to meet prespecified tolerance in the total probability density error. For any system in which a sufficiently accurate FSP exists, the FSP algorithm is shown to converge in a finite number of steps. The FSP is utilized to solve two examples taken from the field of systems biology, and comparisons are made between the FSP, the SSA, and tau leaping algorithms. In both examples, the FSP outperforms the SSA in terms of accuracy as well as computational efficiency. Furthermore, due to very small molecular counts in these particular examples, the FSP also performs far more effectively than tau leaping methods.

Algorithms↗

PubMedDate not supplied

Telemanagement of heart failure: a diuretic treatment algorithm for advanced practice nurses.

Thirty-three percent of patients with heart failure (HF) are readmitted to the hospital with worsening disease within 90 days of discharge. Acute decompensation accounts for nearly 50% of these admissions because of nonadherence with diet guidelines, medication regimens, or both. One way to promote adherence is through a disease management approach that can prevent HF decompensation by providing aggressive follow-up care. Within such an approach, advanced practice nurses can use a decision algorithm to implement pharmacologic and nonpharmacologic interventions. This article presents a diuretic treatment algorithm for advanced practice nurses as part of a telemanagement program. Preliminary data from the implementation of such an algorithm within an established HF program shows a decrease in hospitalizations rates and cost of care. In addition, the algorithm helps define the scope of advanced practice nursing and promotes consistency across health care sites.

Algorithms↗

PubMedDate not supplied

Left ventricular ejection fraction and volumes from gated blood pool tomography: comparison between two automatic algorithms that work in three-dimensional space.

BACKGROUND: Two different algorithms, which are fast and automatic and which operate in 3-dimensional space, were compared in the same group of patients to compute left ventricular ejection fraction (LVEF) and volumes from gated blood pool tomography. One method, developed at Cedars-Sinai Medical Center (CS), was dependent on surface detection, whereas the other method, developed at the Free University of Brussels (UB), used image segmentation. METHODS AND RESULTS: Gated blood pool tomograms were acquired in 92 consecutive patients after injection of 740 MBq of technetium 99m-labeled human serum albumin. After reconstruction and reorientation according to the left ventricular long axis, LVEF and left ventricular volumes were measured with the CS and UB algorithms. Measurements of LVEF were validated against planar radionuclide angiocardiography (PRNA) results. The success rates of the algorithms were 87% for CS and 97% for UB. Agreement between LVEF measured with CS and UB (LVEF(CS) = 0.91. LVEF(UB) - 0.85; r = 0.87) and between LVEF measured with CS and PRNA (LVEF(CS) = 1.04. LVEF(PRNA) - 4.75; r = 0.80) and UB and PRNA (LVEF(UB) = 0.98. LVEF(PRNA) + 4.42; r = 0.82) was good. For left ventricular volumes, linear regression analysis showed good correlation between both methods with regard to end-diastolic volumes (r = 0.81) and end-systolic volumes (r = 0.91). On average, end-diastolic volumes were similar and end-systolic volumes were slightly higher with CS than with UB. Consequently, significantly lower LVEFs were observed with CS than with UB. CONCLUSIONS: Good correlation was observed between CS and UB for both left ventricular volumes and ejection fraction. In addition, measurements of LVEF obtained with both algorithms correlated fairly well with those obtained from conventional PRNA over a wide range of values.

Adult↗

PubMed2004

A biologically inspired algorithm for the recovery of shading and reflectance images.

We present an algorithm for separating the shading and reflectance images of photographed natural scenes. The algorithm exploits the constraint that in natural scenes chromatic and luminance variations that are co-aligned mainly arise from changes in surface reflectance, whereas near-pure luminance variations mainly arise from shading and shadows. The novel aspect of the algorithm is the initial separation of the image into luminance and chromatic image planes that correspond to the luminance, red-green, and blue-yellow channels of the primate visual system. The red-green and blue-yellow image planes are analysed to provide a map of the changes in surface reflectance, which is then used to separate the reflectance from shading changes in both the luminance and chromatic image planes. The final reflectance image is obtained by reconstructing the chromatic and luminance-reflectance-change maps, while the shading image is obtained by subtracting the reconstructed luminance-reflectance image from the original luminance image. A number of image examples are included to illustrate the successes and limitations of the algorithm.

Algorithms↗

PubMedDate not supplied

Morse code recognition system with fuzzy algorithm for disabled persons.

It is generally known that Morse code is an efficient input method for one or two switches and it is made from long and short sounds separated by silence between the sounds. The long-to-short ratio in the definition is always 3 to 1, but the long-to-short ratio variation for a disabled person is so large that it is difficult to recognize. In the last few years, several Morse code recognition methods have been successfully built on the LMS adaptive algorithms and neural network algorithm. But LMS-related adaptive algorithms need mass computation to infer the characteristic of the controller; also the neural network must learn first, by inputting some data before it is used to recognize the Morse code sequence. In this study, two fuzzy algorithms are used to recognize the unstable Morse code sequences and the result demonstrates a significant improvement of recognition for real time signal processing in a single-chip microprocessor.

Adolescent↗

PubMedDate not supplied

An algorithm for synchronization of in vivo electroporation with ECG.

The combined treatment of tumours in which delivery of a chemotherapeutic agent is followed by high voltage electroporation pulses has been termed electrochemotherapy. The electrochemotherapy of tumours located relatively close to the heart muscle can lead to fibrillation of the heart, especially if electroporation pulses are delivered in the vulnerable period of the heart or in coincidence with heart arrhythmias. We built an electroporation pulse delivery algorithm that enables safer use of electrochemotherapy. The algorithm is designed to deliver pulses outside the vulnerable period and to prevent pulses from being generated in the presence of heart arrhythmias. We evaluated the algorithm's performance using records of the Long-Term ST Database, thus simulating real-world conditions. The results of the evaluation, a sensitivity of 91.751%, a positive predictivity of 100.000% and a delivery error rate of 8.268% for electroporation pulse delivery (medians), suggest that the algorithm is accurate and appropriate for application in electrochemotherapy of tumours regardless of tumour location.

Algorithms↗

PubMed2003

A genetic algorithm with conformational memories for structure prediction of polypeptides.

We have developed an iterative hybrid algorithm (HA) to predict the 3D structure of peptides starting from their amino acid sequence. The HA is made of a modified genetic algorithm (GA) coupled to a local optimizer. Each HA iteration is carried out in two phases. In the first phase several GA runs are performed upon the entire peptide conformational space. In the second phase we used the manifestation of what we have called conformational memories, that arises at the end of the first phase, as a way of reducing the peptide conformational space in subsequent HA iterations. Use of conformational memories speeds up and refines the localization of the structure at the putative Global Energy Minimum (GEM) since conformational barriers are avoided. The algorithm has been used to predict successfully the putative GEM for Met- and Leu-enkephalin, and to obtain useful information regarding the 3D structure for the 8mer of polyglycine and the 16 residue (AAQAA)(3)Y peptide. The number of fitness function evaluations needed to locate the putative GEMs are fewer than those reported for other heuristic methods. This study opens the possibility of using Genetic Algorithms in high level predictions of secondary structure of polypeptides.

Algorithms↗

PubMed1989

An algorithm for the treatment of pain in advanced cancer.

An algorithm is presented that has been developed over the past three years to provide pain relief in advanced cancer. The hospital records of 92 patients were reviewed to evaluate the validity of the algorithm. The algorithm is as follows: the 24 hour oral consumption of opioids was converted to sustained release morphine. If ineffective usually over 360 mg daily the total 24 hour oral dose was divided by 6 to convert to I.V. If this was ineffective, usually over 10 mg/hr of morphine, the intravenous dose was divided by 10 and infused epidurally. Local anesthetic was added for plexus involvement. After four days, the patient was weaned from local anesthetic solution. If sharp pain or pain to movement persisted, 6% phenol in 1 to 2 ml aliquots was injected every 8-12 hours to a total of 5-8 ml. While the conversion from intravenous to epidural morphine was 10:1 that from epidural to intravenous was only 1:3. Intravenous dose converts directly to the subcutaneous. The conversion from intravenous to oral is 1:3. There view showed that the dosages at which the conversions were made varied considerably. The reasons for the wide variation are presented. In summary the algorithm is a good practical guide for treatment of cancer pain.

Adult↗

PubMed2000

Tomographic reconstruction of tracer gas concentration profiles in a room with the use of a single OP-FTIR and two iterative algorithms: ART and PWLS.

Computed tomographic (CT) reconstructions of air contaminant concentration fields were conducted in a room-sized chamber employing a single open-path Fourier transform infrared (OP-FTIR) instrument and a combination of 52 flat mirrors and 4 retroreflectors. A total of 56 beam path data were repeatedly collected for around 1 hr while maintaining a stable concentration gradient. The plane of the room was divided into 195 pixels (13 x 15) for reconstruction. The algebraic reconstruction technique (ART) failed to reconstruct the original concentration gradient patterns for most cases. These poor results were caused by the "highly underdetermined condition" in which the number of unknown values (156 pixels) exceeds that of known data (56 path integral concentrations) in the experimental setting. A new CT algorithm, called the penalized weighted least-squares (PWLS), was applied to remedy this condition. The peak locations were correctly positioned in the PWLS-CT reconstructions. A notable feature of the PWLS-CT reconstructions was a significant reduction of highly irregular noise peaks found in the ART-CT reconstructions. However, the peak heights were slightly reduced in the PWLS-CT reconstructions due to the nature of the PWLS algorithm. PWLS could converge on the original concentration gradient even when a fairly high error was embedded into some experimentally measured path integral concentrations. It was also found in the simulation tests that the PWLS algorithm was very robust with respect to random errors in the path integral concentrations. This beam geometry and the use of a single OP-FTIR scanning system, in combination with the PWLS algorithm, is a system applicable to both environmental and industrial settings.

Air Pollution, Indoor↗

PubMed2004

Performance of flip supertree construction with a heuristic algorithm.

Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (flips) to the matrix representation of the set of input trees to resolve their incompatibilities. A previous flip supertree algorithm was limited to finding exact solutions and was only feasible for small input trees. We developed a heuristic algorithm for the flip supertree problem suitable for much larger input trees. We used a series of 48- and 96-taxon simulations to compare supertrees constructed with the flip supertree heuristic algorithm with supertrees constructed using other approaches, including MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP). Flip supertrees are generally far more accurate than supertrees constructed using MC or MMC algorithms and are at least as accurate as supertrees built with MRP. The flip supertree method is therefore a viable alternative to other supertree methods when the number of taxa is large.

Algorithms↗

PubMed2004

A wavelet-packets based algorithm for EEG signal compression.

Transmission of biomedical signals through communication channels is being used increasingly in clinical practice. This technique requires dealing with large volumes of information, and the electroencephalographic (EEG) signal is an example of this situation. In the EEG, various channels are recorded during several hours, resulting in a great demand of storage capacity or channel bandwidth. This situation demands the use of efficient data compression systems. The objective of this work was to develop an efficient algorithm for EEG lossy compression. In this algorithm, the EEG signal is segmented and then decomposed through Wavelet Packets (WP). The WP decomposition coefficients are thresholded and those having absolute values below the threshold are deleted. The remaining coefficients are appropriately quantized and coded using a run-length coding scheme. The compressed EEG signal can be recovered by an inverse process. Extensive experimental tests were made by applying the algorithm to EEG records and measuring the compression rate (CR) and the distortion in signal segments. The WP transform showed a high robustness, allowing a reasonably low distortion after a compression-decompression process, for CR typically in the range 5-8. The algorithm has a relatively low computational cost, making it appropriate for practical applications.

Algorithms↗

PubMed1995

An algorithm for predicting tissue: blood partition coefficients of organic chemicals from n-octanol: water partition coefficient data.

The objectives of the present study were (1) to develop an algorithm to predict tissue:blood partition coefficients (PCs) of organic chemicals from n-octanol: water (Ko/w) PC data, and (2) to apply this algorithm to predict the rat tissue:blood PCs of some relatively hydrophilic organics, particularly ketones, alcohols, and acetate esters. The algorithm, developed by modifying a previously published one, involved predicting tissue:blood PCs of chemicals by dividing their partitioning into tissues by the sum of their partitioning into erythrocytes and plasma. The partitioning of a chemical into tissues, erythrocytes, and plasma was expressed as an additive function of its partitioning into neutral lipids, phospholipids, and water contained in them. The muscle, liver, and adipose tissue:blood PCs predicted with the present method were compared with the experimental values obtained from the literature for five ketones, eight alcohols, and eight acetate esters. The predicted muscle:blood and liver:blood PCs for the set of 21 hydrophilic organics were within a factor of 1.01 and 0.99 (on an average), respectively, of the experimental values. However, the predicted adipose tissue:blood PCs of the hydrophilic organics were greater than the experimental values by a factor of 4.13, which improved when vegetable oil:saline (Ko/s) PCs were used instead of Ko/w PCs (factor of 1.51). Overall, the use of the present algorithm should enable the prediction of tissue:blood PCs for organic chemicals for which Ko/w or Ko/s data are available.

Acetates↗

PubMed2004

Smoking cessation: two pilot studies exploring the use of continuous response format algorithm to identify subgroups within stage.

Stage of change is typically assessed with a series of yes or no questions, a categorical response format staging algorithm. We revised that algorithm by using, instead, the same questions with 7-point agreement scales covering the first three stages with a sample of smokers. Participants were 141 persons enrolled in introductory psychology classes at the University of Louisville during the fall and spring semesters of 1994. Our continuous response format scores showed expected correlations with modified decisional balance scale scores. In addition, the continuous response format algorithm identified substantial differences in intention to quit sometime and in the next 30 days among participants classified as precontemplators by the categorical system. Analyses from an additional small sample (N = 56) demonstrated relationships between the continuous response format scores and Processes of Change as well as Decisional Balance Scale scores within categorical stages. Subgroups of smokers within stages differ on their attitudes toward changing and on the change strategies they are using. These subgroups can be identified with the continuous response format algorithm.

Adult↗

PubMed1988

The enhancement of radiographic images from a multiwire camera using a maximum entropy algorithm.

The multiwire camera (MWC) produces high speed, quantitative autoradiography of radiolabelled substances in two-dimensional systems. While greatly superior to film-based systems in respect of speed and quantitativity the MWC has significantly poorer spatial resolution (particularly for high energy beta-emitting radiolabels) and the performance is ultimately limited by the noise induced in the images by Poisson statistics and counter background. Processing the MWC images with a maximum entropy algorithm significantly improves the performance of the system in these respects. The algorithm has been tested using one-dimensional data taken from images of known tritium, 14C and 125I distributions. Processed images are visually more acceptable with improved quantitative accuracy and spatial resolution. Quantitative accuracy, calculated as the root mean square deviation between an image and the known sample activities, is 10-40% lower for processed images compared with original camera images. Spatial resolution, calculated from slopes in the images representing edges of activity in the sources, is improved by 20-40% for the processed images. The algorithm is used to improve a two-dimensional image from a biological study. The source distribution consisted of a set of circular dots of varying activity. The dots with lowest activity were barely discernible in the raw MWC image but are clearly resolved after processing. The algorithm used is simple and effective and executes acceptably quickly on a personal computer. It should prove useful in any context where the imaging performance of a system is limited by Poisson statistics.

Algorithms↗

PubMed1989

A two-dimensional pencil-beam algorithm for calculation of arc electron dose distributions.

A two-dimensional pencil-beam algorithm is presented for the calculation of arc electron dose distributions in any plane that is perpendicular to the axis of rotation. The dose distributions are calculated by modelling the arced beam as a single broad beam defined by the irradiated surface of the patient. The algorithm is two-dimensional in that the anatomical cross section of the patient and the skin collimators are assumed identical in parallel planes outside the plane of calculation. The broad beam is modelled as a collection of strip beams, each strip beam being characterised by its planar fluence, mean projected angular direction and a root-mean-square spread about the mean direction. Using these parameters, the dose distribution is calculated using pencil-beam theory. Examples of strip-beam parameters and resulting dose distributions for patient geometries are presented. Features of the algorithm, which include (1) incorporation of pencil-beam theory for the calculation of dose in heterogeneous tissue, (2) run times of only about twice that of comparable-sized fixed electron fields and (3) the input requirement of only a single depth dose and four off-axis dose profiles of measured data, make the algorithm practical for clinical use.

Algorithms↗

PubMed1991

Effect of dimensionality of heterogeneity corrections on the implementation of a three-dimensional electron pencil-beam algorithm.

Electron beam dose distributions were calculated on a three-dimensional grid using three pencil-beam algorithms, each taking into account irregularities in field shape. The algorithms differ in that patient anatomy in either one, two, or three dimensions is used in the calculation of dose to a point. Algorithms were optimized for speed by such techniques as precalculation and storage of several quantities, reordering of pencil-beam and grid-point loops, selection of cut-off values for some calculated quantities, and invoking error function symmetries. Execution times for optimized versions of each of the algorithms as implemented on a three-dimensional treatment planning system were comparable for both the one- and two-dimensional heterogeneity correction requires an additional calculational loop over fan lines. Execution times for the three-dimensional heterogeneity correction were approximately a factor of four longer than those for the two-dimensional correction. For certain geometries, three-dimensional heterogeneity corrections were necessary to calculate dose distributions accurately, in spite of the additional cost in calculation times.

Algorithms↗

PubMed1992

An algorithm for maximizing the probability of complication-free tumour control in radiation therapy.

New radiobiological models are used to describe tumour and normal tissue reactions and to account for their dependence on the irradiated volume and inhomogeneities of the delivered dose distribution and cell sensitivity. The probability of accomplishing complication-free tumour control is maximized by an iterative algorithm. The algorithm is demonstrated by applying it to a one-dimensional (1D) tumour model but also to a more clinically relevant 2D case. The new algorithm is n-dimensional so it could simultaneously optimize the dose delivery in a 3D volume and in principle also select the ideal beam orientations, beam modalities (photons, electrons, neutrons, etc) and optimal spectral distributions of the corresponding modalities. To make calculation time reasonable, 2D-3D problems are most practical, and suitable beam orientations are preselected by the choice of irradiation kernel. The energy deposition kernel should therefore be selected in order to avoid irradiation through organs at risk. Clinically established dose response parameters for the tissues of interest are used to make the optimization as relevant as possible to the clinical problems at hand. The algorithm can be used even with a poorly selected kernel because it will always, as far as possible, avoid irradiating organs at risk. The generated dose distribution will be optimal with respect to the spatial distribution and assumed radiobiological properties of the tumour and normal tissues at risk for the kernel chosen. More specifically the probability of achieving tumour control without fatal complications in normal tissues is maximized. In the clinical examples a reduced tumour dose is seen at the border to sensitive organs at risk, but instead an increased dose just inside the tumour border is generated. The increased tumour dose has the effect that the dose fall-off is as steep as possible at the border to organs at risk.

Algorithms↗