Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quadratic 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 163 records · Page 9

COLUMBUS─An Efficient and General Program Package for Ground and Excited State Computations Including Spin–Orbit Couplings and Dynamics

The COLUMBUS program system provides the tools for performing high-level multireference (MR) computations, including the multireference configuration interaction (MRCI) method and its multireference averaged quadratic coupled cluster (MR-AQCC) extension, allowing computations on a wide range of fascinating atomic and molecular systems, including the treatment of open-shells and complicated excited state phenomena. The inclusion of spin−orbit coupling (SOC) directly within the MRCI step enables the description of systems containing heavy elements, such as lanthanides and actinides, whose properties are strongly influenced by SOC. Analytic energy gradients and nonadiabatic couplings at the correlated MRCI level provide the foundation for a variety of dynamics studies, giving insight into ultrafast photochemistry. New and ongoing method developments in COLUMBUS include the computation of spin densities, improved descriptions of ionic states, enhancements to the AQCC method, and the porting of COLUMBUS to graphical processing units (GPUs). New external interfaces enable an enhanced description of electronic resonances and molecules in strong laser fields. This work highlights these new developments while providing a detailed account of the diverse applications of COLUMBUS in recent years.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters

Abstract Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the database and query among thousands of processor nodes. However, the optimality of the partitioning method was not studied. Unlike BLAST performance models proposed in the literature that usually have problem size and hardware configuration as the only variables, the execution time of a BLAST job is a function of database size, query size, and hardware capability. In this work, the nucleotide BLAST application BLASTN was profiled using three methods: shell-level profiling with the Unix “time” command, code-level profiling with the built-in “profiler” module, and system-level profiling with the Unix “gprof” program. The runtimes were measured for six node types, using six different database files and 15 query files, on a heterogeneous HPC cluster with 500+ nodes. The empirical measurement data were fitted with quadratic functions to develop performance models that were used to guide the data parallelization for BLASTN jobs. Results Profiling results showed that BLASTN contains more than 34,500 different functions, but a single function, RunMTBySplitDB, takes 99.12% of the total runtime. Among its 53 child functions, five core functions were identified to make up 92.12% of the overall BLASTN runtime. Based on the performance models, static load balancing algorithms can be applied to the BLASTN input data to minimize the runtime of the longest job on an HPC cluster. Four test cases being run on homogeneous and heterogeneous clusters were tested. Experiment results showed that the runtime can be reduced by 81% on a homogeneous cluster and by 20% on a heterogeneous cluster by re-distributing the workload. Discussion Optimal data partitioning can improve BLASTN’s overall runtime 5.4-fold in comparison with dividing the database and query into the same number of fragments. The proposed methodology can be used in the other applications in the BLAST+ suite or any other application as long as source code is available.

59 BASIC BIOLOGICAL SCIENCES↗

Scaling Input Distributions for Probabilistic Models - 19472

It is important to address scaling issues when building models to support risk-based decisions for radioactive waste disposal sites. Currently, probabilistic risk assessment and probabilistic performance assessment models are run for multiple realizations where each realization uses one value from each input distribution over the entire modeled time. The input distributions represent the current state of knowledge in the mean of the input variable over the spatial region of interest and over the time period of the model run. This paper focuses on the time factor in input distribution scaling because it presents more serious conceptual and distributional challenges than the spatial factor. One of the challenges in temporal scaling is the effect of non-linearity on propagation of distribution uncertainty through to uncertainty in results. Radioactive waste disposal models tend to have both linear and non-linear components in their models. Dose assessment calculations are typically represented by linear models, while contaminant transport models have linear and non-linear components. In principle, temporal scaling of input parameter distributions for a linear model is straightforward, but scaling of input distributions for non-linear models is not. This paper uses examples to investigate the effects of input distribution temporal scaling on simple linear and non-linear models. Different scaling scenarios were investigated by comparing three analysis tools: analytical mathematical representations, statistical software programming, and GoldSim Monte Carlo simulation software. R statistical software is an open source statistical programming language often used for statistical analyses and graphical representation of data. GoldSim is a robust probabilistic dynamic modeling platform used in performance assessment modeling of radioactive waste sites. A simple linear model, a quadratic model and a multiplicative model were the cases explored for each of these tools. For the three analysis tools considered and with each of the scaling cases, 1,000 realizations were implemented from distributions of the random variables of interest. This is a sufficient number of realizations for simple models to capture the model space. An annual temporal resolution of a 100-year simulation period was chosen for all models and analysis tools. The effects of temporal scaling were demonstrated by investigating two different options for time scaling. Option 1 was set up so that the input distributions represented the expected value on an annual time scale, and a new value from that distribution was chosen every year (at every time step which equaled a year) for 100 years. In Option 2, the input distributions were scaled to represent the expected mean value of the input variable over the 100 years of simulation, and one value from that distribution was chosen for the entire elapsed time. Results show agreement across the three analysis tools. As expected, the linear models have identical results for the two different scaling Options, and the non-linear models diverge in the results for different time scale implementation. The implications of this work point to the need for careful consideration of input distribution temporal scaling. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

On ideal structure in quadratic DDS in R{sup 2}

We consider the dynamics in a special case of two-dimensional quadratic homogeneous discrete dynamical systems. It is well known (c.f. [1, 2]) that homogeneous quadratic maps are in one to one correspondence with two-dimensional commutative (nonassociative) algebras. Algebraic concepts (such as the structure of algebra and existence of special elements like idempotents and nilpotents) help us to study the dynamics of the corresponding discrete homogeneous quadratic maps. It is well-known that such systems can exhibit chaotic behavior [3], In this article we consider the influence of the existence of an algebra ideal on the dynamics of the corresponding discrete homogeneous quadratic system. We also present some examples in the plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monte Carlo Simulation of the Irradiation of Alanine Coated Film Dosimeters with Accelerated Electrons

The Monte Carlo code PENELOPE was used to simulate the irradiation of alanine coated film dosimeters with electron beams of energies from 1 to 5 MeV being produced by a high-current industrial electron accelerator. This code includes a geometry package that defines complex quadratic geometries, such as those of the irradiation of products in an irradiation processing facility. In the present case the energy deposited on a water film at the surface of a wood parallelepiped was calculated using the program PENMAIN, which is a generic main program included in the PENELOPE distribution package. The results from the simulation were then compared with measurements performed by irradiating alanine film dosimeters with electrons using a 150 kW Dynamitron electron accelerator. The alanine films were placed on top of a set of wooden planks using the same geometrical arrangement as the one used for the simulation. The way the results from the simulation can be correlated with the actual measurements, taking into account the irradiation parameters, is described. An estimation of the percentage difference between measurements and calculations is also presented.

61 RADIATION PROTECTION AND DOSIMETRY↗

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗

Mean-Variance Optimization-Based Energy Storage Scheduling Considering Day-Ahead and Real-Time LMP Uncertainties

In this letter, a new mean-variance optimization-based energy storage scheduling method is proposed with the consideration of both day-ahead (DA) and real-time (RT) energy markets price uncertainties. It considers the locational marginal price (LMP) forecast uncertainties in the DA and RT markets. The energy storage arbitrage risk associated with the LMP forecast uncertainty is explicitly modeled through the variance component in the objective function. The quadratic term of this variance is transformed into a second-order cone constraint using the charging and discharging power complementarity of the energy storage system. Finally, the proposed model is formulated as a mixed-integer conic programming problem. Numerical case studies demonstrate the effectiveness of the proposed model for energy storage scheduling considering price uncertainty.

25 ENERGY STORAGE↗

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

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

97 MATHEMATICS AND COMPUTING↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

Overvoltage Prevention and Curtailment Reduction Using Adaptive Droop-Based Supplementary Control in Smart Inverters

Recent developments in the renewable energy sector have seen an unprecedented growth in residential photovoltaic (PV) installations. However, high PV penetration levels often lead to overvoltage problems in low-voltage (LV) distribution feeders. Smart inverter control such as active power curtailment (APC)-based overvoltage control can be implemented to overcome these challenges. The APC technique utilizes a constant droop-based approach which curtails power rigidly, which can lead to significant energy curtailment in the LV distribution feeders. In this paper, different variations of the APC technique with linear, quadratic, and exponential droops have been analyzed from the point-of-view of energy curtailment for a LV distribution network in North America. Further, a combinatorial approach using various droop-based APC methods in conjunction with adaptive dynamic programming (ADP) as a supplementary control scheme has also been proposed. The proposed approach minimizes energy curtailment in the LV distribution network by adjusting the droop gains. Simulation results depict that ADP in conjunction with exponential droop reduces the energy curtailment to approximately 50% compared to using the standard linear droop.

42 ENGINEERING↗

Factors affecting breeding season survival of Red-Headed Woodpeckers in South Carolina.

Red-headed woodpecker (Melanerpes erythrocephalus) populations have declined in the United States and Canada over the past 40 years. However, few demographic studies have been published on the species and none have addressed adult survival. During 2006-2007, we estimated survival probabilities of 80 radio-tagged red-headed woodpeckers during the breeding season in mature loblolly pine (Pinus taeda) forests in South Carolina. We used known-fate models in Program MARK to estimate survival within and between years and to evaluate the effects of foliar cover (number of available cover patches), snag density treatment (high density vs. low density), and sex and age of woodpeckers. Weekly survival probabilities followed a quadratic time trend, being lowest during mid-summer, which coincided with the late nestling and fledgling period. Avian predation, particularly by Cooper's (Accipiter cooperii) and sharp-shinned hawks (A. striatus), accounted for 85% of all mortalities. Our best-supported model estimated an 18-week breeding season survival probability of 0.72 (95% CI = 0.54-0.85) and indicated that the number of cover patches interacted with sex of woodpeckers to affect survival; females with few available cover patches had a lower probability of survival than either males or females with more cover patches. At the median number of cover patches available (n = 6), breeding season survival of females was 0.82 (95% CI = 0.54-0.94) and of males was 0.60 (95% CI = 0.42-0.76). The number of cover patches available to woodpeckers appeared in all 3 of our top models predicting weekly survival, providing further evidence that woodpecker survival was positively associated with availability of cover. Woodpecker survival was not associated with snag density. Our results suggest that protection of {ge}0.7 cover patches per ha during vegetation control activities in mature pine forests will benefit survival of this Partners In Flight Watch List species.

60 APPLIED LIFE SCIENCES↗

Innovative Divertor Development to Solve the Plasma Heat-Flux Problem

Large, localized plasma heat exhaust continues to be one of the critical problems for the development of tokamak fusion reactors. Excessive heat flux erodes and possibly melts plasma-facing materials, thereby dramatically shortening their lifetime and increasing the impurity contamination of the core plasma. A detailed assessment by the ITER team for their divertor has revealed substantial limitations on the operational space imposed by the divertor performance. For a fusion reactor, the problem becomes worse in that the divertor must accommodate 20% of the total fusion power (less any broadly radiated loss), while not allowing excess buildup of tritium in the walls nor excessive impurity production. This is an extremely challenging set of problems that must be solved for fusion to succeed as a power source; it deserves a substantial research investment. Material heat-flux constraints: Results from present-day tokamaks show that there are two major limitations of peak plasma heat exhaust. The first is the continuous flow of power to the divertor plates and nearby surfaces that, for present technology, is limited to 10-20 MW/m{sup 2}. The second is the transient peak heat-flux that can be tolerated in a short time, {tau}{sub m}, before substantial ablation and melting of the surface occurs; such common large transient events are Edge Localized Mode (ELMs) and disruptions. The material limits imposed by these events give a peak energy/{tau}{sub m}{sup 1/2} parameter of {approx} 40 MJ/m{sup 2}s{sup 1/2} [1]. Both the continuous and transient limits can be approached by input powers in the largest present-day devices, and future devices are expected to substantially exceed the limits unless a solution can be found. Since the early 90's LLNL has developed the analytic and computational foundation for analyzing divertor plasmas, and also suggested and studied a number of solid and liquid material concepts for improving divertor/wall performance, with the most recent being the Snowflake divertor concept [2] and generating Resonant Magnetic Perturbations by the SOL currents [3]. However, the specific approaches discussed here are part of a wider class of innovative divertor ideas that have come from the community in the last several years, and we certainly advocate the need to consider a range of options. Indeed, the most effective solution to the heat-flux problem may well contain features of various ideas. For example, there are the X-divertor (Kotschenreuther et al. [4]) that expands the magnetic flux surface in the vicinity of the near-X-point divertor plate, and the super X-divertor (Valanju et al. [5]) that guides the near-separatrix SOL flux tubes to a larger major radius to increase the surface area available for power deposition. These approaches have the common feature of manipulation of the edge magnetic geometry. Another approach is the use of liquid divertor surfaces that can increase the heat-flux capability by flowing the heated material to a cooling region and eventually out of the machine, and/or by being able to withstand a higher peak heat flux [6]. All of these areas are only emerging concepts that require substantially more analysis and definitive experimental tests, and given the need for a large improvement in this area, we advocate a substantial program to systematically assess the approaches. Because of space limitation here, we present some details of one of the concepts, namely the Snowflake divertor configuration. The Snowflake (SF) divertor [2] exploits a tokamak geometry in which the poloidal magnetic field varies quadratically with distance from the X-point null, {Delta}r. The name stems from the characteristic hexagonal, snowflake-like, shape of the multi-branched separatrix for this exact second-order null. In contrast, the standard X-point configuration has a poloidal field varying linearly with ?r. The different variations mean that a flux expansion is much larger in the vicinity of a null of a snowflake divertor, and one can try to exploit this fact for reducing the divertor heat load. A unique feature here is also that the shear in the magnetic field near the X-point is substantially larger for the SF configuration, which may favorably affect microinstabilities and ELMs. Practical realization appears straightforward; the SF can be obtained using existing poloidal field coils in various present-day devices, and in general can be produced with coils located well outside the vacuum vessel. The SF configuration increases the flux expansion near the X-point that can be exploited by some increase in the plate wetted area, longer field-line length, and larger volume for impurity radiation. Initial UEDGE simulations comparing the SF with the standard divertor for the same conditions show a reduction in the peak heat flux for the SF of {approx}1.2-1.6 when comparing cases for the same angle of the total magnetic field to the divertor plate [7].

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗

Dose Algorithm for EXTRAD 4100S Extremity Dosimeter for Use at Sandia National Laboratories

An updated algorithm for the EXTRAD 4100S extremity dosimeter has been derived. This algorithm optimizes the binning of dosimeter element ratios and uses a quadratic function to determine the response factors for low response ratios. This results in lower systematic bias across all test categories and eliminates the need for the 'red strap' algorithm that was used for high energy beta/gamma emitting radionuclides. The Radiation Protection Dosimetry Program (RPDP) at Sandia National Laboratories uses the Thermo Fisher EXTRAD 4100S extremity dosimeter, shown in Fig 1.1 to determine shallow dose to the extremities of potentially exposed individuals. This dosimeter consists of two LiF TLD elements or 'chipstrates', one of TLD-700 ({sup 7}Li) and one of TLD-100 (natural Li) separated by a tin filter. Following readout and background subtraction, the ratio of the responses of the two elements is determined defining the penetrability of the incident radiation. While this penetrability approximates the incident energy of the radiation, X-rays and beta particles exist in energy distributions that make determination of dose conversion factors less straightforward in their determination.

61 RADIATION PROTECTION AND DOSIMETRY↗

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type Σ x i = k for binary variables x i . Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.

97 MATHEMATICS AND COMPUTING↗

Comp Plan: A computer program to generate dose and radiobiological metrics from dose-volume histogram files

Treatment planning studies often require the calculation of a large number of dose and radiobiological metrics. To streamline these calculations, a computer program called Comp Plan was developed using MATLAB. Comp Plan calculates common metrics, including equivalent uniform dose, tumor control probability, and normal tissue complication probability from dose-volume histogram data. The dose and radiobiological metrics can be calculated for the original data or for an adjusted fraction size using the linear quadratic model. A homogeneous boost dose can be added to a given structure if desired. The final output is written to an Excel file in a format convenient for further statistical analysis. Comp Plan was verified by independent calculations. A lung treatment planning study comparing 45 plans for 7 structures using up to 6 metrics for each structure was successfully analyzed within approximately 5 minutes with Comp Plan. The code is freely available from the authors on request.

61 RADIATION PROTECTION AND DOSIMETRY↗

Compositional Dataflow Via Abstract Transition Systems

Despite decades of research and development of dataflow analyses within dozens of different compiler infrastructures, analysis of real programs is intractable in practice. The reason is that although a single research group is equipped to model a single well-defined aspect of application behavior, application developers use a very wide range of abstractions and coding techniques within a single application. Since to analyze even a single application all of its complexities must be modeled, researchers must combine analyses from multiple groups into comprehensive analysis frameworks such as OpenAnalysis or LLVM. Analysis composition is expensive in practice, requiring development effort that is quadratic in the number of analyses as well as tight inter-group coordination to maintain consistent APIs to each other’s symbolic abstractions. This paper proposes an approach to building compiler analysis frameworks that simplifies the composition of independently-developed analyses. It formalizes the operation of dataflow analyses in a way that simplifies reasoning about various types of analysis composition. Further, it defines a portable abstraction that can represent the results of many real analyses, making it possible for different analyses to leverage each other’s results with no knowledge of their APIs or internal abstractions and without any coordination between the groups that developed them. We have developed the Fuse compositional analysis framework based on this abstraction, and integrated it in the ROSE [15] compilation system. Our experience is that this approach greatly simplifies composition of program analyses, making it easy to tailor different combinations of program analyses to different input programs.

97 MATHEMATICS AND COMPUTING↗

Coupled‐cluster singles, doubles and perturbative triples with density fitting approximation for massively parallel heterogeneous platforms

Abstract A high‐performance implementation of the coupled‐cluster singles, doubles, and perturbative triples [CCSD(T)] is developed in the Massively Parallel Quantum Chemistry program. Novel features include: (1) reduced memory requirements via a density‐fitting (DF) CCSD implementation utilizing distributed lazy evaluation for tensors with more than two unoccupied indices and (2) the ability to utilize efficiently many‐core nodes (Intel Xeon Phi) and heterogeneous nodes with multiple NVIDIA GPUs on each node. All data that are greater than quadratic in the system size are distributed among processes. Excellent strong scaling is observed on distributed‐memory computers equipped with conventional CPUs, Intel Xeon Phi processors, and heterogeneous nodes with multiple NVIDIA GPUs Canonical CCSD(T) energies can be evaluated for systems containing 200 electrons and 1000 basis functions in a few days using a small size commodity cluster, with even larger computations possible on leadership‐class computing resources.

Peng, Chong↗