Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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,783 records · Page 99

The formation of quantum images and their transformation and super-resolution reading

Images formed by light with suppressed photon fluctuations are interesting objects for studies with the aim of increasing their limiting information capacity and quality. This light in the sub-Poisson state can be prepared in a resonator filled with a medium with Kerr nonlinearity, in which self-phase modulation takes place. Spatially and temporally multimode light beams are studied and the production of spatial frequency spectra of suppressed photon fluctuations is described. The efficient operation regimes of the system are found. A particular schematic solution is described, which allows one to realize the potential possibilities laid in the formation of the squeezed states of light to a maximum degree during self-phase modulation in a resonator for the maximal suppression of amplitude quantum noises upon two-dimensional imaging. The efficiency of using light with suppressed quantum fluctuations for computer image processing is studied. An algorithm is described for interpreting measurements for increasing the resolution with respect to the geometrical resolution. A mathematical model that characterizes the measurement scheme is constructed and the problem of the image reconstruction is solved. The algorithm for the interpretation of images is verified. Conditions are found for the efficient application of sub-Poisson light for super-resolution imaging. It is found that the image should have a low contrast and be maximally transparent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ON THE ESTIMATION OF RANDOM UNCERTAINTIES OF STAR FORMATION HISTORIES

The standard technique for measurement of random uncertainties of star formation histories (SFHs) is the bootstrap Monte Carlo, in which the color-magnitude diagram (CMD) is repeatedly resampled. The variation in SFHs measured from the resampled CMDs is assumed to represent the random uncertainty in the SFH measured from the original data. However, this technique systematically and significantly underestimates the uncertainties for times in which the measured star formation rate is low or zero, leading to overly (and incorrectly) high confidence in that measurement. This study proposes an alternative technique, the Markov Chain Monte Carlo (MCMC), which samples the probability distribution of the parameters used in the original solution to directly estimate confidence intervals. While the most commonly used MCMC algorithms are incapable of adequately sampling a probability distribution that can involve thousands of highly correlated dimensions, the Hybrid Monte Carlo algorithm is shown to be extremely effective and efficient for this particular task. Several implementation details, such as the handling of implicit priors created by parameterization of the SFH, are discussed in detail.

79 ASTRONOMY AND ASTROPHYSICS↗

AUTOMATED TRANSIENT IDENTIFICATION IN THE DARK ENERGY SURVEY

We describe an algorithm for identifying point-source transients and moving objects on reference-subtracted optical images containing artifacts of processing and instrumentation. The algorithm makes use of the supervised machine learning technique known as Random Forest. We present results from its use in the Dark Energy Survey Supernova program (DES-SN), where it was trained using a sample of 898,963 signal and background events generated by the transient detection pipeline. After reprocessing the data collected during the first DES-SN observing season (2013 September through 2014 February) using the algorithm, the number of transient candidates eligible for human scanning decreased by a factor of 13.4, while only 1.0% of the artificial Type Ia supernovae (SNe) injected into search images to monitor survey efficiency were lost, most of which were very faint events. Here we characterize the algorithm’s performance in detail, and we discuss how it can inform pipeline design decisions for future time-domain imaging surveys, such as the Large Synoptic Survey Telescope and the Zwicky Transient Facility. An implementation of the algorithm and the training data used in this paper are available at at http://portal.nersc.gov/project/dessn/autoscan.

79 ASTRONOMY AND ASTROPHYSICS↗

Phase Space Reconstruction from Accelerator Beam Measurements Using Neural Networks and Differentiable Simulations

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying assumptions or require specialized diagnostics to infer high-dimensional (> $2D$) beam properties. In this Letter, we introduce a general-purpose algorithm that combines neural networks with differentiable particle tracking to efficiently reconstruct high-dimensional phase space distributions without using specialized beam diagnostics or beam manipulations. Furthermore, we demonstrate that our algorithm accurately reconstructs detailed 4D phase space distributions with corresponding confidence intervals in both simulation and experiment using a single focusing quadrupole and diagnostic screen. This technique allows for the measurement of multiple correlated phase spaces simultaneously, which will enable simplified 6D phase space distribution reconstructions in the future.

47 OTHER INSTRUMENTATION↗

Online Data-Enabled Predictive Control

We develop an online data-enabled predictive (ODeePC) control method for trajectory tracking of unknown systems, building upon the recently proposed DeePC. Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. Specifically, our developed ODeePC: a) records data from the unknown system and updates the underlying primal-dual algorithm dynamically, b) can track changes in the system's operating point and adjust the control inputs, and c) is computationally efficient as it deploys a Fast Fourier Transform-based algorithm enabling the fast computation of the product of a non-square Hankel matrix with a vector. We provide theoretical guarantees regarding the asymptotic behavior of ODeePC and demonstrate its performance through a power system application.

61 RADIATION PROTECTION AND DOSIMETRY↗

Long-term strategic planning of inter-city fast charging infrastructure for battery electric vehicles

Here, this study introduces a multistage mixed integer modeling framework for long-term strategic planning of the battery electric vehicle (BEV) inter-city fast charging infrastructure. In response to the growing BEV inter-city travel demand, the framework integrates both an optimization model for decisions on where and when to build charging stations and a stochastic queuing model to determine how many chargers are needed for each station. A genetic algorithm based heuristic method is developed to efficiently solve the problem. The model is applied to investigate the long-term infrastructure requirement in the state of California where significant growth in BEV demand is expected in coming decades. Our findings indicate that the charging infrastructure is expanded in both network coverage (number of stations) and service capacity (number of chargers per station) as the BEV demand grows. We also found that the infrastructure requirement is dependent on many factors, such as the BEV electrified range, the required level of service at charging stations, and the range anxiety cost. For most simulated scenarios, the results show that it is beneficial to invest in the inter-city fast charging infrastructure, even though the range anxiety cost is at its low end.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Shor's quantum algorithm using electrons in semiconductor nanostructures

Shor's factoring algorithm illustrates the potential power of quantum computation. Here, we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network by exploiting the potential of fully coherent electron transport assisted by the surface acoustic waves. Specifically, a nonstandard approach is used to implement, in a simple form, the quantum circuits of the modular exponentiation execution for the simplest instance of Shor's algorithm, that is, the factorization of N=15. The numerical procedure is based on a time-dependent solution of the multiparticle Schroedinger equation. The near-ideal algorithm performance and the large estimated fidelity indicate the efficiency of the protocol implemented, which also is almost insensitive to small destabilizing effects during quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Feeder Power Disaggregation: A Data-Efficient Matrix Completion Approach

This paper presents a data-driven algorithm for the feeder power disaggregation problem in distribution systems. Leveraging spatio-temporal power patterns in residential homes, residential power is discomposed into three components: sparse-switching loads, periodic loads, and photovoltaic (PV) generation, which are characterized through the design of two sparse matrices and a low-rank matrix. The matrix completion process is data-efficient because of the matrix sparsity and low rankness, along with the use of power system models. The proposed approach is tested using real-world residential data set on a 33-bus distribution system, demonstrating accurate power disaggregation with efficient matrix completion.

distribution system↗

Overhead longwave infrared hyperspectral material identification using radiometric models

Material detection algorithms used in hyperspectral data processing are computationally efficient but can produce relatively high numbers of false positives. Material identification performed as a secondary processing step on detected pixels can help mitigate false positives. A material identification processing chain for longwave infrared hyperspectral data of solid materials collected from airborne platforms is presented. The algorithms utilize unwhitened radiance data and Nelder–Meade numerical optimization to estimate the temperature, humidity, and ozone levels of the atmospheric profile. Pixel unmixing is done using constrained linear regression and Bayesian information criteria for model selection. The resulting identification product includes an optimal atmospheric profile and a full radiance material model that includes material temperature, abundance values, and several fit statistics. A logistic regression method utilizing the model parameters to improve identification is also presented. Furthermore, several examples are provided using modeled data at several noise levels.

58 GEOSCIENCES↗

Density fields and halo mass functions in the geometrical adhesion toy model

In dimension 2 and above, the Burgers dynamics, the so-called 'adhesion model' in cosmology, can actually give rise to several dynamics in the inviscid limit. We investigate here the statistical properties of the density field when it is defined by a 'geometrical model' associated with this Burgers velocity field and where the matter distribution is fully determined, at each time step, by geometrical constructions. Our investigations are based on a set of numerical experiments that make use of an improved algorithm, for which the geometrical constructions are efficient and robust. In this work we focus on Gaussian initial conditions with power-law power spectra of slope n in the range -3<n<1, where a self-similar evolution develops, and we compute the behavior of power spectra, density probability distributions and mass functions. As expected for such dynamics, the density power spectra show universal high-k tails that are governed by the formation of pointlike masses. The two other statistical indicators however show the same qualitative properties as those observed for 3D gravitational clustering. In particular, the mass functions obey a Press-Schechter like scaling up to a very good accuracy in 1D, and to a lesser extent in 2D. Our results suggest that the 'geometrical adhesion model', whose solution is fully known at all times, provides a precious tool to understand some of the statistical constructions frequently used to study the development of mass halos in gravitational clustering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

In Situ Machine Learning for Intelligent Data Capture on Exascale Platforms. Final Report

In many dynamic systems, interesting events occur locally in time and space. Examples of such systems include ignition events in combustion simulations, material fractures in mechanics simulations, and extreme weather events in climate simulations. Due to memory constraints and data I/O costs, current simulation workflows save data at regularly spaced time-steps, at a fixed rate determined before the start of the simulation. Often this mode of operation results in missed events of interest, necessitating a simulation restart from before an event occurred with more frequent data saves. This data saving workflow is grossly inefficient and is already a bottleneck in the computing process. We propose to develop machine learning algorithms that can detect when interesting dynamical events are occurring, triggering data saves. These machine learning algorithms will perform in situ anomaly detection to flag regions with different dynamical properties than those previously recorded. The adaptive data saves would be local in time and space to match the event of interest, thereby enabling a much more efficient workflow that will reduce data I/O costs and data storage memory requirements. The algorithms will be tested on two applications: auto-ignition simulations and climate simulations. A critical component of this project will be developing machine learning algorithms that can be deployed efficiently in situ on HPC platforms with out-of-the-box functionality. The development of in situ machine learning methods to detect anomalous events would enable a more efficient and effective workflow, in which all the relevant data are saved in a single simulation run, without re-starts or scientist intervention.

42 ENGINEERING↗

hls4ml: An Open-Source Codesign Workflow to Empower Scientific Low-Power Machine Learning Devices

Accessible machine learning algorithms, software, and diagnostic tools for energy-efficient devices and systems are extremely valuable across a broad range of application domains. In scientific domains, real-time near-sensor processing can drastically improve experimental design and accelerate scientific discoveries. To support domain scientists, we have developed hls4ml, an open-source software-hardware codesign workflow to interpret and translate machine learning algorithms for implementation with both FPGA and ASIC technologies. We expand on previous hls4ml work by extending capabilities and techniques towards low-power implementations and increased usability: new Python APIs, quantization-aware pruning, end-to-end FPGA workflows, long pipeline kernels for low power, and new device backends include an ASIC workflow. Taken together, these and continued efforts in hls4ml will arm a new generation of domain scientists with accessible, efficient, and powerful tools for machine-learning-accelerated discovery.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Communication-Efficient Property Preservation in Tracer Transport

Atmospheric tracer transport is a computationally demanding component of the atmospheric dynamical core of weather and climate simulations. Simulations typically have tens to hundreds of tracers. A tracer field is needed to preserve several properties, including mass, shape, and tracer consistency. To improve computational efficiency, it is common to apply different spatial and temporal discretizations to the tracer transport equations than to the dynamical equations. Using different discretizations increases the difficulty of preserving properties. This paper provides a unified framework to analyze the property preservation problem and classes of algorithms to solve it. We observe the primary problem and a safety problem; describe three classes of algorithms to solve these; introduce new algorithms in two of these classes; make connections among the algorithms; analyze each algorithm in terms of correctness, bound on its solution magnitude, and its communication efficiency; and study numerical results. A new algorithm, QLT, has the smallest communication volume, and in an important case it redistributes mass approximately locally. These algorithms are only very loosely coupled to the underlying discretizations of the dynamical and tracer transport equations and thus are broadly and efficiently applicable. In addition, they may be applied to remap problems in applications other than tracer transport.

97 MATHEMATICS AND COMPUTING↗

Noise propagation in hybrid models of nonlinear systems: The Ginzburg–Landau equation

Every physical phenomenon can be described by multiple models with varying degrees of fidelity. The computational cost of higher fidelity models (e.g., molecular dynamics simulations) is invariably higher than that of their lower fidelity counterparts (e.g., a continuum model based on differential equations). While the former might not be suitable for large-scale simulations, the latter are not universally valid. Hybrid algorithms provide a compromise between the computational efficiency of a coarse-scale model and the representational accuracy of a fine-scale description. This is achieved by conducting a fine-scale computation in subdomains where it is absolutely required (e.g., due to a local breakdown of a continuum model) and coupling it with a coarse-scale computation in the rest of a computational domain. We analyze the effects of random fluctuations generated by the fine-scale component of a nonlinear hybrid on the hybrid's overall accuracy and stability. Two variants of the time-dependent Ginzburg–Landau equation (GLE) and their discrete representations provided by a nearest-neighbor Ising model serve as a computational testbed. Our analysis shows that coupling these descriptions in a one-dimensional simulation leads to erroneous results. Adding a random source term to the GLE provides accurate prediction of the mean behavior of the quantity of interest (magnetization). It also allows the two GLE variants to correctly capture the strength of the microscale fluctuations. Our work demonstrates the importance of fine-scale noise in hybrid simulations, and suggests the need for replacing an otherwise deterministic coarse-scale component of the hybrid with its stochastic counterpart.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph-based design of irregular metamaterials

In the field of metamaterial research, random structures offer a novel and less conventional approach compared to traditional periodic designs. Designing random metamaterials is challenging when it comes to ensuring intercon- nectivity, which is essential for manufacturability. This study introduces an innovative framework for generating random metamaterials using graph al- gorithms, ensuring connectivity and adaptability across various base shapes, including cylinders, triangles, pyramids, and cubes. By employing graph algorithms, our framework enhances the intuitiveness and efficiency of de- sign representation and manipulation, streamlining the design process. The framework generates families of designs that exhibit a wide range of prop- erty magnitudes that can be adjusted intuitively by modifying the input parameters. The rapid design process allows many designs to be generated, offering the user a multitude of solutions around the target property range. The designs can be effectively implemented in various fields and subjected to diverse analytical studies, including static, dynamic, and eigenfrequency assessments. We illustrate computational results for two key properties (stiff- ness and acoustic impedance), showcasing the method’s effectiveness through examples ranging from rod-based to cube-based designs. Here, the framework not only advances metamaterial research but also creates new opportunities for innovation in fields requiring customized material properties.

36 MATERIALS SCIENCE↗

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗

Target tracking using DMLC for volumetric modulated arc therapy: A simulation study

Purpose: Target tracking using dynamic multileaf collimator (DMLC) is a promising approach for intrafraction motion management in radiation therapy. The purpose of this work is to develop a DMLC tracking algorithm capable of delivering volumetric-modulated arc therapy (VMAT) to the targets that experience two-dimensional (2D) rigid motion in the beam's eye view. Methods: The problem of VMAT delivery to moving targets is formulated as a control problem with constraints. The relationships between gantry speed, gantry acceleration, MLC leaf-velocity, dose rate, and target motion are derived. An iterative search algorithm is developed to find numerical solutions for efficient delivery of a specific VMAT plan to the moving target using 2D DMLC tracking. The delivery of five VMAT lung plans is simulated. The planned and delivered fluence maps in the target-reference frame are calculated and compared. Results: The simulation demonstrates that the 2D tracking algorithm is capable of delivering the VMAT plan to a moving target fast and accurately without violating the machine constraints and the integrity of the treatment plan. The average delivery time is only 29 s longer than that of no-tracking delivery, 101 versus 72 s, respectively. The fluence maps are normalized to 200 MU and the average root-mean-square error between the desired and the delivered fluence is 2.1 MU, compared to 14.8 MU for no-tracking and 3.6 MU for one-dimensional tracking. Conclusions: A locally optimal MLC tracking algorithm for VMAT delivery is proposed, aiming at shortest delivery time while maintaining treatment plan invariant. The inconsequential increase of treatment time due to DMLC tracking is clinically desirable, which makes VMAT with DMLC tracking attractive in treating moving tumors.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Overlapping Domain Coupling of Multidimensional and System Codes in NEAMS - Pronghorn and SAM

This report describes the implementation and testing of domain-overlapping coupling of the Pronghorn and SAM codes. Both Pronghorn and SAM are codes developed by the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program for analysis of advanced nuclear reactors. Pronghorn focuses on analyzing multi-dimensional core flow conditions, while SAM focuses on analysis of the entire system including, among other components, piping, pumps, and heat exchangers. It is desirable for many advanced reactor thermal-hydraulics simulations to couple Pronghorn and SAM to obtain self-consistent solutions in the core and the system. The domain-overlapping coupling approach provides a robust and numerically efficient candidate for this coupling. We describe the algorithm for obtaining self-consistent solutions between a SAM network of flow channels and an overlapped multi-dimensional Pronghorn domain. The algorithm is tested for a variety of simple canonical test problems and a model of the Molten Salt Reactor Experiment (MSRE). Results demonstrate that the domain overlapping coupling approach provides consistent pressure, mass flow rate, enthalpy, and passive scalar distributions between Pronghorn and SAM and converges reliably and efficiently (at most 15 iterations, usually much less than 10) for the considered test problems.

97 MATHEMATICS AND COMPUTING↗