SEARCH · Search NASA

Results for “interface 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Bridging cognitive gaps between user and model in interactive dimension reduction

Interactive machine learning (ML) systems are difficult to design because of the "Two Black Boxes" problem that exists at the interface between human and machine. Many algorithms that are used in interactive ML systems are black boxes that are presented to users, while the human cognition represents a second black box that can be difficult for the algorithm to interpret. These two black boxes create cognitive gaps between the user and the interactive ML model when a user interacts with the system. In this paper, we identify several cognitive gaps that exist in a previously-developed interactive visual analytics (VA) system, Andromeda. These cognitive gaps that we are addressing in Andromeda are representative of common problems in other VA systems. Our goal with this work is to open both black boxes and bridge these cognitive gaps by making improvements to the original Andromeda system, including designing new visual features to help people better understand how Andromeda processes and interacts with data and improving the underlying algorithm so that the Andromeda system can better understand the intent of the user during the data exploration process. We evaluate our designs through both qualitative and quantitative analysis (i.e., user study and simulation analysis), and the results confirm that the improved Andromeda system outperforms the original version significantly in a series of high-dimensional data understanding tasks.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Status of automatic guidance systems for rotorcraft in low altitude flight

Rotorcraft operating in high-threat environments fly close to the earth's surface to utilize surrounding terrain, vegetation, or man-made objects to minimize the risk of being detected by an enemy. The piloting of the rotorcraft is at best a very demanding task and the pilots need help from on-board automation tools in order to devote more time to mission-related activities. The Automated Nap-of-the-Earth (NOE) Flight Program is a cooperative NASA/Army program aimed at the development of technologies for enhancing piloted low-altitude/NOE flight path management and control through computer and sensor aiding. The long-term objective is to work towards achieving automation for aiding the pilot in NOE flight with a flight demonstration of resulting computer/sensor aiding concepts at an established course. The technology for pilot-centered NOE automation is not currently available. Success in automating NOE functions will depend on major breakthroughs in real-time flight path planning algorithms, effective methods for the pilot to interface to the automatic modes, understanding of visual images, sensor data processing/fusion, and sensor development. Our approach to developing the technologies required to solve this problem consist of the following phases: (1) algorithm development, (2) laboratory evaluation, (3) piloted ground simulation, and (4) evaluation in flight. An overview of the research in this area at NASA Ames Research Center is given.

Sridhar, Banavar↗

DOE OSTI2023

Theory of an Automatic Seepage Meter and Ramifications for Applications

A new approach for measuring fluxes across surface water—groundwater interfaces was recently proposed. The Automatic Seepage Meter (ASM) is equipped with a precise water level sensor and digital memory that analyzes water level time series in a vertical tube inserted into a streambed. The ability to infer flux values with high temporal resolution relies on an accurate interpretation of water level dynamics inside the tube. Here, we reduce the three-dimensional hydrodynamic problem that describes the ASM water level in a variety of field conditions to a single ordinary differential equation. This novel general analytical solution for estimating ASM responses is more comprehensive and flexible than previous approaches and is applicable to the entire range of field conditions, including steady or transient stream stages, evaporation, rainfall, and noise. For example, our analysis determines the timing of the nonmonotonic ASM response to a monotonic linear stream stage variation and explains previously used empirical parabolic approximation for estimating fluxes. We present algorithms for simultaneous inference of vertical interface flux and hydraulic conductivity values together with an example code. We quantify how the accuracy of parameter estimation depends on test duration and noise amplitude and propose how our analysis can be used to optimize field test protocols. On this basis, changing the ASM geometry by increasing the radius and decreasing tube insertion depth may enable ASM field test protocols that estimate interface flux and hydraulic conductivity faster while maintaining desired accuracy. Potential applications of joint parameter estimation are suggested.

47 OTHER INSTRUMENTATION↗

NASA NTRS1995

A portable MPI-based parallel vector template library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

NASA NTRS1995

A Portable MPI-Based Parallel Vector Template Library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

NASA NTRS1997

Probabilistic Analysis of Ground-Holding Strategies

The Ground-Holding Policy Problem (GHPP) has become a matter of great interest in recent years because of the high cost incurred by aircraft suffering from delays. Ground-holding keeps a flight on the ground at the departure airport if it is known it will be unable to land at the arrival airport. The GBPP is determining how many flights should be held on the ground before take-off and for how long, in order to minimize the cost of delays. When the uncertainty associated with airport landing capacity is considered, the GHPP becomes complicated. A decision support system that incorporates this uncertainty, solves the GHPP quickly, and gives good results would be of great help to air traffic management. The purpose of this thesis is to modify and analyze a probabilistic ground-holding algorithm by applying it to two common cases of capacity reduction. A graphical user interface was developed and sensitivity analysis was done on the algorithm, in order to see how it may be implemented in practice. The sensitivity analysis showed the algorithm was very sensitive to the number of probabilistic capacity scenarios used and to the cost ratio of air delay to ground delay. The algorithm was not particularly sensitive to the number of periods that the time horizon was divided into. In terms of cost savings, a ground-holding policy was the most beneficial when demand greatly exceeded airport capacity. When compared to other air traffic flow strategies, the ground-holding algorithm performed the best and was the most consistent under various situations. The algorithm can solve large problems quickly and efficiently on a personal computer.

Sheel, Minakshi↗

DOE OSTI2022

The ITensor Software Library for Tensor Network Calculations

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗

DOE OSTI2022

Codebase release 0.3 for ITensor

Fishman, Matthew↗

DOE OSTI2020

Machine Learning Algorithm Identifies an Antibiotic Vocabulary for Permeating Gram-Negative Bacteria

Drug discovery faces a crisis. The industry has used up the “obvious” space in which to find novel drugs for biomedical applications, and productivity is declining. One strategy to combat this is rational approaches to expand the search space without relying on chemical intuition, to avoid rediscovery of similar spaces. Here, we present proof of concept of an approach to rationally identify a “chemical vocabulary” related to a specific drug activity of interest without employing known rules. We focus on the pressing concern of multidrug resistance in Pseudomonas aeruginosa by searching for submolecules that promote compound entry into this bacterium. By synergizing theory, computation, and experiment, we validate our approach, explain the molecular mechanism behind identified fragments promoting compound entry, and select candidate compounds from an external library that display good permeation ability.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

Plaster: An Integration, Benchmark and Development Framework for Heterogeneous Metadata Normalization Methods

The recent advances in the automation of metadata normalization and the invention of a unified schema — Brick — alleviate the metadata normalization challenge for deploying portable applications across buildings. Yet, the lack of compatibility between existing metadata normalization methods precludes the possibility of comparing and combining them. While generic machine learning (ML) frameworks, such as MLJAR and OpenML, provide versatile interfaces for standard ML problems, they cannot easily accommodate the metadata normalization tasks for buildings due to the heterogeneity in the inference scope, type of data required as input, evaluation metric, and the building-specific human-in-the-loop learning procedure. We propose Plaster, an open and modular framework that incorporates existing advances in building metadata normalization. It provides unified programming interfaces for various types of learning methods for metadata normalization and defines standardized data models for building metadata and timeseries data. Thus, it enables the integration of different methods via a workflow, benchmarking of different methods via unified interfaces, and rapid prototyping of new algorithms. With Plaster, we 1) show three examples of the workflow integration, delivering better performance than individual algorithms, 2) benchmark/analyze five algorithms over five common buildings, and 3) exemplify the process of developing a new algorithm involving time series features. We believe Plaster will facilitate the development of new algorithms and expedite the adoption of standard metadata schema such as Brick, in order to enable seamless smart building applications in the future.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2020

Flibcpp

Flibcpp is a library for use by application developers that provides native Fortran interfaces to existing high-quality algorithms and containers implemented in C++ and available on all modern computer systems.

Johnson, SethR [Oak Ridge National Laboratory] (00↗

DOE OSTI2020

THEMIS: A Parameter Estimation Framework for the Event Horizon Telescope

The Event Horizon Telescope (EHT) provides the unprecedented ability to directly resolve the structure and dynamics of black hole emission regions on scales smaller than their horizons. This has the potential to critically probe the mechanisms by which black holes accrete and launch outflows, and the structure of supermassive black hole spacetimes. However, accessing this information is a formidable analysis challenge for two reasons. First, the EHT natively produces a variety of data types that encode information about the image structure in nontrivial ways; these are subject to a variety of systematic effects associated with very long baseline interferometry and are supplemented by a wide variety of auxiliary data on the primary EHT targets from decades of other observations. Second, models of the emission regions and their interaction with the black hole are complex, highly uncertain, and computationally expensive to construct. As a result, the scientific utilization of EHT observations requires a flexible, extensible, and powerful analysis framework. We present such a framework, Themis, which defines a set of interfaces between models, data, and sampling algorithms that facilitates future development. We describe the design and currently existing components of Themis, how Themis has been validated thus far, and present additional analyses made possible by Themis that illustrate its capabilities. Importantly, we demonstrate that Themis is able to reproduce prior EHT analyses, extend these, and do so in a computationally efficient manner that can efficiently exploit modern high-performance computing facilities. Themis has already been used extensively in the scientific analysis and interpretation of the first EHT observations of M87.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

ML-based Real-Time Control at the Edge: An Approach Using hls4ml

This study focuses on implementing a real-time control system for a particle accelerator facility that performs high energy physics experiments. A critical operating parameter in this facility is beam loss, which is the fraction of particles deviating from the accelerated proton beam into a cascade of secondary particles. Accelerators employ a large number of sensors to monitor beam loss. The data from these sensors is monitored by human operators who predict the relative contribution of different sub-systems to the beam loss. Using this information, they engage control interventions. In this paper, we present a controller to track this phenomenon in real-time using edge-Machine Learning (ML) and support control with low latency and high accuracy. We implemented this system on an Intel Arria 10 SoC. Optimizations at the algorithm, high-level synthesis, and interface levels to improve latency and resource usage are presented. Our design implements a neural network, which can predict the main source of beam loss (between two possible causes) at speeds up to 575 frames per second (fps) (average latency of 1.74 ms). The practical deployed system is required to operate at 320 fps, with a 3ms latency requirement, which has been met by our design successfully.

Shi, R.↗

NASA NTRS1982

Image processing via VLSI: A concept paper

Implementing specific image processing algorithms via very large scale integrated systems offers a potent solution to the problem of handling high data rates. Two algorithms stand out as being particularly critical -- geometric map transformation and filtering or correlation. These two functions form the basis for data calibration, registration and mosaicking. VLSI presents itself as an inexpensive ancillary function to be added to almost any general purpose computer and if the geometry and filter algorithms are implemented in VLSI, the processing rate bottleneck would be significantly relieved. A set of image processing functions that limit present systems to deal with future throughput needs, translates these functions to algorithms, implements via VLSI technology and interfaces the hardware to a general purpose digital computer is developed.

Nathan, R.↗

NASA NTRS1985

A preliminary study of the basic display/guidance requirements for flying near optimal trajectories

NASA has responded to the increased emphases on cost-efficient operation of today's airline fleet with an ongoing research program to investigate the requirements and benefits of using new airborne guidance and pilot procedures designed to yield cost-optimal flight profiles that are compatible with advanced air traffic control system concepts. A trajectory optimization algorithm has been incorporated into one of NASA Langley's fixed-based simulators to investigate the pilot/cockpit interface requirements. The trajectories that are generated by this algorithm differ from conventional profiles in that they are constantly varying in both flight path angle and airspeed. Considering the dynamic nature of these profiles, conventional guidance may be insufficient for practical use. This paper summarizes the results of an initial set of piloted simulation tests to investigate the basic guidance requirements for flying the near-optimal trajectories.

Vicroy, D. D.↗

NASA NTRS1986

Design factors and considerations for a time-based flight management system

Recent NASA Langley Research Center research to develop a technology data base from which an advanced Flight Management System (FMS) design might evolve is reviewed. In particular, the generation of fixed range cruise/descent reference trajectories which meet predefined end conditions of altitude, speed, and time is addressed. Results on the design and theoretical basis of the trajectory generation algorithm are presented, followed by a brief discussion of a series of studies that are being conducted to determine the accuracy requirements of the aircraft and weather models resident in the trajectory generation algorithm. Finally, studies to investigate the interface requirements between the pilot and an advanced FMS are considered.

Vicroy, D. D.↗

NASA NTRS1993

An investigative study of multispectral data compression for remotely-sensed images using vector quantization and difference-mapped shift-coding

A study is conducted to investigate the effects and advantages of data compression techniques on multispectral imagery data acquired by NASA's airborne scanners at the Stennis Space Center. The first technique used was vector quantization. The vector is defined in the multispectral imagery context as an array of pixels from the same location from each channel. The error obtained in substituting the reconstructed images for the original set is compared for different compression ratios. Also, the eigenvalues of the covariance matrix obtained from the reconstructed data set are compared with the eigenvalues of the original set. The effects of varying the size of the vector codebook on the quality of the compression and on subsequent classification are also presented. The output data from the Vector Quantization algorithm was further compressed by a lossless technique called Difference-mapped Shift-extended Huffman coding. The overall compression for 7 channels of data acquired by the Calibrated Airborne Multispectral Scanner (CAMS), with an RMS error of 15.8 pixels was 195:1 (0.41 bpp) and with an RMS error of 3.6 pixels was 18:1 (.447 bpp). The algorithms were implemented in software and interfaced with the help of dedicated image processing boards to an 80386 PC compatible computer. Modules were developed for the task of image compression and image analysis. Also, supporting software to perform image processing for visual display and interpretation of the compressed/classified images was developed.

Jaggi, S.↗

NASA NTRS1996

Software For Multivariate Bayesian Classification

PHD general-purpose classifier computer program. Uses Bayesian methods to classify vectors of real numbers, based on combination of statistical techniques that include multivariate density estimation, Parzen density kernels, and EM (Expectation Maximization) algorithm. By means of simple graphical interface, user trains classifier to recognize two or more classes of data and then use it to identify new data. Written in ANSI C for Unix systems and optimized for online classification applications. Embedded in another program, or runs by itself using simple graphical-user-interface. Online help files makes program easy to use.

Saul, Ronald↗