Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program Optimization”

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

The COSMOS2015 Catalog: Exploring the 1 < z < 6 universe with half a million galaxies

We present the COSMOS2015{sup 24} catalog, which contains precise photometric redshifts and stellar masses for more than half a million objects over the 2deg{sup 2} COSMOS field. Including new YJHK{sub s} images from the UltraVISTA-DR2 survey, Y-band images from Subaru/Hyper-Suprime-Cam, and infrared data from the Spitzer Large Area Survey with the Hyper-Suprime-Cam Spitzer legacy program, this near-infrared-selected catalog is highly optimized for the study of galaxy evolution and environments in the early universe. To maximize catalog completeness for bluer objects and at higher redshifts, objects have been detected on a χ {sup 2} sum of the YJHK{sub s} and z {sup ++} images. The catalog contains ∼6×10{sup 5} objects in the 1.5 deg{sup 2} UltraVISTA-DR2 region and ∼1.5×10{sup 5} objects are detected in the “ultra-deep stripes” (0.62 deg{sup 2}) at K{sub s}⩽24.7 (3σ, 3″, AB magnitude). Through a comparison with the zCOSMOS-bright spectroscopic redshifts, we measure a photometric redshift precision of σ{sub Δz/(1+z{sub s)}} = 0.007 and a catastrophic failure fraction of η = 0.5%. At 3<z<6, using the unique database of spectroscopic redshifts in COSMOS, we find σ{sub Δz/(1+z{sub s)}} = 0.021 and η = 13.2%. The deepest regions reach a 90% completeness limit of 10{sup 10}M{sub ⊙} to z = 4. Detailed comparisons of the color distributions, number counts, and clustering show excellent agreement with the literature in the same mass ranges. COSMOS2015 represents a unique, publicly available, valuable resource with which to investigate the evolution of galaxies within their environment back to the earliest stages of the history of the universe. The COSMOS2015 catalog is distributed via anonymous ftp and through the usual astronomical archive systems (CDS, ESO Phase 3, IRSA).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2013

Evaluation of the flow-based programming (FBP) paradigm as an alternative to standard programming practices in physics data processing applications

The majority of developed physics data processing applications (PDP) are single, sequential processes that start at a point in time, and advance one step at a time until they are finished. In the current era of cloud computing and multi-core hardware architectures this approach has noticeable limitations. In this paper we present a detailed evaluation of the FBP-based Clas12 event reconstruction program that was deployed and operated both in cloud and in batch processing environments. We demonstrate the programming methodology and discuss some of the issues and optimizations affecting performance. We will also discuss our choice of using the Petri-Net process modeling formalism for the representation of the Clas12 PDP application building blocks which exhibit concurrency, parallelism, and synchronization.

Abbott, David↗
DOE OSTI2016

CASL COBRA-TF improvements for PWR DNB analysis

COBRA-TF (CTF) is a thermal hydraulic (T/H) subchannel code using either three-dimensional (3D) Cartesian or subchannel coordinate formulations for two-phase fluid flow and heat transfer solutions. CTF has been improved under the Consortium for Advanced Simulation of Light Water Reactors (CASL) program for Pressurized Water Reactor (PWR) applications, including software optimization, new closure models, pre- and post-processing and parallelization for modeling full reactor core T/H responses under normal operating and accident conditions. As a result of collaboration among CASL partners including the Westinghouse Electric Company, the Oak Ridge National Laboratory (ORNL), and the Sandia National Laboratories, additional modeling improvements were made to CTF specifically for PWR Departure from Nucleate Boiling (DNB) analysis, including a code option to evaluate fuel thermal margin in terms of DNB Ratio (DNBR) and an axial shape factor to account for effect of non-uniform axial power distribution on DNB. Multiple DNB correlations are now linked with CTF for different applications, including the Westinghouse proprietary WRB-1 correlation for fuel designs containing mixing vane grid spacers. The improved CTF code with the WRB-1 correlation (CTF/WRB-1) was validated using the DNB data from the PWR Subchannel Bundle Tests (PSBT). In addition to the comparison with the test data, the CTF/WRB-1 DNBR results and the associated local fluid conditions were compared to the results of the Westinghouse T/H design code, VIPRE-W, which is an enhanced version of the VIPRE-01 code originally developed by the Electric Power Research Institute (EPRI). The comparisons showed that CTF/WRB-1 DNBR predictions are in good agreement with the VIPRE-W results within the applicable range of the DNB correlation. A model sensitivity study was performed to confirm that the CTF void drift model had an insignificant effect on DNBR under the steam line break (SLB) low pressure condition. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

ASMS 2024 Investigation of Uranyl Perchlorate Anion Complexes in the Gas Phase via Infrared Multiphoton Dissociation and Collision Induced Dissociation

Investigation of Uranyl Perchlorate Anion Complexes in the Gas Phase via Infrared Multiphoton Dissociation and Collision Induced Dissociation Brittany D. M. Hodges, Christopher A. Zarzana, JungSoo Kim, Jonathan Martens, and W. C. M. Berden Introduction (120 words max) Effects of electronic structure on chemical bonding and reactivity play critical roles shaping the chemical bonding and reactivity behaviors of heavy elements. Understanding the role of f electrons in bond formation between the actinide-series elements like uranium with other ligands is critical for solving technical challenges associated with these heavy elements, important to nuclear fuel cycles, efficient separations of rare earth metals, and understanding the chemistry of stored nuclear fuels and related environmental management sites. In this study, we further examine the interactions between uranyl and the perchlorate ion in order to understand the structures of these ions through the use of IRMPD. Here we report the IRMPD spectra of [UO2(ClO4)3]-, [UO3(ClO4)2]-, and a proposed transition state. Methods (120 word max) IRMPD spectra and CID spectra were acquired using a Bruker amaZon QIT/MS instrument at the Free-Electron Lasers for Infrared eXperiments (FELIX) laboratory at Radboud University. The FELIX QIT/MS is modified to allow for the high-intensity tunable IR beam from FELIX to be directed into the ion packet, resulting in multiphoton dissociation that is measured only when the IR frequency is in resonance with an adequately high absorption vibrational mode of the mass-selected complex. DFT geometry optimizations and frequency calculations using the Gaussian suite of programs were performed using B3LYP, TPSSh, and PBE0 level of theory with 6-31+G(d) basis for the O, C, H, and N atoms and the SDD basis set for U. The SDD basis set employs the Stuttgart/Dresden effective core potential. Preliminary Data or Plenary Speakers Abstract (300 words max) Metal ion clusters of uranyl perchlorate were formed via direct electrospray ionization. For each metal ligand complex of interest, the parent ion was isolated and collision induced dissociation fragmentation and Infrared Multiphoton Dissociation (IRMPD) fragmentation spectra were acquired. Results presented here are the first look at the IRMPD spectra of [UO3(ClO4)2]-, [UO2(ClO4)3]-. Structures were examined using Gaussian at different levels of theory B3LYP level of theory, TPPSh and PBE0 levels, to reflect the behaviors of uranium metal ligand complexes most accurately. In these structures, we identified an overlap between each of these uranyl stretches resulting in their largely being obscured by a perchlorate mode. The CID product spectra agree with similar structures reported by Groenewold for uranyl nitrate in 2006 (10.1021/ja058106n).

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

Robust Reconfiguration of A Distribution System

In this paper, a robust reconfiguration approach based on Mixed Integer Programming (MIP) is proposed to minimize loss in distribution systems. A Depth-First Search (DFS) algorithm to enumerate possible loops provides radiality constraint. This provides a general solution to the radiality constraint for distribution system reconfiguration/expansion problems. Still, imprecision and ambiguity in net loads, i.e. load minus renewable generation, due to lack of sufficient measurements and high utilization of demand response programs and renewable resources, creates challenges for effective reconfiguration. Deterministic optimization of reconfiguration may no lead to optimal/feasible results. Two methods to address these uncertainties are introduced in this paper: one, based on a stochastic MIP (SMIP) formulation and two, based on a fuzzy MIP (FMIP) formulation. Case studies demonstrate the robustness and efficiency of the proposed reconfiguration methods.

Depth-First Search (DFS)↗
DOE OSTI2017

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

ArQTiC: A Full-stack Software Package for Simulating Materials on Quantum Computers

ArQTiC is an open-source, full-stack software package built for the simulations of materials on quantum computers. It currently can simulate materials that can be modeled by any Hamiltonian derived from a generic, one-dimensional, time-dependent Heisenberg Hamiltonian. ArQTiC includes modules for generating quantum programs for real- and imaginary-time evolution, quantum circuit optimization, connection to various quantum backends via the cloud, and post-processing of quantum results. By enabling users to seamlessly design, execute, and analyze materials simulations on quantum computers, ArQTiC opens this field to a broader community of scientists from a wider range of scientific domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Systematic Assessment of US Food and Drug Administration Dosing Recommendations For Drug Development Programs Amenable to Response‐Guided Titration

A key goal in drug development is optimized dosing for patients. Interactions between drug developers and regulatory scientists throughout development are important for the optimization of dosing and serve as a forum to discuss approaches for optimal dosing, such as precision or individualized dosing. To date, there has not been a systematic assessment of the advice provided by the US Food and Drug Administration (FDA) to drug developers from an individualized dosing perspective. Here, we reviewed FDA recommendations on dose selection for efficacy trials at end‐of‐phase meetings between the FDA and drug developers for 76 new molecular entities approved between 2013 and 2017 that are considered amenable for an individualized dosing method, response‐guided titration. Forty FDA dosing recommendations were identified as specific to dose selection and design of the respective efficacy trials and subsequently: (i) characterized based on if they were supportive of individualized dosing and (ii) compared with dosing regimens used in efficacy trials and labeling at approval to evaluate if FDA recommendations were implemented. Of these 40 recommendations for efficacy trials, 35 (88%) were considered supportive of individualized dosing. Eighteen of these 40 recommendations (45%) were incorporated into efficacy trials and 11 (28%) were incorporated into labeling. This research suggests that early FDA‐sponsor interactions can support the study of doses in efficacy trials that may lead to individualized dosing strategies in labeling.

Wang, Lingshan↗
DOE OSTI2022

Optimizing design and dispatch of a renewable energy system with combined heat and power

We embellish a mixed-integer program that prescribes a set of renewable energy, conventional generation, and storage technologies to procure, along with a corresponding dispatch strategy. Specifically, we add combined heat and power to this set. The model minimizes fixed and operational costs less incentives for the use of various technologies, subject to a series of component interoperability and system-wide constraints. The resulting mixed-integer linear program contains hundreds of thousands of variables and constraints. We demonstrate how to efficiently formulate and solve the corresponding instances such that we produce near-optimal solutions in minutes. A previous rendition of the model required hours of solution time for the same instances.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Profiling and Optimization [Slides]

Intended for Simulating Physics using Efficient and Effective code Development (SPEED) program. This is a LANL internal lecture series for computational science application developers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automation of Vulnerability and Patch Management: Information Extraction, Association, and Optimization

Vulnerability and patch management is an integral part of a robust cybersecurity program, yet it grows increasingly complex due to the sheer amount of data that must be analyzed. Particularly in Operational Technology (OT) environments, analysis must be done manually because of the lack of automated solutions. Additionally, there are many steps in this process, from the initial discovery of the vulnerability to the implementation of its remediation, and each step in the process requires different data in order to be performed effectively. In this work, we provide approaches and strategies to assist operators in industrial or OT environments throughout the vulnerability management cycle. Security advisories provide key information about mitigation strategies, or actions that can be taken when a patch is unavailable or cannot be installed. Details of these strategies are not shared in public vulnerability databases and must be found manually. We approach this problem by designing a solution to automatically identify that information within vendor security advisories and retrieve it for operator use. We start with an approach that requires domain-specific knowledge of certain frequently-seen reference websites. Next, an approach that can work on an arbitrary website but relies on certain keywords. Finally, an approach that uses Natural Language Processing (NLP) methods and does not require specific knowledge or keywords. Each of these approaches is more general than its predecessor; we demonstrate high accuracy for all approaches Advisories also often contain details of affected products in non-standard or natural language formats. While this information can be easily understood when read by an operator, the non-standard format acts as a barrier to effective automation. We provide an approach for the first step in this process: identifying vendors in security advisories and mapping them to a standard framework for representing digital assets and software products. We evaluate five established string similarity algorithms, plus one of our own design that combines string similarity and information theory, on the task of mapping vendors to their corresponding entries in the Common Platform Enumeration (CPE) repository. Our results show that our proposed metric outperforms all others. Due to the constraints on time, finances, and personnel for organizations, Large Language Models (LLMs) may seem like attractive opportunities for security operators to speed up information gathering; however, it is still not clear whether LLMs can handle vulnerability management tasks well. To answer this question, we perform an empirical study of LLMs’ ability to provide consistent, accurate information about vulnerabilities in order to guide organizations in their adoption of LLMs. We observe poor performance for all models tested, suggesting that these models are not well-suited to the consistent retrieval of accurate vulnerability information. Finally, once vulnerabilities have been identified and any additional information has been obtained, operators must decide which remediation actions to implement based on their available resources. This already-complex problem becomes even more so when we consider that a vulnerability may have multiple avenues for remediation. We formulate this scenario as two knapsack problems and provide solutions, which we then compare against several existing strategies for vulnerability prioritization seen in real operational environments.

McClanahan, Kylie↗
DOE OSTI2018

Optimization methodology for the global 10 Hz orbit feedback in RHIC

To combat beam oscillations induced by triplet vibrations at the Relativistic Heavy Ion Collider (RHIC), a global orbit feedback system was developed and applied at injection and top energy in 2011, and during beam acceleration in 2012. Singular Value Decomposition (SVD) was employed to determine the strengths and currents of the applied corrections. The feedback algorithm was optimized for different magnetic configurations (lattices) at fixed beam energies and during beam acceleration. While the orbit feedback performed well since its inception, corrector current transients and feedback-induced beam oscillations were observed during the polarized proton program in 2015. In this paper, we present the feedback algorithm, the optimization of the algorithm for various lattices and the solution adopted to mitigate the observed current transients during beam acceleration.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Material and Design Optimization of Printed Melt Wire Arrays

Recent work conducted by the Advanced Sensors and Instrumentation (ASI) program at Idaho National Laboratory resulted in the establishment of in-house capabilities for fabricating and testing new advanced manufactured sensors for measuring irradiation temperatures inside a nuclear test reactor. Though current methods of real-time temperature monitoring (e.g., thermocouples) can still be used, the complexity of the feedthroughs and attachments needed for collecting real time measurements greatly increases the experiment-related costs. On the other hand, passive monitoring techniques can be used for collecting post irradiation temperature measurements by inferring reactor temperatures, based on the melting points of well-characterized materials (i.e., standard melt wires). However, challenges have arisen due to the limited space available for including instrumentation in experiments. To resolve this issue, the ASI program expanded its temperature detection capabilities to include advance manufactured melt wires for post-irradiation temperature measurements. These melt wires can determine reactor temperatures while also accommodating space limitations in irradiation experiments. To improve performance reliability and enhance melt wire readability following irradiation, FY-22 efforts have focused on optimizing the materials used in the encapsulation and printed melt wire array. This report details the design and fabrication tasks, along with the subsequent x ray computed tomography (XCT) evaluation process. The melt wire array consisted of indium with a melting point of 157°C, indium/silver (96/4 at%) with a melting point of 219°C, and tin with a melting point of 230°C. The encapsulation disc was made of vanadium due to its low activation properties and radiation resistance when deployed in nuclear reactors. Additionally, the melt wire design consisted of a ceramic sublayer (alumina disc) to further enhance the XCT post melting images of the printed melt wires. However, when sealing the vanadium container, all three melt wires melted, reflecting the temperature limitations that must be considered when employing metal containers in the sealing process.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

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 OSTI2025

OptiBench: An Optimization Benchmark Tool for Renewable Energy Problems

We propose a benchmark framework and visualization tool, OptiBench, for analyzing the performance of state-of-the-art optimization solvers across a variety of optimization problems in renewable energy research. Our framework is designed from the ground up in the Julia programming language and enables analysis at scale on high performance computing (HPC) systems. Our visualization tool allows effortless evaluation of optimization solver performance, robustness, and accuracy through intuitive plots, e.g., performance profiles, heat maps, and distribution plots. We have tested three benchmark suites relevant to the modeling of renewable energy systems, viz., CUTEst, PGLib-OPF, and WaterTAP water treatment optimization problems. We illustrate benchmarking of CUTEst using OptiBench on the National Renewable Energy Laboratory's (NREL) HPC Kestrel. Our findings indicate that MA57 HSL linear solver demonstrated the best overall performance for an experimental IPOPT implementation. Our work is ongoing and we intend to add support for more optimization solvers and benchmark test suites in the future.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

OptiBench: An Optimization Benchmark Tool for Renewable Energy Problems

We propose a benchmark framework and visualization tool, OptiBench, for analyzing the performance of state-of-the-art optimization solvers across a variety of optimization problems in renewable energy research. Our framework is designed from the ground up in the Julia programming language and enables analysis at scale on high performance computing (HPC) systems. Our visualization tool allows effortless evaluation of optimization solver performance, robustness, and accuracy through intuitive plots, e.g., performance profiles, heat maps, and distribution plots. We have tested three benchmark suites relevant to the modeling of renewable energy systems, viz., CUTEst, PGLib-OPF, and WaterTAP water treatment optimization problems. We illustrate benchmarking of CUTEst using OptiBench on the National Laboratory of the Rockies's (NLR) HPC Kestrel. Our findings indicate that MA57 HSL linear solver demonstrated the best overall performance for an experimental IPOPT implementation. Our work is ongoing and we intend to add support for more optimization solvers and benchmark test suites in the future.

97 MATHEMATICS AND COMPUTING↗