Search NASA⌕ Search

SEARCH · Search NASA

Results for “nodes”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Anomaly forecasting and early warning generation

The example embodiments are directed to a system and method for forecasting anomalies in feature detection. In one example, the method includes storing feature behavior information of at least one monitoring node of an asset, including a normalcy boundary identifying normal feature behavior and abnormal feature behavior for the at least one monitoring node in feature space, receiving input signals from the at least one monitoring node of the asset and transforming the input signals into feature values in the feature space, wherein the feature values are located within the normalcy boundary, forecasting that a future feature value corresponding to a future input signal from the at least one monitoring node is going to be positioned outside the normalcy boundary based on the feature values within the normalcy boundary, and outputting information concerning the forecasted future feature value being outside the normalcy boundary for display.

Abbaszadeh, Masoud↗
DOE OSTI2022

Scalable hierarchical abnormality localization in cyber-physical systems

A cyber-physical system may have monitoring nodes that generate a series of current monitoring node values over time that represent current operation of the system. A hierarchical abnormality localization computer platform accesses a multi-level hierarchy of elements, and elements in a first level of the hierarchy are associated with elements in at least one lower level of the hierarchy and at least some elements may be associated with monitoring nodes. The computer platform may then determine, based on feature vectors and a decision boundary, an abnormality status for a first element in the highest level of the hierarchy. If the abnormality status indicates an abnormality, the computer platform may determine an abnormality status for elements, associated with the first element, in at least one level of the hierarchy lower than the level of the first element. These determinations may be repeated until an abnormality is localized to a monitoring node.

Abbaszadeh, Masoud↗
DOE OSTI2023

Disaggregated system domain

An approach is disclosed that configures a computer system node from components that are each connected to an intra-node network. The configuring is performed by selecting a set of components, including at least one processor, and assigning each of the components a different address range within the node. An operating system is run on the processor included in the node with the operating system accessing each of the assigned components.

Kahle, James A.↗
DOE OSTI2023

Gas sensor system

A gas sensing tube includes an outer surface, and an inner surface defining a passage. A sensor node is arranged along the sensing tube. The sensor node includes an inlet fluidically connected to the passage, an outlet fluidically connected to the passage, and an interior chamber arranged between the inlet and the outlet. A sensor cable extends along the sensing tube. The sensor cable includes a first conduit having a first connector coupled to the sensor node at the inlet and a second conduit having a second connector connected to the sensor node at the outlet. The sensor cable has a first conductor extending through the first conduit and being coupled to the first connector and a second conductor extending through the second conduit and being coupled to the second connector.

Challener, William Albert↗
DOE OSTI2023

Optimized asynchronous training of neural networks using a distributed parameter server with eager updates

A method of training a neural network includes, at a local computing node, receiving remote parameters from a set of one or more remote computing nodes, initiating execution of a forward pass in a local neural network in the local computing node to determine a final output based on the remote parameters, initiating execution of a backward pass in the local neural network to determine updated parameters for the local neural network, and prior to completion of the backward pass, transmitting a subset of the updated parameters to the set of remote computing nodes.

Hamidouche, Khaled↗
DOE OSTI2023

Network cache injection for coherent GPUs

Methods, devices, and systems for GPU cache injection. A GPU compute node includes a network interface controller (NIC) which includes NIC receiver circuitry which can receive data for processing on the GPU, NIC transmitter circuitry which can send the data to a main memory of the GPU compute node and which can send coherence information to a coherence directory of the GPU compute node based on the data. The GPU compute node also includes a GPU which includes GPU receiver circuitry which can receive the coherence information; GPU processing circuitry which can determine, based on the coherence information, whether the data satisfies a heuristic; and GPU loading circuitry which can load the data into a cache of the GPU from the main memory if on the data satisfies the heuristic.

LeBeane, Michael W.↗
DOE OSTI2023

Systems and methods for global cyber-attack or fault detection model

An industrial asset may have monitoring nodes that generate current monitoring node values representing a current operation of the industrial asset. An abnormality detection computer may detect when a monitoring node is currently being attacked or experiencing a fault based on a current feature vector, calculated in accordance with current monitoring node values, and a detection model that includes a decision boundary. A model updater (e.g., a continuous learning model updater) may determine an update time-frame (e.g., short-term, mid-term, long-term, etc.) associated with the system based on trigger occurrence detection (e.g., associated with a time-based trigger, a performance-based trigger, an event-based trigger, etc.). The model updater may then update the detection model in accordance with the determined update time-frame (and, in some embodiments, continuous learning).

Xu, Rui↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗
DOE OSTI2020

GrAMME: Semisupervised Learning Using Multilayered Graph Attention Models

Modern data analysis pipelines are becoming increasingly complex due to the presence of multiview information sources. While graphs are effective in modeling complex relationships, in many scenarios, a single graph is rarely sufficient to succinctly represent all interactions, and hence, multilayered graphs have become popular. Though this leads to richer representations, extending solutions from the single-graph case is not straightforward. Consequently, there is a strong need for novel solutions to solve classical problems, such as node classification, in the multilayered case. In this article, we consider the problem of semisupervised learning with multilayered graphs. Though deep network embeddings, e.g., DeepWalk, are widely adopted for community discovery, we argue that feature learning with random node attributes, using graph neural networks, can be more effective. To this end, we propose to use attention models for effective feature learning and develop two novel architectures, GrAMME-SG and GrAMME-Fusion, that exploit the interlayer dependences for building multilayered graph embeddings. Using empirical studies on several benchmark data sets, we evaluate the proposed approaches and demonstrate significant performance improvements in comparison with the state-of-the-art network embedding strategies. The results also show that using simple random features is an effective choice, even in cases where explicit node attributes are not available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Open-Source Contributions to Arbiter2

Login nodes at High-Performance Computing (HPC) sites are shared resources used by a multitude of users to compile, test and submit jobs to the batch system. Because these nodes are shared by multiple users at any time, if a minority of users are using a significant proportion of the resources of the node (CPU, memory, etc.), other users' tasks may be negatively impacted. Arbiter2 is an open-source project developed by the University of Utah that aims to prevent these occurrences by dynamically limiting the resources of users depending on whether they are excessively using resources. INL has sought to adapt and develop Arbiter2 for a potential deployment at INL and plans on upstreaming the changes and improvements so that other HPC sites running Arbiter2 can benefit from their work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

AdS 6 /CFT 5 with O7-planes

Type IIB AdS6 solutions with orientifold 7-planes are constructed. The geometry is a warped product of AdS 6 and S 2 over a Riemann surface Σ and the O7-planes correspond to a particular type of puncture on Σ. The solutions are identified as near-horizon limits of (p,q) 5-brane webs with O7-planes. The dual 5d SCFTs have relevant deformations to linear quiver gauge theories which have SO(•) or USp(•) nodes or SU(•) nodes with hypermultiplets in symmetric or antisymmetric representations, in addition to SU(•) nodes with fundamental hypermultiplets. The S 5 free energies are obtained holographically and matched to field theory computations using supersymmetric localization to support the proposed dualities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Activity of Brønsted Acid Sites in UiO-66 for Cyclohexanol Dehydration

Brønsted-acid sites are introduced via –OSO 3 H groups on the coordinatively unsaturated ZrO 2 nodes of UiO-66 metal organic frameworks (MOF). Such groups create strong Brønsted acidic sites that are active for cyclohexanol and ethanol dehydration (in liquid organic phase and gas phase, respectively). The intrinsic activity of Brønsted acid sites at nodes increased by increasing the concentration of sulfur, which is attributed to a shift from isolated µ 3 -OSO 3 H to two groups [(µ 3 -OSO 3 H) 2 ] interacting via hy-drogen bonding. For cyclohexanol dehydration, the relatively low activation enthalpies and negative transition entropies point to an E2 elimination mechanism, similar to dehydration with MFI zeolites in organic solvents. Furthermore, our results, show that the catalytic activity can be manipulated via the functionalization of zirconia nodes of the MOF framework.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Ad Hoc File Systems for High-Performance Computing

Storage backends of parallel compute clusters are still based mostly on magnetic disks, while newer and faster storage technologies such as flash-based SSDs or non-volatile random access memory (NVRAM) are deployed within compute nodes. Including these new storage technologies into scientific workflows is unfortunately today a mostly manual task, and most scientists therefore do not take advantage of the faster storage media. One approach to systematically include nodelocal SSDs or NVRAMs into scientific workflows is to deploy ad hoc file systems over a set of compute nodes, which serve as temporary storage systems for single applications or longer-running campaigns. This paper presents results from the Dagstuhl Seminar 17202 “Challenges and Opportunities of User-Level File Systems for HPC” and discusses application scenarios as well as design strategies for ad hoc file systems using node-local storage media. The discussion includes open research questions, such as how to couple ad hoc file systems with the batch scheduling environment and how to schedule stage-in and stage-out processes of data between the storage backend and the ad hoc file systems. Also presented are strategies to build ad hoc file systems by using reusable components for networking and how to improve storage device compatibility. Various interfaces and semantics are presented, for example those used by the three ad hoc file systems BeeOND, GekkoFS, and BurstFS. Their presentation covers a range from file systems running in production to cutting-edge research focusing on reaching the performance limits of the underlying devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A real-time distributed solid oxide electrolysis cell (SOEC) model for cyber-physical simulation

System integration and dynamic operability between SOEC and balance-of-plant (BoP) components are major technical challenges before realizing rapid load following of SOEC systems. Cyber-physical simulation (CPS) is a leading-edge digital engineering approach and is regarded as the next step beyond Digital Twins. CPS approach can be used to research SOEC system integration and develop dynamic controls prior to actual pilot testing without using a real SOEC. To seamlessly couple with BoP hardware and access non-observable operational parameters (e.g., local temperature gradient) during transients, a distributed one-dimensional (1D) real-time SOEC model was developed. Its real-time execution was demonstrated for 20 to 640 nodes at the fixed time step of 5 ms. A higher excess air ratio enabled smaller local temperature gradients on SOEC solid materials and faster transients upon current density step change from 0.15 to 0.55 A cm -2 . During the transients, the magnitude of the peak temperature gradient nearly doubled in 10 s from -3.5 to -5.9 °C cm -1 . This represents a significant operating risk that can impact the dynamic operability of SOEC systems. In addition, the local temperature gradient was found to change directions on all nodes in SOEC solid materials, with the greatest impact on the upstream nodes. The SOEC model was also tested at the thermal neutral voltage using actual process air flow parameters as variable model inputs. Variable process air temperatures were found to induce alternating local temperature gradients on SOEC solid materials. These are new operational mechanisms for SOEC degradation relevant for load following operational modes yet distinct from previous reports. To mitigate these unfavorable features, the SOEC can be operated at voltages that are slightly (±20 mV) deviated from the thermal neutral voltage. Here, the corresponding net thermal energy change was less than 1.6% of the electric power consumption. This 1D real-time SOEC model established the basis of cyber-physical simulation of SOEC hybrid systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A hybrid meshfree discretization to improve the numerical performance of peridynamic models

Efficient and accurate calculation of spatial integrals is of major interest in the numerical implementation of peridynamics (PD). The standard way to perform this calculation is a particle-based approach that discretizes the strong form of the PD governing equation. This approach has rapidly been adopted by the PD community since it offers some advantages. Additionally, it is computationally cheaper than other available schemes, can conveniently handle material separation, and effectively deals with nonlinear PD models. Nevertheless, PD models are still computationally very expensive compared with those based on the classical continuum mechanics theory, particularly for large-scale problems in three dimensions. This results from the nonlocal nature of the PD theory which leads to interactions of each node of a discretized body with multiple surrounding nodes. Here, we propose a new approach to significantly boost the numerical efficiency of PD models. We propose a discretization scheme that employs a simple collocation procedure and is truly meshfree; i.e., it does not depend on any background integration cells. In contrast to the standard scheme, the proposed scheme requires a much smaller set of neighboring nodes (keeping the same physical length scale) to achieve a specific accuracy and is thus computationally more efficient. Our new scheme is applicable to the case of linear PD models and within neighborhoods where the solution can be approximated by smooth basis functions. Therefore, to fully exploit the advantages of both the standard and the proposed schemes, a hybrid discretization is presented that combines both approaches within an adaptive framework. The high performance of the developed framework is illustrated by several numerical examples, including brittle fracture and corrosion problems in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2025

An attention-based neural ordinary differential equation framework for modeling inelastic processes

To preserve strictly conservative behavior as well as model the variety of dissipative behavior displayed by solid materials, we propose a significant enhancement to the internal state variable-neural ordinary differential equation (ISV-NODE) framework. In this data-driven, physics-constrained modeling framework internal states are inferred rather than prescribed. The ISV-NODE consists of: (a) a stress model dependent on observable deformation and inferred internal state, and (b) a model of the evolution of the internal states. The enhancements to ISV-NODE proposed in this work are multifold: (a) a partially input convex neural network stress potential provides polyconvexity in terms of observed strain while leaving the inferred state unconstrained, and (b) an internal state flow model uses common latent features to inform novel attention-based gating and drives the flow of internal state only in dissipative regimes. We demonstrated that this architecture can accurately model dissipative and conservative behavior across an isotropic, isothermal elastic-viscoelastic-elastoplastic spectrum with three exemplars, while maintaining fundamental principles by design.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗