Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Label Space”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

A Semi-Supervised Learning Method for the Identification of Bad Exposures in Large Imaging Surveys

As the data volume of astronomical imaging surveys rapidly increases, traditional methods for image anomaly detection, such as visual inspection by human experts, are becoming impractical. We introduce a machine-learning-based approach to detect poor-quality exposures in large imaging surveys, with a focus on the DECam Legacy Survey (DECaLS) in regions of low extinction (i.e., E ( B − V ) < 0.04 ). Our semi-supervised pipeline integrates a vision transformer (ViT), trained via self-supervised learning (SSL), with a k-Nearest Neighbor (kNN) classifier. We train and validate our pipeline using a small set of labeled exposures observed by surveys with the Dark Energy Camera (DECam). A clustering-space analysis of where our pipeline places images labeled in good and bad categories suggests that our approach can efficiently and accurately determine the quality of exposures. Applied to new imaging being reduced for DECaLS Data Release 11, our pipeline identifies 780 problematic exposures, which we subsequently verify through visual inspection. Being highly efficient and adaptable, our method offers a scalable solution for quality control in other large imaging surveys.

Luo, Yufeng (ORCID:0000000246230683)↗
NASA NTRSDate not supplied

Multi-Class Anomaly Detection in Flight Data using Semi-Supervised Explainable Deep Learning Model

Identifying precursor for safety incidents in aviation data is a crucial task, yet extremely challenging. The main approach, in practice, leverages domain expertise to define expected tolerances in system’s behavior and alarm exceedance from such safety margins. However, this approach is incapable of identifying unknown risk and vulnerabilities. Machine learning has been long studied and deployed to identify precursors for such anomalies, with the great challenge of the need for sufficient labelled set of data to achieve a reliable and accurate performance. In this article, we develop an explainable deep semi-supervised model for anomaly detection in aviation, building upon recent advancements in the machine learning literature. The proposed model combines feature engineering and classification in the feature space, while leveraging all available data (labelled and unlabeled). Validating on two case studies of anomaly detection in take-off and landing phases of commercial aircraft, we show that our model is able to outperform state-of-the-art supervised anomaly detection model and reach significantly high accuracy and low false alarm with minimum amount of available labelled data.

Anomaly Detection↗
NASA NTRS2005

Adaptable Constrained Genetic Programming: Extensions and Applications

An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.

Janikow, Cezary Z.↗
DOE OSTI2024

Comparative Assessment of U-Net-Based Deep Learning Models for Segmenting Microfractures and Pore Spaces in Digital Rocks

Segmentation of high-resolution X-ray microcomputed tomography (µCT) images is crucial in digital rock physics (DRP), affecting the characterization and analysis of microscale phenomena in the porous media. The complexity of geological structures and nonideal scanning conditions pose significant challenges to conventional image segmentation approaches. Motivated by the recent increasing popularity of deep learning (DL) techniques in image processing, this work undertakes a comparative study of DL models, specifically U-Net and its variants, for segmenting multiple targets with distinguished features in digital rocks, including discrete fracture networks (DFNs), pore spaces, and solid rock. Particularly, DFNs have a smaller volumetric fraction over others, bringing in a substantial challenge of imbalanced segmentation. The primary focus is to evaluate the architecture and feature enhancement strategies of various DL models, including U-Net, attention U-Net, residual U-Net, U-Net++, and residual U-Net++. The models were designed as 2.5D, utilizing a central 2D image and its two adjacent upper and lower 2D images as input to provide a pseudo-3D context. In addition, because the ground truth of segmentation was unknown for real-world digital rocks, we created a benchmark data set following the inverse operations of segmentation. The data synthesis started from the label images (i.e., solid rock, pore spaces, and DFNs), followed by simulating partial volume blurring, adding random background noise, and introducing ring artifacts to mimic real raw X-ray µCT images. The data set, which included various rock types (i.e., sandstone and artificial data), scanning resolution, and magnitudes of noise and artifacts, was divided into training and testing data sets with a 90% and 10% ratio, respectively. Moreover, in addition to the conventional pixel-wise evaluation metrics, the physics-based metric of the lattice-Boltzmann method (LBM) simulated permeability provided more comprehensive assessments. The results demonstrated that the residual connections, nested architectures, and redesigned skip connections contribute to the model performance and give the residual U-Net++ the highest accuracy. The improvements were mainly on the boundaries and small targets, especially the DFNs, which dominate the interconnectivity and therefore affect the permeability greatly. This study also rigorously evaluated the efficiency and generalization of each model, demonstrating that the sophisticated architectures achieved excellent practicability and maintained robust performance on completely unseen data, ensuring their suitability for diverse and challenging DRP applications.

58 GEOSCIENCES↗
DOE OSTI2025

Labels as a feature: Network homophily for systematically annotating human GPCR drug-target interactions

Machine learning has revolutionized drug discovery by enabling the exploration of vast, uncharted chemical spaces essential for discovering novel patentable drugs. Despite the critical role of human G protein-coupled receptors in FDA-approved drugs, exhaustive in-distribution drug-target interaction testing across all pairs of human G protein-coupled receptors and known drugs is rare due to significant economic and technical challenges. This often leaves off-target effects unexplored, which poses a considerable risk to drug safety. In contrast to the traditional focus on out-of-distribution exploration (drug discovery), we introduce a neighborhood-to-prediction model termed Chemical Space Neural Networks that leverages network homophily and training-free graph neural networks with labels as features. We show that Chemical Space Neural Networks’ ability to make accurate predictions strongly correlates with network homophily. Thus, labels as features strongly increase a machine learning model’s capacity to enhance in-distribution prediction accuracy, which we show by integrating labeled data during inference. We validate these advancements in a high-throughput yeast biosensing system (3773 drug-target interactions, 539 compounds, 7 human G protein-coupled receptors) to discover novel drug-target interactions for FDA-approved drugs and to expand the general understanding of how to build reliable predictors to guide experimental verification.

Hansson, Frederik G↗
NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗
NASA NTRS2014

Radiation Effects of Commercial Resistive Random Access Memories

We present results for the single-event effect response of commercial production-level resistive random access memories. We found that the resistive memory arrays are immune to heavy ion-induced upsets. However, the devices were susceptible to single-event functional interrupts, due to upsets from the control circuits. The intrinsic radiation tolerant nature of resistive memory makes the technology an attractive consideration for future space applications.

Random Access Memory (RAM)↗
NASA NTRS2017

The Great Proton Search Continues

This presentation is an outbrief of the current team status for access to domestic high (200 MeV) energy proton facilities. In addition, future considerations will be discussed.

Space Environment↗
NASA NTRS2020

Analysis of the Accuracy of Actuation Electronics in the Laser Interferometer Space Antenna Pathfinder

The Laser Interferometer Space Antenna Pathfinder (LPF) main observable, labelled∆g, is the differential force per unit mass acting on the two test masses in free fall condition, after the contribution of all non-gravitational forces have been compensated. At low frequencies the differential force is compensated by an applied electrostatic actuation force,which then must be subtracted from the measured acceleration to obtain∆g. Any inaccuracy in the actuation force contaminates the residual acceleration. This study investigates the accuracy of the electrostatic actuation system and its impact on the LPF main observable. It is shown that the inaccuracy is mainly caused by the rounding errors in the waveform processing and also by the random error caused by the analog to digital converter (ADC) random noise in the control loop. Both errors are one order of magnitude smaller than the resolution of the commanded voltages. We developed a simulator based on the LPF design to compute the close-to-reality actuation voltages and consequently, the resulting actuation forces. The simulator is applied in post-processing the LPF data.

M. Armano↗
NASA NTRS1991

Spacelab life sciences 1 - Reprints of background life sciences publications

Results from investigations conducted in preparation for the first Spacelab life-sciences mission are summarized in selected previously published papers. Topics discussed are the role of calcium in osteoporosis, orthostaic hypotension, cardiovascular adjustments to gravitational stress, cell biology, exposure to stressful environments, heart-lung interactions in aerospace medicine, effects of weightlessness on human fluid and electrolyte physiology, macular bioaccelerometers on earth and in space, and metabolism of nonessential N-15-labeled amino acids and the measurement of human whole-body protein synthesis rates.

White, Ronald↗
NASA NTRSDate not supplied

Unsupervised Change Detection for Space Habitats Using 3D Point Clouds

This work presents an algorithm for scene change detection from point clouds to enable autonomous robotic caretaking in future space habitats. Autonomous robotic systems will help maintain future deep-space habitats, such as the Gateway space station, which will be uncrewed for extended periods. Existing scene analysis software used on the International Space Station (ISS) relies on manually-labeled images for detecting changes. In contrast, the algorithm presented in this work uses raw, unlabeled point clouds as inputs. The algorithm first applies modified Expectation-Maximization Gaussian Mixture Model (GMM) clustering to two input point clouds. It then performs change detection by comparing the GMMs using the Earth Mover’s Distance. The algorithm is validated quantitatively and qualitatively using a test dataset collected by an Astrobee robot in the NASA Ames Granite Lab comprising single frame depth images taken directly by Astrobee and full-scene reconstructed maps built with RGB-D and pose data from Astrobee. The runtimes of the approach are also analyzed in depth. The source code is publicly released to promote further development.

robotics↗
DOE OSTI2025

Monomer-dimer tensor-network basis for qubit-regularized lattice gauge theories

Traditional SU⁡(𝑁) lattice gauge theories (LGTs) can be formulated using an orthonormal basis constructed from the irreducible representations (irreps) 𝑉 𝜆 of the SU⁡(𝑁) gauge symmetry. On a lattice, the elements of this basis are tensor networks comprising dimer tensors on the links labeled by a set of irreps {𝜆 ℓ } and monomer tensors on sites labeled by {𝜆 𝑠 }. These tensors naturally define a local site Hilbert space, ℋ$^𝑔_𝑠$, on which gauge transformations act. Gauss’s law introduces an additional index 𝛼 𝑠 =1,2,…,𝒟⁡(ℋ$^𝑔_𝑠$) that labels an orthonormal basis of the gauge-invariant subspace of ℋ$^𝑔_𝑠$. This monomer-dimer tensor-network (MDTN) basis, |{𝜆 𝑠 },{𝜆 ℓ },{𝛼 𝑠 }⟩, of the physical Hilbert space enables the construction of new qubit-regularized SU⁡(𝑁) gauge theories that are free of sign problems while preserving key features of traditional LGTs. Here, we investigate finite-temperature confinement-deconfinement transitions in a simple qubit-regularized SU(2) and SU(3) gauge theory in 𝑑 =2 and 𝑑 =3 spatial dimensions, formulated using the MDTN basis, and show that they reproduce the universal results of traditional LGTs at these transitions. Additionally, in 𝑑 =1, we demonstrate using a plaquette chain that the string tension at zero temperature can be continuously tuned to zero by adjusting a model parameter that plays the role of the gauge coupling in traditional LGTs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2017

Why NASA and the Space Electronics Community Cares About Cyclotrons

NASA and the space community are faced with the harsh reality of operating electronic systems in the space radiation environment. Systems need to work reliably (as expected for as long as expected) and be available during critical operations such as docking or firing a thruster. This talk will provide a snapshot of the import of ground-based research on the radiation performance of electronics. Discussion topics include: 1) The space radiation environment hazard, 2) Radiation effects on electronics, 3) Simulation of effects with cyclotrons (and other sources), 4) Risk prediction for space missions, and, 5) Real-life examples of both ground-based testing and space-based anomalies and electronics performance. The talk will conclude with a discussion of the current state of radiation facilities in North America for ground-based electronics testing.

Risk prediction↗
NASA NTRS2019

Spacecraft Adhesive Residue On-Composite Analysis

Tapes are used on space vehicles for numerous reasons. They are used for taping close ports, labeling, and even temporarily attaching something to the spacecraft. This project stemmed from the need to determine which tapes are most effective for our customer's space vehicle during its ground processing stage. During ground processing, there are multiple stages of building where workers need to use tape to temporarily stabilize or close something for a matter of seconds, days, weeks, or even a few months. After peeling these tapes off the flight hardware, the residue left behind by the tape poses potential risks that can lead to incidents, which may not be easily noticeable to the engineers. It is important to identify these issues since nothing can be done once it is in space. The purpose of this project is to assist in research to create an accessible reference for which tapes are preferred on common flight hardware surfaces. Five different substrates and eight tapes were selected for evaluation. The selected substrates were chosen because they comprise the most surface area on the vehicle. The tapes selected were either heritage or new contenders. The adhesive studies were performed for multiple dwell times to study the tendency of different tapes to leave residue behind on various substrates and quantifying that residue. Many other tests were performed to supplement the main objective of the project. These tests included adhesive solubility, peel adhesion, and SEM analyses.

McFadden, Saleah J.↗