Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PROGRAMMING”

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,225 records · Page 68
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

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.

42 ENGINEERING↗
DOE OSTI2022

A multi-stage stochastic programming model for adaptive biomass processing operation under uncertainty

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.

09 BIOMASS FUELS↗
DOE OSTI2018

A modified homotopy method for solving the principal-agent bilevel programming problem

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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A mixed integer linear programming approach for the design of chemical process families

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.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

The American Board of Radiology Holman Research Pathway: 10-Year Retrospective Review of the Program and Participant Performance

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.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

What does the future hold for utility electricity efficiency programs?

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.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition

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.

42 ENGINEERING↗
DOE OSTI2015

The 6 GeV TMD Program at Jefferson Lab

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.

43 PARTICLE ACCELERATORS↗
DOE OSTI2015

The JLAB 3D program at 12 GeV (TMDs + GPDs)

The Jefferson Lab CEBAF accelerator is undergoing an upgrade that will increase the beam energy up to 12 GeV. The three experimental Halls operating in the 6-GeV era are upgrading their detectors to adapt their performances to the new available kinematics, and a new Hall (D) is being built. The investigation of the three-dimensional nucleon structure both in the coordinate and in the momentum space represents an essential part of the 12-GeV physics program, and several proposals aiming at the extraction of related observables have been already approved in Hall A, B and C. In this proceedings, the focus of the JLab 3D program will be described, and a selection of proposals will be discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Encouraging voluntary government action via a solar-friendly designation program to promote solar energy in the United States

Sustainable development requires an accelerated transition toward renewable energy. In particular, substantially scaling up solar photovoltaics (PV) adoption is a crucial component of reducing the impacts of climate change and promoting sustainable development. However, it is challenging to convince local governments to take action. This study uses a combination of propensity score matching (PSM) and difference-in-differences (DID) models to assess the effectiveness of a voluntary environmental program (VEP) called SolSmart that targets local governments to engage in solar-friendly practices to promote the local solar PV market in the United States. Via specific designation requirements and technical assistance, SolSmart simplifies the process of acting on interest in being solar friendly, has a wide coverage of basic solar-friendly actions with flexible implementation, and motivates completion with multiple levels of designation. We find that a local government’s participation in SolSmart is associated with an increased installed capacity of 18 to 19%/mo or with less statistical significance, an increased number of installations of 17%/mo in its jurisdiction. However, SolSmart has not shown a statistically significant impact on soft cost reductions to date. In evaluating the impact of the SolSmart program, this study improves our understanding of the causation between a VEP that encourages solar-friendly local government practices and multiple solar market outcomes. VEPs may be able to promote shifts toward sustainable development at the local level. Our findings have several implications for the design of VEPs that promote local sustainability.

14 SOLAR ENERGY↗
DOE OSTI2023

Segmenting the target audience for transportation demand management programs: An investigation between mode shift and individual characteristics

Understanding the characteristics of travelers and situations that are more likely to switch from single occupancy vehicles (SOV) to more sustainable mobility options can help transportation agencies develop better behavior change strategies. Existing mode shift programs, however, rarely identify their target audience, which could make the programs less effective. Here, to investigate the demographics and trip characteristics of those who are more likely to shift from SOV to carpooling, public transit, and micromobility (e.g. walking, biking), a matrix decomposition audience segmentation method is proposed and applied on travel survey data. The results of this research show that for short-distance leisure or social trips, young and middle-income people are more likely to shift to these mobility options from SOV. This study provides a comprehensive and profound understanding of the characteristics of the target audience that can inform policies to create more targeted behavior change strategies to reach their sustainability goals.

42 ENGINEERING↗
DOE OSTI2025

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction↗
DOE OSTI2021

Differentiable programming for online training of a neural artificial viscosity function within a staggered grid Lagrangian hydrodynamics scheme

Lagrangian methods to solve the inviscid Euler equations produce numerical oscillations near shock waves. A common approach to reducing these oscillations is to add artificial viscosity (AV) to the discrete equations. The AV term acts as a dissipative mechanism that attenuates oscillations by smearing the shock across a finite number of computational cells. However, AV introduces several control parameters that are not determined by the underlying physical model, and hence, in practice are tuned to the characteristics of a given problem. We seek to improve the standard quadratic-linear AV form by replacing it with a learned neural function that reduces oscillations relative to exact solutions of the Euler equations, resulting in a hybrid numerical-neural hydrodynamic solver. Because AV is an artificial construct that exists solely to improve the numerical properties of a hydrodynamic code, there is no offline ‘viscosity data’ against which a neural network can be trained before inserting into a numerical simulation, thus requiring online training. We achieve this via differentiable programming, i.e. end-to-end backpropagation or adjoint solution through both the neural and differential equation code, using automatic differentiation of the hybrid code in the Julia programming language to calculate the necessary loss function gradients. A novel offline pre-training step accelerates training by initializing the neural network to the default numerical AV scheme, which can be learned rapidly by space-filling sampling over the AV input space. We find that online training over early time steps of simulation is sufficient to learn a neural AV function that reduces numerical oscillations in long-term hydrodynamic shock simulations. These results offer an early proof-of-principle that online differentiable training of hybrid numerical schemes with novel neural network components can improve certain performance aspects existing in purely numerical schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

BioXTAS RAW 2 : new developments for a free open-source program for small-angle scattering data reduction and analysis

BioXTAS RAW is a free open-source program for reduction, analysis and modelling of biological small-angle scattering data. Here, the new developments in RAW version 2 are described. These include improved data reduction using pyFAI ; updated automated Guinier fitting and D max finding algorithms; automated series ( e.g. size-exclusion chromatography coupled small-angle X-ray scattering or SEC-SAXS) buffer- and sample-region finding algorithms; linear and integral baseline correction for series; deconvolution of series data using regularized alternating least squares ( REGALS ); creation of electron-density reconstructions using electron density via solution scattering ( DENSS ); a comparison window showing residuals, ratios and statistical comparisons between profiles; and generation of PDF reports with summary plots and tables for all analysis. Furthermore, there is now a RAW API, which can be used without the graphical user interface (GUI), providing full access to all of the functionality found in the GUI. In addition to these new capabilities, RAW has undergone significant technical updates, such as adding Python 3 compatibility, and has entirely new documentation available both online and in the program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

ASTRID sodium cooled fast reactor: Program for improving in service inspection and repair

In the frame of the CEA, EDF, AREVA coordinated research program for the development of Generation IV sodium-cooled fast reactors (SFR), the ASTRID project was launched in 2010. For the future prototype, the improvement of in-service inspection and repair (ISI and R) capabilities was identified as a major issue. Following the pluri-annual SFR research program, the ISI and R main R and D axes remain: i) improvement of the primary system conceptual design, ii) development of measurement and inspection techniques (continuous monitoring instrumentation and periodic inspection tools), iii) accessibility and associated robotics, and iv) development and validation of repair processes. Associated ISI and R needs are being defined through an iterative method between designers and instrumentation specialists: adaptation of the Design to ISI and R requirements, fission chamber development, validation of the ultrasonic and chemical transducers, of ultrasonic non destructive simulation, of acoustic surveillance, of laser repair intervention processes, of connected robotic equipment. Moreover, CEA, as leader of the ASTRID Project, is willing to find new contributors, partners or suppliers, in order to get innovative, diversified, exhaustive and efficient solutions. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems

Simulating the time evolution of a physical system at quantum mechanical levels of detail - known as Hamiltonian Simulation (HS) - is an important and interesting problem across physics and chemistry. For this task, algorithms that run on quantum computers are known to be exponentially faster than classical algorithms; in fact, this application motivated Feynman to propose the construction of quantum computers. Nonetheless, there are challenges in reaching this performance potential. Prior work has focused on compiling circuits (quantum programs) for HS with the goal of maximizing either accuracy or gate cancellation. Our work proposes a compilation strategy that simultaneously advances both goals. At a high level, we use classical optimizations such as graph coloring and travelling salesperson to order the execution of quantum programs. Specifically, we group together mutually commuting terms in the Hamiltonian (a matrix characterizing the quantum mechanical system) to improve the accuracy of the simulation. We then rearrange the terms within each group to maximize gate cancellation in the final quantum circuit. Furthermore, these optimizations work together to improve HS performance and result in an average 40% reduction in circuit depth. This work advances the frontier of HS which in turn can advance physical and chemical modeling in both basic and applied sciences.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve further as more functionality is added in the future.

97 MATHEMATICS AND COMPUTING↗