Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “difference graphs”

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 667 records · Page 37

1-D Transient Thermal Modeling of an Ablative Material (MCC-1) Exposed to a Simulated Convective Titan 4 Launch Environment

The purpose of the work is to demonstrate that the flat test panel substrate temperatures are consistent with analysis predictions for MCC-1 applied to a aluminum substrate. The testing was performed in an aerothermal facility on samples of three different thicknesses of MCC-1 on an aluminum substrate. The results of the test were compared with a Transient Thermal model. The key assumptions of the Transient Thermal model were: (1) a one-dimensional heat transfer; (2) a constant ablation recession rate (determined from pre and post-test measurements); (3) ablation temperature of 540 degrees F; (4) Char left behind the ablation front; and (5) temperature jump correction for incident heat transfer coefficient. Two methods were used to model the heating of bare MCC-1: (1) Directly input surface temperature as a function of time; and (2) Aerothermal heating using calibration plate data and subtracting the radiation losses to tunnel walls. The results are presented as graphs. This article is presented in Viewgraph format.

Reinarts, Thomas R.↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

Improving Variational Autoencoders for New Physics Detection at the LHC With Normalizing Flows

We investigate how to improve new physics detection strategies exploiting variational autoencoders and normalizing flows for anomaly detection at the Large Hadron Collider. As a working example, we consider the DarkMachines challenge dataset. We show how different design choices (e.g., event representations, anomaly score definitions, network architectures) affect the result on specific benchmark new physics models. Once a baseline is established, we discuss how to improve the anomaly detection accuracy by exploiting normalizing flow layers in the latent space of the variational autoencoder.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance and stability of telemanipulators using bilateral impedance control

A new method of control for telemanipulators called bilateral impedance control is investigated. This new method differs from previous approaches in that interaction forces are used as the communication signals between the master and slave robots. The new control architecture has several advantages: (1) It allows the master robot and the slave robot to be stabilized independently without becoming involved in the overall system dynamics; (2) It permits the system designers to arbitrarily specify desired performance characteristics such as the force and position ratios between the master and slave; (3) The impedance at both ends of the telerobotic system can be modulated to suit the requirements of the task. The main goals of the research are to characterize the performance and stability of the new control architecture. The dynamics of the telerobotic system are described by a bond graph model that illustrates how energy is transformed, stored, and dissipated. Performance can be completely described by a set of three independent parameters. These parameters are fundamentally related to the structure of the H matrix that regulates the communication of force signals within the system. Stability is analyzed with two mathematical techniques: the Small Gain Theorem and the Multivariable Nyquist Criterion. The theoretical predictions for performance and stability are experimentally verified by implementing the new control architecture on a multidegree of freedom telemanipulator.

Moore, Christopher Lane↗

RHSEG and Subdue: Background and Preliminary Approach for Combining these Technologies for Enhanced Image Data Analysis, Mining and Knowledge Discovery

Under a project recently selected for funding by NASA's Science Mission Directorate under the Applied Information Systems Research (AISR) program, Tilton and Cook will design and implement the integration of the Subdue graph based knowledge discovery system, developed at the University of Texas Arlington and Washington State University, with image segmentation hierarchies produced by the RHSEG software, developed at NASA GSFC, and perform pilot demonstration studies of data analysis, mining and knowledge discovery on NASA data. Subdue represents a method for discovering substructures in structural databases. Subdue is devised for general-purpose automated discovery, concept learning, and hierarchical clustering, with or without domain knowledge. Subdue was developed by Cook and her colleague, Lawrence B. Holder. For Subdue to be effective in finding patterns in imagery data, the data must be abstracted up from the pixel domain. An appropriate abstraction of imagery data is a segmentation hierarchy: a set of several segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. The RHSEG program, a recursive approximation to a Hierarchical Segmentation approach (HSEG), can produce segmentation hierarchies quickly and effectively for a wide variety of images. RHSEG and HSEG were developed at NASA GSFC by Tilton. In this presentation we provide background on the RHSEG and Subdue technologies and present a preliminary analysis on how RHSEG and Subdue may be combined to enhance image data analysis, mining and knowledge discovery.

Tilton, James C.↗

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An open source knowledge graph ecosystem for the life sciences

Translational research requires data at multiple scales of biological organization. Advancements in sequencing and multi-omics technologies have increased the availability of these data, but researchers face significant integration challenges. Knowledge graphs (KGs) are used to model complex phenomena, and methods exist to construct them automatically. However, tackling complex biomedical integration problems requires flexibility in the way knowledge is modeled. Moreover, existing KG construction methods provide robust tooling at the cost of fixed or limited choices among knowledge representation models. PheKnowLator (Phenotype Knowledge Translator) is a semantic ecosystem for automating the FAIR (Findable, Accessible, Interoperable, and Reusable) construction of ontologically grounded KGs with fully customizable knowledge representation. The ecosystem includes KG construction resources (e.g., data preparation APIs), analysis tools (e.g., SPARQL endpoint resources and abstraction algorithms), and benchmarks (e.g., prebuilt KGs). We evaluated the ecosystem by systematically comparing it to existing open-source KG construction methods and by analyzing its computational performance when used to construct 12 different large-scale KGs. With flexible knowledge representation, PheKnowLator enables fully customizable KGs without compromising performance or usability.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Elevated temperature mechanical properties of Inconel 617 surface oxide using nanoindentation

Inconel 617 is a principal candidate material for helium gas cooled very-high-temperature reactors with outlet temperatures of 700–950 °C. Recent findings showed that this alloy develops unique surface oxide layers especially at high temperature (HT) helium environment with distinctive wear, friction and contact properties. This study investigates the elevated temperature mechanical properties of Inconel 617 top surface layers aged in HT helium environment. Nanoindentation technique is used to obtain load-displacement graphs of the alloy top surface oxide in temperatures ranging from 25 °C up to 600 °C. In addition, using finite element analysis along with an iterative regression technique, a semi-numerical method is developed to further measure and quantify the material parameters and, in particular, time-independent and creep characteristics of the oxide. Although Young's modulus of the oxide is found to be relatively close to the bulk for the tested temperatures, the yield strength and hardness, in comparison to the bulk material, increase significantly as the material is oxidized after aging. The oxide exhibits significant softening as the temperature increases to 600 °C. Unlike the bulk material, diffusion through the grains is found to be the dominant creep mechanism for the oxide. Considerable difference between the mechanical properties of the oxide and the bulk material shows the need for accurate measurements of near surface mechanical properties, if reliable predictive contact and tribological models are sought at elevated temperatures.

36 MATERIALS SCIENCE↗

Beyond Fair: Engagement, Data Usability, and Open Community Productivity through the NASA Open Science Data Repository

The FAIR principle (findable, accessible, interoperable, and reusable) governs the storage and sharing of NASA space biology and health data[1]. These guiding principles maximize reuse of data and the reproducibility of scientific findings. The NASA Open Science Data Repository (OSDR; an expansion of NASA GeneLab) was built on the FAIR principles and houses over 500 studies and close to 1000 datasets from decades of space life sciences experiments. OSDR embodies the FAIR principles through data governance that includes mediated, embargoed, and fully open access data. The FAIR data governance principles were recently proposed to be expanded to encompass a FAIREST framework for assessing research data repositories (FAIR + Engagement, Social connections, and Trust)[2]. FAIREST emphasizes the importance of data repositories engaging with the scientific community and gaining the trust of researchers regarding data quality. Trust also refers to the TRUST principles developed for assessment of digital repositories: Transparency, Responsibility, User Focus, Sustainability, Technology[3]. We present the “Open Science for Life in Space” Analysis Working Groups (AWGs) as evidence regarding the power of engagement, social connections, and trust which has enhanced OSDR’s capabilities and productivity. AWG members engage in two main activities. One, members provide feedback on OSDR scientific standards for data ingestion, curation, and reuse (study, subject and assay metadata; processing pipelines; dataset formats and uniformed structures for machine-readability). Two, AWG members collaborate to mine-reuse OSDR data to conduct scientific analysis. With nearly 800 active members, the AWGs have resulted in 32 publications re-using OSDR data and contributed many papers in two major special issues in Cell (2020) and Nature (2024). AWGs also serve as networking groups, facilitate social connections between researchers at all levels of experience, and also have a social online ‘Forum’ used to keep members informed on projects and opportunities. This community-centric, productive, and trustworthy data culture has resulted in a broader effect with international space agencies, academics, and the commercial space sector wanting to submit their data to OSDR. Ten studies of Inspiration 4 data were recently publicly released by OSDR, as were some JAXA human data. Coming up soon in OSDR are data submissions from the European Space Agency, Virgin Galactic PIs, and SpaceX Polaris Dawn. A major benefit of OSDR is the array of standardized and uniformly formatted data (which was developed through AWG member consensus), from which visualization tools, analysis tools, and machine learning models can be built or trained. This talk will cover the Multi-Study Visualization Tool, the Environmental Data Application, RadLab, and a UCSF-NSF funded knowledge graph biomedical health discovery tool ‘SPOKE’ currently being integrated with OSDR. OSDR also provides training programs in bioinformatics and machine learning to improve the scientific community’s awareness of data availability and to boost their ability to perform data analysis. The increasing engagement of the scientific community and the public with technologies powered by artificial intelligence (AI) heightens the need for data analysis to be transparent. The AI for Life in Space initiative leverages the data products provided in OSDR to train AI models, with an emphasis on explainable and trustworthy AI, which would not be possible without FAIR data and metadata. Overall, here we will demonstrate the importance for NASA life sciences data repositories to adhere to the FAIREST framework, by providing examples and success stories from different aspects of OSDR.

data↗

An Overview of the Circular Economy Lifecycle Assessment and VIsualization (CELAVI) Framework

A circular economy emphasizes the efficient use of all resources (e.g., materials, land, water). Despite anticipated overall benefits to society, the transition to a circular economy is likely to create regional differences in impacts. Current tools are unable to fully evaluate these potential externalities, which will be important for informing research prioritization and regional decision making. This presentation will review and contrast nine current impact assessment methods and describe their granularity, scope, data requirements, and capabilities within the context of identifying regional and sectoral transfers of impacts that could result from transitioning to a circular economy for energy systems. The review of current approaches highlights the need for a new hybrid circularity assessment framework that leverages multiple methods. We describe one such approach: the Circular Economy Lifecycle Assessment and VIsualization (CELAVI) framework. CELAVI uses system dynamics to model material flows for multiple circular economy pathways, network theory to track the spatial and sectoral flow of functional units across a graph, and discrete event simulation to to step through time and evaluate lifecycle assessment data at each time step. The framework is designed to be flexible and scalable enough to accommodate multiple energy materials and multiple energy technologies. CELAVI's hybridization of multiple existing methods yields additional capabilities, which may help answer questions about how flows between the technosphere and ecosphere may evolve if the circularity of energy systems is modified.

circular economy↗

Single-Point Extrapolation to the Complete Basis Set Limit through Deep Learning

Machine learning (ML) offers an attractive method for making predictions about molecular systems while circumventing the need to run expensive electronic structure calculations. Once trained on ab initio data, the promise of ML is to deliver accurate predictions of molecular properties that were previously computationally infeasible. In this work, we develop and train a graph neural network model to correct the basis set incompleteness error (BSIE) between a small and large basis set at the RHF and B3LYP levels of theory. Our results show that, when compared to fitting to the total potential, an ML model fitted to correct the BSIE is better at generalizing to systems not seen during training. We test this ability by training on single molecules while evaluating on molecular complexes. We also show that ensemble models yield better behaved potentials in situations where the training data is insufficient. However, even when only fitting to the BSIE, acceptable performance is only achieved when the training data sufficiently resemble the systems one wants to make predictions on. As a result, the test error of the final model trained to predict the difference between the cc-pVDZ and cc-pV5Z potential is 0.184 kcal/mol for the B3LYP density functional, and the ensemble model accurately reproduces the large basis set interaction energy curves on the S66x8 dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Explanation for the very low Ga and Ge concentrations in some iron meteorite groups

Parallels between the abundance patterns of moderately volatile elements in iron meteorites and ordinary chondrites are pointed out and discussed in relation to condensation processes in the solar nebula. The discussion is centered around a graph in which As, Cu, Ga, Ge to Ni ratios, normalized to CI chondrites, are compared for IVB, IVA, IVB, and IIIAB irons and H-group ordinary chondrites. The patterns suggest that the same volatile loss mechanism was at work for both IVB irons and ordinary chondrites, but was more efficient in the IVB process. A picture for the process at the IVB location is proposed, according to which condensation occurred when temperature decreased rapidly and trace metals condensed as a fine aerosol that was later blown away by a T-Tauri solar storm. Condensation at the H-group location was more complete because of a less rapid temperature decrease, allowing trace metals to diffuse deeper into Fe-Ni grains. Possible ways in which IVA conditions may have differed from IIIAB or H conditions are also proposed and discussed.

Wasson, J. T.↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

The Process of the Development of an Operator

On the job training is where new employees called operators can start gaining knowledge on what they will be working on during their time in JSC. In these lessons I learned different things that are important ranging from thermal systems to electrical systems. While doing OJT classes the student will learn how to use a portable computer system which has displays that I also helped edit and clean up. The way you can also learn is by reading system briefs which describes the different systems. Due to the fact of a possible change in the ISS I updated a systems brief so that it can be relevant to what is actually on the space station. I was given a task that will help develop my skills and make myself better prepared for my future in the work field. The project that I worked on had me pulling real time data from the International Space Station. The Data I obtained from the space station will be correlated to battery performance. The group I will be working which is called REBA and we will take the telemetry and evaluate the data. I will be working with my mentor Ben Chislom and co-op Tyler along with the Pro team. They then will put this data into a graph so that they can get the discrepancies and find a way to improve the battery performance. The first weeks I read familiarization books that informed me how the ISS works, how it was built, and the systems that are used to keep the station working. This project is going to benefit NASA by finding out how electricity is being used on the ISS and enabling us to see how it can be used more efficiently. This way we can operate the ISS without wasting power. While conducting research that goes on inside the space station knowing all electricity is being used efficiently.

Banks, Terrence↗

Crater densities on the satellites of Mars

The density of craters larger than 1 km in diameter has been determined for the entire surface of Phobos, and half that of Deimos. Densities of craters as small as 10 m on Phobos and 5 m on Deimos have been measured for small areas of the satellites. On both objects, crater densities are similar and yield plots which have slopes close to -1.9 on both incremental and cumulative log-log graphs. These densities are close to those expected to obtain under equilibrium conditions. They are also near the maximum predicted, based on the fragmentation lifetimes of the two objects: that is, the densities are near to the maximum possible before such objects are likely to suffer an impact severe enough to disrupt them. While the observed crater densities cannot be converted to absolute ages in any rigorous fashion, they can be understood if the flux at Mars has been similar to that at the Moon and if the surfaces that we see today generally date back to the end of the period of heavy bombardment some 4 billion years ago. It is extremely unlikely that the surfaces are younger than 1 billion years. There are no large areas on Phobos for which crater densities differ by more than a factor of 3 from the average.

Thomas, P.↗

Querying Semi-Structured Data

The amount of data of all kinds available electronically has increased dramatically in recent years. The data resides in different forms, ranging from unstructured data in the systems to highly structured in relational database systems. Data is accessible through a variety of interfaces including Web browsers, database query languages, application-specic interfaces, or data exchange formats. Some of this data is raw data, e.g., images or sound. Some of it has structure even if the structure is often implicit, and not as rigid or regular as that found in standard database systems. Sometimes the structure exists but has to be extracted from the data. Sometimes also it exists but we prefer to ignore it for certain purposes such as browsing. We call here semi-structured data this data that is (from a particular viewpoint) neither raw data nor strictly typed, i.e., not table-oriented as in a relational model or sorted-graph as in object databases. As will seen later when the notion of semi-structured data is more precisely de ned, the need for semi-structured data arises naturally in the context of data integration, even when the data sources are themselves well-structured. Although data integration is an old topic, the need to integrate a wider variety of data- formats (e.g., SGML or ASN.1 data) and data found on the Web has brought the topic of semi-structured data to the forefront of research. The main purpose of the paper is to isolate the essential aspects of semi- structured data. We also survey some proposals of models and query languages for semi-structured data. In particular, we consider recent works at Stanford U. and U. Penn on semi-structured data. In both cases, the motivation is found in the integration of heterogeneous data.

DATA MANAGEMENT↗

Environmental tests of metallization systems for terrestrial photovoltaic cells

Seven different solar cell metallization systems were subjected to temperature cycling tests and humidity tests. Temperature cycling excursions were -50 deg C to 150 deg C per cycle. Humidity conditions were 70 deg C at 98% relative humidity. The seven metallization systems were: Ti/Ag, Ti/Pd/Ag, Ti/Pd/Cu, Ni/Cu, Pd/Ni/Solder, Cr/Pd/Ag, and thick film Ag. All metallization systems showed a slight to moderate decrease in cell efficiencies after subjection to 1000 temperature cycles. Six of the seven metallization systems also evidenced slight increases in cell efficiencies after moderate numbers of cycles, generally less than 100 cycles. The copper based systems showed the largest decrease in cell efficiencies after temperature cycling. All metallization systems showed moderate to large decreases in cell efficiencies after 123 days of humidity exposure. The copper based systems again showed the largest decrease in cell efficiencies after humidity exposure. Graphs of the environmental exposures versus cell efficiencies are presented for each metallization system, as well as environmental exposures versus fill factors or series resistance.

Alexander, P., Jr.↗

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗