Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Allocation”

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.

481 records · Page 27

Supply and Resource Management to Progressively Enable EIMO

BACKGROUND: Current medical operations in Low Earth Orbit (LEO) allow for real-time audio-video communication with a flight surgeon at mission control, resupply, and medical evacuation to earth on the order of hours. As mission profiles change from LEO to the Moon, Mars, and beyond, medical risk as a contribution to overall mission risk is anticipated to rise substantially. Concurrently, due to the distance, the medical systems on board vehicles proposed for these mission types are expected to have reduced mass and volume allocation. Together, astronaut crews will be at a higher risk of major medical events, be required to perform a broader set of tasks, and have substantially reduced resources and support to do so. Earth Independent Medical Operations (EIMO) aims to identify and fill the gaps present in this progressively changing paradigm. OVERVIEW: Medical supplies, resources, and skills are central to spaceflight medical systems. Vehicles used for non-LEO missions are anticipated to be smaller and thus the medical system will also need to have reduced mass, volume, and power. Medical resources are another form of consumable and may need resupply or pre-deployment to meet crew needs. One particular concern is the degradation of medications which become less efficacious and potentially toxic with time, particularly given environmental conditions such as temperature, humidity, oxygen, and radiation which have not yet been fully studied. Supply and resource management in LEO is dependent on resupply, however the supply chain of transporting equipment does not yet have a clear infrastructure for missions beyond LEO. DISCUSSION: EIMO is intended to systemically identify and fill these gaps with forward-looking solutions. In mission monitoring of resources with technology like RFID, improving medical resource longevity, targeted resupply and careful pre-mission planning will be central to facilitate crew health and performance. One approach to optimizing resources is the Informing Mission Planning via Analysis of Complex Tradespaces (IMPACT) tool, which uses probabilistic risk assessment (PRA) to quantitatively predict medical risk and identify resources and skills that mitigate this risk. This evidence based, quantitative analysis prediction tool and several other approaches to meeting the challenge of supply and resource management are discussed.

Arian Anderson↗

FIRE: A Failure-Adaptive RL Framework for Edge Computing Migrations

In edge computing, users' service profiles are migrated between edge servers due to user mobility. Reinforcement Learning (RL) frameworks have been proposed to do so, often trained on simulated data. However, existing RL frameworks overlook occasional server failures, which although rare, impact latency-sensitive applications like AR/VR and real- time obstacle detection. These rare failures, being not adequately represented in historical training data, pose a challenge for data-driven RL algorithms. We introduce FIRE, a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose FIRE-ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. FIRE considers delay, migration, failure, and backup placement costs across individual and shared service profiles. We prove FIRE-ImRE's boundedness and convergence to optimality. Next, we introduce novel deep Q-learning (FIRE-ImDQL) and actor critic (FIRE-ImACRE) versions of our algorithm to enhance scalability. Here, we extend our framework to accommodate users with varying risk tolerances of rare failure events. Through trace-driven experiments, we show that FIRE reduces edge computing costs compared to vanilla RL and the greedy baseline in the event of failures.

Edge computing↗

California Price Response Potential Study

California's energy landscape is undergoing a significant transformation, driven by the increasing integration of renewable energy sources, the increased adoption of distributed energy resources, the electrification of end-use loads, and the growing need for grid efficiency. To address these challenges, recent revisions to the State’s Load Management Standards (LMS) require all of California’s large utilities and community choice aggregators (CCAs) to offer dynamic electricity pricing options to customers by 2027. Dynamic pricing, which involves varying electricity rates based on real-time supply and demand conditions, offers a promising solution for optimizing grid operations, reducing costs, and incentivizing efficient use of grid capacity. Effective implementation of dynamic pricing requires understanding the potential impacts on customer bills, system load, and the cost-effectiveness of automation technologies. This study aims to evaluate the load response of various end-use devices to hourly dynamic prices. The end-uses studied here are space cooling, space heating, water heating, crop irrigation, pool and spa pumps, and electric vehicle (EV) charging, all for both residential and commercial applications, except for crop irrigation. In 2030, these end uses are forecasted to account for 18% of annual electricity demand in the state, but 40% of demand in the peak net load hour. By modeling possible price-responsive load dispatch algorithms and assessing the resulting impacts on both individual bills and the overall grid, we seek to inform policymakers and utilities about the potential benefits and challenges associated with dynamic pricing, and considerations for the design of dynamic pricing tariffs. Additionally, we will explore the cost effectiveness of adopting automation technologies to enable devices to respond more effectively to real-time price signals. This study considers a range of price profiles, accounting for differences across utilities and customer classes, and presents scenarios for dynamic price design via variation in the percentage of total customer electric costs that are allocated dynamically (versus constituting a fixed portion of the hourly volumetric price). We present results focused primarily on 2030, forecasting electricity prices under both low and high-cost scenarios, to inform longer-term tariff design considerations. We design tariffs by starting with 2019 prices that were calculated according to CalFUSE guidance (CPUC, 2022) and that have been used in recent studies; these prices are all-in volumetric rates that vary by utility and are revenue-neutral to each customer class. They are developed by considering six electricity cost components that are allocated hourly based on system load indicators (gross and net load, and wholesale prices). These prices are forecasted to 2030 for low and high cost scenarios, considering recent trends in total electricity costs with and without years of substantial wildfire mitigation investments. These tariffs, which allocate all costs on an hourly basis, are considered our “Full” dynamic tariff design scenario, while two additional scenarios explore allocating a portion of costs as a flat volumetric charge: the “Medium” scenario allocates 50% of revenue dynamically (and keeps 50% flat), while the “Mild” scenario allocates 20% of revenue dynamically. The 20% dynamic allocation on the Mild scenario aims to represent a case where only the marginal operating costs of the grid are included in the dynamic price.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗

Composite Bus Structure for the SMEX/WIRE Satellite

In an effort to reduce the weight and optimize the structural design of the Small Explorer (SMEX) Wide-Field Infrared Explorer (WIRE) spacecraft, it has become desirable to change the material and construction from mechanically fastened aluminum structure to a fully bonded fiber-reinforced composite (FRC) structure. GSFC has developed the WIRE spacecraft structural bus design concept, including the instrument and launch vehicle requirements. The WIRE Satellite is the fifth of a series of SMEX satellites to be launched once per year. GSFC has chosen Composite Optics Inc. (COI) as the prime contractor for the development and procurement of the WIRE composite structure. The detailed design of the fully bonded FRC structure is based on COI's Short Notice Accelerated Production SATellite ("SNAPSAT") approach. SNAPSAT is a state of the art design and manufacturing technology for advanced composite materials which utilizes flat-stock detail parts bonded together to produce a final structural assembly. The structural design approach adopted for the WIRE structure provides a very viable alternative to both traditional aluminum construction as well as high tech. molded type composite structures. This approach to composite structure design is much less costly than molded or honeycomb sandwich type composite construction, but may cost slightly more than conventional aluminum construction on the subsystem level. However on the overall program level the weight saving achieved is very cost effective, since the primary objective is to allocate more mass for science payloads.

Rosanova, Giulio G.↗

HydraGNN_Predictive_GFM_2024 - Ensemble of predictive graph foundation models for ground state atomistic materials modeling

We provide the ensemble of fifteen pre-trained graph foundation models (GFMs) for atomistic materials modeling applications. Each one of the fifteen GFMs has been trained on five open-source datasets that (once aggregated) amount to over 154 million atomistic structures, which cover over two-thirds of the natural elements of the periodic table and that comprises a broad set of organic and inorganic compounds. This vast set of atomistic structures comprises ground state configurations that are dynamically stable (i.e., equilibrated structures with atomic forces approximately close to zero values) as well as dynamically unstable structures (i.e., non-equilibrium structures with non-negligible non-zero values of atomic forces). The ensemble of datasets aggregated does NOT include excited states. The datasets have been curated to remove atomistic structures with spectral norm of the force tensor above 100 eV/angstrom. Moreover, a linear term of the energy was computed for each dataset using a linear regression model that uses the chemical concentration of each natural element as regressor. The linear term predicted by the linear regression model has been subtracted from each original energy value to perform a re-alignment of the energy values across different electronic structures approximation theories performed to generate the diverse multi-source, multi-fidelity datasets. The folder "ADIOS_files" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "ADIOS_files" directory contains 6 sub-directories named as follows: - ANI1x-v3.bp - MPTrj-v3.bp - OC2020-20M-v3.bp - OC2020-v3.bp - OC2022-v3.bp - qm7x-v3.bp Each sub-directory contains the pre-processed datasets converted in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used to the development, training, and performance testing of the ensemble go predictive graph foundation models. Each GFM was developed using HydraGNN (https://github.com/ORNL/HydraGNN) as underlying graph neural network (GNN) architecture. The multi-task learning (MTL) capability of HydraGNN was used to simultaneously train the GFMs on labeled values for direct predictions of energy (a total system property of an atomistic structure that measures the chemical stability) and atomic forces (an atomic level property of an atomistic structure that measures the dynamical stability). The hyper parameters of the GFM have been tuned using scalable hyperparameter optimization (HPO) algorithms implemented in the software DeepHyper (https://github.com/deephyper/deephyper). The pre-training of each HPO trial was performed using distributed data parallelism (DDP) to scale the training across 128 compute nodes of the exascale OLCF supercomputer Frontier. Each HPO trial was trained only for 10 epochs and an early stopping was performed to avoid wasting significant computational resources on GNN architectures that were clearly underperforming. For each HPO trial, the 'omnistat' tool developed by (AMD Research - Advanced Micro Device) was used to measure the total energy consumption in kWh. The ensemble of GFMs was obtained by selecting the fifteen best performing HPO trials. Four models have been selected for their clear advantage in accuracy, and these are the GFMs with IDs 229, 156, 147, 260. Additional eleven models have been selected based on judicious balance between accuracy and energy consumption needed for training, and these are the GFMs with IDs 165, 78, 137, 1, 175, 171, 181, 67, 179, 167, 351. Each selected GFM of the ensemble was continued to cumulate a total of at most 30 epochs. In some cases, the total number of epochs actually performed was les than 30 due to two combined factors: (1) the size of the GFM (i.e., the number of model parameters to train) and (2) the total wall-clock time for which the computational resources could be allocated on OLCF-Frontier. The "Ensemble_of_models" directory contains 15 sub-directories named as follows: - gfm_0.229 - gfm_0.156 - gfm_0.147 - gfm_0.260 - gfm_0.165 - gfm_0.78 - gfm_0.137 - gfm_0.1 - gfm_0.175 - gfm_0.171 - gfm_0.181 - gfm_0.67 - gfm_0.179 - gfm_0.167 - gfm_0.351 Each one of these sub-directories refers to one of the fifteen HPO trials that have been selected to continue the pre-training with at most 30 epochs. With each sub-directory associated with a specific HPO trial, the following files can be found: - config.json: file for argument parsing to develop and train an HydraGNN architecture - gfm_0.ID_epoch_N.pk: file with model parameters for HPO ID trial after N epochs of training The ensemble of fifteen GFM architectures was used for (1) ensemble averaging to stabilize the predictions of energy and atomic forces after pre-training for post-processing analysis and (2) ensemble uncertainty quantification (UQ). The code used to develop, pre-train, and load the pre-trained models for post-processing analysis is available on the ORNL-GitHub at the following link: https://github.com/ORNL/HydraGNN/tree/Predictive_GFM_2024

36 MATERIALS SCIENCE↗

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

System Modeling of a Lunar Molten Regolith Electrolysis Plant

Introduction: In-Situ Resource Utilization (ISRU) is the process of extracting local resources to produce commodities for propulsion, life support systems, and off-planet construction rather than transporting consumables from Earth. Molten Regolith Electrolysis (MRE) is a novel ISRU method of extracting oxygen gas and metal alloy from lunar regolith. The MRE process involves placing lunar regolith between two electrodes, through which current is passed, to melt the regolith and reduce the metal oxide constituents by direct electrolysis (e.g. FeO, SiO2, MgO, Al2O3) into oxygen gas and metal alloys. The oxygen is liquefied and used as propellant for landers, while the metals (e.g. Ferro-alloys) are further processed and used in structural building materials and parts manufacturing. A system model was developed that accounted for the major processes of an MRE plant (from excavation of raw materials to storage of products) to assess the feasibility of a lunar MRE plant. The System Engineering and Integration (SE&I) ISRU Modeling and Analysis (SIMA) team utilized its previously documented system sizing model, the Mission Analysis and Integration Tool (MAIT) [1] as framework of the system model. MAIT uses MATLAB/Simulink to integrate subsystem models into a complete system model of the MRE plant. Total mass, volume, and power requirements were computed for numerous iterations of a MRE plant. System Model: Figure 1: MRE Plant Block Diagram The regolith excavation model determines the mass and power needed to excavate sufficient regolith. The preheating auger initiates the regolith heating process before regolith enters the MRE re-actor to reduce the energy required to turn the solid into a molten liquid. The MRE reactor is modeled in COMSOL Multiphysics and based on the research by Dominguez, Sibille, and Schreiner [2, 3, 4]. This preliminary reactor model provides an accurate calculation of thermal equilibrium during electrochemical operation of the reactor system to assess the optimal mass and power required to process the inlet flow of regolith. The model also computes the outlet flowrates of oxygen and molten products. For this analysis, the primary components of the metal alloy considered were iron and silicon. The oxygen is then purified using an Yttrium Stabilized Zirconia (YSZ) electrode, followed by liquefaction using a 90K cryocooler to be stored as liquid oxygen in insulated cylindrical tanks. In future iterations of the system model, the molten metal tapped from the MRE reactor will undergo additional processing or refinement. However, downstream handling of metals is currently a technology gap that is missing a high TRL subsystem model. Therefore, for this analysis, the accumulated metal alloy stream terminates after leaving the MRE reactor. Study Goals: This analysis investigates multiple input variables to the system to determine the sensitivity of a (near) complete plant at full-scale. This preliminary investigation ran parametric sweeps on the MRE reactor geometry, electrical current supply, layers of multi-layer insulation (MLI) on the reactor, size of the electrodes in the oxygen purification model, and regolith composition (based on landing site location). Three production targets of oxygen (1,000, 10,000, and 50,000 kg/yr) were investigated for this analysis. The parametric sweeps conducted in this analysis provide valuable insight into the expected impact of the various model inputs on plant size. This information can be used to identify the most critical components of the plant and guide future decisions on allocating funding for research and development, providing subsystem developers with appropriate interfaces with downstream and upstream processes, and assessing the overall feasibility of MRE when compared to other ISRU plants. References: [1] Carlson, A. et al. (2024) ICES, ICES-2024-53. [2] Dominguez, D.A., and Sibille, L. (2011) AIAA, AIAA-2011-700. [3] Schreiner, S.S. (2015) MIT, Dissertation. [4] Schreiner, S.S. et al. (2016) ASR, 57(7), pp.1585-1603.

ISRU↗

A Novel LDPP-MADDPG Approach for Distributed Power Allocation in mmWave Cellular Networks

This paper considers the problem of distributed beam scheduling and power allocation problem in millimeter- Wave (mmWave) cellular networks, in which multiple Base Stations (BSs) operate as individual operators over a shared spectrum. We propose a novel learning-aided approach that integrates the Lyapunov Drift-Plus-Penalty (LDPP) framework and Multi-agent Deep Deterministic Policy Gradient (MADDPG) reinforcement learning algorithms. This offers a powerful approach to learning stable and constraint-aware policies, reaping the joint benefit of both LDPP and MADDPG, in complex multiagent environments. The major challenge for this approach is to integrate these two approaches in a meaningful and effective manner. The key idea to solve this problem is to introduce a novel feature of local observation that incorporates potential negative value of the reward function due to the stochastic constraints introduced by the LDPP framework. Empirical results demonstrate that our proposed scheme outperforms the baseline methods under various conditions.

99 - GENERAL AND MISCELLANEOUS↗

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗

Application of artificial intelligence methods in the international roughness index prediction of rigid and composite pavements: a systematic review

The International Roughness Index (IRI) is a widely adopted metric for quantifying pavement roughness, directly influencing vehicle safety, ride comfort, and overall roadway performance. In recent years, the use of Machine Learning (ML) models for IRI prediction has gained momentum, with the goal of improving the allocation of maintenance and rehabilitation resources by enabling accurate assessments of pavement conditions. Most prior reviews, however, have concentrated on flexible pavements, leaving a notable gap regarding rigid and composite pavements. To address this gap, the present study conducts a systematic review of Artificial Intelligence (AI) methods applied to IRI prediction for rigid and composite pavements. Literature published between 2004 and 2025 is synthesized to highlight prevailing trends, methodological contributions, and directions for future research. Particular attention is given to the types of models employed, the datasets used for training and validation, and the role of input variables and data-processing strategies. Across the included studies, ensemble learning methods (especially gradient boosting variants such as XGBoost), artificial neural networks, and hybrid architectures frequently achieved high predictive skill, with several models reporting test-set coefficients of determination approaching 0.9–0.96, indicating strong potential for capturing the influence of traffic, pavement structure, and climatic factors. Since these results are obtained from heterogeneous datasets and evaluation protocols, they are interpreted qualitatively rather than as strict cross-study rankings. Analysis of input variables revealed that pavement age and initial IRI were included in 91% (21 of 23) and 78% (18 of 23) of studies, respectively. Climatic variables such as the freezing index appeared in 57% (13 of 23), while traffic-related factors were considered in 65% (15 of 23). The findings underscore the importance of standardized, high-quality datasets, such as those from the Long-Term Pavement Performance (LTPP) program, along with data consistency, model interpretability, computational efficiency, and replicability in enhancing IRI prediction. Future research should focus on incorporating input variable selection techniques to identify the most influential predictors, thereby improving accuracy and robustness. Integrating these approaches with advanced non-linear data-driven models, coupled with robust hyperparameter optimization, holds considerable promise for strengthening the reliability of IRI prediction and supporting resilient pavement management strategies.

42 ENGINEERING↗

AMF diversity promotes plant community phosphorus acquisition and reduces carbon costs per unit of phosphorus

Plants may benefit from more diverse communities of arbuscular mycorrhizal fungi (AMF), as functional complementarity of AMF may allow for increased resource acquisition, and because a high AMF diversity increases the probability of plants matching with an optimal AMF symbiont. Here, we repeatedly radiolabeled plants and AMF in the glasshouse over c. 9 months to test how AMF species richness (SR) influences the exchange of plant C ( 14 C) for AMF P ( 32 P & 33 P) and resulting shoot nutrients and mass from a biodiversity–ecosystem functioning perspective. Plant P acquisition via AMF increased with sown AMF SR, as did shoot biomass, shoot P, and shoot N. The rate of plant C transferred to AMF for this P (C:P) decreased with sown AMF SR. Plants in plant communities benefit from inoculation with a variety of AMF species via more favorable resource exchange. Surprisingly, this effect did not differ among functionally distinct communities comprised entirely of either legumes, nonlegume forbs, or C3 grasses.

arbuscular mycorrhizal fungi↗

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning↗