Search NASA⌕ Search

SEARCH · Search NASA

Results for “ACCESS Methods”

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 91 records · Page 5

Extraction and Analysis of Time Series Data from Building Automation Systems Using Large Language Models

Semantic schemas like Haystack 4, Brick and ASHRAE standard 223 enable the structured, standardized, and machine-readable representation of building data, facilitating interoperability, data integration, and advanced analytics. However, extracting information from these models requires specialized expertise in SPARQL and other programming languages, skills that are not commonly found among building professionals. Recent advancements in Large Language Models (LLMs), such as ChatGPT, enable the construction of queries using natural language, making it easier for individuals to interact with these systems in a manner that resembles everyday speech. However, these methods have not yet been tested on building semantic ontologies. This paper introduces a novel workflow and tool for enabling users to ask questions about a specific building's data, using natural language and receive answers automatically generated by GPT-4o. Our approach integrates semantic ontologies with advanced LLM capabilities to automate three critical steps: (1) generating SPARQL queries to retrieve time series references from ontological models, (2) extracting the corresponding time series data from the Building Automation System, and (3) performing computations and visualizations tailored to the user's query. The proposed method simplifies access to BAS data, allowing both domain experts and non-specialists to conduct sophisticated analyses without needing extensive technical knowledge of semantic web technologies. By demonstrating this pipeline, we facilitate more accessible and scalable data-driven decision-making in building operations and management.

Mulayim, Ozan Baris↗

Biometric Access Control System Industrialization

The Biometric Access Control System Industrialization project was initiated as Project 2 under the umbrella Cooperative Research and Development Agreement (CRADA) No. SC 14/01816.00.00 between National Technology and Engineering Solutions of Sandia (NTESS) and AQUILA on July 16, 2019. The purpose of this project has been to evaluate alternatives to the more traditional biometric access control methods, such as fingerprints and retinal scanners.

60 APPLIED LIFE SCIENCES↗

A Convex Data-Driven Approach for Nonlinear Control Synthesis

We consider a class of nonlinear control synthesis problems where the underlying mathematical models are not explicitly known. We propose a data-driven approach to stabilize the systems when only sample trajectories of the dynamics are accessible. Our method is built on the density-function-based stability certificate that is the dual to the Lyapunov function for dynamic systems. Unlike Lyapunov-based methods, density functions lead to a convex formulation for a joint search of the control strategy and the stability certificate. This type of convex problem can be solved efficiently using the machinery of the sum of squares (SOS). For the data-driven part, we exploit the fact that the duality results in the stability theory can be understood through the lens of Perron–Frobenius and Koopman operators. This allows us to use data-driven methods to approximate these operators and combine them with the SOS techniques to establish a convex formulation of control synthesis. The efficacy of the proposed approach is demonstrated through several examples.

97 MATHEMATICS AND COMPUTING↗

Carrier-assisted One-pot Sample Preparation for Targeted Proteomics Analysis of Small Numbers of Human Cells

Protein analysis of small numbers of human cells is primarily achieved by targeted proteomics with antibody-based immunoassays, which have inherent limitations (e.g., low multiplex and unavailability of antibodies for new proteins). Mass spectrometry (MS)-based targeted proteomics has emerged as an alternative because it is antibody-free, high multiplex, and has high specificity and quantitation accuracy. Recent advances in MS instrumentation make MS-based targeted proteomics possible for multiplexed quantification of highly abundant proteins in single cells. However, there is a technical challenge for effective processing of single cells with minimal sample loss for MS analysis. To address this issue, we have recently developed a convenient protein carrier-assisted one-pot sample preparation coupled with liquid chromatography (LC) - selected reaction monitoring (SRM) termed cLC-SRM for targeted proteomics analysis of small numbers of human cells. This method capitalizes on using the combined excessive exogenous protein as a carrier and low-volume one-pot processing to greatly reduce surface adsorption losses as well as high-specificity LC-SRM to effectively address the increased dynamic concentration range due to the addition of exogeneous carrier protein. Its utility has been demonstrated by accurate quantification of most moderately abundant proteins in small numbers of cells (e.g., 10-100 cells) and highly abundant proteins in single cells. The easy-to-implement features and no need for specific devices make this method readily accessible to most proteomics laboratories. In this study, we have provided a detailed protocol for cLC-SRM analysis of small numbers of human cells including cell sorting, cell lysis and digestion, LC-SRM analysis, and data analysis. Further improvements in detection sensitivity and sample throughput are needed towards targeted single-cell proteomics analysis. We anticipate that cLC-SRM will be broadly applied to biomedical research and systems biology with the potential of facilitating precision medicine.

60 APPLIED LIFE SCIENCES↗

Extraction and Analysis of Time Series Data from Building Automation Systems Using Large Language Models

Semantic schemas like Haystack 4, Brick and ASHRAE standard 223 enable the structured, standardized, and machine-readable representation of building data, facilitating interoperability, data integration, and advanced analytics. However, extracting information from these models requires specialized expertise in SPARQL and other programming languages, skills that are not commonly found among building professionals. Recent advancements in Large Language Models (LLMs), such as ChatGPT, enable the construction of queries using natural language, making it easier for individuals to interact with these systems in a manner that resembles everyday speech. However, these methods have not yet been tested on building semantic ontologies. This paper introduces a novel workflow and tool for enabling users to ask questions about a specific building's data, using natural language and receive answers automatically generated by GPT-4o. Our approach integrates semantic ontologies with advanced LLM capabilities to automate three critical steps: (1) generating SPARQL queries to retrieve time series references from ontological models, (2) extracting the corresponding time series data from the Building Automation System, and (3) performing computations and visualizations tailored to the user's query. The proposed method simplifies access to BAS data, allowing both domain experts and non-specialists to conduct sophisticated analyses without needing extensive technical knowledge of semantic web technologies. By demonstrating this pipeline, we facilitate more accessible and scalable data-driven decision-making in building operations and management.

Mulayim, Ozan Baris↗

Computing system operational methods and apparatus

Computing system operational methods and apparatus are described. According to one aspect, a computing system operational method includes accessing user information regarding a user logging onto a computing device of the computing system, processing the user information to determine if the user information is authentic, as a result of the processing determining that the user information is authentic, first enabling the computing device to execute an application segment, and as a result of the processing determining that the user information is authentic, second enabling the application segment to communicate data externally of the computing device via one of a plurality of network segments of the computing system.

Edgar, Thomas W.↗

Accelerating Application Bulk Synchronous Writes in HPC Environments

High-bandwidth storage tiers are becoming more common for their capability to absorb high-rate, bursty I/Os. Notably, the designs of these fast storage tiers differ from system to system. The variation of these layers and non-uniform methods of access can pose chal- lenges for applications seeking to run at multiple HPC facilities. Therefore, in this work, we present Spectral, a rapid-output ab- straction library to accelerate application, bulk-synchronous writes on HPC systems. We design Spectral to enable applications to use high-bandwidth storage, such as node-local storage and dis- tributed, write-caches (e.g., burst buffers) transparently without requiring modifications to the application or file system source code. The key idea is to allow applications to spend most of the time performing productive work and to not require any source code changes for maximum portability on different HPC archi- tectures. Spectral internally re-routes write-only files through available, high-performance I/O resources before ultimately mi- grating them to the shared global parallel file system. For instance, on Summit, Spectral transparently places application outputs on node-local storage and then utilizes asynchronous migration to the center-wide GPFS file system. We evaluate Spectral on the Summit HPC system (1024 nodes) using the IOR benchmark and real scientific applications. Spectral shows linear performance scaling, improving application write performance by over an order of magnitude when compared to GPFS.

Khan, Awais↗

Timelike Compton Scattering from a longitudinally polarised target with CLAS12 at Jefferson Lab

Explorations into the internal dynamics of hadrons are constantly evolving, and the requirement for experimental results to verify theoretical models of hadron structure is paramount. A key area in this field is the study of Generalised Parton Distributions (GPDs), which are functions used to model the momenta of quarks and gluons within hadrons, and the methods to access GPDs experimentally. One such scattering process that allows access to these is Timelike Compton Scattering. TCS complements existing Deeply Virtual Compton Scattering experiments and allows investigation into the universality of GPDs through access to the real and imaginary parts of the parton helicity independent GPD Hq via beam spin asymmetries (BSA), and it provides novel access to the real and imaginary parts of the parton helicity dependent GPD ˜Hq through target polarisation asymmetries (TSA). This thesis work presents a comparative study with the first published BSA for TCS at the Thomas Jefferson National Accelerator Facility (JLab), alongside a first time extraction of a Target Spin Asymmetry with the Summer 2022 data taking run. JLab hosts the Continuous Electron Beam Accelerator Facility (CEBAF) which provides a 12 GeV electron beam to four experimental halls. Hall-B contains the CEBAF Large Acceptance Spectrometer, which took data across three run periods on a longitudinally polarised NH3 and ND3 fixed target from 2022-2023, to extract measurements of electron-proton scattering, from which a TCS signal could be extracted. The thesis discusses work done to understand and eliminate contributions from the non-/low-polarised nuclear background, testing pre-established cuts to eliminate pion background from a dilepton (e+e-) final state and modifying them as needed for the new experimental run, and attempts to hone in on a clean TCS signal from which to extract the two asymmetry observables. A comparison with existing BSA results was performed; however, the statistical errors are too large to draw a significant conclusion as to whether there is agreement across each bin. More data is needed for a multidimensionally binned extraction. A proof of principle was achieved in the TSA measurements, with two out of four kinematic bins showing preliminary agreement in shape with theoretical values. Again, the errors are significant due to the contributions from the nuclear background. To support these conclusions, a further study was done, which takes into account an estimate of the asymmetries with the full available dataset (this thesis is based only on data taken in the summer set; at the time of writing processing was still being conducted for the final two datasets), as well as an estimate including additional future experiment days that were awarded in July 2024. Additional work was done on a secondary project exploring the feasibility of measuring TCS at the upcoming Electron Ion Collider, supporting the design proposal for the detector for the first interaction region and giving a positive outlook for the future of these types of measurements beyond JLab.

Gates, Kayleigh [Univ. of Glasgow, Scotland (Unite↗

Memory access statistics monitoring

Systems, apparatuses, and methods related to memory access statistics monitoring are described. A host is configured to map pages of memory for applications to a number of memory devices coupled thereto. A first memory device comprises a monitoring component configured to monitor access statistics of pages of memory mapped to the first memory device. A second memory device does not include a monitoring component capable of monitoring access statistics of pages of memory mapped thereto. The host is configured to map a portion of pages of memory for an application to the first memory device in order to obtain access statistics corresponding to the portion of pages of memory upon execution of the application despite there being space available on the second memory device and adjust mappings of the pages of memory for the application based on the obtained access statistics corresponding to the portion of pages.

Roberts, David A.↗

Cost of convenience in long-dwell public electric vehicle charging

This paper presents a comprehensive methodology for quantifying trade offs between the cost of charging at public Level-2 charging stations and the inconvenience of using those stations. The paper also includes a methodology for generating synthetic travel itineraries of tens of thousands of drivers and for sizing and placing charging infrastructure to support those itineraries. Inconvenience is quantified by a weighted sum of the time a driver spends traveling between their intended destination and the charging station; weights are derived from the activity interrupted by the driver’s need to move their car. We demonstrate a trade off between cost of charging and inconvenience by varying how far away from their destination drivers are willing to charge. Our results demonstrate the importance of access to stations and suggest that other methods for increasing access, such as increasing the spatial density of stations, could significantly impact charging cost and inconvenience. Moreover, average energy cost may be reduced by introducing managed charging, which also affects inconvenience. The framework presented here can be used to evaluate the overlapping effects of both access and charge management. Furthermore, the framework can be easily extended to include additional factors such as capital costs, enabling thorough evaluation and planning of regional Level-2 charging networks.

32 - ENERGY CONSERVATION, CONSUMPTION, AND UTILIZA↗

JetNet: A Python package for accessing open datasets and benchmarking machine learning methods in high energy physics

JetNet is a Python package that aims to increase accessibility and reproducibility for machinelearning (ML) research in high energy physics (HEP), primarily related to particle jets. Basedon the popular PyTorch ML framework, it provides easy-to-access and standardized interfacesfor multiple heterogeneous HEP datasets and implementations of evaluation metrics, lossfunctions, and more general utilities relevant to HEP.

97 MATHEMATICS AND COMPUTING↗

Rapid Construction of Validated Chemistry Models for Advanced Biofuels (Co-Optima Final Report)

Computer methods were developed and demonstrated that make it possible to predict the combustion and pyrolysis chemistry of proposed biofuels, even before the biofuels are ever manufactured or experimentally tested. The methods are based on first-principles calculations of reaction rates and equilibria. A large number of complicated calculations are required, so we developed a computer workflow that automates many of the steps. With the chemical structure of the biofuel and the system conditions (temperature, pressure, compositions, etc.) as the input, the computer methods can construct a detailed kinetic model with refined parameters without intense human intervention. The automation of model construction makes it practical for a single engineer to make the predictions in a reasonable time period. The accuracy of the computer predictions was tested by measuring the time-profiles of various reaction intermediates (carbon monoxide, carbon dioxide, water, formaldehyde, methane, and ethylene) formed as the biofuels pyrolyze or ignite using sophisticated laser shock tube methods. Several biofuels, including methyl propyl ether, cyclopentanone, butyl acetate isomers, etc., were carefully studied to demonstrate the validity of the proposed computational and experimental methodology. This research project opens up the possibility for assessing some proposed biofuels on the computer without expensive experimental campaigns. The new computer methods are open source and well-documented, allowing a knowledgeable modeler to easily access the developed methods and implement them in their work routine. Moreover, they are also convenient and powerful, promising for developing the fuel chemistry models needed for use in engine simulators, facilitating co-optimization of new engine designs with new fuels.

09 BIOMASS FUELS↗

Cache management based on access type priority

Systems, apparatuses, and methods for cache management based on access type priority are disclosed. A system includes at least a processor and a cache. During a program execution phase, certain access types are more likely to cause demand hits in the cache than others. Demand hits are load and store hits to the cache. A run-time profiling mechanism is employed to find which access types are more likely to cause demand hits. Based on the profiling results, the cache lines that will likely be accessed in the future are retained based on their most recent access type. The goal is to increase demand hits and thereby improve system performance. An efficient cache replacement policy can potentially reduce redundant data movement, thereby improving system performance and reducing energy consumption.

Yin, Jieming↗

Toward DMC Accuracy Across Chemical Space with Scalable Δ-QML

In the past decade, quantum diffusion Monte Carlo (DMC) has been demonstrated to successfully predict the energetics and properties of a wide range of molecules and solids by numerically solving the electronic many-body Schrödinger equation. With O(N 3 ) scaling with the number of electrons N, DMC has the potential to be a reference method for larger systems that are not accessible to more traditional methods such as CCSD(T). Assessing the accuracy of DMC for smaller molecules becomes the stepping stone in making the method a reference for larger systems. We show that when coupled with quantum machine learning (QML)-based surrogate methods, the computational burden can be alleviated such that quantum Monte Carlo (QMC) shows clear potential to undergird the formation of high-quality descriptions across chemical space. We discuss three crucial approximations necessary to accomplish this: the fixed-node approximation, universal and accurate references for chemical bond dissociation energies, and scalable minimal amons-set-based QML (AQML) models. Numerical evidence presented includes converged DMC results for over 1000 small organic molecules with up to five heavy atoms used as amons and 50 medium-sized organic molecules with nine heavy atoms to validate the AQML predictions. Finally, numerical evidence collected for Δ-AQML models suggests that already modestly sized QMC training data sets of amons suffice to predict total energies with near chemical accuracy throughout chemical space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New method for detecting fast neutrino flavor conversions in core-collapse supernova models with two-moment neutrino transport

Fast-pairwise neutrino oscillations potentially affect many aspects of core-collapse supernovae (CCSNe): the explosion mechanism, neutrino signals, and nucleosynthesis in the ejecta. This particular mode of collective neutrino oscillations has a deep connection to the angular structure of neutrinos in momentum space; for instance, the appearance of electron-neutrino lepton number (ELN) angular crossings in momentum space is a good indicator of the occurrence of flavor conversions. However, many multidimensional CCSN simulations are carried out with approximate neutrino transport (such as two-moment methods), which limits access to the angular distributions of neutrinos, i.e., inhibits ELNcrossing searches. In this paper, we develop a new method of searching for ELN crossing in these CCSN simulations. The required data is the zeroth and first angular moments of neutrinos and the matter profile, all of which are available in CCSN models with the two-moment method. One of the novelties of our new method is the use of a ray-tracing neutrino transport to determine ELNs in the direction of the stellar center. It is designed to compensate for shortcomings of the crossing searches with only two angular moments. We assess the capability of the method by carrying out a detailed comparison with results of full Boltzmann neutrino transport in 1D and 2D CCSN models. In this work, we find that the ray-tracing neutrino transport improves the accuracy of crossing searches; indeed, the appearance/disappearance of the crossings is accurately detected even in the region of forward-peaked angular distributions. The new method is computationally cheap and has the benefit of efficient parallelization; hence, it will be useful for ELN-crossing searches in any CCSN models that employ two-moment neutrino transport.

79 ASTRONOMY AND ASTROPHYSICS↗

The LLNL nuclear data infrastructure for the GNDS data format

The next generation of nuclear data infrastructure tools at the Livermore National Laboratory (LLNL) consists of pipeline of codes that read and process nuclear data from evaluated files saved in the new GNDS (Generalised Nuclear Data Structure) nuclear data format. The processing code FUDGE (For Updating Data and Generating Evaluations) is at the front-end of this pipeline as it reads and process the evaluated data for use in downstream transport codes. FUDGE is Python based with C and C++ extensions for computationally intensive tasks. As is the case for the evaluated data, the processed output is also saved in the GNDS format and the GIDI+ API is provided as the interface between the processed data and the transport codes. GIDI+ is a C++ based suite of codes and it includes GIDI (General Interaction Data Interface), a library for reading and writing GNDS data, and MCGIDI which is the cross section lookup, and reaction and product distribution sampling interface between Monte Carlo transport codes and the GNDS data. GIDI provides methods for easy access to the multi-group processed GNDS data and this is demonstrated through its implementation in ARDRA, the LLNL deterministic transport code. The evaluation and sampling methods in MCGIDI are available as both CPU and GPU methods which facilitates the use of MCGIDI in both traditional CPU-based as well as the next generation mixed model computational architectures. This is demonstrated through the GIDI+ implementation in MERCURY, the LLNL Monte Carlo transport code. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Assessment of software methods for estimating protein-protein relative binding affinities

A growing number of computational tools have been developed to accurately and rapidly predict the impact of amino acid mutations on protein-protein relative binding affinities. Such tools have many applications, for example, designing new drugs and studying evolutionary mechanisms. In the search for accuracy, many of these methods employ expensive yet rigorous molecular dynamics simulations. By contrast, non-rigorous methods use less exhaustive statistical mechanics, allowing for more efficient calculations. However, it is unclear if such methods retain enough accuracy to replace rigorous methods in binding affinity calculations. This trade-off between accuracy and computational expense makes it difficult to determine the best method for a particular system or study. Here, eight non-rigorous computational methods were assessed using eight antibody-antigen and eight non-antibody-antigen complexes for their ability to accurately predict relative binding affinities (ΔΔG) for 654 single mutations. In addition to assessing accuracy, we analyzed the CPU cost and performance for each method using a variety of physico-chemical structural features. This allowed us to posit scenarios in which each method may be best utilized. Most methods performed worse when applied to antibody-antigen complexes compared to non-antibody-antigen complexes. Rosetta-based JayZ and EasyE methods classified mutations as destabilizing (ΔΔG < -0.5 kcal/mol) with high (83–98%) accuracy and a relatively low computational cost for non-antibody-antigen complexes. Some of the most accurate results for antibody-antigen systems came from combining molecular dynamics with FoldX with a correlation coefficient (r) of 0.46, but this was also the most computationally expensive method. Overall, our results suggest these methods can be used to quickly and accurately predict stabilizing versus destabilizing mutations but are less accurate at predicting actual binding affinities. This study highlights the need for continued development of reliable, accessible, and reproducible methods for predicting binding affinities in antibody-antigen proteins and provides a recipe for using current methods.

59 BASIC BIOLOGICAL SCIENCES↗

A non‐intrusive domain‐decomposition model reduction method for linear steady‐state partial differential equations with random coefficients

Abstract Domain decomposition methods have been proved to be an effective strategy to reduce the dimension of parametric partial differential equations (PDEs). However, existing domain decomposition methods for parametric PDEs are usually intrusive, which means domain decomposition based solvers need to be implemented from scratch for each target parametric PDE. To address this issue, we develop a new non‐intrusive domain‐decomposition model reduction method for linear steady‐state PDEs with random‐field coefficients. As a variant of our previous work by Mu and Zhang, the new method only needs access to the final linear system, that is, the global stiffness matrix and the right hand side, of a deterministic PDE solver, in order to build a domain‐decomposition‐based reduced model without intrusive implementation from scratch. The key idea is to remove the interface condition between sub‐domains and rely on the correlation between columns of the linear system to couple the sub‐domains. The non‐intrusive feature enables the applicability of the proposed method to a broader class of uncertainty quantification problems, where many legacy codes/solvers can be fully reused by our method. Two numerical examples including diffusion equations with random diffusivity and convection‐dominated transport with random velocity, are provided to demonstrate the effectiveness and efficiency of our method.

Zhang, Guannan↗