Search NASA⌕ Search

SEARCH · Search NASA

Results for “edge computer”

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 919 records · Page 51

Emerging applications: Neuromorphic computing and reservoir computing

The emergence of doped hafnium oxide (HfO 2 )-based ferroelectric films has enabled highly scalable and silicon-compatible ferroelectric devices, opening new frontiers in neuromorphic and reservoir computing. Among these, ferroelectric field-effect transistors (FeFETs) are particularly promising due to their analog memory characteristics and unique polarization dynamics. These properties make FeFETs ideal candidates for artificial synapses in neuromorphic architectures, supporting deep neural networks and spiking neural networks based on leaky-integrate-and-fire (LIF) mechanisms. Beyond neuromorphic computing, FeFETs also play a crucial role in physical reservoir computing, leveraging their intrinsic nonlinear and history-dependent behavior for efficient real-time learning. This approach offers significant advantages for time-series processing and edge artificial intelligence (AI) applications, addressing the growing need for energy-efficient computing. As a result, this article explores the principles, key demonstrations, and future potential of FeFET-based neuromorphic and reservoir computing, highlighting their impact on next-generation AI hardware.

36 MATERIALS SCIENCE↗

Extended Simulations of Graphene Growth with Updated Rate Coefficients

New simulations of graphene growth in flame environments are presented. The simulations employ a kinetic Monte Carlo (KMC) algorithm coupled to molecular mechanics (MM) geometry optimization to track individual graphenic species as they evolve. Focus is given to incorporation of five-member rings and resulting curvature and edge defects. The model code has been re-written to be more computationally efficient enabling a larger set of simulations to be run, decreasing stochastic fluctuations in the averaged results. The model also includes updated rate coefficients for graphene edge reactions recently published in the literature. The new simulations are compared to results from the previous model as well as to hydrogen to carbon ratios recorded in experiment and calculated with alternate models.

30 DIRECT ENERGY CONVERSION↗

Spectroscopic, Computational, and Kinetic Studies of the Mu-Sulfide-Bridged Tetranuclear CuZ Cluster in N(2)O Reductase: PH Effect on the Edge Ligand and its Contribution to Reactivity

A combination of spectroscopy and density functional theory (DFT) calculations has been used to evaluate the pH effect at the Cu{sub Z} site in Pseudomonas nautica (Pn) nitrous oxide reductase (N{sub 2}OR) and Achromobacter cycloclastes (Ac) N{sub 2}OR and its relevance to catalysis. Absorption, magnetic circular dichroism, and electron paramagnetic resonance with sulfur K-edge X-ray absorption spectra of the enzymes at high and low pH show minor changes. However, resonance Raman (rR) spectroscopy of PnN{sub 2}OR at high pH shows that the 415 cm{sup -1} Cu-S vibration (observed at low pH) shifts to higher frequency, loses intensity, and obtains a 9 cm{sup -1} {sup 18}O shift, implying significant Cu-O character, demonstrating the presence of a OH{sup -} ligand at the Cu{sub I}Cu{sub IV} edge. From DFT calculations, protonation of either the OH{sup -} to H{sub 2}O or the {mu}{sub 4}-S{sup 2-} to {mu}{sub 4}-SH{sup -} would produce large spectral changes which are not observed. Alternatively, DFT calculations including a lysine residue at an H-bonding distance from the Cu{sub I}Cu{sub IV} edge ligand show that the position of the OH{sup -} ligand depends on the protonation state of the lysine. This would change the coupling of the Cu-(OH) stretch with the Cu-S stretch, as observed in the rR spectrum. Thus, the observed pH effect (pK{sub a} {approx} 9.2) likely reflects protonation equilibrium of the lysine residue, which would both raise E{sup o} and provide a proton for lowering the barrier for the N-O cleavage and for reduction of the [Cu{sub 4}S(im){sub 7}OH]{sup 2+} to the fully reduced 4Cu{sup I} active form for turnover.

59 BASIC BIOLOGICAL SCIENCES↗

A Locally Adapting Technique for Edge Detection using Image Segmentation

Rapid growth in the field of quantitative digital image analysis is paving the way for scientific researchers to make precise measurements about objects in an image. To compute quantities from an image such as the density of compressed materials or the velocity of a shockwave, object boundaries must first be determined. Images containing regions that each have a spatial trend in intensity are of particular interest here. For edge detection, we present a supervised, statistical image segmentation method that incorporates spatial information to locate boundaries between regions with overlapping intensity histograms, specifically for images where the regions are known but precise boundary locations are unknown. The segmentation of a pixel is determined by comparing its intensity to distributions from nearby pixel intensities, and a gradient of the segmented image indicates edge locations. Because of the statistical nature of the algorithm, we use maximum likelihood estimation to quantify uncertainty about each boundary. We demonstrate the success of this algorithm at locating boundaries and providing uncertainty bands on a radiograph of a multicomponent cylinder and on an optical image of a laser-induced shockwave.

97 MATHEMATICS AND COMPUTING↗

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

Shock Location Dominated Transonic Flight Loads on the Active Aeroelastic Wing

During several Active Aeroelastic Wing research flights, the shadow of the over-wing shock could be observed because of natural lighting conditions. As the plane accelerated, the shock location moved aft, and as the shadow passed the aileron and trailing-edge flap hinge lines, their associated hinge moments were substantially affected. The observation of the dominant effect of shock location on aft control surface hinge moments led to this investigation. This report investigates the effect of over-wing shock location on wing loads through flight-measured data and analytical predictions. Wing-root and wing-fold bending moment and torque and leading- and trailing-edge hinge moments have been measured in flight using calibrated strain gages. These same loads have been predicted using a computational fluid dynamics code called the Euler Navier-Stokes Three Dimensional Aeroelastic Code. The computational fluid dynamics study was based on the elastically deformed shape estimated by a twist model, which in turn was derived from in-flight-measured wing deflections provided by a flight deflection measurement system. During level transonic flight, the shock location dominated the wing trailing-edge control surface hinge moments. The computational fluid dynamics analysis based on the shape provided by the flight deflection measurement system produced very similar results and substantially correlated with the measured loads data.

Lokos, William A.↗

Fusion Simulation Program Execution Plan

The overall science goal of the FSP is to develop predictive simulation capability for magnetically confined fusion plasmas at an unprecedented level of integration and fidelity. This will directly support and enable effective U.S. participation in research related to the International Thermonuclear Experimental Reactor (ITER) and the overall mission of delivering practical fusion energy. The FSP will address a rich set of scientific issues together with experimental programs, producing validated integrated physics results. This is very well aligned with the mission of the ITER Organization to coordinate with its members the integrated modeling and control of fusion plasmas, including benchmarking and validation activities. Initial FSP research will focus on two critical areas: 1) the plasma edge and 2) whole device modeling including disruption avoidance. The first of these problems involves the narrow plasma boundary layer and its complex interactions with the plasma core and the surrounding material wall. The second requires development of a computationally tractable, but comprehensive model that describes all equilibrium and dynamic processes at a sufficient level of detail to provide useful prediction of the temporal evolution of fusion plasma experiments. The initial driver for the whole device model (WDM) will be prediction and avoidance of discharge-terminating disruptions, especially at high performance, which are a critical impediment to successful operation of machines like ITER. If disruptions prove unable to be avoided, their associated dynamics and effects will be addressed in the next phase of the FSP. The FSP plan targets the needed modeling capabilities by developing Integrated Science Applications (ISAs) specific to their needs. The Pedestal-Boundary model will include boundary magnetic topology, cross-field transport of multi-species plasmas, parallel plasma transport, neutral transport, atomic physics and interactions with the plasma wall. It will address the origins and structure of the plasma electric field, rotation, the L-H transition, and the wide variety of pedestal relaxation mechanisms. The Whole Device Model will predict the entire discharge evolution given external actuators (i.e., magnets, power supplies, heating, current drive and fueling systems) and control strategies. Based on components operating over a range of physics fidelity, the WDM will model the plasma equilibrium, plasma sources, profile evolution, linear stability and nonlinear evolution toward a disruption (but not the full disruption dynamics). The plan assumes that, as the FSP matures and demonstrates success, the program will evolve and grow, enabling additional science problems to be addressed. The next set of integration opportunities could include: 1) Simulation of disruption dynamics and their effects; 2) Prediction of core profile including 3D effects, mesoscale dynamics and integration with the edge plasma; 3) Computation of non-thermal particle distributions, self-consistent with fusion, radio frequency (RF) and neutral beam injection (NBI) sources, magnetohydrodynamics (MHD) and short-wavelength turbulence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The effect of spin-orbit coupling in band structure and edge states of bilayer graphene

Topological insulators are predicted to be useful ranging from spintronics to quantum computation. Graphene was first predicted to be the precursor of topological insulator by Kane-Mele. They developed a Hamiltonian model to describe the gap opening in graphene. In this work, we investigate the band structure of bilayer grapheme and also its edge states by using this model with analytical approach. The results of our calculation show that the gap opening occurs at K and K’ point in bilayer graphene.In addition, a pair of gapless edge modes occurs both in the zigzag and arm-chair configurations are no longer exist. There are gap created at the edge even though thery are very small.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A viscous starter solution for shuttle flow field computations

A time dependent numerical procedure that calculates the viscous flow in the shock layer around the shuttle nose has been developed. It has been applied to the free stream conditions that may be encountered in the shuttle flight trajectory and found to be efficient and in satisfactory agreement with other steady and unsteady techniques. Two features associated with the present formulation are responsible for its successful applications. The first is that the flow field computation is made within the shock layer; the second is that the mapping of the computational region places proportionately more mesh points in the vicinity of the wall than in the remaining computational region. The numerical results may be used for low altitude flight to determine the edge conditions for a thin boundary layer, to provide initial boundary layer profiles for downstream boundary layer calculations, and to start supersonic computations. For high altitude flight, it may be used to determine the complete flow field in the nose region and also provide a starter solution for subsequent supersonic flow computations.

Li, C. P.↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Chapel HyperGraph Library (CHGL)

We present the Chapel Hpergraph Library (CHGL), a library for hypergraph computation in the emerging Chapel language. Hypergraphs generalize graphs, where a hypergraph edge can connect any number of vertices. Thus, hypergraphs capture high-order, high-dimensional interactions between mulitple entities that are not directly expressible in graphs. CHGL is designed to provide HPC-class computation with high-level abstractions and modern language support for parallel comptuing on shared memory and distributed memory systems.

Jenkins, Louis P.↗

The Approximability of Partial Vertex Covers in Trees.

Motivated by applications in risk management of computational systems, we focus our attention on a special case of the partial vertex cover problem, where the underlying graph is assumed to be a tree. Here, we consider four possible versions of this setting, depending on whether vertices and edges are weighted or not. Two of these versions, where edges are assumed to be unweighted, are known to be polynomial-time solvable (Gandhi, Khuller, and Srinivasan, 2004). However, the computational complexity of this problem with weighted edges, and possibly with weighted vertices, has not been determined yet. The main contribution of this paper is to resolve these questions, by fully characterizing which variants of partial vertex cover remain intractable in trees, and which can be efficiently solved. In particular, we propose a pseudo-polynomial DP-based algorithm for the most general case of having weights on both edges and vertices, which is proven to be NPhard. This algorithm provides a polynomial-time solution method when weights are limited to edges, and combined with additional scaling ideas, leads to an FPTAS for the general case. A secondary contribution of this work is to propose a novel way of using centroid decompositions in trees, which could be useful in other settings as well.

97 MATHEMATICS AND COMPUTING↗

US Department of Energy, Office of Science High Performance Computing Facility Operational Assessment 2021: Oak Ridge Leadership Computing Facility

Oak Ridge National Laboratory’s (ORNL’s) Leadership Computing Facility (OLCF) continues to surpass its operational target goals of supporting users; delivering fast, reliable computational ecosystems; creating innovative solutions for high-performance computing (HPC) needs; contributing to the community to build the next generation HPC workforce, and managing risks, safety, and security associated with operating some of the most powerful computers in the world. The results can be seen in the cutting-edge science conducted by users and the praise from the research community. Calendar year (CY) 2021 saw continued excellence in research supported by the OLCF’s leadership-class computing resources, including Summit (the nation’s most powerful supercomputer), the global scratch file system Alpine, the Scalable Protected Infrastructure (SPI), the Exploratory Visualization Environment for Research in Science and Technology (EVEREST), and the archival mass-storage resource High-Performance Storage System (HPSS). While maintaining access and exceptional user support for Summit, the OLCF continued to make progress on the installation and deployment of Frontier, which will be the nation’s first exascale system when it comes online at the start of CY 2023. Users have already begun running and optimizing scientific codes on Crusher, the OLCF test and development system equipped with Frontier’s architecture. Throughout the year, the OLCF maintained a strong culture of operational excellence, including risk management, workplace safety, and cybersecurity. The OLCF’s rigorous risk management strategy anticipated and mitigated risks, and at this time there are no high-priority operational risks. Similarly, ORNL and the OLCF were committed to operating under the US Department of Energy’s (DOE’s) safety regulations that ensure a safe workplace. Technical staff tracked and monitored existing threats and vulnerabilities within the OLCF while continually developing tools and practices to enhance operations without increasing the facility’s risk. CY 2021 was filled with outstanding results and accomplishments, including a very high rating from users on overall satisfaction for the eighth consecutive year; a tremendous number of node hours delivered to 1,671 researchers on Summit; and the successful delivery of the allocation split of roughly 60%, 20%, and 20% of core-hours offered for the Innovative and Novel Computational Impact on Theory and Experiment (INCITE), Advanced Scientific Computing Research Leadership Computing Challenge (ALCC), and Director’s Discretionary (DD) programs, respectively (Section 2). COVID-19 research remained a focus in 2021, and the ALCC and DD programs allocated over 1 million Summit hours to the COVID-19 High Performance Computing Consortium. These accomplishments, coupled with the high utilization rates (i.e., overall and capability usage), represent the fulfillment of the promise of leadership class machines: efficient facilitation of leadership-class computational applications.

97 MATHEMATICS AND COMPUTING↗

Divergence preserving reconstruction of the nodal components of a vector field from its normal components to edges

We have developed a new divergence preserving method for the reconstruction of the Cartesian components of a vector field from the orthogonal projection of a vector field to the normals to edges in two dimensional. In this method, discrete divergences computed from the nodal components and from the normal ones are exactly the same. Our new method consists of two stages. At the first stage, we use an extended version of the local procedure described in [J. Comput. Phys., 139:406–409, 1998] to obtain a ‘reference’ nodal vector. This local procedure is exact for linear vector fields; however, the discrete divergence is not preserved. Then, we formulate a constrained optimization problem, in which this reference vector plays the role of a target, and the divergence constraints are enforced by using Lagrange multipliers. It leads to the solution of ‘elliptic’ like discrete equations for the cell-centered Lagrange multipliers. The new global divergence preserving method is exact for linear vector fields. Here in this paper, we describe all details of our new method and present numerical results, which confirm our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components

A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only if removing any three edges from it results in either a connected graph or a graph with exactly two connected components one of which is a single-vertex one. We show how to associate with any 3-connected graph a tree of components such that every component is a 3-connected and cyclically 4-edge-connected graph.

97 MATHEMATICS AND COMPUTING↗

Bringing chemical structures to life with augmented reality, machine learning, and quantum chemistry

Visualizing 3D molecular structures is crucial to understanding and predicting their chemical behavior. However, static 2D hand-drawn skeletal structures remain the preferred method of chemical communication. Here, we combine cutting-edge technologies in augmented reality (AR), machine learning, and computational chemistry to develop MolAR, an open-source mobile application for visualizing molecules in AR directly from their hand-drawn chemical structures. Users can also visualize any molecule or protein directly from its name or protein data bank ID and compute chemical properties in real time via quantum chemistry cloud computing. MolAR provides an easily accessible platform for the scientific community to visualize and interact with 3D molecular structures in an immersive and engaging way.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning for imaging Cherenkov detectors

Imaging Cherenkov detectors are largely used in modern nuclear and particle physics experiments where cutting-edge solutions are needed to face always more growing computing demands. This is a fertile ground for AI-based approaches and at present we are witnessing the onset of new highly efficient and fast applications. This paper presents novel directions with applications to Cherenkov detectors. In particular, recent advances on detector design and calibration, as well as particle identification are presented.

47 OTHER INSTRUMENTATION↗

Single-photon absorption and dynamic control of the exciton energy in a coupled quantum-dot-cavity system

We theoretically investigate the dynamic interaction of a quantum dot in a nanocavity with time-symmetric single-photon pulses. The simulations, based on a wave-function approach, reveal that almost perfect single-photon absorption occurs for quantum-dot-cavity systems operating on the edge between strong- and weak-coupling regimes. The computed maximum absorption probability is close to unity for pulses with a typical length comparable to half of the Rabi period. Furthermore, the dynamic control of the quantum-dot energy via electric fields allows the freezing of the light-matter interaction, leaving the quantum dot in its excited state. Shaping of single-photon wave packets by the electric field control is limited by the occurrence of chirping of the single-photon pulse. This understanding of the interaction of single-photon pulses with the quantum-dot-cavity system provides the basis for the development of advanced protocols for quantum-information processing in the solid state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗