Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics and Computing, Computer science”

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 1,657 records · Page 92

Calculating Radiation Damage (DPA) from Transmutation Products

This is a poster for an INL poster session. Accurate models for radiation damage are crucial for predicting material performance in radiation environments. The uncertainty of state-of-the-art radiation damage models is large, contributing to excessive safety margins. A major source of this uncertainty is neglecting the effect that transmutation products have on radiation damage. Transmutation products are new nuclides formed by neutron activation during irradiation; they can contribute to radiation damage by additional neutron capture or decay events. Ignoring the contribution of transmutation products leads to a significant underprediction of the radiation damage (e.g., >10% error in 316 stainless steel). This underprediction is accounted for in part by adding larger safety margins to designs. Currently, the state of the art explicitly accounts for only a single transmutation product, namely nickel-59, during the radiation damage calculation. All other transmutation products are assumed to not contribute to the radiation damage, because there is currently no established method to systematically track all or a selection of radiation damage contributions of transmutation products during activation. In the case of nickel-59, the current method is to apply a precalculated correlation that cannot be used for any other nuclide and is largely dependent on all nuclear engineers being experts in this niche topic. This project proposed to methodically find other transmutation products that cause significant radiation damage, and then to develop a general framework for systematically tracking the radiation damage from these nuclides. This was accomplished by combining the radiation damage calculation into the transmutation calculation already performed for irradiated structural materials. The key idea of our framework is to introduce radiation-damage "pseudo-nuclides" to the list of nuclides used in the transmutation analysis. This allows radiation damage to be tracked alongside the creation and destruction of transmutation products. The main deliverable of this project is a general framework for computing radiation damage while the damaged material undergoes transmutation; this capability allows a significantly more accurate estimation of radiation damage, and in turn reduce required safety margins thereby reducing the cost to construct reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Machine learning guided prediction of solute segregation at coherent and semi-coherent metal/oxide interfaces

Investigation of semi-coherent metal/oxide interfaces with misfit dislocations using density functional theory (DFT) is computationally intensive to the point of being prohibitive, as it involves several hundreds to many thousands of atoms. In this study, we examined the solute segregation behavior at the Fe/Y 2 O 3 interface—a model interface for cladding applications in nuclear fission reactors—using a combination of DFT calculations and machine learning (ML) approaches. Both coherent and semi-coherent interfaces were considered. ML models were trained on DFT-calculated segregation energies to identify the key chemical, geometric and strain energy related features that govern solute segregation behavior at coherent Fe/Y 2 O 3 interfaces. Furthermore, it was found that ML models when trained on DFT calculated segregation energy of elements at a coherent interface, comprising of about a hundred-atom supercell, can predict the segregation energy of elements at a semi-coherent Fe/Y 2 O 3 interface (with multiple hundreds of atoms) at a fraction of computational cost (1/35th), with an accuracy comparable to DFT calculations.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Computational Benefit of GPU Optimization for the Atmospheric Chemistry Modeling

Abstract Global chemistry‐climate models are computationally burdened as the chemical mechanisms become more complex and realistic. Optimization for graphics processing units (GPU) may make longer global simulation with regional detail possible, but limited study has been done to explore the potential benefit for the atmospheric chemistry modeling. Hence, in this study, the second‐order Rosenbrock solver of the chemistry module of CAM4‐Chem is ported to the GPU to gauge potential speed‐up. We find that on the CPU, the fastest performance is achieved using the Intel compiler with a block interleaved memory layout. Different combinations of compiler and memory layout lead to ~11.02× difference in the computational time. In contrast, the GPU version performs the best when using a combination of fully interleaved memory layout with block size equal to the warp size, CUDA streams for independent kernels, and constant memory. Moreover, the most efficient data transfer between CPU and GPU is gained by allocating the memory contiguously during the data initialization on the GPU. Compared to one CPU core, the speed‐up of using one GPU alone reaches a factor of ~11.7× for the computation alone and ~3.82× when the data transfer between CPU and GPU is considered. Using one GPU alone is also generally faster than the multithreaded implementation for 16 CPU cores in a compute node and the single‐source solution (OpenACC). The best performance is achieved by the implementation of the hybrid CPU/GPU version, but rescheduling the workload among the CPU cores is required before the practical CAM4‐Chem simulation.

54 ENVIRONMENTAL SCIENCES↗

Data Assimilation - Advances and Applications

This presentation provides an overview of data assimilation (model calibration) for complex computer experiments. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Utilization of surrogate models and empirical adjustment for model form error in code calibration form the basis for the statistical methodology considered. The role of probabilistic code calibration in supporting code validation is discussed. Incorporation of model form uncertainty in rigorous uncertainty quantification (UQ) analyses is also addressed. Design criteria used within a batch sequential design algorithm are introduced for efficiently achieving predictive maturity and improved code calibration. Predictive maturity refers to obtaining stable predictive inference with calibrated computer codes. These approaches allow for augmentation of initial experiment designs for collecting new physical data. A standard framework for data assimilation is presented and techniques for updating the posterior distribution of the state variables based on particle filtering and the ensemble Kalman filter are introduced.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computational Enzymology and Organophosphorus Degrading Enzymes: Promising Approaches Toward Remediation Technologies of Warfare Agents and Pesticides

The re-emergence of chemical weapons as a global threat in hands of terrorist groups, together with an increasing number of pesticides intoxications and environmental contaminations worldwide, has called the attention of the scientific community for the need of improvement in the technologies for detoxification of organophosphorus (OP) compounds. A compelling strategy is the use of bioremediation by enzymes that are able to hydrolyze these molecules to harmless chemical species. Several enzymes have been studied and engineered for this purpose. However, their mechanisms of action are not well understood. Theoretical investigations may help elucidate important aspects of these mechanisms and help in the development of more efficient bio-remediators. In this review, we point out the major contributions of computational methodologies applied to enzyme based detoxification of OPs. Furthermore, we highlight the use of PTE, PON, DFP, and BuChE as enzymes used in OP detoxification process and how computational tools such as molecular docking, molecular dynamics simulations and combined quantum mechanical/molecular mechanics have and will continue to contribute to this very important area of research.The re-emergence of chemical weapons as a global threat in hands of terrorist groups, together with an increasing number of pesticides intoxications and environmental contaminations worldwide, has called the attention of the scientific community for the need of improvement in the technologies for detoxification of organophosphorus (OP) compounds. A compelling strategy is the use of bioremediation by enzymes that are able to hydrolyze these molecules to harmless chemical species. Several enzymes have been studied and engineered for this purpose. However, their mechanisms of action are not well understood. Theoretical investigations may help elucidate important aspects of these mechanisms and help in the development of more efficient bio-remediators. In this review, we point out the major contributions of computational methodologies applied to enzyme based detoxification of OPs. Furthermore, we highlight the use of PTE, PON, DFP, and BuChE as enzymes used in OP detoxification process and how computational tools such as molecular docking, molecular dynamics simulations and combined quantum mechanical/molecular mechanics have and will continue to contribute to this very important area of research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗

Deep learning uncertainty quantification for clinical text classification

Machine learning algorithms are expected to work side-by-side with humans in decision-making pipelines. Thus, the ability of classifiers to make reliable decisions is of paramount importance. Deep neural networks (DNNs) represent the state-of-the-art models to address real-world classification. Although the strength of activation in DNNs is often correlated with the network’s confidence, in-depth analyses are needed to establish whether they are well calibrated. In this paper, we demonstrate the use of DNN-based classification tools to benefit cancer registries by automating information extraction of disease at diagnosis and at surgery from electronic text pathology reports from the US National Cancer Institute (NCI) Surveillance, Epidemiology, and End Results (SEER) population-based cancer registries. In particular, we introduce multiple methods for selective classification to achieve a target level of accuracy on multiple classification tasks while minimizing the rejection amount—that is, the number of electronic pathology reports for which the model’s predictions are unreliable. We evaluate the proposed methods by comparing our approach with the current in-house deep learning-based abstaining classifier. Overall, all the proposed selective classification methods effectively allow for achieving the targeted level of accuracy or higher in a trade-off analysis aimed to minimize the rejection rate. On in-distribution validation and holdout test data, with all the proposed methods, we achieve on all tasks the required target level of accuracy with a lower rejection rate than the deep abstaining classifier (DAC). Interpreting the results for the out-of-distribution test data is more complex; nevertheless, in this case as well, the rejection rate from the best among the proposed methods achieving 97% accuracy or higher is lower than the rejection rate based on the DAC. We show that although both approaches can flag those samples that should be manually reviewed and labeled by human annotators, the newly proposed methods retain a larger fraction and do so without retraining—thus offering a reduced computational cost compared with the in-house deep learning-based abstaining classifier.

59 BASIC BIOLOGICAL SCIENCES↗

Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit

Abstract Summary Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. Availability and implementation PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

Computing the ankle-brachial index with parallel computational fluid dynamics

The ankle-brachial index (ABI), a ratio of arterial blood pressure in the ankles and upper arms, is used to diagnose and monitor circulatory conditions such as coarctation of the aorta and peripheral artery disease. Computational simulations of the ABI can potentially determine the parameters that produce an ABI indicative of ischemia or other abnormalities in blood flow. However, 0- and 1-D computational methods are limited in describing a 3-D patient-derived geometry. Thus, we present a massively parallel framework for computational fluid dynamics (CFD) simulations in the full arterial system. Additionally, using the lattice Boltzmann method to solve the Navier–Stokes equations, we employ highly parallelized and scalable methods to generate the simulation domain and efficiently distribute the computational load among processors. For the first time, we compute an ABI with 3-D CFD. In this proof-of-concept study, we investigate the dependence of ABI on the presence of stenoses, or narrowed regions of the arteries, by directly modifying the arterial geometry. As a result, our framework enables the computation a hemodynamic factor characterizing flow at the scale of the full arterial system, in a manner that is extensible to patient-specific imaging data and holds potential for treatment planning.

59 BASIC BIOLOGICAL SCIENCES↗

Investigating the Role of Biogeochemical Processes in the Northern High Latitudes on Global Climate Feedbacks Using an Efficient Scalable Earth System Model

The overall objectives of this DOE funded project is to combine scientific and computational challenges in climate modeling by expanding our understanding of the biogeophysical-biogeochemical processes and their interactions in the northern high latitudes (NHLs) using an earth system modeling (ESM) approach, and by adopting an adaptive parallel runtime system in an ESM to achieve efficient and scalable climate simulations through improved load balancing algorithms.

54 ENVIRONMENTAL SCIENCES↗

Preliminary Phase Field Computational Model Development

This interim report presents progress towards the development of meso-scale models of magnetic behavior that incorporate microstructural information. Modeling magnetic signatures in irradiated materials with complex microstructures (such as structural steels) is a significant challenge. The complexity is addressed incrementally, using the monocrystalline Fe (i.e., ferrite) film as model systems to develop and validate initial models, followed by polycrystalline Fe films, and by more complicated and representative alloys. In addition, the modeling incrementally addresses inclusion of other major phases (e.g., martensite, austenite), minor magnetic phases (e.g., carbides, FeCr precipitates), and minor nonmagnetic phases (e.g., Cu precipitates, voids). The focus of the magnetic modeling is on phase-field models. The models are based on the numerical solution to the Landau-Lifshitz-Gilbert equation. From the computational standpoint, phase-field modeling allows the simulation of large enough systems that relevant defect structures and their effects on functional properties like magnetism can be simulated. To date, two phase-field models have been generated in support of this work. First, a bulk iron model with periodic boundary conditions was generated as a proof-of-concept to investigate major loop effects of single versus polycrystalline bulk iron and effects of single non-magnetic defects. More recently, to support the experimental program herein using iron thin films, a new model was generated that uses finite boundary conditions representing surfaces and edges. This model has provided key insights into the domain structures observed in magnetic force microscopy (MFM) measurements. Simulation results for single crystal thin-film iron indicate the feasibility of the model for determining magnetic domain wall thickness and mobility in an externally applied field. Because the phase-field model dimensions are limited relative to the size of most specimens used in experiments, special experimental methods were devised to create similar boundary conditions in the iron films. Preliminary MFM studies conducted on single and polycrystalline iron films with small sub-areas created with focused ion beam have correlated quite well qualitatively with phase-field simulations. However, phase-field model dimensions are still small relative to experiments thus far. We are in the process of increasing the size of the models and decreasing specimen size so both have identical dimensions. Ongoing research is focused on validation of the phase-field model. Validation is being accomplished through comparison with experimentally obtained MFM images (in progress), and planned measurements of major hysteresis loops and first order reversal curves. Extrapolation of simulation sizes to represent a more stochastic bulk-like system will require sampling of various simulations (i.e., with single non-magnetic defect, single magnetic defect, single grain boundary, single dislocation, etc.) with distributions of input parameters. These outputs can then be compared to laboratory magnetic measurements and ultimately to simulate magnetic Barkhausen noise signals.

36 MATERIALS SCIENCE↗

Mixtures of Gaussian wells: Theory, computation, and application

A primary challenge in unsupervised clustering using mixture models is the selection of a family of basis distributions flexible enough to succinctly represent the distributions of the target subpopulations. We introduce a new family of Gaussian well distributions (GWDs) for clustering applications where the target subpopulations are characterized by hollow (hyper-)elliptical structures. We develop the primary theory pertaining to the GWD, including mixtures of GWDs, selection of prior distributions, and computationally efficient inference strategies using Markov chain Monte Carlo. We demonstrate the utility of our approach, as compared to standard Gaussian mixture methods on a synthetic dataset, and exemplify its applicability on an example from immunofluorescence imaging, emphasizing the improved interpretability and parsimony of the GWD-based model.

59 BASIC BIOLOGICAL SCIENCES↗

Physicochemical property distributions for accurate and rapid pairwise protein homology detection

Background: The challenge of remote homology detection is that many evolutionarily related sequences have very little similarity at the amino acid level. Kernel-based discriminative methods, such as support vector machines (SVMs), that use vector representations of sequences derived from sequence properties have been shown to have superior accuracy when compared to traditional approaches for the task of remote homology detection. Results: We introduce a new method for feature vector representation based on the physicochemical properties of the primary protein sequence. A distribution of physicochemical property scores are assembled from 4-mers of the sequence and normalized based on the null distribution of the property over all possible 4-mers. With this approach there is little computational cost associated with the transformation of the protein into feature space, and overall performance in terms of remote homology detection is comparable with current state-of-the-art methods. We demonstrate that the features can be used for the task of pairwise remote homology detection with improved accuracy versus sequence-based methods such as BLAST and other feature-based methods of similar computational cost. Conclusions: A protein feature method based on physicochemical properties is a viable approach for extracting features in a computationally inexpensive manner while retaining the sensitivity of SVM protein homology detection. Furthermore, identifying features that can be used for generic pairwise homology detection in lieu of family-based homology detection is important for applications such as large database searches and comparative genomics.

59 BASIC BIOLOGICAL SCIENCES↗

MetaBAT 2: an adaptive binning algorithm for robust and efficient genome reconstruction from metagenome assemblies

We previously reported on MetaBAT, an automated metagenome binning software tool to reconstruct single genomes from microbial communities for subsequent analyses of uncultivated microbial species. MetaBAT has become one of the most popular binning tools largely due to its computational efficiency and ease of use, especially in binning experiments with a large number of samples and a large assembly. MetaBAT requires users to choose parameters to fine-tune its sensitivity and specificity. If those parameters are not chosen properly, binning accuracy can suffer, especially on assemblies of poor quality. Here, we developed MetaBAT 2 to overcome this problem. MetaBAT 2 uses a new adaptive binning algorithm to eliminate manual parameter tuning. We also performed extensive software engineering optimization to increase both computational and memory efficiency. Comparing MetaBAT 2 to alternative software tools on over 100 real world metagenome assemblies shows superior accuracy and computing speed. Binning a typical metagenome assembly takes only a few minutes on a single commodity workstation. We therefore recommend the community adopts MetaBAT 2 for their metagenome binning experiments. MetaBAT 2 is open source software and available at https://bitbucket.org/berkeleylab/metabat .

59 BASIC BIOLOGICAL SCIENCES↗

Wild Fire Computer Model Helps Firefighters

A high-tech computer model called HIGRAD/FIRETEC, the cornerstone of a collaborative effort between U.S. Forest Service Rocky Mountain Research Station and Los Alamos National Laboratory, provides insights that are essential for front-line fire fighters. The science team is looking into levels of bark beetle-induced conditions that lead to drastic changes in fire behavior and how variable or erratic the behavior is likely to be.

54 ENVIRONMENTAL SCIENCES↗

Progress in fast, accurate multi-scale climate simulations

We present a survey of physical and computational techniques that have the potential to contribute to the next generation of high-fidelity, multi-scale climate simulations. Examples of the climate science problems that can be investigated with more depth with these computational improvements include the capture of remote forcings of localized hydrological extreme events, an accurate representation of cloud features over a range of spatial and temporal scales, and parallel, large ensembles of simulations to more effectively explore model sensitivities and uncertainties. Numerical techniques, such as adaptive mesh refinement, implicit time integration, and separate treatment of fast physical time scales are enabling improved accuracy and fidelity in simulation of dynamics and allowing more complete representations of climate features at the global scale. At the same time, partnerships with computer science teams have focused on taking advantage of evolving computer architectures such as many-core processors and GPUs. As a result, approaches which were previously considered prohibitively costly have become both more efficient and scalable. In combination, progress in these three critical areas is poised to transform climate modeling in the coming decades.

54 ENVIRONMENTAL SCIENCES↗

Thermochimica User Manual – v1.0

A new software library called Thermochimica has been developed that determines a unique combination of phases and their compositions at thermochemical equilibrium. The development of Thermochimica in this research is aimed at direct integration in multi-physics codes and to address several concerns with using commercially available software, including: licensing entanglements associated with code distribution, access to the source code, convenient incorporation into other codes with quality assurance considerations, and computational performance. In particular, significant research efforts have been dedicated to enhance computational performance through advanced algorithm development, such as improved estimation techniques and non-linear solvers. The overall goal of this undertaking is to provide an open source computational tool to enhance the predictive capability of multiphysics codes without significantly impeding computational performance. The purpose of this document is to describe the design of Thermochimica and the basic use of the software library. A brief background to computational thermodynamics and the conditions for thermodynamic equilibrium is given in §2, details of the code development is discussed in §3, details of building and compiling Thermochimica is given in §4, specific programming details for each subroutine in the library is given in the Appendix. The open license for Thermochimica is provided with the source code. As is always the case, software quality assurance (SQA) is an extremely important subject in software development. The importance of this warrants an independent document dedicated to SQA, which has been developed in parallel to this document. The subject of thermodynamic model validation is also of extreme importance in scientific computing and must be given careful attention. To be clear, this document is concerned with the development and use of a general thermodynamic solver and the validation of any models should be included in the discussion of the development of a thermodynamic model that is specific to a particular system.

36 MATERIALS SCIENCE↗

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. The LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗