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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Matter power spectra in modified gravity: a comparative study of approximations and N -body simulations

ABSTRACT Testing gravity and the concordance model of cosmology, $\Lambda$CDM, at large scales is a key goal of this decade’s largest galaxy surveys. Here we present a comparative study of dark matter power spectrum predictions from different numerical codes in the context of three popular theories of gravity that induce scale-independent modifications to the linear growth of structure: nDGP, Cubic Galileon, and K-mouflage. In particular, we compare the predictions from N-body simulations solving the full scalar field equation, two N-body codes with approximate time integration schemes, a parametrized modified N-body implementation, and the analytic halo model reaction approach. We find the modification to the $\Lambda$CDM spectrum is in 2 per cent agreement at $z\le 1$ and $k\le 1~h\,{\rm Mpc}^{-1}$ over all gravitational models and codes, in accordance with many previous studies, indicating these modelling approaches are robust enough to be used in forthcoming survey analyses under appropriate scale cuts. We further make public the new code implementations presented, specifically the halo model reaction K-mouflage implementation and the relativistic Cubic Galileon implementation.

Bose, B. (ORCID:0000000319658614)↗
DOE OSTI2022

Quantum state preparation by adiabatic evolution with custom gates

Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These implementation times can be significantly reduced by realizing these circuits with custom gates. Using classical computing, we model the output of a realistic two-qubit processor implementing the adiabatic evolution of a two-spin system by means of custom gates. This modeled output is then compared with the results of quantum simulations solving the same problem on IBM Quantum (IBMQ) systems. Additionally, when used to emulate the behavior of the IBMQ quantum circuit, our realistic model yields state fidelities ranging from 65% to 85%, similar to the actual performance of a diverse set of IBMQ devices. When we reduced the implementation time by using custom gates, however, the loss of fidelity was reduced by at least a factor of 4, allowing us to accurately extract the energy of the target state. This improvement is enough to render adiabatic evolution useful for quantum state preparation for small systems or as a preconditioner for other state preparation methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Neutral-atom entanglement using adiabatic Rydberg dressing

Here we revisit the implementation of a two-qubit entangling gate, the Mølmer-Sørensen gate, using the adiabatic Rydberg dressing paradigm for neutral atoms as studied in [A. Mitra et al., Phys. Rev. A 101, 030301(R) (2020)]. We study the implementation of rapid adiabatic passage using a two-photon transition, which does not require the use of an ultraviolet laser, and can be implemented using only amplitude modulation of one field with all laser frequencies fixed. We find that entangling gate fidelities, comparable to the one-photon excitation, are achievable with the two-photon excitation. Moreover, we address how the adiabatic dressing protocol can be used to implement entangling gates outside the regime of a perfect Rydberg blockade. We show that, by using adiabatic dressing, we can achieve scaling of the gate fidelity set by the fundamental limits to entanglement generated by the Rydberg interactions while simultaneously retaining a limited population in the doubly excited Rydberg state. This allows for fast high-fidelity gates for atoms separated beyond the blockade radius.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Combinatorial split-ring and spiral metaresonator for efficient magnon-photon coupling

Developing hybrid materials and structures for electromagnetic wave engineering has been a promising route towards novel functionalities and tunabilities in many modern applications. Despite its established success in engineering optical light and terahertz waves, the implementation of metaresonators operating in the microwave band is still emerging, especially the implementation of metaresonators that allow on-chip integration and size miniaturization, which is crucial for developing hybrid quantum systems in the microwave band. In this work, we present a microwave metaresonator consisting of split-ring and spiral resonators, and implement it for the investigation of photon-magnon coupling for hybrid magnonic applications. We observe broadened bandwidth of the split-ring modes augmented by the additional spiral resonator, and, by coupling the modes to a magnetic sample, the resultant photon-magnon coupling can be significantly enhanced by more than tenfold. Furthermore, our work suggests that combinatorial, hybrid microwave resonators may be a promising approach towards future development and implementation of photon-magnon coupling in hybrid magnonic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Dark Energy Survey Year 3 results: Simulation-based cosmological inference with wavelet harmonics, scattering transforms, and moments of weak lensing mass maps. Validation on simulations

Beyond-two-point statistics contain additional information on cosmological as well as astrophysical and observational (systematics) parameters. In this methodology paper we provide an end-to-end simulationbased analysis of a set of Gaussian and non-Gaussian weak lensing statistics using detailed mock catalogs of the Dark Energy Survey (DES). Here, we implement: 1) second and third moments; 2) wavelet phase harmonics (WPH); 3) the scattering transform (ST). Our analysis is fully based on simulations, it spans a space of seven $νw$CDM cosmological parameters, and it forward models the most relevant sources of systematics of the data (masks, noise variations, clustering of the sources, intrinsic alignments, and shear and redshift calibration). We implement a neural network compression of the summary statistics, and we estimate the parameter posteriors using a likelihood-free-inference approach. We validate the pipeline extensively, and we find that WPH exhibits the strongest performance when combined with second moments, followed by ST, and then by third moments. The combination of all the different statistics further enhances constraints with respect to second moments, up to 25 percent, 15 percent, and 90 percent for S 8 , Ω m , and the figure-of-merit FoM S8;Ωm , respectively. We further find that non-Gaussian statistics improve constraints on w and on the amplitude of intrinsic alignment with respect to second moments constraints. The methodological advances presented here are suitable for application to Stage IV surveys from Euclid, Rubin-LSST, and Roman with additional validation on mock catalogs for each survey. In a companion paper we present an application to DES Year 3 data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Dark Energy Survey Year 3 results: Simulation-based cosmological inference with wavelet harmonics, scattering transforms, and moments of weak lensing mass maps. II. cosmological results

Here, we present a simulation-based cosmological analysis using a combination of Gaussian and non-Gaussian statistics of the weak lensing mass (convergence) maps from the first three years of the Dark Energy Survey. We implement the following: (1) second and third moments; (2) wavelet phase harmonics; (3) the scattering transform. Our analysis is fully based on simulations, spans a space of seven 𝑤 Cold Dark Matter (𝑤⁢ CDM) cosmological parameters, and forward models the most relevant sources of systematics inherent in the data: masks, noise variations, clustering of the sources, intrinsic alignments, and shear and redshift calibration. We implement a neural network compression of the summary statistics, and we estimate the parameter posteriors using a simulation-based inference approach. Including and combining different non-Gaussian statistics is a powerful tool that strongly improves constraints over Gaussian statistics (in our case, the second moments); in particular, the figure of merit (𝑆 8 , Ω m ) is improved by 70% (Λ ⁢CDM) and 90% (𝑤 ⁢CDM). When all the summary statistics are combined, we achieve a 2% constraint on the amplitude of fluctuations parameter 𝑆 8 ≡ 𝜎 8 ⁢(Ω m /0.3) 0.5 , obtaining 𝑆 8 = 0.794 ±0.017 (Λ⁢ CDM) and 𝑆 8 = 0.817 ±0.021 (𝑤 ⁢CDM), and a ∼10% constraint on Ω m , obtaining Ω m =0.259 ±0.025 (Λ ⁢CDM) and Ω m = 0.273 ±0.029 (𝑤⁢ CDM). In the context of the 𝑤⁢ CDM scenario, these statistics also strengthen the constraints on the parameter 𝑤, obtaining 𝑤 <−0.72. The constraints from different statistics are shown to be internally consistent (with a 𝑝-value>0.1 for all combinations of statistics examined). We compare our results to other weak lensing results from the first three years of the Dark Energy Survey data, finding good consistency; we also compare with results from external datasets, such as planck constraints from the cosmic microwave background, finding statistical agreement, with discrepancies no greater than <2.2⁢𝜎.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Circulating Current Reduction of Back-to-Back MMC with Advanced Grid-Support Functionalities for Medium-Voltage Applications

A Lyapunov energy function based circulating current reduction scheme for a back to back modular multilevel converter based system for a microgrid application has been proposed in this digest. In order to ensure no circulating or zero sequence currents within the modules, the dynamics from one leg of the converter to the other are evaluated. A Lyapunov energy function is then developed and utilizing the circulating current dynamics of the converter the overall control law is implemented. In this digest a decentralized hierarchical control architecture has been implemented for the main current control; where the outer loop or the central controller implements the higher level grid interconnection functions as per IEEE 1547-2018 standards and the inner loop based on synchronous reference frame implements the current control architecture. The inner loops' outputs are the commanded converter voltages either on either side which are augmented by the Lyapunov energy function based circulating current suppression architecture. To evaluate the efficacy of the overall system, the overall system is modeled around a 300kVA back to back SiC multilevel modular converter used as a direct-connected medium voltage (MV) grid intertie based on MATLAB/Simulink domain. Several important case studies are presented in this paper to prove the effectiveness of the proposed architecture. case study results are presented.

circulating current↗
DOE OSTI2020

Distributed Detection of Malicious Attacks on Consensus Algorithms with Applications in Power Networks

Consensus-based distributed algorithms are well suited for coordination among agents in a cyber-physical system. These distributed schemes, however, suffer from their vulnerability to cyber attacks that are aimed at manipulating data and control ow. In this article, we present a novel distributed method for detecting the presence of such intrusions for a distributed multi-agent system following ratio consensus. We employ a Max-Min protocol to develop low cost, easy to implement detection strategies where each participating node detects the intrusion independently, eliminating the need for a trusted certifying agent in the network. The effectiveness of the detection method is demonstrated by numerical simulations on a 1000 node network to demonstrate the efficacy and simplicity of implementation.

27 ARPA - Advanced Research Projects Agency-Energy↗
DOE OSTI2020

Grid Application and Controls Development for Medium-Voltage SiC-Based Grid Interconnects

This paper studies, the grid-interconnection requirements of directly connected medium-voltage (MV) Silicon Carbide-based (SiC-based) converters and details the necessary control implementations. These power electronic converters follow the interconnection standard IEEE 1547-2018, but can also have additional controls supported by the microgrid standards in IEEE 2030.7, which is demonstrated in this work. Additionally, this paper defines the grid applications realized by these directly connected medium-voltage power electronic converters at the distribution scale and demonstrates results. The controls for the studied grid applications are then developed and implemented on the controller. The paper also includes details of the control algorithm development and validations of the control algorithm through hardware-in-the-loop results.

28 EE - Advanced Manufacturing Office (EE-5A)↗
DOE OSTI2023

Isolated Single-stage Three-phase AC/DC Converter using Bidirectional Switches

The advent of the SiC Bidirectional FET (BiDFET), a monolithic 1.2 kV bidirectional switch, has rendered the single-stage three-phase AC/DC converter topology a promising approach for implementing AC/DC converters. This topology, which integrates a full-bridge converter with a single-phase to three-phase matrix converter via a high-frequency transformer, is particularly suitable for applications requiring galvanic isolation, buck-boost functionality, and bidirectional power flow. The single-stage design eliminates the need for bulky and unreliable electrolytic capacitors, and utilizes a single magnetic component for power transfer. In the matrix converter, bidirectional switches, which were traditionally implemented using combinations of multiple semiconductor devices such as MOSFETs, IGBTs, and diodes, can now be realized using the single-chip solution, BiDFET. This advancement leads to a lower switch count, compact converter implementation, with lower inductance commutation cells, thereby enhancing the overall efficiency and compactness of the system. The paper presents a unified model of the converter, considering all control parameters, including the duty cycles and phase shift of transformer voltages. Detailed expressions for power transfer, transformer currents, and currents at AC and DC ports are provided. Additionally, the paper outlines the conditions necessary for soft-switching of all switches and the commutation schemes required for the practical implementation of the matrix converter modulation scheme. A hardware prototype of a 10 kW, 480 VRMS, LL/ 800 V AC/DC system has been developed, and experimental results are presented to demonstrate its performance.

BiDFET↗
DOE OSTI2023

Cost-Benefit Analysis of Grid-Supportive Loads for Fast Frequency Response

Flexibility in inverter-based loads could be used to support the converter-dominated power grid by offering a rapid, autonomous, and adjustable power reserve during system transients to help maintain system stability. Based on technical potential, ancillary service (AS) value, and implementation costs, this study illustrates the cost-benefit analysis of grid-supportive loads (GSLs) for the supply of fast frequency response (FFR). The net benefit for each GSL is demonstrated using a case study and relevant data sources. The findings suggest that implementation costs for enabling GSL features are low compared to the value that grid operators get from the acquisition of responsive reserve services. The authors believe that, given the rising popularity of renewable energy sources, GSLs can be a useful tool for grid stability in low-inertia systems.

cost-benefit analysis↗
DOE OSTI2023

Machine Learning Models for Network Traffic Classification in Programmable Logic

Network traffic classification via machine learning on network packet payloads has emerged as an active area of research for network security due to the high accuracy machine learning models have achieved in classifying payloads. For effective deployment as part of network security, these machine learning models must not only classify malicious packet payloads accurately, they must also identify anomalous payloads and perform inference at speeds generally faster than 10,000 packets per second to be effective. This work explores the in- ference speeds and accuracy of several neural network models implemented in programmable logic on various field programmable gate arrays (FPGA) including the Xilinx VC1902 and Xilinx Zynq Ultrascale+. This work also presents the design and performance of both an autoencoder and variational autoencoder programmed on the FPGA for identifying anomalous packet payloads. The performance benefits of the FPGA implementation for this type of packet payload inspection driven by machine learning are compared against graphics processing unit (GPU) inference implementations run on two state-of-the-art datacenter GPU devices, the NVIDIA V100 and A100. The model accuracy difference between the FPGA and GPU implementations was found to be 4% or less while the Xilinx VC1902 outperformed both the NVIDIA V100 and A100 for inference speeds on all the models explored except the variational autoencoder.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Composable Programming of Hybrid Workflows for Quantum Simulation

We present a composable design scheme for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. Our object-oriented approach is based on constructing an expressive set of common data structures and methods that enable programming of a broad variety of complex hybrid quantum simulation applications. The abstract core of our scheme is distilled from the analysis of the current quantum simulation algorithms. Subsequently, it allows a synthesis of new hybrid algorithms and workflows via the extension, specialization, and dynamic customization of the abstract core classes defined by our design. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library. To validate our implementation, we test and show its utility on commercial quantum processors from IBM, running some prototypical quantum simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

LOGAN: High-Performance GPU-Based X-Drop Long-Read Alignment

Pairwise sequence alignment is one of the most computationally intensive kernels in genomic data analysis, accounting for more than 90% of the runtime for key bioinformatics applications. This method is particularly expensive for third-generation sequences due to the high computational cost of analyzing sequences of length between 1Kb and 1Mb. Given the quadratic overhead of exact pairwise algorithms for long alignments, the community primarily relies on approximate algorithms that search only for high-quality alignments and stop early when one is not found. In this work, we present the first GPU optimization of the popular X-drop alignment algorithm, that we named LOGAN. Results show that our high-performance multi-GPU implementation achieves up to 181.6 GCUPS and speed-ups up to 6.6× and 30.7× using 1 and 6 NVIDIA Tesla V100, respectively, over the state-of-the-art software running on two IBM Power9 processors using 168 CPU threads, with equivalent accuracy. We also demonstrate a 2.3× LOGAN speed-up versus ksw2, a state-of-art vectorized algorithm for sequence alignment implemented in minimap2, a long-read mapping software. Furthermore, to highlight the impact of our work on a real-world application, we couple LOGAN with a many-to-many long-read alignment software called BELLA, and demonstrate that our implementation improves the overall BELLA runtime by up to 10.6×. Finally, we adapt the Roofline model for LOGAN and demonstrate that our implementation is near optimal on the NVIDIA Tesla V100s.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bi-Level Linear Programming Model for Automatic Load Shedding: A Distributed Wide-Area Measurement System-based Solution

Load shedding is currently implemented as a two-step based approach. In the first step, manual load shedding is taken place, were system operators, using estimates, inform distribution utilities of predicted stressful conditions. Information provided include the potential use of energy reserves, as well as load shedding amount. In a second step, automatic load shedding is done. The latter is realized using protection relays. While considering frequency variation, pre-defined values of load to be shed and correspondent number of stages for such to be realized are transformed into relay settings. Under-frequency protection relays use only local measurements towards decision making, thus operate in a decentralized architecture. Decision making is done in milliseconds plus breaker time. While this approach has provided much system reliability, considering the new smart grid paradigm, where system dynamics are much faster due to increasing renewable resources penetration, in some operating conditions it will generate sub-optimal solutions, such as islanding. Phasor measurement units provide a source of information which can be useful for this problem. Centralized architecture-based solutions for automatic load shedding, as present in the state-of-the-art, require though total processing times which are not acceptable for real-life implementation. In this work, considering the above, a bi-level linear programming model is presented. The model is implemented considering a distributed architecture while leveraging phasor measurement units data. The upper-level model estimates the current system state. Results of this model are embedded in a lower-level model, which decision variables are the location and load value to be shed. Easy-to-implement model, built-on the classic weighted least squares solution, highlight potential aspects towards real-life applications.

Bretas, Arturo Suman↗
DOE OSTI2022

Autonomous Wireless Technology Detection in Seamless IoT Applications

The ever-increasing use of Internet of Things (IoT) devices results in the implementation of multiple wireless technologies that would not only cater their data rate requirements but also support various applications. To optimize the energy efficiency and security of the wireless transmission, it is imperative to identify the wireless technologies in various IoT implementations. Many of the existing approaches are based on measuring only the receiving signal strength indicator (RSSI). However, such approaches may not work well because of transmit power control and complex channel variations among different wireless technologies. In this article, we propose an autonomous wireless detection scheme that considers multiple distinguishable physical (PHY)-layer settings for real-time identification of wireless technologies for real-time applications. Specifically, the proposed scheme relies on the PHY-layer measurements of the targeted spectrum. Transmission settings, such as bandwidth, carrier frequency, and RSSI are estimated from the raw in-phase and quadrature-phase (I/Q) measurements. In addition, a symbol-level extraction scheme is implemented to extract unique features of modulation settings. These aforementioned features are applied to a machine learning process to identify the received wireless technologies. Compared with raw I/Q measurements, the extracted features are much simplified and, thus, the machine learning classifier can be designed with a simple structure for fast processing on IoT nodes. Finally, the proposed schemes are primarily evaluated theoretically, followed by implementing them on a USRP software-defined radio (SDR)-based hardware testbed. The evaluation results demonstrate high accuracy in the real-time detection of different wireless technologies for seamless IoT applications.

42 ENGINEERING↗
DOE OSTI2023

The BiDFET Device and Its Impact on Converters

The matrix converter topology for direct ac-to-ac conversion offers elimination of the bulky and unreliable D.C. link capacitors used in the popular Voltage-Source Inverter (VSI) with a front-end rectifier. The resulting more compact and higher efficiency implementation is a desirable solution for a wide variety of applications, such as photovoltaic energy generation, motor drives, and energy storage systems. The development of matrix converters has been hampered by the lack of availability of commercial bidirectional power switches with the ability to block high voltages in the first and third quadrants, carry on state current in both quadrants with low voltage drop, exhibit large forward-biased safe-operating-area (FBSOA), and low switching power losses. Consequently, many implementations have been tried in the past using discrete devices, as listed in Table I. Two implementations utilize commonly available asymmetric blocking IGBTs, while two cases make use of SiC power MOSFETs. They generally have a large parts count (4-6 individual switches) that occupies significant space in the converter where multiple bi-directional switches are required. They also have a high on-state voltage drop that degrades efficiency. As a result, one implementation utilizes symmetric blocking IGBT to achieve a low parts count (2), but its switching losses are unacceptably high.

42 ENGINEERING↗
DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗