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,801 records · Page 100
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Enhanced Explicit Congestion Notification (EECN) in TCP with P4 Programming

In current TCP/IP networks, TCP mainly relies on packet drops as an indication of congestion. With the emergence of Explicit Congestion Notification (ECN), TCP can detect the congestion through packets with marked bits instead of dropped packets. ECN thus reduces the unnecessary delay due to packet drops, especially for bandwidth-delay sensitive connections. However, ECN still relies on the receiver for congestion indication, which incurs a round trip time (RTT) before the sender can react to the congestion. In network environments with a high bandwidth-delay product (BDP), this could be problematic. In this paper, we present an enhanced ECN mechanism for the early detection of congestion using P4 programming. In our proposed scheme, the sender does not have to wait for the receiver to indicate congestion because switches in the network can indicate congestion. We evaluate our scheme comparing our proposed solution with standard TCP and TCP with the conventional ECN. Experimental results show that our scheme outperforms ECN as the RTT grows.

ECN↗
DOE OSTI2019

Dual heuristic dynamic programing control of grid-connected synchronverters

A new approach to control a grid-connected synchronverter by using a dual heuristic dynamic programing (DHP) design is presented. The disadvantages of conventional synchronverter controller such as the challenges to cope with nonlinearity, uncertainties, and non-inductive grids are discussed. To deal with the aforementioned challenges a neural network–based adaptive critic design is introduced to optimize the associated cost function. The characteristic of the neural networks facilitates the performance under uncertainties and unknown parameters (e.g. different power angles). The proposed DHP design includes three neural networks: system NN, action NN, and critic NN. The simulation results compare the performance of the proposed DHP with a traditional PI-based design and with a neural network predictive controller. It is shown a well-trained DHP design performs in a trajectory, which is more optimal compared to the other two controllers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Multilane Automated Driving With Optimal Control and Mixed-Integer Programming

Road vehicle lane changes often initiate traffic disturbances and can therefore impact road networks’ energy and time efficiency. Furthermore, unexpected changes in traffic conditions may also render lane changes counterproductive for the lane-changing vehicle. Vehicle-to-vehicle connectivity combined with anticipative control could address these challenges via improved lane change decisions by automated vehicles. In a move toward this objective, receding horizon control cast as a mixed-integer quadratic program is used to plan lane changing and acceleration in a coupled optimization. A long-term pacing module, based on Pontryagin’s minimum principle from optimal control theory, sets terminal and input references for receding horizon control to target a user’s expected travel time. To remove nonlinear vehicle dynamics from the receding horizon controller, lane change commands are passed to a pure pursuit steering module whose response is approximated by a second-order linear model. Here, comparison against a rule-based reactive algorithm in arterial and highway scenarios shows an 8.9%–13.7% reduction in energy consumption and a 5.2%–10.3% reduction in the travel time, along with navigational improvements.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2017

Optimal Allocation of Dynamic Var Sources Using the Voronoi Diagram Method Integrating Linear Programing

Dynamic reactive power (var) sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues. This paper optimizes the sizes of dynamic var sources at given locations against FIDVR issues under severe contingencies. First, the geometric characteristics about the non-convex solution space of this problem are studied. Accordingly, a Voronoi diagram approach integrating linear programming (LP) is proposed, which disperses a number of sample points of potential solutions in the searching space to construct a Voronoi diagram blending the local cost functions over the entire space by Barycentric interpolation in Voronoi regions. New sample points are then recursively added, including the tentative optimal point using LP, the most depopulated area point ensuring global fidelity, and the connecting point, until the stopping criterion is met. The new approach is demonstrated in detail on the WSCC 9-bus system. A case study on the NPCC 140-bus system also validates that the proposed approach can effectively estimate the boundary and the geometry of the feasible solution region in the searching space and find the optimal solution.

barycentric interpolation↗
DOE OSTI2018

Nonparametric Prediction Intervals of Wind Power via Linear Programming

This letter proposes a machine learning-based linear programming model that quickly establishes the nonparametric prediction intervals of wind power by integrating extreme learning machine and quantile regression. The proportions of quantiles can be adaptively determined via sensitivity analysis. The proposed method has been proven to be significantly efficient and reliable, with a high application potential in power systems.

extreme learning machine↗
DOE OSTI2021

Multi-Period Active Distribution Network Planning Using Multi-Stage Stochastic Programming and Nested Decomposition by SDDIP

This paper presents a multi-period active distribution network planning (ADNP) with distributed generation (DG). The objective of the proposed ADNP is to minimize the total planning cost, subject to both investment and operation constraints. The paper proposes a multi-stage stochastic optimization model to address DG uncertainties over several periods, in which the decisions are made sequentially by only using the present-stage information. A nested decomposition method is proposed which applies the stochastic dual dynamic integer programming (SDDIP) method to address computational intractabilities of the proposed ADNP approach. The presented numerical results and discussions on a 33-bus distribution system and a large-scale 906-bus system verify the effectiveness of the proposed ADNP method and its solution method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Quantum Electromagnetic Transients Program

This work devises a quantum electromagnetic transients program (QEMTP) which is the first attempt to tackle the computational challenges in solving EMTP through quantum computing. The main contributions lie in: (1) A quantum-enabled EMTP formulation with Dommel's model encoded in quantum states; 2) An Harrow-Hassidim-Lloyd (HHL)-based QEMTP to solve the discrete-time nodal equations; 3) An iteration-based HHL revision for mitigating temporal errors to achieve high accuracy of QEMTP with limited quantum resources. Case studies verify the correctness and efficacy of QEMTP in simulating both fast and slow dynamics.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Noisy-Intermediate-Scale Quantum Electromagnetic Transients Program

Quantum-empowered electromagnetic transients program (QEMTP) is a promising paradigm for tackling EMTP's computational burdens. Nevertheless, no existing studies truly achieve a practical and scalable QEMTP operable on today's noisy-intermediate-scale quantum (NISQ) computers. The strong reliance on noise-free and fault-tolerant quantum devices--which appears to be decades away--hinder practical applications of current QEMTP methods. Here, we devise a NISQ-QEMTP methodology which for the first time transitions the QEMTP operations from ideal, noise-free quantum simulators to real, noisy quantum computers. The main contributions lie in: (1) a shallow-depth QEMTP quantum circuit for mitigating noises on NISQ quantum devices; (2) practical QEMTP linear solvers incorporating executable quantum state preparation and measurements for nodal voltage computations; (3) a noise-resilient QEMTP algorithm leveraging quantum resources logarithmically scaled with power system dimension; (4) a quantum shifted frequency analysis (QSFA) for accelerating QEMTP by exploiting dynamic phasor simulations with larger time steps; (5) a systematical analysis on QEMTPs performance under various noisy quantum environments. Extensive experiments systematically verify the accuracy, efficacy, universality and noise-resilience of QEMTP on both noise-free simulators and IBM real quantum computers.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Distribution System State Estimation: A Semidefinite Programming Approach

Distribution system state estimation (DSSE) is one of the vital components in the next-generation distribution management system which allows operators to monitor the entire system's operating conditions. Due to the lack of real-time measurements, DSSE has to process measurements whose quality varies significantly across different sources, which causes a convergence issue to the Gauss-Newton solver. In this paper, a semidefinite programming (SDP) framework is proposed to reformulate the DSSE problem into a rank- constrained SDP problem. One challenge of this technique is the nonconvex rank-one constraint, which is generally relaxed. However, the relaxed SDP-DSSE problem cannot guarantee a rank-one solution and hence loses optimality. Therefore, we propose two solution approaches to obtain rank-one solutions for the SDPDSSE problem: the rank reduction approach and the convex iteration approach. The model and the effectiveness of the proposed solution approaches are numerically demonstrated on the IEEE 13-bus, 34-bus, and 123-bus distribution systems.

convex iteration↗
DOE OSTI2024

Approximate Dynamic Programming With Enhanced Off-Policy Learning for Coordinating Distributed Energy Resources

Herein this paper proposes an innovative approximate dynamic programming (ADP) method for distributed energy resource coordination with the loss of life of battery energy storage system (BESS) explicitly modeled. The dispatch policy is designed to account for both calendrical and cyclical aging effects on BESS, explicitly modeling the impacts of ambient temperature on BESS lifespan. The proposed ADP employs an adaptive critic method and enhanced off-policy deterministic policy gradient (DPG) strategy, addressing the limitations of the on-policy gradient-based ADP approaches, including inadequate exploration, low data usage, and computational complexity. In particular, a customized policy is proposed to guide the algorithm to explore some promising decisions and thereby improve exploration capability and learning efficiency compared to conventional DPG-based learning approaches, which may struggle to find a global optimum due to random noisy action-based exploration or require expert demonstration with extra effort. The proposed method is illustrated using the IEEE 123-node system and compared with the existing ADP methods to prove solution accuracy and demonstrate the effects of incorporating degradation models into control design. Case studies showed that the proposed ADP effectively coordinates DERs with a 10 times smaller optimization gap compared to existing methods, and the incorporation of the BESS life loss model ensures the expected lifespan and results in significant cost savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Targeting amphiregulin (AREG) derived from senescent stromal cells diminishes cancer resistance and averts programmed cell death 1 ligand (PD-L1)-mediated immunosuppression

Aging is characterized by a progressive loss of physiological integrity, while cancer represents one of the primary pathological factors that severely threaten human lifespan and healthspan. In clinical oncology, drug resistance limits the efficacy of most anticancer treatments, and identification of major mechanisms remains a key to solve this challenging issue. Here, we highlight the multifaceted senescence-associated secretory phenotype (SASP), which comprises numerous soluble factors including amphiregulin (AREG). Production of AREG is triggered by DNA damage to stromal cells, which passively enter senescence in the tumor microenvironment (TME), a process that remarkably enhances cancer malignancy including acquired resistance mediated by EGFR. Furthermore, paracrine AREG induces programmed cell death 1 ligand (PD-L1) expression in recipient cancer cells and creates an immunosuppressive TME via immune checkpoint activation against cytotoxic lymphocytes. Targeting AREG not only minimized chemoresistance of cancer cells, but also restored immunocompetency when combined with classical chemotherapy in humanized animals. Our study underscores the potential of in vivo SASP in driving the TME-mediated drug resistance and shaping an immunosuppressive niche, and provides the proof of principle of targeting major SASP factors to improve therapeutic outcome in cancer medicine, the success of which can substantially reduce aging-related morbidity and mortality.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2015

Simulated impact of the renewable fuels standard on US Conservation Reserve Program enrollment and conversion

Abstract A socioeconomic model is used to estimate the land‐use implications on the U.S. Conservation Reserve Program from potential increases in second‐generation biofuel production. A baseline scenario with no second‐generation biofuel production is compared to a scenario where the Renewable Fuels Standard ( RFS 2) volumes are met by 2022. We allow for the possibility of converting expiring CRP lands to alternative uses such as conventional crops, dedicated second‐generation biofuel crops, or harvesting existing CRP grasses for biomass. Results indicate that RFS 2 volumes ( RFS 2‐v) can be met primarily with crop residues (78% of feedstock demand) and woody residues (19% of feedstock demand) compared with dedicated biomass (3% of feedstock demand), with only minimal conversion of cropland (0.27 million hectares, <1% of total cropland), pastureland (0.28 million hectares of pastureland, <1% of total pastureland), and CRP lands (0.29 million hectares of CRP lands, 3% of existing CRP lands) to biomass production. Meeting RFS 2 volumes would reduce CRP re‐enrollment by 0.19 million hectares, or 4%, below the baseline scenario where RFS 2 is not met. Yet under RFS 2‐v scenario, expiring CRP lands are more likely to be converted to or maintain perennial cover, with 1.78 million hectares of CRP lands converting to hay production, and 0.29 million hectares being harvested for existing grasses. A small amount of CRP is harvested for existing biomass, but no conversion of CRP to dedicated biomass crops, such as switchgrass, are projected to occur. Although less land is enrolled in CRP under RFS 2‐v scenario, total land in perennial cover increases by 0.15 million hectares, or 2%, under RFS 2‐v. Sensitivity to yield, payment and residue retention assumptions are evaluated.

09 BIOMASS FUELS↗
DOE OSTI2022

Accumulator Sizing for the Hybrid Hydraulic Electric Architecture (HHEA) Using Dynamic Programming

Abstract The Hybrid Hydraulic Electric Architecture (HHEA) is an approach to electrifying and improving that does not require very large electric machines. The majority power is provided hydraulically via a set of common pressure rails while small electric machines are used to modulate that power to meet exact demand. Each common pressure rail has an accumulator, which keeps the pressure of each rail near constant as long as the volume in the accumulator does not change much. A main pump adds or removes fluid from each accumulator as needed to reduce volume changes in the accumulators. It is the operation of this main pump which is investigated here. In previous analysis it was assumed that the size of the accumulators was large enough to account for any difference in fluid volume without significantly changing the pressure. In this paper, the required accumulator sizes are studied using a dynamic programming approach. At each time step the inlet and outlet of the main pump could be connected to any of the common pressure rails. These decisions for the main pump were optimized to minimize the required accumulator size. Case studies are conducted using drive cycles from a 22-ton excavator, a 20-ton wheel loader and a 5-ton excavator. The machines could be operated with total accumulator sizes of less than 20, 10, and 5 liters respectively. Required accumulator size was found to vary with pump flow rate, the frequency at which the pump/motor was able to change operating conditions, the tolerance level of pressure deviation and the accumulator’s polytropic index.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

Extending the Capabilities of the Mooring Analysis Program: A Survey of Dynamic Mooring Line Theories for Integration into FAST: Preprint

Techniques to model dynamic mooring lines come in various forms. The most widely used models include either a heuristic representation of the physics (such as a Lumped-Mass, LM, system), a Finite-Element Analysis (FEA) discretization of the lines (discretized in space), or a Finite-Difference (FD) model (which is discretized in both space and time). In this paper, we explore the features of the various models, weigh the advantages of each, and propose a plan for implementing one dynamic mooring line model into the open-source Mooring Analysis Program (MAP). MAP is currently used as a module for the FAST offshore wind turbine computer-aided engineering (CAE) tool to model mooring systems quasi-statically, although dynamic mooring capabilities are desired. Based on the exploration in this manuscript, the lumped-mass representation is selected for implementation in MAP based on its simplicity, computational cost, and ability to provide similar physics captured by higher-order models.

17 WIND ENERGY↗
DOE OSTI2021

Infrared reflection absorption spectroscopy and temperature-programmed desorption studies of CO adsorption on Ni/CeO 2 (111) thin films: The role of the ceria support

Ceria-supported Ni has shown unique catalytic activity due to unique properties of small Ni particles and strong metal-support interaction. Identification of adsorption sites and understanding the chemical interaction over Ni-ceria at the fundamental level provide crucial insights into the reaction pathways of complex catalytic processes. In this study, to probe the surface sites, the adsorption of CO was carried out with model Ni/ceria systems consisting of Ni nanoparticles vapor-deposited on well-ordered CeO x (111) (1.5 < x < 2) thin films using infrared reflection absorption spectroscopy (IRRAS) and temperature-programmed desorption (TPD) under ultrahigh vacuum (UHV) conditions. Fully oxidized CeO 2 (111) (Ce 4+ ) and partially reduced CeO 1.75 (111) (Ce 4+ /Ce 3+ ) thin films were grown on Ru(0001) to examine the role of the ceria support. Additionally, Ni with low coverages (e.g., 0.2 ML) grows forming small two-dimensional particles on ceria at 300 K, which develop into three-dimensional clusters after heating to 700 K. In the absence of Ni, CO adsorption at 1 mTorr at 100 K shows distinct IR bands at 2158 cm -1 on CeO 2 and 2165 cm -1 on CeO 1.75 . Bridging and atop IR bands associated with CO adsorption over metallic Ni were observed on the Ni-CeO 1.75 surface at 300 K under UHV conditions. CO adsorption over Ni 0 was also observed over as-deposited Ni on CeO 2 . However, a new IR band at 2146 cm -1 due to CO adsorption over Ni 2+ species was detected at 100 K over the annealed Ni particles on CeO 2 . CO IRRAS data suggest the oxidation of Ni to Ni 2+ on CeO 2 and the formation of predominant Ni 2+ species with heating, which is further confirmed with CO TPD data and previous x-ray photoelectron spectroscopy results.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Cavity contour segmentation in chest radiographs using supervised learning and dynamic programming

Purpose: Efficacy of tuberculosis (TB) treatment is often monitored using chest radiography. Monitoring size of cavities in pulmonary tuberculosis is important as the size predicts severity of the disease and its persistence under therapy predicts relapse. The authors present a method for automatic cavity segmentation in chest radiographs. Methods: A two stage method is proposed to segment the cavity borders, given a user defined seed point close to the center of the cavity. First, a supervised learning approach is employed to train a pixel classifier using texture and radial features to identify the border pixels of the cavity. A likelihood value of belonging to the cavity border is assigned to each pixel by the classifier. The authors experimented with four different classifiers:k-nearest neighbor (kNN), linear discriminant analysis (LDA), GentleBoost (GB), and random forest (RF). Next, the constructed likelihood map was used as an input cost image in the polar transformed image space for dynamic programming to trace the optimal maximum cost path. This constructed path corresponds to the segmented cavity contour in image space. Results: The method was evaluated on 100 chest radiographs (CXRs) containing 126 cavities. The reference segmentation was manually delineated by an experienced chest radiologist. An independent observer (a chest radiologist) also delineated all cavities to estimate interobserver variability. Jaccard overlap measure Ω was computed between the reference segmentation and the automatic segmentation; and between the reference segmentation and the independent observer's segmentation for all cavities. A median overlap Ω of 0.81 (0.76 ± 0.16), and 0.85 (0.82 ± 0.11) was achieved between the reference segmentation and the automatic segmentation, and between the segmentations by the two radiologists, respectively. The best reported mean contour distance and Hausdorff distance between the reference and the automatic segmentation were, respectively, 2.48 ± 2.19 and 8.32 ± 5.66 mm, whereas these distances were 1.66 ± 1.29 and 5.75 ± 4.88 mm between the segmentations by the reference reader and the independent observer, respectively. The automatic segmentations were also visually assessed by two trained CXR readers as “excellent,” “adequate,” or “insufficient.” The readers had good agreement in assessing the cavity outlines and 84% of the segmentations were rated as “excellent” or “adequate” by both readers. Conclusions: The proposed cavity segmentation technique produced results with a good degree of overlap with manual expert segmentations. The evaluation measures demonstrated that the results approached the results of the experienced chest radiologists, in terms of overlap measure and contour distance measures. Automatic cavity segmentation can be employed in TB clinics for treatment monitoring, especially in resource limited settings where radiologists are not available.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2019

An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming

Here, we present an asynchronous bundle-trust-region algorithm within the context of Lagrangian dual decomposition for stochastic mixed-integer programs. The approach solves the Lagrangian master problem by using a bundle method with a trust-region constraint. This scheme enables asynchronous computations and can thus help mitigate severe load imbalance issues (associated with the solution of scenario subproblems) and improve parallel efficiency. We provide a convergence analysis and an implementation of the proposed scheme. We also present extensive numerical results on eighty instances of a large-scale stochastic unit commitment problem, and demonstrate that the proposed approach provides significant reductions in solution time and achieves strong scaling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs

We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization, optimization with partial differential equations, and network optimization. We illustrate that for a given pair of nodes, the sensitivity of the primal-dual solution at one node against a data perturbation at the other node decays exponentially with respect to the distance between these two nodes on the graph. In other words, the solution sensitivity decays as one moves away from the perturbation point. This result, which we call exponential decay of sensitivity, holds under the strong second-order sufficiency condition and the linear independence constraint qualification. We also present conditions under which the decay rate remains uniformly bounded; this allows us to characterize the sensitivity behavior of NLPs defined over subgraphs of infinite graphs. The theoretical developments are illustrated with numerical examples.

97 MATHEMATICS AND COMPUTING↗

Refine your search to explore more results.