Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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,567 records · Page 87

Application of the variational autoencoder to detect the critical points of the anisotropic Ising model

We generalize the previous study on the application of variational autoencoders to the two-dimensional Ising model to a system with anisotropy. Due to the self-duality property of the system, the critical points can be located exactly for the entire range of anisotropic coupling. This presents an excellent test bed for the validity of using a variational autoencoder to characterize an anisotropic classical model. Furthermore, we reproduce the phase diagram for a wide range of anisotropic couplings and temperatures via a variational autoencoder without the explicit construction of an order parameter. Considering that the partition function of ($d$ + 1)-dimensional anisotropic models can be mapped to that of the $d$-dimensional quantum spin models, the present study provides numerical evidence that a variational autoencoder can be applied to analyze quantum systems via the quantum Monte Carlo method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Qudit Dynamical Decoupling on a Superconducting Quantum Processor

Multilevel qudit systems are increasingly being explored as alternatives to traditional qubit systems due to their denser information storage and processing potential. However, qudits are more susceptible to decoherence than qubits due to increased loss channels, noise sensitivity, and crosstalk. To address these challenges, we develop protocols for dynamical decoupling (DD) of qudit systems based on the Heisenberg-Weyl group. We implement and experimentally verify these DD protocols on a superconducting transmon processor that supports qudit operation based on qutrits (d = 3) and ququarts (d = 4). Specifically, we demonstrate single-qudit DD sequences to decouple qutrits and ququarts from system-bath-induced decoherence. Here we also introduce two-qudit DD sequences designed to suppress the detrimental cross-Kerr couplings between coupled qudits. This allows us to demonstrate a significant improvement in the fidelity of time-evolved qutrit Bell states. Our results highlight the utility of leveraging DD to enable scalable qudit-based quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constrained GAN-Generated X-Ray CT Data For Self-Supervised And Foundation-Model Segmentation Of Concrete Microstructures

Three-dimensional characterization of materials using X-ray computed tomography (XCT) is challenging due to the complexity of internal structures, noise, and variations in resolution. Traditional computer vision models often struggle to accurately segment these images, particularly in domain-specific applications like materials science. While supervised deep learning approaches have been developed to address the limitations of conventional algorithms, they typically require large amounts of labeled training data and often fail to generalize across different datasets. Self-supervised, few-and zero-shot learning methods have gained prominence in natural image processing and segmentation tasks, but their application to scientific imaging remains limited due to the unique structural complexity, noise, and textural artifacts present in materials science data. In this work, we investigate how domain adaptation, leveraging physics-based and GAN-generated synthetic data, impacts segmentation performance. We introduce a modified Contrastive Unpaired Translation (CUT) model designed to generate realistic labeled data, which can be used for training, pre-training, and fine-tuning segmentation models for real XCT microstructure data. We evaluate the performance of two segmentation approaches: a self-supervised network (SSL-ALPNet) and a foundation model (Segment Anything Model), assessing their improvements when pre-trained and/or fine-tuned on the synthesized data. Our results demonstrate that leveraging synthetic data significantly enhances segmentation performance, particularly in challenging materials science applications.

Ziabari, Amir [ORNL] (ORCID:000000034776457X)↗

A General State Estimation Formulation for Three-Phase Unbalanced Power Systems

Almost all of the three-phase state estimation algorithms assume existence of a reference bus whose phase angles are perfectly balanced. This assumption is quite realistic for transmission systems, and also for most distribution systems that are connected to a strong transmission system where transmission side can modeled by a balanced reference bus. However, for distribution systems having high penetration of renewable sources or for microgrids operating in islanded mode, the assumption of a balanced reference bus will not be realistic. While there are recent publications focusing on this problem, formulation of the three-phase unbalanced state estimation problem with proper treatment of the reference bus remains unaddressed. In this paper, a new formulation will be described where an accurate state estimation solution can be obtained for any unbalanced threephase system irrespective of its operating conditions (balanced or highly unbalanced), configuration (isolated microgrid, connected to transmission system, etc.) and whether or not it contains any synchronous generators. Validation of the proposed formulation will be carried out via simulations.

State Estimation, Distribution System, Unbalanced ↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Quantum Search Compiler (Qsearch) v2.0

Quantum Gate Synthesis is the process of taking a desired quantum gate operation, in this case specified as a unitary matrix, and decomposing it into a list of operations that can actually be performed on a quantum computer. Qsearch is an implementation of a quantum synthesis algorithm based on combining A* search with numerical optimization. It is designed to minimize CNOT count at the expense of having a long runtime. It produces particularly efficient quantum circuits in terms of CNOT count, up until about 4 qubits. It is generally impractical to run Qsearch on circuits with more than 4 qubits, but it can be used as a subroutine in algorithms designed to work with these larger circuits. Qsearch takes the form of a Python package, taking advantage of Numpy and Scipy, with part of the package written in Rust and taking advantage of OpenBLAS, NLOPT, and Google Ceres for faster runtime.

Lancu, Costin↗

Peer-to-Peer Energy Management System for Distributed Microgrid Coordination [SWR-21-92]

Resiliency is one of the key challenges in today's power system. Natural disasters and cyber-attacks both can limit communications between microgrids and the central management system. Thus, having a Distributed Microgrid Coordination (DMC) algorithm can improve the system resiliency, which enables the microgrids to operate without communication with the central management system. Peer-to-Peer Energy Management System for Distributed Microgrid Coordination adopts a primal-dual approach, where each microgrid controller keeps a local estimate of the dual variables. The estimate is updated with local measurements and peer-to-peer communication, leading to a fully distributed algorithm. While the DMC is developed for microgrid coordination, it can be used for general distributed control purpose.

Li, Yashen↗

Comparison of ozone formation attribution techniques in the northeastern United States

The Integrated Source Apportionment Method (ISAM) has been revised in the Community Multiscale Air Quality (CMAQ) model. This work updates ISAM to maximize its flexibility, particularly for ozone (O 3 ) modeling, by providing multiple attribution options, including products inheriting attribution fully from nitrogen oxide reactants, fully from volatile organic compound (VOC) reactants, equally from all reactants, or dynamically from NO x or VOC reactants based on the indicator gross production ratio of hydrogen peroxide (H 2 O 2 ) to nitric acid (HNO 3 ). The updated ISAM has been incorporated into the most recent publicly accessible versions of CMAQ (v5.3.2 and beyond). This study's primary objective is to document these ISAM updates and demonstrate their impacts on source apportionment results for O 3 and its precursors. Additionally, the ISAM results are compared with the Ozone Source Apportionment Technology (OSAT) in the Comprehensive Air-quality Model with Extensions (CAMx) and the brute-force method (BF). All comparisons are performed for a 4 km horizontal grid resolution application over the northeastern US for a selected 2 d summer case study (9 and 10 August 2018). General similarities among ISAM, OSAT, and BF results add credibility to the new ISAM algorithms. However, some discrepancies in magnitude or relative proportions among tracked sources illustrate the distinct features of each approach, while others may be related to differences in model formulation of chemical and physical processes. Despite these differences, OSAT and ISAM still provide useful apportionment data by identifying the geographical and temporal contributions of O 3 and its precursors. Both OSAT and ISAM attribute the majority of O 3 and NO x contributions to boundary, mobile, and biogenic sources, whereas the top three contributors to VOCs are found to be biogenic, boundary, and area sources.

54 ENVIRONMENTAL SCIENCES↗

Extensions of the space trajectories error analysis programs

A generalized covariance analysis technique which permits the study of the sensitivity of linear estimation algorithms to errors in a priori statistics has been developed and programed. Several sample cases are presented to illustrate the use of this technique. Modifications to the Simulated Trajectories Error Analysis Program (STEAP) to enable targeting a multiprobe mission of the Planetary Explorer type are discussed. The logic for the mini-probe targeting is presented. Finally, the initial phases of the conversion of the Viking mission Lander Trajectory Reconstruction (LTR) program for use on Venus missions is discussed. An integrator instability problem is discussed and a solution proposed.

Adams, G. L.↗

Some mesh generation requirements and methods

Discretized solution algorithms, which find solutions of field equations in a two or three dimensional field, generally use meshes which are fitted to the field boundary to allow convenient formulation of boundary conditions there. A mesh is defined to be the image of a rectangular grid in computational space under a mesh mapping which maps computational space into physical space. It is not necessary that all of computational space be mapped onto the region of interest in physical space. Parts of it can be excised to give a better fit to the boundary. Many different excisions can be made to fit a single boundary; the choice depends on the mesh arrangement desired in the field.

Dickson, L. J.↗

Theoretical and experimental analysis of laser altimeters for barometric measurements over the ocean

The statistical characteristics and the waveforms of ocean-reflected laser pulses are studied. The received signal is found to be corrupted by shot noise and time-resolved speckle. The statistics of time-resolved speckle and its effects on the timing accuracy of the receiver are studied in the general context of laser altimetry. For estimating the differential propagation time, various receiver timing algorithms are proposed and their performances evaluated. The results indicate that, with the parameters of a realistic altimeter, a pressure measurement accuracy of a few millibars is feasible. The data obtained from the first airborne two-color laser altimeter experiment are processed and analyzed. The results are used to verify the pressure measurement concept.

Tsai, B. M.↗

Table look-up estimation of signal and noise parameters from quantized observables

A table look-up algorithm for estimating underlying signal and noise parameters from quantized observables is examined. A general mathematical model is developed, and a look-up table designed specifically for estimating parameters from four-bit quantized data is described. Estimator performance is evaluated both analytically and by means of numerical simulation, and an example is provided to illustrate the use of the look-up table for estimating signal-to-noise ratios commonly encountered in Voyager-type data.

Vilnrotter, V. A.↗

Reliability analysis in intelligent machines

Given an explicit task to be executed, an intelligent machine must be able to find the probability of success, or reliability, of alternative control and sensing strategies. By using concepts for information theory and reliability theory, new techniques for finding the reliability corresponding to alternative subsets of control and sensing strategies are proposed such that a desired set of specifications can be satisfied. The analysis is straightforward, provided that a set of Gaussian random state variables is available. An example problem illustrates the technique, and general reliability results are presented for visual servoing with a computed torque-control algorithm. Moreover, the example illustrates the principle of increasing precision with decreasing intelligence at the execution level of an intelligent machine.

Mcinroy, John E.↗

Interplanetary Program to Optimize Simulated Trajectories (IPOST). Volume 2: Analytic manual

The Interplanetary Program to Optimize Space Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence of trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the cost function. Targeting and optimization is performed using the Stanford NPSOL algorithm. IPOST structure allows subproblems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Hong, P. E.↗

Supercomputing '91; Proceedings of the 4th Annual Conference on High Performance Computing, Albuquerque, NM, Nov. 18-22, 1991

Various papers on supercomputing are presented. The general topics addressed include: program analysis/data dependence, memory access, distributed memory code generation, numerical algorithms, supercomputer benchmarks, latency tolerance, parallel programming, applications, processor design, networks, performance tools, mapping and scheduling, characterization affecting performance, parallelism packaging, computing climate change, combinatorial algorithms, hardware and software performance issues, system issues. (No individual items are abstracted in this volume)

Source record↗