SEARCH · Search NASA

Results for “COMPUTER NETWORKS”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,567 records · Page 87

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Distributed output-feedback model predictive control for multi-agent consensus

We introduce a distributed output-feedback model predictive control approach for achieving consensus among multiple agents. Each agent computes a distributed control action based on an output-feedback measurement of a local neighborhood tracking error and communicates information only to its neighbors, according to a communication network modeled as a directed graph. Each agent computes its distributed control action by solving a local min–max optimization problem that simultaneously computes a local state estimate and control input under worst-case assumptions on unmeasured input disturbances and measurement noise. Under easily verified controllability and observability assumptions, this distributed output-feedback model predictive control approach provides an upper bound on the group consensus error, thereby ensuring practical consensus in the presence of unmeasured disturbances and noise. A numerical example with four agents connected in a directed graph is demonstrated to illustrate the results.

42 ENGINEERING↗

DOE OSTI2024

Machine learning-enhanced model-based scenario optimization for DIII-D

Abstract Scenario development in tokamaks is an open area of investigation that can be approached in a variety of different ways. Experimental trial and error has been the traditional method, but this required a massive amount of experimental time and resources. As high fidelity predictive models have become available, offline development and testing of proposed scenarios has become an option to reduce the required experimental resources. The use of predictive models also offers the possibility of using a numerical optimization process to find the controllable inputs that most closely achieve the desired plasma state. However, this type of optimization can require as many as hundreds or thousands of predictive simulation cases to converge to a solution; many of the commonly used high fidelity models have high computational burdens, so it is only reasonable to run a handful of predictive simulations. In order to make use of numerical optimization approaches, a compromise needs to be found between model fidelity and computational burden. This compromise can be achieved using neural networks surrogates of high fidelity models that retain nearly the same level of accuracy as the models they are trained to replicate while reducing the computation time by orders of magnitude. In this work, a model-based numerical optimization tool for scenario development is described. The predictive model used by the optimizer includes neural network surrogate models integrated into the fast Control-Oriented Transport simulation framework. This optimization scheme is able to converge to the optimal values of the controllable inputs that produce the target plasma scenario by running thousands of predictive simulations in under an hour without sacrificing too much prediction accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

The Portals 4.3 Network Programming Interface

This report presents a specification for the Portals 4 network programming interface. Portals 4 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4 is well suited to massively parallel processing and embedded systems. Portals 4 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

DragonView: Toward Understanding Network Interference in Dragonfly-based Supercomputers

Acquiring and maintaining high performance computing systems represents a substantial, long term investment. Therefore, it is paramount to optimize their utilization in order to maximize the return on investment and the impact on science and engineering. In this context, network congestion and inter-job interference are a major challenge as they can lead to significant systemwide performance degregation. This is especially pertinent in shared interconnects such as the dragonfly network, in which resources are shared by multiple jobs. Since many large-scale applications are communication-bound, a few communication heavy applications can have a large impact on the performance of all jobs and decrease the overall system throughput. In this paper, we describe a web-based visual analytics environment to study congestion and inter-job interference on dragonfly networks. The system enables network architects, system administrators and application developers to explore the potential impact of machine configuration, job placement policies and routing algorithms by visualizing and comparing ensembles of simulated workloads and real world data. We focus on the design of the system and describe the challenges, design decisions and the final implementation. Finally, we present two detailed case studies of prototypical analysis sessions by our stakeholders aimed at exploring the implications of different workloads and machine configurations using ensembles of network simulations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

C++ Tensor Toolbox User Manual (V.1.0)

The C++ Tensor Toolbox is a software package for computing tensor decompositions. It is based on the Matlab Tensor Toolbox, and is particularly optimized for sparse data sets. This user manual briefly overviews tensor decomposition mathematics, software capabilities, and installation of the package. Tensors (also known as multidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to network analysis. The Tensor Toolbox provides classes for manipulating dense, sparse, and structured tensors in C++. The Toolbox compiles into libraries and is intended for use with custom applications written by users.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2017

Enabling Diverse Software Stacks on Supercomputers using High Performance Virtual Clusters.

While large-scale simulations have been the hallmark of the High Performance Computing (HPC) community for decades, Large Scale Data Analytics (LSDA) workloads are gaining attention within the scientific community not only as a processing component to large HPC simulations, but also as standalone scientific tools for knowledge discovery. With the path towards Exascale, new HPC runtime systems are also emerging in a way that differs from classical distributed com- puting models. However, system software for such capabilities on the latest extreme-scale DOE supercomputing needs to be enhanced to more appropriately support these types of emerging soft- ware ecosystems. In this paper, we propose the use of Virtual Clusters on advanced supercomputing resources to enable systems to support not only HPC workloads, but also emerging big data stacks. Specifi- cally, we have deployed the KVM hypervisor within Cray's Compute Node Linux on a XC-series supercomputer testbed. We also use libvirt and QEMU to manage and provision VMs directly on compute nodes, leveraging Ethernet-over-Aries network emulation. To our knowledge, this is the first known use of KVM on a true MPP supercomputer. We investigate the overhead our solution using HPC benchmarks, both evaluating single-node performance as well as weak scaling of a 32-node virtual cluster. Overall, we find single node performance of our solution using KVM on a Cray is very efficient with near-native performance. However overhead increases by up to 20% as virtual cluster size increases, due to limitations of the Ethernet-over-Aries bridged network. Furthermore, we deploy Apache Spark with large data analysis workloads in a Virtual Cluster, ef- fectively demonstrating how diverse software ecosystems can be supported by High Performance Virtual Clusters.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

To add floating point numbers in a parallel computing system, a collective logic device receives the floating point numbers from computing nodes. The collective logic devices converts the floating point numbers to integer numbers. The collective logic device adds the integer numbers and generating a summation of the integer numbers. The collective logic device converts the summation to a floating point number. The collective logic device performs the receiving, the converting the floating point numbers, the adding, the generating and the converting the summation in one pass. One pass indicates that the computing nodes send inputs only once to the collective logic device and receive outputs only once from the collective logic device.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Knowledge-guided learning with curated prior genetic biomarkers for robust model interpretation

Abstract Motivation Knowledge-guided learning offers effective and robust model training strategies in data-scarce settings by incorporating established domain knowledge, thereby enhancing generalization, robustness, and interpretability. By contrast, conventional deep learning approaches rely purely on data-driven learning, which can limit robust model interpretability, particularly in high-dimensional settings with limited size samples. In computational biology, knowledge-guided learning has primarily leveraged network- and structural-based knowledge, leading to biologically interpretable representations and enhanced predictive performance compared to conventional approaches. However, curated biomarkers, one of the most accessible forms of biological knowledge, remain largely unexplored within knowledge-guided paradigms. Results In this study, we propose a model-agnostic training paradigm, Biomarker-driven Explainable Prior-guided Learning (BioExPL), that can be applied to any neural networks that incorporates curated prior knowledge. BioExPL enforces neural networks to reflect curated biomarker priors in their latent representations through a novel knowledge-alignment loss. BioExPL consistently demonstrated significantly improved predictive performance and enhanced model interpretability with minimized computational overhead in simulation studies and intensive experiments on multiple cancer datasets. BioExPL not only integrates prior curated knowledge into the model but also accurately identifies unknown associated signals additionally. BioExPL is model-agnostic and domain-independent, enabling its integration into diverse neural network architectures. Availability and implementation The open-source is publicly available at: https://github.com/datax-lab/BioExPL.

Baek, Beomsu [Department of Computer Science, Univ↗

DOE OSTI2021

Operation of Natural Gas Pipeline Networks With Storage Under Transient Flow Conditions

Here, we formulate a nonlinear optimal control problem for intraday operation of a natural gas pipeline network that includes storage reservoirs. The dynamics of compressible gas flow through pipes, compressors, reservoirs, and wells are considered. In particular, a reservoir is modeled as a rigid, hollow container that stores gas under isothermal conditions and uniform density, and a well is modeled as a vertical pipe. For each pipe, flow dynamics are described by a coupled partial differential equation (PDE) system in density and mass flux variables, with momentum dissipation modeled using the Darcy–Wiesbach friction approximation. Compressors are modeled as scaling up the pressure of gas between the inlet and outlet. The governing equations for all network components are spatially discretized and assembled into a nonlinear differential-algebraic equation (DAE) system, which synthesizes above-ground pipeline and subsurface reservoir dynamics into a single reduced-order model. We seek to maximize an objective function that quantifies economic profit and network efficiency subject to the flow equations and inequalities that represent operating limitations. The problem is solved using a primal–dual interior point solver, and the solutions are validated in computational experiments and simulations on several pipeline test networks to demonstrate the effectiveness of the proposed methodology.

03 NATURAL GAS↗

DOE OSTI2024

Source shape estimation for neutron imaging systems using convolutional neural networks

Neutron imaging systems are important diagnostic tools for characterizing the physics of inertial confinement fusion reactions at the National Ignition Facility (NIF). In particular, neutron images give diagnostic information on the size, symmetry, and shape of the fusion hot spot and surrounding cold fuel. Images are formed via collection of neutron flux from the source using a system of aperture arrays and scintillator-based detectors. Currently, reconstruction of fusion source geometry from the collected neutron images is accomplished by solving a computationally intensive maximum likelihood estimation problem via expectation maximization. In contrast, it is often useful to have simple representations of the overall source geometry that can be computed quickly. In this work, we develop convolutional neural networks (CNNs) to reconstruct the outer contours of simple source geometries. We compare the performance of the CNN for penumbral and pinhole data and provide experimental demonstrations of our methods on both non-noisy and noisy data.

Machine learning, neutron imaging, source reconstr↗

DOE OSTI2020

Computationally efficient optimization models for preliminary distillation column design and separation energy targeting

We propose versatile shortcut distillation column and separation energy targeting models that are well-suited for superstructure-based process synthesis. The models are based on a novel reformulation of the Underwood equations to address systems where the components that are present in the feed can vary due to zero flow rates of some components. Also, we propose valid constraints, resulting in a significant enhancement of the computational performance of the models. Furthermore, the proposed distillation column model can automatically identify adequate key components and the energy requirement of a desired separation task, while considering a wide range of types of separations including non-sharp/sloppy splits. Also, the proposed separation energy targeting model can be used to estimate an energy requirement target for the separation of a mixture without finding detail network configurations. Due to their versatility and computational efficiency, the proposed models can be readily used for and expand the scope of superstructure-based process synthesis approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2014

PMU Data Integrity Evaluation through Analytics on a Virtual Test-Bed

Power systems are rapidly becoming populated by phasor measurement units (PMUs) in ever increasing numbers. PMUs are critical components of today s energy management systems, designed to enable near real-time wide area monitoring and control of the electric power system. They are able to measure highly accurate bus voltage phasors as well as branch current phasors incident to the buses at which PMUs are equipped. Synchrophasor data is used for applications varying from state estimation, islanding control, identifying outages, voltage stability detection and correction, disturbance recording, and others. However, PMU-measured readings may suffer from errors due to meter biases or drifts, incorrect configurations, or even cyber-attacks. Furthermore, the testing of early PMUs showed a large disparity between the reported values from PMUs provided by different manufacturers, particularly when frequency was off-nominal, during dynamic events, and when harmonic/inter-harmonic content was present. Detection and identification of PMU gross measurement errors are thus crucial in maintaining highly accurate phasor readings throughout the system. In this paper, we present our work in conducting analytics to determine the trustworthiness and worth of the PMU readings collected across an electric network system. By implementing the IEEE 118 bus test case on a virtual test bed (VTB) , we are able to emulate PMU readings (bus voltage and branch current phasors in addition to bus frequencies) under normal and abnormal conditions using (virtual) PMU sensors deployed across major substations in the network. We emulate a variety of failures such as bus, line, transformer, generator, and/or load failures. Data analytics on the voltage phase angles and frequencies collected from the PMUs show that specious (or compromised) PMU device(s) can be identified through abnormal behaviour by comparing the trend of its frequency and phase angle reading with the ensemble of all other PMU readings in the network. If the reading trend of a particular PMU deviates from the weighted average of the reading trends of other PMUs at nearby substations, then it is likely that the PMU is malfunctioning. We assign a weight to each PMU denoting how electric-topology-wise close it is from where the PMU under consideration is located. The closer a PMU is, the higher the weight it has. To compute the closeness between two nodes in the power network, we employ a form of the resistance distance metric. It computes the electrical distance by taking into consideration the underlying topology as well as the physical laws that govern the electrical connections or flows between the network components. The detection accuracy of erroneous PMUs should be improved by employing this metric. We present results to validate the proposed approach. We also discuss the effectiveness of using an end-to-end VTB approach that allows us to investigate different types of failures and their responses as seen by the ensemble of PMUs. The collected data on certain types of events may be amenable to certain types of analysis (e.g., alerting for sudden changes can be done on a small window of data) and hence determine the data analytics architectures is required to evaluate the streaming PMU data.

and data analytics architecture.↗

DOE OSTI2022

Modeling Combustion Reaction ODEs with Neural Networks

The chemistry of combustion reactions is complex as it involves many species and reactions. In practice, such a system is often modeled computationally using an empirically derived chemical mechanism. Given the large range of reaction rates, the system is then time evolved using a stiff ODE solver. However, even when reduced chemical mechanisms are employed, the system can become computationally expensive for two-dimensional or three-dimensional systems. Such systems can also face problems with instability. As such, it is desirable to find a cheaper, stable alternative to solving the reaction system. Neural networks offer the potential to learn these reaction ODEs and time evolve a combustion reaction in a more cost-efficient manner than stiff ODE solvers. In this study, a variety of neural networks are trained on zero-dimensional Cantera simulations of methane combustion with varying initial conditions. Several predictive approaches as well as several neural network architectures (artificial neural network with dropout, ResNet, and Neural ODE) are compared in their ability to predict combustion trajectories. Promising models are then identified.

combustion kinetics↗

DOE OSTI2021

Constructing tensor network influence functionals for general quantum dynamics

Here, we describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Extensive Attention Mechanisms in Graph Neural Networks for Materials Discovery

We present our research where attention mechanism is extensively applied to various aspects of graph neural net- works for predicting materials properties. As a result, surrogate models can not only replace costly simulations for materials screening but also formulate hypotheses and insights to guide further design exploration. We predict formation energy of the Materials Project and gas adsorption of crystalline adsorbents, and demonstrate the superior performance of our graph neural networks. Moreover, attention reveals important substructures that the machine learning models deem important for a material to achieve desired target properties. Our model is based solely on standard structural input files containing atomistic descriptions of the adsorbent material candidates. We construct novel methodological extensions to match the prediction accuracy of state-of-the-art models some of which were built with hundreds of features at much higher computational cost. We show that sophisticated neural networks can obviate the need for elaborate feature engineering. Our approach can be more broadly applied to optimize gas capture processes at industrial scale.

Cong, Guojing↗

DOE OSTI2023

Assessment of Cloud-Based Applications Enabling a Scalable Risk-Informed Predictive Maintenance Strategy Across the Nuclear Fleet

The current light water reactor fleet uses time-based or failure-based maintenance strategies to achieve high-capacity factors. But to make nuclear more competitive in the energy market, these reactors could utilize emerging technologies in terms of artificial intelligence (AI) and cloud computing to enable a cost-effective, predictive maintenance strategy. This report examines the feasibility of cloud computing for the nuclear industry’s needs in terms of the cloud’s computing capabilities, feasibility, and regulatory concerns. The technical viability of cloud computing was analyzed using one year worth of data from a boiling water reactor’s safety relief valve. Models were hosted on a local desktop, Idaho National Laboratory’s high-performance computer, and Microsoft Azure. Data was loaded, processed, and two types of models were trained in an A/B fashion. Based on the speed at which these actions were completed, it was used to determined that cloud computing has adequate computing resources. Additionally, the computing power can scale with the demanded load. To enable cloud computing in the existing fleet, additional sensors, networks, and other requirements must be implemented to ensure a smooth transition from current maintenance strategies. However, there is a benefit as the plant no longer needs manage their own servers, software, cybersecurity, and IT support staff. Many of these features can be offloaded on to the cloud provider. A comprehensive analysis was completed that showed the current annual cost of operating is more expensive than using cloud computing resources. Lastly, the regulatory framework does not explicitly address AI or autonomous control. Currently, the NRC and other regulatory bodies are evaluating providing guidance to address gaps rather than new regulations to address the use of AI and ML. But since many of the AI applications are focused on non-safety related applications, such as balance-of-plant components, they will likely have little or no regulatory restrictions or necessary approvals. Demonstrating how AI can improve maintenance and operation of these non-safety related systems seems like the likely path forward for implementing AI and cloud computing resources inside nuclear power plants (NPPs).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2016

Functional network inference of the suprachiasmatic nucleus

In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data from individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Lastly, we used two computational models of circadian neurons to validate our predictions of network structure.

97 MATHEMATICS AND COMPUTING↗