Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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,063 records · Page 59

pLiner

Compiler optimizations can alter significantly the numerical results of scientific computing applications. When numerical results differ significantly between compilers, optimization levels, and floating-point hardware, these numerical inconsistencies can impact programming productivity. pLiner is a framework that helps programmers identify locations in the source code that are highly affected by compiler optimizations. pLiner uses a novel approach to identify such code locations by enhancing the floatingpoint precision of variables and expressions. Using a guided search to locate the most significant code regions, pLiner can report to users such locations at different granularities, file, function, and line of code.

Laguna Peralta, Ignacio↗

Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints

Abstract Background Genome-scale metabolic network models and constraint-based modeling techniques have become important tools for analyzing cellular metabolism. Thermodynamically infeasible cycles (TICs) causing unbounded metabolic flux ranges are often encountered. TICs satisfy the mass balance and directionality constraints but violate the second law of thermodynamics. Current practices involve implementing additional constraints to ensure not only optimal but also loopless flux distributions. However, the mixed integer linear programming problems required to solve become computationally intractable for genome-scale metabolic models. Results We aimed to identify the fewest needed constraints sufficient for optimality under the loopless requirement. We found that loopless constraints are required only for the reactions that share elementary flux modes representing TICs with reactions that are part of the objective function. We put forth the concept of localized loopless constraints (LLCs) to enforce this minimal required set of loopless constraints. By combining with a novel procedure for minimal null-space calculation, the computational time for loopless flux variability analysis (ll-FVA) is reduced by a factor of 10–150 compared to the original loopless constraints and by 4–20 times compared to the current fastest method Fast-SNP with the percent improvement increasing with model size. Importantly, LLCs offer a scalable strategy for loopless flux calculations for multi-compartment/multi-organism models of large sizes, for example, shortening the CPU time for ll-FVA from 35 h to less than 2 h for a model with more than104 reactions. Availability and implementation Matlab functions are available in the Supplementary Material or at https://github.com/maranasgroup/lll-FVA Supplementary information Supplementary data are available at Bioinformatics online.

Chan, Siu H. J. (ORCID:000000027707656X)↗

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With the goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant

This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developed will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve these two formulations were developed and validated. For a given OSP problem the computation efficiency largely depends on the “size” of the problem. Initially a simplified 1-D gasifier model assuming axial and azimuthal symmetry was used to test out various OSP algorithms. Finally these algorithms were used to design the optimal sensor network for condition monitoring of IGCC gasifier refractory wear and RSC fouling. The sensors type and locations obtained as solution to the OSP problem were validated using model based sensing approach. The OSP algorithm has been developed in a modular form and has been packaged as a software tool for OSP design where a designer can explore various OSP design algorithm is a user friendly way. The OSP software tool is implemented in Matlab/Simulink© in-house. The tool also uses few optimization routines that are freely available on World Wide Web. In addition a modular Extended Kalman Filter (EKF) block has also been developed in Matlab/Simulink© which can be utilized for model based sensing of important process variables that are not directly measured through combining the online sensors with model based estimation once the hardware sensor and their locations has been finalized. The OSP algorithm details and the results of applying these algorithms to obtain optimal sensor location for condition monitoring of gasifier refractory wear and RSC fouling profile are summarized in this final report.

20 FOSSIL-FUELED POWER PLANTS↗

Dynamic Investment and Counterparty Risk

We introduce a dynamic optimization framework in which collateral is used to mitigate losses arising at counterparty’s default. The investor faces two sources of risk: the default risk of the entity referencing the traded credit swap security, and counterparty risk generated from the default event of the trading counterparty. We show that the value function of the control problem coincides with the classical solution of a nonlinear dynamic programming equation. We provide an explicit characterization of the optimal investment strategy, and show that the investor does not trade if counterparty risk is sufficiently high. These findings suggest that moving credit swap trades into well-designed clearinghouses may stimulate economic activities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization problems in natural gas transportation systems. A state-of-the-art review

Our paper provides a review on the most relevant research works conducted to solve natural gas transportation problems via pipeline systems. The literature reveals three major groups of gas pipeline systems, namely gathering, transmission, and distribution systems. In this work, we aim at presenting a detailed discussion of the efforts made in optimizing natural gas transmission lines.There is certainly a vast amount of research done over the past few years on many decision-making problems in the natural gas industry and, specifically, in pipeline network optimization. In this work, we present a state-of-the-art survey focusing on specific categories that include short-term basis storage (line-packing problems), gas quality satisfaction (pooling problems), and compressor station modeling (fuel cost minimization problems). We also discuss both steady-state and transient optimization models highlighting the modeling aspects and the most relevant solution approaches known to date. Although the literature on natural gas transmission system problems is quite extensive, this is, to the best of our knowledge, the first comprehensive review or survey covering this specific research area on natural gas transmission from an operations research perspective. Furthermore, this paper includes a discussion of the most important and promising research areas in this field. Hence, our paper can serve as a useful tool to gain insight into the evolution of the many real-life applications and most recent advances in solution methodologies arising from this exciting and challenging research area of decision-making problems.

03 NATURAL GAS↗

Co-design optimization of combined heat and power-based microgrids

With the emergent need for clean and reliable energy resources, hybrid energy systems, such as the microgrid, are widely adopted in the United States. A microgrid can consist of various distributed energy resources, for instance, combined heat and power (CHP) systems. Here, the CHP module is a distributed cogeneration technology that produces electricity and recaptures heat generated as a by-product. It is an energy-efficient technology converting heat that would otherwise be wasted to valuable thermal energy. For an optimal system configuration, this study develops a novel co-design optimization framework for CHP-based cogeneration microgrids. The framework provides the stakeholder with a method to optimize investments and attain resilient operations. The proposed co-design framework has a mixed integer programming (MIP) model that outputs decisions for both plant designs and operating controls. The microgrid considered in this study contains six components: the CHP, boiler, heat recovery unit, thermal storage system, power storage system, and photovoltaic plant. After solving the MIP model, the optimal design parameters of each component can be found to minimize the total installation cost of all components in the microgrid. Furthermore, the online costs from energy production, operation, maintenance, machine startup, and disruption-induced unsatisfied loads are minimized by solving the optimal control decisions for operations. Case studies based on designing a CHP-based microgrid with empirical data are conducted. Moreover, we consider both nominal and disruptive operational scenarios to validate the performance of the proposed co-design framework in terms of a cost-effective, resilient system.

42 ENGINEERING↗

Supporting cost-effective watershed management strategies for Chesapeake Bay using a modeling and optimization framework

Extensive efforts to adaptively manage nutrient pollution rely on Chesapeake Bay Program’s (Phase 6) Watershed Model, called Chesapeake Assessment Scenario Tool (CAST), which helps decision-makers plan and track implementation of Best Management Practices (BMPs). We describe mathematical characteristics of CAST and develop a constrained nonlinear BMP-subset model, software, and visualization framework. This represents the first publicly available optimization framework for exploring least-cost strategies of pollutant load control for the United States’ largest estuary. The optimization identifies implementation options for a BMP subset modeled with load reduction effectiveness factors, and the web interface facilitates interactive exploration of >30,000 solutions organized by objective, nutrient control level, and for ~200 counties. We assess framework performance and demonstrate modeled cost improvements when comparing optimization-suggested proposals with proposals inspired by jurisdiction plans. Stakeholder feedback highlights the framework’s current utility for investigating cost-effective tradeoffs and its usefulness as a foundation for future analysis of restoration strategies.

54 ENVIRONMENTAL SCIENCES↗

Validation of reference genes for real-time PCR of cord blood mononuclear cells, differentiating endothelial progenitor cells, and mature endothelial cells

Highlights: • RT-qPCR was used to assess and follow the differentiation of EPCs. • A set of reliable and non-variable genes is key to obtain accurate RT-qPCR results. • The relative gene expression of CD34+ and differentiating endothelial progenitor cells was determined. • The optimal set of reference for the gene expression studies performed by RT-qPCR was determined. In the last ten years, endothelial progenitor cells (EPCs) have gained interest as an attractive cell population in regenerative medicine for vascular applications. This population is defined as the precursor of endothelial mature cells (ECs) through a process of differentiation. To our knowledge, no single marker can be used to discriminate them from mature ECs. To effectively study their differentiation kinetics, gene expression must be assessed. Quantitative real-time PCR (RT-qPCR) is widely used to analyze gene expression. To minimize the impact of variances from RT-qPCR, a rigorous selection of reference genes must be performed prior to any experiments due to variations in experimental conditions. In this study, CD34+ mononuclear cells were extracted from human cord blood and differentiated into EPCs after seeding for a maximum period of 21 days. To choose the best combinations of reference genes, we compared the results of EPCs, CD34+ mononuclear cells, and mature endothelial cells to ensure that the differentiation kinetics did not affect the expression of our selected reference genes. The expression levels of seven genes, namely, YWHAZ, GAPDH, HPRT1, RPLP0, UBC, B2M, and TBP were thus compared. The algorithms geNorm, NormFinder, BestKeeper, and the Comparative ΔCt method were employed to assess the expression of each candidate gene. Overall results reveal that the expression stability of reference genes may differ depending on the statistical program used. YWHAZ, GAPDH, and UBC composed the optimal set of reference genes for the gene expression studies performed by RT-qPCR in our experimental conditions. This work can thus serve as a starting point for the selection of candidate reference genes to normalize the levels of gene expression in endothelial progenitor cell populations.

60 APPLIED LIFE SCIENCES↗

Feasibility of High-Power Diode Laser Array Surrogate to Support Development of Predictive Laser Lethality Model

Predictive modeling and simulation of high power laser-target interactions is sufficiently undeveloped that full-scale, field testing is required to assess lethality of military directed-energy (DE) systems. The cost and complexity of such testing programs severely limit the ability to vary and optimize parameters of the interaction. Thus development of advanced simulation tools, validated by experiments under well-controlled and diagnosed laboratory conditions that are able to provide detailed physics insight into the laser-target interaction and reduce requirements for full-scale testing will accelerate development of DE weapon systems. The ultimate goal is a comprehensive end-to-end simulation capability, from targeting and firing the laser system through laser-target interaction and dispersal of target debris; a 'Stockpile Science' - like capability for DE weapon systems. To support development of advanced modeling and simulation tools requires laboratory experiments to generate laser-target interaction data. Until now, to make relevant measurements required construction and operation of very high power and complex lasers, which are themselves costly and often unique devices, operating in dedicated facilities that don't permit experiments on targets containing energetic materials. High power diode laser arrays, pioneered by LLNL, provide a way to circumvent this limitation, as such arrays capable of delivering irradiances characteristic of De weapon requires are self-contained, compact, light weight and thus easily transportable to facilities, such as the High Explosives Applications Facility (HEAF) at Lawrence Livermore National Laboratory (LLNL) where testing with energetic materials can be performed. The purpose of this study was to establish the feasibility of using such arrays to support future development of advanced laser lethality and vulnerability simulation codes through providing data for materials characterization and laser-material interaction models and to validate the accuracy of code predictions. This project was a Feasibility Study under the LLNL Laboratory Directed Research and Development (LDRD) Program.

42 ENGINEERING↗

Modern modulation schemes: a linear programming based tone injection algorithm for PAPR reduction of OFDM and linearly precoded systems

This work investigates the improvement of power amplifier efficiency through the reduction of peak-to-average power ratio (PAPR) of linearly precoded QAM data signals. In particular, we fo cus on the special cases of linear precoded modulation including the practical OFDM, OFDMA, and SC-FDMA signals that have been widely adopted in W-LAN and W-MAN. We apply the method of tone injection optimization for PAPR reduction. To reduce numerical complexity, we propose a linear programming algorithm which closely approximates the original tone injection optimization problem. Our comprehensive numerical results demonstrate substantial PAPR reduc tion and superior BER performance using several practical examples.

Jacklin, Neil↗

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗

A Stochastic Programming Formulation for Disinfectant Booster Station Placement to Protect Large-Scale Water Distribution Networks

We introduce a methodology for optimally locating fixed disinfectant booster stations for response to contamination incidents in water distribution networks. In this work a stochastic programming problem considering uncertainty in both the location and time of the contamination incident is formulated, resulting in a large Mixed Integer Linear Programming problem. While the original full-space problem is intractably large, we show a series of reductions that decrease the size of the problem by up to five orders of magnitude and allow solutions of the optimal placement problem for realistically-sized water network models.

42 ENGINEERING↗

Optimization Algorithm for Criticality Experiment Design Using Whisper

Many criticality experiments performed to aid in nuclear data evaluation are designed to maximize the sensitivity of the system’s effective neutron multiplication factor to a certain nuclide reaction pair over an energy region of interest. This is typically done by evaluating possible designs in a transport code such as MCNP and selecting the one with the highest desired sensitivity. A designer has many tools to try to maximize this sensitivity such as different moderators, reflectors, fuels, and geometries. This balancing act of identifying a critical and maximally sensitive system become very computationally expensive as more variables are added and higher precisions are desired. In order to identify these optimal configurations more efficiently a Particle Swarm Optimization (PSO) algorithm coupled with MCNP has been developed by Los Alamos National Laboratory (LANL). This algorithm has been used to design two upcoming criticality experiments that will be performed at the National Criticality Experiments Research Center (NCERC), located at the Nevada National Security Site, and operated by LANL, the only general-purpose critical experiments laboratory in the United States. PSO uses a population (swarm) of candidate solutions (particles) on a search space of dimensions such as moderator and reflector thicknesses or enrichments and concentrations. These particles move around the search space from generation to generation according to simple rules. Eventually, the swarm converges on the configuration that is both critical and maximally sensitive to a piece of nuclear data. PSO is well suited for criticality experiments as the algorithm is agnostic to the underlying physics, meaning it is effective on many different experimental setups. This algorithm has been modified to maximize the nuclear data similarity coefficient between an application case and an experiment aimed at replicating the application case using WHISPER, a nuclear criticality safety analysis tool. This allows for the efficient design of critical experiments informed by nuclear data sensitives.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

StreamJIT: a commensal compiler for high-performance stream programming

There are many domain libraries, but despite the performance benefits of compilation, domain-specific languages are comparatively rare due to the high cost of implementing an optimizing compiler. We propose commensal compilation, a new strategy for compiling embedded domain-specific languages by reusing the massive investment in modern language virtual machine platforms. Commensal compilers use the host language's front-end, use host platform APIs that enable back-end optimizations by the host platform JIT, and use an autotuner for optimization selection. The cost of implementing a commensal compiler is only the cost of implementing the domain-specific optimizations. We demonstrate the concept by implementing a commensal compiler for the stream programming language StreamJIT atop the Java platform. Our compiler achieves performance 2.8 times better than the StreamIt native code (via GCC) compiler with considerably less implementation effort.

97 MATHEMATICS AND COMPUTING↗

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗

Notes from the Unit Commitment Linear Programming Project

The Unit Commitment Problem (UCP) is a computational bottleneck in electrical grid optimization. The problem bears a close resemblance to a similar problem in High Performance Computing: the Dynamic Volt age/Frequency Scheduling (DVFS) problem. In my earlier work I successfully tranformed the DVFS into a closely related problem amenable to a linear programming solution and was thus able to schedule problem instances several orders of magnitude larger than any that had been at tempted before. This technical report details my unsuccessful efforts to derive a similar transformation for the UCP. The problem proved impossible not because generators were either on or off, but because the state of an earlier timeslice constrains the states of latter timeslices in ways that cannot be sufficiently well approximated for useful solutions.

97 MATHEMATICS AND COMPUTING↗