Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Feature Extraction”

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

Nuclear recoil detection with color centers in bulk lithium fluoride

We present initial results on the detection of nuclear recoils in lithium fluoride (LiF) through the fluorescence of color centers created by particle interactions in the crystal lattice. Using light-sheet fluorescence microscopy, we image nuclear recoil tracks from both fast and thermal neutron interactions deep within a cubic-centimeter-scale sample. Automated three-dimensional feature extraction based on machine-learning tools enables the identification and classification of individual events. We observe that the fluorescence response of LiF to gamma irradiation is strongly suppressed, by a factor of 30–50 compared to neutron exposure, demonstrating intrinsic insensitivity to electromagnetic backgrounds. The observed and simulated event characteristics are consistent, including their number, size, and topology. These results establish the feasibility of LiF as a scalable detection medium for rare nuclear-recoil events and constitute a first step toward 10–1000 g scale detectors with single-event sensitivity for applications in reactor-neutrino detection, neutron spectroscopy, and dark matter searches.

Aroujo, G R [University of Zurich]↗
DOE OSTI2015

Autotuning algorithmic choice for input sensitivity

A daunting challenge faced by program performance autotuning is input sensitivity, where the best autotuned configuration may vary with different input sets. This paper presents a novel two-level input learning algorithm to tackle the challenge for an important class of autotuning problems, algorithmic autotuning. Here, the new approach uses a two-level input clustering method to automatically refine input grouping, feature selection, and classifier construction. Its design solves a series of open issues that are particularly essential to algorithmic autotuning, including the enormous optimization space, complex influence by deep input features, high cost in feature extraction, and variable accuracy of algorithmic choices. Experimental results show that the new solution yields up to a 3x speedup over using a single configuration for all inputs, and a 34x speedup over a traditional one-level method for addressing input sensitivity in program optimizations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

In Situ Summarization with VTK-m

Summarization and compression at current and future scales requires a framework for developing and benchmarking algorithms. We present a framework created by integrating existing, production-ready projects and provide timings of two particular algorithms that serve as exemplars for summarization: a wavelet-based data reduction filter and a generator for creating image-like databases of extracted features (isocontours in this case). Both support browser-based, post-hoc, interactive visualization of the summary for decision-making. A study of their weak-scaling on a distributed multi-GPU system is included in this article.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A sequential DNN based Baseline Energy Prediction Framework with Long term Error Mitigation

In this paper,we aim to present a novel sequential framework containing two deep network architectures for baseline energy prediction, applied to a simulated commercial building dataset. We have observed that this sequential framework helps to improve long term prediction accuracy, there by mitigating prediction error accumulation over time. The proposed framework utilizes convolution layers to extract features from the input data space without changing spatial relations between variables. These features are memorized by tensor train based gated recurrent units for an accurate long-term prediction. Although, architecture comprising the amalgamation of convolution layers and memory cell have shown promising results in domains such as social media analysis, language modeling, video frame prediction and image recognition, this paper extends its scope to the context of energy applications. Furthermore, the addition of tensor train based gated recurrent units is motivated by the necessity of computational time reduction during the training process, there by making this framework more suitable for future in-field deployment. Lastly, results show the current framework outperforms other existing machine learning based methods, in both short-term and long-term prediction categories.

Chakraborty, Indrasis↗
DOE OSTI2025

Whole Energy Homes

This repository contains analysis workflows, associated python packages, and documentation of the Whole Energy Homes study. A reproducible Snakemake workflow for data processing, feature extraction, and modeling using the weh python package. Built with Copier from the able-workflow-copier template.

Pathak, Maharshi [Northeastern Univ., Boston, MA (↗
DOE OSTI2025

ABLE Workflow Copier

A copier template for generating a snakemake workflow with an associated python package for implementing dataset transformation, feature extraction, and modeling.

Pathak, Maharshi [Northeastern Univ., Boston, MA (↗
DOE OSTI2023

Oxide

Oxide is a modular framework for feature extraction and analysis of executable files. Oxide is useful in a variety of reverse engineering and categorization tasks relating to executable content.

Burton, David↗
DOE OSTI2015

qFeature

This package contains statistical routines for extracting features from multivariate time-series data which can then be used for subsequent multivariate statistical analysis to identify patterns and anomalous behavior. It calculates local linear or quadratic regression model fits to moving windows for each series and then summarizes the model coefficients across user-defined time intervals for each series. These methods are domain agnostic-but they have been successfully applied to a variety of domains, including commercial aviation and electric power grid data.

Source record↗
DOE OSTI2016

shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications

This code is a toy (short) version of CODE-2016-83. From a general perspective, the code represents an unsupervised adaptive machine learning algorithm that allows efficient and high performance de-mixing and feature extraction of a multitude of non-negative signals mixed and recorded by a network of uncorrelated sensor arrays. The code identifies the number of the mixed original signals and their locations. Further, the code also allows deciphering of signals that have been delayed in regards to the mixing process in each sensor. This code is high customizable and it can be efficiently used for a fast macro-analyses of data. The code is applicable to a plethora of distinct problems: chemical decomposition, pressure transient decomposition, unknown sources/signal allocation, EM signal decomposition. An additional procedure for allocation of the unknown sources is incorporated in the code.

Alexandrov, BoianS.↗
DOE OSTI2017

Build and Execute Environment

At exascale, the challenge becomes to develop applications that run at scale and use exascale platforms reliably, efficiently, and flexibly. Workflows become much more complex because they must seamlessly integrate simulation and data analytics. They must include down-sampling, post-processing, feature extraction, and visualization. Power and data transfer limitations require these analysis tasks to be run in-situ or in-transit. We expect successful workflows will comprise multiple linked simulations along with tens of analysis routines. Users will have limited development time at scale and, therefore, must have rich tools to develop, debug, test, and deploy applications. At this scale, successful workflows will compose linked computations from an assortment of reliable, well-defined computation elements, ones that can come and go as required, based on the needs of the workflow over time. We propose a novel framework that utilizes both virtual machines (VMs) and software containers to create a workflow system that establishes a uniform build and execution environment (BEE) beyond the capabilities of current systems. In this environment, applications will run reliably and repeatably across heterogeneous hardware and software. Containers, both commercial (Docker and Rocket) and open-source (LXC and LXD), define a runtime that isolates all software dependencies from the machine operating system. Workflows may contain multiple containers that run different operating systems, different software, and even different versions of the same software. We will run containers in open-source virtual machines (KVM) and emulators (QEMU) so that workflows run on any machine entirely in user-space. On this platform of containers and virtual machines, we will deliver workflow software that provides services, including repeatable execution, provenance, checkpointing, and future proofing. We will capture provenance about how containers were launched and how they interact to annotate workflows for repeatable and partial re-execution. We will coordinate the physical snapshots of virtual machines with parallel programming constructs, such as barriers, to automate checkpoint and restart. We will also integrate with HPC-specific container runtimes to gain access to accelerators and other specialized hardware to preserve native performance. Containers will link development to continuous integration. When application developers check code in, it will automatically be tested on a suite of different software and hardware architectures.

Guan, Qiang↗
DOE OSTI2019

Atom Modeling PipeLine

This repository contains code for the computational framework to build ML models for drug discovery purposes. Our end-to-end pipeline extracts features from model-ready datasets and trains and saves the model to our model zoo or to disk. Our pipeline generates a variety of molecular features and both shallow and deep ML models. The HPC-specific module we have developed conducts efficient parallelized search of the model hyperparameter space and reports the best-performing hyperparameters for each of these feature/model combinations.

Minnich, AmandaJean↗
DOE OSTI2017

ShiftNMFk 1.2

The ShiftNMFk1.2 code, or as we call it, GreenNMFk, represents a hybrid algorithm combining unsupervised adaptive machine learning and Green's function inverse method. GreenNMFk allows an efficient and high performance de-mixing and feature extraction of a multitude of nonnegative signals that change their shape propagating through the medium. The signals are mixed and recorded by a network of uncorrelated sensors. The code couples Non-negative Matrix Factorization (NMF) and inverse-analysis Green's functions method. GreenNMF synergistically performs decomposition of the recorded mixtures, finds the number of the unknown sources and uses the Green's function of the governing partial differential equation to identify the unknown sources and their charecteristics. GreenNMF can be applied directly to any problem controlled by a known partial-differential parabolic equation where mixtures of an unknown number of sources are measured at multiple locations. Full GreenNMFk method is a subject LANL U.S. Patent application S133364.000 August, 2017. The ShiftNMFk 1.2 version here is a toy version of this method that can work with a limited number of unknown sources (4 or less).

Alexandrov, BoianS.↗
DOE OSTI2018

DataXray

Lab experiments involving digital signal processing tend to capture heterogeneous data that is binned into individual files. The structure of the whole experiment tends to get lost in this process, generating a "mess" of data that is difficult to summarize, and even more difficult to analyze in a consistent way. DataXray is a set of python routines that wraps publicly available open-source codes to create a consistent workflow for data and experiments, involving imaging, spectral and hyperspectral data. Routines are provided for data translation, slicing, visualization, multivariate statistics, integral transforms, feature extraction and reporting in the form of publication-grade figures.

Maksymovych, Petro↗
DOE OSTI2016

Continous Representation Learning via User Feedback

Representation learning is a deep-learning based technique for extracting features from data for the purpose of machine learning. This requires a large amount of data, on order tens of thousands to millions of samples, to properly teach the deep neural network. This a system for continuous representation learning, where the system may be improved with a small number of additional samples (order 10-100). The unique characteristics of this invention include a human-computer feedback component, where assess the quality of the current representation and then provides a better representation to the system. The system then mixes the new data with old training examples to avoid overfitting and improve overall performance of the system. The model can be exported and shared with other users, and it may be applied to additional images the system hasn't seen before.

Source record↗
DOE OSTI2025

Computational epidemiological tools for pandemic analysis, understanding, and response

This suite of software tools is being developed to enhance and analyze computational epidemiological models that incorporate realistic disease dynamics and human behavior, with the goal of supporting epidemic and pandemic response. Specifically, the tools enable data analysis, feature extraction, data synthesis, machine learning model development, and prediction of key public health outcomes, such as cases, hospitalizations, deaths, and behavioral responses, for airborne infectious diseases like COVID-19 and influenza.

Butts, David↗
DOE OSTI2016

flowVS: channel-specific variance stabilization in flow cytometry

Abstract Background Comparing phenotypes of heterogeneous cell populations from multiple biological conditions is at the heart of scientific discovery based on flow cytometry (FC). When the biological signal is measured by the average expression of a biomarker, standard statistical methods require that variance be approximately stabilized in populations to be compared. Since the mean and variance of a cell population are often correlated in fluorescence-based FC measurements, a preprocessing step is needed to stabilize the within-population variances. Results We present a variance-stabilization algorithm, called flowVS, that removes the mean-variance correlations from cell populations identified in each fluorescence channel. flowVS transforms each channel from all samples of a data set by the inverse hyperbolic sine (asinh) transformation. For each channel, the parameters of the transformation are optimally selected by Bartlett’s likelihood-ratio test so that the populations attain homogeneous variances. The optimum parameters are then used to transform the corresponding channels in every sample. flowVS is therefore an explicit variance-stabilization method that stabilizes within-population variances in each channel by evaluating the homoskedasticity of clusters with a likelihood-ratio test. With two publicly available datasets, we show that flowVS removes the mean-variance dependence from raw FC data and makes the within-population variance relatively homogeneous. We demonstrate that alternative transformation techniques such as flowTrans, flowScape, logicle, and FCSTrans might not stabilize variance. Besides flow cytometry, flowVS can also be applied to stabilize variance in microarray data. With a publicly available data set we demonstrate that flowVS performs as well as the VSN software, a state-of-the-art approach developed for microarrays. Conclusions The homogeneity of variance in cell populations across FC samples is desirable when extracting features uniformly and comparing cell populations with different levels of marker expressions. The newly developed flowVS algorithm solves the variance-stabilization problem in FC and microarrays by optimally transforming data with the help of Bartlett’s likelihood-ratio test. On two publicly available FC datasets, flowVS stabilizes within-population variances more evenly than the available transformation and normalization techniques. flowVS-based variance stabilization can help in performing comparison and alignment of phenotypically identical cell populations across different samples. flowVS and the datasets used in this paper are publicly available in Bioconductor.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

CASTELO: clustered atom subtypes aided lead optimization—a combined machine learning and molecular modeling method

Background: Drug discovery is a multi-stage process that comprises two costly major steps: pre-clinical research and clinical trials. Among its stages, lead optimization easily consumes more than half of the pre-clinical budget. We propose a combined machine learning and molecular modeling approach that partially automates lead optimization workflow in silico, providing suggestions for modification hot spots. Results: The initial data collection is achieved with physics-based molecular dynamics simulation. Contact matrices are calculated as the preliminary features extracted from the simulations. To take advantage of the temporal information from the simulations, we enhanced contact matrices data with temporal dynamism representation, which are then modeled with unsupervised convolutional variational autoencoder (CVAE). Finally, conventional and CVAE-based clustering methods are compared with metrics to rank the submolecular structures and propose potential candidates for lead optimization. Conclusion: With no need for extensive structure-activity data, our method provides new hints for drug modification hotspots which can be used to improve drug potency and reduce the lead optimization time. It can potentially become a valuable tool for medicinal chemists.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Progressive transfer learning for low-frequency data prediction in full waveform inversion

To effectively overcome the cycle-skipping issue in full waveform inversion (FWI), we developed a deep neural network (DNN) approach to predict the absent low-frequency components by exploiting the hidden physical relation connecting the low- and the high-frequency data. To efficiently solve this challenging nonlinear regression problem, two novel strategies were proposed to design the DNN architecture and to optimize the learning process: (1) dual data feed structure; (2) progressive transfer learning. With the dual data feed structure, not only the high-frequency data, but also the corresponding beat tone data are fed into the DNN to relieve the burden of feature extraction. The second strategy, progressive transfer learning, enables us to train the DNN using a single evolving training dataset. Within the framework of the progressive transfer learning, the training dataset continuously evolves in an iterative manner by gradually retrieving the subsurface information through the physics-based inversion module, progressively enhancing the prediction accuracy of the DNN and propelling the inversion process out of the local minima. Here, the synthetic numerical experiments suggest that, without any a priori geological information, the low-frequency data predicted by the progressive transfer learning are sufficiently accurate for an FWI engine to produce reliable subsurface velocity models free of cycle-skipping artifacts.

02 PETROLEUM↗