Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Graphics”

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,135 records · Page 63
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Luminescent microporous metal–organic framework with functional Lewis basic sites on the pore surface: Quantifiable evaluation of luminescent sensing mechanisms towards Fe{sup 3+}

A systematic study has been conducted on a novel luminescent metal-organic framework, ([Zn(bpyp)(L-OH)]·DMF·2H{sub 2}O){sub n} (1), to explore its sensing mechanisms to Fe{sup 3+}. Structure analyses show that compound 1 exist pyridine N atoms and -OH groups on the pore surface for specific sensing of metal ions via Lewis acid-base interactions. On this consideration, the quenching mechanisms are studied and the processes are controlled by multiple mechanisms in which dynamic and static mechanisms are calculated, achieving the quantification evaluation of the quenching process. This work not only achieves the quantitative evaluation of the luminescence quenching but also provides certain insights into the quenching process, and the possible mechanisms explored in this work may inspire future research and design of target luminescent metal-organic frameworks (LMOFs) with specific functions. - Graphical abstract: A systematic study has been conducted on a novel luminescent metal-organic framework to explore its sensing mechanisms to Fe{sup 3+}. The quenching mechanisms are studied and the processes are controlled by multiple mechanisms in which dynamic and static mechanisms are calculated, achieving the quantification evaluation of the quenching process. - Highlights: • A novel porous luminescent MOF containing uncoordinated groups in interlayer channels was successfully synthesized. • The compound 1 can exhibit significant luminescent sensitivity to Fe{sup 3+}, which make its good candidate as luminescent sensor. • The corresponding dynamic and static quenching constants are calculated, achieving the quantification evaluation of the quenching process.

36 MATERIALS SCIENCE↗
DOE OSTI2020

XtalCAMP: a comprehensive program for the analysis and visualization of scanning Laue X-ray micro-/nanodiffraction data

XtalCAMP is a software package based on the MATLAB platform, which is suitable for, but not limited to, the analysis and visualization of scanning Laue X-ray micro-/nanodiffraction data. The main objective of the software is to provide complementary functionalities to the Laue indexing software packages used at several synchrotron beamlines. Here, the graphical user interfaces allow the easy analysis of characteristic microstructure features, including real-time intensity mapping for a quick examination of phase, grain and defect distribution, 2D color-coded mapping of microstructural properties from the output of other Laue indexing software, crystal orientation visualization, grain boundary characterization based on orientation/misorientation calculation, principal strain/stress analysis, and strain ellipsoid representation, as well as a series of additional toolkits. As an example, XtalCAMP is applied to the microstructural investigation of a solution-heat-treated Ni-based superalloy manufactured using a laser 3D-printing technique, and a deformed natural quartzite from Val Bregaglia in the Central Alps.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Imaging Bragg Edge Analysis TooLs for Engineering Structures (iBeatles)

The Spallation Neutron Source (SNS) at Oak Ridge National Laboratory (ORNL) provides pulsed neutrons with energies varying from epithermal to cold. In preparation for VENUS, the neutron imaging beamline to be located at beam port 10, we have performed a series of experiments focused on wavelength-dependent radiography and computed tomography for a broad range of applications, from materials science to biological tissues.One of the time-of-flight (TOF) techniques that is of interest to the scientific community is the 2-dimensional mapping of phases and average crystalline plane orientation in samples both ex-situ and during applied stresses such as tensile loading and heating. This technique is known as Bragg edgeimaging and relies on the identification of changes of transmission values, fitting of the edge to measure its displacement, and thus identify the shift in lattice parameter due to stresses. One of the challenges of TOF imaging measurements is the amount of data and the inability to observe Bragg edge shifts in real time during an experiment. Thus, we have been focusing on creating a Python-based interface that allows fast data processing and instantaneous mapping and fitting of the Bragg edges, and their evolution through time. Python libraries and Jupyter notebooks have been implemented to facilitate decision making during an experiment. The advantage of the notebooks is the possibility to guide an experiment as they can quickly process and display Bragg edge data. These notebooks can be used independently, or can be combined in a Python Graphical User Interface (GUI) tool called iBeatles. This interface permits visualization and fitting of the Bragg edges, and ultimately back-projects the fitting results onto the radiographs to display a strain map. Assuming data collection has sufficient statistics, the strain mapping analysis can be performed on a pixel-by-pixel basis. This development is a step forward toward a better user experience at the future VENUS beamline in terms of live feedback and productivity. Analysis that used to take days of switching between different applications can now be done in minutes within the

Bilheux, JeanChristophe [Oak Ridge National Labora↗
DOE OSTI2019

R and DE Robotic Sensor Intern Team: Remote 3D Mapping Sensor Suite

The primary goal of the sensor suite is to provide an internal 3D map of the HCAEX tunnel. When looking for a sensor that would provide XYZ point cloud data for mapping the decision was between a stereo camera, a 3D Lidar, or a 2D Lidar that would need to be spun around. The issues with the stereo camera were that it does not have a large field-of-view and that its depth information was not nearly as accurate as even the baseline Lidars. The selection between Lidars is detailed. The Hokuyo UTM-30LX-EW shown provides a 270 deg. FOV with high accuracy and resolution while the largest FOV on a 3D Lidar is 40 deg.. This was the reason a 2D Lidar was chosen over the 3D Lidar. Even though the 2D Lidar requires additional components and software to generate a 3D map, its FOV advantage is too great given that the HCAEX tunnel is a relatively confined space. The rotating planar scan from the 2D Lidar can be stitched into a 3D scan as shown in the graphic below. Along with XYZ data, the Lidar provides return intensity data in color which can be used to distinguish between different materials within the tunnel. To provide visual feedback a camera system needed to be identified. The common solution for this is a high resolution camera with a small FOV mounted on a pan-tilt system. But, given the critical nature of the visual feedback we looked into solutions without the need for moving parts. Two panospheric cameras give a FOV large enough to get a full 360 deg. view.. Camera color data (RGB) can also be combined with the 3D mapping data from the Lidar and overlaid on the map to give the user the ability to see inside the entire length of the tunnel as if they were inside. Situational awareness is required for the crawler in the tunnel in order for it to be able to register the 3D scans to create a final map. For this we procured a Microstrain 3DM-GX5-25 Inertial Measurement Unit (IMU). To perform the Lidar rotation we have two servos driving the pan and tilt. The servo controls and most data processing will be performed via an onboard computer. The sensor components are to be packaged together using 3D printed mounts into a standalone unit.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2014

Ab-initio study of electronic structure and magnetic properties of half-metallic Fe{sub 2}Mn{sub 1−x}V{sub x}Si{sub 0.5}Al{sub 0.5} alloys

Ab-initio electronic structure calculations are carried out for quinternary Fe{sub 2}Mn{sub 1−x}V{sub x}Si{sub 0.5}Al{sub 0.5} alloys. When x=0 the alloy is half-metallic ferromagnet, with magnetic moment following the Slater–Pauling rule. Replacement of Mn by V, changes its electronic and magnetic structure. V-doped alloys exhibit half-metallic behavior for x≤0.25. However, even for higher V concentrations, electronic spin polarization is still very high, what makes the alloys interesting for spintronic applications. - Graphical abstract: Densities of states of Fe{sub 2}MnSi{sub 0.5}Al{sub 0.5} and magnetic moments of Fe{sub 2}Mn{sub 1−x}V{sub x}Si{sub 0.5}Al{sub 0.5}. - Highlights: • Fe{sub 2}MnSi{sub 0.5}Al{sub 0.5} is a half-metallic ferromagnet with a minority band gap of 0.49 eV. • Half-metallic band gap is very stable against the change of the lattice parameter. • Half-metallic band gap is obtained for Fe{sub 2}Mn{sub 1−x}V{sub x}Si{sub 0.5}Al{sub 0.5} for x≤0.25. • Electronic spin polarization is very high and equal to at least 95% for x≤0.625. • The main carrier of magnetism of the compound is manganese.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

One-pot occurrence of two polymorphs of Rb{sub 2}Sc[Si{sub 4}O{sub 10}]F and their structural, spectroscopic and computational characterization

Single-crystal growth experiments in the system RbF–Sc{sub 2}O{sub 3}–SiO{sub 2} resulted in the crystallization of two forms of Rb{sub 2}Sc[Si{sub 4}O{sub 10}]F within the same run. Basic crystallographic data of the two concomitant polymorphs at ambient conditions are as follows: phase I: space group I4/m, a=11.2619(3) Å, c=8.3053(4) Å, V=1053.36(6) Å{sup 3}, Z=4; phase II: space group P2{sub 1}/m, a=11.5085(6) Å, b=8.3805(3) Å, c=11.6750(6) Å, β=111.147(6)°, V=1050.19(9) Å{sup 3}, Z=4. The structures were determined by direct methods and refined to residuals of R(|F|)=0.0231 (phase I) for 516 and 0.0249 (phase II) for 2050 independent observed reflections with I>2σ(I). Phase I showed twinning by merohedry which was accounted for during the refinement process. Both compounds are based on multiple chains of [SiO{sub 4}]-tetrahedra forming closed columns or tubes. The multiplicity of the unbranched fundamental chains is two (for phase I) and four (for phase II), respectively. The periodicity of the multiple chains has a value of four in both modifications which is also reflected in similar translation periods along the chain directions (phase I: t{sub [001]}=8.31 Å; phase II: t{sub [010]}=8.38 Å). Alternatively, both polymorphs can be described as mixed octahedral–tetrahedral frameworks, which can be classified according to their polyhedral microensembles. A topological analysis of both networks is presented. Structural investigations have been supplemented by micro-Raman spectroscopy. The interpretation of the spectroscopic data including the allocation of the bands to certain vibrational species has been aided by DFT-calculations. - Graphical abstract: Mixed tetrahedral–octahedral framework of the tetragonal polymorph of Rb{sub 2}Sc[Si{sub 4}O{sub 10}]F. - Highlights: • We report the crystal structures of two polymorphs of Rb{sub 2}ScSi{sub 4}O{sub 10}F. • Both phases crystallized concomitantly in the same flux-growth experiment. • The mixed tetrahedral–octahedral nets are compared using a topological approach. • Interpretation of the Raman spectra has been aided by DFT-calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

STOCK: Structure mapper and online coarse-graining kit for molecular simulations

We present a web toolkit STructure mapper and Online Coarse-graining Kit for setting up coarse-grained molecular simulations. The kit consists of two tools: structure mapping and Boltzmann inversion tools. The aim of the first tool is to define a molecular mapping from high, e.g. all-atom, to low, i.e. coarse-grained, resolution. Using a graphical user interface it generates input files, which are compatible with standard coarse-graining packages, e.g. VOTCA and DL_CGMAP. Our second tool generates effective potentials for coarse-grained simulations preserving the structural properties, e.g. radial distribution functions, of the underlying higher resolution model. The required distribution functions can be provided by any simulation package. Simulations are performed on a local machine and only the distributions are uploaded to the server. The applicability of the toolkit is validated by mapping atomistic pentane and polyalanine molecules to a coarse-grained representation. Effective potentials are derived for systems of TIP3P (transferable intermolecular potential 3 point) water molecules and salt solution. The presented coarse-graining web toolkit is available at http://stock.cmm.ki.si.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2018

Mapping Benthic Habitat Conditions and Seafloor Deposits using Sediment Profile Imaging and a Semiautomated Image Processing System

Objectives/Scope: Sediment profile imaging (SPI) technology characterizes in situ physical, geochemical, and biological seafloor features. SPI was required by Mexico’s Agency for Safety, Energy, and Environment in 2017 for environmental baseline surveys (EBS) of oil lease blocks in the southern Gulf of Mexico. Because of its ability to provide information on benthic community health and the distribution of very thin (down to the centimeter scale) layers of deposited materials, SPI technology is highly effective for mapping drill cuttings or drilling muds released around wellheads during exploration or production and documenting their ecological impacts. SPI technology has not been widely used in the oil and gas industry for EBS or other monitoring activities. A primary objective of this work is to improve the transparency and consistency of the SPI data generation and data management process. Methods, Procedures, Process: The SPI camera works like an inverted periscope and obtains an undisturbed 21x15-cm cross-sectional image of the upper sediment column. The camera is internally powered and can be deployed rapidly from a standard winch in depths to 4,000 m. Many stations can be sampled in a single day by “pogo-sticking” across a survey area. Sediment grain size, penetration depth, surface boundary roughness, natural and anthropogenic depositional layers, depth of the oxidized surface sediment layer, maximum biogenic mixing depth, and infaunal successional stage can be directly measured at sea or immediately following the cruise. Final SPI data sets can be provided within a few weeks of the survey. Results, Observations, Conclusions: Details on the features measured in SPI images and the underlying interpretive paradigms are presented. To standardize the SPI data generation process, Integral Consulting Inc. has developed 1) a semiautomated image analysis platform, and 2) a SPI data-specific database architecture that allows both numerical and non-numerical metrics to be incorporated into a standard database structure. An integrated, software-based SPI analysis platform has been developed that imports image files and metadata and provides a graphical user interface. The software automatically stores the data, which can then be reviewed for quality assurance, plotted, statistically analyzed, and mapped or exported to other platforms (e.g., Esri ArcGIS©) for further evaluation. Image processing algorithms have been developed using a combination of open-source and commercially available software packages (e.g., MATLAB® and OpenCV) to automatically quantify key parameters. Novel/Additive Information: SPI technology’s underutilization in the oil and gas industry may be in part due to a lack of standardization in the measurement of basic features in SPI images. A primary objective of this work is to develop a streamlined, standardized, and transparent process for generating and managing SPI data.

02 PETROLEUM↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Surfactant-Specific AI-Driven Molecular Design: Integrating Generative Models, Predictive Modeling, and Reinforcement Learning for Tailored Surfactant Synthesis

Molecular design is a critical aspect of various scientific and industrial fields, where the properties of molecules hold significant importance. In this study, a 3-fold methodology design is presented that leverages the power of generative artificial intelligence (AI), predictive modeling, and reinforcement learning to create tailored molecules with desired properties. This model synergistically combines deep learning techniques with Self-Referencing Embedded Strings (SELFIES) molecular representation to build a generative model that generates valid molecules and a graphical neural network model that accurately forecasts molecular properties. The Variational Autoencoder (VAE) coupled with reinforcement learning helps refine molecule generation based on targeted attributes. Data from an experimental study involving surfactants were used to test the framework. A validation of the structural integrity of the molecules generated was conducted, and Tanimoto similarities were used to quantify the similarity and diversity between the original and generated molecular structures. Also, saliency maps for the generated surfactants were produced to identify the features explaining the property values. Lastly, molecular dynamics simulations were used to validate the stability of the generated molecules. The results showed that the proposed framework can effectively produce valid molecules within the set property threshold value.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Collaborative development of the EPICS Qt framework Phase I Final Report

At Lyncean, a private company spun-off from technology developed at the SLAC National Lab, we have been using EPICS for over a decade. EPICS is ubiquitous on our flagship product – the Compact Light Source. EPICS is not only used to control our laser and accelerator systems, but also to control our x-ray beamlines. The goal of this SBIR is for Lyncean Technologies to spearhead a worldwide collaborative effort for the development of control system tools for EPICS using the Qt framework, a C++-based coding environment that could serve as a competitive alternative to the Java-based Control System Studio (CSS). This grant's Phase I, not unlike a feasibility study, is designed for planning and scoping the preparatory work needed for Phase II or other funding opportunities. The three main objectives of this Phase I are (1) to become better acquainted with the existing EPICS Qt software and Qt framework in order to evaluate the best options for ongoing development, (2) to demonstrate that our engineers can lead the EPICS community and jump-start the Qt collaboration, and (3) to identify a scope for our future work with solicited feedback from the EPICS community. This Phase I report includes key technical findings. It clarifies the differences between the two apparently-competing EPICS Qt implementations, caQtDM and the QE Framework; it explains how to create python-bindings, and compares Qt graphical libraries. But this report is also a personal story that narrates the birth of a collaboration. Starting a collaboration is not the work of a single individual, but the work of many. Therefore this report is also an attempt to publicly give credit to many who supported the effort. The main take-away from this grant is the successful birth of an EPICS Qt collaboration, seeded with existing software from the PSI and the Australian Synchrotron. But a lot more needs to be done for the collaboration founders' vision to be realized, and for the collaboration to reach its full potential. To help define the scope of future work, a useful approach we have identified is user experience design (UXD) and is discussed herein.

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

Thin-Threads: An Approach for History-Based Monte Carlo on GPUs

A graphics processing unit (GPU) has become a core technology for modern supercomputers. Applications that once ran on supercomputers are being forced to make significant changes to their designs to utilize these new machines. This paper introduces the concept of Thin-Threads as a method for history-based Monte Carlo transport applications on GPUs. The key principles behind Thin-Threads are light memory usage and communication and managing data race issues via atomics. We show that we can achieve a 10x speedup when moving from the traditional method to Thin-Threads on GPUs. Additionally, we demonstrate the viability of the Thin-Threads model at scale for GPU and CPU platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Resilience Design Patterns: A Structured Approach to Resilience at Extreme Scale (V.2.0)

Reliability is a serious concern for future extreme-scale high-performance computing (HPC) systems. Projections based on the current generation of HPC systems and technology roadmaps suggest the prevalence of very high fault rates in future systems. The errors resulting from these faults will propagate and generate various kinds of failures, which may result in outcomes ranging from result corruptions to catastrophic application crashes. Therefore, the resilience challenge for extreme-scale HPC systems requires coordination between various hardware and software technologies that are capable of handling a broad set of fault models at accelerated fault rates. Also, due to practical limits on power consumption in future HPC systems, they are likely to embrace innovative architectures, increasing the levels of hardware and software complexities. Therefore, the techniques that seek to improve resilience must navigate the complex trade-off space between resilience and the overheads to power consumption and performance. While the HPC community has developed various resilience solutions, application-level techniques as well as system-based solutions, the solution space of HPC resilience techniques remains fragmented. There are no formal methods to integrate the various HPC resilience techniques into composite solutions, nor are there methods to holistically evaluate the adequacy and efficacy of such solutions in terms of their protection coverage, and their performance & power efficiency characteristics. Additionally, few implementations of current resilience solutions are portable to newer architectures and software environments that will be deployed on future systems. We developed a new structured approach to the management of HPC resilience using the concept of resilience-based design patterns. In general, a design pattern is a repeatable solution to a commonly occurring problem. We identified the well-known solutions that are commonly used to deal with faults, errors and failures in HPC systems. In the initial design patterns specification (version 1.0), we described the various solutions, which address specific problems in the design of resilient HPC environments, in the form of patterns. Each pattern describes a problem caused by a fault, error or failure event in an HPC environment, and then describes the core of the solution of the problem in such a way that this solution may be adapted to different systems and implemented at different layers of the system stack. The catalog of these resilience design patterns provides designers with a collection of design elements. To construct complete resilience solutions using combinations of various patterns, we defined a framework that enhances HPC designers' understanding of the important constraints and the opportunities for the design patterns to be implemented and deployed at various layers of the system stack. The design framework is also useful for establishing interfaces and mechanisms to coordinate flexible fault management across hardware and software components, as well as to consider the trade-off between performance, resilience, and power consumption when constructing a solution. The resilience design patterns specification version 1.1 included more detailed explanations of the pattern solutions, the context in which the patterns are applicable, and the implications for hardware or software design. It also provided several additional examples and detailed case studies to demonstrate the use of patterns to build realistic solutions. In version 1.2 of the specification document, we have improved the pattern descriptions, including graphical representations of the pattern components. These improvements are largely based on critical comments, feedback and suggestions received from pattern experts and readers of the previous versions of the specification. The pattern classification has been modified to further clarify the relationships between pattern categories. This version of the specification also introduces a pattern language for resilience design patterns. The pattern language presents the patterns in the catalog as a network, revealing the relations among the resilience patterns. The language provides designers with the means to explore alternative techniques for handling a specific fault model that may have different efficiency and complexity characteristics. Using the pattern language also enables the design and implementation of comprehensive resilience solutions as a set of interconnected resilience patterns that can be instantiated across layers of the system stack. The overall goal of this work is to provide hardware and software designers, as well as the users and operators of HPC systems, a systematic methodology for the design and evaluation of resilience technologies in HPC systems that keep scientific applications running to a correct solution in a timely and cost-efficient manner despite frequent faults, errors, and failures of various types. Version 2.0 expands the resilience design pattern classification and catalog to include self-stabilization patterns and reliability, availability and performance models for each structural pattern.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Bayesian model for multivariate discrete data using spatial and expert information with application to inferring building attributes

When modeling sparsely observed multivariate data, strong prior information elicited from experts can be used to bolster predictive accuracy and counteract sampling bias. Similarly, modeling autocorrelation in space can help make use of co-occurrence patterns present in many types of spatial data. To make use of both expert prior information and spatial structure, we propose a novel graphical model for a spatial Bayesian network developed specifically to address challenges in inferring the attributes of buildings from geographically sparse observational data. This model is implemented as the sum of a spatial multivariate Gaussian random field and a tabular conditional probability function in real-valued space prior to projection onto the probability simplex. This modeling form is especially suitable for the usage of prior information in the form of sets of atomic rules obtained from experts. To perform inference with missing data, we implement a Markov chain Monte Carlo scheme composed of alternating steps of Gibbs sampling of missing entries and Hamiltonian Monte Carlo for model parameters. A case study in building attribution is presented to highlight the advantages and limitations of this approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Adjusting padding of graphical charts representing data from multidimensional databases

An exemplary method of displaying a data visualization includes retrieving a dataset that includes a plurality of fields and displaying a graphical user interface with a plurality of shelves. The method further includes receiving user actions to: (i) associate a first field with a first shelf, and (ii) associate a second field with a second shelf; displaying, in accordance with the received user actions, a data visualization, where each data mark has a first size defined according to a default position of a displayed slidable affordance; and receiving an additional user action that moves the slidable affordance from the default position to a user-defined position. In response to receiving the additional user action, the method further includes updating the data visualization, where each data mark included in the updated data visualization has a second size, different from the first size, defined according to the user-defined position of the slidable affordance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Network packet templating for GPU-initiated communication

Systems, apparatuses, and methods for performing network packet templating for graphics processing unit (GPU)-initiated communication are disclosed. A central processing unit (CPU) creates a network packet according to a template and populates a first subset of fields of the network packet with static data. Next, the CPU stores the network packet in a memory. A GPU initiates execution of a kernel and detects a network communication request within the kernel and prior to the kernel completing execution. Responsive to this determination, the GPU populates a second subset of fields of the network packet with runtime data. Then, the GPU generates a notification that the network packet is ready to be processed. A network interface controller (NIC) processes the network packet using data retrieved from the first subset of fields and from the second subset of fields responsive to detecting the notification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GIGA-Lens: Fast Bayesian Inference for Strong Gravitational Lens Modeling

We present GIGA-Lens: a gradient-informed, GPU-accelerated Bayesian framework for modeling strong gravitational lensing systems, implemented in TensorFlow and JAX. The three components, optimization using multistart gradient descent, posterior covariance estimation with variational inference, and sampling via Hamiltonian Monte Carlo, all take advantage of gradient information through automatic differentiation and massive parallelization on graphics processing units (GPUs). We test our pipeline on a large set of simulated systems and demonstrate in detail its high level of performance. The average time to model a single system on four Nvidia A100 GPUs is 105 s. The robustness, speed, and scalability offered by this framework make it possible to model the large number of strong lenses found in current surveys and present a very promising prospect for the modeling of ${ \mathcal O }({10}^{5})$ lensing systems expected to be discovered in the era of the Vera C. Rubin Observatory, Euclid, and the Nancy Grace Roman Space Telescope.

79 ASTRONOMY AND ASTROPHYSICS↗