Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational network”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Convolutional Neural Network for Segmenting Micro-X-ray Computed Tomography Images of Wood Cellular Structures

To further enhance the performance of wood products, improved tools are needed to study in situ cellular scale phenomena like mechanical deformations and moisture swelling. Micro-X-ray computed tomography (μXCT) using brilliant synchrotron light sources now has the spatial and temporal resolution for real-time visualization of phenomena in three-dimensional cellular structures. However, the tradeoff for speed includes the loss of intensity contrast between different types of materials within the imaged structure, such as cell wall and air in wood. This loss of contrast prevents traditional histogram-based segmentation methods from being used effectively. A new convolutional neural network (CNN) approach was therefore developed to segment fast μXCT images of wood into cell wall and air volumes. The fast μXCT and segmentation were demonstrated in the study of moisture swelling in loblolly pine (Pinus taeda) earlywood and latewood cellular structures conditioned at 0%, 33%, 75%, and 95% relative humidity (RH). The CNN segmentation results had a mean intersection over union (IoU) metric accuracy of 96%. Initial analysis of the swelling in the latewood revealed cell walls swelled about 25% when conditioned from 0% to 95% RH. Additionally, the widths of ray cell lumina in the transverse plane of latewood could be observed to increase at higher RH. The segmentation method presented here will facilitate future quantitative analyses in in situ μXCT studies of wood and other similar cellular materials.

Arzola-Villegas, Xavier (ORCID:0000000305369766)↗
DOE OSTI2022

Towards a more general understanding of the algorithmic utility of recurrent connections

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Analysis of mobility data to build contact networks for COVID-19

As social distancing policies and recommendations went into effect in response to COVID-19, people made rapid changes to the places they visit. These changes are clearly seen in mobility data, which records foot traffic using location trackers in cell phones. While mobility data is often used to extract the number of customers that visit a particular business or business type, it is the frequency and duration of concurrent occupancy at those sites that governs transmission. Understanding the way people interact at different locations can help target policies and inform contact tracing and prevention strategies. This paper outlines methods to extract interactions from mobility data and build networks that can be used in epidemiological models. Several measures of interaction are extracted: interactions between people, the cumulative interactions for a single person, and cumulative interactions that occur at particular businesses. Network metrics are computed to identify structural trends which show clear changes based on the timing of stay-at-home orders. Measures of interaction and structural trends in the resulting networks can be used to better understand potential spreading events, the percent of interactions that can be classified as close contacts, and the impact of policy choices to control transmission.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1993

Software For Graphical Representation Of A Network

System Visualization Tool (SVT) computer program developed to provide systems engineers with means of graphically representing networks. Generates diagrams illustrating structures and states of networks defined by users. Provides systems engineers powerful tool simplifing analysis of requirements and testing and maintenance of complex software-controlled systems. Employs visual models supporting analysis of chronological sequences of requirements, simulation data, and related software functions. Applied to pneumatic, hydraulic, and propellant-distribution networks. Used to define and view arbitrary configurations of such major hardware components of system as propellant tanks, valves, propellant lines, and engines. Also graphically displays status of each component. Advantage of SVT: utilizes visual cues to represent configuration of each component within network. Written in Turbo Pascal(R), version 5.0.

Mcallister, R. William↗
NASA NTRS2004

Job Scheduling in a Heterogeneous Grid Environment

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

Shan, Hong-Zhang↗
NASA NTRS2003

Information Power Grid Posters

This document is a summary of the accomplishments of the Information Power Grid (IPG). Grids are an emerging technology that provide seamless and uniform access to the geographically dispersed, computational, data storage, networking, instruments, and software resources needed for solving large-scale scientific and engineering problems. The goal of the NASA IPG is to use NASA's remotely located computing and data system resources to build distributed systems that can address problems that are too large or complex for a single site. The accomplishments outlined in this poster presentation are: access to distributed data, IPG heterogeneous computing, integration of large-scale computing node into distributed environment, remote access to high data rate instruments,and exploratory grid environment.

Vaziri, Arsi↗
NASA NTRS2020

Multi-Agent Motion Planning using Deep Learning for Space Applications

State-of-the-art motion planners cannot scale to a large number of systems. Motion planning for multiple agents is an NP (non-deterministic polynomial-time) hard problem, so the computation time increases exponentially with each addition of agents. This computational demand is a major stumbling block to the motion planner's application to future NASA missions involving the swarm of space vehicles. We applied a deep neural network to transform computationally demanding mathematical motion planning problems into deep learning-based numerical problems. We showed optimal motion trajectories can be accurately replicated using deep learning-based numerical models in several 2D and 3D systems with multiple agents. The deep learning-based numerical model demonstrates superior computational efficiency with plans generated 1000 times faster than the mathematical model counterpart.

Madani, Ramtin↗
DOE OSTI2025

Using convolutional neural networks to accelerate three-dimensional coherent synchrotron radiation computations

Calculating the effects of coherent synchrotron radiation (CSR) is one of the most computationally expensive tasks in accelerator physics. Here, we use convolutional neural networks (CNNs), along with a latent conditional diffusion (LCD) model, trained on physics-based simulations to speed up calculations. Specifically, we produce the 3D CSR wakefields generated by electron bunches in circular orbit in the steady-state condition. Two datasets are used for training and testing the models: wakefields generated by three-dimensional Gaussian electron distributions and wakefields from a sum of up to 25 three-dimensional Gaussian distributions. The CNNs are able to accurately produce the 3D wakefields ∼250–1000 times faster than the numerical calculations, while the LCD achieves a gain of a factor of ∼34. We also test the extrapolation and out-of-distribution generalization ability of the models. They generalize well on distributions with larger spreads than what they were trained on but struggle with smaller spreads.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

The changing mouse embryo transcriptome at whole tissue and single-cell resolution

During mammalian embryogenesis, differential gene expression gradually builds the identity and complexity of each tissue and organ system 1 . Here we systematically quantified mouse polyA-RNA from day 10.5 of embryonic development to birth, sampling 17 tissues and organs. The resulting developmental transcriptome is globally structured by dynamic cytodifferentiation, body-axis and cell-proliferation gene sets that were further characterized by the transcription factor motif codes of their promoters. We decomposed the tissue-level transcriptome using single-cell RNA-seq (sequencing of RNA reverse transcribed into cDNA) and found that neurogenesis and haematopoiesis dominate at both the gene and cellular levels, jointly accounting for one-third of differential gene expression and more than 40% of identified cell types. By integrating promoter sequence motifs with companion ENCODE epigenomic profiles, we identified a prominent promoter de-repression mechanism in neuronal expression clusters that was attributable to known and novel repressors. Focusing on the developing limb, single-cell RNA data identified 25 candidate cell types that included progenitor and differentiating states with computationally inferred lineage relationships. We extracted cell-type transcription factor networks and complementary sets of candidate enhancer elements by using single-cell RNA-seq to decompose integrative cis -element (IDEAS) models that were derived from whole-tissue epigenome chromatin data. These ENCODE reference data, computed network components and IDEAS chromatin segmentations are companion resources to the matching epigenomic developmental matrix, and are available for researchers to further mine and integrate.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1996

Computational Intelligence and Its Impact on Future High-Performance Engineering Systems

This document contains presentations from the joint UVA/NASA Workshop on Computational Intelligence held at the Virginia Consortium of Engineering and Science Universities, Hampton, Virginia, June 27-28, 1995. The presentations addressed activities in the areas of fuzzy logic, neural networks, and evolutionary computations. Workshop attendees represented NASA, the National Science Foundation, the Department of Energy, National Institute of Standards and Technology (NIST), the Jet Propulsion Laboratory, industry, and academia. The workshop objectives were to assess the state of technology in the Computational intelligence area and to provide guidelines for future research.

Noor, Ahmed K.↗
NASA NTRS2026

Multi-Agent Swarm State of the Art Report

The Next-Generation Multi-Agent Swarm (NGS) Study conducted by NASA’s Ames Research Center for NASA’s Space Technology Mission Directorate (STMD) will develop a comprehensive understanding of emerging multi-agent swarm capabilities. The study aims to identify existing swarm capabilities and asses their potential for persistent lunar space situational awareness, surface monitoring, and distributed autonomy demonstrations. A key objective is to inform the design of a next-generation multi-agent swarm that can perform autonomous distributed remote sensing, position, navigation, and timing (PNT) services, automated deployment that leverages autonomy, edge computing, and interoperable networking to enable cooperative operations without the need for immediate human operation. This study will address specific shortfalls identified by STMD, including intelligent multi-agent constellations, autonomy, edge computation, position, navigation, and timing for small spacecraft, small spacecraft propulsion, and space situational awareness (1625, 1438, 1433, 1557, 1431, 1430, 1589). The NASA Ames Mission Design Center (MDC) will provide subject matter expertise to support systems engineering trades, while experts in autonomy and spacecraft swarms in NASA’s Intelligent Systems Division will lead the study and focus on identifying emerging next-generation swarm capabilities. The study objectives include: capturing the current state-of-the-art for multi-agent swarm capabilities, evaluating technologies and creating technology roadmaps, and developing at least one new technology demonstration mission concept. This initial NGS study report surveys the current state of the art in technology areas relevant for the next-generation multi-agent swarm design. Our primary focus is on surveying relevant deployed space systems1, supplemented with selective analysis of relevant proposed missions and technology developments that have yet to fly.

agent↗
DOE OSTI2022

Natural gas maximal load delivery for multi-contingency analysis

An increasing dependence on natural gas has amplified existing vulnerabilities to the power grid, including disruptions to gas transmission networks from natural and man-made disasters. To address the operational challenges arising from these disruptions, we, in this study, consider the problem of estimating the steady-state operating capacity of a damaged gas pipeline network while ensuring the maximal delivery of load. Specifically, we formulate the mixed-integer nonconvex maximal load delivery (MLD) problem, which proves difficult to solve on large-scale networks. To address this challenge, we present a relaxation of the MLD problem and use it to determine bounds on the transport capacity of a gas pipeline system. A rigorous computational evaluation over network models ranging in size from 11 to 4,197 junctions shows that the relaxation-based method is suitable for analyzing the impacts of multi-contingency network disruptions, often converging to the optimal solution of the relaxation in less than ten seconds.

03 NATURAL GAS↗
DOE OSTI2021

Asymmetric temperature equilibration with heat flow from cold to hot in a quantum thermodynamic system

A model computational quantum thermodynamic network is constructed with two variable temperature baths coupled by a linker system, with an asymmetry in the coupling of the linker to the two baths. It is found in computational simulations that the baths come to “thermal equilibrium” at different bath energies and temperatures. In a sense, heat is observed to flow from cold to hot. Additionally, a description is given in which a recently defined quantum entropy S univ Q for a pure state “universe” continues to increase after passing through the classical equilibrium point of equal temperatures, reaching a maximum at the asymmetric equilibrium. Thus, a second law account Δ S univ Q ≥ 0 holds for the asymmetric quantum process. In contrast, a von Neumann entropy description fails to uphold the entropy law, with a maximum near when the two temperatures are equal, then a decrease Δ S v N < 0 on the way to the asymmetric equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

NeuroCoreX: An Open-Source FPGA-Based Spiking Neural Network Emulator with On-Chip Learning

Spiking Neural Networks (SNNs) are computational models inspired by the event-driven communication and connectivity patterns of biological neural circuits. They enable high energy efficiency and natural support for diverse architectures ranging from layered networks to small-world and graphstructured topologies. In this work, we introduce NeuroCoreX, an open-source, FPGA-based spiking neural network emulator that provides real-time, on-chip learning and flexible network organization. NeuroCoreX supports both feedforward sensory inputs streamed directly from sensors or PCs via UART and recurrent on-chip connectivity, enabling simultaneous processing and learning from external stimuli and internal network dynamics-capabilities rarely available in existing FPGA SNN platforms. The system implements a Leaky Integrate-and-Fire (LIF) neuron model with current-based synapses and supports pair-based STDP learning on both feedforward and recurrent synapses. A lightweight Python interface enables interactive configuration, live monitoring, weight read-back, and experiment control. Importantly, NeuroCoreX is tightly integrated with the SuperNeuroMAT simulator, allowing SNN models to be transferred seamlessly from software to hardware for hardware-in-the-loop development. By combining real-time plasticity, flexible connectivity, and an open-source VHDL implementation, NeuroCoreX provides an extensible and accessible platform for neuromorphic research, algorithm-hardware co-design, and energy-efficient edge intelligence.

Gautam, Ashish [ORNL]↗
NASA NTRS1981

Fault-tolerant computer study

A set of building block circuits is described which can be used with commercially available microprocessors and memories to implement fault tolerant distributed computer systems. Each building block circuit is intended for VLSI implementation as a single chip. Several building blocks and associated processor and memory chips form a self checking computer module with self contained input output and interfaces to redundant communications buses. Fault tolerance is achieved by connecting self checking computer modules into a redundant network in which backup buses and computer modules are provided to circumvent failures. The requirements and design methodology which led to the definition of the building block circuits are discussed.

Rennels, D. A.↗
DOE OSTI2024

Open Call LDRD: Physically Informed Autoencoders for Galactic Redshift Regression

Physical constraints have been suggested to make neural network models more generalizable, act scientifically plausible, and be more data-efficient over unconstrained baselines. In this report, we present preliminary work on evaluating the effects of adding soft physical constraints to computer vision neural networks trained to estimate the conditional density of redshift on input galaxy images for the Sloan Digital Sky Survey. We introduce physically motivated soft constraint terms that are not implemented with differential or integral operators. We frame this work as a simple ablation study where the effect of including soft physical constraints is compared to an unconstrained baseline. We compare networks using standard point estimate metrics for photometric redshift estimation, as well as metrics to evaluate how faithful our conditional density estimate represents the probability over the ensemble of our test dataset. We find no evidence that the implemented soft physical constraints are more effective regularizers than augmentation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2005

A Parallel Processing Algorithm for Remote Sensing Classification

A current thread in parallel computation is the use of cluster computers created by networking a few to thousands of commodity general-purpose workstation-level commuters using the Linux operating system. For example on the Medusa cluster at NASA/GSFC, this provides for super computing performance, 130 G(sub flops) (Linpack Benchmark) at moderate cost, $370K. However, to be useful for scientific computing in the area of Earth science, issues of ease of programming, access to existing scientific libraries, and portability of existing code need to be considered. In this paper, I address these issues in the context of tools for rendering earth science remote sensing data into useful products. In particular, I focus on a problem that can be decomposed into a set of independent tasks, which on a serial computer would be performed sequentially, but with a cluster computer can be performed in parallel, giving an obvious speedup. To make the ideas concrete, I consider the problem of classifying hyperspectral imagery where some ground truth is available to train the classifier. In particular I will use the Support Vector Machine (SVM) approach as applied to hyperspectral imagery. The approach will be to introduce notions about parallel computation and then to restrict the development to the SVM problem. Pseudocode (an outline of the computation) will be described and then details specific to the implementation will be given. Then timing results will be reported to show what speedups are possible using parallel computation. The paper will close with a discussion of the results.

Gualtieri, J. Anthony↗