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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

A Proposal for a Three Detector Short-Baseline Neutrino Oscillation Program in the Fermilab Booster Neutrino Beam

A Short-Baseline Neutrino (SBN) physics program of three LAr-TPC detectors located along the Booster Neutrino Beam (BNB) at Fermilab is presented. This new SBN Program will deliver a rich and compelling physics opportunity, including the ability to resolve a class of experimental anomalies in neutrino physics and to perform the most sensitive search to date for sterile neutrinos at the eV mass-scale through both appearance and disappearance oscillation channels. Using data sets of 6.6e20 protons on target (P.O.T.) in the LAr1-ND and ICARUS T600 detectors plus 13.2e20 P.O.T. in the MicroBooNE detector, we estimate that a search for muon neutrino to electron neutrino appearance can be performed with ~5 sigma sensitivity for the LSND allowed (99% C.L.) parameter region. In this proposal for the SBN Program, we describe the physics analysis, the conceptual design of the LAr1-ND detector, the design and refurbishment of the T600 detector, the necessary infrastructure required to execute the program, and a possible reconfiguration of the BNB target and horn system to improve its performance for oscillation searches.

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

Multi-Stage Stochastic Programming to Joint Economic Dispatch for Energy and Reserve With Uncertain Renewable Energy

To address the uncertain renewable energy in the day-ahead optimal dispatch of energy and reserve, a multi-stage stochastic programming model is established in this paper to minimize the expected total costs. The uncertainties over the multiple stages are characterized by a scenario tree and the optimal dispatch scheme is cast as a decision tree which guarantees the flexibility to decide the reasonable outputs of generation and the adequate reserves accounting for different realizations of renewable energy. Most importantly, to deal with the “Curse of Dimensionality” of stochastic programming, stochastic dual dynamic programming (SDDP) is employed, which decomposes the original problem into several sub-problems according to the stages. Specifically, the SDDP algorithm performs forward pass and backward pass repeatedly until the convergence criterion is satisfied. At each iteration, the original problem is approximated by creating a linear piecewise function. Besides, an improved convergence criterion is adopted to narrow the optimization gaps. The results on the IEEE 118-bus system and real-life provincial power grid show the effectiveness of the proposed model and method.

economic dispatch↗
DOE OSTI2014

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

High-Temperature Gas-Cooled Reactor Research Survey and Overview: Preliminary Data Platform Construction for the Nuclear Energy University Program

Since the U.S. Department of Energy Office of Nuclear Energy initiated the Nuclear Energy University Program (NEUP) in 2009, there are 29 NEUP projects focusing on high-temperature gas-cooled reactor (HTGR) research up to July 2022. The resultant research product, either experimental or computational, were published as final NEUP reports, journal articles and conference proceedings. However, these federally funded products have been scattered and sometimes cannot be easily accessed. To improve access to this valuable HTGR validation data and optimize the return on the significant investment made by the Department of Energy, the Advanced Reactor Technologies (ART) Gas-Cooled Reactor (GCR) program started a survey of completed and ongoing HTGR NEUP projects to develop a public-access database specific for HTGRs applications that can be used to retrieve computational fluid dynamics and system code validation data. This effort will help guide future NEUP-funded research, define new state of the ART Phenomena Identification and Ranking Table (PIRT), and promote the usage of this data in the codes validation matrices. This report provides an overview of the NEUP-funded HTGR-related research projects from Fiscal Year (FY) 2009–2021 and identifies validation knowledge gaps still existing in HTGR thermal-fluid research. A preliminary data platform has been developed for the 29 NEUP projects investigating HTGR thermal hydraulics, including their final reports as well as the available scientific publications. As an ultimate goal for this work, the ART-GCR program will create a central database at Idaho National Laboratory to identify, organize, and store these datasets generated by experimental investigations or computational models, experimental facility descriptions, and publicly-available academic products from the HTGR-related NEUP projects and provide future guidance for the storage and transmission of important project documentations for later NEUP projects as well.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Increasing the Number of Installed Residential Heat Pump Water Heaters in the USA Through Improved Technology and Utility Programs

Heat pump water heaters (HPWHs) offer an efficient alternative to electric resistance water heaters, but they suffer from limited market penetration. This paper reviews the current state of HPWHs in the USA, focusing on technology developments and programs to increase adoption. What technological improvements are needed to make HPWHs a good fit in more homes? Additionally, what are the best ways of promoting HPWHs to consumers? Improved communication and controls will allow HPWHs to provide demand response and follow dynamic utility rates. To enable fuel-switching, HPWHs are being developed that only need a standard 120V outlet. Split HPWHs can alleviate the cooling and noise that limit the use of HPWHs in small homes, multifamily buildings, and cold climates. Additionally, new utility programs aim to train installers and provide incentives to distributors to increase the number of HPWHs installed. Some utilities offer novel incentive programs that have led to increased customer uptake. Those advances, coupled with improved controls for load shifting and new products such as split HPWHs and HPWHs that can run on 120V power, may finally move the market forward.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2015

Low functional programming of renal AT{sub 2}R mediates the developmental origin of glomerulosclerosis in adult offspring induced by prenatal caffeine exposure

Our previous study has indicated that prenatal caffeine exposure (PCE) could induce intrauterine growth retardation (IUGR) of offspring. Recent research suggested that IUGR is a risk factor for glomerulosclerosis. However, whether PCE could induce glomerulosclerosis and its underlying mechanisms remain unknown. This study aimed to demonstrate the induction to glomerulosclerosis in adult offspring by PCE and its intrauterine programming mechanisms. A rat model of IUGR was established by PCE, male fetuses and adult offspring at the age of postnatal week 24 were euthanized. The results revealed that the adult offspring kidneys in the PCE group exhibited glomerulosclerosis as well as interstitial fibrosis, accompanied by elevated levels of serum creatinine and urine protein. Renal angiotensin II receptor type 2 (AT{sub 2}R) gene expression in adult offspring was reduced by PCE, whereas the renal angiotensin II receptor type 1a (AT{sub 1a}R)/AT{sub 2}R expression ratio was increased. The fetal kidneys in the PCE group displayed an enlarged Bowman's space and a shrunken glomerular tuft, accompanied by a reduced cortex width and an increase in the nephrogenic zone/cortical zone ratio. Observation by electronic microscope revealed structural damage of podocytes; the reduced expression level of podocyte marker genes, nephrin and podocin, was also detected by q-PCR. Moreover, AT{sub 2}R gene and protein expressions in fetal kidneys were inhibited by PCE, associated with the repression of the gene expression of glial-cell-line-derived neurotrophic factor (GDNF)/tyrosine kinase receptor (c-Ret) signaling pathway. These results demonstrated that PCE could induce dysplasia of fetal kidneys as well as glomerulosclerosis of adult offspring, and the low functional programming of renal AT{sub 2}R might mediate the developmental origin of adult glomerulosclerosis. - Highlights: • Prenatal caffeine exposure induces glomerulosclerosis in adult offspring. • Prenatal caffeine exposure inhibits fetal kidney development. • Prenatal caffeine exposure causes low functional programming of renal AT{sub 2}R.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

09 BIOMASS FUELS↗
DOE OSTI2014

Why scientists should learn to program in Python

Scientists have been central to the historical development of the computer industry, but the importance of software only continues to grow for all areas of scientific research and in particular for powder diffraction. Knowing how to program a computer is a basic and useful skill for scientists. The article introduces the three types of programming languages and why scripting languages are now preferred for scientists. Of them, the authors assert Python is the most useful and easiest to learn. Python is introduced. Also presented is an overview to a few of the many add-on packages available to extend the capabilities of Python, for example, for numerical computations, scientific graphics and graphical user interface programming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Performing fully parallel constraint logic programming on a quantum annealer

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Alignment among environmental programs in higher education: What Food-Energy-Water Nexus concepts are covered in introductory courses?

Interdisciplinary environmental and sustainability (IES) programs are different from other fields because they focus on a complex integration of humanities, social, and natural sciences concepts centered on the interactions of coupled human and natural systems. The interdisciplinary nature of IES programs does not lend itself to traditional discipline-specific concept inventory frameworks for critically evaluating preconceptions and learning. We discuss the results of the first phase of a research project to develop a next generation concept inventory for evaluating interdisciplinary concepts important for introductory IES courses. Using the Food-Energy-Water (FEW) Nexus (the intersections/interdependencies of food, energy, and water sectors) as our focus, we conducted a content analysis of eight representative college-level introductory environmental course syllabi and course materials (e.g., textbooks, journal articles, print media) to identify common interdisciplinary FEW Nexus concepts taught in introductory IES courses. Results demonstrate that all IES introductory course materials reference the FEW Nexus. Food, energy, and/or water resources as individual elements of the FEW Nexus are frequently described, but connections between these resource systems are included less often. Biology, energy systems, waste and pollution in the natural environment, agriculture, earth sciences and geology, climate change, behavioral social sciences, and economics concepts are most associated with FEW concepts, hinting at commonalities across IES topics that anchor systems thinking. Despite differences in IES programs, there appears to be some alignment between core concepts being taught at the FEW Nexus in introductory courses.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

The Heuristic Dynamic Programming Approach in Boost Converters

In this study, a heuristic dynamic programming controller is proposed to control a boost converter. Conventional controllers such as proportional-integral-derivative (PID) or proportional-integral (PI) are designed based on the linearized small-signal model near the operating point. Therefore, the performance of the controller during the start-up, the load change, or the input voltage variation is not optimal since the system model changes by varying the operating point. The heuristic dynamic programming controller optimally controls the boost converter by following the approximate dynamic programming. The advantage of the HDP is that the neural network-based characteristic of the proposed controller enables boost converters to easily cope with large disturbances. An HDP with a well-trained critic and action networks can perform as an optimal controller for the boost converter. To compare the effectiveness of the traditional PI-based and the HDP boost converter, the simulation results are provided.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Analytical Modeling of Cache Behavior for Affine Programs

Modern optimizing compiler design integrates program transformation strategies aimed at reducing data movement to/from main memory by exploiting the data cache hierarchy. But in reality, the effect of these transformations on the actual cache miss count is ignored in compilers due to the lack of precise compile-time models of misses for hierarchical caches. The current state of practice for cache miss analysis is based on accurate simulation. However, simulation requires time proportional to the dataset/problem size as well as the number of distinct cache configurations of interest to be evaluated. This paper takes a fundamentally different approach, made possible by focusing on polyhedral programs with static control flow: instead of relying on costly simulation, this paper develops the first closed-form solution for exact modeling of misses in a set-associative cache hierarchy. It enabling simulation-less selection of program transformations at compile-time to optimize cache misses. A push-button tool implementing the approach is developed and used for extensive validation of the complete framework.

affine programs, cache modeling, set associativity↗
DOE OSTI2019

Parsl: Pervasive Parallel Programming in Python

High-level programming languages such as Python are increasingly used to provide intuitive interfaces to libraries written in lower-level languages and for assembling applications from various components. This migration towards orchestration rather than implementation, coupled with the growing need for parallel computing (e.g., due to big data and the end of Moore's law), necessitates rethinking how parallelism is expressed in programs. Here, we present Parsl, a parallel scripting library that augments Python with simple, scalable, and flexible constructs for encoding parallelism. These constructs allow Parsl to construct a dynamic dependency graph of components that it can then execute efficiently on one or many processors. Parsl is designed for scalability, with an extensible set of executors tailored to different use cases, such as low-latency, high-throughput, or extreme-scale execution. We show, via experiments on the Blue Waters supercomputer, that Parsl executors can allow Python scripts to execute components with as little as 5 ms of overhead, scale to more than 250000 workers across more than 8000 nodes, and process upward of 1200 tasks per second. Other Parsl features simplify the construction and execution of composite programs by supporting elastic provisioning and scaling of infrastructure, fault-tolerant execution, and integrated wide-area data management. We show that these capabilities satisfy the needs of many-task, interactive, online, and machine learning applications in fields such as biology, cosmology, and materials science.

parallel programming↗
DOE OSTI2019

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data parallelism latent in recursive, task- parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.

Recursive Programs, task parallelism, vectorizatio↗
DOE OSTI2023

Gene Expression Programming for Quantum Computing

Here, we introduce QuantumGEP, a scientific computer program that uses gene expression programming (GEP) to find a quantum circuit that either (1) maps a given set of input states to a given set of output states or (2) transforms a fixed initial state to minimize a given physical quantity of the output state. QuantumGEP is a driver program that uses evendim, a generic computational engine for GEP, both of which are free and open source. We apply QuantumGEP as a powerful solver for MaxCut in graphs and for condensed matter quantum many-body Hamiltonians.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Orbital Conflict: Cutting Planes for Symmetric Integer Programs

Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. Furthermore, the inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Improving Mathematical Exposition of an Industrial-Scale Linear Program

Industrial-scale models require considerable setup time; hence, once built, they are used in myriad ways to consider closely related cases. In practice, the code for these models frequently evolves without appropriate notational choices, largely as a result of the lengthy development time of, and the number of individuals contributing to, their formulation. This leads to inefficiencies and obfuscates model structures that might be leveraged to expedite solutions. In this paper, we advocate for an emerging literature on model formulation “best practices” and present the reformulation of a widely used industrial-scale linear program. The efficient mathematical expression of this linear program, used to plan capacity expansion in the energy sector, allows for greater transparency of model structures and enhanced ability to identify computational performance improvements, as well as a lucid interpretation of its solutions. This type of formulation is employed in several mathematical programming courses at our university as an example of the advantages of best practices; the model more broadly is used widely to inform policy in the U.S. energy sector.

97 MATHEMATICS AND COMPUTING↗