Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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 379 records · Page 21

Development of multi-objective core optimization framework and application to sodium-cooled fast test reactors

The optimization of a Sodium-cooled Fast Reactor (SFR) core is a challenging process, due to the large number of design parameters, the nonlinearities among inputs and outputs, and the complicated correlation among output parameters. This study attempts to develop a generalized framework for the SFR core optimization by coupling the sensitivity analysis, advanced optimization algorithm, and optionally the surrogate modeling. The framework is built based on the fast reactor modeling capability of the Argonne Reactor Computation (ARC) suite and the sensitivity analysis and optimization modules embedded in the DAKOTA code, both have been integrated within the NEAMS Workbench. The genetic algorithm is selected as the optimization method for its robustness, while the option of surrogate modeling is also explored to alleviate the computational burden caused by employing the ARC direct core physics simulation and thus enhance the efficiency of the optimization. Finally, the normalized deviations of performance parameters of the near-optimal solution from those of the ideal core are calculated and used as criteria to down select the final core design. The developed framework is applied to the Advanced Burner Test Reactor (ABTR) core, and optimal solutions are determined by balancing various objectives simultaneously, including peak fast flux, core volume, power, reactivity swing, plutonium mass feed, while at the same time satisfying the predefined constraints due to safety or economics considerations. The optimal ABTR core design obtained using the direct physical simulation and surrogated model are compared and discussed. It is found that using the accurately constructed surrogate models can significantly reduce the required computational time while maintaining satisfactory accuracy.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Redesign of the DFT/MRCI Hamiltonian

The combined density functional theory and multireference configuration interaction (DFT/MRCI) method of Grimme and Waletzke [J. Chem. Phys. 111, 5645 (1999)] is a well-established semi-empirical quantum chemical method for efficiently computing excited-state properties of organic molecules. As it turns out, the method fails to treat bi-chromophores owing to the strong dependence of the parameters on the excitation class. In this work, we present an alternative form of correcting the matrix elements of a MRCI Hamiltonian which is built from a Kohn-Sham set of orbitals. It is based on the idea of constructing individual energy shifts for each of the state functions of a configuration. The new parameterization is spin-invariant and incorporates less empirism compared to the original formulation. By utilizing damping techniques together with an algorithm of selecting important configurations for treating static electron correlation, the high computational efficiency has been preserved. The robustness of the original and redesigned Hamiltonians has been tested on experimentally known vertical excitation energies of organic molecules yielding similar statistics for the two parameterizations. Besides that, our new formulation is free from artificially low-lying doubly excited states, producing qualitatively correct and consistent results for excimers. The way of modifying matrix elements of the MRCI Hamiltonian presented here shall be considered as default choice when investigating photophysical processes of bi-chromophoric systems such as singlet fission or triplet-triplet upconversion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data acquisition and slow control interface for the Mu2e experiment

The Mu2e experiment at the Fermilab Muon Campus will search for the coherent neutrinoless conversion of a muon into an electron in the field of an aluminum nucleus with a sensitivity improvement by a factor of 10000 over existing limits. The Mu2e Trigger and Data Acquisition System (TDAQ) uses otsdaq as the online Data Acquisition System (DAQ) solution. Developed at Fermilab, otsdaq integrates both the artdaq DAQ and the art analysis frameworks for event transfer, filtering, and processing. otsdaq is an online DAQ software suite with a focus on flexibility and scalability and provides a multi-user, web-based, interface accessible through a web browser. The data stream from the detector subsystems is read by a software filter algorithm that selects events which are combined with the data flux coming from a cosmic ray veto system. The Detector Control System (DCS) has been developed using the Experimental Physics and Industrial Control System (EPICS) open source platform for monitoring, controlling, alarming, and archiving. The DCS system has been integrated into otsdaq. A prototype of the TDAQ and the DCS systems has been built at Fermilab's Feynman Computing Center. In this study, we report on the progress of the integration of this prototype in the online otsdaq software.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Wasserstein Normalized Autoencoder for Anomaly Detection in ProtoDUNE Vertical-Drift Detector

ProtoDUNE Vertical Drift needs a selective triggering algorithm. The detector sits on Earth's surface, so cosmic activity dominates its data. Our goal in this paper is to trigger on neutrino events more robustly than the current deployed Analog-to-Digital Converter Simple Window (ADCSW) model and, eventually, search for signals of Beyond Standard Model (BSM) physics at DUNE as our ultimate North Star objective. As a step towards this goal, we evaluate a Wasserstein Normalized Autoencoder (WNAE) on simulated collection-plane only windows of shape $1\times10\times10$ where Neutrinos act as our BSM-proxy and Cosmic-ray Muons serve as our learned background. The network parameters are fitted using only cosmic-ray muon events as background in order to maintain an unsupervised pipeline. Training uses finite-step Langevin $x^-$ samples, positive-sample reconstruction energy, and an empirical sliced $2$-Wasserstein objective to learn a normalized Boltzmann energy model. We then calibrate on a nominal $5\,\mathrm{Hz}$ operating threshold calculated from cosmic validation data. Both WNAE and ADCSW accept 311 of 194,083 held-out cosmic background events at this $5\,\mathrm{Hz}$ threshold. We found that WNAE accepts 9,677 of 34,634 neutrino-proxy events $(27.9\pm0.24)\%$, compared with 10,076 $(29.1\pm0.24)\%$ for ADCSW, an observed WNAE-minus-ADCSW difference of $-1.15\%$. At another nominal $2\,\mathrm{Hz}$ target threshold, the corresponding efficiencies are $(20.5\pm0.22)\%$ and $(22.6\pm0.22)\%$, respectively. Of the WNAE-selected neutrino proxies at $5\,\mathrm{Hz}$, $(20.8\pm0.4)\%$ of the classified neutrino-proxy events are unique to WNAE, where the uncertainty is an absolute binomial standard error of $0.4\%$.

Zheng, Jake [U. Chicago (main)] (ORCID:00090002189↗

Wasserstein Normalized Autoencoder for Anomaly Detection in ProtoDUNE Vertical-Drift Detector

ProtoDUNE Vertical Drift needs a selective triggering algorithm. The detector sits on Earth's surface, so cosmic activity dominates its data. Our goal in this paper is to trigger on neutrino events more robustly than the current deployed Analog-to-Digital Converter Simple Window (ADCSW) model and, eventually, search for signals of Beyond Standard Model (BSM) physics at DUNE as our ultimate North Star objective. As a step towards this goal, we evaluate a Wasserstein Normalized Autoencoder (WNAE) on simulated collection-plane only windows of shape $1\times10\times10$ where Neutrinos act as our BSM-proxy and Cosmic-ray Muons serve as our learned background. The network parameters are fitted using only cosmic-ray muon events as background in order to maintain an unsupervised pipeline. Training uses finite-step Langevin $x^-$ samples, positive-sample reconstruction energy, and an empirical sliced $2$-Wasserstein objective to learn a normalized Boltzmann energy model. We then calibrate on a nominal $5\,\mathrm{Hz}$ operating threshold calculated from cosmic validation data. Both WNAE and ADCSW accept 311 of 194,083 held-out cosmic background events at this $5\,\mathrm{Hz}$ threshold. We found that WNAE accepts 9,677 of 34,634 neutrino-proxy events $(27.9\pm0.24)\%$, compared with 10,076 $(29.1\pm0.24)\%$ for ADCSW, an observed WNAE-minus-ADCSW difference of $-1.15\%$. At another nominal $2\,\mathrm{Hz}$ target threshold, the corresponding efficiencies are $(20.5\pm0.22)\%$ and $(22.6\pm0.22)\%$, respectively. Of the WNAE-selected neutrino proxies at $5\,\mathrm{Hz}$, $(20.8\pm0.4)\%$ of the classified neutrino-proxy events are unique to WNAE, where the uncertainty is an absolute binomial standard error of $0.4\%$.

Zheng, Jake [Chicago U.] (ORCID:0009000218901379)↗

A dynamic collimation system for penumbra reduction in spot-scanning proton therapy: Proof of concept

Purpose: In the absence of a collimation system the lateral penumbra of spot scanning (SS) dose distributions delivered by low energy proton beams is highly dependent on the spot size. For current commercial equipment, spot size increases with decreasing proton energy thereby reducing the benefit of the SS technique. This paper presents a dynamic collimation system (DCS) for sharpening the lateral penumbra of proton therapy dose distributions delivered by SS. Methods: The collimation system presented here exploits the property that a proton pencil beam used for SS requires collimation only when it is near the target edge, enabling the use of trimmers that are in motion at times when the pencil beam is away from the target edge. The device consists of two pairs of parallel nickel trimmer blades of 2 cm thickness and dimensions of 2 cm × 18 cm in the beam's eye view. The two pairs of trimmer blades are rotated 90° relative to each other to form a rectangular shape. Each trimmer blade is capable of rapid motion in the direction perpendicular to the central beam axis by means of a linear motor, with maximum velocity and acceleration of 2.5 m/s and 19.6 m/s{sup 2}, respectively. The blades travel on curved tracks to match the divergence of the proton source. An algorithm for selecting blade positions is developed to minimize the dose delivered outside of the target, and treatment plans are created both with and without the DCS. Results: The snout of the DCS has outer dimensions of 22.6 × 22.6 cm{sup 2} and is capable of delivering a minimum treatment field size of 15 × 15 cm{sup 2}. Using currently available components, the constructed system would weigh less than 20 kg. For irregularly shaped fields, the use of the DCS reduces the mean dose outside of a 2D target of 46.6 cm{sup 2} by approximately 40% as compared to an identical plan without collimation. The use of the DCS increased treatment time by 1–3 s per energy layer. Conclusions: The spread of the lateral penumbra of low-energy SS proton treatments may be greatly reduced with the use of this system at the cost of only a small penalty in delivery time.

07 ISOTOPE AND RADIATION SOURCES↗

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗

The compressed state Kalman filter for nonlinear state estimation: Application to large-scale reservoir monitoring

Reservoir monitoring aims to provide snapshots of reservoir conditions and their uncertainties to assist operation management and risk analysis. These snapshots may contain millions of state variables, e.g., pressures and saturations, which can be estimated by assimilating data in real time using the Kalman filter (KF). However, the KF has a computational cost that scales quadratically with the number of unknowns, m, due to the cost of computing and storing the covariance and Jacobian matrices, along with their prod-ucts. The compressed state Kalman filter (CSKF) adapts the KF for solving large-scale monitoring problems. The CSKF uses N preselected orthogonal bases to compute an accurate rank-N approximation of the covari-ance that is close to the optimal spectral approximation given by SVD. The CSKF has a computational cost that scales linearly in m and uses an efficient matrix-free approach that propagates uncertainties using N + 1 forward model evaluations, where N << m. Here in this paper we present a generalized CSKF algorithm for nonlin-ear state estimation problems such as CO 2 monitoring. For simultaneous estimation of multiple types of state variables, the algorithm allows selecting bases that represent the variability of each state type. Through synthetic numerical experiments of CO 2 monitoring, we show that the CSKF can reproduce the Kal-man gain accurately even for large compression ratios (m/N). For a given computational cost, the CSKF uses a robust and flexible compression scheme that gives more reliable uncertainty estimates than the ensemble Kalman filter, which may display loss of ensemble variability leading to suboptimal uncertainty estimates.

97 MATHEMATICS AND COMPUTING↗

Practical Loop Transformations for Tensor Contraction Expressions on Multi-Level Memory Hierarchies

Modern architectures are characterized by deeper levels of memory hierarchy, often explicitly addressable. Optimizing applications for such architectures requires careful management of the data movement across all these levels. In this paper, we focus on the problem of mapping tensor contractions to memory hierarchies with more than two levels, specifically addressing placement of memory allocation and data movement statements, choice of loop fusions, and tile size selection. Existing algorithms to find an integrated solution to this problem even for two-level memory hierarchies has been shown to be expensive. We improve upon this work by focusing on the first-order cost components, simplifying the analysis required and reducing the number of candidates to be evaluated. We have evaluated our framework on a cluster of GPUs. Using five tensor contraction expressions, we show that fusion at multiple levels improves performance, and our framework is effective in determining protable transformations.

99 GENERAL AND MISCELLANEOUS↗

Modeling household online shopping demand in the U.S.: a machine learning approach and comparative investigation between 2009 and 2017

Despite the rapid growth of online shopping and research interest in the relationship between online and in-store shopping, national-level modeling and investigation of the demand for online shopping with a prediction focus remain limited in the literature. Here, this paper differs from prior work and leverages two recent releases of the U.S. National Household Travel Survey (NHTS) data for 2009 and 2017 to develop machine learning (ML) models, specifically gradient boosting machine (GBM), for predicting household-level online shopping purchases. The NHTS data allow for not only conducting nationwide investigation but also at the level of households, which is more appropriate than at the individual level given the connected consumption and shopping needs of members in a household. We follow a systematic procedure for model development including employing Recursive Feature Elimination algorithm to select input variables (features) in order to reduce the risk of model overfitting and increase model explainability. Among several ML models, GBM is found to yield the best prediction accuracy. Extensive post-modeling investigation is conducted in a comparative manner between 2009 and 2017, including quantifying the importance of each input variable in predicting online shopping demand, and characterizing value-dependent relationships between demand and the input variables. In doing so, two latest advances in machine learning techniques, namely Shapley value-based feature importance and Accumulated Local Effects plots, are adopted to overcome inherent drawbacks of the popular techniques in current ML modeling. The modeling and investigation are performed at the national level, with a number of findings obtained. The models developed and insights gained can be used for online shopping-related freight demand generation and may also be considered for evaluating the potential impact of relevant policies on online shopping demand.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Aspects of Solvers for Large-Scale Coupled Problems in Porous Media

This report summarizes solution strategies for discrete systems occurring in the simulation of processes in the subsurface. The focus is on scalable solvers for large and coupled systems. The goal of this work is to enable researchers to select suitable algorithms and parameter settings to efficiently solve their problems. The work provides an overview of existing methods, highlighting their features, potential, and also frequent pitfalls. Numerical examples are provided for single phase flow, density driven flow and poroelasticity.Aspects of multiphase flow are discussed briefly; a detailed discussion of reactive transport is beyond the scope of the article. Future trends are discussed.

97 MATHEMATICS AND COMPUTING↗

Investigations of Association Among Atmospheric Radionuclide Measurements

Large networks producing frequent atmospheric radionuclide measurements have additional power in characterizing and localizing radionuclide release events over the analysis done with four or fewer samples. However, adding unrelated samples to an analysis dilutes that advantage, unless models are extended to account for this complexity. A key steppingstone to obtaining network power is to select a group of related sample measurements that are associated with a release event. Such collections of measurements can be assembled by an analyst, or perhaps they can be selected by algorithm. The authors explore, using a year of atmospheric transport calculations and realistic sensor sensitivities, the potential for a computed radionuclide association tool.

Eslinger, Paul W.↗

Local search to improve coordinate-based task mapping

We present a local search strategy to improve the coordinate-based mapping of a parallel job’s tasks to the MPI ranks of its parallel allocation in order to reduce network congestion and the job’s communication time. The goal is to reduce the number of network hops between communicating pairs of ranks. Our target is applications with a nearest-neighbor stencil communication pattern running on mesh systems with non-contiguous processor allocation, such as Cray XE and XK Systems. Utilizing the miniGhost mini-app, which models the shock physics application CTH, we demonstrate that our strategy reduces application running time while also reducing the runtime variability. Furthermore, we further show that mapping quality can vary based on the selected allocation algorithm, even between allocation algorithms of similar apparent quality.

97 MATHEMATICS AND COMPUTING↗

Surface enrichment dictates block copolymer orientation

Orientation of block copolymer (BCP) morphology in thin films is critical to applications as nanostructured coatings. Despite being well-studied, the ability to control BCP orientation across all possible block constituents remains challenging. Here, in this study, we deploy coarse-grained molecular dynamics simulations to study diblock copolymer ordering in thin films, focusing on chain makeup, substrate surface energy, and surface tension disparity between the two constituent blocks. We explore the multi-dimensional parameter space of ordering using a machine-learning approach, where an autonomous loop using a Gaussian process (GP) control algorithm iteratively selects high-value simulations to compute. The GP kernel was engineered to capture known symmetries. The trained GP model serves as both a complete map of system response, and a robust means of extracting material knowledge. We demonstrate that the vertical orientation of BCP phases depends on several counter-balancing energetic contributions, including entropic and enthalpic material enrichment at interfaces, distortion of morphological objects through the film depth, and of course interfacial energies. BCP lamellae are found more resistant to these effects, and thus more robustly form vertical orientations across a broad range of conditions; while BCP cylinders are found to be highly sensitive to surface tension disparity.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Coordinative Real-time Sub-Transmission Volt-VAr Control for Reactive Power Regulation between Transmission and Distribution Systems

This paper introduces an integrated voltage regulation approach to coordinate the Volt-VAr control between transmission and distribution systems. Distributed photovoltaic (PV) systems are aggregated as a virtual power plant (VPP). At the sub-transmission level, a Coordinated Real-time Sub-Transmission Volt-VAr Control Tool (CReST-VCT) is introduced to coordinate the operation of the shunt devices and the reactive power provided by the VPPs. The CReST-VCT uses an enhanced Volt-VAr control algorithm with weighted voltage control objects that include minimizing losses, maintaining the voltage within desirable levels, and minimizing the number of mechanical switching of shunt elements. The algorithm runs every 5 minutes and is solved using AC optimal power flow (OPF) solution technique. The outputs include the settings for each sub-transmission-level Volt-VAr control devices and the reactive power generation requirements for each VPP. Then, each VPP will run a distribution Volt-VAr control algorithm to select the PV inverters that provide the Volt-VAr control services considering the distribution network topology. The goal of the VPP reactive power control is to meet the transmission level service requirements while maintaining the voltage and line flow in the distribution system within limits. Each VPP will update its voltage regulation capacity every 5 minutes to allow the CReST-VCT to formulate the optimization problem for the next dispatch interval. The proposed tool is simulated on Duke Energy Carolina system to demonstrate the capability of providing voltage support service by dispatching of reactive power of distributed PV as VPP.

Ke, Xinda↗

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗

Mu2e DAQ and slow control systems

The Mu2e experiment at the Fermilab Muon Campus will search for the coherent neutrinoless conversion of a muon into an electron in the feld of an aluminum nucleus with a sensitivity improvement by a factor of 10,000 over existing limits. The Mu2e Trigger and Data Acquisition System (TDAQ) uses otsdaq as the online Data Acquisition System (DAQ) solution. Developed at Fermilab, otsdaq integrates both the artdaq DAQ and the art analysis frameworks for event transfer, fltering, and processing. otsdaq is an online DAQ software suite with a focus on fexibility and scalability and provides a multiuser, web-based, interface accessible through a web browser. The data stream from the detector subsystems is read by a software flter algorithm that selects events which are combined with the data fux coming from a Cosmic Ray Veto System. The Detector Control System (DCS) has been developed using the Experimental Physics and Industrial Control System (EPICS) open source platform for monitoring, controlling, alarming, and archiving. The DCS System has been integrated into otsdaq. A prototype of the TDAQ and the DCS systems has been built at Fermilab’s Feynman Computing Center. In this paper, we report on the progress of the integration of this prototype in the online otsdaq software.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗