Search NASA⌕ Search

SEARCH · Search NASA

Results for “time coding”

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 541 records · Page 30

Numerical simulations of galactic wakes

We have performed a series of numerical simulations which examine the simple but realistic case of a galaxy with a smooth potential corresponding to a King profile, and with no interstellar medium. This corresponds to the case of an early-type cluster galaxy that has previously been stripped of its gas. The simulations provide a numerical basis for future work involving galaxies with interstellar media. We use a time-explicit finite difference code (Lufkin & Hawley 1992, ApJ submitted) to obtain solutions to the nonlinear equations for adiabatic flow in axisymmetry. The computational grid covers a region extending 500 kpc from a stationary galaxy radially and along the symmetry axis. We use a graded mesh, allowing for full resolution near the galaxy. Because the assumed potential has a finite depth, no artificial inner boundary condition is necessary; reflection symmetry at the axis is assumed. With a total grid size of 64 radial x 128 vertical, each run requires approximately 5 minutes of cpu time on the NCSA Cray-2.

Lufkin, Eric A.↗

Hydrology Copilot: A Cloud-Native Ai System for Hydrological Data Analysis

The emergence of AI-driven Earth observation systems promises to broaden access to petabyte-scale geospatial data beyond domain specialists. However, translating this vision into operational scientific infrastructure requires addressing fundamental challenges in data virtualization, code transparency, and domain-specific reasoning. We present Hydrology Copilot, a cloud-native AI framework for natural-language-driven analysis of Earth observation data. To demonstrate operational capabilities at scale, we implement the system using NASA's North American Land Data Assimilation System version 3 (NLDAS-3), which provides surface meteorological forcing and land-surface model output across North and Central America at 1-km resolution, from which drought diagnostics are derived. The system integrates five core contributions: (1) scalable data virtualization using Kerchunk-based cloud optimized access, achieving a 1.5 to 4.6 times improvement in I/O latency across benchmark queries spanning regional single-day extractions (4.6 times speedup) to continental monthly aggregations (1.5 times speedup); (2) transparent code generation through Microsoft Azure AI Foundry agents that expose executable Python workflows for scientific verification; (3) persistent conversational memory enabling multi-turn analytical discourse across sessions; (4) intelligent query validation that enforces dataset boundaries and resolves ambiguous requests before execution; and (5) a multi-agent architecture coordinating query parsing, code generation, and visualization. We evaluate the system through drought-monitoring workflows, demonstrating reliable code generation, accurate results validated against reference computations and the operational U.S. Drought Monitor, and efficient operation across increasingly complex tasks. By bridging natural-language interfaces with rigorous hydrological analysis, Hydrology Copilot advances beyond proof-of-concept demonstrations to provide a deployable framework for operational Earth science applications.

Data virtualization↗

Certifying Auto-Generated Flight Code

Model-based design and automated code generation are being used increasingly at NASA. Many NASA projects now use MathWorks Simulink and Real-Time Workshop for at least some of their modeling and code development. However, there are substantial obstacles to more widespread adoption of code generators in safety-critical domains. Since code generators are typically not qualified, there is no guarantee that their output is correct, and consequently the generated code still needs to be fully tested and certified. Moreover, the regeneration of code can require complete recertification, which offsets many of the advantages of using a generator. Indeed, manual review of autocode can be more challenging than for hand-written code. Since the direct V&V of code generators is too laborious and complicated due to their complex (and often proprietary) nature, we have developed a generator plug-in to support the certification of the auto-generated code. Specifically, the AutoCert tool supports certification by formally verifying that the generated code is free of different safety violations, by constructing an independently verifiable certificate, and by explaining its analysis in a textual form suitable for code reviews. The generated documentation also contains substantial tracing information, allowing users to trace between model, code, documentation, and V&V artifacts. This enables missions to obtain assurance about the safety and reliability of the code without excessive manual V&V effort and, as a consequence, eases the acceptance of code generators in safety-critical contexts. The generation of explicit certificates and textual reports is particularly well-suited to supporting independent V&V. The primary contribution of this approach is the combination of human-friendly documentation with formal analysis. The key technical idea is to exploit the idiomatic nature of auto-generated code in order to automatically infer logical annotations. The annotation inference algorithm itself is generic, and parametrized with respect to a library of coding patterns that depend on the safety policies and the code generator. The patterns characterize the notions of definitions and uses that are specific to the given safety property. For example, for initialization safety, definitions correspond to variable initializations while uses are statements which read a variable, whereas for array bounds safety, definitions are the array declarations, while uses are statements which access an array variable. The inferred annotations are thus highly dependent on the actual program and the properties being proven. The annotations, themselves, need not be trusted, but are crucial to obtain the automatic formal verification of the safety properties without requiring access to the internals of the code generator. The approach has been applied to both in-house and commercial code generators, but is independent of the particular generator used. It is currently being adapted to flight code generated using MathWorks Real-Time Workshop, an automatic code generator that translates from Simulink/Stateflow models into embedded C code.

Denney, Ewen↗

Relaxation of the loss-cone by quasi-linear diffusion of the electron-cyclotron maser instability in the solar corona

A self-consistent numeric two-dimensional code using kinetic-wave particle equations has been developed and applied to the maser dynamics of the solar corona. Time histories generated by the code reveal details of the evolution of the linear phase, the saturation and subsequent relaxation of the loss cone. Quantitative values are obtained for the saturation time, the amount of the converted free energy, the critical wave energy level for onset of maser diffusion, the velocity and pitch angle range of the resonant particles, and the relative importance of the different magnetoionic modes and harmonics. A wide range of initial conditions is covered by varying the loss-cone distribution and the ambient cold plasma parameters.

Aschwanden, Markus J.↗

A high quality image compression scheme for real-time applications

Many image compression or coding techniques have been developed to reduce the amount of bits of information needed to represent digital images. Among these, Vector Quantization (VQ) seems to have the edge; its theoretical distortion is lower than that of other block coding techniques at comparable bit rates. However, the application of Vector Quantization remains limited due to its high computational complexity. Presently, it is limited to low to medium quality image compression. In this paper it is shown that VQ can be mapped onto VLSI implementation via systolic type architecture, making real time application possible. In addition, it is shown that using multistage or cascade VQ high quality images can be obtained at very low bit rates for real time applications while using smaller codebooks than is necessary in single stage VQ. Examples of processed images are presented.

Ramamoorthy, P. A.↗

Time-discretization of a plasma-neutral MHD model with a semi-implicit leapfrog algorithm

The semi-implicit leapfrog time-discretization is a workhorse algorithm for initial-value MHD codes to bridge between vastly separated time scales. Inclusion of atomic interactions with neutrals breaks the functional structure of the MHD equations that exploited by the leapfrog. In this work, we address how to best integrate atomic physics into the semi-implicit leapfrog. Following the Crank-Nicolson method, one approach is to time-center the atomic interactions in the linear solver and use a Newton method to include the nonlinear contributions. Alternatively, another family of methods are based on operator-splitting the terms associated with the atomic interactions using a Strang-splitting technique. These methods naturally break equations into constituent ODE and PDE parts and preserve the structure exploited by the semi-implicit leapfrog. We study the accuracy and efficiency of these methods through a battery of 0D and 1D cases and show that a second-order-in-time Douglas-Rachford inspired coupling between the ODE and PDE advances is effective in reducing the time-discretization error to be comparable to that of Crank-Nicolson with Newton iteration of the nonlinear terms. Splitting ODE and PDE parts results in independent matrix solves for each field which reduces the computational cost considerably and provides parallelization over species relative to Crank-Nicolson.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational analysis of off-design waveriders

Comprehensive inviscid and viscous numerical simulations of hypersonic flow past nonconical rounded-nose waveriders are presented. The flow fields and aerodynamic forces at off-design conditions are determined inviscidly by a space-marching CFD code with the initial-data plane provided by a time-marching Navier-Stokes CFD code. Off-design conditions include off-design Mach numbers, angles of attack, and rounded leading edges. A wide range of waverider configurations is investigated and compared. These calculations show the effects of viscous interactions, which are influential near the leading edges, and determine the viscous drag. The inviscid calculations show that L/D decreases as freestream M increases (with alpha = 0). At the on-design Mach numbers, the maximum L/D may occur at slight positive or negative alpha, depending on the shape of the waverider, and zero lift occurs at a negative alpha approximately equal to half of the body thickness. The effects of slight leading-edge blunting produce only local effects in the flow field and small losses in L/D.

He, X.↗

Efficient Multi-Stage Time Marching for Viscous Flows via Local Preconditioning

A new method has been developed to accelerate the convergence of explicit time-marching, laminar, Navier-Stokes codes through the combination of local preconditioning and multi-stage time marching optimization. Local preconditioning is a technique to modify the time-dependent equations so that all information moves or decays at nearly the same rate, thus relieving the stiffness for a system of equations. Multi-stage time marching can be optimized by modifying its coefficients to account for the presence of viscous terms, allowing larger time steps. We show it is possible to optimize the time marching scheme for a wide range of cell Reynolds numbers for the scalar advection-diffusion equation, and local preconditioning allows this optimization to be applied to the Navier-Stokes equations. Convergence acceleration of the new method is demonstrated through numerical experiments with circular advection and laminar boundary-layer flow over a flat plate.

Kleb, William L.↗

Efficient Multi-Stage Time Marching for Viscous Flows via Local Preconditioning

A new method has been developed to accelerate the convergence of explicit time-marching, laminar, Navier-Stokes codes through the combination of local preconditioning and multi-stage time marching optimization. Local preconditioning is a technique to modify the time-dependent equations so that all information moves or decays at nearly the same rate, thus relieving the stiffness for a system of equations. Multi-stage time marching can be optimized by modifying its coefficients to account for the presence of viscous terms, allowing larger time steps. We show it is possible to optimize the time marching scheme for a wide range of cell Reynolds numbers for the scalar advection-diffusion equation, and local preconditioning allows this optimization to be applied to the Navier-Stokes equations. Convergence acceleration of the new method is demonstrated through numerical experiments with circular advection and laminar boundary-layer flow over a flat plate.

Kleb, William L.↗

Expanding the Time Dimension of Hyperspectral Infrared Sounding Observations: Designing the NUCAPS-Forecast System

Low Earth orbit (LEO) hyper-spectral infrared (IR) sounders have significant yet untapped potential for characterizing thermodynamic environments of convective initiation and ongoing convection. While LEO soundings are of enormous value to weather forecasters, they cannot provide the temporal resolution needed to resolve the rapidly evolving thermodynamics of the convective environment. A novel methodology was developed to extend snapshots of LEO soundings forward in time up to six hours into the future and has been made available within the NOAA National Weather Service Advanced Weather Interactive Processing System (AWIPS) for testing in a quasi-operational setting. This methodology is based on parcel forward-trajectory calculations from the satellite observing time to recreate future soundings of temperature and moisture at regularly gridded intervals in space and time. The soundings are based on NOAA-Unique Combined Atmospheric Processing System (NUCAPS) retrievals from the Suomi NPP and NOAA-20 satellite platforms to allow for rapid near-real time product processing. Science code was transitioned to operational production in 2019 and the product, NUCAPS-Forecast, was tested at the NOAA Hazardous Weather Testbed Spring Experiment in 2019 and 2021. Forecaster feedback has led to improving the product and processing system to address product limitations and improve its applicability for pre-convective forecasting. This presentation highlights the design of the NUCAPS-Forecast system. Solutions were tested and implemented to remove excess moisture and conjoin forward-trajected parcels into vertical profiles for calculating grids of stability indices. Additionally, use cases that explore the tendencies of derived convective available potential energy (CAPE) and convective inhibition (CIN) were investigated. When evaluated against gridded, hourly accumulated rainfall obtained from the Multi-Radar Multi-Sensor (MRMS) observational data set areas with elevated CAPE (reduced CIN) are shown to be associated with areas of precipitation and increase confidence the LEO soundings advected forward in time physically represent atmospheric processes. These results suggest that adiabatic parcel advection of LEO satellite sounding snapshots forward in time exhibits skill in discriminating locations and times that are more likely to lead to convective initiation. Leveraging trajectory modeling to increase the spatial and temporal resolution of LEO IR sounding observations today demonstrates the value of these observations from the future constellation of JPSS satellites and GeoXO mission.

weather↗

Memory-Efficient Onboard Rock Segmentation

Rockster-MER is an autonomous perception capability that was uploaded to the Mars Exploration Rover Opportunity in December 2009. This software provides the vision front end for a larger software system known as AEGIS (Autonomous Exploration for Gathering Increased Science), which was recently named 2011 NASA Software of the Year. As the first step in AEGIS, Rockster-MER analyzes an image captured by the rover, and detects and automatically identifies the boundary contours of rocks and regions of outcrop present in the scene. This initial segmentation step reduces the data volume from millions of pixels into hundreds (or fewer) of rock contours. Subsequent stages of AEGIS then prioritize the best rocks according to scientist- defined preferences and take high-resolution, follow-up observations. Rockster-MER has performed robustly from the outset on the Mars surface under challenging conditions. Rockster-MER is a specially adapted, embedded version of the original Rockster algorithm ("Rock Segmentation Through Edge Regrouping," (NPO- 44417) Software Tech Briefs, September 2008, p. 25). Although the new version performs the same basic task as the original code, the software has been (1) significantly upgraded to overcome the severe onboard re source limitations (CPU, memory, power, time) and (2) "bulletproofed" through code reviews and extensive testing and profiling to avoid the occurrence of faults. Because of the limited computational power of the RAD6000 flight processor on Opportunity (roughly two orders of magnitude slower than a modern workstation), the algorithm was heavily tuned to improve its speed. Several functional elements of the original algorithm were removed as a result of an extensive cost/benefit analysis conducted on a large set of archived rover images. The algorithm was also required to operate below a stringent 4MB high-water memory ceiling; hence, numerous tricks and strategies were introduced to reduce the memory footprint. Local filtering operations were re-coded to operate on horizontal data stripes across the image. Data types were reduced to smaller sizes where possible. Binary- valued intermediate results were squeezed into a more compact, one-bit-per-pixel representation through bit packing and bit manipulation macros. An estimated 16-fold reduction in memory footprint relative to the original Rockster algorithm was achieved. The resulting memory footprint is less than four times the base image size. Also, memory allocation calls were modified to draw from a static pool and consolidated to reduce memory management overhead and fragmentation. Rockster-MER has now been run onboard Opportunity numerous times as part of AEGIS with exceptional performance. Sample results are available on the AEGIS website at http://aegis.jpl.nasa.gov.

Burl, Michael C.↗

MEUMAPPS (C++ Version)

Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.

DeWitt, Stephen [Oak Ridge National Lab. (ORNL), O↗

Implementation of the Baldwin-Barth turbulence model into the ZETA code and its diagnosis

The Baldwin-Barth turbulence model was implemented into Zeta, a time-accurate, zonal, integro-differential code for incompressible laminar and turbulent flows. The implementation procedure is patterned after the model subroutine in ARC2D. The results of ZETA with the Baldwin-Barth turbulence model were compared with experimental data, with ZETA using Baldwin-Lomax model, and with ARC2D using the Baldwin-Barth model. The Baldwin-Barth model subroutine was tested by inputting an ARC2D velocity solution of an NACA-0012 airfoil at R(sub e) = 3.9 x 10(exp 6) and alpha = 5 deg. The resultant turbulent viscosity and Reynolds stresses compared favorably with the original data. For the same grid having grid points inside the laminar sublayer, which is necessary due to the one-equation nature of the model, ZETA however predicts early separation. It was found that the current ZETA has problem with such a fine grid. Further work is in progress to solve this problem.

Low, Scott L.↗

OPAD-EDIFIS Real-Time Processing

The Optical Plume Anomaly Detection (OPAD) detects engine hardware degradation of flight vehicles through identification and quantification of elemental species found in the plume by analyzing the plume emission spectra in a real-time mode. Real-time performance of OPAD relies on extensive software which must report metal amounts in the plume faster than once every 0.5 sec. OPAD software previously written by NASA scientists performed most necessary functions at speeds which were far below what is needed for real-time operation. The research presented in this report improved the execution speed of the software by optimizing the code without changing the algorithms and converting it into a parallelized form which is executed in a shared-memory multiprocessor system. The resulting code was subjected to extensive timing analysis. The report also provides suggestions for further performance improvement by (1) identifying areas of algorithm optimization, (2) recommending commercially available multiprocessor architectures and operating systems to support real-time execution and (3) presenting an initial study of fault-tolerance requirements.

Katsinis, Constantine↗

Advanced technology satellite demodulator development

Ford Aerospace has developed a proof-of-concept satellite 8 phase shift keying (PSK) modulation and coding system operating in the Time Division Multiple Access (TDMA) mode at a data range of 200 Mbps using rate 5/6 forward error correction coding. The 80 Msps 8 PSK modem was developed in a mostly digital form and is amenable to an ASIC realization in the next phase of development. The codec was developed as a paper design only. The power efficiency goal was to be within 2 dB of theoretical at a bit error rate (BER) of 5x10(exp 7) while the measured implementation loss was 4.5 dB. The bandwidth efficiency goal was 2 bits/sec/Hz while the realized bandwidth efficiency was 1.8 bits/sec/Hz. The burst format used a preamble of only 40 8 PSK symbol times including 32 symbols of all zeros and an eight symbol unique word. The modem and associated special test equipment (STE) were fabricated mostly on a specially designed stitch-weld board although a few of the highest rate circuits were built on printed circuit cards. All the digital circuits were ECL to support the clock rates of from 80 MHz to 360 MHz. The transmitter and receiver matched filters were square-root Nyquist bandpass filters realized at the 3.37 GHz i.f. The modem operated as a coherent system although no analog phase locked (PLL) loop was employed. Within the budgetary constraints of the program, the approach to the demodulator has been proven and is eligible to proceed to the next phase of development of a satellite demodulator engineering model. This would entail the development of an ASIC version of the digital portion of the demodulator, and MMIC version of the quadrature detector, and SAW Nyquist filters to realize the bandwidth efficiency.

Ames, Stephen A.↗

Time-synchronized VLF phase-tracking receiver

Coded signals transmitted at very low frequencies by National Bureau of Standards via its radio facility WWVL contain both primary time and frequency information. Synchronization of local time with WWVL signal standard requires comparison of phase differences between transmitted signal and output of traveling atomic clock such as rubidium frequency standard.

Ward, S. C.↗

CPU timing routines for a CONVEX C220 computer system

The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

Bynum, Mary Ann↗

An optimization program based on the method of feasible directions: Theory and users guide

The theory and user instructions for an optimization code based on the method of feasible directions are presented. The code was written for wide distribution and ease of attachment to other simulation software. Although the theory of the method of feasible direction was developed in the 1960's, many considerations are involved in its actual implementation as a computer code. Included in the code are a number of features to improve robustness in optimization. The search direction is obtained by solving a quadratic program using an interior method based on Karmarkar's algorithm. The theory is discussed, focusing on the important and often overlooked role played by the various parameters guiding the iterations within the program. Also discussed is a robust approach for handling infeasible starting points. The code was validated by solving a variety of structural optimization test problems that have known solutions obtained by other optimization codes. It has been observed that this code is accurate and robust: it has solved a variety of problems from different starting points. However, the code is inefficient in that it takes considerable CPU time as compared with certain other available codes. Further work is required to improve its efficiency while retaining its robustness.

Ashok D. Belegundu↗