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.

SourceResearch connectionFrom yearThrough year

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

At least 1,243 records · Page 69

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗

DOE OSTI2021

A two-equation soot-in-flamelet modeling approach applied under Spray A conditions

Soot production (including formation and oxidation) is studied in the transient, high-pressure and turbulent n-dodecane Spray A flames from the Engine Combustion Network (ECN) using computational fluid dynamics (CFD) simulations. A two-equation soot-in-flamelet modeling approach is applied within the framework of the Unsteady Flamelet Progress Variable (UFPV) model and results are validated against experimental data. Equations for soot mass fraction and soot number density derived in the mixture fraction space are solved in the context of detailed flamelet calculations. Source terms for the different steps in the soot chemistry are tabulated and incorporated in the flamelet manifold. For the reference condition, the modeling approach based on the tabulated flamelet manifold reduces the computational cost of a CFD calculation by approximately 40 times compared to a non-tabulated well-mixed (WM) modeling approach. The soot-in-flamelet approach is then extended to study the effect of ambient oxygen concentration, ambient mixture composition and ambient temperature on soot production. Results show that the modeling approach is able to capture the experimental trends for the soot volume fraction (SVF) with good quantitative agreement, especially in the soot ramp-up region.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Adversarial sampling of unknown and high-dimensional conditional distributions

Many engineering problems require the prediction of realization-to-realization variability or a refined description of modeled quantities. In that case, it is necessary to sample elements from unknown high-dimensional spaces with possibly millions of degrees of freedom. While there exist methods able to sample elements from probability density functions (PDF) with known shapes, several approximations need to be made when the distribution is unknown. In this paper the sampling method, as well as the inference of the underlying distribution, are both handled with a data-driven method known as generative adversarial networks (GAN), which trains two competing neural networks to produce a network that can effectively generate samples from the training set distribution. In practice, it is often necessary to draw samples from conditional distributions. When the conditional variables are continuous, only one (if any) data point corresponding to a particular value of a conditioning variable may be available, which is not sufficient to estimate the conditional distribution. This work handles this problem using an a priori estimation of the conditional moments of a PDF. Herein, two approaches, stochastic estimation, and an external neural network are compared for computing these moments; however, any preferred method can be used. The algorithm is demonstrated in the case of the deconvolution of a filtered turbulent flow field. It is shown that all the versions of the proposed algorithm effectively sample the target conditional distribution with minimal impact on the quality of the samples compared to state-of-the-art methods. Additionally, the procedure can be used as a metric for the diversity of samples generated by a conditional GAN (cGAN) conditioned with continuous variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Graphene Electric Field Sensor Enables Single Shot Label-Free Imaging of Bioelectric Potentials

The measurement of electrical activity across systems of excitable cells underlies current progress in neuroscience, cardiac pharmacology, and neurotechnology. However, bioelectricity spans orders of magnitude in intensity, space, and time, posing substantial technological challenges. The development of methods permitting network-scale recordings with high spatial resolution remains key to studies of electrogenic cells, emergent networks, and bioelectric computation. Here, for this work, we demonstrate single-shot and label-free imaging of extracellular potentials with high resolution across a wide field-of-view. The critically coupled waveguide-amplified graphene electric field (CAGE) sensor leverages the field-sensitive optical transitions in graphene to convert electric potentials into the optical regime. As a proof-of-concept, we use the CAGE sensor to detect native electrical activity from cardiac action potentials with tens-of-microns resolution, simultaneously map the propagation of these potentials at tissue-scale, and monitor their modification by pharmacological agents. This platform is robust, scalable, and compatible with existing microscopy techniques for multimodal correlative imaging.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

Controlled Spalling of 4H Silicon Carbide with Investigated Spin Coherence for Quantum Engineering Integration

We detail scientific and engineering advances which enable the controlled spalling and layer transfer of single crystal 4H silicon carbide (4H-SiC) from bulk substrates. 4HSiC’s properties, including high thermal conductivity and a wide bandgap, make it an ideal semiconductor for power electronics. Moreover, 4H-SiC is an excellent host of solid-state atomic defect qubits for quantum computing and quantum networking. Because 4H-SiC substrates are expensive (due to long growth times and limited yield), techniques for removal and transfer of bulk-quality films are desirable for substrate reuse and integration of the separated films. In this work, we utilize updated approaches for stressor layer thickness control and spalling crack initiation to demonstrate controlled spalling of 4H-SiC, the highest fracture toughness crystal spalled to date. We achieve coherent spin control of neutral divacancy (VV 0 ) qubit ensembles and measure a quasi-bulk spin T 2 of 79.7 μs in the spalled films.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2016

Accelerating rejection-based simulation of biochemical reactions with bounded acceptance probability

Stochastic simulation of large biochemical reaction networks is often computationally expensive due to the disparate reaction rates and high variability of population of chemical species. An approach to accelerate the simulation is to allow multiple reaction firings before performing update by assuming that reaction propensities are changing of a negligible amount during a time interval. Species with small population in the firings of fast reactions significantly affect both performance and accuracy of this simulation approach. It is even worse when these small population species are involved in a large number of reactions. We present in this paper a new approximate algorithm to cope with this problem. It is based on bounding the acceptance probability of a reaction selected by the exact rejection-based simulation algorithm, which employs propensity bounds of reactions and the rejection-based mechanism to select next reaction firings. The reaction is ensured to be selected to fire with an acceptance rate greater than a predefined probability in which the selection becomes exact if the probability is set to one. Our new algorithm improves the computational cost for selecting the next reaction firing and reduces the updating the propensities of reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2017

Dynamics, nucleosynthesis, and kilonova signature of black hole—neutron star merger ejecta

Here we investigate the ejecta from black hole—neutron star mergers by modeling the formation and interaction of mass ejected in a tidal tail and a disk wind. The outflows are neutron-rich, giving rise to optical/infrared emission powered by the radioactive decay of r-process elements (a kilonova). Here we perform an end-to-end study of this phenomenon, where we start from the output of a fully-relativistic merger simulation, calculate the post-merger hydrodynamical evolution of the ejecta and disk winds including neutrino physics, determine the final nucleosynthetic yields using post-processing nuclear reaction network calculations, and compute the kilonova emission with a radiative transfer code. We study the effects of the tail-to-disk mass ratio by scaling the tail density. A larger initial tail mass results in fallback matter becoming mixed into the disk and ejected in the subsequent disk wind. Relative to the case of a disk without dynamical ejecta, the combined outflow has lower mean electron fraction, faster speed, larger total mass, and larger absolute mass free of high-opacity Lanthanides or Actinides. In most cases, the nucleosynthetic yield is dominated by the heavy r-process contribution from the unbound part of the dynamical ejecta. A Solar-like abundance distribution can however be obtained when the total mass of the dynamical ejecta is comparable to the mass of the disk outflows. The kilonova has a characteristic duration of 1 week and a luminosity of ~ 10 41 erg s -1 , with orientation effects leading to variations of a factor ~2 in brightness. At early times (< 1 d) the emission includes an optical component from the (hot) Lanthanide-rich material, but the spectrum evolves quickly to the infrared thereafter.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗

DOE OSTI2026

Light storage, retrieval, and controllable interference in an atomic tripod system

Highly efficient quantum memories are essential for advancing quantum information processing technologies, including scalable quantum computing and quantum networks. We experimentally demonstrate a light storage and retrieval protocol in a tripod system using an ensemble of laser-cooled 87 Rb atoms. The tripod system, which consists of three ground states and an excited state, offers rich dynamics: its use to coherently store and retrieve a weak probe pulse in the 87 Rb 𝐹 = 1 ground-state manifold leads to the interference of two spin-wave excitations during storage time that translate to an interference in the peak intensity of the retrieved probe pulse. Our work shows that these interferences, which manifest when varying the pulse sequence or energy level structure, can be controlled experimentally by varying the storage time, optical phase, and magnetic field strength. Theoretical simulations exhibit excellent agreement with the experimental results. In conclusion, this work demonstrates the rich dynamics and versatile capabilities of atomic tripod systems for light storage and retrieval, with key advantages over conventional Λ systems, highlighting the potential of atomic tripod systems for applications in quantum information processing, quantum synchronization, and atomic memory protocols.

Coherent control↗

DOE OSTI2023

Shadow process tomography of quantum channels

Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scales exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. Furthermore, we make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography, enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

SharP: Towards Programming Extreme-Scale Systems with Hierarchical Heterogeneous Memory

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. Along with hierarchical-heterogeneous memory, the system typically has a high-performing network and a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. In this work, we propose and develop the programming abstraction called SHARed data-structure centric Programming abstraction (SharP) to address both of these goals, i.e., provide (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications. To evaluate SharP, we implement a Stencil benchmark using SharP, port QMCPack, a petascale-capable application, and adapt Memcached ecosystem, a popular Big-Data framework, to use SharP, and quantify the performance and productivity advantages. Additionally, we demonstrate the simplicity of using SharP on different memories including DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Sustaining Moore's law with 3D chips

Here, rather than continue the expensive and time-consuming quest for transistor replacement, the authors argue that 3D chips coupled with new computer architectures can keep Moore's law on its traditional scaling path.

3D chip manufacturing↗

DOE OSTI2018

Internet-of-Things Hardware-in-the-Loop Simulation Architecture for Providing Frequency Regulation With Demand Response

Following recent advances in network infrastructure, cloud computing, and embedded systems, fascinating work is underway exploring the utility of demand response in increasing grid stability while permitting high penetration of intermittent renewable distributed generation resources. Although works have demonstrated diverse theoretical advantages of demand response programs, little real-world data are available and utilities generally remain reticent in moving forward with large-scale implementation due to risks inherent to any modification of the power system. Deciding that the next pertinent step in bringing demand response from theory to technology is developing an Internet-of-things hardware-in-the-loop simulation power system integrated device capable of empirically testing the theoretical mechanisms, this work presents an architecture testbed for providing demand response (telemetric monitoring and actuation of loads), which is real node in a power system simulation where virtual node's parameters derive real node data. Finally, we test a demand response algorithm, which provides frequency regulation services.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

S-QGPU: Shared quantum gate processing unit for distributed quantum computing

We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

SU-F-T-100: Development and Implementation of a Treatment Planning Tracking System Into the Radiation Oncology Clinic

Purpose: With increasing numbers of cancer patients being diagnosed and the complexity of radiotherapy treatments rising it’s paramount that patient plan development continues to stay fluid within the clinic. In order to maintain a high standard of care and clinical efficiency the establishment of a tracking system for patient plan development allows healthcare providers to view real time plan progression and drive clinical workflow. In addition, it provides statistical datasets which can further identify inefficiencies within the clinic. Methods: An application was developed utilizing Microsoft’s ODBC SQL database engine to track patient plan status throughout the treatment planning process while also managing key factors pertaining to the patient’s treatment. Pertinent information is accessible to staff in many locations, including tracking monitors within dosimetry, the clinic network for both computers and handheld devices, and through email notifications. Plans are initiated with a CT and continually tracked through planning stages until final approval by staff. Patient’s status is dynamically updated by the physicians, dosimetrists, and medical physicists based on the stage of the patient’s plan. Results: Our application has been running over a six month period with all patients being processed through the system. Modifications have been made to allow for new features to be implemented along with additional tracking parameters. Based on in-house feedback, the application has been supportive in streamlining patient plans through the treatment planning process and data has been accumulating to further improve procedures within the clinic. Conclusion: Over time the clinic will continue to track data with this application. As data accumulates the clinic will be able to highlight inefficiencies within the workflow and adapt accordingly. We will add in new features to help support the treatment planning process in the future.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

A Review of Bayesian Networks for Spatial Data

We report Bayesian networks are a popular class of multivariate probabilistic models as they allow for the translation of prior beliefs about conditional dependencies between variables to be easily encoded into their model structure. Due to their widespread usage, they are often applied to spatial data for inferring properties of the systems under study and also generating predictions for how these systems may behave in the future. We review published research on methodologies for representing spatial data with Bayesian networks and also summarize the application areas for which Bayesian networks are employed in the modeling of spatial data. We find that a wide variety of perspectives are taken, including a GIS-centric focus on efficiently generating geospatial predictions, a statistical focus on rigorously constructing graphical models controlling for spatial correlation, as well as a range of problem-specific heuristics for mitigating the effects of spatial correlation and dependency arising in spatial data analysis. Special attention is also paid to potential future directions for integration of Bayesian networks with spatial processes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Detector Interface for Streaming, Control, and Open-source integration (DISCO) v1.0.0

This suite consists of a multi-package ecosystem featuring detector emulators, EPICS areaDetector drivers, and remote server frameworks designed for the Advanced Light Source (ALS). Engineered for high-bandwidth devices—including VFCCD, Timepix3, Timepix4, and related pixel detectors—the software simulates hardware, wraps vendor SDKs into remote-callable servers, and integrates with open-source control systems. Key Capabilities: Distributed SDK Architecture: Server packages wrap hardware-specific SDKs, allowing areaDetector drivers to execute remote framework calls. This isolates proprietary libraries from the EPICS IOC, enhancing stability and enabling distributed computing across beamline networks. Device Support: Custom drivers for VFCCD, the Timepix family, and similar sensors optimize the data path from hardware control to high-speed transport. Full-Stack Emulation: Sophisticated emulator packages allow end-to-end pipeline testing and software development without requiring physical hardware or beam time. Integrated Workflows: Supports high-bandwidth streaming for real-time analysis and robust, metadata-rich file-based workflows (e.g., HDF5/NeXus). By standardizing interfaces across heterogeneous hardware, this suite reduces technical debt. It provides the ALS with a scalable, open-source solution to manage massive data rates within a unified control environment.

Mahl, Johannes [Lawrence Berkeley National Laborat↗

DOE OSTI2024

Integrated photonic structures for photon-mediated entanglement of trapped ions

Trapped atomic ions are natural candidates for quantum information processing and have the potential to realize or improve quantum computing, sensing, and networking. These applications often require the collection of individual photons emitted from ions into guided optical modes, in some cases for the production of entanglement between separated ions. Proof-of-principle demonstrations of such photon collection from trapped ions have been performed using high-numerical-aperture lenses or cavities and single-mode fibers, but integrated photonic elements in ion-trap structures offer advantages in scalability and manufacturability over traditional optics. In this paper we analyze structures monolithically fabricated with an ion trap for collecting ion-emitted photons, coupling them into waveguides, and manipulating them via interference. We calculate geometric limitations on collection efficiency for this scheme, simulate a single-layer grating that shows performance comparable to demonstrated free-space optics, and discuss practical fabrication and fidelity considerations. Based on this analysis, we conclude that integrated photonics can support scalable systems of trapped ions that can distribute quantum information via photon-mediated entanglement.

Knollmann, Felix W.↗