SEARCH · Engineering Papers
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.
The Communities Local Energy Action Program (LEAP) pilot overview fact sheet provides background on the opportunities and benefits of the program, the various pathways that communities are pursuing, and the technical assistance provided.
Since 2009, the U.S. Department of Energy (DOE) Office of Nuclear Energy's Nuclear Energy University Program (NEUP) has been at the forefront of nuclear research, specifically concentrating on advancing high-temperature gas-cooled reactor (HTGR) technologies. By Fiscal Year 2023, NEUP has authorized 35 projects dedicated to HTGR research, each contributing significantly to the enhancement of our understanding of this technology. The outcomes of these diverse projects have been disseminated through final NEUP reports, peer-reviewed journal articles, and presentations at academic conferences, forming a comprehensive tapestry of knowledge. Despite the substantial value of these findings, their dissemination has been fragmented, posing challenges for accessibility to researchers and policymakers and leading to underutilization of DOE investments. Recognizing this critical gap and its potential consequences for the future of nuclear research, the Advanced Reactor Technologies (ART) Gas-Cooled Reactor (GCR) program conducted an extensive survey of completed and ongoing HTGR NEUP projects. This survey enabled the compilation of crucial data, resulting in the development of a specialized public-access database tailored for computational fluid dynamics and system code validation, specifically designed for HTGR applications. However, the data collection process revealed a significant challenge in central data organization due to individual researchers from different institutes employing varying logics and preferences for recording and documenting experimental data. Consequently, an urgent need has been identified to establish a standardized reporting format for HTGR experimental projects. Addressing this issue is essential for enhancing collaboration, maximizing the impact of DOE investments, and ensuring the seamless advancement of HTGR technologies in nuclear research.
Valdiation and verification of numerical tools is critical for ensuring reasonable predictions for design scoping, licensing, and safety analsyis. In this report, two reactor physics verification and validation exercises are presented. The first of these exercises focuses on burnup analysis with data from the Advanced Gas Reactor (AGR) program. Simulations are performed with Monte Carlo N-Particle (MCNP) and are compared with the experimental measurements for the AGR 1 and 2 experiments that utilize both UCO and UO2 fuel. The second exercises utilizes data from the HTR-Proteus experiments to perform reactor physics validation. Specifications of the experimental facility are provdied, along with a demonstration of initial modeling efforts in Serpent for one of the determistic packing experiments. Both cases are part of the Generation-IV international forum (GIF) Very High-Temperature Reactor (VHTR) Computational Methods, Validation, and Benchmarking (CMVB) program, an international collaborative organization dedicated to the verification and validation of High-Temperature Gas-Cooled Reactor (HTGR) analysis. Participation in the CMVB allows the US Department of Energy (DOE) to leverage these existing validation activities to provide extra value through benchmarking activities with other CMVB members.
Cost-efficient selection and scheduling of a subset of geographically distributed resources to meet the demands of a scientific workflow is a challenging problem. The problem is exacerbated by uncertainties in demand and availability of resources. In this paper, we present a stochastic optimization based framework for robust decision making in the selection of distributed resources over a planning horizon under demand uncertainty. We present a novel two-stage stochastic programming model for resource selection, and implement an L-shaped decomposition algorithm to solve this model. A Sample Average Approximation algorithm is integrated to enable stochastic optimization to solve problems with a large number of scenarios. Using the metric of stochastic solution, we demonstrate up to 30% cost reduction relative to solutions without explicit consideration of demand uncertainty for a 24-month problem. We also demonstrate up to 54% cost reduction relative to a previously developed solution for a 36-month problem. We further argue that the composition of resources selected is superior to solutions computed without explicit consideration of uncertainties. Given the importance of resource selection and scheduling of complex scientific workflows, especially in the context of commercial cloud computing, we believe that our novel stochastic programming framework will benefit many researchers as well as users of distributed computing resources.
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.
Here we present a numerical method for approximating the solution of convex integer programs stemming from optimal experimental design. The statistical setup consists of a Bayesian framework for linear inverse problems for which the direct relationship is described by a discretized integral equation. Specifically, we aim to find the optimal sensor placement from a set of candidate locations where data are collected with measurement error. The convex objective function is a measure of the uncertainty, described here by the trace or log-determinant of the posterior covariance matrix, for the discretized linear inverse problem solution. The resulting convex integer program is relaxed, producing a lower bound. An upper bound is obtained by extending the sum-up rounding approach to multiple dimensions. For this extension, we analyze its accuracy as a function of the discretization mesh size for a rectangular domain. We show asymptotic optimality of the integer solution defining the upper bound for different experimental design criteria (A- and D-optimal), by proving the convergence to zero of the gap between the upper and lower bounds as the mesh size goes to zero. The technique is illustrated on a two-dimensional gravity surveying problem for both A-optimal and D-optimal sensor placement where our designs yield better results compared with a thresholding rounding approach.
The Los Alamos National Laboratory exchange program is the only program of its kind for the distribution of plutonium (Pu) standards materials with a range of impurity contents to multiple laboratories for destructive measurements of elemental concentration. This paper discusses statistical methods used to address challenges in Pu metal exchange data by way of two case studies. Challenges include how to evaluate a data set when a large fraction of the values are minimum detection limits (MDLs), and how to determine potential outliers with limited in-formation on the true spread of the data.
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. So, the empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.
Directive-based programming models, such as OpenMP, OpenACC, and OmpSs, enable users to accelerate applications by using coprocessors with little effort. These devices offer significant computing power, but their use can introduce two problems: an increase in the total cost of ownership and their underutilization because not all codes match their architecture. Remote accelerator virtualization frameworks address those problems. In particular, rCUDA provides transparent access to any graphic processor unit installed in a cluster, reducing the number of accelerators and increasing their utilization ratio. Joining these two technologies, directive-based programming models and rCUDA, is thus highly appealing. In this work, we study the integration of OmpSs and OpenACC with rCUDA, describing and analyzing several applications over three different hardware configurations that include two InfiniBand interconnections and three NVIDIA accelerators. Our evaluation reveals favorable performance results, showing low overhead and similar scaling factors when using remote accelerators instead of local devices.
Here, this paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an interesting alternative to state-of-the-art semidefinite programming relaxations. Finally, three case studies in optimal power flow, optimal transmission switching and capacitor placement demonstrate the benefits of the new relaxations.
Variations of physical and chemical characteristics of biomass reduce equipment utilization and increase operational costs of biomass processing. Biomass processing facilities use sensors to monitor the changes in biomass characteristics. Integrating sensory data into the operational decisions in biomass processing will increase its flexibility to the changing biomass conditions. In this paper, we propose a multi-stage stochastic programming model that minimizes the expected operational costs by identifying the initial inventory level and creating an operational decision policy for equipment speed settings. These policies take the sensory information data and the current biomass inventory level as inputs to dynamically adjust inventory levels and equipment settings according to the changes in the biomass' characteristics. We ensure that a prescribed target reactor utilization is consistently achieved by penalizing the violation of the target reactor feeding rate. A case study is developed using real-world data collected at Idaho National Laboratory's biomass processing facility. We show the value of multi-stage stochastic programming from an extensive computational experiment. Our sensitivity analysis indicates that updating the infeed rate of the system, the processing speed of equipment, and bale sequencing based on the moisture level of biomass improves the processing rate of the reactor and reduces operating costs.
In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.
Tackling climate change goals requires widespread deployment of process technology variants across many decentralized sites with different geographical, environmental, and operational requirements. Conventional engineering approaches focus on unique designs for each installation (process variant), while missing opportunities for manufacturing standardization. Here, instead we seek to optimize a process platform of common unit designs while simultaneously designing an entire family of process variants that make use of that platform. This reduces engineering effort, deployment timelines, and manufacturing costs. We propose a nonlinear generalized disjunctive programming formulation and convert this to an efficient mixed-integer linear programming (MILP) formulation through discretization of the design space. We formulate our optimization in Pyomo with costing from IDAES, and we demonstrate the computational performance and solution quality on a water treatment desalination system from the PARETO framework and a carbon capture system built in Aspen Plus as part of CCSI2.
This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.
Introduction: In 1999, the American Board of Radiology (ABR) implemented an innovative training program track in diagnostic radiology (DR) and radiation oncology (RO) designed to stimulate development of a cadre of future academic researchers and educators in the 2 disciplines. The program was designated the Holman Research Pathway (HRP). An in-depth retrospective review of initial certification examination performance, post-training career choices, and academic productivity has not been written. This report represents a 10-year retrospective review of post-training performance of a cohort of trainees who have had sufficient time to complete their training and initial certification process and to enter practice. Methods and Materials: All pertinent proceedings of the ABR and Accreditation Council for Graduate Medical Education (ACGME) Residency Review Committees for DR and RO between 1997 and May 2011 were reviewed. Thirty-four HRP candidates who fulfilled the established evaluation criteria were identified, and their ABR data files were analyzed regarding performance on the qualifying and certifying examinations. All candidates were contacted directly to obtain a current curriculum vitae. Results: Twenty candidates in RO and 14 candidates in DR were identifiable for review. All candidates attained initial certification. At the time of analysis, 23 of 33 (66.6%) candidates were employed in full-time academic practice (1 DR candidate remained in a fellowship and was not evaluated regarding employment status). Fifteen of 20 (75%) RO candidates were in faculty positions compared with 7 of 13 (53.8%) DR trainees. Additional academic productivity metrics are reported. Conclusions: A high percentage of HRP trainees remained in academic practice and demonstrated significant academic productivity as measured by manuscript authorship and research support. Additional time and observation will be needed to determine whether these findings will be sustained by past, current, and future HRP trainees.
Here, this study develops projections of future spending and savings from electricity efficiency programs funded by electric utility customers in the United States through 2030 based on three scenarios. Our analysis relies on detailed bottom-up modeling of current state energy efficiency policies, demand-side management and integrated resource plans, and regulatory decisions. The three scenarios represent a range of potential outcomes given the policy environment at the time of the study and uncertainties in the broader economic and state policy environment in each state. We project spending to increase to $8.6 billion in 2030 in the medium scenario, about a 45 percent increase relative to 2016 spending. In the high case, annual spending increases to $11.1 billion in 2030 and remains relatively flat in the low case ($6.8 billion in 2030). Our analysis suggests that electricity efficiency programs funded by utility customers will continue to impact load growth significantly at least through 2030, as savings as a percent of retail sales are forecast at 0.7 percent in the medium scenario and 0.98 percent in the high scenario.
Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.
The study of the transverse momentum dependent parton distributions (TMDs) of the nucleon in semi-inclusive deep-inelastic scattering (SIDIS) has emerged as one of the major physics motivations driving the experimental program using the upgraded 11 GeV electron beam at Jefferson Lab’s Continuous Electron Beam Accelerator Facility (CEBAF). The accelerator construction phase of the CEBAF upgrade is essentially complete and commissioning of the accelerator has begun as of April, 2014. As the new era of CEBAF operations begins, it is appropriate to review the body of published and forthcoming results on TMDs from the 6 GeV era of CEBAF operations, discuss what has been learned, and discuss the key challenges and opportunities for the 11 GeV SIDIS program of CEBAF.