Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hybrid algorithms”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Learning From User Behavior: A Survey-Assist Algorithm for Longitudinal Mobility Data Collection

GPS-based travel surveys are widely used in mobility studies to gather crucial qualitative data, like purpose, transportation mode and replaced mode. However, survey response still poses a burden to users, especially in long-term mobility studies, leading to response fatigue. We explore a survey-assist strategy to ease this burden by a novel, user-level modeling approach that leverages past responses from each user to predict responses for new trips, without relying on external data sources like GIS data. We investigate three main algorithms for predicting responses: (i) clustering trips and extrapolating responses for similar trips, (ii) using random forest classification, and (iii) clustering that uses a hybrid algorithm to determine spatial structure, which is then fed as input to a classic random forest classifier. The clustering approach can flexibly predict responses for even complex qualitative survey questions; it achieved F-scores of 65%. The random forest pipeline uses architecture that restricts it to predicting three predetermined survey questions: trip purpose, mode, and replaced mode. However, it achieved F-scores of 78%. While the survey-assist approach has been implemented by several proprietary systems, to our knowledge, this is the first exploration in the academic literature. It follows that this is also the first rigorous evaluation of multiple algorithms that can implement the approach. The evaluation uses a large scale, publicly available, longitudinal dataset consisting of ~ 92k trips from 235 users over a period of roughly one and a half years. With this approach, travel surveys can be pre-filled with the predicted responses for each trip, thus streamlining the survey process for users. Combined with an active learning system that requests user input on low-confidence predictions, models can be updated and improved over time to better support the long-term collection of longitudinal qualitative data.

clustering↗
NASA NTRS1978

A study of digital holographic filters generation. Phase 2: Digital data communication system, volume 1

An empirical study of the performance of the Viterbi decoders in bursty channels was carried out and an improved algebraic decoder for nonsystematic codes was developed. The hybrid algorithm was simulated for the (2,1), k = 7 code on a computer using 20 channels having various error statistics, ranging from pure random error to pure bursty channels. The hybrid system outperformed both the algebraic and the Viterbi decoders in every case, except the 1% random error channel where the Viterbi decoder had one bit less decoding error.

Ingels, F. M.↗
NASA NTRS2020

Prognostics for Systems Health Management - Model and Hybrid Based Approaches. Where are We Heading?

To facilitate and solve the prediction problem, awareness of the current state and health of the system is key, since it is necessary to perform condition-based system health predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditional. In case of next generation electric aircrafts, computing remaining flying time is safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. In order to tackle and solve the prediction problem, it is essential to have awareness of the current health state of the system, especially since it is necessary to perform condition-based predictions. To be able to predict the future state of the system, it is also required to possess knowledge of the current and future operational conditions and flight profiles for accurate estimation of end-of-discharge (EOD) for the batteries. Similar framework can be implemented to other complex systems and subsystems. Our research approach is to develop a system level health monitoring safety indicator which runs estimation and prediction algorithms to estimate remaining useful life predictions at system, subsystem swell as component levels. Given models of the current and future system behavior, a general approach of model-based prognostics is discussed as a solution to the prediction problem and further for decision making. Data driven prognostics approaches have been equally used with good results in the past, where respective approaches have their own challenges to tackle. This limits their applicability to complex real-world domains: (a) high complexity or incompleteness of physics-based models and (b) limited representativeness of the training dataset for data-driven models. With the advent of internet of things for data collection and increased use of ML algorithms, hybrid approaches are the next avenue to reduce the challenges and achieve better results. An hybrid framework for fusing information from physics-based performance models along with deep learning algorithms for prognostics of complex safety critical systems is presented. In this framework, we use physics-based performance models to infer unobservable model parameters related to the system's components health solving a calibration problem.

Prognostics↗
NASA NTRS1992

Survivable algorithms and redundancy management in NASA's distributed computing systems

The design of survivable algorithms requires a solid foundation for executing them. While hardware techniques for fault-tolerant computing are relatively well understood, fault-tolerant operating systems, as well as fault-tolerant applications (survivable algorithms), are, by contrast, little understood, and much more work in this field is required. We outline some of our work that contributes to the foundation of ultrareliable operating systems and fault-tolerant algorithm design. We introduce our consensus-based framework for fault-tolerant system design. This is followed by a description of a hierarchical partitioning method for efficient consensus. A scheduler for redundancy management is introduced, and application-specific fault tolerance is described. We give an overview of our hybrid algorithm technique, which is an alternative to the formal approach given.

Malek, Miroslaw↗
DOE OSTI2023

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Path Attenuation Estimates for the DPR

The algorithm for the Surface Reference Technique (SRT) has been updated from version V6A to version V6X. The modified algorithm is designed to process dual-frequency radar data which are now available over the full swath. Comparisons between V6A and V6X show that the dual-wavelength version of the SRT (DSRT) eliminates some of the overestimates of path attenuation in the outer swath that occurred in the earlier version of the algorithm when dual-frequency data was unavailable in the outer swath. However, the DSRT is not reliable in cases of light rain rates where only the Ku-band channel detects rain, nor is it reliable in high rain rate cases where the Ka-band surface signal is lost through attenuation. A modified hybrid algorithm is planned for version 7 that can combine the best features of single- and dual-frequency path attenuation methods.

Meneghini, Robert↗
NASA NTRS1991

Redundancy management for efficient fault recovery in NASA's distributed computing system

The management of redundancy in computer systems was studied and guidelines were provided for the development of NASA's fault-tolerant distributed systems. Fault recovery and reconfiguration mechanisms were examined. A theoretical foundation was laid for redundancy management by efficient reconfiguration methods and algorithmic diversity. Algorithms were developed to optimize the resources for embedding of computational graphs of tasks in the system architecture and reconfiguration of these tasks after a failure has occurred. The computational structure represented by a path and the complete binary tree was considered and the mesh and hypercube architectures were targeted for their embeddings. The innovative concept of Hybrid Algorithm Technique was introduced. This new technique provides a mechanism for obtaining fault tolerance while exhibiting improved performance.

Malek, Miroslaw↗
DOE OSTI2021

White Box Access to Quantum Testbeds for Co-Design

At Lawrence Livermore National Laboratory (LLNL), we operate and maintain the Quantum Device and Integration Testbed (QuDIT) facility, a small quantum testbed that supports about 10 active research teams (including our own) and over 50 internal and external collaborators. This testbed is designed to give remote white box access to users for research, training, and outreach. A guiding principle behind the development of our testbed infrastructure, software and user interfaces is to empower users to perform experiments at the cutting edge of quantum information science at any level of abstraction, from materials studies, device physics and control and characterization techniques to algorithm development and quantum operating system design. Our testbed targets a multilevel quantum system (qudit) to expand the accessible Hilbert space of a simple-to-manufacture quantum device and focuses on quantum simulation, typically implemented through custom gates designed with quantum optimal control methods, rather than on a universal computing framework with a fixed gate set. We leverage the Lab’s high-performance computing (HPC) program and related expertise to simulate quantum systems, develop hybrid algorithms, and generate gates optimized for given simulations. Additionally, we have adopted a co-design philosophy from the HPC community in designing new hardware, so that the systems we develop are optimized for the specific physics simulations we plan to use them for.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Multigroup Neutron Transport Using a Collision-Based Hybrid Method

A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the isotropic multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and approximates the fission and scattering sources on the coarser grids. The coupling of a collided transport equation, discretized on the coarse grid, with an uncollided transport equation, discretized on the fine grid, yields an algorithm that, in most cases, is more efficient than the traditional multigroup approach. In conclusion, the improvement over existing techniques is demonstrated for time-dependent problems with different materials, geometries, and energy groups.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum discriminator for binary classification

Abstract Quantum computers have the unique ability to operate relatively quickly in high-dimensional spaces—this is sought to give them a competitive advantage over classical computers. In this work, we propose a novel quantum machine learning model called the Quantum Discriminator, which leverages the ability of quantum computers to operate in the high-dimensional spaces. The quantum discriminator is trained using a quantum-classical hybrid algorithm in $$\mathcal {O}(N\log N)$$ O ( N log N ) time, and inferencing is performed on a universal quantum computer in $$\mathcal {O}(N)$$ O ( N ) time. The quantum discriminator takes as input the binary features extracted from a given datum along with a prediction qubit, and outputs the predicted label. We analyze its performance on the Iris and Bars and Stripes data sets, and show that it can attain 99% accuracy in simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Emerging Computing Architectures: Simulation of Power Electronics in Power Grids

As the penetration of power electronics increases in power grids, new computing architectures needed to be evaluated for the simulation of high-fidelity models of power electronics in power grids in operations. In this paper, emerging computing architectures such as quantum processing units are evaluated for the simulation of power electronics in power grids. A hybrid algorithm based on classical computing and quantum computing is developed and tested for different use cases of electromagnetic transient (EMT) simulation of power electronics (PE)-based systems and simple circuits. The algorithms needed to simulate power electronics in emerging computing architectures are discussed and thereafter, simulation results are shown.

Debnath, Suman↗
NASA NTRS1978

A fast computation of complex convolution using a hybrid transform

The cyclic convolution of complex values was obtained by a hybrid transform that is a combination of a Winograd transform and a fast complex integer transform. This new hybrid algorithm requires fewer multiplications than any previously known algorithm.

Reed, I. S.↗
NASA NTRS1986

An implicit flux-difference splitting scheme for three-dimensional, incompressible Navier-Stokes solutions to leading edge vortex flows

A new, implicit finite-difference scheme designed to solve the conservative, flux-difference split Navier-Stokes equations is used to compute incompressible vortex flows around delta wings. The completely vectorizable hybrid algorithm is constructed in delta form for steady state solutions independent of the time-step sizes. The scheme combines approximate factorization in crossflow planes with a symmetric planar Gauss-Seidel relaxation in the remaining spatial direction. The governing equations are solved in curvilinear, body-fitted coordinates for treating complex geometries. The computed flow field results are compared with other theoretical and experimental data.

Hartwich, P.-M.↗
NASA NTRS1986

Implicit hybrid schemes for the flux-difference split, three-dimensional Navier-Stokes equations

Implicit hybrid algorithms employing symmetric planar Gauss-Seidel (SPGS) relaxation and either block-tridiagonally structured coefficient matrices (AF-SPGS) or block-triangular coefficient matrices (LU-SPGS) are derived to solve the flux-difference-split Navier-Stokes equations for three-dimensional incompressible flow in an upwind scheme. The physical basis of the approach is discussed, and results for problems involving vortex flow around a thin delta wing at Reynolds numbers 900,000 and 10,000 are presented graphically. It is found that AF-SPGS converges faster on vector computers which depend on long vector lengths to achieve optimum performance, whereas LU-SPGS is preferable on sequentially operating machines and vector computers using shorter vector lengths.

Hartwich, P.-M.↗
NASA NTRS1989

The effect of Mach number on the stability of a plane supersonic wave

The influence of compressibility on the mechanisms governing the various stages of transition in a supersonic wake is investigated. Results from linear stability theory are used to provide physical insights into the observed reduction in growth rate at high Mach numbers. A newly developed hybrid algorithm is used to solve the compressible inviscid linear disturbance equations. Growth rates for both antisymmetric and symmetric modes of two-dimensional and oblique waves are computed for a wide range of Mach numbers. Results from two and three-dimensional direct numerical simulations of a forced compressible time-developing wake are presented in order to understand the nonlinear stages of transition at high Mach numbers. Observed nonlinear growth rate comparisons are made for wakes at two different Mach numbers. The reduction in growth rate at high Mach numbers is explained by examining contour plots of baroclinic torques and the product of dilatation and vorticity.

Chen, Jacqueline H.↗
NASA NTRS1993

Numerical Studies of Collisionless Current Layers

The purpose of this proposal was to investigate collisionless current layers using a variety of analytic and numerical tools. The first year of the contract was dedicated to analytical studies, to the porting and adaption of codes being used in this study, and to the numerical simulation of collisionless current layers. The second year entailed the development of multi-dimensional hybrid algorithms as well as the re-examination of the problem of integro-differential equations that occur in the linear stage of plasma instabilities.

Quest, Kevin B.↗