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,207 records · Page 67

Fourier-DeepONet: Fourier-enhanced deep operator networks for full waveform inversion with improved accuracy, generalizability, and robustness

In this article, full waveform inversion (FWI) infers the subsurface structure information from seismic waveform data by solving a non-convex optimization problem. Data-driven FWI has been increasingly studied with various neural network architectures to improve accuracy and computational efficiency. Nevertheless, the applicability of pre-trained neural networks is severely restricted by potential discrepancies between the source function used in the field survey and the one utilized during training. Here, we develop a Fourier-enhanced deep operator network (Fourier-DeepONet) for FWI with the generalization of seismic sources, including the frequencies and locations of sources. Specifically, we employ the Fourier neural operator as the decoder of DeepONet, and we utilize source parameters as one input of Fourier-DeepONet, facilitating the resolution of FWI with variable sources. To test Fourier-DeepONet, we develop three new and realistic FWI benchmark datasets (FWI-F, FWI-L, and FWI-FL) with varying source frequencies, locations, or both. Our experiments demonstrate that compared with existing data-driven FWI methods, Fourier-DeepONet obtains more accurate predictions of subsurface structures in a wide range of source parameters. Moreover, the proposed Fourier-DeepONet exhibits superior robustness when handling data with Gaussian noise or missing traces and sources with Gaussian noise, paving the way for more reliable and accurate subsurface imaging across diverse real conditions.

42 ENGINEERING↗

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, the incorporation of differential equations that govern the system dynamics makes DED an optimization problem that is computationally prohibitive to solve. In this work, we present a new data-driven approach based on differentiable programming to efficiently obtain offline parametric solutions to the underlying DED problem. In particular, we employ the recently proposed differentiable predictive control (DPC) for offline learning of explicit neural control policies based on identified Koopman operator (KO) model of the system dynamics. We demonstrate the high solution quality and five orders of magnitude computational-time savings of the DPC method over the original optimization-based DED approach on a 9-bus test power grid network.

King, Ethan↗

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗

Mapping ecoregions under climate change: a case study from the biological ‘crossroads’ of three continents, Turkey

Context: Besides climate change vulnerability, most ecosystems are under threat from a history of improper land-use and conservation policies, yet there is little existing long-term ecological research infrastructure in Turkey. In regions with no ecological networks across large landscapes, ecoregion concept offers opportunities for characterizing the landscape under changing climate.Objectives: Aim is to develop contemporary and future quantitative ecoregions for Turkey based on climate model outputs, to identify climate change-sensitive areas of biodiversity and conservation significance, and to provide a framework for a comprehensive ecological observatory network design.Methods: Using Multivariate Spatio-Temporal Clustering and climate data contemporary and projected future distributions of Turkey’s ecoregions are delineated at several division levels.Results: Turkey’s contemporary ecoregions generally show a northward shift by the end of this century and the lengthening of the growing season across the country, especially eastward and northward. The increase in growing season length, along with the shift in precipitation seasonality and increasing growing season precipitation, shape future conditions within the climate change-sensitive areas. Apart from transboundary ecological and socioeconomic significance, these potentially vulnerable ecosystems also constitute the majority of Turkey’s biodiversity hotspots.Conclusions: Our study marks the first ‘ecoregionalization’ study for Turkey based on both contemporary and future climate scenarios. For countries like Turkey, where large-scale ecological networks have not been established, using such quantitative methodology for delineation of optimal ecoclimatic regions, and for mapping environments at risk from climate change provides an invaluable perspective for conservation planning strategies, and a framework for a comprehensive ecological observatory network design.

54 ENVIRONMENTAL SCIENCES↗

ACES: Infrastructure As Code. Model Optimization and Performance Capability

Infrastructure as Code (IaC) refers to managing infrastructure (networks, physical/virtual machines, storage, and connection topology) in a descriptive model/language, rather than configuring it manually or using interactive configuration tools. Just like source code can be compiled to generate the same binary code, IaC enables generating the same environment every time it is applied. IaC is a key DevOps practice and is generally used in conjunction with continuous integration (CI) and continuous delivery (CD). In CI, all code changes are merged into a mainline branch and validated multiple times a day as developers check in their changes to the source code. In CD on the other hand, code changes are automatically packaged for a new release-to-production on a regular basis. This typically enables teams to deliver software changes much more quickly and often. Developing and managing the ACES platform using (IaC) is vital for the robust deployment and continued sustainment of this foundational computing capability. IaC and DevOps practices will help us solve many of the common challenges often encountered in developing and maintaining compute infrastructure. First, it will make the provisioning, deployment, and maintenance of the compute infrastructure across multiple environments much more efficient. Second, these processes help make the overall system much more stable by continuously testing new changes as they are introduced to the system. Third, it allows us to be much more confident of the security controls in place since they can be tested as part of the CI process and all new changes can be audited and tracked. Finally, IaC enables the ACES Platform to be adaptable to the emerging technologies due to its ability to spin up different test beds to evaluate and incorporate these technologies. This document addresses common infrastructure-management challenges, describes what happens if they are not addressed, and highlights the value of utilizing IaC to tackle them. Finally, we will provide a high-level overview of the IaC and DevOps practices being utilized by the ACES Platform team.

97 MATHEMATICS AND COMPUTING↗

Calibration of Car-Following Models Using a Dual Genetic Algorithm with Central Composite Design

We report the calibration of microscopic traffic simulation models has received much attention in the simulation field. Although no standard has been established for it, a genetic algorithm (GA) has been widely employed in recent literature because of its high efficiency to find solutions in such optimization problems. However, the performance still falls short in simulation analyses to support fast decision making. This paper proposes a new calibration procedure using a dual GA and central composite design (CCD) in order to improve the efficiency. The calibration exercise goes through three major sequential steps: (1) experimental design using CCD for a quadratic response surface model (RSM) estimation, (2) 1st GA procedure using the RSM with CCD to find a near-optimal initial population for a next step, and (3) 2nd GA procedure to find a final solution. The proposed method was applied in calibrating the Gipps car-following model with respect to maximizing the likelihood of a spacing distribution between a lead and following vehicle. In order to evaluate the performance of the proposed method, a conventional calibration approach using a single GA was compared under both simulated and real vehicle trajectory data. It was found that the proposed approach enhances the optimization speed by starting to search from an initial population that is closer to the optimum than that of the other approach. This result implies the proposed approach has benefits for a large-scale traffic network simulation analysis. Finally, this method can be extended to other optimization tasks using GA in transportation studies.

42 ENGINEERING↗

River Basin Export Reduction Optimization Support Tool; a tool to screen options for reducing nutrient loads while minimizing cost

Abstract Excess loading of nitrogen and phosphorus to river networks causes environmental harm, but reducing loads from large river basins is difficult and expensive. We developed a new tool, the River Basin Export Reduction Optimization Support Tool (RBEROST) to identify the least‐cost combinations of management practices that will reduce nutrient loading to target levels in downstream and mid‐network waterbodies. We demonstrate the utility of the tool in a case study in the Upper Connecticut River Basin in New England, USA. The total project cost of optimized lowest‐cost plans ranged from $18.0 million to $41.0 million per year over 15 years depending on user specifications. Plans include both point source and non‐point source management practices, and most costs are associated with urban stormwater practices. Adding a 2% margin of safety to loading targets improved the estimated probability of success from 37.5% to 99%. The large spatial scale of RBEROST, and the consideration of both point and non‐point source contributions of nutrients, make it well suited as an initial screening tool in watershed planning.

Chamberlin, Catherine↗

Efficient proactive vehicle relocation for on-demand mobility service with recurrent neural networks

One major challenge for on-demand mobility service (OMS) providers is to seamlessly match empty vehicles with trip requests so that the total vacant mileage is minimized. In this work, we develop an innovative data-driven approach for devising efficient vehicle relocation policy for OMS that (1) proactively relocates vehicles before the demand is observed and (2) reduces the inequality among drivers' income so that the proactive relocation policy is fair and is likely to be followed by drivers. Our approach represents the fusion of optimization and machine learning methods, which comprises three steps: First, we formulate the optimal proactive relocation as an optimal/stable matching problems and solve for global optimal solutions based on historical data. Second, the optimal solutions are then grouped and fed to train the deep learning models which consist of fully connected layers and long short-term memory networks. Low rank approximation is introduced to reduce the model complexity and improve the training performances. Finally, we use the trained model to predict the relocation policy which can be implemented in real time. We conduct comprehensive numerical experiments and sensitivity analyses to demonstrate the performances of the proposed method using New York City taxi data. Here, the results suggest that our method will reduce empty mileage per trip by 54-70% under optimal matching strategy, and a 25-32% reduction can also be achieved by following stable matching strategy. We also validate that the predicted relocation policies are robust in the presence of uncertain passenger demand level and passenger trip-requesting behavior.

33 ADVANCED PROPULSION SYSTEMS↗

A novel machine learning based identification of potential adopter of rooftop solar photovoltaics

With the proliferation of rooftop solar photovoltaic installations, there is a need to proactively predict consumer potential for solar photovoltaic adoption, for improved electric utility planning and operation. Traditional analytical modeling approaches are limited to a few survey features and a larger part of the survey would remain untouched by the decision model. This article presents a novel, data-driven modeling approach that strategically prunes a large set of consumer profile features using a machine learning framework to train a model for predicting potential solar adoption. The approach utilizes the Gradient Boosting Decision Tree model through a Light Gradient Boosting framework that improves significantly over the poor prediction accuracy of the existing approaches. Model training using focal-loss based supervision is used to overcome the difficulty in identifying the potential adopters that is inherent in conventional data-driven models. In addition, to overcome possible data sparsity in a limited survey sample, a Generative Adversarial Network is presented to create synthetic user samples and its effectiveness on model performance is assessed. A Bayesian optimization approach is used to systematically arrive at the hyperparameters of the proposed model. Validation of the presented approach on a survey data collected by the National Rural Electric Cooperative Association in Virginia in 2018 demonstrates the excellent predictive capability of the machine learning based approach to modeling solar adoption reliably.

14 SOLAR ENERGY↗

Short-term Interventions for Long-term Change: Spreading Stable Green Norms in Networks

Strong empirical evidence suggests that people infer prevailing pro-environmental norms based on the behavior of people they encounter and engage with. These norms seem to be adopted in response to both internal motivation and social pressure. To formalize such behavior, the economic literature has introduced theoretical models that include moral and social drivers. We complement this theoretical literature by analyzing the adoption of green behavior in presence of social networks. Leveraging insights from the network-science literature, we extend an existing model of socially contingent moral motivation to include characteristics of human social behavior that have been shown, empirically, to matter for green behavior, but which have been neglected by most theoretical models. Our network moral-motivation model leads naturally to spatial-heterogeneity in environmental norms. Consistent with non-network models, we show that temporary subsidy can lead to stable equilibria with positive adoption, even when the subsidy is discontinued. In our model, however, regulators can achieve significant savings by targeting subsidies. With our computational exercises, using small semi-realistic networks, we quantify the gains of targeting subsidies, or social interventions, towards optimal seed groups. These gains may be large compared to widespread subsidies, or random selection of seed groups, and depend on the society’s structural characteristics. Furthermore, considering social networks may change radically the performance of initiatives aimed at promoting the adoption of green behavior.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Online Modelling and Optimization of Nonlinear Integrable Systems

Nonlinear integrable optics was recently proposed as a design approach to increase the limits on beam brightness and intensity imposed by fast collective instabilities. To study these systems experimentally, a new research electron and proton storage ring, the Integrable Optics Test Accelerator, was constructed and recently commissioned at Fermilab. Beam-based diagnostics and online modelling of nonlinear systems presents unique challenges - in this paper, we report on our efforts to develop optimization methods suited for such lattices. We explore the effectiveness of neural networks as fast online surrogate estimators, and integrate them into a beam-based tuning algorithm. We also develop a method of knob dimensionality reduction and subsequent robust multivariate optimization for maximizing key performance metrics under complicated lattice optics constraints.

43 PARTICLE ACCELERATORS↗

Analysis of precooling optimization for residential buildings

To reduce peak demand and/or energy cost for residential buildings, optimal precooling strategies are becoming important as an alternative to rule-based precooling strategies that are intuitive but may not be optimal. Since precooling optimization is heavily dependent on a variety of factors such as the home thermal properties, HVAC system, weather, thermal comfort criteria, and utility rate structure, the individual and collective impact of these factors on precooling performance needs to be analyzed. In addition, since the indoor air temperature is affected by heat transfer to and from the interior wall surface, performance analysis in view of the interior wall surface temperature is also essential. Therefore, in this paper, an optimal precooling strategy that accounts for the aforementioned factors and utilizes a second-order thermal network model, is proposed. With this strategy, the HVAC on/off control signal that minimizes 24-hour energy cost while maintaining thermal comfort, is determined. Through extensive simulations, it is found that the proposed optimal precooling strategy is able to adapt to changing conditions and that having a sufficiently low interior wall surface temperature during precooling is critical for avoiding expensive on-peak operation. Here, the reason for the latter is that such a temperature indicates that enough “cooling energy” has been stored. It is also found that weather has the most dominant impact on the precooling performance, followed by home thermal condition, with the rated cooling capacity and utility rate structure having the least impact.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Port Technical Assistance Program: A Proposed Initiative to Support U.S. Ports Through Energy Innovation

This document highlights the crucial importance of the maritime sector within the United States (U.S.) economy, serving as a key node for trade and global goods transportation. U.S. ports are currently grappling with challenges posed by rising shipping demands, the health impacts of diesel fuel reliance, and the technology adoptions of global trade partners due to increasing environmental regulations. This document proposes forming a technical assistance program, led by Pacific Northwest National Laboratory (PNNL), to help U.S. ports transition to sustainable energy solutions that not only improve environmental and community outcomes, but also enhance resilience to unexpected weather events and reduce pressure on local utilities. Coordinated by PNNL, this initiative would offer a web-based platform of consolidated resources and tools for comprehensive strategic planning and cost-benefit analysis. It also seeks to establish a collaborative network between ports and national laboratories to facilitate the sharing of best practices. The document suggests that optimizing resource allocation and providing tailored support could be achieved through strategic categorization of ports within this network, with relevant attributes and examples detailed in the report. The anticipated benefits of such a program could include increased efficiency and cost savings in port operations and the advancement of scientific innovation via alternative energy research. Also, it could enhance economic growth and competitiveness in international trade by enabling ports to meet shipping demands and develop resilient critical infrastructure through informed, long-term strategies.

33 ADVANCED PROPULSION SYSTEMS↗

Group purchasing organization design: a clustering approach

Supply chain management is monitoring of activities involved in supply chain, for integrating and coordinating between suppliers, manufacturing, inventory and transportation both within and among members. The ultimate aim of supply chains is to reduce costs and increase market coverage. Procuring and purchasing requested items in a timely manner are the two most important issues for supply chain stockholders. Group purchasing is one of the purchasing strategies in supply chains. It offers great potential by ordering large volumes to decrease expenses which can increase services to customers. A clustering optimization approach is employed to model group purchasing for a set of pharmacies in the field of healthcare. The proposed model determines a cooperation strategy based on factors such as distance between pharmacies and procurement expenditure in this network. Moreover, the proposed multi-objective group purchasing model is optimized using both goal programming and non-dominated sorting genetic algorithm. To illustrate the application of the proposed model, designing a purchasing group organization for Chalus city pharmacies is investigated. Purchasing groups are established in the way that sum of pharmacies ordering quantity has been located in the second or the third level of discount rate. Thus, the results show that GPOs can take the advantage of this cooperation.

97 MATHEMATICS AND COMPUTING↗

Ionic-content-driven restructuring of spirobisindane ionene networks: implications for mechanics, self-healing, and gas transport

Polymers of intrinsic microporosity (PIMs) offer exceptional gas permeability but remain brittle and susceptible to physical aging, limiting their durability in separation applications. Here, we introduce a reconfigurable microporous polymer network that uniquely integrates permanent PIM microporosity with autonomous, intrinsic self-healing driven by imidazolium-based ionic motifs. Spirobisindane units generate the intrinsic free-volume architecture, while an imidazolium-containing polyamide ionene supplies dynamic ionic and hydrogen-bonding interactions that reorganize under mild activation. Incorporation of imidazolium-based ionic liquids further tunes cohesion, mobility, and densification, enabling the network to relax, re-associate, and retain microporosity without structural collapse. Through a comprehensive multiscale approach combining spectroscopy, scattering, thermal and mechanical characterization with all-atom molecular dynamics and density functional theory calculations, we elucidate how ionic content, as a single control parameter that reshapes free-volume distributions, modulates local coordination environments, and governs relaxation and healing kinetics. At intermediate ionic loadings, the networks achieve rapid, repeatable self-healing while maintaining CO$_2$ selectivity, demonstrating an optimal balance between segmental mobility and structural integrity. By establishing how hierarchical ionic interactions couple structure, dynamics, and transport in microporous ionene networks, this work provides generalizable design rules for adaptive soft-matter systems that require simultaneous mechanical resilience, reconfigurability, and selective gas transport.

36 MATERIALS SCIENCE↗

Uniform redundancy allocation maximizes the robustness of flow networks against cascading failures

We study the robustness of flow networks against cascading failures under a partial load redistribution model. In particular, we consider a flow network of N lines with initial loads L 1 ,...,L N and free spaces (i.e., redundant space) S 1 ,...,S N that are independent and identically distributed with joint distribution P LS (x,y) = P[L ≤ x, S ≤ y]. The capacity C i is the maximum load allowed on line i and is given by C i = L i + S i . Furthermore, when a line fails due to overloading, it is removed from the system and (1 – ε) fraction of the load it was carrying is redistributed equally among all remaining lines in the system. The rest (i.e., ε fraction) of the load is assumed to be lost or absorbed, e.g., due to advanced circuitry disconnecting overloaded power lines or an interconnected network or material absorbing a fraction of the flow from overloaded lines. We analyze the robustness of this flow network against random attacks that remove a p fraction of the lines. Our contributions include (i) deriving the final fraction of alive lines n ∞ (p,ε) for all p,εϵ(0,1) and confirming the results via extensive simulations; (ii) showing that partial redistribution might lead to (depending on the parameter 0 < ε ≤ 1) the order of transition at the critical attack size p* changing from first to second-order; and (iii) proving analytically that flow networks achieve maximum robustness [quantified by the area ∫$^{1}_{0}$ n ∞ (p,ε)dp] when all lines have the same free space regardless of their initial load. The optimality of equal free-space allocation is also confirmed on real-world data from the UK National Power Grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗