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 811 records · Page 45Linked to original sources

PubMed2000

Computerizing medication algorithms and decision support systems for major psychiatric disorders.

In this article, the authors discuss the rationale for the use of computerized medication algorithms and decision support systems in the treatment of major psychiatric disorders. The field of psychopharmacology has advanced tremendously in the last two decades, with the resulting vast array of new information yielding a marked disparity between actual practice and what is commonly called "best practice." As a remedy, clinical practice guidelines and algorithms have been widely developed. These algorithms are used to disseminate up-to-date information, effect change in physician behavior, and reduce untoward variation in care. Review of the literature reveals advantages and limitations in trying to implement these paper and pencil guidelines and algorithms. Available research also suggests that computerized decision support systems have the potential to overcome such limitations, increase the use of treatment guidelines and algorithms, and improve physician adherence to recommended practices. The advantages of computerized medication algorithms and decision support systems are discussed. Finally, the computer platform elements that are necessary to make such systems effective and user-friendly are described.

Journal Article↗

PubMed1999

Algorithms for Brownian dynamics computer simulations: multivariable case.

Several Brownian numerical schemes for treating stochastic differential equations at the position Langevin level are analyzed from the point of view of their algorithmic efficiency for large-N systems. The algorithms are tested using model colloidal fluids of particles interacting via the Yukawa potential. Limitations in the conventional Brownian dynamics algorithm are shown and it is demonstrated that much better accuracy for dynamical and static quantities can be achieved with an algorithm based on the stochastic expansion and second-order stochastic Runge-Kutta algorithms. The importance of the various terms in the stochastic expansion is analyzed, and the relative merits of second-order algorithms are discussed.

Journal Article↗

PubMed2000

Cluster diversity and entropy on the percolation model: the lattice animal identification algorithm

We present an algorithm to identify and count different lattice animals (LA's) in the site-percolation model. This algorithm allows a definition of clusters based on the distinction of cluster shapes, in contrast with the well-known Hoshen-Kopelman algorithm, in which the clusters are differentiated by their sizes. It consists in coding each unit cell of a cluster according to the nearest neighbors (NN) and ordering the codes in a proper sequence. In this manner, a LA is represented by a specific code sequence. In addition, with some modification the algorithm is capable of differentiating between fixed and free LA's. The enhanced Hoshen-Kopelman algorithm [J. Hoshen, M. W. Berry, and K. S. Minser, Phys. Rev. E 56, 1455 (1997)] is used to compose the set of NN code sequences of each cluster. Using Monte Carlo simulations on planar square lattices up to 2000x2000, we apply this algorithm to the percolation model. We calculate the cluster diversity and cluster entropy of the system, which leads to the determination of probabilities associated with the maximum of these functions. We show that these critical probabilities are associated with the percolation transition and with the complexity of the system.

Journal Article↗

PubMed2000

Higher-order force gradient symplectic algorithms

We show that a recently discovered fourth order symplectic algorithm, which requires one evaluation of force gradient in addition to three evaluations of the force, when iterated to higher order, yielded algorithms that are far superior to similarly iterated higher order algorithms based on the standard Forest-Ruth algorithm. We gauge the accuracy of each algorithm by comparing the step-size independent error functions associated with energy conservation and the rotation of the Laplace-Runge-Lenz vector when solving a highly eccentric Kepler problem. For orders 6, 8, 10, and 12, the new algorithms are approximately a factor of 10(3), 10(4), 10(4), and 10(5) better.

Journal Article↗

PubMed2002

Construction of high-order force-gradient algorithms for integration of motion in classical and quantum systems.

A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic algorithms are first derived up to the eighth order by direct decompositions of exponential propagators and further collected using an advanced composition scheme to obtain the algorithms of higher orders. Contrary to the scheme proposed by Chin and Kidwell [Phys. Rev. E 62, 8746 (2000)], where high-order algorithms are introduced by standard iterations of a force-gradient integrator of order four, the present method allows one to reduce the total number of expensive force and its gradient evaluations to a minimum. At the same time, the precision of the integration increases significantly, especially with increasing the order of the generated schemes. The algorithms are tested in molecular dynamics and celestial mechanics simulations. It is shown, in particular, that the efficiency of the advanced fourth-order-based algorithms is better approximately in factors 5 to 1000 for orders 4 to 12, respectively. The results corresponding to sixth- and eighth-order-based composition schemes are also presented up to the sixteenth order. For orders 14 and 16, such highly precise schemes, at considerably smaller computational costs, allow to reduce unphysical deviations in the total energy up in 100 000 times with respect to those of the standard fourth-order-based iteration approach.

Journal Article↗

PubMed2003

One-step finite-difference time-domain algorithm to solve the Maxwell equations.

We present a one-step algorithm to solve the time-dependent Maxwell equations for systems with spatially varying permittivity and permeability. We compare the results of this algorithm with those obtained from the Yee algorithm and from unconditionally stable algorithms. We demonstrate that for a range of applications the one-step algorithm may be orders of magnitude more efficient than multiple time-step, finite-difference time-domain algorithms. We discuss both the virtues and limitations of this one-step approach.

Journal Article↗

PubMed2005

Multilevel algorithm for quantum-impurity models.

A continuous-time path integral quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low temperatures, the new algorithm has many advantages over conventional algorithms. For example, the model can be easily simulated in the Kondo limit without time discretization errors. Furthermore, many observables including the impurity susceptibility and a variety of fermionic observables can be calculated efficiently. Finally the new approach allows us to explore a general technique, called the multilevel algorithm, to solve the sign problem. We find that the multilevel algorithm is able to generate an exponentially large number of configurations with an effort that grows as a polynomial in inverse temperature such that configurations with a positive sign dominate over those with negative signs. Our algorithm can be easily generalized to other multi-impurity problems.

Journal Article↗

PubMed2004

An incremental learning algorithm with confidence estimation for automated identification of NDE signals.

An incremental learning algorithm is introduced for learning new information from additional data that may later become available, after a classifier has already been trained using a previously available database. The proposed algorithm is capable of incrementally learning new information without forgetting previously acquired knowledge and without requiring access to the original database, even when new data include examples of previously unseen classes. Scenarios requiring such a learning algorithm are encountered often in nondestructive evaluation (NDE) in which large volumes of data are collected in batches over a period of time, and new defect types may become available in subsequent databases. The algorithm, named Learn++, takes advantage of synergistic generalization performance of an ensemble of classifiers in which each classifier is trained with a strategically chosen subset of the training databases that subsequently become available. The ensemble of classifiers then is combined through a weighted majority voting procedure. Learn++ is independent of the specific classifier(s) comprising the ensemble, and hence may be used with any supervised learning algorithm. The voting procedure also allows Learn++ to estimate the confidence in its own decision. We present the algorithm and its promising results on two separate ultrasonic weld inspection applications.

Journal Article↗

PubMed1981

The use of a computerized algorithm to determine single cardiac cell volumes.

Single cardiac muscles cell volume data have been difficult to obtain, especially because the shape of a cell is quite complex. With the aid of a surface reconstruction method, a cell volume estimation algorithm has been developed that can be used on serial of cells. The cell surface is reconstructed by means of triangular tiles so that the cell is represented as a polyhedron. When this algorithm was tested on computer generated surfaces of a known volume, the difference was less than 1.6%. Serial sections of two phantoms of a known volume were also reconstructed and a comparison of the mathematically derived volumes and the computed volume estimations gave a per cent difference of between 2.8% and 4.1%. Finally cell volumes derived using conventional methods and volumes calculated using the algorithm were compared. The mean atrial muscle cell volume derived using conventional methods was 7752.7 +/- 644.7 micrometers3, while the mean computerized algorithm estimated atrial muscle cell volume was 7110.6 +/- 625.5 micrometers3. For AV bundle cells the mean cell volume obtained by conventional methods was 484.4 +/- 88.8 micrometers3 and the volume derived from the computer algorithm was 506.0 +/- 78.5 micrometers3. The differences between the volumes calculated using conventional methods and the algorithm were not significantly different.

Animals↗

PubMed1985

In vivo comparison of different algorithms for the artificial beta-cell.

Using an extracorporeal artificial beta-cell in chronically diabetic dogs, the effects of four different mathematical models of glucose-controlled insulin dosage were compared: the Biostator algorithm (quadratic equation), Toronto algorithm (hyperbolic tangent function), Karlsburg algorithm (modified first-order derivative controller), and Ilmenau algorithm (second-order linear difference equation). The constants of all formulas implemented for the artificial beta-cell were obtained by regression analysis of paired blood glucose and plasma insulin data from normal control animals. Thus, they were biologically equivalent for all formulas. The patterns of blood glucose, insulin doses, and plasma insulin before, during, and after an intravenous glucose infusion test performed during the glucose-controlled insulin infusion showed no significant differences between the experimental groups subjected to the different algorithms. However, in no case were really normal blood glucose response curves restored by the artificial beta-cell. This might be due, first, to the fact that the algorithm parameters were not adapted to the actual individual insulin responsiveness, second, to the unphysiological peripheral venous route of insulin administration, and, third, to the lack of appropriate adaptation of the animals to normoglycemia.

Animals↗

PubMed1998

Failure of third-generation implantable cardioverter defibrillators to abort shock therapy for nonsustained ventricular tachycardia due to shortcomings of the VF confirmation algorithm.

Unnecessary shocks by ICDs for rhythms other than sustained VT or VF have been described as the most frequent adverse event in ICD patients. To avoid unnecessary shocks for self-terminating arrhythmias, the third-generation Jewel PCD defibrillators 7202, 7219, and 7220 Plus use a specially designed VF confirmation algorithm after charge end. The purpose of this study was to determine the ability of this VF confirmation algorithm to recognize nonsustained VT, and to analyze the reasons for failure of the PCD device to abort shock therapy for nonsustained VT despite use of this VF confirmation algorithm. Analysis of stored electrograms of electrical events triggering high voltage capacitor charging in the programmed VF zone of the device showed 36 spontaneous episodes of nonsustained VT (227 +/- 21 beats/min) during 18 +/- 7 months follow-up in 15 patients who had a Jewel PCD implanted at our hospital. Intracardiac electrogram recordings and simultaneously retrieved marker channels demonstrated that the ICD shock was appropriately aborted according to the VF confirmation algorithm in 24 (67%) of 36 episodes of nonsustained VT. Twelve episodes (33%) of nonsustained VT, however, were followed by spontaneous ICD shock in 6 (40%) of the 15 study patients. The only reason for all 12 shocks for sustained VT was the inability of the device to recognize the absence of VT after charge end due to shortcomings of the VF confirmation algorithm: 11 of the 12 shocks for nonsustained VT were triggered by the occurrence of paced beats during the VF confirmation period and 1 shock for nonsustained VT was triggered by the occurrence of 2 premature beats after charge end. Thus, better VF confirmation algorithms need to be incorporated in future PCD devices to avoid unnecessary shocks for nonsustained VT.

Defibrillators, Implantable↗

PubMedDate not supplied

Two-film brachytherapy reconstruction algorithm.

We have developed a new isocentric two-film reconstruction algorithm for brachytherapy seed and needle implants. The algorithm has no requirements that the two films be orthogonal, symmetric, or even be taken in a transverse plane. In addition, there is no requirement that the two films even have the same number of images. We have found removal of these usual constraints useful for head and neck implants where images are often obscured by patient anatomy. The inherent image matching ambiguities associated with traditional two-film techniques are minimized by considering the image end points, rather than just the image centroids. For two films, the new algorithm, which considers all image combinations at one time, matches all the end-point images on one film with those on the other, and then reconstructs the end-point positions of the seeds. The algorithm minimizes the difference between the actual images and the projected images from the reconstructed seeds. The new two-film image matching problem is shown to be equivalent to the well-known assignment problem. For an implant of N seeds, this equivalence allows the two-film problem to be solved by an algorithm (ACM algorithm 548) that scales with a polynomial power of N, rather than N! as is usually assumed. An implant of N seeds can be matched and reconstructed in approximately (N/20)2s on a VAX 11/780.

Brachytherapy↗

PubMed2003

Lattice form adaptive infinite impulse response filtering algorithm for active noise control.

In some situations of active noise control, infinite impulse response (IIR) filters are more suitable than finite impulse response (FIR) filters owing to the poles in the transfer function. A number of algorithms have been derived for applying IIR filters in active noise control; however, most of them use the direct form IIR filter structure, which faces the difficulties of checking stability and relatively slow convergence speed for noise composed of narrow-band components with large power disparity. To overcome these difficulties along with using the direct form IIR filters, a new adaptive algorithm is proposed in this paper, which uses and updates the lattice form adaptive IIR filter in an active noise control system. Full mathematical derivations of the proposed algorithm are presented, and the comparison between the proposed algorithm and the commonly used filtered-u LMS and filtered-v LMS algorithms shows the superiority of the proposed algorithm.

Journal Article↗

PubMed1985

An excitation-pattern algorithm for the estimation of (2f1-f2) and (f2-f1) cancellation level and phase.

An excitation-pattern algorithm is described which provides an estimate of cancellation level and phase for the (2f1-f2) and (f2-f1) distortion products. An experiment is first conducted to demonstrate the need for such an algorithm for (f2-f1) level predictions. The results of this experiment, which employed three pairs of primaries having complementary input levels (L1 = 65, L2 = 85 dB; L1 = 85, L2 = 65 dB), do not agree with the predictions of another similar algorithm [E. Zwicker, J. Acoust. Soc. Am. 69, 1410-1413 (1981)]. A new excitation-pattern algorithm is then described. The predicted level behavior for (f2-f1) and (2f1-f2) is more accurate for the proposed algorithm. In addition, an accurate phase estimate is also provided by the new algorithm.

Acoustic Stimulation↗

PubMed2006

Design of asynchronous phase detection algorithms optimized for wide frequency response.

In many fringe pattern processing applications the local phase has to be obtained from a sinusoidal irradiance signal with unknown local frequency. This process is called asynchronous phase demodulation. Existing algorithms for asynchronous phase detection, or asynchronous algorithms, have been designed to yield no algebraic error in the recovered value of the phase for any signal frequency. However, each asynchronous algorithm has a characteristic frequency response curve. Existing asynchronous algorithms present a range of frequencies with low response, reaching zero for particular values of the signal frequency. For real noisy signals, low response implies a low signal-to-noise ratio in the recovered phase and therefore unreliable results. We present a new Fourier-based methodology for designing asynchronous algorithms with any user-defined frequency response curve and known limit of algebraic error. We show how asynchronous algorithms designed with this method can have better properties for real conditions of noise and signal frequency variation.

Journal Article↗

PubMed2007

Multilevel quality-guided phase unwrapping algorithm for real-time three-dimensional shape reconstruction.

A multilevel quality-guided phase unwrapping algorithm for real-time 3D shape measurement is presented. The quality map is generated from the gradient of the phase map. Multilevel thresholds are used to unwrap the phase level by level. Within the data points in each level, a fast scan-line algorithm is employed. The processing time of this algorithm is approximately 18.3 ms for an image size of 640x480 pixels in an ordinary computer. We demonstrate that this algorithm can be implemented into our real-time 3D shape measurement system for real-time 3D reconstruction. Experiments show that this algorithm improves the previous scan-line phase unwrapping algorithm significantly although it reduces its processing speed slightly.

Journal Article↗

PubMed2001

Algorithm based on rigorous coupled-wave analysis for diffractive optical element design.

Diffractive optical element design is an important problem for many applications and is usually achieved by the Gerchberg-Saxton or the Yang-Gu algorithm. These algorithms are formulated on the basis of monochromatic wave propagation and the far-field assumption, because the Fourier transform is used to model the wave propagation. We propose an iterative algorithm (based on rigorous coupled-wave analysis) for the design of a diffractive optical element. Since rigorous coupled-wave analysis (instead of Fourier transformation) is used to calculate the light-field distribution behind the optical element, the diffractive optical element can thus be better designed. Simulation results are provided to verify the proposed algorithm for designing a converging lens. Compared with the well-known Gerchberg-Saxton and Yang-Gu algorithms, our method provides 7.8% and 10.8%, respectively, improvement in converging the light amplitude when a microlens is desired. In addition, the proposed algorithm provides a solution that is very close to the solution obtained by the simulated annealing method (within 1.89% error).

Journal Article↗

PubMed2004

Algorithm for reconstruction of digital holograms with adjustable magnification.

A new algorithm that allows for reconstruction of digital holograms with adjustable magnification is proposed. The algorithm involves two reconstruction steps implemented by a conventional single Fourier-transform algorithm. The advantages of the algorithm lie in its adaptability to various object sizes and recording distances as well as in its capability to maintain the pitch of a reconstructed image, independent of the reconstruction distance and wavelength for objects larger than a CCD. The feasibility of the algorithm is demonstrated by experiments. The algorithm is especially useful for reconstructing color holograms and for metrological applications.

Journal Article↗