Search NASASearch

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 91 records · Page 5

Comparison of computations and experimental data for leading edge vortices - Effects of yaw and vortex flaps

Computations are presented using the conical Euler equations for swept delta wings with leading edge vortices. All the wings have sharp leading edges swept at 75 degrees to the freestream. In addition to an idealized flat plate model, geometrical features also included are thickness, centerbody, and two vortex flaps. Freestream Mach numbers of 1.7 to 2.8, angles of attack of 10 and 12 degrees, and angles of yaw of 0 and 8 degrees are considered. The computations are compared with pitot pressure traverses for one case. Other calculations are compared with surface pressure data and vapor screen pictures recently obtained at NASA Langley Research Center. The comparisons indicate that the dominant features of these flows are adequately modeled by the Euler equations, but viscous models are needed for the surface boundary layer and secondary separations.

Murman, E. M.

A computational study of incipient leading-edge separation on a 65-deg delta wing at M = 1.60

A computational study on a 65-deg delta wing at a freestream Mach number of 1.60 has been conducted by obtaining conical Reynolds-averaged Navier-Stokes solutions on a parametric series of geometries which varied in leading-edge radius and/or circular-arc camber. The computational results showed that increasing leading-edge radius or camber can delay the onset of leading-edge separation on the leeside of a delta wing at a specific angle of attack. Reynolds number was varied from 1 x 10 to the 6th to 5 x 10 to the 6th for a turbulent boundary-layer and was shown to have a minor effect on the effectiveness of leading-edge radius and/or camber in delaying the onset of leading-edge separation. Both laminar and turbulent boundary-layer models were investigated at a Reynolds number of 1 x 10 to the 6th, and the predicted flow pattern was found to change from attached flow for the turbulent boundary-layer model to separated flow for the laminar boundary-layer model. Based upon these results, three wind-tunnel models have been designed to be tested in the Langley Unitary Plan Wind Tunnel.

Mcmillin, S. Naomi

Compressible Navier-Stokes equations: A study of leading edge effects

A computational method is developed that allows numerical calculations of the time dependent compressible Navier-Stokes equations.The current results concern a study of flow past a semi-infinite flat plate.Flow develops from given inflow conditions upstream and passes over the flat plate to leave the computational domain without reflecting at the downstream boundary. Leading edge effects are included in this paper. In addition, specification of a heated region which gets convected with the flow is considered. The time history of this convection is obtained, and it exhibits a wave phenomena.

Hariharan, S. I.

Computer simulation and evaluation of edge detection algorithms and their application to automatic path selection

The construction of an autonomous roving vehicle requires the development of complex data-acquisition and processing systems, which determine the path along which the vehicle travels. Thus, a vehicle must possess algorithms which can (1) reliably detect obstacles by processing sensor data, (2) maintain a constantly updated model of its surroundings, and (3) direct its immediate actions to further a long range plan. The first function consisted of obstacle recognition. Obstacles may be identified by the use of edge detection techniques. Therefore, the Kalman Filter was implemented as part of a large scale computer simulation of the Mars Rover. The second function consisted of modeling the environment. The obstacle must be reconstructed from its edges, and the vast amount of data must be organized in a readily retrievable form. Therefore, a Terrain Modeller was developed which assembled and maintained a rectangular grid map of the planet. The third function consisted of directing the vehicle's actions.

Longendorfer, B. A.

Computational Test Cases for a Clipped Delta Wing with Pitching and Trailing-Edge Control Surface Oscillations

Computational test cases have been selected from the data set for a clipped delta wing with a six-percent-thick circular-arc airfoil section that was tested in the NASA Langley Transonic Dynamics Tunnel. The test cases include parametric variation of static angle of attack, pitching oscillation frequency, trailing-edge control surface oscillation frequency, and Mach numbers from subsonic to low supersonic values. Tables and plots of the measured pressures are presented for each case. This report provides an early release of test cases that have been proposed for a document that supplements the cases presented in AGARD Report 702.

Bennett, Robert M.

Computational theory of line drawing interpretation

The recovery of the three dimensional structure of visible surfaces depicted in an image by emphasizing the role of geometric cues present in line drawings, was studied. Three key components are line classification, line interpretation, and surface interpolation. A model for three dimensional line interpretation and surface orientation was refined and a theory for the recovery of surface shape from surface marking geometry was developed. A new approach to the classification of edges was developed and implemented signatures were deduced for each of several edge types, expressed in terms of correlational properties of the image intensities in the vicinity of the edge. A computer program was developed that evaluates image edges as compared with these prototype signatures.

Witkin, A. P.

LCLS Big Data Handling – How I Learned to Stop Worrying and Love the Data Deluge

Advanced data and computing systems are vital to Linac Coherent Light Source (LCLS) operations, data interpretation and overall scientific productivity. The transition to MHz-era operation marks a fundamental change in scale that requires new infrastructure and architectures to link LCLS to the required scale of computing needed for scientific interpretation. The LCLS-II Data System meets big data challenges by implementing configurable data reduction that can adapt to multiple science areas, real-time analysis frameworks to provide visualization and fast feedback, and the ability to transfer data to local and remote computational facilities for near real time analysis at the appropriate scale. Feature extracted information generated in the data analysis pipeline - at the edge, local compute, or remote High-Performance Computing (HPC) resources - can be used to steer experiments and inform user decisions during beam time. Artificial Intelligence and Machine Learning (AI/ML) techniques present new opportunities to rapidly analyse large datasets and direct experiments, but create new challenges in scaling, adaptability, complexity, and trustworthiness. We describe how the LCLS-II Data System architecture addresses its data-driven challenges in the areas of data acquisition, data processing, data management, and workflow orchestration to decrease the overall time-to-science and provide a vision for future developments.

artificial intelligence

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex

On bottleneck partitioning k-ary n-cubes

Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a function of edges exposed by the partition) is minimized. Measures of partition quality vary; in this paper we consider a processor's cost to be the sum of its computation and communication costs, and consider the cost of a partition to be the bottleneck, or maximal processor cost induced by the partition. For a general graph the problem of finding an optimal partitioning is intractable. In this paper we restrict our attention to the class of k-art n-cube graphs with uniformly weighted nodes. Given mild restrictions on the node weight and number of processors, we identify partitions yielding the smallest bottleneck. We also demonstrate by example that some restrictions are necessary for the partitions we identify to be optimal. In particular, there exist cases where partitions that evenly partition nodes need not be optimal.

Nicol, David M.

Computational fluid mechanics

Two papers are included in this progress report. In the first, the compressible Navier-Stokes equations have been used to compute leading edge receptivity of boundary layers over parabolic cylinders. Natural receptivity at the leading edge was simulated and Tollmien-Schlichting waves were observed to develop in response to an acoustic disturbance, applied through the farfield boundary conditions. To facilitate comparison with previous work, all computations were carried out at a free stream Mach number of 0.3. The spatial and temporal behavior of the flowfields are calculated through the use of finite volume algorithms and Runge-Kutta integration. The results are dominated by strong decay of the Tollmien-Schlichting wave due to the presence of the mean flow favorable pressure gradient. The effects of numerical dissipation, forcing frequency, and nose radius are studied. The Strouhal number is shown to have the greatest effect on the unsteady results. In the second paper, a transition model for low-speed flows, previously developed by Young et al., which incorporates first-mode (Tollmien-Schlichting) disturbance information from linear stability theory has been extended to high-speed flow by incorporating the effects of second mode disturbances. The transition model is incorporated into a Reynolds-averaged Navier-Stokes solver with a one-equation turbulence model. Results using a variable turbulent Prandtl number approach demonstrate that the current model accurately reproduces available experimental data for first and second-mode dominated transitional flows. The performance of the present model shows significant improvement over previous transition modeling attempts.

Hassan, H. A.

Computation of subsonic base flow on a vector processor

Two-dimensional subsonic laminar compressible base flow has been studied using numerical solutions of the time-dependent Navier-Stokes equations. These solutions were obtained using an explicit finite-difference scheme which is highly efficient on a vector processor. The organization of the code for a CDC CYBER-205 computer is described. Solutions were obtained for Mach 0.4 and 0.6 flows past a slender blunt-based model at moderately high Reynolds numbers. The flow in the wake is unsteady with periodic shedding of vortices from the trailing edge. The computed shedding frequency was found to increase with increasing Reynolds number.

Rudy, D. H.

Capturing Coupled Structural and Electronic Motions During Excited-State Intramolecular Proton Transfer via Computational Multiedge Resonant Inelastic X-ray Scattering

Proton-transfer processes build the foundation of many chemical processes. In Excited State Intramolecular Proton Transfer (ESIPT) processes the proton transfer process is impulsively started through light. Here, in this study, we explore the changes in coupled atomic and electronic motions during and following ESIPT through computational time-resolved Resonant Inelastic X-ray Scattering (trRIXS). Excited-state Ab Initio Molecular Dynamics (AIMD) simulations combined with Time-Dependent Density Functional Theory (TDDFT) calculations were performed for 10-hydroxybenzo[h]quinoline to obtain trRIXS signatures. RIXS at both the nitrogen and oxygen K-edges were computed to resolve the dynamics electronic structure from both the proton donor and acceptor perspective. The results show how RIXS can reveal the local electronic structure, the coupling between different electronic states and how electronic structure and coupling change during the proton transfer process. Additionally, we observe a strong correlation between spectral changes and structural changes during ESIPT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

White paper on science operations

Major changes are taking place in the way astronomy gets done. There are continuing advances in observational capabilities across the frequency spectrum, involving both ground-based and space-based facilities. There is also very rapid evolution of relevant computing and data management technologies. However, although the new technologies are filtering in to the astronomy community, and astronomers are looking at their computing needs in new ways, there is little coordination or coherent policy. Furthermore, although there is great awareness of the evolving technologies in the arena of operations, much of the existing operations infrastructure is ill-suited to take advantage of them. Astronomy, especially space astronomy, has often been at the cutting edge of computer use in data reduction and image analysis, but has been somewhat removed from advanced applications in operations, which have tended to be implemented by industry rather than by the end-user scientists. The purpose of this paper is threefold. First, we briefly review the background and general status of astronomy-related computing. Second, we make recommendations in three areas: data analysis; operations (directed primarily to NASA-related activities); and issues of management and policy, believing that these must be addressed to enable technological progress and to proceed through the next decade. Finally, we recommend specific NASA-related work as part of the Astrotech-21 plans, to enable better science operations in the operations of the Great Observatories and in the lunar outpost era.

Schreier, Ethan J.

An Approach to Reasoning Service Migration in Data and Reasoning Fabric (DRF) Implementation

In this paper we consider service migration problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, estimates of the response time, consumed energy and total cost are defined for each potential compute location. A mixed-integer linear program is then formulated and solved to identify optimal compute locations given QoS constraints, network infrastructure limitations, with worst-case vehicle positioning. The approach is applied to trajectory re-planning use case to avoid a collision with an emergency vehicle in real time.

Air mobility

Submillisecond Optical Knife-Edge Testing

Fast computer-controlled sampling of optical knife-edge response (KER) signal increases accuracy of optical system aberration measurement. Submicrosecond-response detectors in optical focal plane convert optical signals to electrical signals converted to digital data, sampled and feed into computer for storage and subsequent analysis. Optical data are virtually free of effects of index-of-refraction gradients.

Thurlow, P.

Toward an AI-Powered Software Pipeline for Real-Time Tracking and Analysis of Wildfire and Smoke

Real-time tracking of wildfires and smoke is crucial for effective response, minimizing damage, protecting lives, and efficiently managing resources during fire emergencies. We develop a web-based AI-powered pipeline that detects wildfires in aerial video and estimates deployment-relevant behavior metrics, including cumulative burned area, burned-area growth rate, fire spread direction, and smoke dispersion. The system combines a YOLO-based detector with YCbCr-based fire segmentation, HSV-based smoke segmentation, Farneback optical flow, and centroid-based spatiotemporal tracking. Using ground sampling distance (GSD), pixel-level fire masks are converted to physical burned-area measurements by correlating fire pixel counts with camera altitude and tilt angle. We benchmark YOLO variants and non-YOLO baselines (GoogLeNet, CNN, DBN, Autoencoder, U-Net, and AlexNet) on the IEEE FLAME dataset and a newly created aerial frame dataset, Wildfire-DB. Cross-dataset evaluation uses a strict threshold-transfer protocol: decision thresholds are selected on FLAME validation and transferred unchanged to Wildfire-DB to quantify generalization under domain shift. YOLOv6 achieves the strongest cross-dataset frame-level fire detection on Wildfire-DB (ROC-AUC 0.8200, PR-AUC 0.8044, and transferred-threshold F1 0.7596). For tracking-oriented deployment requiring oriented localization, YOLO11-OBB provides the most reliable cross-dataset behavior among OBB-capable models while remaining computationally feasible. To analyze the feasibility of UAV deployment, we further measure inference efficiency using synchronized GPU and CPU power logs on a fixed workload of 1569 frames. YOLO-family models process the video in 5.73–12.47 seconds with net energy of 1247.28–1775.39 J, substantially lower latency and energy than heavier classification and reconstruction baselines. Overall, model optimality depends on operational objectives: YOLOv6 is best for cross-dataset detection robustness, whereas YOL...

Color segmentation

A 3-D Computational Study of a Variable Camber Continuous Trailing Edge Flap (VCCTEF) Spanwise Segment

Results of a computational study carried out to explore the effects of various elastomer configurations joining spanwise contiguous Variable Camber Continuous Trailing Edge Flap (VCCTEF) segments are reported here. This research is carried out as a proof-of-concept study that will seek to push the flight envelope in cruise with drag optimization as the objective. The cruise conditions can be well off design such as caused by environmental conditions, maneuvering, etc. To handle these off-design conditions, flap deflection is used so when the flap is deflected in a given direction, the aircraft angle of attack changes accordingly to maintain a given lift. The angle of attack is also a design parameter along with the flap deflection. In a previous 2D study,1 the effect of camber was investigated and the results revealed some insight into the relative merit of various camber settings of the VCCTEF. The present state of the art has not advanced sufficiently to do a full 3-D viscous analysis of the whole NASA Generic Transport Model (GTM) wing with VCCTEF deployed with elastomers. Therefore, this study seeks to explore the local effects of three contiguous flap segments on lift and drag of a model devised here to determine possible trades among various flap deflections to achieve desired lift and drag results. Although this approach is an approximation, it provides new insights into the "local" effects of the relative deflections of the contiguous spanwise flap systems and various elastomer segment configurations. The present study is a natural extension of the 2-D study to assess these local 3-D effects. Design cruise condition at 36,000 feet at free stream Mach number of 0.797 and a mean aerodynamic chord (MAC) based Reynolds number of 30.734x10(exp 6) is simulated for an angle of attack (AoA) range of 0 to 6 deg. In the previous 2-D study, the calculations revealed that the parabolic arc camber (1x2x3) and circular arc camber (VCCTEF222) offered the best L/D characteristics and minimum drag in cruise. In the present 3-D study, calculations show that for the same C(sub t), the 3-D circular arc camber wing segment produces the largest drag for a given lift, larger than either of the two 2-D configurations, as was also conjectured in the previous study. This study indicates a wing stall around 4.5 deg angle of attack.

Camber