Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sequential”

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 1,279 records · Page 71
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

BEopt™ (Building Energy Optimization Tool) version 3.0.1 3/16/2023 [SWR-05-41]

The BEopt™ (Building Energy Optimization Tool) software provides capabilities to evaluate residential building designs and identify cost-optimal efficiency packages at various levels of whole-house energy savings along the path to zero net energy. The BEopt software can be used to analyze both new construction and existing home retrofits, as well as single-family detached and multi-family buildings, through evaluation of single building designs, parametric sweeps, and cost-based optimizations. The BEopt software provides detailed simulation-based analysis based on specific house characteristics, such as size, architecture, occupancy, vintage, location, and utility rates. Discrete envelope and equipment options, reflecting realistic construction materials and practices, are evaluated. The BEopt software uses EnergyPlus®, the Department of Energy's flagship simulation engine. Simulation assumptions are based on ANSI/RESNET/ICC Standards and the Building America Housing Simulation Protocols. The sequential search optimization technique used by the BEopt software: Finds minimum-cost building designs at different target energy-savings levels Identifies multiple near-optimal designs along the path, allowing for equivalent solutions based on builder or contractor preference. Download A BEopt™ Version 3.0.1 Beta release (Mar. 16, 2023) is now available. Download the BEopt 3.0.1 Beta setup file.

Christensen, Craig↗
DOE OSTI2021

Blockchain smart contracts for energy markets

A successful architecture that depicts the relationship between the energy market engineering requirements and blockchain requirements (shown as enablers). Software includes sequential and relational architectures supported by the UML flow diagrams. For a successful blockchain agnostic implementation of energy markets, the proposed architecture/blueprint supported by prototype implementation is very efficient. The proposed invention also depicts various means of the use of blockchain technology for energy market systems.

Gourisetti, Sri Nikhil Gupta↗
DOE OSTI2024

Automobile and Technology Lifecycle-Based Assignment (ATLAS) v2.0.12

ATLAS is a comprehensive vehicle transaction and technology adoption microsimulator. ATLAS evolves the fleet mix of individual households by simulating the transaction (vehicle addition, disposal, and replacement) and choice (vehicle type, vintage, powertrain, and tenure) decisions in response to the co-evolving demographics, land use, and vehicle technology simulations. Different from the existing vehicle models that are either static or aggregated (e.g. stock model), ATLAS is fully disaggregated and dynamic following a sequential and circumstantial decision-making trajectory. This fine-grained approach not only enhances the realism of the simulation but also provides a nuanced understanding of the dynamics inherent in vehicle fleet evolution. ATLAS outputs are fully compatible with subsequent agent-based transportation modeling system and can enable distributional effect analysis regarding the fleet turnover among heterogeneous populations. ATLAS expands the typical new sale focused vehicle choice modeling to including used vehicle transactions that are of increasing interests to understanding the vehicle adoption behavior among lower income households.

Jin, Ling↗
DOE OSTI2024

Mbin v1.0

The Mbin software, is a software toolkit that implements the IMG metagenome binning pipeline. The software allows the user to process input metagenome contigs, and produces metagenome assembled genomes (metagenome bins) and valuation metrics per bin including completion and contamination estimates, quality assignment, predicted lineage and eukaryotic potential. It is currently packed as a portable docker container and provides the advantage of running the process of binning and analysis of the bins generated, using a suite of tools run sequentially with controls in place to capture errors and optional arguments to run a modified version depending on individual needs and capabilities.

Varghese, Neha↗
DOE OSTI2024

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗
DOE OSTI2024

Deeplynx Dag Repository

The DeepLynx DAG repository will contain several Airflow DAGs (Directed Acyclic Graphs) which will be used in the context of DeepLynx's deployed Apache Airflow instance. These DAGs will be used for multiple data management tasks for DeepLynx data, including but not limited to: - bringing data from various sources and tools into DeepLynx - managing sequential data workflows, such as running Python scripts on data to perform analysis and returning the results to DeepLynx - performing any necessary transformation or pre-processing on data coming into DeepLynx from external sources or out of DeepLynx to go to external applications

Brownlee, JarenM.↗
DOE OSTI2026

MTRE

Multi-Token Reliability Estimation (MTRE) is a lightweight, white-box hallucination detector for vision-language models. Instead of using only the first output token, MTRE aggregates logits from the first ~10 tokens and feeds them to a small attention-based reliability head; per-token scores are combined via a sequential log-likelihood-ratio test with early-stopping, and an MTRE-t variant calibrates thresholds via cross-fitting. MTRE reports average gains of +9.4% Accuracy and +14.8% AUROC over common baselines across MAD-Bench, MM-SafetyBench, MathVista, and arithmetic/counting tasks, while adding ~4.3M params and ~1% inference overhead (~26 MB VRAM, ~0.94 ms per detection). Key limitation: requires access to early token logits and is evaluated on a handful of open-source 7B VLMs.

Bhattarai, Manish [Los Alamos National Labs]↗
DOE OSTI2026

static-subid: Deterministic subordinate UID/GID assignment for unprivileged containers

static-subid calculates predictable subordinate UID and GID ranges for Linux users based on their UID, ensuring consistent ID mappings across multiple systems. Unlike shadow-utils' sequential allocation (which depends on creation order), static-subid uses a deterministic formula that guarantees the same user UID always receives the same subordinate ID range. Subordinate IDs enable user namespaces for unprivileged container runtimes (Podman, Docker rootless mode, LXC) by mapping container UIDs/GIDs to host subordinate IDs without requiring root privileges.

Riehecky, Pat [Fermi National Accelerator Laborato↗
DOE OSTI2026

CTGAN-TVAE

SAND2026-18914O CTGAN-TVAE (Conditional Tabular Generative Adversarial Networks-Tabular Variational Autoencoders) generates extensive sets of variable generation data through a hybrid framework. It enhances latent space representation by combining TVAE's robust feature-embedding with CTGAN's ability to condition categorical variables such as time. CTGAN-TVAE employs a fully connected neural network within a conditional generative adversarial network framework to manage continuous and categorical data effectively, capturing complex feature interactions without needing sequential modeling. This was developed as part of NNSA-MSIPP: Minority Serving Institution Partnership Program, Grant Number DE-NA0004016. 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.

Newlun, Cody [Sandia National Lab. (SNL-CA), Liver↗
DOE OSTI2026

GP Cosmology Surrogate v1.0

GP Cosmology Surrogate is a Python library for building and training a generalized multi-output Gaussian process (GP) framework of @takhtaganov2021cosmic. In this approach, the surrogate is constructed sequentially, guided by a Bayesian optimization acquisition function that targets reduction of emulation error in the regions most consistent with the observational data. This adaptive design concentrates computational resources where they have the greatest impact on inference accuracy. The library supports efficient training for separable GP kernels, which allows the use of Kronecker algebra to handle high-dimensional input spaces and large numbers of correlated outputs. This makes it well suited for applications such as modeling cosmological power spectra, large-scale physical simulations, and multi-output hyperparameter tuning. By combining scalable multi-output GP modeling with data-driven adaptive sampling, GPsurrogate enables parameter inference and optimization with substantially fewer simulations than conventional space-filling designs.

Lukic, Zarija [Lawrence Berkeley National Laborato↗
DOE OSTI2021

Skip-Connected Self-Recurrent Spiking Neural Networks with Joint Intrinsic Parameter and Synaptic Weight Training

As an important class of spiking neural networks (SNNs), recurrent spiking neural networks (RSNNs) possess great computational power and have been widely used for processing sequential data like audio and text. However, most RSNNs suffer from two problems. 1. Due to the lack of architectural guidance, random recurrent connectivity is often adopted, which does not guarantee good performance. 2. Training of RSNNs is in general challenging, bottlenecking achievable model accuracy. To address these problems, we propose a new type of RSNNs called Skip-Connected Self-Recurrent SNNs (ScSr-SNNs). Recurrence in ScSr-SNNs is introduced in a stereotyped manner by adding self-recurrent connections to spiking neurons. The SNNs with self-recurrent connections can realize recurrent behaviors similar to those of more complex RSNNs while the error gradients can be more straightforwardly calculated due to the mostly feedforward nature of the network. The network dynamics is enriched by skip connections between nonadjacent layers. Moreover, we propose a new backpropagation (BP) method called backpropagated intrinsic plasticity (BIP) to further boost the performance of ScSr-SNNs by training intrinsic model parameters. Unlike standard intrinsic plasticity rules that adjust the neuron's intrinsic parameters according to neuronal activity, the proposed BIP method optimizes intrinsic parameters based on the backpropagated error gradient of a well-defined global loss function in addition to synaptic weight training. Here, based on challenging speech, neuromorphic speech, and neuromorphic image datasets, the proposed ScSr-SNNs can boost performance by up to 2.85% compared with other types of RSNNs trained by state-of-the-art BP methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Toward Improving the Generation Quality of Autoregressive Slot VAEs

Unconditional scene inference and generation are challenging to learn jointly with a single compositional model. Despite encouraging progress on models that extract object-centric representations (“slots”) from images, unconditional generation of scenes from slots has received less attention. This is primarily because learning the multiobject relations necessary to imagine coherent scenes is difficult. We hypothesize that most existing slot-based models have a limited ability to learn object correlations. We propose two improvements that strengthen object correlation learning. The first is to condition the slots on a global, scene-level variable that captures higher-order correlations between slots. Second, we address the fundamental lack of a canonical order for objects in images by proposing to learn a consistent order to use for the autoregressive generation of scene objects. Specifically, we train an autoregressive slot prior to sequentially generate scene objects following a learned order. Ordered slot inference entails first estimating a randomly ordered set of slots using existing approaches for extracting slots from images, then aligning those slots to ordered slots generated autoregressively with the slot prior. Our experiments across three multiobject environments demonstrate clear gains in unconditional scene generation quality. Detailed ablation studies are also provided that validate the two proposed improvements.

MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Deep Learning Filter for the Intraseasonal Variability of the Tropics

Abstract This paper presents a novel application of convolutional neural network (CNN) models for filtering the intraseasonal variability of the tropical atmosphere. In this deep learning filter, two convolutional layers are applied sequentially in a supervised machine learning framework to extract the intraseasonal signal from the total daily anomalies. The CNN-based filter can be tailored for each field similarly to fast Fourier transform filtering methods. When applied to two different fields (zonal wind stress and outgoing longwave radiation), the index of agreement between the filtered signal obtained using the CNN-based filter and a conventional weight-based filter is between 95% and 99%. The advantage of the CNN-based filter over the conventional filters is its applicability to time series with the length comparable to the period of the signal being extracted. Significance Statement This study proposes a new method for discovering hidden connections in data representative of tropical atmosphere variability. The method makes use of an artificial intelligence (AI) algorithm that combines a mathematical operation known as convolution with a mathematical model built to reflect the behavior of the human brain known as artificial neural network. Our results show that the filtered data produced by the AI-based method are consistent with the results obtained using conventional mathematical algorithms. The advantage of the AI-based method is that it can be applied to cases for which the conventional methods have limitations, such as forecast (hindcast) data or real-time monitoring of tropical variability in the 20–100-day range.

Stan, Cristiana↗
DOE OSTI2023

Atmosphere–Ocean Coupled Energy Budgets of Tropical Convective Discharge–Recharge Cycles

An energy budget combining atmospheric moist static energy (MSE) and upper ocean heat content (OHC) is used to examine the processes impacting day-to-day convective variability in the tropical Indian and western Pacific Oceans. Feedbacks arising from atmospheric and oceanic transport processes, surface fluxes, and radiation drive the cyclical amplification and decay of convection around suppressed and enhanced convective equilibrium states, referred to as shallow and deep convective discharge–recharge (D–R) cycles, respectively. The shallow convective D–R cycle is characterized by alternating enhancements of shallow cumulus and stratocumulus, often in the presence of extensive cirrus clouds. The deep convective D–R cycle is characterized by sequential increases in shallow cumulus, congestus, narrow deep precipitation, wide deep precipitation, a mix of detached anvil and altostratus and altocumulus, and once again shallow cumulus cloud types. Transitions from the shallow to deep D–R cycle are favored by a positive “column process” feedback, while discharge of convective instability and OHC by mesoscale convective systems (MCSs) contributes to transitions from the deep to shallow D–R cycle. Variability in the processes impacting MSE is comparable in magnitude to, but considerably more balanced than, variability in the processes impacting OHC. Variations in the quantity of atmosphere–ocean coupled static energy (MSE + OHC) result primarily from atmospheric and oceanic transport processes, but are mainly realized as changes in OHC. MCSs are unique in their ability to rapidly discharge both lower-tropospheric convective instability and OHC.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Nonlinear Ensemble Filtering with Diffusion Models: Application to the Surface Quasigeostrophic Dynamics

The intersection between classical data assimilation methods and novel machine learning techniques has attracted significant interest in recent years. Here, we explore another promising solution in which diffusion models are used to formulate a robust nonlinear ensemble filter for sequential data assimilation. Unlike standard machine learning methods, the proposed ensemble score filter (EnSF) is completely training free and can efficiently generate a set of analysis ensemble members. Here, in this study, we apply the EnSF to a surface quasigeostrophic model and compare its performance against the popular local ensemble transform Kalman filter (LETKF), which makes Gaussian assumptions in the analysis step. Numerical tests demonstrate that EnSF maintains stable performance in the absence of localization and for a variety of experimental settings. We find that while LETKF maintains optimal performance in the case of linear observations of the entire state and a perfect model, EnSF shows improvements over LETKF when nonlinear observations are assimilated and the system is subject to unexpected model errors. A spectral decomposition of the analysis results in this nonlinear observation regime shows that the largest improvements over LETKF occur at large scales (small wavenumbers), where LETKF lacks sufficient ensemble spread. Overall, this initial application of EnSF to a geophysical model of intermediate complexity motivates further development of the algorithm for more realistic problems.

Artificial intelligence↗
DOE OSTI2020

Long-Term Vehicle Speed Prediction via Historical Traffic Data Analysis for Improved Energy Efficiency of Connected Electric Vehicles

Connected and automated vehicles (CAVs) are expected to provide enhanced safety, mobility, and energy efficiency. While abundant evidence has been accumulated showing substantial energy saving potentials of CAVs through eco-driving, traffic condition prediction has remained to be the main challenge in capitalizing the gains. The coupled power and thermal subsystems of CAVs necessitate the use of different speed preview windows for effective and integrated power and thermal management. Real-time vehicle-to-infrastructure (V2I) communications can provide an accurate speed prediction over a short prediction horizon (e.g., 30 s to 60 s), but not for a long range (e.g., over 180 s). Therefore, advanced approaches are required to develop detailed speed prediction for robust optimization-based energy management of CAVs. This paper presents an integrated speed prediction framework based on historical traffic data classification and real-time V2I communications for efficient energy management of electrified CAVs. The proposed framework provides multi-range speed predictions with different fidelity over short and long horizons. The proposed multi-range speed prediction is integrated with an economic model predictive control (MPC) strategy for the battery thermal management (BTM) of connected and automated electric vehicles (EVs). The simulation results over real-world urban driving cycles confirm the enhanced prediction performance of the proposed data classification strategy over a long prediction horizon. Despite the uncertainty in long-range CAVs’ speed predictions, the vehicle-level simulation results show that 14% and 19% energy savings can be accumulated sequentially through eco-driving and BTM optimization (eco-cooling), respectively, when compared with normal driving (i.e., human driver) and conventional BTM strategy.

Engineering↗
DOE OSTI2024

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evolution of the SLATE linear algebra library

SLATE (Software for Linear Algebra Targeting Exascale) is a distributed, dense linear algebra library targeting both CPU-only and GPU-accelerated systems, developed over the course of the Exascale Computing Project (ECP). While it began with several documents setting out its initial design, significant design changes occurred throughout its development. In some cases, these were anticipated: an early version used a simple consistency flag that was later replaced with a full-featured consistency protocol. In other cases, performance limitations and software and hardware changes prompted a redesign. Sequential communication tasks were parallelized; host-to-host MPI calls were replaced with GPU device-to-device MPI calls; more advanced algorithms such as Communication Avoiding LU and the Random Butterfly Transform (RBT) were introduced. Early choices that turned out to be cumbersome, error prone, or inflexible have been replaced with simpler, more intuitive, or more flexible designs. Applications have been a driving force, prompting a lighter weight queue class, nonuniform tile sizes, and more flexible MPI process grids. Of paramount importance has been building a portable library that works across several different GPU architectures – AMD, Intel, and NVIDIA – while keeping a clean and maintainable codebase. Here we explore the evolving design choices and their effects, both in terms of performance and software sustainability.

Gates, Mark↗