Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Optimization”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Repair and Resource Scheduling in Unbalanced Distribution Systems Using Neighborhood Search

—This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed. We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignmentbased method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.

Outage management↗
DOE OSTI2020

Bus Clustering for Distribution Grid Topology Identification

Recovering the distribution grid topology is essential to perform several distribution system operator functions. Many algorithms that address the topology recovery problem have already been proposed in the literature. Most are based on a priori information regarding which buses are fed by which substation; however, this information might not be available because frequent grid reconfigurations change the distribution grid portion connected to each substation. This paper addresses the problem of assigning every substation the set of buses that it is feeding, given field data. First, the aforementioned task is cast as a nonconvex optimization problem. Second, a relaxed version of the optimization problem is solved via the alternating direction method of multipliers. Finally, the performance of our approach is validated through numerical simulations of realistic scenarios using a standard IEEE benchmark feeder.

bus clustering↗
DOE OSTI2025

AIVT: Inference of turbulent thermal convection from measured 3D velocity data by physics-informed Kolmogorov-Arnold networks

We propose the artificial intelligence velocimetry-thermometry (AIVT) method to reconstruct a continuous and differentiable representation of the temperature and velocity in turbulent convection from measured three-dimensional (3D) velocity data. AIVT is based on physics-informed Kolmogorov-Arnold networks and trained by optimizing a loss function that minimizes residuals of the velocity data, boundary conditions, and governing equations. We apply AIVT to a set of simultaneously measured 3D temperature and velocity data of Rayleigh-Bénard convection, obtained by combining particle image thermometry and Lagrangian particle tracking. This enables us to directly compare machine learning results to true volumetric, simultaneous temperature and velocity measurements. We demonstrate that AIVT can reconstruct and infer continuous, instantaneous velocity and temperature fields and their gradients from sparse experimental data at a high resolution, providing an additional approach for understanding thermal turbulence.

Science & Technology - Other Topics↗
DOE OSTI2022

Neural Networks for Supercapacitor Modeling

This software implements a one-dimensional model of a supercapacitor and calibrates it to experimental data. A system of coupled partial differential equation models the salt concentration and the ionic and electronic potentials. The term in the equation modeling the capacitance contains a neural network, whose parameters are optimized to fit the provided experimental data. The software is written in python using the open-source library JAX to calculate the gradients needed for the optimization.

Salazar de Troya, Miquel↗
DOE OSTI2022

Broadband polarization-entangled source for C+L-band flex-grid quantum networks

The rising demand for transmission capacity in optical networks has motivated steady interest in expansion beyond the standard C-band (1530–1565 nm) into the adjacent L-band (1565–1625 nm) for an approximate doubling of capacity in a single stroke. However, in the context of quantum networking, the L-band has yet to be fully leveraged with the suite of advanced tools for characterization and management available from classical lightwave communications. In this work, we demonstrate an ultrabroadband two-photon source integrating both C- and L-band wavelength-selective switches for complete control of spectral routing and allocation across 7.5 THz in a single setup. Polarization state tomography of all 150 pairs of 25-GHz-wide channels reveals an average fidelity of 0.98 and total distillable entanglement greater than 181 kebits/s. This source is explicitly designed for flex-grid optical networks and can facilitate optimal utilization of entanglement resources across the full C+L-band.

42 ENGINEERING↗
DOE OSTI2021

Comparison of Tempered and Truncated Fractional Models

Tempered fractional operators are able to model effects that classical partial differential equations cannot quite capture. For example, this includes the super- and subdiffusion effects that are present in hydrology and geophysics models. However, tempered fractional operators are computationally intensive. We analyze a truncated variation of the fractional operators, which are less computationally intensive, in an effort to use them in place of the more complex tempered variation. In particular, we train parameters of the truncated operator using neural networks in order to optimize the difference of the actions of the two operators.

58 GEOSCIENCES↗
DOE OSTI2023

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Visualizing Uranium Crystallization from Melt: Experiment-Informed Phase Field Modeling and Machine Learning

The focus of this project was to observe and simulate the solidification of uranium metal at the crystallographic level from its molten state. Melting experiments were conducted at two different scales to observe microstructural evolution using either a laboratory-scale induction furnace (hundreds of grams of metal) or a microscope heating stage (hundreds of milligrams of metal), respectively. Experimental parameters and characterization data were then used to inform a phase field model of gamma-U crystal growth as dendrites with or without secondary phase impurities in the form of uranium carbide particles. Finally, training datasets were generated by the phase field model as inputs to a neural network, developed with the aim of providing a faster, cheaper surrogate model for microstructural simulations within a given parameter space. Progress is reported herein for each of these task areas. Ultimately, 1) an optical microscope heating stage capability has been stood-up for uranium metal solidification studies, 2) a phase field model was advanced to simulate multiple uranium grains growing in the presence of carbide impurity particles and 3) a neural network was constructed and optimized to predict the microstructure features of individually growing uranium crystals.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Towards AI Based Data Classification for Decision Making During Testing

During the development of high-consequence items, test systems should be capable of differentiating between test failures resulting from narrowly missing requirements versus those indicating potentially catastrophic faults. In many instances, classifying the data corresponds to simply identifying whether measured waveforms have approximately the anticipated shape. Cast in this light, the problem reduces to converting raw data into a form optimal for use with neural network classifiers. This manuscript investigates different means of representing raw data for image classification. Raw data plots and Short Time Fourier Transform (STFT) spectrograms are classified by both custom built, small-scale, Convolution Neural Networks (CNN) and open-source, multi-million parameter, pre-trained deep CNNs. In the case of time varying frequency content, the STFTs provide images with greater detail and can be accurately classified with simpler networks. This requires less memory and runs faster than classifying the raw data using the more sophisticated options—making STFTs optimal for applications with memory constraints. STFTs are not a panacea. In some cases the time-domain signal contains useful information that should not be discarded. Rather than using raw data or STFTs, the images can be constructed from both by using red and green channels of an RGB image to visualize the real and imaginary components of the transform, with the raw data occupying the blue channel.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Extending the SAGA Survey (xSAGA). I. Satellite Radial Profiles as a Function of Host-galaxy Properties

We present "Extending the Satellites Around Galactic Analogs Survey" (xSAGA), a method for identifying low-z galaxies on the basis of optical imaging and results on the spatial distributions of xSAGA satellites around host galaxies. Using spectroscopic redshift catalogs from the SAGA Survey as a training data set, we have optimized a convolutional neural network (CNN) to identify z < 0.03 galaxies from more-distant objects using image cutouts from the DESI Legacy Imaging Surveys. From the sample of >100,000 CNN-selected low-z galaxies, we identify >20,000 probable satellites located between 36–300 projected kpc from NASA-Sloan Atlas central galaxies in the stellar-mass range $9.5\lt \mathrm{log}({M}_{\star }/{M}_{\odot })\lt 11$. We characterize the incompleteness and contamination for CNN-selected samples and apply corrections in order to estimate the true number of satellites as a function of projected radial distance from their hosts. Satellite richness depends strongly on host stellar mass, such that more-massive host galaxies have more satellites, and on host morphology, such that elliptical hosts have more satellites than disky hosts with comparable stellar masses. We also find a strong inverse correlation between satellite richness and the magnitude gap between a host and its brightest satellite. The normalized satellite radial distribution between 36–300 kpc does not depend on host stellar mass, morphology, or magnitude gap. The satellite abundances and radial distributions we measure are in reasonable agreement with predictions from hydrodynamic simulations. Our results deliver unprecedented statistical power for studying satellite galaxy populations and highlight the promise of using machine-learning for extending galaxy samples of wide-area surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Analytic continuation of noisy data using Adams Bashforth residual neural network

We propose a data-driven learning framework for the analytic continuation problem in numerical quantum many-body physics. Designing an accurate and efficient framework for the analytic continuation of imaginary time using computational data is a grand challenge that has hindered meaningful links with experimental data. The standard Maximum Entropy (MaxEnt)-based method is limited by the quality of the computational data and the availability of prior information. Also, the MaxEnt is not able to solve the inversion problem under high level of noise in the data. Here we introduce a novel learning model for the analytic continuation problem using a Adams-Bashforth residual neural network (AB-ResNet). Additionally, the advantage of this deep learning network is that it is model independent and, therefore, does not require prior information concerning the quantity of interest given by the spectral function. More importantly, the ResNet-based model achieves higher accuracy than MaxEnt for data with higher level of noise. Finally, numerical examples show that the developed AB-ResNet is able to recover the spectral function with accuracy comparable to MaxEnt where the noise level is relatively small.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum Software Engineering (Dagstuhl Seminar 24512)

The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A remote sensing algorithm for vertically resolved cloud condensation nuclei number concentrations from airborne and spaceborne lidar observations

Cloud condensation nuclei (CCN) are mediators of aerosol–cloud interactions (ACIs), contributing to the largest uncertainties in the understandings of global climate change. We present a novel remote-sensing-based algorithm that quantifies the vertically resolved CCN number concentrations (N CCN ) using aerosol optical properties measured by a multiwavelength lidar. The algorithm considers five distinct aerosol subtypes with bimodal size distributions. The inversion used the lookup tables developed in this study, based on the observations from the Aerosol Robotic Network, to efficiently retrieve optimal particle size distributions from lidar measurements. The method derives dry aerosol optical properties by implementing hygroscopic enhancement factors in lidar measurements. The retrieved optically equivalent particle size distributions and aerosol-type-dependent particle composition are utilized to calculate critical diameters using κ-Köhler theory and N CCN at six supersaturations ranging from 0.07 % to 1.0 %. Sensitivity analyses indicate that uncertainties in extinction coefficients and relative humidity greatly influence the retrieval error in N CCN . The potential of this algorithm is further evaluated by retrieving N CCN using airborne lidar from the NASA ObseRvations of Aerosols above CLouds and their intEractionS (ORACLES) campaign and is validated against simultaneous measurements from the CCN counter. The independent validation with robust correlation demonstrates promising results. Furthermore, the N CCN has been retrieved for the first time using a proposed algorithm from spaceborne lidar – Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) – measurements. The application of this new capability demonstrates the potential for constructing a 3D CCN climatology at a global scale, which helps to better quantify ACI effects and thus reduce the uncertainty in aerosol climate forcing.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1987

An algorithmic approach to crustal deformation analysis

In recent years the analysis of crustal deformation measurements has become important as a result of current improvements in geodetic methods and an increasing amount of theoretical and observational data provided by several earth sciences. A first-generation data analysis algorithm which combines a priori information with current geodetic measurements was proposed. Relevant methods which can be used in the algorithm were discussed. Prior information is the unifying feature of this algorithm. Some of the problems which may arise through the use of a priori information in the analysis were indicated and preventive measures were demonstrated. The first step in the algorithm is the optimal design of deformation networks. The second step in the algorithm identifies the descriptive model of the deformation field. The final step in the algorithm is the improved estimation of deformation parameters. Although deformation parameters are estimated in the process of model discrimination, they can further be improved by the use of a priori information about them. According to the proposed algorithm this information must first be tested against the estimates calculated using the sample data only. Null-hypothesis testing procedures were developed for this purpose. Six different estimators which employ a priori information were examined. Emphasis was put on the case when the prior information is wrong and analytical expressions for possible improvements under incompatible prior information were derived.

Iz, Huseyin Baki↗
NASA NTRS1989

Krylov methods preconditioned with incompletely factored matrices on the CM-2

The performance is measured of the components of the key interative kernel of a preconditioned Krylov space interative linear system solver. In some sense, these numbers can be regarded as best case timings for these kernels. Sweeps were timed over meshes, sparse triangular solves, and inner products on a large 3-D model problem over a cube shaped domain discretized with a seven point template. The performance of the CM-2 is highly dependent on the use of very specialized programs. These programs mapped a regular problem domain onto the processor topology in a careful manner and used the optimized local NEWS communications network. The rather dramatic deterioration in performance was documented when these ideal conditions no longer apply. A synthetic workload generator was developed to produce and solve a parameterized family of increasingly irregular problems.

Berryman, Harry↗
NASA NTRS1991

Digital optical computers at the optoelectronic computing systems center

The Digital Optical Computing Program within the National Science Foundation Engineering Research Center for Opto-electronic Computing Systems has as its specific goal research on optical computing architectures suitable for use at the highest possible speeds. The program can be targeted toward exploiting the time domain because other programs in the Center are pursuing research on parallel optical systems, exploiting optical interconnection and optical devices and materials. Using a general purpose computing architecture as the focus, we are developing design techniques, tools and architecture for operation at the speed of light limit. Experimental work is being done with the somewhat low speed components currently available but with architectures which will scale up in speed as faster devices are developed. The design algorithms and tools developed for a general purpose, stored program computer are being applied to other systems such as optimally controlled optical communication networks.

Jordan, Harry F.↗
NASA NTRS1993

Scalable Optical-Fiber Communication Networks

Scalable arbitrary fiber extension network (SAFEnet) is conceptual fiber-optic communication network passing digital signals among variety of computers and input/output devices at rates from 200 Mb/s to more than 100 Gb/s. Intended for use with very-high-speed computers and other data-processing and communication systems in which message-passing delays must be kept short. Inherent flexibility makes it possible to match performance of network to computers by optimizing configuration of interconnections. In addition, interconnections made redundant to provide tolerance to faults.

Chow, Edward T.↗