SEARCH · Search NASA

Results for “traversibility”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Quantum phase transition dynamics in the two-dimensional transverse-field Ising model

The quantum Kibble-Zurek mechanism (QKZM) predicts universal dynamical behavior near the quantum phase transitions (QPTs). It is now well understood for the one-dimensional quantum matter. Higher-dimensional systems, however, remain a challenge, complicated by the fundamentally different character of the associated QPTs and their underlying conformal field theories. In this work, we take the first steps toward theoretical exploration of the QKZM in two dimensions for interacting quantum matter. We study the dynamical crossing of the QPT in the paradigmatic Ising model by a joint effort of modern state-of-the-art numerical methods, including artificial neural networks and tensor networks. As a central result, we quantify universal QKZM behavior close to the QPT. We also note that, upon traversing further into the ferromagnetic regime, deviations from the QKZM prediction appear. We explain the observed behavior by proposing an extended QKZM taking into account spectral information as well as phase ordering. Our work provides a testing platform for higher-dimensional quantum simulators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Compositionally and density stratified igneous terrain in Jezero crater, Mars

Before Perseverance, Jezero crater’s floor was variably hypothesized to have a lacustrine, lava, volcanic airfall, or aeolian origin. SuperCam observations in the first 286 Mars days on Mars revealed a volcanic and intrusive terrain with compositional and density stratification. The dominant lithology along the traverse is basaltic, with plagioclase enrichment in stratigraphically higher locations. Stratigraphically lower, layered rocks are richer in normative pyroxene. The lowest observed unit has the highest inferred density and is olivine-rich with coarse (1.5 millimeters) euhedral, relatively unweathered grains, suggesting a cumulate origin. This is the first martian cumulate and shows similarities to martian meteorites, which also express olivine disequilibrium. Alteration materials including carbonates, sulfates, perchlorates, hydrated silicates, and iron oxides are pervasive but low in abundance, suggesting relatively brief lacustrine conditions. Orbital observations link the Jezero floor lithology to the broader Nili-Syrtis region, suggesting that density-driven compositional stratification is a regional characteristic.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Leakless end-to-end transport of small molecules through micron-length DNA nanochannels

Designed and engineered protein and DNA nanopores can be used to sense and characterize single molecules and control transmembrane transport of molecular species. However, designed biomolecular pores are less than 100 nm in length and are used primarily for transport across lipid membranes. Nanochannels that span longer distances could be used as conduits for molecules between nonadjacent compartments or cells. We design micrometer-long, 7-nm-diameter DNA nanochannels that small molecules can traverse according to the laws of continuum diffusion. Binding DNA origami caps to channel ends eliminates transport and demonstrates that molecules diffuse from one channel end to the other rather than permeating through channel walls. These micrometer-length nanochannels can also grow, form interconnects, and interface with living cells. This work thus shows how to construct multifunctional, dynamic agents that control molecular transport, opening ways of studying intercellular signaling and modulating molecular transport between synthetic and living cells.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2022

Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice

Quantum walks provide a framework for designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. We do this by combining the fast, programmable control provided by optical tweezers with the scalable, homogeneous environment of an optical lattice. With these tools we study continuous-time quantum walks of single atoms on a square lattice and perform proof-of-principle demonstrations of spatial search with these walks. When scaled to more particles, the capabilities demonstrated can be extended to study a variety of problems in quantum information science, including performing more effective versions of spatial search using a larger graph with increased connectivity.

Science & Technology - Other Topics↗

DOE OSTI2021

Precision measurement of the electron energy-loss function in tritium and deuterium gas for the KATRIN experiment

Abstract The KATRIN experiment is designed for a direct and model-independent determination of the effective electron anti-neutrino mass via a high-precision measurement of the tritium $$\upbeta $$ β -decay endpoint region with a sensitivity on $$m_\nu $$ m ν of 0.2 $$\hbox {eV}/\hbox {c}^2$$ eV / c 2 (90% CL). For this purpose, the $$\upbeta $$ β -electrons from a high-luminosity windowless gaseous tritium source traversing an electrostatic retarding spectrometer are counted to obtain an integral spectrum around the endpoint energy of 18.6 keV. A dominant systematic effect of the response of the experimental setup is the energy loss of $$\upbeta $$ β -electrons from elastic and inelastic scattering off tritium molecules within the source. We determined the energy-loss function in-situ with a pulsed angular-selective and monoenergetic photoelectron source at various tritium-source densities. The data was recorded in integral and differential modes; the latter was achieved by using a novel time-of-flight technique. We developed a semi-empirical parametrization for the energy-loss function for the scattering of 18.6-keV electrons from hydrogen isotopologs. This model was fit to measurement data with a 95% $$\hbox {T}_2$$ T 2 gas mixture at 30 K, as used in the first KATRIN neutrino-mass analyses, as well as a $$\hbox {D}_2$$ D 2 gas mixture of 96% purity used in KATRIN commissioning runs. The achieved precision on the energy-loss function has abated the corresponding uncertainty of $$\sigma (m_\nu ^2)< {{10}^{-2}}{\hbox {eV}^{2}}$$ σ ( m ν 2 ) < 10 - 2 eV 2 [1] in the KATRIN neutrino-mass measurement to a subdominant level.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2023

Deep learning assisted jet tomography for the study of Mach cones in QGP

Abstract Mach cones are expected to form in the expanding quark-gluon plasma (QGP) when energetic quarks and gluons traverse the hot medium at a velocity faster than the speed of sound in high-energy heavy-ion collisions. The shape of the Mach cone and the associated diffusion wake are sensitive to the initial jet production location and the propagation direction of the parton shower relative to the radial flow because of the distortion caused by the collective expansion of the QGP and the large density gradient. The shape of jet-induced Mach cones and their distortions in heavy-ion collisions provide a unique and direct probe of the dynamical evolution and the equation of state of QGP. However, it is difficult to identify the Mach cone and the diffusion wake in current experimental measurements of final hadron distributions because they are averaged over all possible initial jet production locations and parton-shower propagation directions. To overcome this difficulty, we develop a deep learning assisted jet tomography which uses the full information of the final hadrons from jets to localize the initial jet production positions. This method can help to constrain the initial regions of jet production in heavy-ion collisions and enable a differential study of Mach-cones with different path lengths and orientations relative to the radial flow of the QGP in heavy-ion collisions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Picturing QCD jets in anisotropic matter: from jet shapes to energy energy correlators

Abstract Recent theoretical developments in the description of jet evolution in the quark gluon plasma have allowed to account for the effects of hydrodynamic gradients in the medium modified jet spectra. These constitute a crucial step towards using jets as tomographic probes of the nuclear matter they traverse. In this work, we complement these studies by providing leading order calculations of widely studied jet observables, taking into account matter anisotropies. We show that the energy distribution inside a jet is pushed towards the direction of the largest matter anisotropy, while the away region is depleted. As a consequence, the jet mass and girth gain a non-trivial azimuthal dependence, with the average value of the distribution increasing along the direction of largest gradients. However, we find that, for these jet shapes, matter anisotropic effects can be potentially suppressed by vacuum Sudakov factors. We argue that the recently proposed measurements of energy correlations within jets do not suffer from such effects, with the azimuthal dependence being visible in a large angular window, regardless of the shape of the distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

A supernodal all-pairs shortest path algorithm

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

Sao, Piyush↗

DOE OSTI2023

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

DOE OSTI2023

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs

DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

Prokopenko, Andrey↗

DOE OSTI2026

CORE-BFS: Communication-Optimized REctangular-partitioned BFS Achieving 160.845 TeraTEPS on Frontier Supercomputer

Distributed Breadth-First Search (BFS) is fundamental to many large-scale graph applications, but its performance on parallel systems is often limited by high communication overhead. This paper presents CORE-BFS, an extremely scalable GPU-based BFS implementation that introduces a unique rectangular 2D partitioning-based design for Frontier supercomputer. To further improve performance, we propose four key optimizations: (1) Rectangular 2D-partition specific data formats that use two compressed row and one compressed column status array bitmaps combined with a Double Compressed Sparse Row (DCSR) format per partition, reducing memory footprint and inter-rank traffic; (2) Adaptive frontier & communication strategy that unifies top-down and bottom-up traversal on the rectangular layout, uses lazy synchronization in top-down levels, and switches variants based on frontier size to minimize communication overhead; (3) Frontier-split degree-aware update that maps frontier vertices to thread-centric, wavefront-centric, and block-centric kernels based on their degree to improve GPU utilization and memory coalescing; (4) Row-reduction pipeline that overlaps bottom-up adjacency list processing with row-wise bitmap reduction to hide inter-rank latency. Together, these techniques increase parallelism while reducing memory and communication overhead. On the Graph500 benchmark, CORE - BFS scales up to 9,248 Frontier nodes with scale-42 graphs and reaches 160.845 TTEPS, delivering a 5.42 × speedup over our previous Frontier implementation.

Yang, Haoshen [Rutgers University]↗

DOE OSTI2023

Ultrafast X-Ray Probes of Elementary Molecular Events

Elementary events that determine photochemical outcomes and molecular functionalities happen on the femtosecond and subfemtosecond timescales. Among the most ubiquitous events are the nonadiabatic dynamics taking place at conical intersections. These facilitate ultrafast, nonradiative transitions between electronic states in molecules that can outcompete slower relaxation mechanisms such as fluorescence. The rise of ultrafast X-ray sources, which provide intense light pulses with ever-shorter durations and larger observation bandwidths, has fundamentally revolutionized our spectroscopic capabilities to detect conical intersections. Recent theoretical studies have demonstrated an entirely new signature emerging once a molecule traverses a conical intersection, giving detailed insights into the coupled nuclear and electronic motions that underlie, facilitate, and ultimately determine the ultrafast molecular dynamics. Following a summary of current sources and experiments, we survey these techniques and provide a unified overview of their capabilities. We discuss their potential to dramatically increase our understanding of ultrafast photochemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗

DOE OSTI2020

Bindee

Bindee is a clang tool that outputs a simple pybind11 template given a C++ file for efficient generation of C++-Python bindings. Bindee is intended to be a helper tool for minimizing initial user effort and safeguarding against common runtime errors. Bindee relies on two open-source software to produce bindings. Clang's LibTooling enables bindee to traverse a C++ file's AST to pick out bindable variables and functions, or "bindees." PyBind11 is templated, header-only library for generating C++-Python bindings for variables and functions. Operating purely in C++, bindee does not require learning any new API for accomplishing its task. Additionally, picking the correct pybind11 API for a given bindable element is handled without interaction from the user. Any user input is denoted by '@TEXT@' string substitution. Bindee is capable of generating modular bindings for public class methods, public class variables, enumerations, and free functions and variables. Bindings for templates are also supported. For those familiar with pybind11, bindee does not handle trampolines, C++ extensions through lambdas, or custom type casters.

Kimkno, JasonS.↗

DOE OSTI2022

MEASUR - Manufacturing Energy Assessment Software for Utility Reduction

MEASUR your energy savings with the free DOE MEASUR software The Department of Energy (DOE), with Oak Ridge National Laboratory (ORNL), released version 1.0 of their energy efficiency software tool MEASUR (Manufacturing Energy Assessment Software for Utility Reduction). MEASUR has been available for several years as a beta version, being tested by industry experts and real users, and will continue to be updated and improved in the coming years. It is an integrated suite of tools to aid manufacturers in improving the efficiency of energy systems and equipment within a plant, including motors, pumps, fans, process heating, steam, and compressed air. Additionally, there are modules for wastewater energy analysis and to help perform energy treasure hunts. Several calculators are also included, allowing users to independently perform smaller calculations and analyses (such as estimating pump head, performing a fan traverse analysis, estimating waste heat recovery potential, and cataloging compressed air leaks). The MEASUR modules are based on previous DOE software tools that have been used by industry since the early 2000s (such as MotorMaster, AirMaster+, PSAT, PHAST, and FSAT). The original tools only ran on Windows operating systems, and by Windows 10, most of them were inoperable. DOE started their energy efficiency software tool revitalization effort in 2016, first with PSAT (for pumps), then began to integrate the other tools and expand their functionality and utility. The new MEASUR suite provides an extensively more user-friendly, modern, and versatile set of tools. All the assessment modules and most of the calculators have several visual components and graphs and detailed help text for every user input. To help reach international users, the tool utilizes Google translate and users can easily change unit systems, even converting existing user inputs if desired. The assessment files can be organized within the internal file system and easily shared to other users, regardless of their operating system. The entire suite is free, open-source, and can be downloaded on Windows, Mac, or Linux operating systems.

Accawi, Gina [Oak Ridge National Lab. (ORNL), Oak ↗

DOE OSTI2024

Arbitrary State Preparation via Quantum Walks Software

SF-24-077 Our software generates a circuit that prepares a specified target quantum state. It generates circuits with CNOT counts of O(mn), where m is the number of nonzero amplitudes of the state and n is the number of qubits. The method does not require ancillas. It is designed for sparse states, but works for any quantum state. Our method is based on the new perspective of dynamic continuous time quantum walks for quantum state preparation. This is an intuitive perspective where a graph is first constructed to traverse the basis states. The method works by 1.) construct a graph of the basis states, 2.) transform the graph into quantum walks, and 3.) construct the final gate based circuit optimized with our control reduction method.

Liu, Ji↗

DOE OSTI2024

Faraday: A High-temperature Electrolysis Data Explorer

Faraday is a high-temperature electrolysis data visualization tool, which reveals the performance of various button cells under test conditions. These tests and the resulting analytics on their data constitute a state of the industry as the US Department of Energy pushes for the production of hydrogen. Faraday leverages the Idaho National Laboratory's DeepLynx data warehouse to standardize and query button cell data. Faraday programmatically accesses this data in DeepLynx by traversing the schema, represented by a custom ontology. The user interface queries DeepLynx for timeseries data associated with specific button cells in the warehouse, and renders them using JavaScript charts. Additional charting and data analysis techniques are made possible by an auxiliary Python server.

Woodruff, Nathan↗

DOE OSTI2025

BAMCensus (The Behavior and Advanced Mobility Census Dataset Aggregator) [SWR-25-120]

This software is a high-performance tool developed in Rust for downloading and processing large-scale geospatial datasets, specifically focusing on US Census data. It is designed to address scaling limitations found in existing tools, such as R's [tidycensus](https://walker-data.com/tidycensus/), by providing performant streaming dataset JOIN operations between various US Census datasets (like ACS and LEHD) and their corresponding geometries stored on the TIGER/Lines web server. The tool automates the process of joining these data sources, returning aggregated data to the user based on a specified census GEOID type. The tool automates the process of joining these data sources, returning aggregated data to the user based on a specified census GEOID type. Its primary motivation stems from the need for a high-performance solution to combine spatial datasets with graph traversals within the context of mobility analysis tooling being developed at NREL's Behavior and Advanced Mobility (BAM) group.

Fitzgerald, Robert [National Renewable Energy Labo↗