Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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,423 records · Page 79

Ultra low density biodegradable shape memory polymer foams with tunable physical properties

Compositions and/or structures of degradable shape memory polymers (SMPs) ranging in form from neat/unfoamed to ultra low density materials of down to 0.005 g/cc density. These materials show controllable degradation rate, actuation temperature and breadth of transitions along with high modulus and excellent shape memory behavior. A method of m ly low density foams (up to 0.005 g/cc) via use of combined chemical and physical aking extreme blowing agents, where the physical blowing agents may be a single compound or mixtures of two or more compounds, and other related methods, including of using multiple co-blowing agents of successively higher boiling points in order to achieve a large range of densities for a fixed net chemical composition. Methods of optimization of the physical properties of the foams such as porosity, cell size and distribution, cell openness etc. of these materials, to further expand their uses and improve their performance.

36 MATERIALS SCIENCE↗

Evaluating Portable Parallelization Strategies for Heterogeneous Architectures in High Energy Physics

High-energy physics (HEP) experiments have developed millions of lines of code over decades that are optimized to run on traditional x86 CPU systems. However, we are seeing a rapidly increasing fraction of floating point computing power in leadership-class computing facilities and traditional data centers coming from new accelerator architectures, such as GPUs. HEP experiments are now faced with the untenable prospect of rewriting millions of lines of x86 CPU code, for the increasingly dominant architectures found in these computational accelerators. This task is made more challenging by the architecture-specific languages and APIs promoted by manufacturers such as NVIDIA, Intel and AMD. Producing multiple, architecture-specific implementations is not a viable scenario, given the available person power and code maintenance issues. The Portable Parallelization Strategies team of the HEP Center for Computational Excellence is investigating the use of Kokkos, SYCL, OpenMP, std::execution::parallel and alpaka as potential portability solutions that promise to execute on multiple architectures from the same source code, using representative use cases from major HEP experiments, including the DUNE experiment of the Long Baseline Neutrino Facility, and the ATLAS and CMS experiments of the Large Hadron Collider. This cross-cutting evaluation of portability solutions using real applications will help inform and guide the HEP community when choosing their software and hardware suites for the next generation of experimental frameworks. We present the outcomes of our studies, including performance metrics, porting challenges, API evaluations, and build system integration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A preconditioning technique for Schur complement systems arising in stochastic optimization

Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adversely affect the scalability of this approach. We address this issue by proposing a stochastic preconditioner for the Schur complement matrix and by using Krylov iterative methods for the solution of the dense linear systems. The stochastic preconditioner is built based on a subset of existing scenarios and can be assembled and factorized on a separate process before the computation of the Schur complement matrix finishes on the remaining processes. The expensive factorization of the Schur complement is removed from the parallel execution flow and the scaling of the optimization solver is considerably improved with this approach. The spectral analysis indicates an exponentially fast convergence in probability to 1 of the eigenvalues of the preconditioned matrix with the number of scenarios incorporated in the preconditioner. Numerical experiments performed on the relaxation of a unit commitment problem show good performance, in terms of both the accuracy of the solution and the execution time.

99 GENERAL AND MISCELLANEOUS↗

Real-Time Control of an Ensemble of Heterogeneous Resources

This paper focuses on the problem of controlling an ensemble of heterogeneous resources connected to an electrical grid at the same point of common coupling (PCC). The controller receives an aggregate power setpoint for the ensemble in real time and tracks this setpoint by issuing individual optimal setpoints to the resources. The resources can have continuous or discrete nature (e.g., heating systems consisting of a finite number of heaters that each can be either switched on or off) and/or can be highly uncertain (e.g., photovoltaic (PV) systems or residential loads). A naive approach would lead to a stochastic mixed-integer optimization problem to be solved at the controller at each time step, which might be infeasible in real time. Instead, we allow the controller to solve a continuous convex optimization problem and compensate for the errors at the resource level by using a variant of the well-known error diffusion algorithm. We give conditions guaranteeing that our algorithm tracks the power setpoint at the PCC on average while issuing optimal setpoints to individual resources. We illustrate the approach numerically by controlling a collection of batteries, PV systems, and discrete loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The effect of filament peaking on electron beam weld quality

Electron beam welding uses high intensity beams that are generated by an electron emitting cathode under high vacuum conditions. The cathode, typically a ribbon or wire filament of refractory metal, must be heated to sufficiently high temperatures for electron emission to occur and must be carefully controlled to produce the desired beam current while at the same time optimizing filament lifetime. Traditional methods for doing this in commonly used triode gun assemblies consist of first finding the filament knee point in the filament current versus beam current relationship that produces the desired beam current for a given beam voltage. The filament current is then increased by some amount, typically 5–10%, per conventional wisdom to produce a peaked beam. This investigation studies and quantifies the beam and weld quality produced by underkneed and overpeaked filaments using electron beam diagnostics to measure the power density distribution of these beams. Underkneed filaments are shown to have power densities that drop off very quickly below the traditional knee, resulting in poor weld penetration. Kneed filaments do not reach the full beam intensity and also produce shallow welds. Increasing the filament current 10% above the traditional knee was shown to produce a circular Gaussian-like beam with peaked intensity optimized for welding and for filament lifetime. Further increases in the filament current that produce overpeaked beams do not significantly change the beam or weld quality and would only contribute to a reduced filament lifetime.

Electron Beam Welding↗

Stochastic Richardson Extrapolation Based Numerical Error Estimation for Kinetic Plasma Simulations

We present a numerical error estimation technique specifically formulated to deal with stochastic code output with multiple discretization parameters. This method is based on multiple fits to an error model with arbitrary convergence rates and cross-coupling terms, performed using nonlinear optimization. The fitting approach varies by the type of residual norm which influences the importance of outliers, and weights which influences the relative importance of data points in the coarse and refined regions of discretization parameter space. To account for the influence of stochastic noise, these fits are performed on multiple bootstrap values based on the underlying response data set. Using an automated discretization domain selection scheme, the fits are performed on a series of reduced sets of discretization levels in order to find an optimal fully-converged result estimate in the minimum variance sense; this automated approach enables straightforward analysis of multiple quantities of interest and/or time and spatially-dependent response data. The overall numerical error analysis method is useful for verification and validation problems for stochastic simulation methods and forms a key component in the overall uncertainty quantification process. The method was demonstrated for steady and unsteady electron diode problems simulated using a particle-in-cell kinetic plasma code, demonstrating excellent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Investigation and Optimization of Biodiesel Chemistry for HCCI Combustion

Over the past 5 years, ORNL has run 95 diesel range fuels in homogene-ous charge compression ignition (HCCI), including 40 bio-diesels and associated diesel fuels in their blending. The bio-diesel blends varied in oxygen content, iodine number, cetane, boiling point distribution, chemical composition, and some contained nitrogen. All fuels were run in an HCCI engine at 1800 rpm, in the power range of 2.5 to 4.5 bar IMEP, using intake air heating for combustion phasing control, and at a compression ratio of 10.6. The engine response to fuel variables has been analyzed statistically. Generally, the engine responded well to fuels with lower nitrogen and oxygen, lower cetane, and lower aromatics. Because of the wide range of fuels combined in the model, it provides only a broad overview of the engine response. It is recommended that data be truncated and re-modeled to obtain finer resolution of engine response to particular fuel variables.

33 ADVANCED PROPULSION SYSTEMS↗

SU-E-T-664: Radiobiological Modeling of Prophylactic Cranial Irradiation in Mice

Purpose: Prophylactic cranial irradiation (PCI) is a clinical technique used to reduce the incidence of brain metastasis and improve overall survival in select patients with ALL and SCLC, and we have shown the potential of PCI in select breast cancer patients through a mouse model (manuscript in preparation). We developed a computational model using our experimental results to demonstrate the advantage of treating brain micro-metastases early. Methods: MATLAB was used to develop the computational model of brain metastasis and PCI in mice. The number of metastases per mouse and the volume of metastases from four- and eight-week endpoints were fit to normal and log-normal distributions, respectively. Model input parameters were optimized so that model output would match the experimental number of metastases per mouse. A limiting dilution assay was performed to validate the model. The effect of radiation at different time points was computationally evaluated through the endpoints of incidence, number of metastases, and tumor burden. Results: The correlation between experimental number of metastases per mouse and the Gaussian fit was 87% and 66% at the two endpoints. The experimental volumes and the log-normal fit had correlations of 99% and 97%. In the optimized model, the correlation between number of metastases per mouse and the Gaussian fit was 96% and 98%. The log-normal volume fit and the model agree 100%. The model was validated by a limiting dilution assay, where the correlation was 100%. The model demonstrates that cells are very sensitive to radiation at early time points, and delaying treatment introduces a threshold dose at which point the incidence and number of metastases decline. Conclusion: We have developed a computational model of brain metastasis and PCI in mice that is highly correlated to our experimental data. The model shows that early treatment of subclinical disease is highly advantageous.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection

Deep neural networks (DNNs) have achieved state-of-the-art performance across a variety of traditional machine learning tasks, e.g., speech recognition, image classification, and segmentation. The ability of DNNs to efficiently approximate high-dimensional functions has also motivated their use in scientific applications, e.g., to solve partial differential equations and to generate surrogate models. In this paper, we consider the supervised training of DNNs, which arises in many of the above applications. We focus on the central problem of optimizing the weights of the given DNN such that it accurately approximates the relation between observed input and target data. Devising effective solvers for this optimization problem is notoriously challenging due to the large number of weights, nonconvexity, data sparsity, and nontrivial choice of hyperparameters. To solve the optimization problem more efficiently, we propose the use of variable projection (VarPro), a method originally designed for separable nonlinear least-squares problems. Our main contribution is the Gauss--Newton VarPro method (GNvpro) that extends the reach of the VarPro idea to nonquadratic objective functions, most notably cross-entropy loss functions arising in classification. These extensions make GNvpro applicable to all training problems that involve a DNN whose last layer is an affine mapping, which is common in many state-of-the-art architectures. In our four numerical experiments from surrogate modeling, segmentation, and classification, GNvpro solves the optimization problem more efficiently than commonly used stochastic gradient descent (SGD) schemes. Finally, GNvpro finds solutions that generalize well, and in all but one example better than well-tuned SGD methods, to unseen data points.

97 MATHEMATICS AND COMPUTING↗

Covalent Attachment of the Water‐insoluble Ni(P Cy 2 N Phe 2 ) 2 Electrocatalyst to Electrodes Showing Reversible Catalysis in Aqueous Solution

Abstract Hydrogenases are a diverse group of metalloenzymes which catalyze the reversible conversion between molecular hydrogen and protons at high rates. The catalytic activity of these enzymes does not require overpotential because their active site has been evolutionarily optimized to operate fast and efficiently. These enzymes have inspired the development of molecular catalysts, which have dramatically improved in efficiency in recent years, to the point that some synthetic catalysts even outperform hydrogenases under certain conditions. In this work, we use a reversible noble‐metal‐free homogeneous catalyst, the [Ni(P Cy 2 N Phe 2 ) 2 ] 2+ complex, and we covalently immobilize it on a functionalized highly oriented pyrolytic graphite “edge” (HOPG e ) electrode surface. This catalyst is not water soluble, but once it is surface‐confined on the electrode, it maintains its catalytic properties in aqueous solutions, showing reversibility for H 2 oxidation/reduction. Immobilization of the [Ni(P Cy 2 N Phe 2 ) 2 ] 2+ complex onto a multi‐walled carbon nanotubes coated electrode leads to even higher catalytic current densities and enhanced stability.

Rodríguez‐Maciá, Patricia↗

Use of radial symmetry for the calculation of cylindrical absorption coefficients and optimal capillary loadings

The problem of numerically evaluating absorption correction factors for cylindrical samples has been revisited using a treatment that fully takes advantage of the sample symmetry. It is shown that the path lengths for all points within the sample at all possible diffraction angles can be trivially determined once the angle-dependent distance distribution for a single line of points is calculated. This provides advantages in both computational efficiency and in gaining an intuitive understanding of the effects of absorption on diffraction data. A matrix of absorption coefficients calculated for µR products between 0 and 20 for diffraction angles θ D of 0° to 90° were used to examine the influence of (1) capillary diameter and of (2) sample density on the overall scattered intensity as a function of diffraction angle, where µ is the linear absorption coefficient for the sample and R is the capillary radius. Based on this analysis, the optimal sample loading for a capillary experiment to maximize diffraction at angles of 0 – 50° is in general expected to be achieved when the maximum radius capillary compatible with the beam is used, and when the sample density is adjusted to be 3/(4µR) of its original density.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Probabilistic Short-Term Wind Forecasting Based on Pinball Loss Optimization

Probabilistic wind power forecasts that quantify the uncertainty in wind output have the potential to aid in the economic grid integration of wind power at large penetration levels. In this paper, a novel probabilistic wind forecasting approach based on pinball loss optimization is proposed, in conjunction with a multi-model machine learning based ensemble deterministic forecasting framework. By assuming the point-forecasted value as the mean at each point, one unknown parameter (i.e., standard deviation) of a predictive distribution at each forecasting point is determined by minimizing the pinball loss. A surrogate model is developed to represent the unknown distribution parameter as a function of deterministic forecasts. This surrogate model can be used together with deterministic forecasts to predict the unknown distribution parameter and thereby generate probabilistic forecasts. Numerical results of case studies show that the proposed method has improved the pinball loss by up to 35% compared to a baseline quantile regression forecasting model.

17 WIND ENERGY↗

Ab initio molecular dynamics study of liquid sodium and cesium up to critical point

Ab initio modeling of liquid metals Na and K is carried out using the program SIESTA. We have determined the parameters of the model (the optimal step, the number of particles, the initial state etc) and calculated a wide range of properties: the total energy, pair correlation function, coefficient of self-diffusion, heat capacity, statistics of Voronoi polyhedra, the density of electronic states up to the critical temperature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multipacting optimization of a 750 MHz rf dipole

Crab crossing schemes have been proposed to re-instate luminosity degradation due to crossing angles at the interaction points in next generation colliders to avoid the use of sharp bending magnets and their resulting large synchrotron radiation generation, highly undessirable in the detector region. The rf dipole has been considered for a different set of applications in several machines, both rings and linear colliders. We present in this paper a study of the effects on the multipacting levels and location depending on geometrical variations on the design for a crabbing/deflecting application in a high current (3/0.5 A), high repetition (750 MHz) electron/proton collider, as a matter to provide a comparison point for similar applications of rf dipoles.

Delayen, Jean R.↗

A GROUP FINDING ALGORITHM FOR MULTIDIMENSIONAL DATA SETS

We describe a density-based hierarchical group finding algorithm capable of identifying structures and substructures of any shape and density in multidimensional data sets where each dimension can be a numeric attribute with arbitrary measurement scale. This has applications in a wide variety of fields from finding structures in galaxy redshift surveys, to identifying halos and subhalos in N-body simulations and group finding in Local Group chemodynamical data sets. In general, clustering schemes require an a priori definition of a metric (a non-negative function that gives the distance between two points in a space) and the quality of clustering depends upon this choice. The general practice is to use a constant global metric which is optimal only if the clusters in the data are self-similar. For complex data configurations even the most finely tuned constant global metric turns out to be suboptimal. Moreover, the correct choice of metric also becomes increasingly important as the number of dimensions increase. To address these problems, we present an entropy-based binary space partitioning algorithm which uses a locally adaptive metric for each data point. The metric is employed to calculate the density at each point and a list of its nearest neighbors, and this information is then used to form a hierarchy of groups. Finally, the ratio of maximum to minimum density of points in a group is used to estimate the significance of the groups. Setting a threshold on this significance can effectively screen out groups arising due to Poisson noise and helps organize the groups into meaningful clusters. For a data set of N points, the algorithm requires only O(N) space and O(N(log N){sup 3}) time which makes it ideally suitable for analyzing large data sets. As an example, we apply the algorithm to identify structures in a simulated stellar halo using the full six-dimensional phase space coordinates.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive sampling for accelerating neutron diffraction-based strain mapping *

Abstract Neutron diffraction is a useful technique for mapping residual strains in dense metal objects. The technique works by placing an object in the path of a neutron beam, measuring the diffracted signals and inferring the local lattice strain values from the measurement. In order to map the strains across the entire object, the object is stepped one position at a time in the path of the neutron beam, typically in raster order, and at each position a strain value is estimated. Typical dwell times at neutron diffraction instruments result in an overall measurement that can take several hours to map an object that is several tens of centimeters in each dimension at a resolution of a few millimeters, during which the end users do not have an estimate of the global strain features and are at risk of incomplete information in case of instruments outages. In this paper, we propose an object adaptive sampling strategy to measure the significant points first. We start with a small initial uniform set of measurement points across the object to be mapped, compute the strain in those positions and use a machine learning technique to predict the next position to measure in the object. Specifically, we use a Bayesian optimization based on a Gaussian process regression method to infer the underlying strain field from a sparse set of measurements and predict the next most informative positions to measure based on estimates of the mean and variance in the strain fields estimated from the previously measured points. We demonstrate our real-time measure-infer-predict workflow on additively manufactured steel parts—demonstrating that we can get an accurate strain estimate even with 30%–40% of the typical number of measurements—leading the path to faster strain mapping with useful real-time feedback. We emphasize that the proposed method is general and can be used for fast mapping of other material properties such as phase fractions from time-consuming point-wise neutron measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PSF and MTF Measurement Methods for Thick CCD Sensor Characterization

Knowledge of the point spread function (PSF) of the sensors to be used in the Large Synoptic Survey Telescope (LSST) camera is essential for optimal extraction of subtle galaxy shape distortions caused by gravitational weak lensing. We have developed a number of techniques for measuring the PSF of candidate CCD sensors to be used in the LSST camera, each with its own strengths and weaknesses. The two main optical PSF measurement techniques that we use are the direct Virtual Knife Edge (VKE) scan as developed by Karcher, et al. and the indirect interference fringe method after Andersen and Sorensen that measures the modulation transfer function (MTF) directly. The PSF is derived from the MTF by Fourier transform. Other non-optical PSF measurement techniques that we employ include {sup 55}Fe x-ray cluster image size measurements and statistical distribution analysis, and cosmic ray muon track size measurements, but are not addressed here. The VKE technique utilizes a diffraction-limited spot produced by a Point-Projection Microscope (PPM) that is scanned across the sensor with sub-pixel resolution. This technique closely simulates the actual operating condition of the sensor in the telescope with the source spot size having an f/number close to the actual telescope design value. The interference fringe method uses a simple equal-optical-path Michelson-type interferometer with a single-mode fiber source that produces interference fringes with 100% contrast over a wide spatial frequency range sufficient to measure the MTF of the sensor directly. The merits of each measurement technique and results from the various measurement techniques on prototype LSST sensors are presented and compared.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Feedback-Based Regularized Primal-Dual Gradient Method for Time-Varying Nonconvex Optimization: Preprint

This paper considers time-varying nonconvex optimization problems, utilized to model optimal operational trajectories of systems governed by possibly nonlinear physical or logical models. Algorithms for tracking a Karush-Kuhn-Tucker point are synthesized, based on a regularized primal-dual gradient method. In particular, the paper proposes a feedback-based primal-dual gradient algorithm, where analytical models for system state or constraints are replaced with actual measurements. When cost and constraints functions are twice continuously differentiable, conditions for the proposed algorithms to have bounded tracking error are derived, and a discussion of their practical implications is provided. Illustrative numerical simulations are presented for an application in power systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗