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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Implementing a microphysics model in hydrodynamic simulations to study the initial plasma formation in dielectric ablator materials for direct-drive implosions

A microphysics model to describe the photoionization and impact ionization processes in dielectric ablator materials like plastic has been implemented into the 1-D hydrodynamic code LILAC for planar and spherical targets. Currently, the initial plasma formation during the early stages of a laser drive are modeled in an ad hoc manner, until the formation of a critical surface. Implementation of the physics-based models predict higher values of electron density, electron temperature, and pressure than the ad hoc model. Moreover, the numerical predictions are consistent with previous experimental observations of the shinethrough mechanism in plastic ablators. For planar targets, a decompression of the rear end of the target was observed, that is similar to recent experiments. An application of this model is to understand the laser-imprint mechanism that is caused by nonuniform laser irradiation due to single beam speckle.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits. Published by the American Physical Society 2025

Berthusen, Noah (ORCID:0000000275862786)↗
DOE OSTI2021

Implementation of a self-consistent slab model of bilayer structure in the SasView suite

Slab models are simple and useful structural descriptions which have long been used to describe lyotropic lamellar phases, such as lipid bilayers. Typically, slab models assume a midline symmetry and break a bilayer structure into three pieces, a central solvent-free core and two symmetric outer layers composed of the soluble portion of the amphiphile and associated solvent. This breakdown matches reasonably well to the distribution of neutron scattering length density and therefore is a convenient and common approach for the treatment of small-angle scattering data. Here, an implementation of this model within the SasView software suite is reported. The implementation is intended to provide physical consistency through the area per amphiphile molecule and number of solvent molecules included within the solvent-exposed outer layer. The proper use of this model requires knowledge of (or good estimates for) the amphiphile and solvent molecule volume and atomic composition, ultimately providing a self-consistent data treatment with only two free parameters: the lateral area per amphiphile molecule and the number of solvent molecules included in the outer region per amphiphile molecule. Here, the use of this code is demonstrated in the fitting of standard lipid bilayer data sets, obtaining structural parameters consistent with prior literature and illustrating the typical and ideal cases of fitting for neutron scattering data obtained using single or multiple contrast conditions. While demonstrated here for lipid bilayers, this model is intended for general application to block copolymers, surfactants, and other lyotropic lamellar phase structures for which a slab model is able to reasonably estimate the neutron scattering length density/electron-density profile of inner and outer layers of the lamellae.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Robust framework and software implementation for fast speciation mapping

One of the greatest benefits of synchrotron radiation is the ability to perform chemical speciation analysis through X-ray absorption spectroscopies (XAS). XAS imaging of large sample areas can be performed with either full-field or raster-scanning modalities. A common practice to reduce acquisition time while decreasing dose and/or increasing spatial resolution is to compare X-ray fluorescence images collected at a few diagnostic energies. In this work, several authors have used different multivariate data processing strategies to establish speciation maps. Furthermore, the theoretical aspects and assumptions that are often made in the analysis of these datasets are focused on. A robust framework is developed to perform speciation mapping in large bulk samples at high spatial resolution by comparison with known references. Two fully operational software implementations are provided: a user-friendly implementation within the MicroAnalysis Toolkit software, and a dedicated script developed under the R environment. The procedure is exemplified through the study of a cross section of a typical fossil specimen. Additionally, the algorithm provides accurate speciation and concentration mapping while decreasing the data collection time by typically two or three orders of magnitude compared with the collection of whole spectra at each pixel. Whereas acquisition of spectral datacubes on large areas leads to very high irradiation times and doses, which can considerably lengthen experiments and generate significant alteration of radiation-sensitive materials, this sparse excitation energy procedure brings the total irradiation dose greatly below radiation damage thresholds identified in previous studies. This approach is particularly adapted to the chemical study of heterogeneous radiation-sensitive samples encountered in environmental, material, and life sciences.

47 OTHER INSTRUMENTATION↗
DOE OSTI2018

Comparison of Conservation Behavior in Several Variationally Derived Implementations for Simulating Electromagnetic Plasmas

Variational techniques based on Low's Lagrangian formulation have demonstrated significant improvement in conservation properties as compared to traditional particle-in-cell (PIC) algorithms. Previous work showed that equations derived from a discretized Lagrangian preserve a discretized version of the connection between Lagrangian symmetries and conservation laws, i.e., Noether's theorem. Specifically, a thorough analysis of energy conservation within the new system explained the absence of “grid heating” phenomena. In the present work, variationally derived implementations in a gridded periodic domain were compared to analogous implementations using Fourier bases. Since the Fourier basis allows for exact momentum conservation, this approach enables us to compare the relative merits of exact and approximate momentum conservation. Furthermore, to establish a tangible comparison for numerical methods, we investigate two simple physical examples; (1) the coupling of an electrostatic and electromagnetic plasma wave and (2) an equilibrium supporting Weibel instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

Design and Implementation of an optimized 100 kW stationary wireless charging system for EV battery recharging

This paper presents the design, analyses and implementation of an optimized single stage high power wireless charging system capable of transferring 100 kW at an operating frequency of 22 kHz and a coil-to-coil distance of 5 inches.The detailed design and implementation of the power electronics including the high frequency inverter and rectifier and wireless power transfer coils along with the resonant stage are described. FEA simulation results of the coils and the resonant network analysis are validated by using a Venable frequency response analyzer. Experimental results corresponding to 50 kW operation are presented to validate the design process.

Galigekere, Veda Prakash↗
DOE OSTI2023

Hyperparameter Optimization and Feature Inclusion in Graph Neural Networks for Spiking Implementation

Graph convolutional networks leverage both graph structures and features on nodes and edges for improved learning performance in comparison with classical machine learning approaches. Spiking neuromorphic computers natively implement network-like computation and have been shown to be successful at implementing graph learning without features. Incorporating graph features brings the challenge of efficient feature representation and balancing the contribution of topology and features in learning. In this work, we present our design of a simulated network of spiking neurons to perform semi-supervised learning on graph data using both the graph structure and the node features. We explore various design choices, present preliminary results, and discuss the opportunities for using neuromorphic computers for this task in the future.

Cong, Guojing↗
DOE OSTI2016

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation

We recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that are discovered by solving scenario subproblems. In our work, we develop an asynchronous, distributed implementation of the algorithm which has computational advantages over existing synchronous implementations of the algorithm. Improvements to both the synchronous and asynchronous algorithm are proposed. We also test the results on well known stochastic 0-1 programs from the SIPLIB test library and is able to solve one previously unsolved instance from the test set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Implementing the OpenACC Data Model

Programming accelerators today usually requires managing separate virtual and physical memories, such as allocating space in and copying data between host and device memories. The OpenACC API provides data directives and clauses to control this behavior where it is required. This paper describes how the data model is supported in current OpenACC implementations, ranging from research compilers (OpenUH and OpenARC) to a commercial compiler (the PGI OpenACC compiler). This includes implementation of the data directives and clauses, testing whether the data is already present on the device, OpenCL support, managing asynchronous data transfers and memory allocations, handling aliased data, reusing device memory, managing partially present data, and support for shared memory between host and device. Lastly, it also discusses on-going work to manage large, complex dynamic data structures.

Wolfe, Michael↗
DOE OSTI2025

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗
DOE OSTI2024

Intelligent Hierarchical Resilient Operation of Distribution Systems: Implementation and Validation in a Power Hardware-in-the-Loop Simulation Testbed

This paper reports on the structure of a power hardware-in-the-loop (PHIL) simulation testbed that implements, tests, and validates a novel AI-based hierarchical resilient operation model for distribution systems. The testbed implements the central and distributed controllers of the hierarchical resilient operation model and integrates a Digital Real-Time Simulator (DRTS), protective relays, a Real-Time Automation Controller (RTAC), a Software Defined Network (SDN) switch, and a battery energy storage (BES) system. The testbed provides comprehensive real-time visualization and monitoring capability as an advanced situational awareness and operator interface solution. The IEEE 33-node system is used as a test case to test and validate the operation of the model in normal operation and recovery operation after major outages in a fully automated fashion.

Ganjkhani, Mehdi↗
DOE OSTI2014

Design, Implementation, and Evaluation of a Hybrid DS/FFH Spread-Spectrum Radio Transceiver

In recent years there has been great interest in using hybrid spread-spectrum (HSS) techniques for commercial applications, particularly in the Smart Grid, in addition to their inherent uses in military communications. This is because HSS can accommodate high data rates with high link integrity, even in the presence of significant multipath effects and interfering signals. A highly useful form of this transmission technique for many types of command, control, and sensing applications is the specific code-related combination of standard direct-sequence modulation with "fast" frequency-hopping, denoted hybrid DS/FFH, wherein multiple frequency hops occur within a single data-bit time. In this paper, we present the efforts carried out at Oak Ridge National Laboratory toward exploring the design, implementation, and evaluation of a hardware prototypic hybrid DS/FFH spread-spectrum radio transceiver using a single Field Programmable Gate Array (FPGA). The high integration within a single FPGA allows the various subsystems to easily communicate with each other and thereby maintain tight synchronization. We investigate various hopping sequences against robustness to interference and jamming. Experimental results are presented to show the receiver sensitivity, radio data rate evaluation, and jamming-rejection capability of the implemented hybrid DS/FFH spread-spectrum system under widely varying design parameters.

direct-sequence↗
DOE OSTI2020

Implementing Online Oscillation Monitoring and Forced Oscillation Source Locating at Peak Reliability

This paper introduces a framework of online oscillation monitoring systems and forced oscillation detection & source location tools that Peak Reliability ('PEAK') has implemented for the Reliability Coordinator (RC) function of the Western Interconnection. The framework consists of four main components: (1) Montana Tech's Modal Analysis Software (MAS) engine; (2) Washington State University's Oscillation Monitor System (OMS) software; (3) Forced Oscillation Detection and Source Location Algorithms (FODSL); and (4) PEAK in-house visualization tool and alarming logic built in PI Processbook. The framework has been validated and applied for real system oscillation studies successfully. Implementation experience and lessons learned will be discussed in the paper.

14 SOLAR ENERGY↗
DOE OSTI2021

Transactive Implementation of Decentralized Electricity Market for Grid-Edge Systems

The electricity landscape is evolving towards more decentralized approaches due to the proliferation of distributed energy resources and the participation of increasingly smart consumers and producers (prosumers). Recent advances in information and communication technologies and smart metering, provides strategic opportunities for “prosumers” to reform their conventional energy practices towards more consumer-centric economies. From an operational perspective, managing power distribution networks is becoming more difficult with such active grid-edge systems providing limited to no visibility or control. Transactive Energy (TE) has been emerging as a key enabler towards effectively and efficiently integrating prosumers into competitive electricity markets. This work presents a transactive implementation of community-centric markets. A co-simulation framework is developed for evaluating the proposed market structure with high-fidelity models. Case studies on the IEEE-123 node test system demonstrate that community-centric transactive markets can enable communities of prosumers to operate collaboratively as grid-edge systems. The potential benefits of implementing community-centric TE systems are also illustrated.

transactive, microgrids, centralized market operat↗
DOE OSTI2013

Parallel Implementation of Power System Dynamic Simulation

Dynamic simulation of power system transient stability is important for planning, monitoring, operation, and control of electrical power systems. However, modeling the system dynamics and network involves the computationally intensive time-domain solution of numerous differential and algebraic equations (DAE). This results in a transient stability implementation that may not maintain the real-time constraints of an online security assessment. This paper presents a parallel implementation of the dynamic simulation on a high-performance computing (HPC) platform using parallel simulation algorithms and computation architectures. It enables the simulation to run even faster than real time, enabling the “look-ahead” capability of upcoming stability problems in the power grid.

dynamic simulation↗
DOE OSTI2014

Efficient Implementation of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor

This paper presents the implementation and performance of the highly accurate CCSD(T) quantum chemistry method on the Intel Xeon Phi coprocessor within the context of the NWChem computational chemistry package. The widespread use of highly correlated methods in electronic structure calculations is contingent upon the interplay between advances in theory and the possibility of utilizing the ever-growing computer power of emerging heterogeneous architectures. We discuss the design decisions of our implementation as well as the optimizations applied to the compute kernels and data transfers between host and coprocessor. We show the feasibility of adopting the Intel Many Integrated Core Architecture and the Intel Xeon Phi coprocessor for developing efficient computational chemistry modeling tools. Remarkable scalability is demonstrated by benchmarks. Our solution scales up to a total of 62560 cores with the concurrent utilization of Intel Xeon processors and Intel Xeon Phi coprocessors.

Environmental Molecular Sciences Laboratory↗
DOE OSTI2016

Architecture and Implementation of OpenPET Firmware and Embedded Software

OpenPET is an open source, modular, extendible, and high-performance platform suitable for multi-channel data acquisition and analysis. Due to the versatility of the hardware, firmware, and software architectures, the platform is capable of interfacing with a wide variety of detector modules not only in medical imaging but also in homeland security applications. Analog signals from radiation detectors share similar characteristics-a pulse whose area is proportional to the deposited energy and whose leading edge is used to extract a timing signal. As a result, a generic design method of the platform is adopted for the hardware, firmware, and software architectures and implementations. The analog front-end is hosted on a module called a Detector Board, where each board can filter, combine, timestamp, and process multiple channels independently. The processed data is formatted and sent through a backplane bus to a module called Support Board, where 1 Support Board can host up to eight Detector Board modules. The data in the Support Board, coming from 8 Detector Board modules, can be aggregated or correlated (if needed) depending on the algorithm implemented or runtime mode selected. It is then sent out to a computer workstation for further processing. The number of channels (detector modules), to be processed, mandates the overall OpenPET System Configuration, which is designed to handle up to 1,024 channels using 16-channel Detector Boards in the Standard System Configuration and 16,384 channels using 32-channel Detector Boards in the Large System Configuration.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2016

Implementation and Tuning of Batched Cholesky Factorization and Solve for NVIDIA GPUs

Many problems in engineering and scientific computing require the solution of a large number of small systems of linear equations. Due to their high processing power, Graphics Processing Units became an attractive target for this class of problems, and routines based on the LU and the QR factorization have been provided by NVIDIA in the cuBLAS library. This work addresses the situation where the systems of equations are symmetric positive definite. The paper describes the implementation and tuning of the kernels for the Cholesky factorization and the forward and backward substitution. Targeted workloads involve the solution of thousands of linear systems of the same size, where the focus is on matrix dimensions from 5 by 5 to 100 by 100. Due to the lack of a cuBLAS Cholesky factorization, execution rates of cuBLAS LU and cuBLAS QR are used for comparison against the proposed Cholesky factorization in this work. Execution rates of forward and backward substitution routines are compared to equivalent cuBLAS routines. Comparisons against optimized multicore implementations are also presented. Superior performance is reached in all cases.

Computer Science↗