Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING 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 1,405 records · Page 78
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

A Generalized Fluid System Simulation Program to Model Flow Distribution in Fluid Networks

This paper describes a general purpose computer program for analyzing steady state and transient flow in a complex network. The program is capable of modeling phase changes, compressibility, mixture thermodynamics and external body forces such as gravity and centrifugal. The program's preprocessor allows the user to interactively develop a fluid network simulation consisting of nodes and branches. Mass, energy and specie conservation equations are solved at the nodes; the momentum conservation equations are solved in the branches. The program contains subroutines for computing "real fluid" thermodynamic and thermophysical properties for 33 fluids. The fluids are: helium, methane, neon, nitrogen, carbon monoxide, oxygen, argon, carbon dioxide, fluorine, hydrogen, parahydrogen, water, kerosene (RP-1), isobutane, butane, deuterium, ethane, ethylene, hydrogen sulfide, krypton, propane, xenon, R-11, R-12, R-22, R-32, R-123, R-124, R-125, R-134A, R-152A, nitrogen trifluoride and ammonia. The program also provides the options of using any incompressible fluid with constant density and viscosity or ideal gas. Seventeen different resistance/source options are provided for modeling momentum sources or sinks in the branches. These options include: pipe flow, flow through a restriction, non-circular duct, pipe flow with entrance and/or exit losses, thin sharp orifice, thick orifice, square edge reduction, square edge expansion, rotating annular duct, rotating radial duct, labyrinth seal, parallel plates, common fittings and valves, pump characteristics, pump power, valve with a given loss coefficient, and a Joule-Thompson device. The system of equations describing the fluid network is solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods. This paper also illustrates the application and verification of the code by comparison with Hardy Cross method for steady state flow and analytical solution for unsteady flow.

Majumdar, Alok↗
DOE OSTI2025

Parallelized telecom quantum networking with an ytterbium-171 atom array

The integration of quantum computers and sensors into a quantum network enables new capabilities in quantum information science. Most networks with atom-like qubits operate at visible or near-ultraviolet wavelengths and require conversion to the telecom band for long-distance communication, which reduces efficiency and potentially introduces noise. In this article we report high-fidelity entanglement between ytterbium-171 atoms and optical photons generated directly in the telecommunication band, where fibre loss is low. The nuclear spin of the atom is entangled with a single photon in the time-bin basis, yielding a high atom-measurement-corrected atom–photon Bell state fidelity. This can be further improved by addressing photon measurement errors. By imaging the atom array onto an optical fibre array, we also implement a parallelized networking protocol that can increase the remote entanglement rate proportionately with the number of channels. We also preserve coherence on a memory qubit during operations on communication qubits. These results support the integration of atomic systems into scalable quantum networks.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1994

VLSI neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques. The concurrent processing architectures developed are derived from a variety of advanced computing paradigms including neural network models, fuzzy logic, and cellular automata. Hardware implementation technologies range from state-of-the-art digital/analog custom-VLSI to advanced optoelectronic devices such as computer-generated holograms and e-beam fabricated Dammann gratings. JPL's concurrent processing devices group has developed a broad technology base in hardware implementable parallel algorithms, low-power and high-speed VLSI designs and building block VLSI chips, leading to application-specific high-performance embeddable processors. Application areas include high throughput map-data classification using feedforward neural networks, terrain based tactical movement planner using cellular automata, resource optimization (weapon-target assignment) using a multidimensional feedback network with lateral inhibition, and classification of rocks using an inner-product scheme on thematic mapper data. In addition to addressing specific functional needs of DOD and NASA, the JPL-developed concurrent processing device technology is also being customized for a variety of commercial applications (in collaboration with industrial partners), and is being transferred to U.S. industries. This viewgraph p resentation focuses on two application-specific processors which solve the computation intensive tasks of resource allocation (weapon-target assignment) and terrain based tactical movement planning using two extremely different topologies. Resource allocation is implemented as an asynchronous analog competitive assignment architecture inspired by the Hopfield network. Hardware realization leads to a two to four order of magnitude speed-up over conventional techniques and enables multiple assignments, (many to many), not achievable with standard statistical approaches. Tactical movement planning (finding the best path from A to B) is accomplished with a digital two-dimensional concurrent processor array. By exploiting the natural parallel decomposition of the problem in silicon, a four order of magnitude speed-up over optimized software approaches has been demonstrated.

Kemeny, Sabrina E.↗
DOE OSTI2025

Automatically parallelizing batch inference on deep neural networks using Fiats and Fortran 2023 `do concurrent`

This paper introduces novel programming strategies that leverage features of the Fortran 2023 standard of the International Standards Organization (ISO) to automatically parallelize computations on deep neural networks. The paper focuses on the interplay of object-oriented, parallel, and functional programming paradigms in the Fiats deep learning library. We demonstrate how several infrequently used language features play a role in enabling efficient, parallel execution. Specifically, the ability to explicitly declare that a procedure is pure facilitates inference in the context of the language’s loop-parallelism construct `do concurrent`. Also, explicitly prohibiting the overriding of a parent type’s type-bound procedures eliminates the need for dynamic dispatch in performance-critical code. Finally, this paper uses batch inference calculations on a neural network surrogate for atmospheric aerosol dynamics to demonstrate that LLVM Flang compiler’s automatic parallelization of `do concurrent` achieves roughly the same performance and scalability as achieved by OpenMP compiler directives. We also demonstrate that double-precision inference costs 37–72% longer runtime than default-real precision with most values in the range 57-60%.

Rouson, Damian↗
DOE OSTI2021

Sensitivity-Informed Bayesian Inference for Home PLC Network Models with Unknown Parameters

Bayesian inference is used to calibrate a bottom-up home PLC network model with unknown loads and wires at frequencies up to 30 MHz. A network topology with over 50 parameters is calibrated using global sensitivity analysis and transitional Markov Chain Monte Carlo (TMCMC). The sensitivity-informed Bayesian inference computes Sobol indices for each network parameter and applies TMCMC to calibrate the most sensitive parameters for a given network topology. A greedy random search with TMCMC is used to refine the discrete random variables of the network. This results in a model that can accurately compute the transfer function despite noisy training data and a high dimensional parameter space. The model is able to infer some parameters of the network used to produce the training data, and accurately computes the transfer function under extrapolative scenarios.

42 ENGINEERING↗
DOE OSTI2023

Quantitative relationships between film morphology, charge carrier dynamics, and photovoltaic performance in bulk-heterojunction binary vs. ternary acceptor blends

Addressing pertinent and perplexing questions regarding why nonfullerene acceptors (NFAs) promote higher power conversion efficiencies (PCEs) than traditional fullerenes and how photoactive bulk heterojunction (BHJ) film morphology, charge photogeneration, and recombination dynamics dictate solar cell performance have stimulated many studies of polymer solar cells (PSCs), yet quantitative relationships remain limited. Better understanding in these areas offers the potential to advance materials design and device engineering, afford higher PCEs, and ultimate commercialization. Here we probe quantitative relationships between BHJ film morphology, charge carrier dynamics, and photovoltaic performance in model binary and ternary blend systems having a wide bandgap donor polymer, a fullerene, and a promising NFA. We show that optimal PC 71 BM incorporation in a PBDB-TF:ITIC-Th binary system matrix retains the original π-face-on orientation, ITIC-Th crystallinity and BHJ film crystallite dimensions, and reduces film upper surface ITIC-Th segregation. Such morphology changes together simultaneously increase hole (μ h ) and electron (μ e ) mobilities, facilitate light-activated ITIC-Th to PC 71 BM domain electron delocalization, reduce free charge carrier (FC) bimolecular recombination (BR) within PBDB-TF:ITIC-Th mixed regions, and increase FC extraction pathways viaPBDB-TF:PC 71 BM pairs. The interplay of these effects yields significantly enhanced inverted cell short-circuit current density (J SC ), fill factor (FF), and PCE. Unexpectedly, we also find that excessive PC 71 BM in the PBDB-TF:ITIC-Th binary system alters the PBDB-TF orientation to π-edge-on, increases large scale PC 71 BM-rich aggregations and BHJ upper surface PC 71 BM composition. Further, these morphology changes increase parasitic decay processes such as intersystem crossing from photoexcited PC 71 BM, compromising the J SC , FF, and PCE metrics. ITIC-Th X-ray diffraction reveals a unique sidechain-dominated molecular network with previously unknown sidechain-end group stacking, rationalizing the STEM and GIWAXS results, photophysics, and the high μ e . DFT computation reveals charge transfer networks within ITIC-Th crystallites, supporting excited-state electron delocalization from ITIC-Th to PC 71 BM. This structure–property understanding leads to a newly reported NFA blend with PCE near 17%.

14 SOLAR ENERGY↗
NASA NTRS1999

The Navajo Learning Network and the NASA Life Sciences/AFOSR Infrastructure Development Project

The NSF-funded Navajo Learning Network project, with help from NASA Life Sciences and AFOSR, enabled Dine College to take a giant leap forward technologically - in a way that could never had been possible had these projects been managed separately. The combination of these and other efforts created a network of over 500 computers located at ten sites across the Navajo reservation. Additionally, the college was able to install a modern telephone system which shares network data, and purchase a new higher education management system. The NASA Life Sciences funds further allowed the college library system to go online and become available to the entire campus community. NSF, NASA and AFOSR are committed to improving minority access to higher education opportunities and promoting faculty development and undergraduate research through infrastructure support and development. This project has begun to address critical inequalities in access to science, mathematics, engineering and technology for Navajo students and educators. As a result, Navajo K-12 education has been bolstered and Dine College will therefore better prepare students to transfer successfully to four-year institutions. Due to the integration of the NSF and NASA/AFOSR components of the project, a unified project report is appropriate.

Source record↗
DOE OSTI2021

Multisource Data Fusion Outage Location in Distribution Systems via Probabilistic Graphical Models

Efficient outage location is critical to enhancing the resilience of power distribution systems. However, accurate outage location requires combining massive evidence received from diverse data sources, including smart meter (SM) last gasp signals, customer trouble calls, social media messages, weather data, vegetation information, and physical parameters of the network. This is a computationally complex task due to the high dimensionality of data in distribution grids. In this paper, we propose a multi-source data fusion approach to locate outage events in partially observable distribution systems using Bayesian networks (BNs). A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account using a probabilistic graphical method. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces. The graphical structure of the proposed BN is established based on the network’s topology and the causal relationship between random variables, such as the states of branches/customers and evidence. Utilizing this graphical model, accurate outage locations are obtained by leveraging a Gibbs sampling (GS) method, to infer the probabilities of de-energization for all branches. Compared with commonly-used exact inference methods that have exponential complexity in the size of the BN, GS quantifies the target conditional probability distributions in a timely manner. As a result, a case study of several real-world distribution systems is presented to validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2019

Networked Array Recorder (NeAR) Microphones for Field-Deployed Phased Arrays

An innovative edge-computing concept known as NeAR (Networked Array Recorder) has been developed to provide enhancements to existing field-deployable microphone phased arrays utilized for aeroacoustic flyover measurements of airframe and propulsive noise sources. The proposed system allows for the elimination of multiple miles of sensor wiring in an array installation, thereby improving the scalability of the overall system, increasing the fault-tolerance of the hardware, and reducing the effort needed to build-up and tear-down an array in the field. A demonstration of the NeAR concept was performed at Edwards Air Force Base in California in March – April, 2018, where twelve individual NeAR microphones were deployed as a piggyback on a conventional phased array system deployed for airframe noise flyover testing. The microphones operated successfully during the demonstration with good time history and spectral correlations shown between the NeAR units and conventional microphones located nearby in the array. The NeAR concept has spinoffs beyond its use for phased arrays, including applications in remote environmental sensing and noise monitoring.

Cull.iton, William G.↗
NASA NTRS1976

Voltage profile program for the Kennedy Space Center electric power distribution system

The Kennedy Space Center voltage profile program computes voltages at all busses greater than 1 Kv in the network under various conditions of load. The computation is based upon power flow principles and utilizes a Newton-Raphson iterative load flow algorithm. Power flow conditions throughout the network are also provided. The computer program is designed for both steady state and transient operation. In the steady state mode, automatic tap changing of primary distribution transformers is incorporated. Under transient conditions, such as motor starts etc., it is assumed that tap changing is not accomplished so that transformer secondary voltage is allowed to sag.

Source record↗
NASA NTRS2003

Using SPEEDES to simulate the blue gene interconnect network

JPL and the Center for Advanced Computer Architecture (CACR) is conducting application and simulation analyses of BG/L in order to establish a range of effectiveness for the Blue Gene/L MPP architecture in performing important classes of computations and to determine the design sensitivity of the global interconnect network in support of real world ASCI application execution.

SPEEDES BlueGene/L BG/L system-on-a-chip↗
DOE OSTI2022

Optimizing power system restoration with damaged communications

Utility procedures for power system blackstart and restoration typically assume that energization decisions can be reliably communicated across the grid. In reality, the communications and control network would likely also be affected in power outages, such as those caused by extreme weather events or cyber-attacks. This paper studies the effect of damage to the power system communications and control infrastructure on restoration operations following a blackout. We model the communications infrastructure as a graph, overlaying the power grid, and imposing the requirement that every energized element in the power grid be observable from a control center. We expand on a specialized branch-and-bound algorithm from the literature to optimize the restoration process and devise an initialization heuristic and a rounding heuristic to improve solution speed. We perform numerical experiments on synthetic systems for Illinois and Texas with outages based on a solar flare or hurricane. We compare the results of our specialized branch-and-bound algorithm to the results from (i) the initialization heuristic alone, (ii) a variation of this heuristic that we use as a baseline, and (iii) the restoration optimization for the power system without communications constraints. Here, we find that damage to the communications infrastructure significantly increases the time required to re-energize the grid. Moreover, by simultaneously optimizing communications repairs and grid energization decisions, we are able to re-energize the grid significantly faster than if communications repairs and energization decisions were made independently or with partial coordination, motivating improvements to current industry practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Resilience of the slow component in timescale separated synchronized oscillators

Physiological networks are usually made of a large number of biological oscillators evolving on a multitude of different timescales. Phase oscillators are particularly useful in the modelling of the synchronization dynamics of such systems. If the coupling is strong enough compared to the heterogeneity of the internal parameters, synchronized states might emerge where phase oscillators start to behave coherently. Here, we focus on the case where synchronized oscillators are divided into a fast and a slow component so that the two subsets evolve on separated timescales. We assess the resilience of the slow component by, first, reducing the dynamics of the fast one using Mori-Zwanzig formalism. Second, we evaluate the variance of the phase deviations when the oscillators in the two components are subject to noise with possibly distinct correlation times. From the general expression for the variance, we consider specific network structures and show how the noise transmission between the fast and slow components is affected. Interestingly, we find that oscillators that are among the most robust when there is only a single timescale, might become the most vulnerable when the system undergoes a timescale separation. We also find that layered networks seem to be insensitive to such timescale separations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2006

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗
NASA NTRS1989

Characterization of robotics parallel algorithms and mapping onto a reconfigurable SIMD machine

The kinematics, dynamics, Jacobian, and their corresponding inverse computations are six essential problems in the control of robot manipulators. Efficient parallel algorithms for these computations are discussed and analyzed. Their characteristics are identified and a scheme on the mapping of these algorithms to a reconfigurable parallel architecture is presented. Based on the characteristics including type of parallelism, degree of parallelism, uniformity of the operations, fundamental operations, data dependencies, and communication requirement, it is shown that most of the algorithms for robotic computations possess highly regular properties and some common structures, especially the linear recursive structure. Moreover, they are well-suited to be implemented on a single-instruction-stream multiple-data-stream (SIMD) computer with reconfigurable interconnection network. The model of a reconfigurable dual network SIMD machine with internal direct feedback is introduced. A systematic procedure internal direct feedback is introduced. A systematic procedure to map these computations to the proposed machine is presented. A new scheduling problem for SIMD machines is investigated and a heuristic algorithm, called neighborhood scheduling, that reorders the processing sequence of subtasks to reduce the communication time is described. Mapping results of a benchmark algorithm are illustrated and discussed.

Lee, C. S. G.↗
NASA NTRS2002

Computing the Envelope for Stepwise-Constant Resource Allocations

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms.

Muscettola, Nicola↗