Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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,603 records · Page 89

Coupling sample paths to the thermodynamic limit in Monte Carlo estimators with applications to gene expression

Many biochemical systems appearing in applications have a multiscale structure so that they converge to piecewise deterministic Markov processes in a thermodynamic limit. The statistics of the piecewise deterministic process can be obtained much more efficiently than those of the exact process. We explore the possibility of coupling sample paths of the exact model to the piecewise deterministic process in order to reduce the variance of their difference. We then apply this coupling to reduce the computational complexity of a Monte Carlo estimator. Motivated by the rigorous results in , we show how this method can be applied to realistic biological models with nontrivial scalings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗

Results of the 3 November 1974 Applications Technology Satellite-6 (ATS-6) trilateration test

The highly successful 24 hour trilateration tracking and orbit determination test conducted on 3 November 1974 is described. In this test a new method of accurately computing geostationary spacecraft orbits was applied to the Applications Technology Satellite (ats-6). A single tracking station interrogates several strategically deployed ground based transponders via the synchronous satellite whose orbit is to be determined. The ATS-6 tracking data measurement noise over the 24 hour period was observed to be 0.3 mm/sec in range rate and 1.5 meters in range. By means of overlap orbit computation using 2 separate tracking data bases, the ATS-6 total position and velocity uncertainties were determined to reach a minimum of 30 meters and 0.2 cm/sec respectively. The maximum position and velocity uncertainty over this same time period was determined to be approximately 250 meters and 2 cm/sec respectively. A position determination using simultaneous tracking of the NASA-GSFC site by ATS-6 and ATS-3 was also performed. Station location recovery was to an accuracy on the order of 100 meters over the first 10 hours of tracking.

Schmid, P. E.↗

Turbulence Model Validation through Joint Experimental / Computational Studies of Separated Flow Over a Three-Dimensional Tapered Bump: Part II - Computational Investigation

This report serves as documentation of activities related to Computational Fluid Dynamics (CFD) analysis applied to the Smooth Body Separation Experiment designed to produce validation-quality experimental data from wind-tunnel tests performed at the University of Notre Dame. All CFD analysis utilized the Boeing CFD (BCFD) flow solver. BCFD was used to analyze flow over the Boeing Speed Bump with second-order accuracy in space and time. Inviscid fluxes were computed using the HLLE scheme for steady-state simulations, and the Low-Dissipation Roe scheme for time-accurate simulations. The working fluid was modeled as calorically perfect air using Sutherland's law for viscosity. Thermal diffusivity was determined by assuming a constant molecular Prandtl number of 0.72, and a turbulent Prandtl number of 0.9. Reynolds Averaged Navier-Stokes (RANS) simulations were conducted using the one-equation Spalart-Allmaras turbulence model with rotation correction3 and the quadratic constitutive relation (SA-RC-QCR), as well as Menter's two-equation, Shear-Stress Transport (SST) model. Time-accurate computations were conducted using Delayed Detached eddy Simulation (DDES) with the one-equation RANS model, and Large Eddy Stress balance (LESb) with the two-equation RANS model. Implicit dual-time stepping was used to achieve second-order temporal accuracy. The experimental investigation conducted during the course of this study is described in detail in an accompanying report.

Flow separation↗

Error Mitigation of Point-to-Point Communication for Fault-Tolerant Computing

Fault tolerant systems require the ability to detect and recover from physical damage caused by the hardware s environment, faulty connectors, and system degradation over time. This ability applies to military, space, and industrial computing applications. The integrity of Point-to-Point (P2P) communication, between two microcontrollers for example, is an essential part of fault tolerant computing systems. In this paper, different methods of fault detection and recovery are presented and analyzed.

Akamine, Robert L.↗

Tracking interface and common curve dynamics for two-fluid flow in porous media

Pore-scale studies of multiphase flow in porous medium systems can be used to understand transport mechanisms and quantitatively determine closure relations that better incorporate microscale physics into macroscale models. Multiphase flow simulators constructed using the lattice Boltzmann method provide a means to conduct such studies, including both the equilibrium and dynamic aspects. Moving, storing, and analyzing the large state space presents a computational challenge when highly-resolved models are applied. We present an approach to simulate multiphase flow processes in which in-situ analysis is applied to track multiphase flow dynamics at high temporal resolution. We compute a comprehensive set of measures of the phase distributions and the system dynamics, which can be used to aid fundamental understanding and inform closure relations for macroscale models. The measures computed include microscale point representations and macroscale averages of fluid saturations, the pressure and velocity of the fluid phases, interfacial areas, interfacial curvatures, interface and common curve velocities, interfacial orientation tensors, phase velocities and the contact angle between the fluid-fluid interface and the solid surface. Test cases are studied to validate the approach and illustrate how measures of system state can be obtained and used to inform macroscopic theory.

97 MATHEMATICS AND COMPUTING↗

Good relationships between computational image analysis and radiological physics

Good relationships between computational image analysis and radiological physics have been constructed for increasing the accuracy of medical diagnostic imaging and radiation therapy in radiological physics. Computational image analysis has been established based on applied mathematics, physics, and engineering. This review paper will introduce how computational image analysis is useful in radiation therapy with respect to radiological physics.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Compliant Robot Wrist Senses Deflections And Forces

Precise parts assembled without damage. Goddard Space Flight Center developed compliant wrist that moves in any direction and rotates about any axis in response to applied forces. Deflection calibrated and instrumented so control computer measures degree of deflection and derives magnitude and direction of applied forces and torques. Compliant wrist brings to robots important capabilities humans use in manipulating objects. Helps prevent damage to precise, delicate parts during assembly by robot. Rod lengths, spring stiffnesses, and type of displacement sensor changed to suit different applications.

Purves, Lloyd R.↗

Simulation of Aircraft Landing Gears with a Nonlinear Dynamic Finite Element Code

Recent advances in computational speed have made aircraft and spacecraft crash simulations using an explicit, nonlinear, transient-dynamic, finite element analysis code more feasible. This paper describes the development of a simple landing gear model, which accurately simulates the energy absorbed by the gear without adding substantial complexity to the model. For a crash model, the landing gear response is approximated with a spring where the force applied to the fuselage is computed in a user-written subroutine. Helicopter crash simulations using this approach are compared with previously acquired experimental data from a full-scale crash test of a composite helicopter.

Lyle, Karen H.↗

A numerical method for approximating antenna surfaces defined by discrete surface points

A simple numerical method for the quadratic approximation of a discretely defined reflector surface is described. The numerical method was applied to interpolate the surface normal of a parabolic reflector surface from a grid of nine closest surface points to the point of incidence. After computing the surface normals, the geometrical optics and the aperture integration method using the discrete Fast Fourier Transform (FFT) were applied to compute the radiaton patterns for a symmetric and an offset antenna configurations. The computed patterns are compared to that of the analytic case and to the patterns generated from another numerical technique using the spline function approximation. In the paper, examples of computations are given. The accuracy of the numerical method is discussed.

Lee, R. Q.↗

A Presentation on Robust Flutter Margin Analysis and a Flutterometer

This paper documents an invited presentation given to The Boeing Company, Seattle, Washington, on September 9, 1997. The audience consisted of structural dynamic and flight test engineers from the Boeing Commercial Airplane Group who were interested in discussing research which may be applied to future flight flutter test programs. A method to compute robust flutter margins is described which is a significant departure from traditional methods. This method uses the structured singular value, mu, to compute a flutter margin which directly accounts for modeling errors such that a worst-case flutter margin is computed with respect to those errors. This method may be applied in several ways. A post-flight application uses data sets from multiple test points to compute worst-case flutter margins and a worst-case flight envelope. An on-line implementation computes flutter margins at each test point to track the flutter margins during a flight test. This on-line implementation is the basis for a flutterometer flight test tool that displays the distance to flutter at a given test point. Such a tool was not previously possible using traditional flutter flight test analysis methods. The F/A-18 System Research Aircraft was used to demonstrate these applications using flight data recorded from test points throughout the flight envelope.

Lind, Rick C.↗

Variation of Radiative Properties During Black Carbon Aging. Theoretical and Experimental Intercomparison

A theoretical model is developed to account for black carbon (BC) aging during three major evolution stages, i.e., freshly emitted aggregates, coated particles by soluble materials, and those after further hygroscopic growth. The geometric-optics surface-wave approach is employed to compute BC single-scattering properties at each stage, which are compared with laboratory measurements. Theoretical predictions using input parameters determined from experiments are consistent with measurements in extinction and scattering cross sections for coated BC (within 30 20%) and absorption enhancement from coating (within 15%). The calculated scattering cross sections of fresh BC aggregates are larger than those experimentally measured, because of uncertainties in measurements and calculations. We apply the aging model to compute BC direct radiative forcing (DRF) over the LA Basin using the CalNex 2010 field measurements. Our results demonstrate that accounting for the interactive radiative properties during BC aging is essential in obtaining reliable DRF estimates within a regional context.

He, Cenlin↗

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗

Bigpicc: a graph-based approach to identifying carcinogenic gene combinations from mutation data

Abstract Genome data from cancer patients represents relationships between the presence of a gene mutation and cancer occurrence in a patient. Different types of cancer in human are thought to be caused by combinations of two to nine gene mutations. Identifying these combinations through traditional exhaustive search requires the amount of computation that scales exponentially with the combination size and in most cases is intractable even for cutting-edge supercomputers. We propose a parameter-free heuristic approach that leverages the intrinsic topology of gene-patient mutations to identify carcinogenic combinations. The biological relevance of the identified combinations is measured by using them to predict the presence of tumor in previously unseen samples. The resulting classifiers for 16 cancer types perform on par with exhaustive search results, and score the average of 80.1% sensitivity and 91.6% specificity for the best choice of hit range per cancer type. Our approach is able to find higher-hit carcinogenic combinations targeting which would take years of computations using exhaustive search.

Biochemistry & Molecular Biology↗

Optimizing a liquid propellant rocket engine with an automated combustor design code (AUTOCOM)

A procedure for automatically designing a liquid propellant rocket engine combustion chamber in an optimal fashion is outlined. The procedure is contained in a digital computer code, AUTOCOM. The code is applied to an existing engine, and design modifications are generated which provide a substantial potential payload improvement over the existing design. Computer time requirements for this payload improvement were small, approximately four minutes in the CDC 6600 computer.

Hague, D. S.↗

A CLIPS based personal computer hardware diagnostic system

Often the person designated to repair personal computers has little or no knowledge of how to repair a computer. Described here is a simple expert system to aid these inexperienced repair people. The first component of the system leads the repair person through a number of simple system checks such as making sure that all cables are tight and that the dip switches are set correctly. The second component of the system assists the repair person in evaluating error codes generated by the computer. The final component of the system applies a large knowledge base to attempt to identify the component of the personal computer that is malfunctioning. We have implemented and tested our design with a full system to diagnose problems for an IBM compatible system based on the 8088 chip. In our tests, the inexperienced repair people found the system very useful in diagnosing hardware problems.

Whitson, George M.↗

Experience in using SIMD and MIMD parallelism for computational fluid dynamics

One of the key objectives of the Applied Research Branch in the Numerical Aerodynamic Simulation (NAS) Systems Division at NASA Ames Research Center is the accelerated introduction of highly parallel machines into a fully operational environment. In this report we summarize some of the experiences with the parallel testbed machines at the NAS Applied Research Branch. We discuss the performance results obtained from the implementation of two computational fluid dynamics (CFD) applications, an unstructured grid solver and a particle simulation, on the Connection Machine CM-2 and the Intel iPSC/860.

Simon, Horst D.↗

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗