Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “exemplar”

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 181 records · Page 10

Making Corgis Important for Honeycomb Classification: Adversarial Attacks on Concept-based Explainability Tools

Methods for model explainability have become increasingly critical for testing the fairness and soundness of deep learning. Concept-based interpretability techniques, which use a small set of human-interpretable concept exemplars in order to measure the influence of a concept on a model's internal representation of input, are an important thread in this line of research. In this work we show that these explainability methods can suffer the same vulnerability to adversarial attacks as the models they are meant to analyze. We demonstrate this phenomenon on two well-known concept-based interpretability methods: TCAV and faceted feature visualization. We show that by leveraging the geometry of the problem and carefully perturbing the examples of the concept that is being investigated, we can radically change the output of the interpretability method. The attacks that we propose can either induce positive interpretations (polka dots are an important concept for a model when classifying zebras) or negative interpretations (stripes are not an important factor in identifying images of a zebra). Our work highlights the fact that in safety-critical applications, there is need for security around not only the machine learning pipeline but also the model interpretation process.

Brown, Davis R.↗

Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchronization, which in turn can severely limit scalability. As a result, new algorithms are typically required to achieve scalable performance, even for solving well-known graph problems. Yet, even in these cases, parallel graph algorithms are written according to parallel programming models that evolved for, e.g., scientific computing, and that still have inherent, and scalability-limiting, amounts of synchronization. In this paper we present a new approach to parallel graph algorithms: synchronization-avoiding algorithms. To eliminate synchronization and its associated overhead, synchronization-avoiding algorithms perform work in an unordered and fully asynchronous fashion in such a way that the result is constantly refined toward its final state. “Wasted” work is minimized by locally prioritizing tasks using problem-dependent task utility metrics. We classify algorithms for graph applications into two broad categories: algorithms with monotonic updates (which evince global synchronization) and algorithms with nonmonotonic updates (which evince vertex-centric synchronization). We apply our approach to both classes and develop novel, synchronization-avoiding algorithms for solving exemplar problems: SSSP and connected components for the former, graph coloring for the latter. We demonstrate that eliminating synchronization in conjunction with effective scheduling policies and optimizations in the runtime results in improved scalability for both classes of algorithms.

Firoz, Jesun S.↗

Harnessing the Power of Many: Extensible Toolkit for Scalable Ensemble Applications

Many scientific problems require multiple distinct computational tasks to be executed in order to achieve a desired solution. We introduce the Ensemble Toolkit (EnTK) to address the challenges of scale, diversity and reliability they pose. We describe the design and implementation of EnTK, characterize its performance and integrate it with two exemplar use cases: seismic inversion and adaptive analog ensembles. We perform nine experiments, characterizing EnTK overheads, strong and weak scalability, and the performance of the two use case imple-mentations, at scale and on production infrastructures. We show how EnTK meets the following general requirements: (i) imple-menting dedicated abstractions to support the description and execution of ensemble applications; (ii) support for execution on heterogeneous computing infrastructures; (iii) efficient scalability up to O(10 4 ) tasks; and (iv) task-level fault tolerance. We discuss novel computational capabilities that EnTK enables and the scientific advantages arising thereof. We propose EnTK as an important addition to the suite of tools in support of production scientific computing.

Computer Science↗

ADVERT: An Asynchronous Runtime for Fine-Grained Network Systems

The Data Vortex Network, a novel fine-grained high-radix interconnect, provides the performance and injection rates required by the fine-grained, unpredictable communication patterns of irregular applications. This paper presents ADVERT, an asynchronous runtime system that provides performance and productivity for the fine-grained Data Vortex Network. ADVERT integrates a lightweight memory manager (DVMem) for the user accessible SRAM integrated in the network interface, and a communication library (DVComm) that implements active messaging primitives (remote execution, and, based on this, get and put routines). ADVERT hides the complexity of controlling all the network hardware features through the low-level Data Vortex programming interface, while providing comparable performance. We discuss ADVERT's design and present an analysis of three exemplar irregular kernels (Triangle Count, Page Rank, and GUPS). ADVERT can provide the communication substrate required to build emerging higher level asynchronous many tasking runtimes and partitioned global address space libraries on top of the Data Vortex Network.

Friese, Ryan D.↗

Evolution of the IEEE P7009 Standard: Towards Fail-Safe Design of Autonomous Systems

Autonomous systems are complex, diverse, and likely be used in environments that change unpredictably. We must develop mechanisms to cope with failures, potentially caused by both the natural stresses of the operating environment and the system's inadequate environmental models. Failures also arise from system component wear. In 2016, the IEEE launched the Global Initiative on Ethics of Autonomous and Intelligent Systems in response to the proliferation of increasingly-autonomous systems. A cornerstone of this initiative is the IEEE P7000 series of projects, which set the standards for the future of ethical intelligent and autonomous technologies. This paper describes the ongoing development of the IEEE P7009 standard on “Fail-Safe Design of Autonomous and Semi-Autonomous Systems”. We provide a collective perspective on the ongoing development of IEEE P7009, and outline the objectives, current approaches, issues under discussion, and two exemplar use cases from different sectors: one high-regulation, the other low-regulation.

Farrell, Marie↗

Validation of finite-element models using full-field experimental data: Levelling finite-element analysis data through a digital image correlation engine

Full-field data from digital image correlation (DIC) provide rich information for finite-element analysis (FEA) validation. However, there are several inherent inconsistencies between FEA and DIC data that must be rectified before meaningful, quantitative comparisons can be made, including strain formulations, coordinate systems, data locations, strain calculation algorithms, spatial resolutions and data filtering. As such, in this paper, we investigate two full-field validation approaches: (1) the direct interpolation approach, which addresses the first three inconsistencies by interpolating the quantity of interest from one mesh to the other, and (2) the proposed DIC-levelling approach, which addresses all six inconsistencies simultaneously by processing the FEA data through a stereo-DIC simulator to ‘level’ the FEA data to the DIC data in a regularisation sense. Synthetic ‘experimental’ DIC data were generated based on a reference FEA of an exemplar test specimen. The direct interpolation approach was applied, and significant strain errorswere computed, even though therewas no model form error, because the filtering effect of theDIC enginewas neglected. In contrast, the levelling approach provided accurate validation results, with no strain error when no model form error was present. Next, model form error was purposefully introduced via a mismatch of boundary conditions. With the direct interpolation approach, the mismatch in boundary conditions was completely obfuscated, while with the levelling approach, it was clearly observed. Finally, the ‘experimental’ DIC datawere purposefully misaligned slightly fromthe FEA data. Both validation techniques suffered from the misalignment, thus motivating continued efforts to develop a robust alignment process. In conclusion, direct interpolation is insufficient, and the proposed levelling approach is required to ensure that the FEA and the DIC data have the same spatial resolution and data filtering. Only after the FEA data have been ‘levelled’ to the DIC data can meaningful, quantitative error maps be computed.

42 ENGINEERING↗

Calibrating constitutive models with full‐field data via physics informed neural networks

Abstract The calibration of solid constitutive models with full‐field experimental data is a long‐standing challenge, especially in materials that undergo large deformations. In this paper, we propose a physics‐informed deep‐learning framework for the discovery of hyperelastic constitutive model parameterizations given full‐field surface displacement data and global force‐displacement data. Contrary to the majority of recent literature in this field, we work with the weak form of the governing equations rather than the strong form to impose physical constraints upon the neural network predictions. The approach presented in this paper is computationally efficient, suitable for irregular geometric domains, and readily ingests displacement data without the need for interpolation onto a computational grid. A selection of canonical hyperelastic material models suitable for different material classes is considered including the Neo–Hookean, Gent, and Blatz–Ko constitutive models as exemplars for general non‐linear elastic behaviour, elastomer behaviour with finite strain lock‐up, and compressible foam behaviour, respectively. We demonstrate that physics informed machine learning is an enabling technology and may shift the paradigm of how full‐field experimental data are utilized to calibrate constitutive models under finite deformations.

Hamel, Craig M.↗

SU-E-I-08: An Inpaint-Based Interpolation Technique to Recover Blocked Information for Cone Beam CT with a Synchronized Moving Grid (SMOG)

Purpose: Synchronized moving grid (SMOG) is a promising technique to reduce scatter and ghost artifacts in cone beam computed tomography (CBCT). However, the grid blocks part of image information in each projection, and multiple projections at the same gantry angle have to been taken to obtain full information. Because of the continuity of a patient's anatomy in the projection, the blocked information may be estimated by interpolation. This study aims to evaluate an inpainting-based interpolation approach to recover the missing information for CBCT reconstruction. Method: We used a simple region-based inpainting approach to interpolate the missing information. For a pixel to be interpolated, we divided the nearby regions having image information into 6 sub-regions: up-left, up-middle, up-right, down-left, down-middle, and down-right, each with 9 pixels. The average pixel value of each sub-region was calculated. These average values, along with the pixel location, were used to determine the interpolated pixel value. We compared our approach with the Criminisi Exemplar (CE) and total variation (TV) based inpainting techniques. Projection images of Catphan and a head phantom were used for the comparison. The SMOG was simulated by erasing the information (filling with “0”) of the areas in each projection corresponding to the grid. Results: For the Catphan, the processing time was 178, 45 and 0.98 minutes for CE, TV and our approach, respectively. The signal to noise ratio (SNR) was 19.4, 18.5 and 26.4 db, correspondingly. For the head phantom, the processing time was 222, 45 and 0.93 minutes for CE, TV and our approach, respectively. The SNR was 24.6, 20.2 and 26.2db correspondingly. Conclusion: We have developed a simple inpainting based interpolation approach, which can recover some of the image information for the SMOG-based CBCT imaging. This study is supported by NIH/NCI grant 1R01CA166948-01.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Visualizing redox orbitals and their potentials in advanced lithium-ion battery materials using high-resolution x-ray Compton scattering

Reduction-oxidation (redox) reactions are the key processes that underlie the batteries powering smartphones, laptops, and electric cars. A redox process involves transfer of electrons between two species. For example, in a lithium-ion battery, current is generated when conduction electrons from the lithium anode are transferred to the redox orbitals of the cathode material. The ability to visualize or image the redox orbitals and how these orbitals evolve under lithiation and delithiation processes is thus of great fundamental and practical interest for understanding the workings of battery materials. In this study, we show that inelastic scattering spectroscopy using high-energy x-ray photons (Compton scattering) can yield faithful momentum space images of the redox orbitals by considering lithium iron phosphate (LiFePO 4 or LFP) as an exemplar cathode battery material. Our analysis reveals a new link between voltage and the localization of transition metal 3d orbitals and provides insight into the puzzling mechanism of potential shift and how it is connected to the modification of the bond between the transition metal and oxygen atoms. Our study thus opens a novel spectroscopic pathway for improving the performance of battery materials.

25 ENERGY STORAGE↗

Perovskite nanowire–block copolymer composites with digitally programmable polarization anisotropy

One-dimensional (1D) nanomaterials with highly anisotropic optoelectronic properties are key components in energy harvesting, flexible electronics, and biomedical imaging devices. 3D patterning methods that precisely assemble nanowires with locally controlled composition and orientation would enable new optoelectronic device designs. As an exemplar, we have created and 3D-printed nanocomposite inks composed of brightly emitting colloidal cesium lead halide perovskite (CsPbX 3 , X = Cl, Br, and I) nanowires suspended in a polystyrene-polyisoprene-polystyrene block copolymer matrix. The nanowire alignment is defined by the programmed print path, resulting in optical nanocomposites that exhibit highly polarized absorption and emission properties. Several devices have been produced to highlight the versatility of this method, including optical storage, encryption, sensing, and full-color displays.

36 MATERIALS SCIENCE↗

Countering the future chemical weapons threat

After decades of difficult negotiations, the Chemical Weapons Convention (CWC) was adopted in 1993 and entered into force on 29 April 1997, banning the development, production, stockpiling, transfer, and use of chemical weapons (CW). As the CWC celebrates the 25th anniversary of its entry into force, it can document considerable success, much of it attributed to the CWC implementing body—the Organisation for the Prohibition of Chemical Weapons (OPCW). However, facing a volatile international security environment and an everchanging chemical industry, the OPCW must transform to meet its mission and remain an exemplar for multilateralism. As the next CWC review conference approaches in 2023, a next-generation OPCW 2.0 can be effective and credible only if it reinforces international norms against CW, anticipates future challenges posed by advancements in science and technology (S&T), incorporates more qualitative elements into the verification and compliance system, and keeps pace with technological change.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Fungal Tree of Life: from Molecular Systematics to Genome-Scale Phylogenies

The kingdom Fungi is one of the more diverse clades of eukaryotes in terrestrial ecosystems, where they provide numerous ecological services ranging from decomposition of organic matter and nutrient cycling to beneficial and antagonistic associations with plants and animals. The evolutionary relationships of the kingdom have represented some of the more recalcitrant problems in systematics and phylogenetics. The advent of molecular phylogenetics, and more recently phylogenomics, has greatly advanced our understanding of the patterns and processes associated with fungal evolution, however. In this article, we review the major phyla, subphyla, and classes of the kingdom Fungi and provide brief summaries of ecologies, morphologies, and exemplar taxa. We also provide examples of how molecular phylogenetics and evolutionary genomics have advanced our understanding of fungal evolution within each of the phyla and some of the major classes. In the current classification we recognize 8 phyla, 12 subphyla, and 46 classes within the kingdom. The ancestor of fungi is inferred to be zoosporic, and zoosporic fungi comprise three lineages that are paraphyletic to the remainder of fungi. Fungi historically classified as zygomycetes do not form a monophyletic group and are paraphyletic to Ascomycota and Basidiomycota. Ascomycota and Basidiomycota are each monophyletic and collectively form the subkingdom Dikarya.

Spatafora, Joseph W.↗

In Situ Summarization with VTK-m

Summarization and compression at current and future scales requires a framework for developing and benchmarking algorithms. We present a framework created by integrating existing, production-ready projects and provide timings of two particular algorithms that serve as exemplars for summarization: a wavelet-based data reduction filter and a generator for creating image-like databases of extracted features (isocontours in this case). Both support browser-based, post-hoc, interactive visualization of the summary for decision-making. A study of their weak-scaling on a distributed multi-GPU system is included in this article.

97 MATHEMATICS AND COMPUTING↗

Tandem Predictions for HPC Jobs

At the core of the predictive analytics applied to High Performance Computing (HPC), the most prominent tasks are the prediction of job runtimes and the prediction of job queue times, both of which have the potential for informing HPC users during their every-day decision making. Accurate runtime predictions can help users better choose so-called wallclock times at job submission, decreasing the odds of their jobs waiting in queues longer than necessary. The accurate and timely queue time predictions offered for the available partitions can inform the favorable selection of partitions for running jobs. This potential is well understood as we see in the abundance of research studies that propose solutions for these tasks, including the work published in the last several years. These tasks are seemingly receptive to the Machine Learning (ML) solutions, considering that there is no shortage of training data where HPC centers over time run millions and millions of jobs. However, we study the existing research literature, as well as look for examples in the toolchains supported on the exemplar HPC facilities, and, surprisingly, do not find any practical solutions that are ready to be adopted. We interpret this as a manifestation of the shortage of UX/UI efforts that support HPC analytics and also as a sign that the research has not come to the consensus on solving these tasks. In this study, we aim to shed new light on the long-running task of job queue time prediction by exploring the utility of runtime predictions in improving prediction accuracy and, actually, predicting these two metrics together, in tandem. In other words, we show how runtime predictions become valuable input in the queue time modeling. We challenge the existing approaches to feature engineering for the queue time prediction and describe promising results we obtained for a large dataset of HPC jobs from a supercomputer at the National Renewable Energy Laboratory.

HPC↗

TCAD-Machine Learning Enabled TID Compact Model Development for Commercial SiC MOSFET

We propose a TCAD (Technology Computer Aided Design)-machine learning coupled approach that combines a TCAD tool (Charon), optimization/uncertainty quantification tool (Dakota), surrogate models, and Bayesian learning capabilities. The coupling approach is used for accurate modeling and calibration of total ionizing dose (TID) induced threshold voltage (V th ) shifts in Commercial-Off-The-Shelf (COTS) semiconductor devices and to develop physics-informed TID compact models. This versatile approach is applied to model the TID effect in an exemplar COTS 3.3 kV SiC power MOSFET (Metal-Oxide-Semiconductor Field-Effect Transistor). With the Charon-Dakota coupling, we can determine key device geometry and doping values based on device physics, which are difficult to obtain or not available for COTS devices but important for TCAD simulation; additionally, we can efficiently generate thousands of simulation results in a large parameter space, which makes it possible to develop data-driven surrogate models and perform Bayesian calibration. Utilizing the full tool-coupling approach, we achieve calibrated TCAD simulation models that accurately capture the average TID-induced V th shifts behavior with total doses and V th shifts saturation at high doses as observed in experimental data. More importantly, the calibrated TCAD simulations are obtained with determined TID model parameters (e.g., hole trap density and capture cross section) values that contain well quantified uncertainties. Furthermore, we can isolate and quantify the noises that are not captured by the TCAD models but exist in the measured data due to measurements and devices variabilities. Lastly, the calibrated surrogate models are used to develop physics-informed TID compact models. The method is generalizable to other devices and/or radiation conditions with few modifications and can provide well-determined uncertainties.

COTS↗

wa-hls4ml: A Benchmark and Surrogate Models for hls4ml Resource and Latency Estimation

As machine learning (ML) is increasingly implemented in hardware to address real-time challenges in scientific applications, the development of advanced toolchains has significantly reduced the time required to iterate on various designs. These advancements have solved major obstacles, but also exposed new challenges. For example, processes that were not previously considered bottlenecks, such as hardware synthesis, are becoming limiting factors in the rapid iteration of designs. To mitigate these emerging constraints, multiple efforts have been undertaken to develop an ML-based surrogate model that estimates resource usage of ML accelerator architectures. We introduce wa-hls4ml, a benchmark for ML accelerator resource and latency estimation, and its corresponding initial dataset of over 680,000 fully connected and convolutional neural networks, all synthesized using hls4ml and targeting Xilinx FPGAs. The benchmark evaluates the performance of resource and latency predictors against several common ML model architectures, primarily originating from scientific domains, as exemplar models, and the average performance across a subset of the dataset. Additionally, we introduce GNN- and transformer-based surrogate models that predict latency and resources for ML accelerators. We present the architecture and performance of the models and find that the models generally predict latency and resources for the 75% percentile within several percent of the synthesized resources on the synthetic test dataset.

Hawks, Benjamin [Fermilab] (ORCID:0000000157000288↗

Influence of Realistic, Cyclic Atmospheric Cycles on the Pitting Corrosion of Austenitic Stainless Steels

Pitting corrosion was evaluated on stainless steels 304H, 304, and 316L the surfaces of which had ASTM seawater printed on them as a function of surface roughness after exposure to an exemplar realistic atmospheric diurnal cycle for up to one year. Methods to evaluate pitting damage included optical imaging, scanning electron microscopy imaging, profilometry analysis, and polarization scans. The developed cyclic exposure environment did not significantly influence pitting morphology nor depth in comparison to prior static exposure environments. Cross-hatching was observed in a majority of pits for all material compositions with the roughest surface finish (#4 finish) and in all surface finishes for the 304H composition. Evidence is provided that cross-hatched pit morphologies are caused by slip bands produced during the grinding process for the #4 finish or by material processing. Additionally, micro-cracking was observed in pits formed on samples with the #4 surface finish and was greatly reduced or absent for pits formed on samples with smooth surface finishes. This suggests that both a low RH leading to an MgCl 2 -dominated environment and a rough surface containing significant residual stress are necessary for micro-cracking. Finally, the use of various characterization techniques and cross sectioning was employed to both qualitatively and quantitatively assess pitting damage across all SS compositions and surface finishes.

36 MATERIALS SCIENCE↗