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 1,783 records · Page 99

Theoretical study of network design methodologies for the aerial relay system

The aerial relay system network design problem is discussed. A generalized branch and bound based algorithm is developed which can consider a variety of optimization criteria, such as minimum passenger travel time and minimum liner and feeder operating costs. The algorithm, although efficient, is basically useful for small size networks, due to its nature of exponentially increasing computation time with the number of variables.

Rivera, J. M.↗

Phase Space Reconstruction from Accelerator Beam Measurements Using Neural Networks and Differentiable Simulations

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying assumptions or require specialized diagnostics to infer high-dimensional (> $2D$) beam properties. In this Letter, we introduce a general-purpose algorithm that combines neural networks with differentiable particle tracking to efficiently reconstruct high-dimensional phase space distributions without using specialized beam diagnostics or beam manipulations. Furthermore, we demonstrate that our algorithm accurately reconstructs detailed 4D phase space distributions with corresponding confidence intervals in both simulation and experiment using a single focusing quadrupole and diagnostic screen. This technique allows for the measurement of multiple correlated phase spaces simultaneously, which will enable simplified 6D phase space distribution reconstructions in the future.

47 OTHER INSTRUMENTATION↗

Abiotic stress networks converging on FT2 to control growth in Populus

Regulation of growth, quiescence and dormancy by seasonally recurring and episodic environmental factors is of central importance to the productivity of woody plants. Woody biomass feedstock plants such as Populus show substantial natural variation in growth responses to various environmental conditions; however, the complex genetic nature of these traits slows breeding for optimal biomass production in specific climates and on marginal lands. These growth responses are controlled by complex gene regulatory networks that are poorly understood. Elucidating the mechanisms that determine periods of growth and quiescence will identify specific genes and modules that can be manipulated to maximize growth in different environments. The main goal of the project was to develop transcriptional networks that describe spatially and temporally explicit regulatory relationships for both daylength and nutrient-mediated quiescence. We used next generation sequencing to characterize genome-wide gene expression changes to these two abiotic signals in shoot apices, leaf, root and vascular cambium. Overall, we sequenced 270 mRNAseq libraries and 54 smallRNAseq libraries from Populus trichocarpa and 58 RNAseq libraries from Populus nigra. We found both organ-specific transcriptional responses as well as responses common to multiple organs. Similarly, we uncovered both divergent and convergent gene regulatory networks that control growth responses to changes in daylength and nutrient stress. Thus, this work provides a foundation for developing approaches to optimize tree growth and biomass yield in response to specific as well as multiple abiotic conditions. Finally, we validated the functions of candidate regulators of growth in response to photoperiod and nutrient availability by introducing mutations via gene editing and transgenic methods. This data will be available to the public through journal publications and national/international genomic data archives.

59 BASIC BIOLOGICAL SCIENCES↗

Cleavable Strand‐Fusing Cross‐Linkers as Additives for Chemically Deconstructable Thermosets with Preserved Thermomechanical Properties

Abstract Permanently cross‐linked polymer networks—thermosets—are often difficult to chemically deconstruct. The installation of cleavable bonds into the strands of thermosets using cleavable comonomers as additives can facilitate thermoset deconstruction without replacement of permanent cross‐links, but such monomers can lead to reduced thermomechanical properties and require high loadings to function effectively, motivating the design of new and optimal cleavable additives. Here, we introduce “strand‐fusing cross‐linkers” (SFCs), which fuse two network strands via a four‐way cleavable cross‐link. SFCs enable deconstruction of model polydicyclopentadiene (pDCPD) thermosets with as little as one‐fifth of the molar loading needed to achieve deconstruction using traditional cleavable comonomers. SFCs function under traditional oven curing as well as low‐energy frontal ring‐opening metathesis polymerization (FROMP) conditions and lead to improved thermomechanical properties, for example, glass transition temperatures, compared to prior cleavable comonomer designs. This work motivates the development of increasingly improved cleavable additives to enable thermoset deconstruction without compromising material performance.

Zhang, Shuyi [Department of Chemistry Massachusett↗

Cleavable Strand‐Fusing Cross‐Linkers as Additives for Chemically Deconstructable Thermosets with Preserved Thermomechanical Properties

Abstract Permanently cross‐linked polymer networks—thermosets—are often difficult to chemically deconstruct. The installation of cleavable bonds into the strands of thermosets using cleavable comonomers as additives can facilitate thermoset deconstruction without replacement of permanent cross‐links, but such monomers can lead to reduced thermomechanical properties and require high loadings to function effectively, motivating the design of new and optimal cleavable additives. Here, we introduce “strand‐fusing cross‐linkers” (SFCs), which fuse two network strands via a four‐way cleavable cross‐link. SFCs enable deconstruction of model polydicyclopentadiene (pDCPD) thermosets with as little as one‐fifth of the molar loading needed to achieve deconstruction using traditional cleavable comonomers. SFCs function under traditional oven curing as well as low‐energy frontal ring‐opening metathesis polymerization (FROMP) conditions and lead to improved thermomechanical properties, for example, glass transition temperatures, compared to prior cleavable comonomer designs. This work motivates the development of increasingly improved cleavable additives to enable thermoset deconstruction without compromising material performance.

Zhang, Shuyi [Department of Chemistry Massachusett↗

Paper-based gold nanoparticles decorated SWCNTs chemiresistive sensor for sensitive detection of As(III) based on electrochemical doping

A paper-based chemiresistive sensor consisting of a single-walled carbon nanotubes network with electrodeposited gold nanoparticles (AuNPs-SWCNTs) was developed for the sensitive detection of As(III). A new sensing strategy was also proposed combined with a paper-based device for As(III) chemiresistive detection based on the electrochemical doping of As(0) on the AuNPs-SWCNTs channel. Here, the proposed paper-based chemiresistive sensor was manufactured by wax printing and vacuum deposition using a water-based SWCNTs ink. The sensor sensitivity was enhanced by optimizing the volume of SWCNTs ink used in the formation of the sensing network in the paper and the sweep segment of cyclic voltammetry used for the electrochemical deposition of AuNPs. Additionally, the mechanism of the sensing strategy based on the electrochemical n-doping of As(0) to the AuNPs-SWCNTs sensing channel was investigated using a liquid-ion gated FET system. The As(III) concentration detected by the as-fabricated chemiresistive sensor is as low as 1.35 × 10 -5 μM which is even lower than the maximum permissible concentration in drinking water defined by the WHO. In this paper, we provide a simple strategy for developing paper-based chemiresistive sensors with unique properties for practical As(III) determination.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effects of social structure and management on risk of disease establishment in wild pigs

Contact heterogeneity among hosts determines invasion and spreading dynamics of infectious disease, thus its characterization is essential for identifying effective disease control strategies. Yet, little is known about the factors shaping contact networks in many 28 wildlife species and how wildlife management actions might affect contact networks. Wild pigs in North America are an invasive, socially-structured species that pose a health concern for domestic swine given their ability to transmit numerous devastating diseases 2 such as African swine fever (ASF). Using proximity loggers and GPS data from 48 wild pigs in Florida and South Carolina, USA, we employed a probabilistic framework to estimate weighted contact networks. We determined the effects of sex, social group, and spatial distribution (monthly home range overlap and distance) on wild pig contact. We also estimated the impacts of management-induced perturbations on contact and inferred their effects on ASF establishment in wild pigs with simulation. Social group membership was the primary factor influencing contacts. Between-group contacts depended primarily on space use characteristics, with fewer contacts among groups separated by >2 km and no contacts among groups >4 km apart within a month. Modeling ASF dynamics on the contact network demonstrated that indirect contacts resulting from baiting (a typical method of attracting wild pigs or game species to a site to enhance recreational hunting) increased the risk of disease establishment by ~33% relative to direct contact. Low-intensity population reduction (<5.9% of the population) had no detectable impact on contact structure but reduced predicted ASF establishment risk relative to no population reduction. Here, we demonstrate an approach for understanding the relative role of spatial, social, and individual-level characteristics in shaping contact networks and predicting their effects on disease establishment risk, thus providing insight for optimizing disease control in spatially- and socially-structured wildlife species.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

active distribution network↗

A Preliminary ZEUS Lightning Location Error Analysis Using a Modified Retrieval Theory

The ZEUS long-range VLF arrival time difference lightning detection network now covers both Europe and Africa, and there are plans for further expansion into the western hemisphere. In order to fully optimize and assess ZEUS lightning location retrieval errors and to determine the best placement of future receivers expected to be added to the network, a software package is being developed jointly between the NASA Marshall Space Flight Center (MSFC) and the University of Nevada Las Vegas (UNLV). The software package, called the ZEUS Error Analysis for Lightning (ZEAL), will be used to obtain global scale lightning location retrieval error maps using both a Monte Carlo approach and chi-squared curvature matrix theory. At the core of ZEAL will be an implementation of an Iterative Oblate (IO) lightning location retrieval method recently developed at MSFC. The IO method will be appropriately modified to account for variable wave propagation speed, and the new retrieval results will be compared with the current ZEUS retrieval algorithm to assess potential improvements. In this preliminary ZEAL work effort, we defined 5000 source locations evenly distributed across the Earth. We then used the existing (as well as potential future ZEUS sites) to simulate arrival time data between source and ZEUS site. A total of 100 sources were considered at each of the 5000 locations, and timing errors were selected from a normal distribution having a mean of 0 seconds and a standard deviation of 20 microseconds. This simulated "noisy" dataset was analyzed using the IO algorithm to estimate source locations. The exact locations were compared with the retrieved locations, and the results are summarized via several color-coded "error maps."

Elander, Valjean↗

Efficient and choreographed quality-of- service management in dense 6G verticals with high-speed mobility requirements

Future 6G networks are envisioned to support very heterogeneous and extreme applications (known as verticals). Some examples are further-enhanced mobile broadband communications, where bitrates could go above one terabit per second, or extremely reliable and low-latency communications, whose end-to-end delay must be below one hundred microseconds. To achieve that ultra-high Quality-of-Service, 6G networks are commonly provided with redundant resources and intelligent management mechanisms to ensure that all devices get the expected performance. But this approach is not feasible or scalable for all verticals. Specifically, in 6G scenarios, mobile devices are expected to have speeds greater than 500 kilometers per hour, and device density will exceed ten million devices per square kilometer. In those verticals, resources cannot be redundant as, because of such a huge number of devices, Quality-of-Service requirements are pushing the effective performance of technologies at physical level. And, on the other hand, high-speed mobility prevents intelligent mechanisms to be useful, as devices move around and evolve faster than the usual convergence time of those intelligent solutions. New technologies are needed to fill this unexplored gap. Therefore, in this paper we propose a choreographed Quality-of-Service management solution, where 6G base stations predict the evolution of verticals at real-time, and run a lightweight distributed optimization algorithm in advance, so they can manage the resource consumption and ensure all devices get the required Quality-of-Service. Prediction mechanism includes mobility models (Markov, Bayesian, etc.) and models for time-variant communication channels. Besides, a traffic prediction solution is also considered to explore the achieved Quality-of-Service in advance. The optimization algorithm calculates an efficient resource distribution according to the predicted future vertical situation, so devices achieve the expected Quality-of-Service according to the proposed traffic models. An experimental validation based on simulation tools is also provided. Results show that the proposed approach reduces up to 12% of the network resource consumption for a given Quality-of-Service.

42 ENGINEERING↗

FEST: Facility Energy Saving and Securing Technology Using Multi-Source Data: (Milestone 2 Report)

This project aims to demonstrate three technologies developed in-house at LLNL and University of Michigan-Dearborn (UMD), at a military site, including i) Grid Data Crossing (called GriD-Xing) for increasing smart meter data usability, ii) Facility Energy Optimization (called Facility E-GO) for improving facility energy efficiency in both operation and planning perspectives, and iii) Co-simulation tool (called Co-Sim) for enhancing smart meter and energy facility networks resilience and security. In this report, Millstone 2 - Integration A: Integrate GriD-Xing and facility optimization tools is documented.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimal Control of Connected and Automated Vehicles at Roundabouts: An Investigation in a Mixed-Traffic Environment

Connectivity and automation in vehicles provide the most intriguing opportunity for enabling users to better monitor transportation network conditions and make better operating decisions to improve safety and reduce pollution, energy consumption, and travel delays. This paper investigates the implications of optimally coordinating vehicles that are wirelessly connected to each other in roundabouts to achieve a smooth traffic flow. We apply an optimization framework and an analytical solution that allows optimal coordination of vehicles for merging in such traffic scenario. The effectiveness of the proposed approach is validated through simulation and it is shown that fully coordinated vehicles reduce total travel time by 51% and fuel consumption by 35%. Furthermore, we study the influence of vehicle coordination in a mixed-traffic environment and compare the network performance under different market penetration rates of connected and automated vehicles (CAVs). For this particular study with near-capacity demand, high penetration of CAVs is necessary to ensure an efficient and effective control, due to extremely unstable traffic.

Zhao, Liuhui↗

Battery Energy Storage Scheduling for Optimal Load Variance Minimization

Generation portfolio can be significantly altered due to the deployment of distributed energy resources (DER) in distribution networks and the concept of microgrid. Generally,distribution networks can operate in a more resilient and economic fashion through proper coordination of DER. However, due to the partially uncontrollable and stochastic nature of some DER, the variance of net load of distribution systems increases, which raises the operational cost and complicates operation for transmission companies. This motivates peak shaving and valley filling using energy storage units deployed in distribution systems. This paper aims at theoretical formulation of optimal load variance minimization, where the infinity norm of net load is minimized. Then, the problem is reformulated equivalently as a linear program. A case study is performed with capacity limited battery energy storage model and the simplified power flow model of a radial distribution network. The influence of capacity limit and deployment location are studied.

Melin, Alexander↗

Training quantum neural networks using the quantum information bottleneck method

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

Çatlı, Ahmet Burak (ORCID:0000000152294141)↗

A Fairness-based Distributed Energy Coordination for Voltage Regulation in Distribution Systems

The rapid adoption of photovoltaic (PV) systems combined with falling prices of energy storage is paving the way for a future in which customers could locally supply their energy needs and export surplus power to the grid. However, reverse power flow from multiple sites in a network can cause overvoltage that decreases system reliability and the utilization level of PV system. In this paper, we present a two-stage approach to solve the energy coordination problem in distribution networks. In the first stage, a household with PV and energy storage is optimized to allow customers to adopt different control strategies such as load following and tariff arbitrage. We show that such customer-led control strategies can cause reverse power flows during peak PV generation periods, thus resulting in overvoltage. In such cases, the second stage of the proposed approach is called upon to solve a fairness-based energy coordination problem that can maintain voltages within limits while maximizing the PV generation while fairly distributing the actions among all the PV systems. As a result, each of the resources in the network has equal opportunity to export power and shares the responsibility of voltage regulation. Simulation studies have been carried out on the IEEE 13-bus test feeder to verify the effectiveness of the proposed approach.

Distributed energy resources, fairness, overvoltag↗

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗

A machine learning framework for accurate and robust analysis of radiation detector pulses

The microscopic properties of atomic nuclei are used to study various scientific questions. They are essential for understanding the fundamental forces of nature and the chemical evolution of the universe. Detecting decay radiation from radioactive nuclei makes it possible to probe these fundamental nuclear properties. Detector waveform traces may contain additional information about the radiation. Generally, advanced signal processing techniques are needed to extract this additional information, often involving fitting the waveform with model response functions using non-linear least-squares optimization with second-order gradient methods. While this is a powerful technique, it is also computationally expensive, leading to slow processing time, which scales with the volume of data. To address this problem, we have developed a machine learning (ML) approach that infers the characteristics of traces from a model detector response function. In particular, we are interested in classifying whether a single recorded trace consists of one or two pulse constituents and estimating the pulse parameters. Furthermore, our proposed ML method can precisely extract the pulses’ parameters, such as energy and timing information, and accurately classify the pulse multiplicity of a trace. Unlike non-learning-based approaches, our ML approach uses neural networks that are significantly faster at inference, as they do not require any optimization during this stage.

Curve fitting↗

Traffic Flow Analysis for Package Delivery Drones using a Queueing Model

A key component of the small unmanned aircraft systems traffic management ecosystem is the design of scalable algorithms for strategic deconfliction of drones prior to takeoff. In this work, we focus on efficient flow management of drones on a network of intersecting edges subject to two kinds of spacing constraints: 1) between any two adjacent vehicles on an edge and 2) between any two vehicles on two different edges arriving one after the other at an intersection. The spacing is designed to enable non-intersection of operational volumes corresponding to two different vehicles thereby properly separating the vehicles inside each volume. For simplicity, we assume a constant ground speed for the drones and fixed dimensions for the operational volume blocks. The deconfliction is managed by adjusting the takeoff time of the drones, thereby regulating their arrival time at various crossing waypoints in the network. This framework allows us to study the maximum flow (throughput) of vehicles on a network of edges connecting depots to drop off sites subject to the temporal spacing constraints. The departure scheduling of individual drones results in a combinatorial optimization problem. To alleviate this, we solve a max-flow formulation and use queueing theory to simplify the analysis and provide upper bounds to the underlying optimization problem for individual drone departure scheduling. Our results indicate that throughput drops rapidly after the density of drones in the network passes the max-flow limits.

Alexey A Munishkin↗