Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative refinement”

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 109 records · Page 6

Pellet Injection Technology and Its Applications on ITER

Cryogenic pellet injectors for use in fusion research have been under development at Oak Ridge National Laboratory for over 30 years. The original application of the technology was to add fuel to magnetically confined plasmas to replace D-T ions that are consumed in the fusion reactions or lost due to transport out of the confining magnetic fields. This application is still the primary use for pellet injection and is planned for implementation on the ITER burning plasma experiment. More recently, there have been additional applications for the injection of cryogenic pellets in the areas of disruption and edge-localized mode mitigation. Injectors for these applications are also being implemented for ITER, which require refinements of the technology for production and shattering of very large pellets and production of very small high repetition rate pellets, respectively. Details of these applications and injection system designs are presented.

Baylor, Larry R.↗

Asc-Seurat: analytical single-cell Seurat-based web application

Abstract Background Single-cell RNA sequencing (scRNA-seq) has revolutionized the study of transcriptomes, arising as a powerful tool for discovering and characterizing cell types and their developmental trajectories. However, scRNA-seq analysis is complex, requiring a continuous, iterative process to refine the data and uncover relevant biological information. A diversity of tools has been developed to address the multiple aspects of scRNA-seq data analysis. However, an easy-to-use web application capable of conducting all critical steps of scRNA-seq data analysis is still lacking. Summary We present Asc-Seurat, a feature-rich workbench, providing an user-friendly and easy-to-install web application encapsulating tools for an all-encompassing and fluid scRNA-seq data analysis. Asc-Seurat implements functions from the Seurat package for quality control, clustering, and genes differential expression. In addition, Asc-Seurat provides a pseudotime module containing dozens of models for the trajectory inference and a functional annotation module that allows recovering gene annotation and detecting gene ontology enriched terms. We showcase Asc-Seurat’s capabilities by analyzing a peripheral blood mononuclear cell dataset. Conclusions Asc-Seurat is a comprehensive workbench providing an accessible graphical interface for scRNA-seq analysis by biologists. Asc-Seurat significantly reduces the time and effort required to analyze and interpret the information in scRNA-seq datasets.

60 APPLIED LIFE SCIENCES↗

An angularly refineable phase space finite element method with approximate sweeping procedure

An angularly refineable phase space finite element method is proposed to solve the neutron transport equation. The method combines the advantages of two recently published schemes. The angular domain is discretized into small patches and patch-wise discontinuous angular basis functions are restricted to these patches, i.e. there is no overlap between basis functions corresponding to different patches. This approach yields block diagonal Jacobians with small block size and retains the possibility for S{sub n}-like approximate sweeping of the spatially discontinuous elements in order to provide efficient preconditioners for the solution procedure. On the other hand, the preservation of the full FEM framework (as opposed to collocation into a high-order S{sub n} scheme) retains the possibility of the Galerkin interpolated connection between phase space elements at arbitrary levels of discretization. Since the basis vectors are not orthonormal, a generalization of the Riemann procedure is introduced to separate the incoming and outgoing contributions in case of unstructured meshes. However, due to the properties of the angular discretization, the Riemann procedure can be avoided at a large fraction of the faces and this fraction rapidly increases as the level of refinement increases, contributing to the computational efficiency. In this paper the properties of the discretization scheme are studied with uniform refinement using an iterative solver based on the S{sub 2} sweep order of the spatial elements. The fourth order convergence of the scalar flux is shown as anticipated from earlier schemes and the rapidly decreasing fraction of required Riemann faces is illustrated. (authors)

97 MATHEMATICS AND COMPUTING↗

Efficient thermo-mechanical simulation approaches for arc-and-wire based additive manufacturing

This study aims at the thermo-mechanical features inherent with the arc and wire metal deposition process to advance the structural simulation of additive manufacturing. Simulation approaches including iterative substructure method (ISM), dynamic mesh refining method (DMRM), and graphics processing unit (GPU) based explicit FEM code (GPU code) were developed for accelerating stress analysis and compared in terms of efficiency and accuracy. ISM and DMRM both take advantage of the strong nonlinearity phenomenon near the moving heat source, by reducing the global iterations and refining the local mesh respectively. The explicit FEM code was accelerated by a mass scaling technique based on the inherent strain concept. Two large parts by wire and arc additive manufacturing were analyzed, and the numerical results agreed very well with each other. The predicted distortion and residual stresses in the deposited layers were validated by experimental measurement. Compared with commercial software ABAQUS, the novel approaches reduced the computation cost substantially without compromising on accuracy. GPU code shows the highest computation efficiency (x30~70), while DMRM and ISM has an acceleration factor of x9 and x3 respectively. Owing to the minimum model simplification, such advanced simulation approaches will be very useful for structural analysis of additive manufacturing with complex deposition paths and product geometry.

Huang, Hui↗

Toward large-scale simulation of residual stress and distortion in wire and arc additive manufacturing

In this study, we aim to advance the structural analysis of wire and arc additive manufacturing (WAAM) by considering the thermomechanical features inherent in direct energy deposition. Simulation approaches including the iterative substructure method (ISM), dynamic mesh refining method (DMRM), and graphics processing unit (GPU) based explicit finite element method (FEM) were developed for accelerating additive manufacturing stress analysis that is very time consuming by conventional numerical methods. ISM and DMRM take advantage of the strong nonlinearity phenomenon near the moving heat source by reducing the global iterations and refining the local mesh, respectively. In addition to the use of GPUs, the explicit FEM is accelerated by a time scaling technique based on the inherent strain concept. The residual stress and distortion of two large builds were analyzed, showing very consistent numerical results and good agreement with experiments. Compared with the commercial software Abaqus, the novel approaches reduced the computational cost substantially without compromising accuracy. The GPU code showed the highest computational efficiency (30~70×), while DMRM and ISM had acceleration factors of 9× and 3×, respectively. Finally, such high-fidelity modeling approaches will be very useful for building up a digital twin of WAAM to reduce development time and cost.

36 MATERIALS SCIENCE↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

Ecological stoichiometry as a foundation for omics-enabled biogeochemical models of soil organic matter decomposition

Coupled biogeochemical cycles drive ecosystem ecology by influencing individual-to-community scale behaviors; yet the development of process-based models that accurately capture these dynamics remains elusive. Soil organic matter (SOM) decomposition in particular is influenced by resource stoichiometry that dictates microbial nutrient acquisition (‘ecological stoichiometry’). Despite its basis in biogeochemical modeling, ecological stoichiometry is only implicitly considered in high-resolution microbial investigations and the metabolic models they inform. State-of-science SOM decomposition models in both fields have advanced largely separately, but they agree on a need to move beyond seminal pool-based models. This presents an opportunity and a challenge to maximize the strengths of various models across different scales and environmental contexts. To address this challenge, we contend that ecological stoichiometry provides a framework for merging biogeochemical and microbiological models, as both explicitly consider substrate chemistries that are the basis of ecological stoichiometry as applied to SOM decomposition. We highlight two gaps that limit our understanding of SOM decomposition: (1) understanding how individual microorganisms alter metabolic strategies in response to substrate stoichiometry and (2) translating this knowledge to the scale of biogeochemical models. We suggest iterative information exchange to refine the objectives of high-resolution investigations and to specify limited dynamics for representation in large-scale models, resulting in a new class of omics-enabled biogeochemical models. Assimilating theoretical and modelling frameworks from different scientific domains is the next frontier in SOM decomposition modelling; advancing technologies in the context of stoichiometric theory provides a consistent framework for interpreting molecular data, and further distilling this information into tractable SOM decomposition models.

Carbon cycling↗

A multitree approach for global solution of ACOPF problems using piecewise outer approximations

Electricity markets rely on the rapid solution of the optimal power flow (OPF) problem to determine generator power levels and set nodal prices. Traditionally, the OPF problem has been formulated using linearized, approximate models, ignoring nonlinear alternating current (AC) physics. These approaches do not guarantee global optimality or even feasibility in the real ACOPF problem. We introduce an outer-approximation approach to solve the ACOPF problem to global optimality based on alternating solution of upper- and lower-bounding problems. The lower-bounding problem is a piecewise relaxation based on strong second-order cone relaxations of the ACOPF, and these piecewise relaxations are selectively refined at each major iteration through increased variable domain partitioning. Our approach is able to efficiently solve all but one of the test cases considered to an optimality gap below 0.1%. This approach opens the door for global solution of MINLP problems with AC power flow equations.

42 ENGINEERING↗

ACCURATE CHARACTERIZATION OF HIGH-DEGREE MODES USING MDI OBSERVATIONS

We present the first accurate characterization of high-degree modes, derived using the best Michelson Doppler Imager (MDI) full-disk full-resolution data set available. A 90 day long time series of full-disk 2 arcsec pixel{sup -1} resolution Dopplergrams was acquired in 2001, thanks to the high rate telemetry provided by the Deep Space Network. These Dopplergrams were spatially decomposed using our best estimate of the image scale and the known components of MDI's image distortion. A multi-taper power spectrum estimator was used to generate power spectra for all degrees and all azimuthal orders, up to l = 1000. We used a large number of tapers to reduce the realization noise, since at high degrees the individual modes blend into ridges and thus there is no reason to preserve a high spectral resolution. These power spectra were fitted for all degrees and all azimuthal orders, between l = 100 and l = 1000, and for all the orders with substantial amplitude. This fitting generated in excess of 5.2 Multiplication-Sign 10{sup 6} individual estimates of ridge frequencies, line widths, amplitudes, and asymmetries (singlets), corresponding to some 5700 multiplets (l, n). Fitting at high degrees generates ridge characteristics, characteristics that do not correspond to the underlying mode characteristics. We used a sophisticated forward modeling to recover the best possible estimate of the underlying mode characteristics (mode frequencies, as well as line widths, amplitudes, and asymmetries). We describe in detail this modeling and its validation. The modeling has been extensively reviewed and refined, by including an iterative process to improve its input parameters to better match the observations. Also, the contribution of the leakage matrix on the accuracy of the procedure has been carefully assessed. We present the derived set of corrected mode characteristics, which includes not only frequencies, but line widths, asymmetries, and amplitudes. We present and discuss their uncertainties and the precision of the ridge-to-mode correction schemes, through a detailed assessment of the sensitivity of the model to its input set. The precision of the ridge-to-mode correction is indicative of any possible residual systematic biases in the inferred mode characteristics. In our conclusions, we address how to further improve these estimates, and the implications for other data sets, like GONG+ and HMI.

79 ASTRONOMY AND ASTROPHYSICS↗

An international benchmark for wind plant wakes from the American WAKE ExperimeNt (AWAKEN)

This article introduces the first benchmark study within the International Energy Agency Wind Task 57 framework, focusing on wind plant wakes. Leveraging data from the American WAKE ExperimeNt (AWAKEN), the benchmark aims to assess the accuracy of simulation tools in modeling wind plant wakes and their impact on the downstream flow under diverse inflow conditions. The AWAKEN field campaign, conducted in Oklahoma from 2022 to 2024, provides unprecedented observations of wind plant-atmosphere interactions, thus offering a large dataset to validate numerical models of different complexity. The benchmark will include three phases—code calibration, blind comparison, and iteration—allowing participants to refine their numerical models based on the feedback from the benchmark team. This article describes the benchmark case study selected from observations providing details on atmospheric conditions, wake evidence, and wind turbine operation. The benchmark’s structure and timeline, along with the expected publication of results, are discussed as well. This collaborative effort aims to enhance the accuracy of wind plant wake simulations, thus contributing to the improvement of wind energy production estimates.

17 WIND ENERGY↗

Automated prediction of lattice parameters from X-ray powder diffraction patterns

A key step in the analysis of powder X-ray diffraction (PXRD) data is the accurate determination of unit-cell lattice parameters. This step often requires significant human intervention and is a bottleneck that hinders efforts towards automated analysis. This work develops a series of one-dimensional convolutional neural networks (1D-CNNs) trained to provide lattice parameter estimates for each crystal system. A mean absolute percentage error of approximately 10% is achieved for each crystal system, which corresponds to a 100- to 1000-fold reduction in lattice parameter search space volume. The models learn from nearly one million crystal structures contained within the Inorganic Crystal Structure Database and the Cambridge Structural Database and, due to the nature of these two complimentary databases, the models generalize well across chemistries. A key component of this work is a systematic analysis of the effect of different realistic experimental non-idealities on model performance. It is found that the addition of impurity phases, baseline noise and peak broadening present the greatest challenges to learning, while zero-offset error and random intensity modulations have little effect. However, appropriate data modification schemes can be used to bolster model performance and yield reasonable predictions, even for data which simulate realistic experimental non-idealities. In order to obtain accurate results, a new approach is introduced which uses the initial machine learning estimates with existing iterative whole-pattern refinement schemes to tackle automated unit-cell solution.

42 ENGINEERING↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

Parallel Algebraic Multigrid for Fusion and Higher-Order PDEs

Multigrid methods play a key role in large-scale scientific simulation because they are among the fastest and most scalable approaches for solving the underlying sparse linear systems of equations that arise from a wide array of Partial Differential Equation (PDE) discretizations. Algebraic multigrid (AMG) is a special type of multigrid method that depends only on the description of the linear system, giving it better portability and broader applicability than geometric multigrid, as it requires no explicit knowledge of the problem geometry. Even though these methods are widely used today, there are still applications where further development is needed. In this report, we focus on PDEs with higher-order terms (e.g., fourth order), concentrating on a PDE that arises in tokamak edge plasma simulations (a tokamak is a machine that confines a plasma using magnetic fields and is believed to be the leading plasma confinement concept for future fusion power plants). General multigrid relaxes a linear system on coarser grids and reverses this process with interpolation, but standard AMG methods struggle with the aforementioned higher-order PDEs. We investigate cyclic coarsening and interpolation heuristics, as well as new iterative approximation methods of refining the solution at each grid to improve the existing multigrid approach. To this end, we ensure that these techniques are transferable to a parallelized setting with LLNL’s supercomputers.

97 MATHEMATICS AND COMPUTING↗

Evolution Of USDOE Performance Assessments Over 20 Years

Performance assessments (PAs) have been used for many years for the analysis of post-closure hazards associated with a radioactive waste disposal facility and to provide a reasonable expectation of the ability of the site and facility design to meet objectives for the protection of members of the public and the environment. The use of PA to support decision-making for LLW disposal facilities has been mandated in United States Department of Energy (USDOE) directives governing radioactive waste management since 1988 (currently DOE Order 435.1, Radioactive Waste Management). Prior to that time, PAs were also used in a less formal role. Over the past 20+ years, the USDOE approach to conduct, review and apply PAs has evolved into an efficient, rigorous and mature process that includes specific requirements for continuous improvement and independent reviews. The PA process has evolved through refinement of a graded and iterative approach designed to help focus efforts on those aspects of the problem expected to have the greatest influence on the decision being made. Many of the evolutionary changes to the PA process are linked to the refinement of the PA maintenance concept that has proven to be an important element of USDOE PA requirements in the context of supporting decision-making for safe disposal of LLW. The PA maintenance concept represents the evolution of the graded and iterative philosophy and has helped to drive the evolution of PAs from a deterministic compliance calculation into a systematic approach that helps to focus on critical aspects of the disposal system in a manner designed to provide a more informed basis for decision-making throughout the life of a disposal facility (e.g., monitoring, research and testing, waste acceptance criteria, design improvements, data collection, model refinements). A significant evolution in PA modeling has been associated with improved use of uncertainty and sensitivity analysis techniques to support efficient implementation of the graded and iterative approach. Rather than attempt to exactly predict the migration of radionuclides in a disposal unit, the best PAs have evolved into tools that provide a range of results to guide decision-makers in planning the most efficient, cost effective, and safe disposal of radionuclides.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Evolution of US DOE Performance Assessments Over 20 Years - 13597

Performance assessments (PAs) have been used for many years for the analysis of post-closure hazards associated with a radioactive waste disposal facility and to provide a reasonable expectation of the ability of the site and facility design to meet objectives for the protection of members of the public and the environment. The use of PA to support decision-making for LLW disposal facilities has been mandated in United States Department of Energy (US DOE) directives governing radioactive waste management since 1988 (currently DOE Order 435.1, Radioactive Waste Management). Prior to that time, PAs were also used in a less formal role. Over the past 20+ years, the US DOE approach to conduct, review and apply PAs has evolved into an efficient, rigorous and mature process that includes specific requirements for continuous improvement and independent reviews. The PA process has evolved through refinement of a graded and iterative approach designed to help focus efforts on those aspects of the problem expected to have the greatest influence on the decision being made. Many of the evolutionary changes to the PA process are linked to the refinement of the PA maintenance concept that has proven to be an important element of US DOE PA requirements in the context of supporting decision-making for safe disposal of LLW. The PA maintenance concept is central to the evolution of the graded and iterative philosophy and has helped to drive the evolution of PAs from a deterministic compliance calculation into a systematic approach that helps to focus on critical aspects of the disposal system in a manner designed to provide a more informed basis for decision-making throughout the life of a disposal facility (e.g., monitoring, research and testing, waste acceptance criteria, design improvements, data collection, model refinements). A significant evolution in PA modeling has been associated with improved use of uncertainty and sensitivity analysis techniques to support efficient implementation of the graded and iterative approach. Rather than attempt to exactly predict the migration of radionuclides in a disposal unit, the best PAs have evolved into tools that provide a range of results to guide decision-makers in planning the most efficient, cost effective, and safe disposal of radionuclides. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A total risk assessment methodology for security assessment.

Sandia National Laboratories performed a two-year Laboratory Directed Research and Development project to develop a new collaborative risk assessment method to enable decision makers to fully consider the interrelationships between threat, vulnerability, and consequence. A five-step Total Risk Assessment Methodology was developed to enable interdisciplinary collaborative risk assessment by experts from these disciplines. The objective of this process is promote effective risk management by enabling analysts to identify scenarios that are simultaneously achievable by an adversary, desirable to the adversary, and of concern to the system owner or to society. The basic steps are risk identification, collaborative scenario refinement and evaluation, scenario cohort identification and risk ranking, threat chain mitigation analysis, and residual risk assessment. The method is highly iterative, especially with regard to scenario refinement and evaluation. The Total Risk Assessment Methodology includes objective consideration of relative attack likelihood instead of subjective expert judgment. The 'probability of attack' is not computed, but the relative likelihood for each scenario is assessed through identifying and analyzing scenario cohort groups, which are groups of scenarios with comparable qualities to the scenario being analyzed at both this and other targets. Scenarios for the target under consideration and other targets are placed into cohort groups under an established ranking process that reflects the following three factors: known targeting, achievable consequences, and the resources required for an adversary to have a high likelihood of success. The development of these target cohort groups implements, mathematically, the idea that adversaries are actively choosing among possible attack scenarios and avoiding scenarios that would be significantly suboptimal to their objectives. An adversary who can choose among only a few comparable targets and scenarios (a small comparable target cohort group) is more likely to choose to attack the specific target under analysis because he perceives it to be a relatively unique attack opportunity. The opposite is also true. Thus, total risk is related to the number of targets that exist in each scenario cohort group. This paper describes the Total Risk Assessment Methodology and illustrates it through an example.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parallel derivative-free optimization for simulation-based design of behind-the-meter energy systems

In this work, the integrated design and dispatch of behind-the-meter or distributed resources (e.g. stationary battery storage and solar PV generation) is considered. A simulation-based framework is employed, generating high-fidelity results with closed-loop predictive control at a fine resolution, at the expense of high computational cost (several minutes to a few hours per design point). To address this challenge, parallel derivative-free design methods are considered. Four methods are compared, including state-of-the-art surrogate-based methods (Radial-Basis Functions and Gaussian processes) and sampling strategies, an evolutionary-based method, and a simple sequential grid refinement method. As a case study, two types of design problem with increasing complexity are considered, namely, the design of behind-the-meter resources (three design variables) and the inclusion of grid capacity (four design variables). The second yields a constrained design problem for which violations can only be determined after solving the computationally expensive simulation. For the three-dimensional case, all methods present a good performance, achieving a solution within 1% of the optimum after the first iteration, with the sequential grid refinement exhibiting the fastest convergence and achieving the best final objective value. This indicates that the parallel evaluation of multiple sampling points may be more important than the choice of method for small decision spaces. For the four-dimensional constrained case, the Genetic Algorithm presents the best tradeoff between performance and computational effort, while the rough objective function terrain generated by constraint violation penalties reduces the performance of surrogate-based methods. Contour plots with flat regions indicate flexibility in the optimal design and highlight the importance of characterizing the solution space.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fast-kick-off monotonically convergent algorithm for searching optimal control fields

This Rapid Communication presents a fast-kick-off search algorithm for quickly finding optimal control fields in the state-to-state transition probability control problems, especially those with poorly chosen initial control fields. The algorithm is based on a recently formulated monotonically convergent scheme [T.-S. Ho and H. Rabitz, Phys. Rev. E 82, 026703 (2010)]. Specifically, the local temporal refinement of the control field at each iteration is weighted by a fractional inverse power of the instantaneous overlap of the backward-propagating wave function, associated with the target state and the control field from the previous iteration, and the forward-propagating wave function, associated with the initial state and the concurrently refining control field. Extensive numerical simulations for controls of vibrational transitions and ultrafast electron tunneling show that the new algorithm not only greatly improves the search efficiency but also is able to attain good monotonic convergence quality when further frequency constraints are required. The algorithm is particularly effective when the corresponding control dynamics involves a large number of energy levels or ultrashort control pulses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗