Search NASA⌕ Search

SEARCH · Search NASA

Results for “Edge 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 613 records · Page 34

Effect of wind turbulence and shear on landing performance of jet transports

Computer simulations of a Boeing 727 class aircraft landing in turbulence were developed by programming the longitudinal aircraft equations of motion into a digital computer with various input values of vertical and horizontal wind speeds. Turbulent wind data was fed to the computer in one-second intervals. The computer computed in one-second intervals the aircraft speed, altitude, horizontal distance traveled, rate-of-descent, pitch attitude, glide path angle (from edge of runway) and elevator angle. All computer runs were made in the 'stick-fixed' mode. The RMS values of altitude and velocity perturbations (from equilibrium) were found to be large when horizontal wind gusts had sinusoidal components at or near the phugoid (long period) frequency. Maximum RMS altitude deviations occurred when the vertical wind had sinusoidal components which were 1/10 to 1/5 of the phugoid frequency. When real wind data (obtained from NCAR Queen Air) were used as input winds good correlations were found to exist between RMS velocity perturbations and both horizontal and vertical wind shears.

Blick, E. F.↗

In-Flight Edge Response Measurements for High Spatial Resolution Remote Sensing Systems

In-flight measurement of spatial resolution were conducted as part of the ASA Scientific Data Purchase (SDP) Validation and Verification (V&V) process. Characterization included remote sensing systems with ground sample distance (GSD) of 1 meter or less, such as the panchromatic imager on-board the ICONOS satellite and the airborne ADAR System 5500 multispectral instrument. Final image products were used to evaluate the effect of both the image acquisition system (e.g., optics, electronics, motion, jitter, atmosphere) and image post-processing (e.g., resampling, modulation trasfer function (MTF) compensator). Spatial resolution was characterized by full width at half maximum (FWHM) of an edge response-derived line spread function. This was found to be a more robust measure of spatial resolution than the value of NTF at Nyquist frequency The edge responses were analysed using the tilted-edge technique that ovecomes the spatial sampling limitations of the digital imaging systems. As an enhancement to existing algorithms, the slope of the edge response and the orientation of the edge target were determined by a single computational process. Adjacent black and white square panels, either painted on a flat surface or deployed as traps, formed the ground-based edge targets used in the tests. Orientation of the deployable tarps was optimized beforehand, based on simulations of the imaging system. Numerous edge target images were analyzed for each of the tested sensors. The effect of such factors as acquisition geometry, temporal variability, MTF compensation, and GSD on spatial resolution were investigated.

Blonski, Slawomir↗

Autoregressive long-horizon prediction of plasma edge dynamics *

Accurate modeling of scrape-off layer (SOL) and divertor-edge dynamics is vital for designing plasma-facing components in fusion devices. High-fidelity edge fluid/neutral codes such as SOLPS-ITER capture SOL physics with high accuracy, but their computational cost limits broad parameter scans and long transient studies. We present transformer-based, autoregressive surrogates for efficient prediction of 2D, time-dependent plasma edge state fields. Trained on SOLPS-ITER spatiotemporal data for the KSTAR tokamak, the surrogates forecast electron temperature, electron density, and radiated power over extended horizons. We evaluate model variants trained with increasing autoregressive horizons (1–100 steps) on short- and long-horizon prediction tasks. Longer-horizon training systematically improves rollout stability and mitigates error accumulation, enabling stable predictions over hundreds to thousands of steps and reproducing key dynamical features such as the motion of high-radiation regions. Measured end-to-end wall-clock times show the surrogate is orders of magnitude faster than SOLPS-ITER, enabling rapid parameter exploration. Prediction accuracy degrades when the surrogate enters physical regimes not represented in the training dataset, motivating future work on data enrichment and physics-informed constraints. Overall, this approach provides a fast, accurate surrogate for computationally intensive plasma edge simulations, supporting rapid scenario exploration, control-oriented studies, and progress toward real-time applications in fusion devices.

autoregressive deep learning↗

Computational Study of the CC3 Impeller and Vaneless Diffuser Experiment

Centrifugal compressors are compatible with the low exit corrected flows found in the high pressure compressor of turboshaft engines and may play an increasing role in turbofan engines as engine overall pressure ratios increase. Centrifugal compressor stages are difficult to model accurately with RANS CFD solvers. A computational study of the CC3 centrifugal impeller in its vaneless diffuser configuration was undertaken as part of an effort to understand potential causes of RANS CFD mis-prediction in these types of geometries. Three steady, periodic cases of the impeller and diffuser were modeled using the TURBO Parallel Version 4 code: 1) a k-epsilon turbulence model computation on a 6.8 million point grid using wall functions, 2) a k-epsilon turbulence model computation on a 14 million point grid integrating to the wall, and 3) a k-omega turbulence model computation on the 14 million point grid integrating to the wall. It was found that all three cases compared favorably to data from inlet to impeller trailing edge, but the k-epsilon and k-omega computations had disparate results beyond the trailing edge and into the vaneless diffuser. A large region of reversed flow was observed in the k-epsilon computations which extended from 70% to 100% span at the exit rating plane, whereas the k-omega computation had reversed flow from 95% to 100% span. Compared to experimental data at near-peak-efficiency, the reversed flow region in the k-epsilon case resulted in an under-prediction in adiabatic efficiency of 8.3 points, whereas the k-omega case was 1.2 points lower in efficiency.

Kulkarni, Sameer↗

Computational Study of the CC3 Impeller and Vaneless Diffuser Experiment

Centrifugal compressors are compatible with the low exit corrected flows found in the high pressure compressor of turboshaft engines and may play an increasing role in turbofan engines as engine overall pressure ratios increase. Centrifugal compressor stages are difficult to model accurately with RANS CFD solvers. A computational study of the CC3 centrifugal impeller in its vaneless diffuser configuration was undertaken as part of an effort to understand potential causes of RANS CFD mis-prediction in these types of geometries. Three steady, periodic cases of the impeller and diffuser were modeled using the TURBO Parallel Version 4 code: (1) a k-ε turbulence model computation on a 6.8 million point grid using wall functions, (2) a k-ε turbulence model computation on a 14 million point grid integrating to the wall, and (3) a k-ω turbulence model computation on the 14 million point grid integrating to the wall. It was found that all three cases compared favorably to data from inlet to impeller trailing edge, but the k-ε and k-ω computations had disparate results beyond the trailing edge and into the vaneless diffuser. A large region of reversed flow was observed in the k-ε computations which extended from 70 to 100 percent span at the exit rating plane, whereas the k-ω computation had reversed flow from 95 to 100 percent span. Compared to experimental data at near-peak-efficiency, the reversed flow region in the k-ε case resulted in an underprediction in adiabatic efficiency of 8.3 points, whereas the k-ω case was 1.2 points lower in efficiency.

Kulkarni, Sameer↗

CFD Sensitivity Analysis of a Modern Civil Transport Near Buffet-Onset Conditions

A computational fluid dynamics (CFD) sensitivity analysis is conducted for a modern civil transport at several conditions ranging from mostly attached flow to flow with substantial separation. Two different Navier-Stokes computer codes and four different turbulence models are utilized, and results are compared both to wind tunnel data at flight Reynolds number and flight data. In-depth CFD sensitivities to grid, code, spatial differencing method, aeroelastic shape, and turbulence model are described for conditions near buffet onset (a condition at which significant separation exists). In summary, given a grid of sufficient density for a given aeroelastic wing shape, the combined approximate error band in CFD at conditions near buffet onset due to code, spatial differencing method, and turbulence model is: 6% in lift, 7% in drag, and 16% in moment. The biggest two contributers to this uncertainty are turbulence model and code. Computed results agree well with wind tunnel surface pressure measurements both for an overspeed 'cruise' case as well as a case with small trailing edge separation. At and beyond buffet onset, computed results agree well over the inner half of the wing, but shock location is predicted too far aft at some of the outboard stations. Lift, drag, and moment curves are predicted in good agreement with experimental results from the wind tunnel.

Rumsey, Christopher L.↗

1999 NCCS Highlights

The NASA Center for Computational Sciences (NCCS) is a high-performance scientific computing facility operated, maintained and managed by the Earth and Space Data Computing Division (ESDCD) of NASA Goddard Space Flight Center's (GSFC) Earth Sciences Directorate. The mission of the NCCS is to advance leading-edge science by providing the best people, computers, and data storage systems to NASA's Earth and space sciences programs and those of other U.S. Government agencies, universities, and private institutions. Among the many computationally demanding Earth science research efforts supported by the NCCS in Fiscal Year 1999 (FY99) are the NASA Seasonal-to-Interannual Prediction Project, the NASA Search and Rescue Mission, Earth gravitational model development efforts, the National Weather Service's North American Observing System program, Data Assimilation Office studies, a NASA-sponsored project at the Center for Ocean-Land-Atmosphere Studies, a NASA-sponsored microgravity project conducted by researchers at the City University of New York and the University of Pennsylvania, the completion of a satellite-derived global climate data set, simulations of a new geodynamo model, and studies of Earth's torque. This document presents highlights of these research efforts and an overview of the NCCS, its facilities, and its people.

Bennett, Jerome↗

FPGA/ASIC framework and method for requirements-based trust assessment

Described herein are various technologies for metrics-based assessment and trust verification of netlists for hardware logic devices (e.g., ASICs, FPGAs, etc.). A computing system translates a netlist of a hardware logic device into a Boolean network. The computing system generates and assigns metrics to edges of the Boolean network. The metrics comprise a coverage metric, a rare trigger metric, and an influence metric. Based upon the metrics, the computing system assigns the nodes in the Boolean network criticality values. The computing system determines a likelihood of a vulnerability in the netlist based upon the criticality values. The computing can output an indication as to whether the netlist is trusted based upon the determined likelihood of a vulnerability in the netlist.

97 MATHEMATICS AND COMPUTING↗

UNEDF: Advanced Scientific Computing Collaboration Transforms the Low-Energy Nuclear Many-Body Problem

The demands of cutting-edge science are driving the need for larger and faster computing resources. With the rapidly growing scale of computing systems and the prospect of technologically disruptive architectures to meet these needs, scientists face the challenge of effectively using complex computational resources to advance scientific discovery. Multi-disciplinary collaborating networks of researchers with diverse scientific backgrounds are needed to address these complex challenges. The UNEDF SciDAC collaboration of nuclear theorists, applied mathematicians, and computer scientists is developing a comprehensive description of nuclei and their reactions that delivers maximum predictive power with quantified uncertainties. This paper describes UNEDF and identifies attributes that classify it as a successful computational collaboration. Finally, we illustrate significant milestones accomplished by UNEDF through integrative solutions using the most reliable theoretical approaches, most advanced algorithms, and leadership-class computational resources.

Nam, H.↗

Predicting Tensile Stretchability of Trimmed AA6111-T4 Sheets

An integrated manufacturing process simulation framework has been developed to predict the trimmed edge tensile stretchability of AA6111-T4 sheets by incorporating the burr geometry, damage, and plastic strain from trimming simulations into subsequent tensile stretchability simulations. The influence of the trimming die clearances on the predicted tensile stretching ductility (stretchability) is studied and quantitatively compared with experimental measurements. Stretchability is found to decrease with increasing cutting clearances, and simulation results have successfully captured experimentally observed edge crack initiation and failure mode variations for different trimming clearances. Subsequent computational sensitivity studies reveal that while deburring of previously trimmed edges has little influence on tensile stretchability, removal of trimmed edge initial plastic strain may significantly enhance the subsequent trimmed edge stretchability.

Aluminum alloys↗

Urban flood modeling using shallow water equations with depth-dependent anisotropic porosity

The shallow water model with anisotropic porosity conceptually takes into account the unresolved subgrid-scale features, e.g. microtopography or buildings. This enables computationally efficient simulations that can be run on coarser grids, whereas reasonable accuracy is maintained via the introduction of porosity. This article presents a novel numerical model for the depth-averaged equations with anisotropic porosity. The porosity is calculated using the probability mass function of the subgrid-scale features in each cell and updated in each time step. The model is tested in a one-dimensional theoretical benchmark before being evaluated against measurements and high-resolution predictions in three case studies: a dam-break over a triangular bottom sill, a dam-break through an idealized city and a rainfall-runoff event in an idealized urban catchment. The physical processes could be approximated relatively well with the anisotropic porosity shallow water model. The computational resolution influences the porosities calculated at the cell edges and therefore has a large influence on the quality of the solution. The computational time decreased significantly, on average three orders of magnitude, in comparison to the classical high-resolution shallow water model simulation.

finite volume method↗

Effectiveness of Flow Control for Alleviation of Twin-Tail Buffet

Effectiveness of active flow control for twin- tail buffet alleviation is investigated. Tangen- tial leading-edge blowing (TLEB) and flow suction along the vortex cores (FSVC) of the lead- ing edges of the delta wing are used to delay the vortex breakdown flow upstream of the twin tail. The combined effect of the TLEB and FSVC is also investigated. A parametric study of the effects of the spanwise position of the suction tubes and volumetric suction flow rate on the twin-tail buffet response are also investigated. The TLEB moves the path of leading-edge vortices laterally towards the twin tail, which increases the aero- dynamic damping on the tails. The FSVC effectively delays the breakdown location at high angles of attack. The computational model consists of a sharp-edged delta wing of aspect ratio one and swept-back flexible twin tail with taper ratio of 0.23. This complex multidisciplinary problem is solved sequentially using three sets of equations for the fluid flow, aeroelastic response and grid deformation, on a dynamic multi-block grid structure. The computational model is pitched at 30 deg. angle of attack. The freestream Mach number and Reynolds number are 0.3 and 1.25 million, respectively. The model is investigated for the inboard position of the twin tails, which corresponds to a separation distance between the twin tails of 33% of the wing span.

Sheta, Essam F.↗

The fusion code XGC: Enabling kinetic study of multi-scale edge turbulent transport in ITER [Book Chapter]

The XGC fusion gyrokinetic code combines state-of-the-art, portable computational and algorithmic technologies to enable complicated multiscale simulations of turbulence and transport dynamics in ITER edge plasma on the largest US open-science computer, the CRAY XK7 Titan, at its maximal heterogeneous capability, which have not been possible before due to a factor of over 10 shortage in the time-to-solution for less than 5 days of wall-clock time for one physics case. Frontier techniques such as nested OpenMP parallelism, adaptive parallel I/O, staging I/O and data reduction using dynamic and asynchronous applications interactions, dynamic repartitioning for balancing computational work in pushing particles and in grid related work, scalable and accurate discretization algorithms for non-linear Coulomb collisions, and communication-avoiding subcycling technology for pushing particles on both CPUs and GPUs are also utilized to dramatically improve the scalability and time-to-solution, hence enabling the difficult kinetic ITER edge simulation on a present-day leadership class computer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Prediction and control of slender-wing rock

The unsteady Euler equations and the Euler equations of rigid-body dynamics, both written in the moving frame of reference, are sequentially solved to simulate the limit-cycle rock motion of slender delta wings. The governing equations of the fluid flow and the dynamics of the present multidisciplinary problem are solved using an implicit, approximately-factored, central-difference-like, finite-volume scheme and a four-stage Runge-Kutta scheme, respectively. For the control of wing-rock motion, leading-edge flaps are forced to oscillate anti-symmetrically at prescribed frequency and amplitude, which are tuned in order to suppress the rock motion. Since the computational grid deforms due to the leading-edge flaps motion, the grid is dynamically deformed using the Navier-displacement equations. Computational applications cover locally-conical and three-dimensional solutions for the wing-rock simulation and its control.

Kandil, Osama A.↗

An improved panel method for the solution of three-dimensional leading edge vortex flows Volume 2: User's guide and programmer's document

A computer program developed for solving the subsonic, three dimensional flow over wing-body configurations with leading edge vortex separation is presented. Instructions are given for the proper set up and input of a problem into the computer code. Program input formats and output are described, as well as the overlay structure of the program. The program is written in FORTRAN.

Tinoco, E. N.↗

Vectorization of Dynamic Subgraphs via Generative Models (Final Report)

An important class of data analysis tasks stem from comparing subsets of connected records within massive sets of complex relational data. A common approach is to represent each set of connected records with a small graph, or set of data entities (graph vertices) and their relationships (graph edges), and efficient methods to gauge similarity for pairs of graphs are of high interest. This project concentrated on dynamic graphs, where each edge record has an associated timestamp denoting the time of observation. Pre-existing techniques for comparing dynamic graphs concentrate on either computing graph edit distance (number of vertex and edge deletion, addition, and timestamp modifications) or vectorizing the graph with counts of a limited set of dynamic graph motifs (tiny fundamental subgraphs) and computing distances between the vectors. These approaches are less able to see similarities in graphs that are fairly different in size but come from identical graph generation processes. The motif counting approach can be improved for graphs from the same process, but suffers from requiring many types of motifs meaning it is expensive. Moreover, many motifs are not present for small graphs, meaning realizing a a much larger graph came from the same process is difficult.

97 MATHEMATICS AND COMPUTING↗

Robust automatic rigid registration of MRI and X-ray using external fiducial markers for XFM-guided interventional procedures

Purpose: In X-ray fused with MRI, previously gathered roadmap MRI volume images are overlaid on live X-ray fluoroscopy images to help guide the clinician during an interventional procedure. The incorporation of MRI data allows for the visualization of soft tissue that is poorly visualized under X-ray. The widespread clinical use of this technique will require fully automating as many components as possible. While previous use of this method has required time-consuming manual intervention to register the two modalities, in this article, the authors present a fully automatic rigid-body registration method. Methods: External fiducial markers that are visible under these two complimentary imaging modalities were used to register the X-ray images with the roadmap MR images. The method has three components: (a) The identification of the 3D locations of the markers from a full 3D MR volume, (b) the identification of the 3D locations of the markers from a small number of 2D X-ray fluoroscopy images, and (c) finding the rigid-body transformation that registers the two point sets in the two modalities. For part (a), the localization of the markers from MR data, the MR volume image was thresholded, connected voxels were segmented and labeled, and the centroids of the connected components were computed. For part (b), the X-ray projection images, produced by an image intensifier, were first corrected for distortions. Binary mask images of the markers were created from the distortion-corrected X-ray projection images by applying edge detection, pattern recognition, and image morphological operations. The markers were localized in the X-ray frame using an iterative backprojection-based method which segments voxels in the volume of interest, discards false positives based on the previously computed edge-detected projections, and calculates the locations of the true markers as the centroids of the clusters of voxels that remain. For part (c), a variant of the iterative closest point method was used to find correspondences between and register the two sets of points computed from MR and X-ray data. This knowledge of the correspondence between the two point sets was used to refine, first, the X-ray marker localization and then the total rigid-body registration between modalities. The rigid-body registration was used to overlay the roadmap MR image onto the X-ray fluoroscopy projections. Results: In 35 separate experiments, the markers were correctly registered to each other in 100% of the cases. When half the number of X-ray projections was used (10 X-ray projections instead of 20), the markers were correctly registered in all 35 experiments. The method was also successful in all 35 experiments when the number of markers was (retrospectively) halved (from 16 to 8). The target registration error was computed in a phantom experiment to be less than 2.4 mm. In two in vivo experiments, targets (interventional devices with pointlike metallic structures) inside the heart were successfully registered between the two modalities. Conclusions: The method presented can be used to automatically register a roadmap MR image to X-ray fluoroscopy using fiducial markers and as few as ten X-ray projections.

60 APPLIED LIFE SCIENCES↗

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗