Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NEST”

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

Evolutionary transition to the ectomycorrhizal habit in the genomes of a hyperdiverse lineage of mushroom-forming fungi

The ectomycorrhizal (ECM) symbiosis has independently evolved from diverse types of saprotrophic ancestors. In this study, we seek to identify genomic signatures of the transition to the ECM habit within the hyperdiverse Russulaceae. We present comparative analyses of the genomic architecture and the total and secreted gene repertoires of 18 species across the order Russulales, of which 13 are newly sequenced, including a representative of a saprotrophic member of Russulaceae, Gloeopeniophorella convolvens. The genomes of ECM Russulaceae are characterized by a loss of genes for plant cell wall-degrading enzymes (PCWDEs), an expansion of genome size through increased transposable element (TE) content, a reduction in secondary metabolism clusters, and an association of small secreted proteins (SSPs) with TE ‘nests’, or dense aggregations of TEs. Here, some PCWDEs have been retained or even expanded, mostly in a species-specific manner. The genome of G. convolvens possesses some characteristics of ECM genomes (e.g. loss of some PCWDEs, TE expansion, reduction in secondary metabolism clusters). Functional specialization in ECM decomposition may drive diversification. Accelerated gene evolution predates the evolution of the ECM habit, indicating that changes in genome architecture and gene content may be necessary to prime the evolutionary switch.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Open-Loop Control Co-Design of Semisubmersible Floating Offshore Wind Turbines Using Linear Parameter-Varying Models

Here, this paper discusses a framework to design elements of the plant and control systems for floating offshore wind turbines in an integrated manner using linear parameter-varying models. Multiple linearized models derived from aero-elastic simulation software in different operating regions characterized by the incoming wind speed are combined to construct an approximate low-fidelity model of the system. The combined model is then used to generate open-loop, optimal control trajectories as part of a nested control co-design strategy that explores the system’s power production and stability using the platform pitch tilt as a proxy in the context of crucial plant and control design decisions. The radial distance between the central and outer columns and the diameter of the outer columns of the semisubmersible platform are the plant design variables. The platform stability and power production are studied for different plant design decisions. The effect of plant decisions on subsequent power production and stability response of the floating wind turbine is quantified in terms of the levelized cost of energy. The results show that the inner-loop constraints and the plant design decisions affect the turbine’s power and, subsequently, the cost of the system.

17 WIND ENERGY↗
DOE OSTI2025

Generalizing multiple memories from a single drive: The hysteron latch

Far-from-equilibrium systems can form memories of previous deformations or driving. In systems from sheared glassy materials to buckling beams to crumpled sheets, this behavior is dominated by return-point memory, in which revisiting a past extremum of driving restores the system to a previous state. Cyclic driving with both positive and negative strains forms multiple nested memories, as in a single-dial combination lock, while asymmetric driving (only positive strain) cannot. We study this case in a general model of hysteresis that considers discrete elements called hysterons. We show how two hysterons with a frustrated interaction can violate return-point memory, realizing multiple memories of asymmetric driving. This reveals a general principle for designing systems that store sequences of cyclic driving, whether symmetric or asymmetric. In disordered systems, asymmetric driving is a sensitive tool for the direct measurement of frustration.

Science & Technology - Other Topics↗
DOE OSTI2025

Anisotropic strain relaxation-induced directional ultrafast carrier dynamics in RuO 2 films

Ultrafast light-matter interactions inspire potential functionalities in picosecond optoelectronic applications. However, achieving directional carrier dynamics in metals remains challenging due to strong carrier scattering within a multiband environment, typically expected for isotropic carrier relaxation. In this study, we demonstrate epitaxial RuO 2 /TiO 2 (110) heterostructures grown by hybrid molecular beam epitaxy to engineer polarization selectivity of ultrafast light-matter interactions via anisotropic strain engineering. Combining spectroscopic ellipsometry, x-ray absorption spectroscopy, and optical pump-probe spectroscopy, we revealed the strong anisotropic transient optoelectronic response at an excitation energy of 1.58 eV in strain-engineered RuO 2 /TiO 2 (110) heterostructures along both in-plane [001] and [1$\bar1$0] crystallographic directions. Theoretical analysis identifies strain-induced modifications in band nesting as the underlying mechanism for enhanced anisotropic carrier relaxation observed at this excitation energy. These findings establish epitaxial strain engineering as a powerful tool for tuning anisotropic optoelectronic responses with near-infrared excitations in metallic systems, paving the way for next-generation polarization-sensitive ultrafast optoelectronic devices.

Science & Technology - Other Topics↗
DOE OSTI2020

A Genome-Based Model to Predict the Virulence of Pseudomonas aeruginosa Isolates

ABSTRACT: Variation in the genome of Pseudomonas aeruginosa , an important pathogen, can have dramatic impacts on the bacterium’s ability to cause disease. We therefore asked whether it was possible to predict the virulence of P. aeruginosa isolates based on their genomic content. We applied a machine learning approach to a genetically and phenotypically diverse collection of 115 clinical P. aeruginosa isolates using genomic information and corresponding virulence phenotypes in a mouse model of bacteremia. We defined the accessory genome of these isolates through the presence or absence of accessory genomic elements (AGEs), sequences present in some strains but not others. Machine learning models trained using AGEs were predictive of virulence, with a mean nested cross-validation accuracy of 75% using the random forest algorithm. However, individual AGEs did not have a large influence on the algorithm’s performance, suggesting instead that virulence predictions are derived from a diffuse genomic signature. These results were validated with an independent test set of 25 P. aeruginosa isolates whose virulence was predicted with 72% accuracy. Machine learning models trained using core genome single-nucleotide variants and whole-genome k-mers also predicted virulence. Our findings are a proof of concept for the use of bacterial genomes to predict pathogenicity in P. aeruginosa and highlight the potential of this approach for predicting patient outcomes. IMPORTANCE Pseudomonas aeruginosa is a clinically important Gram-negative opportunistic pathogen. P. aeruginosa shows a large degree of genomic heterogeneity both through variation in sequences found throughout the species (core genome) and through the presence or absence of sequences in different isolates (accessory genome). P. aeruginosa isolates also differ markedly in their ability to cause disease. In this study, we used machine learning to predict the virulence level of P. aeruginosa isolates in a mouse bacteremia model based on genomic content. We show that both the accessory and core genomes are predictive of virulence. This study provides a machine learning framework to investigate relationships between bacterial genomes and complex phenotypes such as virulence.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Parallel Element-based Algebraic Multigrid for H (c url ) and H (div) Problems Using the ParELAG Library

This paper presents the use of element-based algebraic multigrid (AMGe) hierarchies, implemented in the ParELAG (Parallel Element Agglomeration Algebraic Multigrid Upscaling and Solvers) library, to produce multilevel preconditioners and solvers for H (c url ) and H (div) formulations. ParELAG constructs hierarchies of compatible nested spaces, forming an exact de Rham sequence on each level. This allows the application of hybrid smoothers on all levels and AMS (Auxiliary-space Maxwell Solver) or ADS (Auxiliary-space Divergence Solver) on the coarsest levels, obtaining complete multigrid cycles. Numerical results are presented, showing the parallel performance of the proposed methods. As a part of the exposition, this paper demonstrates some of the capabilities of ParELAG and outlines some of the components and procedures within the library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Tetrahedral Trees: A Family of Hierarchical Spatial Indexes for Tetrahedral Meshes

In this work, we address the problem of performing efficient spatial and topological queries on large tetrahedral meshes with arbitrary topology and complex boundaries. Such meshes arise in several application domains, such as 3D Geographic Information Systems (GISs), scientific visualization, and finite element analysis. To this aim, we propose Tetrahedral trees, a family of spatial indexes based on a nested space subdivision (an octree or a kD-tree) and defined by several different subdivision criteria. We provide efficient algorithms for spatial and topological queries on Tetrahedral trees and compare to state-of-the-art approaches. Our results indicate that Tetrahedral trees are an improvement over R*-trees for querying tetrahedral meshes; they are more compact, faster in many queries, and stable at variations of construction thresholds. They also support spatial queries on more general domains than topological data structures, which explicitly encode adjacency information for efficient navigation but have difficulties with domains with a non-trivial geometric or topological shape.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Neuromorphic Graph Algorithms: Cycle Detection, Odd Cycle Detection, and Max Flow

Neuromorphic computing is poised to become a promising computing paradigm in the post Moore’s law era due to its extremely low power usage and inherent parallelism. Spiking neural networks are the traditional use case for neuromorphic systems, and have proven to be highly effective at machine learning tasks such as control problems. More recently, neuromorphic systems have been applied outside of the arena of machine learning, primarily in the field of graph algorithms. Neuromorphic systems have been shown to perform graph algorithms faster and with lower power consumption than their traditional (GPU/CPU) counterparts, and are hence an attractive option for a co-processing unit in future high performance computing systems, where graph algorithms play a critical role. In this paper, we present a neuromorphic implementation of cycle detection, odd cycle detection, and the Ford-Fulkerson max-flow algorithm. We further evaluate the performance of these implementations using the NEST neuromorphic simulator by using spike counts and simulation time as proxies for energy consumption and run time. In addition to gains inherent in neuromorphic systems, we show that within the neuromorphic implementations early stopping criteria can be implemented to further improve performance.

Kay, Bill↗
DOE OSTI2023

Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters

This paper presents a unified communication optimization framework for sparse triangular solve (SpTRSV) algorithms on CPU and GPU clusters. The framework builds upon a 3D communication-avoiding (CA) layout of Px × Py × Pz processes that divides a sparse matrix into Pz submatrices, each handled by a Px × Py 2D grid with block-cyclic distribution. We propose three communication optimization strategies: First, a new 3D SpTRSV algorithm is developed, which trades the inter-grid communication and synchronization with replicated computation. This design requires only one inter-grid synchronization, and the inter-grid communication is efficiently implemented with sparse allreduce operations. Second, broadcast and reduction communication trees are used to reduce message latency of the intra-grid 2D communication on CPU clusters. Finally, we leverage GPU-initiated one-sided communication to implement the communication trees on GPU clusters. With these nested inter- and intra-grid communication optimization strategies, the proposed 3D SpTRSV algorithm can attain up to 3.45x speedups compared to the baseline 3D SpTRSV algorithm using up to 2048 Cori Haswell CPU cores. In addition, the proposed GPU 3D SpTRSV algorithm can achieve up to 6.5x speedups compared to the proposed CPU 3D SpTRSV algorithm with Pz up to 64. Finally it is remarkable that the proposed GPU 3D SpTRSV can scale to 256 GPUs using the Perlmutter system while the existing 2D SpTRSV algorithm can only scale up to 4 GPUs.

Sao, Piyush↗
DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗
DOE OSTI2021

A Spatiotemporal Prediction Model for Regional Scheduling of Shared Bicycles Based on the INLA Method

Dock-less bicycle-sharing programs have been widely accepted as an efficient mode to benefit health and reduce congestions. And modeling and prediction has always been a core proposition in the field of transportation. Most of the existing demand prediction models for shared bikes take regions as research objects; therefore, a POI-based method can be a beneficial complement to existing research, including zone-level, OD-level, and station-level techniques. Point of interest (POI) is the location description of spatial entities, which can reflect the cycling route characteristics for both commuting and noncommuting trips to a certain extent, and is also the main generating point and attraction point of shared-bike travel flow. In this study, we make an effort to model a POI-level cycling demand with a Bayesian hierarchical method. The proposed model combines the integrated nested Laplace approximation (INLA) and random partial differential equation (SPDE) to cope with the huge computation in the modeling process. In particular, we have adopted the dock-less bicycle-sharing rental records of Mobike as a case study to validate our method; the study area was one of the fastest growing urban districts in Shanghai in August 2016. The operation results show that the method can help better understand, measure, and characterize spatiotemporal patterns of bike-share ridership at the POI level and quantify the impact of the spatiotemporal effect on bicycle-sharing use.

Yu, Zhuoran↗
DOE OSTI2021

HYPPO v1.0.0

HYPPO is a hyperparameter optimization (HPO) software that uses surrogate modeling and uncertainty quantification to provide reliable neural network architectures. Similar state-of-the-art HPO technologies do not use such features and mostly perform random searches to explore the parameter space, which can easily become computationally expensive. Using HYPPO, the user is able to reduce by an order of magnitude the number of evaluations necessary to identify the most optimal region in the hyperparameter space. Finally, using asynchronous nested parallelism, we are able to decrease by two orders of magnitude the amount of time required to complete the HPO process.

Dumont, Vincent↗
DOE OSTI2022

Kubernetes Bindings for the Flux Workload Manager

Flux is a framework for writing resource managers as well as a resource manager for HPC systems. It allows for hierarchical nesting and providing a portable interface for job scheduling across systems. The flux-k8s software provides an interface between Flux and Kubernetes so the two frameworks can use each other's functionality. The code is currently licensed under the LGPL-3.0 License, but we request to re-license the code to promote outside collaboration and community adoption.

Ahn, DongH↗
DOE OSTI2023

YoDawg CI Runner

SAND2022-15186 O YoDawg CI Runner builds a container that hosts a Gitlab runner as a service. It provides the ability to run Podman in a nested fashion as part of a CI workflow (i.e., "Podman-in-Podman”). This allows CI jobs to be run on HPC resources by standard users through an on-demand batch scheduler. 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.

Curry, Matthew↗
DOE OSTI2023

EyeON

EyeON: Eye on Operational technology Software Supply Chain attacks have risen drastically over the past few years, none more well-known and impactful than the SolarWinds compromise. Criminal organizations inserted an attack vector into a specific version of the source code, giving themselves an air of credibility. Once news broke on SolarWinds, identifying compromised sites was very difficult, even knowing the culprit update. Software Bills of Materials (SBOM) have been touted as the solution to reclaiming control of your software supply chain. Deployment of SBOMs has been slow, however, due to conflicting standards, opaque storage requirements, and vendor adoption. Additionally, the path from obtaining an SBOM and securing your supply chain is unclear; how can an SBOM library be leveraged to provide insight to your attack surface? The EyeON tool, sponsored by Department of Energy Cybersecurity, Energy Security, and Emergency Response (DoE CESER), aims to address these gaps by providing an encapsulated solution to tracking which updates have been installed in an enterprise, and alerting system administrators to vulnerabilities as they become known. Similar to a virus scanner, EyeON is a command line tool to parse either a single file, nested directory structure, or filesystem. It collects data such as signature (hashes), version information, VirusTotal tags, compiler, compilation date, and code signing information. Users will anonymously submit scan data periodically to DoE CESER, who will then compile a database of known software products employed by Critical Infrastructure and broadcast alerts based on discovered flaws as they arise.

Tenzing, Wangmo↗
DOE OSTI2025

EVI-EnSitePy (Electric Vehicle Infrastructure – Energy Estimation and Site Optimization Tool in Python) [EVI-X Modeling Suite] [SWR-25-07]

EVI-EnSitePy is a comprehensive agent-based tool designed for the analysis and design of high-power charging sites, encompassing a wide array of site agents including Electric Vehicles (EVs), chargers, energy storage units (ESS), renewable energy resources (DER), and loads. This versatile tool offers diverse functionalities and a modular modeling approach, allowing detailed configuration of agents based on power ratings, port numbers, energy capacities, demand requirements, charger interfaces, and flexibility to customize the tool for project specific goals. By simulating agent interactions and employing various metrics, EVI-EnSitePy enables the assessment of site performance, exploration of energy management systems (EMS), and implementation of innovative EV charging policies. Utilizing EV charge schedules and arrival states, the tool performs thorough charging site simulations, with outputs consisting of agent and site-level power profiles and statistical metrics. Employing a tree graph structure, EVI-EnSitePy supports nested site structures and power distribution modeling. The tool's ability to generate charging schedules deterministically or via stochastic analysis further enhances its versatility. Through its features and capabilities, EVI-EnSitePy offers a powerful platform for informed decision-making in the realm of high-power charging site design and operation.

Jackson, Derek [National Renewable Energy Laborato↗
DOE OSTI2025

Data Agnostic Feature-Target Analysis & Ranking Machine Learning Pipeline (DAFTAR-ML) v0.1.0

DAFTAR-ML is a specialized machine-learning pipeline that identifies relevant features based on their relationship to a target variable. Many ML pipelines focus solely on prediction, and feature ranking is often absent or lacks robust statistical methods. DAFTAR-ML performs its tasks with this outcome in mind. Model training is robust, using nested cross-validation and hyperparameter tuning. Instead of relying on native feature-importance scores, it employs SHAP (SHapley Additive exPlanations) to quantify feature importance. The pipeline also produces comprehensive results, including publication-quality visualizations.

Melie, Tina [Lawrence Berkeley National Laboratory↗
DOE OSTI2022

The CORDEX-CORE EXP-I Initiative: Description and Highlight Results from the Initial Analysis

Here we describe the first effort within the Coordinated Regional Climate Downscaling Experiment–Coordinated Output for Regional Evaluation, or CORDEX-CORE EXP-I. It consists of a set of twenty-first-century projections with two regional climate models (RCMs) downscaling three global climate model (GCM) simulations from the CMIP5 program, for two greenhouse gas concentration pathways (RCP8.5 and RCP2.6), over nine CORDEX domains at ~25-km grid spacing. Illustrative examples from the initial analysis of this ensemble are presented, covering a wide range of topics, such as added value of RCM nesting, extreme indices, tropical and extratropical storms, monsoons, ENSO, severe storm environments, emergence of change signals, and energy production. They show that the CORDEX-CORE EXP-I ensemble can provide downscaled information of unprecedented comprehensiveness to increase understanding of processes relevant for regional climate change and impacts, and to assess the added value of RCMs. The CORDEX-CORE EXP-I dataset, which will be incrementally augmented with new simulations, is intended to be a public resource available to the scientific and end-user communities for application to process studies, impacts on different socioeconomic sectors, and climate service activities. The future of the CORDEX-CORE initiative is also discussed.

54 ENVIRONMENTAL SCIENCES↗