Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Algorithms”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

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

At least 181 records · Page 10Linked to original sources

Corroboration of mechanoregulatory algorithms for tissue differentiation during fracture healing: Comparison with in vivo results.

Several mechanoregulation algorithms proposed to control tissue differentiation during bone healing have been shown to accurately predict temporal and spatial tissue distributions during normal fracture healing. As these algorithms are different in nature and biophysical parameters, it raises the question of which reflects the actual mechanobiological processes the best. The aim of this study was to resolve this issue by corroborating the mechanoregulatory algorithms with more extensive in vivo bone healing data from animal experiments. A poroelastic three-dimensional finite element model of an ovine tibia with a 2.4 mm gap and external callus was used to simulate the course of tissue differentiation during fracture healing in an adaptive model. The mechanical conditions applied were similar to those used experimentally, with axial compression or torsional rotation as two distinct cases. Histological data at 4 and 8 weeks, and weekly radiographs, were used for comparison. By applying new mechanical conditions, torsional rotation, the predictions of the algorithms were distinguished successfully. In torsion, the algorithms regulated by strain and hydrostatic pressure failed to predict healing and bone formation as seen in experimental data. The algorithm regulated by deviatoric strain and fluid velocity predicted bridging and healing in torsion, as observed in vivo. The predictions of the algorithm regulated by deviatoric strain alone did not agree with in vivo data. None of the algorithms predicted patterns of healing entirely similar to those observed experimentally for both loading modes. However, patterns predicted by the algorithm based on deviatoric strain and fluid velocity was closest to experimental results. It was the only algorithm able to predict healing with torsional loading as seen in vivo.

Animals↗

Exploring the role of decoherence in condensed-phase nonadiabatic dynamics: a comparison of different mixed quantum/classical simulation algorithms for the excited hydrated electron.

Mixed quantum/classical (MQC) molecular dynamics simulation has become the method of choice for simulating the dynamics of quantum mechanical objects that interact with condensed-phase systems. There are many MQC algorithms available, however, and in cases where nonadiabatic coupling is important, different algorithms may lead to different results. Thus, it has been difficult to reach definitive conclusions about relaxation dynamics using nonadiabatic MQC methods because one is never certain whether any given algorithm includes enough of the necessary physics. In this paper, we explore the physics underlying different nonadiabatic MQC algorithms by comparing and contrasting the excited-state relaxation dynamics of the prototypical condensed-phase MQC system, the hydrated electron, calculated using different algorithms, including: fewest-switches surface hopping, stationary-phase surface hopping, and mean-field dynamics with surface hopping. We also describe in detail how a new nonadiabatic algorithm, mean-field dynamics with stochastic decoherence (MF-SD), is to be implemented for condensed-phase problems, and we apply MF-SD to the excited-state relaxation of the hydrated electron. Our discussion emphasizes the different ways quantum decoherence is treated in each algorithm and the resulting implications for hydrated-electron relaxation dynamics. We find that for three MQC methods that use Tully's fewest-switches criterion to determine surface hopping probabilities, the excited-state lifetime of the electron is the same. Moreover, the nonequilibrium solvent response function of the excited hydrated electron is the same with all of the nonadiabatic MQC algorithms discussed here, so that all of the algorithms would produce similar agreement with experiment. Despite the identical solvent response predicted by each MQC algorithm, we find that MF-SD allows much more mixing of multiple basis states into the quantum wave function than do other methods. This leads to an excited-state lifetime that is longer with MF-SD than with any method that incorporates nonadiabatic effects with the fewest-switches surface hopping criterion.

Journal Article↗

Army ants algorithm for rare event sampling of delocalized nonadiabatic transitions by trajectory surface hopping and the estimation of sampling errors by the bootstrap method.

The most widely used algorithm for Monte Carlo sampling of electronic transitions in trajectory surface hopping (TSH) calculations is the so-called anteater algorithm, which is inefficient for sampling low-probability nonadiabatic events. We present a new sampling scheme (called the army ants algorithm) for carrying out TSH calculations that is applicable to systems with any strength of coupling. The army ants algorithm is a form of rare event sampling whose efficiency is controlled by an input parameter. By choosing a suitable value of the input parameter the army ants algorithm can be reduced to the anteater algorithm (which is efficient for strongly coupled cases), and by optimizing the parameter the army ants algorithm may be efficiently applied to systems with low-probability events. To demonstrate the efficiency of the army ants algorithm, we performed atom-diatom scattering calculations on a model system involving weakly coupled electronic states. Fully converged quantum mechanical calculations were performed, and the probabilities for nonadiabatic reaction and nonreactive deexcitation (quenching) were found to be on the order of 10(-8). For such low-probability events the anteater sampling scheme requires a large number of trajectories ( approximately 10(10)) to obtain good statistics and converged semiclassical results. In contrast by using the new army ants algorithm converged results were obtained by running 10(5) trajectories. Furthermore, the results were found to be in excellent agreement with the quantum mechanical results. Sampling errors were estimated using the bootstrap method, which is validated for use with the army ants algorithm.

Journal Article↗

Automated performance evaluation of range image segmentation algorithms.

Previous performance evaluation of range image segmentation algorithms has depended on manual tuning of algorithm parameters, and has lacked a basis for a test of the significance of differences between algorithms. We present an automated framework for evaluating the performance of range image segmentation algorithms. Automated tuning of algorithm parameters in this framework results in performance as good as that previously obtained with careful manual tuning by the algorithm developers. Use of multiple training and test sets of images provides the basis for a test of the significance of performance differences between algorithms. The framework implementation includes range images, ground truth overlays, program source code, and shell scripts. This framework should a) make it possible to objectively and reliably compare the performance of range image segmentation algorithms; b) allow informed experimental feedback for the design of improved segmentation algorithms. The framework is demonstrated using range images, but in principle it could be used to evaluate region segmentation algorithms for any type of image.

Journal Article↗

A Fast and Robust Cluster Update Algorithm for Image Segmentation in Spin-Lattice Models Without Annealing. Visual Latencies Revisited.

Image segmentation in spin-lattice models relies on the fast and reliable assignment of correct labels to those groups of spins that represent the same object. Commonly used local spin-update algorithms are slow because in each iteration only a single spin is flipped and a careful annealing schedule has to be designed in order to avoid local minima and correctly label larger areas. Updating of complete spin clusters is more efficient, but often clusters that should represent different objects will be conjoined. In this study, we propose a cluster update algorithm that, similar to most local update algorithms, calculates an energy function and determines the probability for flipping a whole cluster of spins by the energy gain calculated for a neighborhood of the regarded cluster. The novel algorithm, called energy-based cluster update (ECU algorithm), is compared to its predecessors. A convergence proof is derived, and it is shown that the algorithm outperforms local update algorithms by far in speed and reliability. At the same time it is more robust and noise tolerant than other versions of cluster update algorithms, making annealing completely unnecessary. The reduction in computational effort achieved this way allows us to segment real images in about 1-5 sec on a regular workstation. The ECU-algorithm can recover fine details of the images, and it is to a large degree robust with respect to luminance-gradients across objects. In a final step, we introduce luminance dependent visual latencies (Opara and Worgotter, 1996; Worgotter, Opara, Funke, and Eysel, 1996) into the spin-lattice model. This step guarantees that only spins representing pixels with similar luminance become activated at the same time. The energy function is then computed only for the interaction of the regarded cluster with the currently active spins. This latency mechanism improves the quality of the image segmentation by another 40%. The results shown are based on the evaluation of gray-level differences. It is important to realize that all algorithmic components can be transferred easily to arbitrary image features, like disparity, texture, and motion.

Journal Article↗

Algebraic iterative algorithm for deflection tomography and its application to density flow fields in a hypersonic wind tunnel.

A novel algebraic iterative algorithm based on deflection tomography is presented. This algorithm is derived from the essentials of deflection tomography with a linear expansion of the local basis functions. By use of this algorithm the tomographic problem is finally reduced to the solution of a set of linear equations. The algorithm is demonstrated by mapping a three-peak Gaussian simulative temperature field. Compared with reconstruction results obtained by other traditional deflection algorithms, its reconstruction results provide a significant improvement in reconstruction accuracy, especially in cases with noisy data added. In the density diagnosis of a hypersonic wind tunnel, this algorithm is adopted to reconstruct density distributions of an axial symmetry flow field. One cross section of the reconstruction results is selected to be compared with the inverse Abel transform algorithm. Results show that the novel algorithm can achieve an accuracy equivalent to the inverse Abel transform algorithm. However, the novel algorithm is more versatile because it is applicable to arbitrary kinds of distribution.

Journal Article↗

In vivo validation of an experimental adaptive quantitative coronary angiography algorithm to circumvent overestimation of small luminal diameters.

The reliability of quantitative coronary angiography (QCA) measurements is of fundamental importance for the study and practice of interventional cardiology. In vivo validation results have consistently reported a tendency for QCA systems to overestimate small luminal diameters. Such a systematic error may result in the underestimation of luminal gain during intracoronary procedures and in the underestimation of progression of coronary artery disease during longitudinal studies. We report the in vivo validation results of an experimental adaptive edge-detection algorithm that was developed to reduce overestimation of small luminal diameters by incorporating a dynamic function of variable kernel size of the derivative operator and variable weighting of the first and second derivatives of the brightness profile. The results of the experimental algorithm were compared to those of the conventional parent edge detection algorithm with fixed parameters. Dynamic adjustment of the edge-detection algorithm parameters was found to improve measurements of small (< 0.8-mm) luminal diameters as evidenced by an intercept of +.07 mm for the algorithm with variable weighting compared to +0.21 mm for the parent algorithm with fixed weighting. A slope of < 1 was found for both the parent and experimental algorithms with subsequent underestimation of large luminal diameters. Systematic errors in a QCA system can be identified and corrected by the execution of objective in vivo validation studies and the consequent refinement of edge-detection algorithms. The overestimation of small luminal diameters may be overcome by the incorporation of a dynamic edge-detection algorithm.(ABSTRACT TRUNCATED AT 250 WORDS)

Algorithms↗

A mechanistic algorithm for predicting blood:air partition coefficients of organic chemicals with the consideration of reversible binding in hemoglobin.

The objectives of the present study were (i) to develop a mechanistic algorithm for predicting blood:air partition coefficients (PCs) of volatile organic chemicals (VOCs), and (ii) to apply this algorithm to predict the rat blood:air PCs of several VOCs. The approach consisted initially of developing an algorithm to predict the blood:air PCs of VOCs solely based on the solubility phenomenon and then of extending the algorithm to include protein binding. The algorithm based on solubility phenomenon predicted blood:air PCs by dividing the estimated solubility of chemicals in blood by their saturable vapor concentrations at 37 degrees C. The rat blood:air PCs predicted using this algorithm were in close agreement with the experimental values for relatively hydrophilic VOCs such as ketones, alcohols, acetate esters, and diethyl ether (with an average ratio of 0.80 between predicted and experimental values), whereas there was a marked discrepancy in the case of relatively lipophilic VOCs such as alkanes, haloalkanes, and aromatic hydrocarbons (with an average ratio of 0.21 between predicted and experimental values). This discrepancy was hypothesized to be due to the occurrence of reversible binding of these substances in rat hemoglobin based on literature evidence of the existence of hydrophobic holes (or "xenon-binding" pockets). The association constants (Ka) for the presumed reversible hemoglobin binding of several alkanes, haloalkanes, and aromatic hydrocarbons were estimated from the difference between chemical concentration in rat erythrocytes predicted by the solubility-based algorithm and that deduced from the previously published experimental blood:air PCs for these chemicals (which presumably included contribution of hemoglobin binding in addition to "true" solubility). The Ka values estimated in this manner ranged from 504 to 4725 M-1 for the chemicals investigated in the present study. The a priori predictions of the percentage of several VOCs (diethyl ether, methyl isobutyl ketone, n-hexane, toluene, and chloroform) in rat erythrocytes obtained with the algorithm using these Ka estimates corresponded well with previously published experimental data. The mechanistic algorithm developed in the present study should be useful for predicting the "apparent" blood:air PCs of VOCs regardless of exposure concentrations, by accounting for the relative contributions of both the true chemical solubility and reversible hemoglobin binding.

Alcohols↗

Electrical impedance tomography reconstruction algorithm based on general inversion theory and finite element method.

A strict EIT reconstruction algorithm, the general inversion algorithm (GIA) is presented. To improve the noise performance, the algorithm is modified by attenuating the condition number of the forward matrix F and implemented using an improved FEM scheme, to obtain the 2D image of impedance change (dynamic image). This modified general inversion algorithm (MGIA) can be used on a larger dimension FEM model (248 elements) and is more practical than the GIA. When implementing this algorithm in computer simulation and in a physical phantom, it is found that the MGIA has a smaller reconstruction error than the currently used algorithms (equipotential-back-projection algorithm and filtered spectral expansion algorithm). With 0.1% white noise in the data, the algorithm can still reconstruct images of a complicated model. Further improvements are also discussed.

Algorithms↗

Implementation and evaluation of an ordered subsets reconstruction algorithm for transmission PET studies using median root prior and inter-update median filtering.

An ordered subsets (OS) reconstruction algorithm based on the median root prior (MRP) and inter-update median filtering was implemented for the reconstruction of low count statistics transmission (TR) scans. The OS-MRP-TR algorithm was evaluated using an experimental phantom, simulating positron emission tomography (PET) whole-body (WB) studies, as well as patient data. Various experimental conditions, in terms of TR scan time (from 1 h to 1 min), covering a wide range of TR count statistics were evaluated. The performance of the algorithm was assessed by comparing the mean value of the attenuation coefficient (MVAC) of known tissue types and the coefficient of variation (CV) for low-count TR images, reconstructed with the OS-MRP-TR algorithm, with reference values obtained from high-count TR images reconstructed with a filtered back-projection (FBP) algorithm. The reconstructed OS-MRP-TR images were then used for attenuation correction of the corresponding emission (EM) data. EM images reconstructed with attenuation correction generated by OS-MRP-TR images, of low count statistics, were compared with the EM images corrected for attenuation using reference (high statistics) TR data. In all the experimental situations considered, the OS-MRP-TR algorithm showed: (1) a tendency towards a stable solution in terms of MVAC; (2) a difference in the MVAC of within 5% for a TR scan of 1 min reconstructed with the OS-MRP-TR and a TR scan of 1 h reconstructed with the FBP algorithm; (3) effectiveness in noise reduction, particularly for low count statistics data [using a specific parameter configuration the TR images reconstructed with OS-MRP-TR(1 min) had a lower CV than the corresponding TR images of a 1-h scan reconstructed with the FBP algorithm]; (4) a difference of within 3% between the mean counts in the EM images attenuation corrected using the OS-MRP-TR images of 1 min and the mean counts in the EM images attenuation corrected using the OS-MRP-TR images of 1 h; (5) preservation of "good" image quality for both TR and EM reconstructed images. In conclusion, the OS-MRP-TR algorithm is particularly suitable for WB PET studies, allowing: (1) the acquisition of a very short TR scan (within 1 min), (2) the reconstruction of such TR data in low-noise TR images and (3) the use of the reconstructed OS-MRP-TR images for attenuation correction of corresponding EM data.

Algorithms↗

Strict glycemic control in diabetic dogs with closed-loop intraperitoneal insulin infusion algorithm designed for an artificial endocrine pancreas.

The ultimate goal of the development of an artificial endocrine pancreas is to achieve long-term strict glycemic regulation. To establish the physiological insulin delivery route of the artificial endocrine pancreas, intraperitoneal insulin infusion may be important. For this purpose, we tried to develop a closed-loop intraperitoneal insulin infusion algorithm by analyzing the pharmacokinetics of intraperitoneal regular insulin absorption using a mathematical model. The parameters for this algorithm were calculated to simulate the plasma insulin profile after intraperitoneal insulin injection as closely as possible. To evaluate the appropriateness of this algorithm, we tried glycemic control after an oral glucose load of 2 g/kg or a meal load of 80 kcal/kg in diabetic dogs by applying the algorithm. With the use of the subcutaneous insulin lispro infusion algorithm, which we have previously reported, alloxan-induced diabetic dogs exhibited postprandial hyperglycemia and delayed hyperinsulinemia, followed by hypoglycemia after an oral glucose load of 2 g/kg. However, by using the intraperitoneal insulin infusion algorithm, excellent glycemic control (postprandial blood glucose levels of 9.1 +/- 0.8 mmol/l at 70 min and 3.8 +/- 0.3 mmol/l at 240 min, respectively) could be achieved without any associated delayed hyperinsulinemia or hypoglycemia. Glycemic excursion after a meal load of 80 kcal/kg was also controlled from 3.9 to 10.1 mmol/l. Our results confirm that the intraperitoneal insulin infusion algorithm in vivo is feasible and that this algorithm can be superior to the subcutaneous insulin lispro infusion algorithm in the regulation of blood glucose.

Algorithms↗

Assessing physicians' use of treatment algorithms: Project IMPACTS study design and rationale.

Effective treatments for major depressive disorder have been available for 35 years, yet inadequate pharmacotherapy continues to be widespread leading to suboptimal outcomes. Evidence-based medication algorithms have the potential to bring much-needed improvement in effectiveness of antidepressant treatment in "real-world" clinical settings. Project IMPACTS (Implementation of Algorithms using Computerized Treatment Systems) addresses the critical question of how best to facilitate integration of depression treatment algorithms into routine care. It tests an algorithm implemented through a computerized decision support system using a measurement-based care approach for depression against a paper-and-pencil version of the same algorithm and non-algorithm-based, specialist-delivered usual care. This paper reviews issues related to the Project IMPACTS study rationale, design, and procedures. Patient outcomes include symptom severity, social and work function, and quality of life. The economic impact of treatment is assessed in terms of health care utilization and cost. Data collected on physician behavior include degree of adherence to guidelines and physician attitudes about the perceived utility, ease of use, and self-reported effect of the use of algorithms on workload. Novel features of the design include a two-tiered study enrollment procedure, which initially enroll physicians as subjects, and then following recruitment of physicians, enrollment of subjects takes place based initially on an independent assessment by study staff to determine study eligibility. The study utilizes brief, easy-to-use symptom severity measures that facilitate physician decision making, and it employs a validated, phone-based, follow-up assessment protocol in order to minimize missing data, a problem common in public sector and longitudinal mental health studies. IMPACTS will assess the success of algorithm implementation and subsequent physician adherence using study-developed criteria and related statistical approaches. These new procedures and data points will also allow a more refined assessment of algorithm-driven treatment in the future.

Algorithms↗

A novel algorithm for the reduction of undersampling artefacts in magnetic resonance images.

An innovative algorithm is presented which is effective in reducing the truncation artefacts occurring in magnetic resonance images due to missing k-space samples. The algorithm works first by filling the incomplete matrix of coefficients with zeroes and then adjusting, by an iterative process, the missing coefficients by performing a reduction of the undersampling artefacts. Then, this set of coefficients is used as a basis for a superresolution algorithm that estimates the missing coefficients by modeling the data as a linear combination of increasing and decreasing exponential functions using Prony's method. In fact, the Prony's method consists of the interpolation of a given data set with a sum of exponential functions: the MRI signals can be well represented as a sum of exponential functions and the missing data can be extrapolated by this representation. The algorithm has been proven to perform better than either a simple algorithm, which detects and then reduces the undersampling artefacts, or an algorithm that models the measured data with approximation functions. The presented algorithm is quite simple and is applicable both to missing rows (phase-frequency acquisitions) and to radial-missing angle (acquisition from projections) undersampling. Experimental results are reported; comparisons, made between the results obtained using the presented algorithm and the alternative methods described above, clearly demonstrate the superiority of the algorithm.

Algorithms↗

Cost-minimization analysis of two algorithms for diagnosing acute pulmonary embolism.

INTRODUCTION: Pulmonary embolism is a common disorder that often requires extensive diagnostic testing. We hypothesized that an algorithmic approach to diagnosis of pulmonary embolism based upon clinical risk stratification and D-dimer testing would be less costly than a standard approach. MATERIALS AND METHODS: We constructed a decision tree based upon two published algorithms for diagnosing acute pulmonary embolism. Branch point probabilities were obtained from the best available published literature. Costs were based upon Medicare charges. From this we obtained a base-case analysis and conducted sensitivity analysis. RESULTS: Our base-case analysis revealed that the cost-per-patient for diagnostic testing were US$216.52 for the algorithm based upon pre-test probability and D-dimer testing and US$538.62 for the standard algorithm. The cost difference per patient evaluated was US$322.10. One- and two-way sensitivity analyses did not reveal any instances in which the clinical risk algorithm was more costly than the standard algorithm. Two-way sensitivity analysis revealed several scenarios in which the standard algorithm would be less costly; however, the conditions required for these scenarios are rarely encountered in clinical practice. CONCLUSIONS: Costs of testing using an algorithm based on clinical pre-test probability and D-dimer testing are less than with a standard approach for evaluating suspected acute pulmonary embolism. This new algorithm has previously been shown to be safe and has the potential for large cost savings if widely applied.

Algorithms↗

Development and clinical application of a fast superposition algorithm in radiation therapy.

BACKGROUND AND PURPOSE: Dose calculation algorithms play a central role for the optimization and verification of treatment plans in radiation therapy. Complex treatment techniques like intensity modulated radiotherapy (IMRT) require accurate and fast dose algorithms especially for clinical cases which involve severe tissue inhomogeneities. For these cases the standard dose engine in current treatment planning systems--the convolution of photon pencil beams--usually fails to predict the dose with the required accuracy. The role of more accurate but time consuming dose calculations like superposition algorithms or Monte Carlo simulations in clinical practice is under investigation at several therapy centers. PATIENTS AND METHODS: The paper presents the design, implementation and the first application of a superposition algorithm in a clinical setting at the German Cancer Research Center (DKFZ). It first describes in detail how the superposition algorithm is adapted to the dose delivery system at DKFZ in terms of standard dosimetric data. Then details of the implementation of the algorithm are given with a focus on various methods for the reduction of dose computation times. Next, the algorithm is evaluated in various experiments with dosimetric phantoms. These studies are employed for the development of time efficient sampling strategies of the elemental dose kernels. Finally, the algorithm is applied to dose calculations of clinical cases with tumors adjacent to lung tissue. RESULTS: Severe differences in dose coverage of the tumors and dose burden of the surrounding tissues in comparison to standard pencil beam calculations are observed. A standard 4-7 beam plan in a convenient dose grid (approximately 3 mm in each direction) is calculated in about 30 min on a Pentium 4 (1.9 GHz) applying the superposition algorithm described here.

Algorithms↗

Quick fuzzy backpropagation algorithm.

A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) single output neural networks in case of training patterns with different targets; and (2) multiple output neural networks in case of training patterns with equivalued target vector. They support the automation of the weights training process (quasi-unsupervised learning) establishing the target value(s) depending on the network's input values. In these cases the simulation results confirm the convergence of both algorithms. An example with a large-sized neural network illustrates the significantly greater training speed of the QuickFBP rather than the FBP algorithm. The adaptation of an interactive web system to users on the basis of the QuickFBP algorithm is presented. Since the QuickFBP algorithm ensures quasi-unsupervised learning, this implies its broad applicability in areas of adaptive and adaptable interactive systems, data mining, etc. applications.

Algorithms↗

Adaptive multicomponent analysis by genetic algorithms.

The applicability of genetic algorithms for solving multicomponent analyses is systematically examined. As a genetic algorithm (GA), the basic proposal of Goldberg is implemented in a straightforward manner to simulate multicomponent analyses in analogy to the well-established UV-vis or IR methods, especially multicomponent regression. The main focus of the study is to investigate the behavior of the genetic algorithm in order to compare it with the well-known behavior of multicomponent regression. A remarkable difference between the two methods is that the genetic algorithm method does not need any calibration procedure because of its pure searching characteristic. As important features of multicomponent systems, the degree of signal overlap (selectivity), the behavior of systems with known and unknown component numbers and qualities, and linear as well as nonlinear relationships between the analytical signal and concentration are varied within the simulations. According to multicomponent regression, recovering concentrations by a genetic algorithm is of limited applicability with the exception of systems at a low degree of signal overlap. On the other hand, the recovery of a probe spectrum in the analytical process always gives satisfactory results independent of the features of the probe system. The genetic algorithm obviously shows autoadaptive behavior in probe spectrum recovery. The quality and quantity of the resulting components may dramatically differ from the given probe, although the resulting spectrum is nearly the same. In such cases, the resulting component mixture can be interpreted as an imitation of the probe. As well probe spectra, theoretically designed spectra can also be autoadapted by genetic algorithms. The only limitation is that the desired spectrum must, of course, be incorporated into the search space defined by the involved components. Furthermore, a spectral signal is only one single property of a chemical compound or mixture. Because of the nonlinear search characteristic of genetic algorithms, any other chemical or physical property can also be treated as a desired property. Therefore, the conclusion of the study is well-founded that an old challenge of applied chemistry, namely, the development of new chemical products with desired properties, seems to be reachable under the control of genetic algorithms.

Algorithms↗

Merits and limitations of the mode switching rate stabilization pacing algorithms in the implantable cardioverter defibrillator.

BACKGROUND: The 7250 Jewel AF Medtronic model of ICD is the first implantable device in which both therapies for atrial arrhythmias and pacing algorithms for atrial arrhythmia prevention are available. Feasibility of that extensive atrial arrhythmia management requires correct and synergic functioning of different algorithms to control arrhythmias. METHODS AND RESULTS: The ability of the new pacing algorithms to stabilize the atrial rate following termination of treated atrial arrhythmias was evaluated in the marker channel registration of 600 spontaneously occurring episodes in 15 patients with the Jewel AF. All patients (55+/-15 years) had structural heart disease and documented atrial and ventricular arrhythmias. Dual chamber rate stabilization pacing was present in 245 (41 %) of episodes following arrhythmia termination and was a part of the mode switching operation during which pacing was provided in the dynamic DDI mode. This algorithm could function as the atrial rate stabilization pacing only when there was a slow spontaneous atrial rhythm or in presence of atrial premature beats conducted to the ventricles with a normal AV time. In case of atrial premature beats with delayed or absent conduction to the ventricles and in case of ventricular premature beats, the algorithm stabilized the ventricular rate. The rate stabilization pacing in DDI mode during sinus rhythm following atrial arrhythmia termination was often extended in time due to the device-based definition of arrhythmia termination. This was also the case in patients, in whom the DDD mode with true atrial rate stabilization algorithm was programmed. CONCLUSIONS: The rate stabilization algorithms in the Jewel AF applied after atrial arrhythmia termination provide pacing that is not based on the timing of atrial events. Only under certain circumstances the algorithm can function as atrial rate stabilization pacing. Adjustments in availability and functioning of the rate stabilization algorithms might be of benefit for the clinical performance of pacing as part of device therapy for atrial arrhythmias.

Adult↗