Search NASA⌕ Search

SEARCH · Search NASA

Results for “LET”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Uncertainty Quantification of Capacitor Switching Transient Location using Machine Learning

Identification of capacitor switching transient location provides valuable insight into the state of the associated equipment. Machine learning (ML) models, and convolutional neural networks (CNNs) in particular, have demonstrated remarkable performance in signal location. However, ML models are data driven whose predictions are affected by noise in data and may also suffer from large extrapolation errors when applied to new conditions. Uncertainty quantification (UQ) is necessary to ensure model trustworthiness and avoid overconfident predictions in extrapolation. Here, in this work, we propose a novel UQ method, called PI3NN, to quantify prediction uncertainty of ML models and integrate the method with CNNs for transient source location. PI3NN calculates Prediction Intervals by training 3 Neural Networks and uses root-finding methods to determine the interval precisely. Additionally, PI3NN can identify out-of-distribution (OOD) data in a nonstationary condition to avoid overconfident prediction. Results indicate that with PI3NN, transient signals are not only correctly identified, but when said signals are subject to corruptions characteristic of an actual power monitoring system (e.g. non-ideal sensors), the model recognizes when it is uncertain about its predictions, effectively letting the user know when to accept or discard the results.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Science Capsule: Towards Sharing and Reproducibility of Scientific Workflows

Workflows are increasingly processing large volumes of data from scientific instruments, experiments and sensors. These workflows often consist of complex data processing and analysis steps that might include a diverse ecosystem of tools and also often involve human-in-the-loop steps. Sharing and reproducing these workflows with collaborators and the larger community is critical but hard to do without the entire context of the workflow including user notes and execution environment. In this paper, we describe Science Capsule, which is a framework to capture, share, and reproduce scientific workflows. Science Capsule captures, manages and represents both computational and human elements of a workflow. It automatically captures and processes events associated with the execution and data life cycle of workflows, and lets users add other types and forms of scientific artifacts. Science Capsule also allows users to create `workflow snapshots' that keep track of the different versions of a workflow and their lineage, allowing scientists to incrementally share and extend workflows between users. Our results show that Science Capsule is capable of processing and organizing events in near real-time for high-throughput experimental and data analysis workflows without incurring any significant performance overheads.

Ghoshal, Devarshi↗
DOE OSTI2022

Radiation testing of 2.4 micron wavelength extended InGaAs photodiodes for 100 MeV/n carbon ions

We have successfully tested simultaneously 2.4 Micron Wavelength, Extended InGaAs Photodiodes having diameters of 20, 30, 40, 50, 100, 150, 200, 250, and 290 Micron, coupled with a Single Mode Fiber using 100 MeV/n Carbon (C) Ions up to a cumulative dose of ~40 krad. During irradiation, the devices were maintained at dry ice temperature, reverse biased at 100 mV, and their leakage current was continuously monitored in-situ during the run. After the exposure was completed, all nine devices were monitored for any change in their leakage current at 100 mV and room temperature for several weeks to monitor any annealing effects that may occur. Nine Photodiodes with the above varying diameters were radiated with 100 MeV/n Carbon Ions with a fluence of 10 6 , 10 7 , 10 8 , 10 9 , and 10 10 ions/cm 2 at each fluence level. At 100 MeV/n the Linear Energy Transfer (LET) of Carbon Ion is ~0.156 MeV-cm 2 /mg in Extended InGaAs, which is an order magnitude more than Proton (H) and Helium (He) Ions of 100 MeV/n energy. Thus, significant displacement damage is anticipated in the Extended InGaAs Photodiode with 100 MeV/n Carbon Ions with a total fluence of 1 × 1010 ions/cm 2 . Pre- and Post- radiation results were also measured for: (1) Leakage Current Vs. Voltage for the Extended InGaAs Photodiodes; (2) Responsivity (Quantum Efficiency) in A/W for Photodiodes; and (3) Bandwidth of the Photodiodes. All devices were found to be fully functional at the normal operating conditions and at both dry ice and room temperature. The leakage current increased up to a factor of ~2X at lower bias of 100 mV at the highest fluence of 10 10 ions/cm 2 , but not significantly at higher bias of 2 V. Finally, we did not observe any post radiation annealing effect for leakage current at room temperature and 100 mV bias for any of the devices after several weeks of data logging.

2.4 micron wavelength↗
DOE OSTI2022

Perovskite solar cells can take the heat

Solar panels must endure extreme conditions during their service lifetime. There are few other products, let alone pristine semiconductor electronics, that are manufactured today and expected to withstand decades of abuse from full exposure to outdoor elements, including harsh ultraviolet sunlight, rain and hail, and daily and seasonal thermal cycles. Over the past decade, a new class of semiconductors, known as metal halide perovskites, has emerged, which constitutes the light-absorbing material in solar panels and has made incredible advancements, potentially taking photovoltaics in new directions. Perovskite materials have been touted as a potential game changer for solar energy production.

14 SOLAR ENERGY↗
DOE OSTI2021

Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The minimum positive co-degree of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $\mathcal{H}$, then $S$ is contained in at least $k$ hyperedges of $\mathcal{H}$. For $r\geq k$ fixed and $n$ sufficiently large, we determine the maximum possible size of an intersecting $r$-uniform $n$-vertex hypergraph with minimum positive co-degree $\delta_{r-1}^+(\mathcal{H}) \geq k$ and characterize the unique hypergraph attaining this maximum. This generalizes the Erd\Hos--Ko--Rado theorem which corresponds to the case $k=1$. Furthermore, our proof is based on the delta-system method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems

This paper studies the trade-off between the degree of decentralization and the performance of a distributed controller in a linear-quadratic control setting. We study a system of interconnected agents over a graph and a distributed controller, called k-distributed control, which lets the agents make control decisions based on the state information within distance k on the underlying graph. This controller can tune its degree of decentralization using the parameter k and thus allows a characterization of the relationship between decentralization and performance. We show that under mild assumptions, including stabilizability, detectability, and a subexponentially growing graph condition, the performance difference between k-distributed control and centralized optimal control becomes exponentially small in k. Finally, this result reveals that distributed control can achieve near-optimal performance with a moderate degree of decentralization, and thus it is an effective controller architecture for large-scale networked systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2024

Comparing matching prescriptions between pre-equilibrium and hydrodynamic models in high-energy nuclear collisions

Abstract State-of-the-art simulations of high-energy nuclear collisions rely on hybrid setups, involving in particular a pre-equilibrium stage to let the system evolve from a far-from-equilibrium initial condition towards a near-equilibrated state after which fluid dynamics can be applied meaningfully. A known issue is the mismatch between the equation of state in the fluid-dynamical evolution and the effective one in the previous stage, which leads to discontinuities at the interface between the two models. Here we introduce a new matching prescription at this interface, based on the entropy, and we compare it with the standard one relying on local energy conservation. We study the behavior of various quantities at the switching time between the models and investigate a number of final-state hadronic observables. For the latter, we show that they are not modified significantly by the choice of matching prescription, provided an appropriate normalization is chosen for the initial state. In turn, our approach reduces sizeably the ratio of bulk over thermodynamic pressure at the beginning of the fluid-dynamical stage.

Borghini, Nicolas (ORCID:0000000239063258)↗
DOE OSTI2021

Improved semiclassical model for real-time evaporation of matrix black holes

In this paper, we study real-time classical matrix mechanics of a simplified 2 × 2 matrix model inspired by the black hole evaporation problem. This is a step towards making a quantitative model of real-time evaporation of a black hole, which is realized as a bound state of D0-branes in string theory. The model we study is the reduction of Yang–Mills in 2 + 1 dimension to 0 + 1 dimensions, which has been corrected with an additional potential that can be interpreted as a zero-point energy for fermions. Our goal is to understand the lifetime of such a classical bound state object in the classical regime. To do so, we pay particular attention to when D-particles separate to check that the “off-diagonal modes” of the matrices become adiabatic and use that information to improve on existing models of evaporation. It turns out that the naive expectation value of the lifetime with the fermionic correction is infinite. This is a logarithmic divergence that arises from very large excursions in the separation between the branes near the threshold for classical evaporation. The adiabatic behavior lets us get some analytic control of the dynamics in this regime to get this estimate. This divergence is cutoff in the quantum theory due to quantization of the adiabatic parameter, resulting in a long lifetime of the bound state, with a parametric dependence of order log(1/ℏ).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Advancing Comprehension of Quantum Application Outputs: A Visualization Technique

Noise in quantum computers presents a challenge for the users of quantum computing despite the rapid progress we have seen in the past few years in building quantum computers. Existing works have addressed the noise in quantum computers using a variety of mitigation techniques since error correction requires a large number of qubits which is infeasible at present. One of the consequences of quantum computing noise is that users are unable to reproduce similar output from the same quantum computer at different times, let alone from various quantum computers. In this work, we have made initial attempts to visualize quantum basis states for all the circuits that were used in quantum machine learning from various quantum computers and noise-free quantum simulators. We have opened up a pathway for further research into this field where we will be able to isolate noisy states from non-noisy states leading to efficient error mitigation. This is where our work provides an important step in the direction of efficient error mitigation. Our work also provides a ground for quantum noise visualization in the case of large numbers of qubits.

Senapati, Priyabrata↗
DOE OSTI2024

FiberFlex: Real-time FPGA-based Intelligent and Distributed Fiber Sensor System for Pedestrian Recognition

In recent years, security monitoring of public places and critical infrastructure has heavily relied on the widespread use of cameras, raising concerns about personal privacy violations. To balance the need for effective security monitoring with the protection of personal privacy, we explore the potential of optical fiber sensors for this application. This article proposes FiberFlex, an intelligent and distributed fiber sensor system. Ultizing Field Programmable Gate Arrays (FPGA) high-level synthesis (HLS) acceleration, FiberFlex offers real-time pedestrian detection by co-designing the entire pipeline of optical signal acquisition, processing, and recognition networks based on the principles of optical fiber sensing. As a promising alternative to traditional camera-based monitoring systems, FiberFlex achieves pedestrian detection by analyzing the vibration patterns caused by pedestrian footsteps, enabling security monitoring while preserving individual privacy. FiberFlex comprises three modules: First , fiber-optic sensing system: A fiber-optic distributed acoustic sensing (DAS) system is built and used to measure the ground vibration waves generated by people walking. Second , algorithms: We first collect the training data by measuring the ground vibration waves, label the data, and use the data to train the neural network models to perform pedestrian recognition. Third , hardware accelerators: We use HLS tools to design hardware modules on FPGA for data collection and pre-processing and integrate them with the downstream neural network accelerators to perform in-line real-time pedestrian detection. The final detection results are sent back from FPGA to the host CPU. We implement our system FiberFlex with the in-house built DAS system and AMD/Xilinx Kintex7 FPGA KC705 board and verify the whole system using the real-world collected data. We conduct recognition tests on five test subjects of varying ages, heights, and weights in a fixed sensing area. Each subject experienced 20 real-time recognition tests using their daily walking habits, and the subjects were given adequate rest between tests. After 100 tests on five test subjects, the overall real-time recognition accuracy exceeded \(88.0\%\) . The whole system uses 55 W of power, 33 W in the optical DAS system and 22 W in the FPGA. Relying on its end-to-end interdisciplinary design, FiberFlex seamlessly combines fiber-optic sensors with FPGA accelerators to enable low-power real-time security monitoring without compromising privacy, making it a valuable addition to the existing security monitoring network. According to FiberFlex, more valuable research can be conducted in the future, such as fall monitoring for the elderly, migration of identification networks between different application scenarios, and improvement of anti-interference performance in more complex environments. In future perception networks, where the “eyes” are not feasible, let’s use fiber optic touch instead.

Distributed↗
DOE OSTI2020

Galen View

This is software lets one explore the data released as part of the COVID-19 Open Research Dataset Challenge. It downloads and analyzes the natural language text of the data set and then creates a 2D visualization that can be used to explore it. SAND2020-12185 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Bauer, Travis↗
DOE OSTI2020

Saloon

Saloon is a Vim plugin that simplifies Python code linter / fixer configuration and usage. Saloon's menu lets developers toggle which static analysis tools to use and delegates those changes to ALE's (Asynchronous Lint Engine) API. Since prospector (python linter aggregate) already handles multiple tools, and is integrated with ALE, most of the actual linting will initially be handled via prospector calls.

Bloss, DavidK.↗
DOE OSTI2020

sbang

sbang lets users run scripts with very long shebang (#!) lines. Many operating systems limit the length and number of possible arguments in shebang lines, making it hard to use interpreters that are deep in the directory hierarchy or require special arguments. To use it, a user puts the long shebang on the second line of their script, and makes sbang the interpreter, like this: #!/bin/sh /path/to/sbang #!/long/path/to/real/interpreter with arguments. sbang will run the real interpreter with the script as its argument.

Gamblin, Todd↗
DOE OSTI2022

CMEC Module Manager

The CMEC module manager package is designed install and update CMEC modules (https://cmec.llnl.gov/). CMEC modules are independent climate model analysis packages. Individual scripts are provided in the module manager that outline the installation process for each module in a robust way, and a wrapper python script is provided that lets users install a chosen CMEC package with a single command.

Ordonez, AnaC↗
DOE OSTI2020

PAM module for OAuth 2.0 Device flow

This is a PAM module that lets you log in via SSH to servers using OpenID Connect credentials, instead of SSH Keys or a username and password combination. It uses the OAuth2 Device Flow, which means that during the login process, you will click a link and log in to your OpenID Connect Provider, which will then authenticate you for the SSH session. This module will then check if you're in the right group(s) or have a specified username, and allow or deny access.

Surkont, Jarosław↗
DOE OSTI2025

CoVVVR: Control Variates & Vegas Variance Reduction

This package is a wrapper over the vegas integration package. The control variate variance reduction method is applied to the function when integrated along with the techniques applied in vegas such as importance sampling. To understand control variates, lets first look at how Monte Carlo works.

Scott, JacobL. [Univ. of Kansas, Lawrence, KS (Uni↗
DOE OSTI2022

Grafana Plugin: Chord Diagram (esnet-chord-diagram) v1

The Esnet chord diagram is a plugin to the open source Grafana platform which lets users create chord diagrams based on data queried from configured data sources. Its designed as a general purpose chord visualization, which we often use internally to show quantitative relationships between network customers. The software itself uses the d3.js library to generate visuals and its primary value is making it easy to use these within Grafana. Graphing library Here: https://github.com/d3/d3-chord ISC License Grafana https://github.com/grafana/grafana AGPL3.0

Balas, Edward↗