SEARCH · Engineering Papers
Results for “COMPUTER APPLICATIONS”
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.
High-Mobility 2D Hole Systems for Quantum Computing Applications.
Abstract not provided.
ACCELERATING DISCOVERY FROM HIGH PERFORMANCE COMPUTING APPLICATIONS USING DESCRIPTIVE METADATA MANAGEMENT.
Abstract not provided.
Formal Methods-based Certification Frameworks for Scientific Computing Applications.
Abstract not provided.
Rare Earth Elements and Actinides: Progress in Computational Science Applications: Chapter Title: Computational Modeling of Diphosphine Oxide and Diglycolamide Ligand Complexation to Lanthanides and Extraction from Acidic Media
Explore the source record for details and available documents.
Control optimization, stabilization and computer algorithms for aircraft applications
Computationally useful algorithms are considered that can aid the control engineer in designing systems control in linear time invariant dynamics for aircraft applications. Structural aspects of system identification, matrix parameterization, and the effect of feedback on identifiability of systems. Adaptive and stochastic control model constructions are projected, and a method for approximate identification of aircraft characteristics and subsequent generation of control signals is outlined.
Computer image processing: Geologic applications
Computer image processing of digital data was performed to support several geological studies. The specific goals were to: (1) relate the mineral content to the spectral reflectance of certain geologic materials, (2) determine the influence of environmental factors, such as atmosphere and vegetation, and (3) improve image processing techniques. For detection of spectral differences related to mineralogy, the technique of band ratioing was found to be the most useful. The influence of atmospheric scattering and methods to correct for the scattering were also studied. Two techniques were used to correct for atmospheric effects: (1) dark object subtraction, (2) normalization of use of ground spectral measurements. Of the two, the first technique proved to be the most successful for removing the effects of atmospheric scattering. A digital mosaic was produced from two side-lapping LANDSAT frames. The advantages were that the same enhancement algorithm can be applied to both frames, and there is no seam where the two images are joined.
PQML: Enabling the Predictive Reproducibility on NISQ Machines for Quantum ML Applications
Quantum computing represents a groundbreaking approach to high-performance computing. In recent years, quantum computers have progressed from single-qubit processors to systems boasting over 400 qubits. The presence of such a large number of qubits offers significant advantages, including enhanced computational speed—a capability beyond classical computing methods. However, the current stage of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era. The existence of noise in this era presents challenges in testing quantum computing applications, leading to considerable variance in application results. Furthermore, the diverse noise characteristics observed across different machines exacerbate this issue, complicating the selection of the appropriate machine for application execution. In response to these challenges, we introduce our Predictive Quantum Machine Learning (PQML) tool. This tool is designed to predict outcomes when executing identical quantum machine learning applications—specifically, a critical suite of variational quantum algorithms—across various quantum computers during the NISQ era. This effort relies on data collected over a 12-month period. To the best of our knowledge, this study represents the first attempt to ensure reproducibility across quantum computers for complex circuits. Additionally, we have developed a model capable of forecasting the accuracy of quantum computers for variational quantum algorithms, with a particular emphasis on quantum machine learning as a case study.
Computer systems for real-time applications
Computer design for real time control of tracking station equipment
Algorithms for Balanced Graph Colorings with Applications in Parallel Computing
Graph coloring is used to identify subsets of independent tasks in parallel scientific computing applications. Traditional coloring heuristics aim to reduce the number of colors used as that number also corresponds to the number of parallel steps in the application. However, if the color classes produced have a skew in their sizes, utilization of hardware resources becomes inefficient, especially for the smaller color classes. Equitable coloring is a theoretical formulation of coloring that guarantees a perfect balance among color classes, and its practical relaxation is referred to as balanced coloring. In this paper, we revisit the problem of balanced coloring in the context of parallel computing. The goal is to achieve a balanced coloring of an input graph without increasing the number of colors that an algorithm oblivious to balance would have used. We propose and study multiple heuristics that aim to achieve such a balanced coloring for two variants of coloring problem, distance-1 coloring and partial distance-2 coloring (defined on a bipartite graph). We present parallelization approaches for multi-core and manycore architectures, and cross-evaluate their effectiveness with respect to the quality of balance achieved and performance. Furthermore, we study the impact of the proposed balanced coloring heuristics on a concrete application - viz. parallel community detection, which is an example of an irregular application. In addition, we propose several extensions to our balancing schemes and evaluate their balancing efficacy and performance characteristics. The thorough treatment of balanced coloring presented in this paper from algorithms to application is expected to serve as a valuable resource to parallel application developers who seek to improve parallel performance of their applications using coloring.
Interactive computer graphics applications for compressible aerodynamics
Three computer applications have been developed to solve inviscid compressible fluids problems using interactive computer graphics. The first application is a compressible flow calculator which solves for isentropic flow, normal shocks, and oblique shocks or centered expansions produced by two dimensional ramps. The second application couples the solutions generated by the first application to a more graphical presentation of the results to produce a desk top simulator of three compressible flow problems: 1) flow past a single compression ramp; 2) flow past two ramps in series; and 3) flow past two opposed ramps. The third application extends the results of the second to produce a design tool which solves for the flow through supersonic external or mixed compression inlets. The applications were originally developed to run on SGI or IBM workstations running GL graphics. They are currently being extended to solve additional types of flow problems and modified to operate on any X-based workstation.
Some applications of small computers to optical spectroscopy
Small digital computers applications to astronomical electronic instrumentation systems of microphotometry and spectroscopy
Space shuttle main engine computed tomography applications
For the past two years the potential applications of computed tomography to the fabrication and overhaul of the Space Shuttle Main Engine were evaluated. Application tests were performed at various government and manufacturer facilities with equipment produced by four different manufacturers. The hardware scanned varied in size and complexity from a small temperature sensor and turbine blades to an assembled heat exchanger and main injector oxidizer inlet manifold. The evaluation of capabilities included the ability to identify and locate internal flaws, measure the depth of surface cracks, measure wall thickness, compare manifold design contours to actual part contours, perform automatic dimensional inspections, generate 3D computer models of actual parts, and image the relationship of the details in a complex assembly. The capabilities evaluated, with the exception of measuring the depth of surface flaws, demonstrated the existing and potential ability to perform many beneficial Space Shuttle Main Engine applications.
Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems
Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.
Modeling and Simulation Credibility Assessments of Whole-Body Finite Element Computational Models for Use in NASA Extravehicular Activity Applications
Computational finite element (FE) models are used in suited astronaut injury risk assessments; however, these models’ verification, validation, and credibility (VV&C) procedures for simulating injuries in altered gravity environments are limited. Our study conducts VV&C assessments of THUMS and Elemance whole-body FE models for predicting suited astronaut injury biomechanics using eight credibility factors, as per NASA-STD-7009A. Credibility factor ordinal scores are assigned by reviewing existing documentation describing VV&C practices, and credibility sufficiency thresholds are assigned based on input from subject matter experts. Our results show the FE models are credible for suited astronaut injury investigation in specific ranges of kinematic and kinetic conditions correlating to highway and contact sports events. Nevertheless, these models are deficient when applied outside these ranges. Several credibility elevation strategies are prescribed to improve models’ credibility for the NASA-centric application domain.
Modeling and simulation credibility assessments of whole-body finite element computational models for use in NASA extravehicular activity applications
Computational finite element (FE) models are used in suited astronaut injury risk assessments; however, these models’ verification, validation, and credibility (VV&C) procedures for simulating injuries in altered gravity environments are limited. Our study conducts VV&C assessments of THUMS and Elemance whole-body FE models for predicting suited astronaut injury biomechanics using eight credibility factors, as per NASA-STD-7009A. Credibility factor ordinal scores are assigned by reviewing existing documentation describing VV&C practices, and credibility sufficiency thresholds are assigned based on input from subject matter experts. Our results show the FE models are credible for suited astronaut injury investigation in specific ranges of kinematic and kinetic conditions correlating to highway and contact sports events. Nevertheless, these models are deficient when applied outside these ranges. Several credibility elevation strategies are prescribed to improve models’ credibility for the NASA-centric application domain.
Assessing the role of mini-applications in predicting key performance characteristics of scientific and engineering applications
Computational science and engineering application programs are typically large, complex, and dynamic, and are often constrained by distribution limitations. As a means of making tractable rapid explorations of scientific and engineering application programs in the context of new, emerging, and future computing architectures, a suite of miniapps has been created to serve as proxies for full scale applications. Each miniapp is designed to represent a key performance characteristic that does or is expected to significantly impact the runtime performance of an application program. In this paper we introduce a methodology for assessing the ability of these miniapps to effectively represent these performance issues. We applied this methodology to four miniapps, examining the linkage between them and an application they are intended to represent. Herein we evaluate the fidelity of that linkage. This work represents the initial steps required to begin to answer the question, ''Under what conditions does a miniapp represent a key performance characteristic in a full app?''