Search NASA⌕ Search

SEARCH · Search NASA

Results for “allocation methods”

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 181 records · Page 10

Optimal Iterative Method for Network Utility Maximization with Intertemporal Constraints

Network utility maximization (NUM) has been widely used to solve the optimal resource allocation problem in wireless network and power systems. The network planner aims to allocate generation and demand over producers and consumers such that social welfare is maximized while supply and demand are balanced, and network constraints such as branch capacity constraints are satisfied. However, when taking into account dynamics of agents, such as ramp rate constraints on power output for suppliers and impact of cumulative prior consumption on current demand for consumers, a single-period formulation is not sufficient. We propose an iterative method for the multi-period NUM with intertemporal constraints based on dual decomposition. It features a price iteration scheme that achieves optimal social welfare, and the algorithm is guaranteed to converge if proper concavity condition holds. We illustrate the iterative algorithm by power system examples. It is shown that similar to locational marginal price (LMP) in power systems, time-varying congestion prices arise when there exists binding branch constraints. Simulation results also demonstrate that there is increase in social welfare compared to a single-period formulation.

Ma, Ke↗

Tools And Methods to Analyze Plant Outage Schedule and Assist Schedulers in Improving Outage Resilience

Refueling outages of nuclear power plants (NPPs) are considered one of the most critical phases throughout the plant lifetime. In such instances, tens of thousands of activities (e.g., maintenance, surveillance) are performed in a short amount of time (typically 2-3 weeks unless major backfitting or modernization projects are carried out) by a large number of crews (e.g., electricians, mechanics) that are hired as contractors. As a consequence, a plant outage can be expensive not only in terms of costs (e.g., contractor labor, material), but also in terms of loss generation since the plant is taken off the grid during the full outage duration (an indicative metric is about 1.2M$/day of loss of revenue). Thus, there is a continuous need to decrease the economic impact of outages on plant finances. This can be done by: decreasing the frequency of plant outages (e.g., from 18 to 24 months), reducing the time to complete the outage, and reducing the risk of outage delays. The Optimization of Outage Activities project under the Risk Informed Systems Analysis Pathway (RISA) sponsored by Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program focuses on developing tools and methods to support NPPs with outage schedule optimization. The developed tools and methods are designed to analyze plant outage schedule with the goal of identify critical elements in the schedule that might pose a high risk of delays. These methods and tools can be considered resource-centric in the sense that they address outage challenges as a resource optimization problem. In this context, resources are either time and crews; outage delays occurs when either (or both) resources are insufficient to complete the set of tasks assigned at a specific time instant of the outage. This report provides details on how plant resources (time and crews) can be allocated in such a way that delays are minimized. In this respect, two classes of methods have been developed: the first one focuses on the time resource and how variability of the time to complete outage tasks may impact outage delays. The second one integrates available resources to assess when dailies activities should be performed such that the risk of outage delays are minimized.

97 MATHEMATICS AND COMPUTING↗

Building a Wide-Area File Transfer Performance Predictor: An Empirical Study

Wide-area data transfer is central to geographically distributed scientific workflows. Faster delivery of data is important for these workflows. Predictability is equally (or even more) important. With the goal of providing a reasonably accurate estimate of data transfer time to improve resource allocation & scheduling for workflows and enable end-to-end data transfer optimization, we apply machine learning methods to develop predictive models for data transfer times over a variety of wide area networks. To build and evaluate these models, we use 201,388 transfers, involving 759 million files totaling 9 PB transferred, over 115 heavily used source-destination pairs (“edges”) between 135 unique endpoints. We evaluate the models for different retraining frequencies and different window size of history data. In the best case, the resulting models have a median prediction error of ≤21% for 50% of the edges, and ≤32% for 75% of the edges. We present a detailed analysis of these results that provides insights into the cause of some of the high errors. We envision that the performance predictor will be informative for scheduling geo-distributed workflows. The insights also suggest obvious directions for both further analysis and transfer service optimization.

Liu, Zhengchun↗

Enhancing Security and Resiliency in Operational Technology Environments Through Network Slicing and Federated Learning

The growing convergence of Information Technology (IT) and Operational Technology (OT) within Industry 4.0 environments has introduced new demands on industrial network infrastructure. As cyber-physical systems become increasingly interconnected, ensuring the secure, timely, and efficient exchange of critical data is essential. This thesis explores how network slicing, a method of creating isolated virtual network segments, can be applied within OT environments to address challenges such as latency, security, and resource allocation. The first research question addressed in this thesis is: How can OT networks take advantage of NFV and SDN technology to become cyber resilient? This study examines the operational, security, and architectural implications of introducing network slicing into traditionally static OT infrastructures such as Industrial Control Systems (ICS) and SCADA. Through simulated deployments and case studies, the research demonstrates how slicing enables better isolation between critical and non-critical services, thereby improving response time, throughput, and security in sensitive environments. The second question considers: How to dynamically implement network slicing and take advantage of network resources towards integrating decentralized machine learning? In response, this thesis proposes a framework that combines Software-Defined Networking (SDN), Network Function Virtualization (NFV), and Federated Learning (FL) to enable real-time analytics while maintaining data locality. The proposed approach reduces the burden on centralized infrastructure and minimizes privacy risks by supporting on-site training of models across distributed OT nodes, coordinated through dynamically allocated network slices. The third focus explores: How slicing helps to increase the resiliency of OT networks through the orchestration of a dynamic DMZ? To answer this, the thesis presents a method for creating and managing Dynamic Demilitarized Zones (DMZs) using network slicing. This enables flexible and automated isolation of sensitive subsystems during threat scenarios or high-risk operations. Coupled with intelligent orchestration and containerized security services, the dynamic DMZ significantly enhances the system's ability to respond to cyber incidents without halting production. Ultimately, this thesis contributes a comprehensive architecture that blends network slicing with machine learning, secure segmentation, and automation, paving the way for resilient, adaptive, and intelligent OT environments. Performance evaluations across multiple scenarios show improvements in system reliability, threat response time, model accuracy, and resource utilization, providing a strong foundation for future industrial automation systems.

Rodiles Delgado, Brian G↗

Safety and Short-Term Efficacy of Irreversible Electroporation and Allogenic Natural Killer Cell Immunotherapy Combination in the Treatment of Patients with Unresectable Primary Liver Cancer

Purpose: This study aimed to investigate the safety and short-term efficacy of irreversible electroporation (IRE) combined with allogenic natural killer (NK) cell immunotherapy in the treatment of patients with unresectable primary liver cancer. Materials and Methods: Between October 2015 and December 2016, 40 patients were enrolled and randomly allocated to either the IRE group (n = 22) or the IRE–NK group (n = 18). All adverse events experienced by the patients were recorded; the changes in tumor biomarkers [AFP, CA 19-9, circulating tumor cells (CTCs)], lymphocyte number and function, quality of life, clinical response, progression-free survival (PFS) and overall survival (OS) were assessed. Results: Patients who received combination therapy exhibited significantly longer median PFS and OS than who just received IRE (PFS 15.1 vs. 10.6 months, P < 0.05, OS 17.9 vs. 23.2 months, P < 0.05). The combination therapy of IRE and NK cell immunotherapy significantly reduced CTCs and increased immune function and Karnofsky performance status. Conclusion: Our data suggest a novel, promising combination therapy using IRE and allogenic NK cell immunotherapy. Larger clinical trials are required to confirm these conclusions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

UPC++ Programmer’s Guide (v1.0 2017.9)

UPC++ is a C++11 library that provides Asynchronous Partitioned Global Address Space (APGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The APGAS model is single program, multiple-data (SPMD), with each separate thread of execution (referred to as a rank, a term borrowed from MPI) having access to local memory as it would in C++. However, APGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the ranks. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide, v1.0-2018.3.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate thread of execution (referred to as a rank, a term borrowed from MPI) having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the ranks. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide (v1.0-2019.3.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide (Revision 2019.9.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2020.10.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide, v1.0-2018.9.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2020.3.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

On Finding Black Holes in Photometric Microlensing Surveys

There are expected to be millions of isolated black holes in the galaxy resulting from the deaths of massive stars. Measuring the abundance and properties of this remnant population would shed light on the end stages of stellar evolution and the evolution paths of black hole systems. Detecting isolated black holes is currently only possible via gravitational microlensing, which has so far yielded one definitive detection. The difficulty in finding microlensing black holes lies in having to choose a small subset of events, based on characteristics of their light curves, to allocate expensive and scarce follow-up resources to confirm the identity of the lens. Current methods either rely on simple cuts in parameter space without using the full distribution information or are only effective on small subsets of events. In this paper, we present a new lens classification method. The classifier takes in posterior constraints on light-curve parameters and combines them with a Galactic simulation to estimate the lens class probability. This method is flexible and can be used with any set of microlensing light-curve parameters, making it applicable to large samples of events. We make this classification framework available via the popclass Python package. We apply the classifier to ~10,000 microlensing events from the Optical Gravitational Lensing Experiment survey and find 23 high-probability black hole candidates. Our classifier also suggests that the only known isolated black hole is an observational outlier, according to current Galactic models, and the allocation of astrometric follow-up on this event was a high-risk strategy.

79 ASTRONOMY AND ASTROPHYSICS↗

Proportion of fine roots, but not plant biomass allocation below ground, increases with elevation in arctic tundra

Questions: Roots represent a considerable proportion of biomass, primary production and litter input in arctic tundra, and plant allocation of biomass to above- or below- ground tissue in response to climate change is a key factor in the future C balance of these ecosystems. According to optimality theory plants allocate C to the above- or below-ground structure that captures the most limiting resource. We used an elevational gradient to test this theory and as a space-for-time substitution to inform on tundra carbon allocation patterns under a shifting climate, by exploring if increasing elevation was positively related to the root:shoot ratio, as well as a larger plant allocation to adsorptive over storage roots. Location: Arctic tundra heath dominated by Empetrum hermaphroditum close to Abisko, Sweden. Methods: We measured root:shoot and fine:coarse root ratios of the plant communities along an elevational gradient by sampling above- and below-ground biomass, further separating root biomass into fine (<1 mm) and coarse roots. Results: Plant biomass was higher at the lower elevations, but the root:shoot ratio did not vary with elevation. Resource allocation to fine relative to coarse roots increased with elevation, resulting in a fine:coarse root ratio that more than doubled with in- creasing elevation. Conclusions: Contrary to previous works, the root:shoot ratio along this elevational gradient remained stable. However, communities along our study system were dominated by the same species at each elevation, which suggests that when changes in the root:shoot ratio occur with elevation these changes may be driven by differences in allocation patterns among species and thus turnover in plant community structure. Our results further reveal that the allocation of biomass to fine relative to coarse roots can differ between locations along an elevational gradient, even when overall above- vs below-ground biomass allocation does not. Given the functionally different roles of fine vs coarse roots this could have large implications for below-ground C cycling. Thus. our results highlight the importance of direct effects vs indirect effects (such as changes in plant community composition and nutrient availability) of climate change for future C allocation above and below ground.

59 BASIC BIOLOGICAL SCIENCES↗

Robust Design Under Uncertainty in Quantum Error Mitigation

Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical postprocessing of quantum computation outcomes is a popular approach for error mitigation, which includes methods, such as zero noise extrapolation, virtual distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number of a quantum measurement. In this work, we introduce general and unbiased methods for quantifying the uncertainty and error of error-mitigated observables based on the strategic sampling of error mitigation outcomes. We then extend our approach to demonstrate the optimization of performance and robustness of error mitigation under uncertainty. To illustrate our methods, we apply them to zero noise extrapolation and Clifford date regression in the ground state of the XY model simulated using depolarizing and International Business Machines Corporation (IBM) Toronto noise models, respectively. In particular, we optimize the choice of noise levels and the allocation of shots for zero noise extrapolation and the distribution of the training circuits for Clifford data regression. While our methods are readily applicable to any postprocessing-based error mitigation approach, in practice they must not be prohibitively expensive—even though they perform optimizations of the error mitigation hyperparameters requiring sampling of a statistical distribution of error mitigation outcomes. By leveraging surrogate-based optimization, we show that our methods can efficiently perform optimal design for a zero noise extrapolation implementation. We then further demonstrate the transferability of learned zero noise extrapolation hyperparameters to other similar circuits.

97 MATHEMATICS AND COMPUTING↗

A Prospective Quasi-Randomized Comparison of Intraoperatively Built Custom-Linked Seeds Versus Loose Seeds for Prostate Brachytherapy

Purpose: To compare dosimetric parameters, seed migration rates, operation times, and acute toxicities of intraoperatively built custom-linked (IBCL) seeds with those of loose seeds for prostate brachytherapy. Methods and Materials: Participants were 140 patients with low or intermediate prostate cancer prospectively allocated to an IBCL seed group (n=74) or a loose seed group (n=66), using quasirandomization (allocated by week of the month). All patients underwent prostate brachytherapy using an interactive plan technique. Computed tomography and plain radiography were performed the next day and 1 month after brachytherapy. The primary endpoint was detection of a 5% difference in dose to 90% of prostate volume on postimplant computed tomography 1 month after treatment. Seed migration was defined as a seed position >1 cm from the cluster of other seeds on radiography. A seed dropped into the seminal vesicle was also defined as a migrated seed. Results: Dosimetric parameters including the primary endpoint did not differ significantly between groups, but seed migration rate was significantly lower in the IBCL seed group (0%) than in the loose seed group (55%; P<.001). Mean operation time was slightly but significantly longer in the IBCL seed group (57 min) than in the loose seed group (50 min; P<.001). No significant differences in acute toxicities were seen between groups (median follow-up, 9 months). Conclusions: This prospective quasirandomized control trial showed no dosimetric differences between IBCL seed and loose seed groups. However, a strong trend toward decreased postimplant seed migration was shown in the IBCL seed group.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Chemical shifts of small heterogeneous Ar/Xe clusters

Heterogeneous rare-gas clusters produced by a coexpansion of an argon/xenon mixture have been studied using synchrotron-radiation-based photoelectron spectroscopy. Both valence and Xe 4d{sub 5/2} core-level photoelectron spectra were recorded for three different concentrations of the primary argon/xenon mixture and, for those mixtures, spectra were recorded at several different stagnation conditions. The studied size regime of the mixed clusters ranges from large, similar to those studied in an earlier paper [Phys. Rev. A 69, 031210(R) (2004)], to very small--as reflected in the cluster line shapes and chemical shifts. The chemical shifts obtained from a curve fitting procedure similar to that used in our earlier paper are discussed in terms of the mixed cluster structure which can be expected from equilibrium considerations and the Lennard-Jones parameters of the constituent atoms. Molecular dynamics simulations of the vertical polarization shifts allow more specific assignments of ''on-top'' sites and interfacial sites.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Biomass Resource Allocation among Competing End Uses

The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilizationin analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition forbiomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.

09 BIOMASS FUELS↗