Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distance Learning”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

The Deeper, Wider, Faster programme: exploring stellar flare activity with deep, fast cadenced DECam imaging via machine learning

ABSTRACT We present our 500 pc distance-limited study of stellar flares using the Dark Energy Camera as part of the Deeper, Wider, Faster programme. The data were collected via continuous 20-s cadence g-band imaging and we identify 19 914 sources with precise distances from Gaia DR2 within 12, ∼3 deg2, fields over a range of Galactic latitudes. An average of ∼74 min is spent on each field per visit. All light curves were accessed through a novel unsupervised machine learning techniques designed for anomaly detection. We identify 96 flare events occurring across 80 stars, the majority of which are M dwarfs. Integrated flare energies range from ∼1031–1037 erg, with a proportional relationship existing between increased flare energy with increased distance from the Galactic plane, representative of stellar age leading to declining yet more energetic flare events. In agreement with previous studies we observe an increase in flaring fraction from M0 to M6 spectral types. Furthermore, we find a decrease in the flaring fraction of stars as vertical distance from the galactic plane is increased, with a steep decline present around ∼100 pc. We find that $\sim 70{{\ \rm per\ cent}}$ of identified flares occur on short time-scales of <8 min. Finally, we present our associated flare rates, finding a volumetric rate of 2.9 ± 0.3 × 10−6 flares pc−3 h−1.

Webb, S.↗
DOE OSTI2022

Using kernel-based statistical distance to study the dynamics of charged particle beams in particle-based simulation codes

Measures of discrepancy between probability distributions (statistical distance) are widely used in the fields of artificial intelligence and machine learning. We describe how certain measures of statistical distance can be implemented as numerical diagnostics for simulations involving charged-particle beams. Related measures of statistical dependence are also described. The resulting diagnostics provide sensitive measures of dynamical processes important for beams in nonlinear or high-intensity systems, which are otherwise difficult to characterize. Here, the focus is on kernel-based methods such as maximum mean discrepancy, which have a well-developed mathematical foundation and reasonable computational complexity. Several benchmark problems and examples involving intense beams are discussed. While the focus is on charged-particle beams, these methods may also be applied to other many-body systems such as plasmas or gravitational systems.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Twisty-puzzle-inspired approach to Clifford synthesis

The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's cube twisty puzzle, here we develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity. This approach is probabilistic and computationally intensive. However, when a decomposition is successfully found, it often involves fewer gates than the decomposition methods used in the Qiskit decomposition protocol, which uses a combination of several well-known Clifford decomposition schemes. Additionally, our approach is much more flexible than existing algorithms in that arbitrary gate sets, device topologies, and gate fidelities may be incorporated, thus allowing for the approach to be tailored to a specific device.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Preparing Students to Work in Diverse Settings and Across Distance: Inter-University, Interdisciplinary Capstone Teams

NASA's Psyche Mission is engaged with a growing number of capstone teams pursuing topics relevant to the mission, including partnering with four universities to trial cross-university teaming. Creating interdisciplinary capstone teams with students from different universities provides an opportunity to prepare students to engage with a diversity of disciplines and collaborate in remote teams in the workplace. Additionally, through such capstones, universities may gain access to non-local, specialized technical mentors and to disciplines not offered at their institutions. An added benefit is providing greater fidelity to NASA space missions, which involve teams working together at a distance. We discuss early lessons learned from the first three inter-university, interdisciplinary capstone teams participating with the Psyche mission and discuss plans for improvement and future expansion.

Bowman, C. D. D.↗
NASA NTRSDate not supplied

Lunar Surface Position Determination using Perceived Signal Strength

The purpose of this project is to evaluate the feasibility of transmitters and receivers on the lunar surface for Position Determination (PD) without any form of lunar Global Positioning System (GPS). The early Artemis program may lack GPS satellites orbiting the Moon, and it is critical that activities with the lander, rover, and crew EVA identify their position on the lunar surface at all times. This project creates a prototype system that trilaterates user position based upon the perceived signal from at least 3 nearby transmission towers, called “Lunar Access Points”. The application of perceived signal strength for surface PD has historically been used in terrestrial systems such as Long Range Navigation (LORAN), which was popular with the maritime industry prior to the Global Positioning System (GPS). The ease of installing such a local system for early Artemis missions provides a critical resource until satellite-based position determination systems are deployed. A surface-based PD can also be used in GPS-denied environments such as deep craters or lava tubes where satellite visibility is compromised. By demonstrating the basic capability of surface PD, this student team has learned about issues with power, distance, thermal, dust, radiation, data processing, and communication problems applicable to the lunar surface. This knowledge can feed into future NASA requirements to improve the capability of a LunaNET implementation for the Artemis program. This project follows 10 years of successful collaboration between NASA JSC/ARES, Texas Space, Technology, Applications and Research (T STAR) and Texas A&M University in a Public, Private, Academic (PPA) Partnership. NASA funds T STAR to mentor undergraduate Capstone teams in the College of Engineering Department to design, built, and test prototypes meeting NASA requirements. TAMU faculty lead the student teams in their academic class, and NASA Subject Matter Experts (SMEs) provide T STAR and students insight on requirements evolution, prior design projects, and future development goals.

Position Determination↗
NASA NTRSDate not supplied

Using Mesh Networking for A Dynamic Lunar Internet of Things (Liot)

The purpose of this project is to evaluate the feasibility of an IEEE 802.11 mesh protocol for lunar surface computing. This standard for wireless networking boosts speed, dependability and range of wireless transmissions. The concept is to integrate sensors (such as deployed science instruments) or Astronaut tools (such as a handheld spectrometer) that communicate with a node on a common cell. The nodes can extend the range of the cell and can dynamically reconfigure the data routing in case of another node failure. All of the data in a cell pass through a modem that communicates with a distant base station across a 4G link. The application of mesh networking to a potential lunar surface network increases robustness and fault tolerance over a traditional single-point modem system. By demonstrating the basic capability of a mesh network, the student team has learned about issues with power, distance, thermal, dust, radiation, data processing, and communication problems applicable to the lunar surface. This knowledge can feed into future NASA requirements to improve the capability of a LunaNET implementation for the Artemis program. This project follows 10 years of successful collaboration between NASA ARES, Texas Space, Technology, Applications and Research (T STAR) and Texas A&M University in a Public, Private, Academic (PPA) Partnership. NASA funds T STAR to mentor undergraduate Capstone teams in the College of Engineering Department to design, built, and test prototypes meeting NASA requirements. TAMU faculty lead the student teams in their academic class, and NASA Subject Matter Experts (SMEs) provide T STAR and students insight on requirements evolution, prior design projects, and future development goals.

Lunar Mesh Networking↗
NASA NTRS2000

Any Two Learning Algorithms Are (Almost) Exactly Identical

This paper shows that if one is provided with a loss function, it can be used in a natural way to specify a distance measure quantifying the similarity of any two supervised learning algorithms, even non-parametric algorithms. Intuitively, this measure gives the fraction of targets and training sets for which the expected performance of the two algorithms differs significantly. Bounds on the value of this distance are calculated for the case of binary outputs and 0-1 loss, indicating that any two learning algorithms are almost exactly identical for such scenarios. As an example, for any two algorithms A and B, even for small input spaces and training sets, for less than 2e(-50) of all targets will the difference between A's and B's generalization performance of exceed 1%. In particular, this is true if B is bagging applied to A, or boosting applied to A. These bounds can be viewed alternatively as telling us, for example, that the simple English phrase 'I expect that algorithm A will generalize from the training set with an accuracy of at least 75% on the rest of the target' conveys 20,000 bytes of information concerning the target. The paper ends by discussing some of the subtleties of extending the distance measure to give a full (non-parametric) differential geometry of the manifold of learning algorithms.

Wolpert, David H.↗
DOE OSTI2018

Helping IT and OT Defenders Collaborate

Cyber-physical systems, especially in critical infrastructures, have become primary hacking targets in international conflicts and diplomacy. However, cyber-physical systems present unique challenges to defenders, starting with an inability to communicate. This paper outlines the results of our interviews with information technology (IT) defenders and operational technology (OT) operators and seeks to address lessons learned from them in the structure of our notional solutions. We pre-sent two problems in this paper: (1) the difficulty of coordinat-ing detection and response between defenders who work on the cyber/IT and physical/OT sides of cyber-physical infrastruc-tures, and (2) the difficulty of estimating the safety state of a cyber-physical system while an intrusion is underway but be-fore damage can be effected by the attacker. To meet these chal-lenges, we propose two solutions: (1) a visualization that will enable communication between IT defenders and OT operators, and (2) a machine-learning approach that will estimate the distance from normal the physical system is operating and send information to the visualization.

Cyber Physical Systems, internet of things, visual↗
DOE OSTI2023

ZeoNet: 3D convolutional neural networks for predicting adsorption in nanoporous zeolites

Zeolites are one of the most widely used materials in the chemical industry due to their nanometer-sized pores that can adsorb and react upon molecules selectively. With hundreds of known framework topologies and hundreds of thousands of computationally predicted structures, the ability to rapidly predict zeolite performance allows researchers to prioritize their efforts on the most promising structures for a given application. Although the accuracy of forcefield-based atomistic simulations has advanced significantly in the past two decades, these simulations can be computationally expensive, especially for long-chain, complex molecules. Here, we present ZeoNet, a representation learning framework using convolutional neural networks (ConvNets) and 3D volumetric representations for predicting adsorption in zeolites. ZeoNet was trained on the task of predicting Henry's constants for adsorption, k H , of n-octadecane in more than 330 000 known and predicted zeolite materials. Employing a 3D grid based on the distances to solvent-accessible surfaces, a volumetric representation that can be generated efficiently, the best-performing ZeoNet achieved a correlation coefficient r 2 = 0.977 and a mean-squared error MSE = 3.8 in ln k H , which corresponds to an error of 9.3 kJ mol -1 in adsorption free energy. In comparison, a model based on hand-designed geometric features has values of r 2 = 0.783 and MSE = 35.7. ZeoNet is also relatively efficient and can process ≈8 structures per second on an Nvidia RTX 2080TI GPU, orders of magnitude faster than forcefield-based simulations. A systematic analysis was conducted to investigate how the choice of ConvNet architectures, the linear dimension (L) and spatial resolution (Δd) of the distance grids, batch size, optimizer, and learning rate impact the model performance. We found that ConvNets based on the ResNet architecture offer the best tradeoff between expressiveness and efficiency. The performance for all models reaches a plateau at L = 30–45 Å and depends less sensitively on grid resolution, with a small benefit around Δd = 0.30–0.45 Å. Finally, saliency maps were visualized to identify which regions of the materials contributed the most to model predictions. It was found, interestingly, that the predictions are driven primarily by the accessible pore volume rather than the region occupied by the framework atoms.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A novel methodology for gamma-ray spectra dataset procurement over varying standoff distances and source activities

The adoption of machine learning approaches for gamma-ray spectroscopy has received considerable attention in the literature. Many studies have investigated the deployment of various algorithm architectures to a specific task. However, little attention has been afforded to the development of the datasets leveraged to train the models. Such training datasets typically span a set of environmental or detector parameters to encompass a problem space of interest to a user. Variations in these measurement parameters will also induce fluctuations in the detector response, including expected pile-up and ground scatter effects. Fundamental to this work is the understanding that 1) the underlying spectral shape varies as the measurement parameters change and 2) the statistical uncertainties associated with two spectra impact their level of similarity. While previous studies attribute some arbitrary discretization to the measurement parameters for the generation of their synthetic training data, this work introduces a principled methodology for efficient spectral-based discretization of a problem space. A signal-to-noise ratio (SNR) respective spectral comparison measure and a Gaussian Process Regression (GPR) model are used to predict the spectral similarity across a range of measurement parameters. This innovative approach effectively showcased its capability by dividing a problem space, ranging from 5 cm to 100 cm standoff distances and 5 μCi–100 μCi of 137 Cs, into three unique combinations of measurement parameters. The findings from this work will aid in creating more robust datasets, which incorporate many possible measurement scenarios, reduce the number of required experimental test set measurements, and possibly enable experimental training data collection for gamma-ray spectroscopy.

data science↗
DOE OSTI2025

Machine learning approach to trapped many-fermion systems

For this work, we apply a variational ansatz based on neural networks to the problem of spin-$^1_2$ fermions in a harmonic trap interacting through a short distance potential. We showed that standard machine learning techniques lead to a quick convergence to the ground state, especially in weakly coupled cases. Higher couplings can be handled efficiently by increasing the strength of interactions during “training”.

1-dimensional systems↗
DOE OSTI2024

Reinforcement Learning for Energy-Movement Optimization in Arduino-Based Robotics

Our goal is to develop a learning method for an Arduino-based robotthat maximizes travel distance and minimizes energy expenditure. • Will implement State ActionReward State Action (SARSA) reinforcement learning algorithm • Learning steps informed by state of environment • Rewards good decisions and punishes bad ones.

Gilmore, Blake↗
DOE OSTI2021

Potential structures - Applications of Machine Learning Techniques to Geothermal Play Fairway Analysis in the Great Basin Region, Nevada

This submission contains shapefiles, geotiffs, and symbology for the revised-from-Play-Fairway potential structures/structural settings used in the Nevada Geothermal Machine Learning project. Layers include potential structural setting ellipses, centroids, and distance-to-centroid raster. A submission linking the full GitHub repository for our machine learning Jupyter Notebooks will appear in the related datasets section of this page once available.

15 GEOTHERMAL ENERGY↗
NASA NTRSDate not supplied

Using Federated Learning to Overcome Data Gravity in Space

Humans intend to take longer missions to outer space. Understanding the impact that space has on human health is paramount to the success of these missions. Controlled experiments with model organisms are run to infer the impact of space conditions on human health, but the data these experiments generate are too large to transfer to Earth for building models. The same is true for space-relevant data generated on Earth. Ideally, these datasets should be combined to improve statistical power and model accuracy without having to transfer data. Federated learning is such a method which trains an algorithm across decentralized computing systems, each of which has their own local copy of training and testing data. In this research, made possible by NASA@Work, the AI for Life in Space group at NASA demonstrates the use of federated learning to train an ensemble of causality inference models on a combination of data residing on the International Space Station (ISS) and in the cloud. Our work leverages CRISP, a causal inference platform developed during the 2020 Frontier Development Lab’s “Astronaut Health Challenge.” We also leverage the OpenFL federated learning library which was collaboratively developed at Intel and UPenn. We used publicly available data from the NASA Ames Life Sciences Data Archive to identify features in ionizing radiation experiments as causal of changes in cardiac blood velocity. This research demonstrates, for the first time, the possibility of running machine learning algorithms on datasets separated by astronomical distances. In this experiment, all the data were generated in terra, half of which were transferred to the ISS and analyzed on the Spaceborne Computer. In the future, our research will leverage federated learning on data generated in situ on the ISS with data generated terrestrially to predict the impact of spaceflight on mammalian female reproductive capacity.

James Casaletto↗
DOE OSTI2021

Protection of Radial Circuits with High Penetration Distributed Photovoltaics

The paper addresses the shortcomings of distribution protection systems as distribution level photovoltaic installations as well as other inverter based distributed resources are added to the system. Several protection schemes have been evaluated, including distance-based, estimation-based and learning-based. The paper summarizes the results and provides recommendations.

distance protection, radial distribution feeders, ↗
DOE OSTI2026

Machine learning method for enforcing variable independence in background estimation with LHC data: ABCDisCoTEC

A novel solution is presented for the problem of estimating the backgrounds of a signal search using observed data while simultaneously maximizing the sensitivity of the search to the signal. The 'ABCD method' provides a reliable framework for background estimation by partitioning events into one signal-enhanced region (A) and three background-enhanced control regions (B, C, and D) via two smoothly varying, statistically independent variables. In practice, even slight correlations between the two variables can significantly undermine the method's performance. Thus, choosing appropriate variables by hand can present a formidable challenge, especially when background and signal differ only subtly. To address this issue, the ABCD with distance correlation (ABCDisCo) method was developed to construct two learned variables via a neural network trained to provide strong signal-background discrimination with small values of the distance correlation (DisCo) measure between the two learned variables. However, relying solely on minimizing the DisCo can result in learned variables that may not have distributions of background events that are smoothly varying and localized at extreme values, as necessary for the validity of the background estimation. The ABCDisCo training enhanced with closure (ABCDisCoTEC) method is introduced to solve this issue by directly minimizing the nonclosure, expressed as a dedicated differentiable loss term. This extended method is applied to a data set of proton-proton collisions at a center-of-mass energy of 13 TeV recorded by the CMS detector at the CERN Large Hadron Collider. Additionally, given the complexity of the minimization problem with constraints on multiple loss terms, the modified differential method of multipliers is applied and shown to greatly improve the stability and robustness of the ABCDisCoTEC method, compared to grid search hyperparameter optimization procedures.

Hayrapetyan, Aram [Yerevan Phys. Inst.]↗
DOE OSTI2022

Realistic galaxy image simulation via score-based generative models

ABSTRACT We show that a denoising diffusion probabilistic model (DDPM), a class of score-based generative model, can be used to produce realistic mock images that mimic observations of galaxies. Our method is tested with Dark Energy Spectroscopic Instrument (DESI) grz imaging of galaxies from the Photometry and Rotation curve OBservations from Extragalactic Surveys (PROBES) sample and galaxies selected from the Sloan Digital Sky Survey. Subjectively, the generated galaxies are highly realistic when compared with samples from the real data set. We quantify the similarity by borrowing from the deep generative learning literature, using the ‘Fréchet inception distance’ to test for subjective and morphological similarity. We also introduce the ‘synthetic galaxy distance’ metric to compare the emergent physical properties (such as total magnitude, colour, and half-light radius) of a ground truth parent and synthesized child data set. We argue that the DDPM approach produces sharper and more realistic images than other generative methods such as adversarial networks (with the downside of more costly inference), and could be used to produce large samples of synthetic observations tailored to a specific imaging survey. We demonstrate two potential uses of the DDPM: (1) accurate inpainting of occluded data, such as satellite trails, and (2) domain transfer, where new input images can be processed to mimic the properties of the DDPM training set. Here we ‘DESI-fy’ cartoon images as a proof of concept for domain transfer. Finally, we suggest potential applications for score-based approaches that could motivate further research on this topic within the astronomical community.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Uncertainty Quantification in CO2 Trapping Mechanisms: A Case Study of PUNQ-S3 Reservoir Model Using Representative Geological Realizations and Unsupervised Machine Learning

Evaluating uncertainty in CO2 injection projections often requires numerous high-resolution geological realizations (GRs) which, although effective, are computationally demanding. This study proposes the use of representative geological realizations (RGRs) as an efficient approach to capture the uncertainty range of the full set while reducing computational costs. A predetermined number of RGRs is selected using an integrated unsupervised machine learning (UML) framework, which includes Euclidean distance measurement, multidimensional scaling (MDS), and a deterministic K-means (DK-means) clustering algorithm. In the context of the intricate 3D aquifer CO2 storage model, PUNQ-S3, these algorithms are utilized. The UML methodology selects five RGRs from a pool of 25 possibilities (20% of the total), taking into account the reservoir quality index (RQI) as a static parameter of the reservoir. To determine the credibility of these RGRs, their simulation results are scrutinized through the application of the Kolmogorov–Smirnov (KS) test, which analyzes the distribution of the output. In this assessment, 40 CO2 injection wells cover the entire reservoir alongside the full set. The end-point simulation results indicate that the CO2 structural, residual, and solubility trapping within the RGRs and full set follow the same distribution. Simulating five RGRs alongside the full set of 25 GRs over 200 years, involving 10 years of CO2 injection, reveals consistently similar trapping distribution patterns, with an average value of Dmax of 0.21 remaining lower than Dcritical (0.66). Using this methodology, computational expenses related to scenario testing and development planning for CO2 storage reservoirs in the presence of geological uncertainties can be substantially reduced.

Mahjour, Seyed Kourosh↗