Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Controls Optimization Final Report, Controls Algorithms Report, Control Optimization - SPA II: Heaving Buoy Test Results [Three reports]

The over-arching project objective is to fully develop and validate optimal controls frameworks that can subsequently be applied widely to different WEC devices and concepts. Optimal controls of WEC devices represent a fundamental building block for WEC designers that must be considered as an integral part of every stage of device development. Using a building-blocks approach to optimal controls development, this effort will result in the full development of a feed-forward and feed-back control approach and a wave prediction system. Phase I focused primarily on numerical offline optimization and validation using wave tank testing of three industry partners’ WEC devices, including; CalWave, Ocean Energy, and Resolute Marine Energy. These industry partnerships allowed us to identify optimal control strategies for these different WEC topologies at different maturity levels. Phase II focused on demonstrating an integrated control system on an at-sea prototype that is to be custom-built and maturing the HW and SW required to successfully run our advanced controls code frameworks on at-sea systems. A secondary focus during phase II is to adapt our systems identification, controls and wave-prediction frameworks to become more robust and comprehensive in respect to RT capability, robustness, and reliability.

16 TIDAL AND WAVE POWER↗
DOE OSTI2024

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗
DOE OSTI2020

Storage ring nonlinear dynamics optimization with multi-objective multi-generation Gaussian process optimizer

Nonlinear beam dynamics optimization is essential in a low emittance storage ring design. Multi-objective optimization algorithms are needed in order to simultaneously optimize the dynamic aperture and the momentum aperture. In this study we demonstrate the application of a highly efficient stochastic optimization algorithm, the multi-generation Gaussian process optimizer (MG-GPO), to storage ring nonlinear dynamics optimization by successfully applying the method to the SPEAR3 upgrade lattice. It is shown that the new method, owing to its capability of selecting high rank candidates from a large number of trial solutions, converges significantly faster than the commonly used traditional algorithms, multi-objective genetic algorithms (MOGA) and particle swarm optimization (PSO).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Simultaneous beam sampling and aperture shape optimization for SPORT

Purpose: Station parameter optimized radiation therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital linear accelerators, in which the station parameters of a delivery system, such as aperture shape and weight, couch position/angle, gantry/collimator angle, can be optimized simultaneously. SPORT promises to deliver remarkable radiation dose distributions in an efficient manner, yet there exists no optimization algorithm for its implementation. The purpose of this work is to develop an algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: The authors build a mathematical model with the fundamental station point parameters as the decision variables. To solve the resulting large-scale optimization problem, the authors devise an effective algorithm by integrating three advanced optimization techniques: column generation, subgradient method, and pattern search. Column generation adds the most beneficial stations sequentially until the plan quality improvement saturates and provides a good starting point for the subsequent optimization. It also adds the new stations during the algorithm if beneficial. For each update resulted from column generation, the subgradient method improves the selected stations locally by reshaping the apertures and updating the beam angles toward a descent subgradient direction. The algorithm continues to improve the selected stations locally and globally by a pattern search algorithm to explore the part of search space not reachable by the subgradient method. By combining these three techniques together, all plausible combinations of station parameters are searched efficiently to yield the optimal solution. Results: A SPORT optimization framework with seamlessly integration of three complementary algorithms, column generation, subgradient method, and pattern search, was established. The proposed technique was applied to two previously treated clinical cases: a head and neck and a prostate case. It significantly improved the target conformality and at the same time critical structure sparing compared with conventional intensity modulated radiation therapy (IMRT). In the head and neck case, for example, the average PTV coverage D99% for two PTVs, cord and brainstem max doses, and right parotid gland mean dose were improved, respectively, by about 7%, 37%, 12%, and 16%. Conclusions: The proposed method automatically determines the number of the stations required to generate a satisfactory plan and optimizes simultaneously the involved station parameters, leading to improved quality of the resultant treatment plans as compared with the conventional IMRT plans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

SU-E-T-268: Differences in Treatment Plan Quality and Delivery Between Two Commercial Treatment Planning Systems for Volumetric Arc-Based Radiation Therapy

Purpose: To clinically evaluate the differences in volumetric modulated arc therapy (VMAT) treatment plan and delivery between two commercial treatment planning systems. Methods: Two commercial VMAT treatment planning systems with different VMAT optimization algorithms and delivery approaches were evaluated. This study included 16 clinical VMAT plans performed with the first system: 2 spine, 4 head and neck (HN), 2 brain, 4 pancreas, and 4 pelvis plans. These 16 plans were then re-optimized with the same number of arcs using the second treatment planning system. Planning goals were invariant between the two systems. Gantry speed, dose rate modulation, MLC modulation, plan quality, number of monitor units (MUs), VMAT quality assurance (QA) results, and treatment delivery time were compared between the 2 systems. VMAT QA results were performed using Mapcheck2 and analyzed with gamma analysis (3mm/3% and 2mm/2%). Results: Similar plan quality was achieved with each VMAT optimization algorithm, and the difference in delivery time was minimal. Algorithm 1 achieved planning goals by highly modulating the MLC (total distance traveled by leaves (TL) = 193 cm average over control points per plan), while maintaining a relatively constant dose rate (dose-rate change <100 MU/min). Algorithm 2 involved less MLC modulation (TL = 143 cm per plan), but greater dose-rate modulation (range = 0-600 MU/min). The average number of MUs was 20% less for algorithm 2 (ratio of MUs for algorithms 2 and 1 ranged from 0.5-1). VMAT QA results were similar for all disease sites except HN plans. For HN plans, the average gamma passing rates were 88.5% (2mm/2%) and 96.9% (3mm/3%) for algorithm 1 and 97.9% (2mm/2%) and 99.6% (3mm/3%) for algorithm 2. Conclusion: Both VMAT optimization algorithms achieved comparable plan quality; however, fewer MUs were needed and QA results were more robust for Algorithm 2, which more highly modulated dose rate.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
DOE OSTI2022

Determining the Adsorption Energetics of 2,3-Butanediol on RuO 2 (110): Coupling First-Principles Calculations With Global Optimizers

As climate change continues to pose a threat to the Earth due to the disrupted carbon cycles and fossil fuel resources remain finite, new sources of sustainable hydrocarbons must be explored. 2,3-butanediol is a potential source to produce butene because of its sustainability as a biomass-derived sugar. Butene is an attractive product because it can be used as a precursor to jet fuel, categorizing this work in the alcohol-to-jet pathway. While studies have explored the conversion of 2,3-butanediol to butene, little is understood about the fundamental reaction itself. We quantify the energetics for three pathways that were reported in the literature in the absence of a catalyst. One of these pathways forms a 1,3-butadiene intermediate, which is a highly exothermic process and thus is unlikely to occur since 2,3-butanediol likely gets thermodynamically trapped at this intermediate. We further determined the corresponding energetics of 2,3-butanediol adsorption on an ensemble of predetermined binding sites when it interacts with a defect-free stoichiometric RuO 2 (110) surface. Within this ensemble of adsorption sites, the most favorable site has 2,3-butanediol covering a Ru 5–coordinated cation. This approach is compared to that obtained using the global optimization algorithm as implemented in the Northwest Potential Energy Surface Search Engine. When using such a global optimization algorithm, we determined a more favorable ground-state structure that was missed during the manual adsorption site testing, with an adsorption energy of -2.61 eV as compared to -2.34 eV when using the ensemble-based approach. We hypothesize that the dehydration reaction requires a stronger chemical bond, which could necessitate the formation of oxygen vacancies. As such, this study has taken the first step toward the utilization of a global optimization algorithm for the rational design of Ru-based catalysts toward the formation of butene from sustainable resources.

09 BIOMASS FUELS↗
DOE OSTI2021

Optimization-based algorithms for nonlinear mechanics and frictional contact

An optimization-based strategy for solving nonlinear mechanics problems is proposed. In contrast to typical nonlinear equation solver algorithms that aim to find zeros in the residual force function, we minimize an energy (or energy-like) function to encourage solutions which are locally stable equilibria. These smooth and potentially non-convex objective functions are minimized using a preconditioned conjugate-gradient trust-region algorithm. Contact is formulated as an inequality constrained minimization problem, and is solved with an augmented Lagrangian algorithm. Friction is included in the approach via a regularized quasi-potential energy, and other dissipative behavior is included through the use of variational constitutive updates. Finally, to accelerate convergence rates for the Lagrange multipliers, we propose a novel multiplier update algorithm utilizing the Fischer-Burmeister function, and demonstrate super-linear solver convergence for some applications.

42 ENGINEERING↗
DOE OSTI2021

Distributed Optimization in Distribution Systems: Use Cases, Limitations, and Research Needs

We report electric distribution grid operations typically rely on both centralized optimization and local non-optimal control techniques. As an alternative, distribution system operational practices can consider distributed optimization techniques that leverage communications among various neighboring agents to achieve optimal operation. With the rapidly increasing integration of distributed energy resources (DERs), distributed optimization algorithms are growing in importance due to their potential advantages in scalability, flexibility, privacy, and robustness relative to centralized optimization. Implementation of distributed optimization offers multiple challenges and also opportunities. This paper provides a comprehensive review of the recent advancements in distributed optimization for electric distribution systems and classifications using key attributes. Problem formulations and distributed optimization algorithms are provided for example use cases, including volt/var control, market clearing process, loss minimization, and conservation voltage reduction. Finally, this paper also presents future research needs for the applicability of distributed optimization algorithms in the distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

MO-F-CAMPUS-T-01: Radiosurgery of Multiple Brain Metastases with Single-Isocenter VMAT: Optimizing Treatment Geometry to Reduce Normal Brain Dose

Purpose: To develop an optimization algorithm to reduce normal brain dose by optimizing couch and collimator angles for single isocenter multiple targets treatment of stereotactic radiosurgery. Methods: Three metastatic brain lesions were retrospectively planned using single-isocenter volumetric modulated arc therapy (VMAT). Three matrices were developed to calculate the projection of each lesion on Beam’s Eye View (BEV) by the rotating couch, collimator and gantry respectively. The island blocking problem was addressed by computing the total area of open space between any two lesions with shared MLC leaf pairs. The couch and collimator angles resulting in the smallest open areas were the optimized angles for each treatment arc. Two treatment plans with and without couch and collimator angle optimization were developed using the same objective functions and to achieve 99% of each target volume receiving full prescription dose of 18Gy. Plan quality was evaluated by calculating each target’s Conformity Index (CI), Gradient Index (GI), and Homogeneity index (HI), and absolute volume of normal brain V8Gy, V10Gy, V12Gy, and V14Gy. Results: Using the new couch/collimator optimization strategy, dose to normal brain tissue was reduced substantially. V8, V10, V12, and V14 decreased by 2.3%, 3.6%, 3.5%, and 6%, respectively. There were no significant differences in the conformity index, gradient index, and homogeneity index between two treatment plans with and without the new optimization algorithm. Conclusion: We have developed a solution to the island blocking problem in delivering radiation to multiple brain metastases with shared isocenter. Significant reduction in dose to normal brain was achieved by using optimal couch and collimator angles that minimize total area of open space between any of the two lesions with shared MLC leaf pairs. This technique has been integrated into Eclipse treatment system using scripting API.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Optimization of Medium Frequency Transformers with Practical Considerations

A method to design and optimize a Medium Frequency Transformer (MFT) based on commercially available components and semiconductor and converter constraints is presented. The optimization algorithm is used to redesign the transformer for a scaled-down electric vehicle (EV) fast charger using a three-level resonant circuit topology. The main consideration of this paper is the uncertainty caused by modeling assumptions in optimization algorithms. To reduce this uncertainty, space mapping is used to create an optimized design point. Lastly, a comparison of the designs found using the original optimization algorithm and the space mapping technique are compared and analyzed. For simplicity, only a single objective optimization routine is employed.

42 ENGINEERING↗
DOE OSTI2019

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Temperature dependence of magnetic anisotropy and magnetoelasticity from classical spin-lattice calculations

Here we present a classical molecular-spin dynamics (MSD) methodology that enables accurate computations of the temperature dependence of the magnetocrystalline anisotropy as well as magnetoelastic properties of magnetic materials. The nonmagnetic interactions are accounted for by a spectral neighbor analysis potential (SNAP) machine-learned interatomic potential, whereas the magnetoelastic contributions are accounted for using a combination of an extended Heisenberg Hamiltonian and a Néel pair interaction model, representing both the exchange interaction and spin-orbit-coupling effects, respectively. All magnetoelastic potential components are parameterized using a combination of first-principles and experimental data. Our framework is applied to the α phase of iron. Initial testing of our MSD model is done using a 0 K parametrization of the Néel interaction model. After this, we examine how individual Néel parameters impact the $B$ 1 and $B$ 2 magnetostrictive coefficients using a moment-independent δ sensitivity analysis. The results from this study are then used to initialize a genetic algorithm optimization which explores the Néel parameter phase space and tries to minimize the error in the B 1 and B 2 magnetostrictive coefficients in the range of 0–1200 K. Our results show that while both the 0 K and genetic algorithm optimized parametrization provide good experimental agreement for $B$ 1 and $B$ 2 , only the genetic algorithm optimized results can capture the second peak in the $B$ 1 magnetostrictive coefficient which occurs near approximately 800 K.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Development Of A Novel Genetic Algorithm-based Optimization Method For Design Of Nuclear Criticality Experiments

A new evaluation of isotopic molybdenum total neutron cross section data based on measurements performed at Rensselaer Polytechnic Institute prompted researchers at Rensselaer and Los Alamos National Laboratory (LANL) to design a nuclear criticality experiment for the validation of the data. A novel approach of criticality experiment design employing a genetic algorithm-based optimization technique was developed. The method produced a critical experiment with a cross section sensitivity that exceeded target specifications by an order of magnitude.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Incorporating Valve Switching Losses Into a Static Optimal Control Algorithm for the Hybrid Hydraulic-Electric Architecture (HHEA)

The Hybrid Hydraulic-Electric Architecture (HHEA) has, in recent years, been proposed as an energy efficient alternative to conventional load-sensing architectures in mobile machines such as excavators and wheel-loaders. HHEA leverages the advantages of hydraulic power and electric power to eliminate throttling valves while also improving the energy and control performance of the system. The architecture utilizes a set of common pressure rails to provide a majority of power and and a small electric motor driven pump to modulate this power to meet the exact demand. Previous work has developed a computationally efficient Lagrange Multiplier approach for determining the optimal pressure rail selections that minimizes the energy losses in the system. The static model used considers only the energy use for each pressure rail selection but not the losses associated with the valves during the transition. This paper presents an approach to include the switching losses in the model and in the optimization procedure. To capture the switching losses, switching events between different rails and at various input and output flow rates were simulated with consideration of valve spool dynamics. A parameterized model that summarizes the losses is then obtained, allowing switching losses to be added to the previous energy analysis. The performance of the switching loss model was compared with reference data obtained from a high-fidelity simulation model. To incorporate the switching losses into optimal control algorithm, an efficient dynamic programming approach that prevents frequent switching is adopted in place of the Lagrange multiplier approach. The overall effect of switching losses on the energy consumption and optimal control decisions is presented. In general, switching losses contribute to about 9–10% of input energy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

SU-F-J-133: Adaptive Radiation Therapy with a Four-Dimensional Dose Calculation Algorithm That Optimizes Dose Distribution Considering Breathing Motion

Purpose: To model patient motion and produce four-dimensional (4D) optimized dose distributions that consider motion-artifacts in the dose calculation during the treatment planning process. Methods: An algorithm for dose calculation is developed where patient motion is considered in dose calculation at the stage of the treatment planning. First, optimal dose distributions are calculated for the stationary target volume where the dose distributions are optimized considering intensity-modulated radiation therapy (IMRT). Second, a convolution-kernel is produced from the best-fitting curve which matches the motion trajectory of the patient. Third, the motion kernel is deconvolved with the initial dose distribution optimized for the stationary target to produce a dose distribution that is optimized in four-dimensions. This algorithm is tested with measured doses using a mobile phantom that moves with controlled motion patterns. Results: A motion-optimized dose distribution is obtained from the initial dose distribution of the stationary target by deconvolution with the motion-kernel of the mobile target. This motion-optimized dose distribution is equivalent to that optimized for the stationary target using IMRT. The motion-optimized and measured dose distributions are tested with the gamma index with a passing rate of >95% considering 3% dose-difference and 3mm distance-to-agreement. If the dose delivery per beam takes place over several respiratory cycles, then the spread-out of the dose distributions is only dependent on the motion amplitude and not affected by motion frequency and phase. This algorithm is limited to motion amplitudes that are smaller than the length of the target along the direction of motion. Conclusion: An algorithm is developed to optimize dose in 4D. Besides IMRT that provides optimal dose coverage for a stationary target, it extends dose optimization to 4D considering target motion. This algorithm provides alternative to motion management techniques such as beam-gating or breath-holding and has potential applications in adaptive radiation therapy.

60 APPLIED LIFE SCIENCES↗