Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “IMPLEMENTATION”

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,513 records · Page 84
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Homotopy Solver

This software implements parallel versions of an interior-point solver, based on the publicly available ipopt solver. Here we have full control over the linear solver and our algorithm is fully parallel thus enabling scalability to large-scale optimization problems. This package also has a parallel implementation of a homotopy solver developed under the scalable methods for contact LDRD project 23-ERD-017. This solver is an mfem-based implementation of algorithm described in ``A filter trust-region Newton continuation method for nonlinear complementarity problems''. Cosmin G. Petra, Nai-Yuan Chiang, Jingyi Wang, Tucker Hartland, and Michael Puso (submitted), LLNL-JRNL-869761.

Hartland, Tucker [Lawrence Livermore National Labo↗
DOE OSTI2024

Continuous thermostat setpoint monitoring and correction (Thermostat setpoint correction) v1.0

The Continuous Thermostat Setpoint Monitoring and Correction software is a set of fault detection and correction algorithms that can be implemented in thermostats with two-way OpenAPIs. It is written in the Python language. The algorithms aim to detect the most common and impactful efficiency problems associated with thermostat setpoints - overly aggressive heating or cooling setpoints, incorrect schedules/setbacks, and overly narrow deadbands. These algorithms can automatically detect faults, and implement associated corrective actions to bring the system back to a state of efficient operation. The algorithms can run remotely in the cloud, and directly implemented by connected thermostat manufacturers, or by third party service providers. The software enables a lightweight cost-effective energy management strategy for HVAC systems. The solution is specially viable for small and medium sized commercial buildings, where a full scale building automation system and fault detection and diagnostic tools are often unavailable.

Granderson, Jessica↗
DOE OSTI2025

stor4build

The EnergyPlus simulation engine supports modeling and simulation of thermal energy storage (TES) systems in several ways, including using the Python-EMS feature, which extends the operation of the engine with custom code written in Python. Creation of models using this feature can be tedious and error prone, with the connection of the model components to the Python code a particularly troublesome area. The stor4build Python package simplifies this process by modifying an input model to add a selected TES technology (implemented with the Python-EMS feature) and runs the simulation. The package leverages the OpenStudio middleware software development kit to automate this process as much as possible, eliminating potential errors and simplifying usage of EnergyPlus. The package provides objects, functions, and OpenStudio measures that implement the necessary operations to automate the creation of EnergyPlus models that integrate TES technologies with building systems. In addition, two user interfaces are provided: a command line interface and a web application programming interface. The automated process implemented by the package greatly simplifies the modeling and simulation process, allowing for parametric studies to be executed much more efficiently and effectively. The OpenStudio-based workflow is also very flexible and will allow for future additions of new technologies.

DeGraw, JasonWilliam [Oak Ridge National Laborator↗
DOE OSTI2025

QUANT-NET Control Plane Framework (QNCP) v1.0.0

The QUANT-NET Control Plane (QNCP) provides a software framework for expressing and managing quantum network resources. It may be used to orchestrate a physical quantum testbed with real device driver implementations, or it may be used as a proving ground when developing new protocols and management functions. In practice, both approaches may be useful when undertaking research and development in emerging quantum testbeds. While a number of control systems have been developed for specific quantum platform demonstrations, an openly available and general solution for operating quantum networks has not emerged. QNCP is designed to fill this gap. The framework has been designed to provide extensible, modular capabilities that include scheduling, routing, monitoring, and pluggable protocols. A number of reference implementations in each module category have been included in the installable packages; however, the intent is that each of these modules may be extended or re-implemented to meet the needs of the particular deployment or research need. The software is currently being used in the QUANT-NET testbed project, which spans resources between LBNL and UC Berkeley Physics.

Zhang, Liang [Lawrence Berkeley National Laborator↗
DOE OSTI2026

Hyperdimensional computing for image classification (HDC) v1.0

This is an implementation of the hyperdimensional computing technique to classify images. It consists of a python script that trains the system for a set of images from a set of images (dataset) specified by the user. This training produces hardware configuration parameters and description vectors that are then loaded into the hardware description part of the project. The hardware description consists of hardware described in Verilog (a well known language for this purpose) that is synthesizable and can be implemented in a real chip. This hardware received the training information generated by python, and then is able to accept images to produce answers for each image on which category (class) from the pre-=trained ones the image belongs to. The hardware and python training scripts are configurable and documented. The advantage of hyperdimensional computing is its robustness to errors and the easy capability for online learning (refining the training during inference slowly over time), which this implementation supports.

Michelogiannakis, Georgios [Lawrence Berkeley Nati↗
DOE OSTI2026

NCCS High Performance GMRES Mixed Precision

HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.

Kashi, Aditya [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2025

A Data Processing Pipeline To Extract A Knowledge Graph From Heterogeneous Data For Socio-technical Analysis Of Critical Infrastructure Influence

The code is written in Python and consists of the following pipeline that is implemented in Apache Airflow. This pipeline intends to understand the companies that are directly or indirectly involved with a type of critical infrastructure system at some point in that system's lifecycle. The pipeline takes a configuration file that specifies a list of initial companies to consider, a geographic region of interest, and a set of SEC form types as well as other data sources (e.g. CrunchBase) from which to extract entities and relations. There are four main components to this pipeline as currently implemented: Entity Extraction, Network Construction, Analysis, and Visualization. First, Entity Extraction, is implemented as the `topear-extract_organizations` Apache Airflow workflow. Given an initial query that specifies a geographic region of interest and a time interval, the software will extract CI facilities of interest and organizations that have a direct influence relationship to those facilities (e.g. ownership). During the course of the LDRD, we focused on Electric Vehicle charging stations and this information is available via the Department of Energy (DOE) database on fueling stations maintained by NREL. Within the context of the DOE CESER project, we have focused on Battery Energy Storage Systems (BESS). Second, the Network Extraction component will iteratively construct a social network graph given the set of organizations and people extracted in the previous step. Organizations (and eventually People if desired) are then fed as a query to the `topgear-construct_social_network` Apache Airflow workflow which given a set of initial companies and data sets (e.g. SEC EDGAR form types, OpenCorporates, Crunchbase). This Airflow workflow will iteratively query such data sources to discover relationships with new organizations and people. For example, this module can iteratively query SEC EDGAR for metadata that documents the number of each type of form for the given set of companies and their location. This forms metadata represents a catalog of data sources from SEC EDGAR for the extracted social network knowledge graph. The pipeline then downloads these forms from the website and saves them in a build directory for further processing. These documents are then parsed for entities and relations. Again, we note that in additional to SEC data sources, this step can also pull in information on organizations via API services such as CrunchBase and OpenCorporates or bulk data sources. At the end of this step, the resultant social network, the Critical Infrastructure network, and the edges that encode relationships between organizations and CI facilities, form the Adversarial Socio-Technical Network (ASTN) that informs the analysis. Third, the Analysis component processes these generated ASTN. Previously, that has included the ability to compare prevalence of different vendors for a given infrastructure component type across different regions as well as identify common public and private investors across those vendors. This was demonstrated for EV Charging Stations across several different metropolitan areas within an IEEE PES GridEdge publication. More recently, we have looked at ways to identify infrastructure owners and operators of BESS with the most nameplate capacity across different states as well as other indictors of risk resulting from changes in ownership over time. Finally, the Visualization component consists of an HTML/CSS/JS framework by which users can interact geospatial, operational, and organizational relationships across a given portfolio of Critical Infrastructure facilities. The objective is to provide a library of UI/UX modules that can be repurposed for stakeholder-specific dashboards. All of the modules are related via a common event model that enables UI actions in one view to percolate across the other views.

Weaver, Gabriel [Idaho National Laboratory (INL), ↗
DOE OSTI2025

Genesis: A Compiler Framework for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers

We introduce Genesis, the first compiler designed to support Hamiltonian Simulation on hybrid continuous-variable (CV) and discrete-variable (DV) quantum computing systems. Genesis is a two-level compilation system. At the first level, it decomposes an input Hamiltonian into basis gates using the native instruction set of the target hybrid CV-DV quantum computer. At the second level, it tackles the mapping and routing of qumodes/qubits to implement long-range interactions for the gates decomposed from the first level. Rather than a typical implementation that relies on SWAP primitives similar to qubit-based (or DV-only) systems, we propose an integrated design of connectivity-aware gate synthesis and beamsplitter SWAP insertion tailored for hybrid CV-DV systems. We also introduce an OpenQASM-like domain-specific language (DSL) named CVDV-QASM to represent Hamiltonian in terms of Pauli-exponentials and basic gate sequences from the hybrid CVDV gate set. Genesis has successfully compiled several important Hamiltonians, including the Bose-Hubbard model, Z2−Higgs model, Hubbard-Holstein model, Heisenberg model and Electron-vibration coupling Hamiltonians, which are critical in domains like quantum field theory, condensed matter physics, and quantum chemistry. Our implementation is available at Genesis-CVDV-Compiler https://github.com/ruadapt/Genesis-CVDV-Compiler

Chen, Henry↗
DOE OSTI2023

Energy Exascale Earth System Model v2.1.0

First release of version 2.1 of the Energy Exascale Earth System Model. [ATM] The atmosphere component remains EAM. There are no major changes in the default configuration since 2.0. New features include: A semi-lagrangian tracer transport for theta-l dycore, a new algorithm for finding the tropopause, new RRM mesh configurations. Add and update SSP370 and SSP585 cases. Restore the FIDEAL case. [LAND] The land component is ELM. There are no major changes in the default configuration since 2.0. Several option features have been added including: implementation of topography-based subgrid structure (topounits) and accompanying parameterizations and atmospheric forcing downscaling methods; a new plant hydraulics scheme; two-way land-river hydrological coupling through the infiltration of floodplain water; an implementation of perennial crops; updates to the SNICAR-AD snow radiative transfer model; and implementation of soil erosion and sediment yield in ELM-Erosion. Each of these new changes is modular in design and can be turned on or off as the user specifies; they are currently being tested in different “BGC” configurations. [OCEAN] The ocean component remains MPAS-Ocean. Major change since version 2.0 include the addition of the Fox-Kemper et al. 2011 parameterization for submesocale eddies, a correction for barotropic thickness consistency that reduces divergence noise, and the addition of an ocean carbon conservation analysis member. [SEAICE] The sea-ice component remains MPAS-Seaice. Major changes since version 2.0 include: A correction to how shortwave parameters are interpolated in the snicar-ad 5-band radiation scheme, the addition of a sea ice carbon conservation analysis member, updates to the default sea ice biogeochemistry namelist parameters to be consistent with version 2.0 improvements to nitrogen cycling and a correction in the ice-ocean dissolved organic nitrogen coupling. [LAND ICE] The land-ice component remains MPAS-Albany-landIce (MALI). Major changes since 2.0 include an update to the MALI version and the Greenland mesh.[RIVER] The river model is MOSART. There are no major changes in the default configuration since 2.0. A major new optional feature is two-way river-ocean hydrological coupling between MOSART and MPAS-O. This change can be turned on or off as the user specifies, and is being tested in different configurations. [COUPLER] The coupler remains cpl7/MCT. Major changes since version 2.0 include: Carbon budget calculated when heat/water budgets active. Fix a bug in land-atm fluxes for tri-grid configurations. [OTHER] a small bug in the zenith angle calculation was fixed in the data models.

ECP↗
DOE OSTI2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Taking the MPI standard and the open MPI library to exascale

The Open MPI for Exascale (OMPI-X) project was one of two in the Exascale Computing Project (ECP) focused on advancing the MPI ecosystem. The OMPI-X team worked with other MPI Forum members to champion several important features for inclusion in the MPI 4.0, 4.1, and upcoming 5.0 MPI standard versions, in support of the needs of exascale applications and systems. The team also worked with the larger Open MPI community to bring implementations of these new features and other enhancements into Open MPI, one of the leading open-source implementations of the MPI interface. Here, this paper describes the motivation for the work of the OMPI-X project in the context of exascale computing needs, the nature of the resulting new capabilities in the MPI standard, and how they were implemented in the Open MPI library. Features include improved support for “MPI + X” programming models through partitioned communications and support for user-level threading, sessions, fault tolerance through the user-level fault mitigation (ULFM) and Reinit models, and other features. We also discuss enhancements to Open MPI providing improved performance and scalability for existing features, such as collective operations, one-sided operations, support for the Slingshot-11 interconnect of the initial exascale systems, and how the OMPI-X team worked to improve quality assurance for the Open MPI library, particularly on platforms of interest to the Department of Energy community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Money Matters: A Three-Step Process for Using Budget Data in Program Evaluation to Assess the Design and Management of a Novel Public Health Program

We applied a three-step process, abstracting and analyzing program budgets to examine how Colorectal Cancer Control Program (CRCCP) awardees are structuring their programs and to assess the fidelity of program design to the CRCCP public health model. We reviewed 23 state, one tribal organization, and six university awardee budgets. We assessed resource allocations, staffing structures, and contracted partners and their activities. Awardees allocated 83% of all funds to contracts and personnel. Program managers were the most budgeted personnel type across three measures: number of people, full-time equivalency, and personnel costs. Awardees not only contracted with health care systems and clinics (39% of all contracts) but also contracted other partner types. Contractors were mainly funded to implement evidence-based interventions (25%) and conduct evaluation (24%). Program design varied among awardees in the number of staff (0–22), number of full-time equivalencies (0–5.4), and the number of contracts (1–11) budgeted. State awardees budgeted more resources to contracts, compared with university awardees (57% vs. 31%), while universities budgeted more for total personnel costs (41% vs. 30%). We learned that awardees designed their programs with fidelity to the CRCCP model. Although implementation approaches varied, overall results suggest implementation requires a combination of internal capacities and contracted partners. Budgets provide opportunities to use already existing program data to evaluate program design, partnerships, and planned activities.

Uhd, Justin↗
DOE OSTI2020

ADEPT: a domain independent sequence alignment strategy for gpu architectures

Bioinformatic workflows frequently make use of automated genome assembly and protein clustering tools. At the core of most of these tools, a significant portion of execution time is spent in determining optimal local alignment between two sequences. This task is performed with the Smith-Waterman algorithm, which is a dynamic programming based method. With the advent of modern sequencing technologies and increasing size of both genome and protein databases, a need for faster Smith-Waterman implementations has emerged. Multiple SIMD strategies for the Smith-Waterman algorithm are available for CPUs. However, with the move of HPC facilities towards accelerator based architectures, a need for an efficient GPU accelerated strategy has emerged. Existing GPU based strategies have either been optimized for a specific type of characters (Nucleotides or Amino Acids) or for only a handful of application use-cases. In this paper, we present ADEPT, a new sequence alignment strategy for GPU architectures that is domain independent, supporting alignment of sequences from both genomes and proteins. Our proposed strategy uses GPU specific optimizations that do not rely on the nature of sequence. We demonstrate the feasibility of this strategy by implementing the Smith-Waterman algorithm and comparing it to similar CPU strategies as well as the fastest known GPU methods for each domain. ADEPT’s driver enables it to scale across multiple GPUs and allows easy integration into software pipelines which utilize large scale computational systems. We have shown that the ADEPT based Smith-Waterman algorithm demonstrates a peak performance of 360 GCUPS and 497 GCUPs for protein based and DNA based datasets respectively on a single GPU node (8 GPUs) of the Cori Supercomputer. Overall ADEPT shows 10x faster performance in a node-to-node comparison against a corresponding SIMD CPU implementation. ADEPT demonstrates a performance that is either comparable or better than existing GPU strategies. We demonstrated the efficacy of ADEPT in supporting existing bionformatics software pipelines by integrating ADEPT in MetaHipMer a high-performance denovo metagenome assembler and PASTIS a high-performance protein similarity graph construction pipeline. Our results show 10% and 30% boost of performance in MetaHipMer and PASTIS respectively.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Development of message passing-based graph convolutional networks for classifying cancer pathology reports

Abstract Background Applying graph convolutional networks (GCN) to the classification of free-form natural language texts leveraged by graph-of-words features (TextGCN) was studied and confirmed to be an effective means of describing complex natural language texts. However, the text classification models based on the TextGCN possess weaknesses in terms of memory consumption and model dissemination and distribution. In this paper, we present a fast message passing network (FastMPN), implementing a GCN with message passing architecture that provides versatility and flexibility by allowing trainable node embedding and edge weights, helping the GCN model find the better solution. We applied the FastMPN model to the task of clinical information extraction from cancer pathology reports, extracting the following six properties: main site, subsite, laterality, histology, behavior, and grade. Results We evaluated the clinical task performance of the FastMPN models in terms of micro- and macro-averaged F1 scores. A comparison was performed with the multi-task convolutional neural network (MT-CNN) model. Results show that the FastMPN model is equivalent to or better than the MT-CNN. Conclusions Our implementation revealed that our FastMPN model, which is based on the PyTorch platform, can train a large corpus (667,290 training samples) with 202,373 unique words in less than 3 minutes per epoch using one NVIDIA V100 hardware accelerator. Our experiments demonstrated that using this implementation, the clinical task performance scores of information extraction related to tumors from cancer pathology reports were highly competitive.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Quantum search on noisy intermediate-scale quantum devices

Abstract Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's algorithm was designed without considering the physical resources, such as depth, in the real implementations. Therefore, Grover's algorithm can be improved for NISQ devices. In this paper, we demonstrate how to implement quantum search algorithms better on NISQ devices. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. We report the highest success probability of the five-qubit search algorithm compared to previous works. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.

Physics↗
DOE OSTI2024

A literature review of pyroprocessing safeguards

Pyroprocessing is a promising technology for reprocessing used nuclear fuel (UNF) from light water reactors (LWR) and sodium fast reactors (SFR). With the advancement of fast reactors with projects from companies such as TerraPower, the prospects of pyroprocessing are more promising than ever before, as fast reactors can consume all actinides, not just uranium and plutonium. Before pyroprocessing can be implemented commercially, pre-existing safeguards used for aqueous reprocessing must be adapted for pyroprocessing. Safeguards, as determined by both the Nuclear Regulatory Commission (NRC) and the International Atomic Energy Agency (IAEA), are discussed in this review as guidelines for approaches used in both domestic and international reprocessing plants. The implementation of safeguards in aqueous reprocessing was then reviewed based on the experience from existing aqueous facilities. The experimental pyroprocessing facilities were identified as pyroprocessing plants in the design stage with one operating exception of the Fuel Conditioning Facility (FCF). The safeguard methods implemented or designed for each and the accompanying challenges of utilizing existing safeguards in pyroprocessing are considered and a summary of applicable approaches is included.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Coarse Mesh Finite Difference Acceleration for Pebble Tracking Transport in Griffin

We implemented a coarse mesh finite difference (CMFD) for accelerating transport calculations with PTT (pebble tracking transport) in the Griffin code. More specifically, extensions for transport update with the consideration of scattering operator and CMFD projection were implemented for PTT. The implementation was verified with a simplified PBR (pebble bed reactor) benchmark problem and significant performance improvements in CPU time was observed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Conduct of Operations and Nuclear Criticality Safety Standards

Since the beginning of the nuclear age in 1943, there have been 22 criticality accidents in process facilities worldwide in which fissionable materials were processed by hand for various purposes. Of these 22 process criticality accidents, 16 involved faulty or flawed conduct of operations. Most of these process accidents (17 of 22) occurred before 1970, mostly due to the implementation of formal conduct of operations—such as the use of operating procedures and training—and the use of consensus standards for nuclear criticality safety (NCS). Obviously, the nuclear facilities applied lessons learned from their accident history, and the rate of criticality accidents was significantly reduced as a result. Over the years, it has been emphasized in NCS training courses and other venues in the United States that the consensus standards, such as ASA N6.1-1964, were the key contributors to this reduction in accidents. The formality of operations required to implement and apply the standards at a facility is also a crucial prerequisite that must be sufficiently robust to ensure NCS. This prerequisite is crucial to success fully implement the NCS consensus and other safety standards at a site.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗