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 829 records · Page 46

Quantum Adiabatic Algorithms and Large Spin Tunnelling

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.

Boulatov, A.↗

The XMM cluster survey: exploring scaling relations and completeness of the dark energy survey year 3 redMaPPer cluster catalogue

ABSTRACT We cross-match and compare characteristics of galaxy clusters identified in observations from two sky surveys using two completely different techniques. One sample is optically selected from the analysis of 3 years of Dark Energy Survey observations using the redMaPPer cluster detection algorithm. The second is X-ray selected from XMM observations analysed by the XMM Cluster Survey. The samples comprise a total area of 57.4 deg2, bounded by the area of four contiguous XMM survey regions that overlap the DES footprint. We find that the X-ray-selected sample is fully matched with entries in the redMaPPer catalogue, above λ > 20 and within 0.1 <$z$ <0.9. Conversely, only 38 per cent of the redMaPPer catalogue is matched to an X-ray extended source. Next, using 120 optically clusters and 184 X-ray-selected clusters, we investigate the form of the X-ray luminosity–temperature (LX –TX ), luminosity–richness (LX –λ), and temperature–richness (TX –λ) scaling relations. We find that the fitted forms of the LX –TX relations are consistent between the two selection methods and also with other studies in the literature. However, we find tentative evidence for a steepening of the slope of the relation for low richness systems in the X-ray-selected sample. When considering the scaling of richness with X-ray properties, we again find consistency in the relations (i.e. LX –λ and TX –λ) between the optical and X-ray-selected samples. This is contrary to previous similar works that find a significant increase in the scatter of the luminosity scaling relation for X-ray-selected samples compared to optically selected samples.

79 ASTRONOMY AND ASTROPHYSICS↗

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

Optimal Stop Word Selection for Text Mining in Critical Infrastructure Domain

Eliminating all stop words from the feature space is a standard practice of preprocessing in text mining, regardless of the domain which it is applied to. However, this may result in loss of important information, which adversely affects the accuracy of the text mining algorithm. Therefore, this paper proposes a novel methodology for selecting the optimal set of domain specific stop words for improved text mining accuracy. First, the presented methodology retains all the stop words in the text preprocessing phase. Then, an evolutionary technique is used to extract the optimal set of stop words that result in the best classification accuracy. The presented methodology was implemented on a corpus of open source news articles related to critical infrastructure hazards. The first step of mining geo-dependencies among critical infrastructures from text is text classification. In order to achieve this, article content was classified into two classes: 1) text content with geo-location information, and 2) text content without geo-location information. Classification accuracy presented methodology was compared to accuracies of four other test cases. Experimental results with 10-fold cross validation showed that the presented method yielded an increase of 1.76% or higher in True Positive (TP) rate and a 2.27% or higher increase in the True Negative (TN) rate compared to the other techniques.

97 MATHEMATICS AND COMPUTING↗

Sustainable network design for multi-purpose pellet processing depots under biomass supply uncertainty

This work develops a two-stage stochastic mixed-integer programming model to manage multi- purpose pellet processing depots under feedstock supply uncertainty. The proposed optimization model would help to minimize cost and to mitigate emissions from the supply chain network. We consider three alternative Biomass Processing and Densi cation Depot (BPDD) technologies; namely, conventional pellet processing, high moisture pellet processing, and ammonia ber expansion. These three technologies pre-process/pre-treat and densify different types of biomass into more highly densi ed intermediate products for different markets in order to improve movability and overall supply network performance in terms of costs and emissions. A hybrid decomposition algorithm was developed that combines sample average approximation with an enhanced Progressive Hedging (PH) algorithm to solve this challenging NP -hard problem. Some heuristics such as Rolling Horizon (RH) heuristic, variable xing technique were later applied to further enhance the PH algorithm. Mississippi and Alabama were selected as a testing ground and ArcGIS was employed to visualize and validate the modeling results. The results of the analysis reveal promising insights that could lead to recommendations to help decision makers achieve a more cost-effective environmentally-friendly supply chain network.

09 BIOMASS FUELS↗

Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers

Flooding events pose significant risk to human life, property, and infrastructure. Physically-consistent quantification of altered flood risks in global models requires hyper-resolution (~1 km) or fine flood simulations using two-dimensional (2D) physics schemes, both of which are unavailable in the current generation Earth System Models. Here, in this work, we have developed the River Dynamical Core (RDycore), which is an open-source, 2D shallow water equation (SWE) library for the U.S. Department of Energy's Energy Exascale Earth System Model (E3SM). RDycore uses PETSc and libCEED libraries that allows it to run efficiently on CPUs and GPUs, as well as select a time-integration algorithm at runtime without requiring any code modifications. RDycore achieves spatial error convergence rates for problems with analytical and manufactured solutions similar to those reported previously in the literature, or consistent with the implemented first-order spatial discretization scheme. RDycore's accuracy in predicting flooding for a well-studied dam break problem is comparable to existing SWE models. For a problem with 471 million grid cells, RDycore achieves a speedup of 6.6x and 7.6x on GPUs compared to CPUs when using 320 compute nodes on DOE's Perlmutter and Frontier supercomputers, respectively. The one-way coupling of the RDycore library within E3SM is demonstrated by performing multiple 5-day flooding simulations during Hurricane Harvey driven by five precipitation datasets. The E3SM--RDycore simulations at 30 m spatial resolution accurately simulate maximum water height during the hurricane when benchmarked against a previously published study and achieve a speedup of 15x (Perlmutter) and 21x (Frontier) on GPUs relative to CPUs. The work presented here is the foundational step in providing hardware and algorithmic portability framework for simulating kilometer-scale river dynamics within E3SM.

Flood Simulation↗

Machine Learning Analysis of Direct Dynamics Trajectory Outcomes for Thermal Deazetization of 2,3-Diazabicyclo[2.2.1]hept-2-ene

Experimentally, the thermal gas-phase deazetization of 2,3-diazabicyclo[2.2.1]hept-2-ene (1) results in the loss of N2 and the formation of bicyclo products 3 (exo) and 4 (endo) in a nonstatistical ratio, with preference for the exo product. Here, we report unrestricted M06-2X quasiclassical trajectories initialized from the concerted N2 ejection transition state that were able to replicate the experimental preference to form 3. We found that the 3:4 ratio results from the relative amounts of very fast (ballistic) exotype trajectories versus trajectories that lead to the 1,3-diradical intermediate 2. These quasiclassical trajectories provided a set of transition-state vibrational, velocity, momenta, and geometric features for the machine learning analysis. Additionally, a selection of popular supervised classification algorithms (e.g., random forest) provided poor prediction of trajectory outcomes based on only transition-state vibrational quanta and energy features. However, these machine learning models provided more accurate predictions using atomic velocities and atomic positions, attaining ~70% accuracy using initial conditions and between 85 and 95% accuracy at later reaction time steps. This increased accuracy allowed the feature importance analysis to reveal that, at the later-time analysis, the methylene bridge out-of-plane bending is correlated with trajectory outcomes for the formation of either the exo product or toward the diradical intermediate. Possible reasons for the struggle of machine learning algorithms to classify trajectories based on transition-state features is the heavily overlapping feature values, the finite but very large possible vibrational mode combinations, and the possibility of chaos as trajectories propagate. We examined this chaos by comparing a set of nearly identical trajectories that differed by only a very small scaling of the kinetic energies resulting from the transition-state reaction coordinate.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Convergence of halo statistics: code comparison between rockstar and compaso using scale-free simulations

ABSTRACT In this study, we perform a halo-finder code comparison between rockstar and compaso. Based on our previous analysis aiming at quantifying resolution of N-body simulations by exploiting large (up to N = 40963) simulations of scale-free cosmologies run using abacus, we focus on convergence of the halo mass function, two-point correlation function, and mean radial pairwise velocities of halo centres selected with the aforementioned two algorithms. We establish convergence, for both rockstar and compaso, of mass functions at the 1 per cent precision level and of the mean pairwise velocities (and also two-point correlation function) at the 2 per cent level. At small scales and masses, we find that rockstar exhibits greater self-similarity. We also highlight the role played by the merger-tree post-processing of compaso haloes on their convergence. Finally, we give resolution limits expressed as a minimum particle number per halo in a form that can be directly extrapolated to Lambda cold dark matter.

Astronomy & Astrophysics↗

Observation of 𝑡⁢𝑊⁢𝑍 Production at the CMS Experiment

The first observation of single top quark production in association with a 𝑊 and a 𝑍 boson in proton-proton collisions is reported. The analysis uses data at center-of-mass energies of 13 and 13.6 TeV recorded with the CMS detector at the CERN LHC, corresponding to a total integrated luminosity of 200 fb −1 . Events with three or four charged leptons, which can be electrons or muons, are selected. Advanced machine-learning algorithms and improved reconstruction methods, compared to an earlier analysis, result in an unprecedented sensitivity to 𝑡⁢𝑊⁢𝑍 production. The measured cross sections for 𝑡⁢𝑊⁢𝑍 production are 248 ± 52 fb and 242 ± 77 fb for $\sqrt{s}$ =13 and 13.6 TeV, respectively. The signal is established with a statistical significance of 5.8 standard deviations, with 3.5 expected, compared to the background-only hypothesis.

Hayrapetyan, Aram [Yerevan Physics Institute]↗

Active learning emulators for nuclear two-body scattering in momentum space

In this work we extend the active learning emulators for two-body scattering in coordinate space with error estimation, recently developed by Maldonado et al. [Phys. Rev. C 112, 024002], to coupled-channel scattering in momentum space. Our full-order model (FOM) solver is based on the Lippmann-Schwinger integral equation for the scattering t-matrix as opposed to the radial Schrödinger equation. We use (Petrov-)Galerkin projections and high-fidelity calculations at a few snapshots across the parameter space of the interaction to construct efficient reduced-order models (ROMs), trained by a greedy algorithm for locally optimal snapshot selection. Both the FOM solver and the corresponding ROMs are implemented efficiently in Python using Google's JAX library. We present results for emulating scattering phase shifts in coupled and uncoupled channels and cross sections, and assess the accuracy of the developed ROMs and their computational speedup factors. We also develop emulator error estimation for both the t-matrix and the total cross section. The software framework for reproducing and extending our results is publicly available. Together with our recent advances in developing active-learning emulators for three-body scattering, these emulator frameworks set the stage for full Bayesian calibrations of chiral nuclear interactions and optical models against scattering data with quantified emulator errors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Architecture and Implementation of OpenPET Firmware and Embedded Software

OpenPET is an open source, modular, extendible, and high-performance platform suitable for multi-channel data acquisition and analysis. Due to the versatility of the hardware, firmware, and software architectures, the platform is capable of interfacing with a wide variety of detector modules not only in medical imaging but also in homeland security applications. Analog signals from radiation detectors share similar characteristics-a pulse whose area is proportional to the deposited energy and whose leading edge is used to extract a timing signal. As a result, a generic design method of the platform is adopted for the hardware, firmware, and software architectures and implementations. The analog front-end is hosted on a module called a Detector Board, where each board can filter, combine, timestamp, and process multiple channels independently. The processed data is formatted and sent through a backplane bus to a module called Support Board, where 1 Support Board can host up to eight Detector Board modules. The data in the Support Board, coming from 8 Detector Board modules, can be aggregated or correlated (if needed) depending on the algorithm implemented or runtime mode selected. It is then sent out to a computer workstation for further processing. The number of channels (detector modules), to be processed, mandates the overall OpenPET System Configuration, which is designed to handle up to 1,024 channels using 16-channel Detector Boards in the Standard System Configuration and 16,384 channels using 32-channel Detector Boards in the Large System Configuration.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Simultaneous beam sampling and aperture shape optimization for SPORT

Purpose: Station parameter optimized radiation therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital linear accelerators, in which the station parameters of a delivery system, such as aperture shape and weight, couch position/angle, gantry/collimator angle, can be optimized simultaneously. SPORT promises to deliver remarkable radiation dose distributions in an efficient manner, yet there exists no optimization algorithm for its implementation. The purpose of this work is to develop an algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: The authors build a mathematical model with the fundamental station point parameters as the decision variables. To solve the resulting large-scale optimization problem, the authors devise an effective algorithm by integrating three advanced optimization techniques: column generation, subgradient method, and pattern search. Column generation adds the most beneficial stations sequentially until the plan quality improvement saturates and provides a good starting point for the subsequent optimization. It also adds the new stations during the algorithm if beneficial. For each update resulted from column generation, the subgradient method improves the selected stations locally by reshaping the apertures and updating the beam angles toward a descent subgradient direction. The algorithm continues to improve the selected stations locally and globally by a pattern search algorithm to explore the part of search space not reachable by the subgradient method. By combining these three techniques together, all plausible combinations of station parameters are searched efficiently to yield the optimal solution. Results: A SPORT optimization framework with seamlessly integration of three complementary algorithms, column generation, subgradient method, and pattern search, was established. The proposed technique was applied to two previously treated clinical cases: a head and neck and a prostate case. It significantly improved the target conformality and at the same time critical structure sparing compared with conventional intensity modulated radiation therapy (IMRT). In the head and neck case, for example, the average PTV coverage D99% for two PTVs, cord and brainstem max doses, and right parotid gland mean dose were improved, respectively, by about 7%, 37%, 12%, and 16%. Conclusions: The proposed method automatically determines the number of the stations required to generate a satisfactory plan and optimizes simultaneously the involved station parameters, leading to improved quality of the resultant treatment plans as compared with the conventional IMRT plans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TH-EF-BRB-03: Significant Cord and Esophagus Dose Reduction by 4π Non-Coplanar Spine Stereotactic Body Radiation Therapy and Stereotactic Radiosurgery

Purpose: To demonstrate significant organ-at-risk (OAR) sparing achievable with 4π non-coplanar radiotherapy on spine SBRT and SRS patients. Methods: Twenty-five stereotactic spine cases previously treated with VMAT (n = 23) or IMRT (n = 2) were included in this study. A computer-aided-design model of a Linac with a 3D-scanned human surface was utilized to determine the feasible beam space throughout the 4π steradian and beam specific source-to-target-distances (STD) required for collision avoidance. 4π radiotherapy plans integrating beam orientation and fluence map optimization were then created using a column-generation algorithm. Twenty optimal beams were selected for each case. To evaluate the tradeoff between dosimetric benefit and treatment complexity, 4π plans including only isocentrically deliverable beams were also created. Beam angles of all standard and isocentric 4π plans were imported into Eclipse to recalculate the dose using the same calculation engine as the clinical plans for unbiased comparison. OAR and PTV dose statistics for the clinical, standard-4π, and isocentric-4π plans were compared. Results: Comparing standard-4π to clinical plans, particularly significant average percent reduction in the [mean, maximum] dose of the cord and esophagus of [41%, 21.7%], and [38.7%, 36.4%] was observed, along with global decrease in all other OAR dose statistics. The average cord volume receiving more than 50% prescription dose was substantially decreased by 76%. In addition, improved PTV coverage was demonstrated with a maximum dose reduction of 0.93% and 1.66% increase in homogeneity index (D95/D5). All isocentric-4π plans achieved dosimetric performance equivalent to that of the standard-4π plans with higher delivery complexity. Conclusion: 4π radiotherapy significantly improves stereotactic spine treatment dosimetry. With the substantial OAR dose sparing, PTV dose escalation is considerably safer. Isocentric-4π is sufficient to achieve the dosimetric gain. The successful implementation of 4π using an FDA approved planning system paves the way for a prospective clinical trial. Varian Medical Systems, NIH R43CA183390 and R01CA188300, NSF graduate research fellowship DGE-1144087.

60 APPLIED LIFE SCIENCES↗

Predicting 2CS protein pairs with Deep Learning

Neural network was trained on the amino acid sequences of known two-component systems (2CS) pairs. The recommender algorithm uses learned model to select the most likely 2CS pair from an arbitrary set of protein pairs whose amino acid sequences are known.

Balewski, Jan↗

Machine Learning Approach for Spatiotemporal Multivariate Optimization of Environmental Monitoring Sensor Locations

Abstract Long-term environmental monitoring is critical for managing the soil and groundwater at contaminated sites. Recent improvements in state-of-the-art sensor technology, communication networks, and artificial intelligence have created opportunities to modernize this monitoring activity for automated, fast, robust, and predictive monitoring. In such modernization, it is required that sensor locations be optimized to capture the spatiotemporal dynamics of all monitoring variables as well as to make it cost-effective. The legacy monitoring datasets of the target area are important to perform this optimization. In this study, we have developed a machine-learning approach to optimize sensor locations for soil and groundwater monitoring based on ensemble supervised learning and majority voting. For spatial optimization, Gaussian process regression (GPR) is used for spatial interpolation, while the majority voting is applied to accommodate the multivariate temporal dimension. Results show that the algorithms significantly outperform the random selection of the sensor locations for predictive spatiotemporal interpolation. While the method has been applied to a four-dimensional dataset (with two-dimensional space, time, and multiple contaminants), we anticipate that it can be generalizable to higher-dimensional datasets for environmental monitoring sensor location optimization.

Siddiquee, Masudur R.↗

UNRAVEL: A Robust Modular Velocity Dealiasing Technique for Doppler Radar

Unfold Radar Velocity (UNRAVEL) is an open-source modular Doppler velocity dealiasing algorithm for weather radars. UNRAVEL is an algorithm that does not need external reference velocity data, making it easily applicable. The proposed algorithm includes 11 core modules and 2 dealiasing strategies. UNRAVEL is an iterative algorithm. The goal is to build the dealiasing results starting with the strictest possible continuity tests in azimuth and range and, after each step, relaxing the parameters to include more results from a progressively growing number of reference points. UNRAVEL also has modules that perform 3D continuity checks. Thanks to this modular design, the number of dealiasing strategies can be expanded in order to optimize the dealiasing results. While the first driver dealiases Doppler velocity from each tilt independently from one another, the second driver also performs a three-dimensional continuity check of the velocity using successive elevations. The proposed dealiasing algorithm is tested using severe weather data from an S-band Doppler radar that have been aliased to mimic aliased radial velocity patterns that would be observed by a C-band Doppler radar. Artificially aliasing S-band data permits creation of a reference to which the performance of various dealiasing techniques can be compared. Comparisons show that UNRAVEL consistently outperforms other established dealiasing algorithms for the test period selected in this work.

47 OTHER INSTRUMENTATION↗

Matilda v1.0: An R package for probabilistic climate projections using a reduced complexity climate model

A primary advantage to using reduced complexity climate models (RCMs) has been their ability to quickly conduct probabilistic climate projections, a key component of uncertainty quantification in many impact studies and multisector systems. Providing frameworks for such analyses has been a target of several RCMs used in studies of the future co-evolution of the human and Earth systems. In this paper, we present Matilda, an open-science R software package that facilitates probabilistic climate projection analysis, implemented here using the Hector simple climate model in a seamless and easily applied framework. The primary goal of Matilda is to provide the user with a turn-key method to build parameter sets from literature-based prior distributions, run Hector iteratively to produce perturbed parameter ensembles (PPEs), weight ensembles for realism against observed historical climate data, and compute probabilistic projections for different climate variables. This workflow gives the user the ability to explore viable parameter space and propagate uncertainty to model ensembles with just a few lines of code. The package provides significant freedom to select different scoring criteria and algorithms to weight ensemble members, as well as the flexibility to implement custom criteria. Additionally, the architecture of the package simplifies the process of building and analyzing PPEs without requiring significant programming expertise, to accommodate diverse use cases. We present a case study that provides illustrative results of a probabilistic analysis of mean global surface temperature as an example of the software application.

54 ENVIRONMENTAL SCIENCES↗

Application of Sequential Design of Experiments (SDoE) to Large Pilot-Scale Solvent-Based CO2 Capture Process at Technology Centre Mongstad (TCM)

The United States Department of Energy’s Carbon Capture Simulation for Industry Impact (CCSI2) program has developed a framework for sequential design of experiments (SDoE) that aims to maximize knowledge gained from budget- and schedule-limited pilot scale testing. SDoE was applied to the planning and execution of campaigns for testing CO2 capture systems at pilot-scale in order to optimally allocate resources available for the testing. In this methodology, a stochastic process model is developed by quantifying the parametric uncertainty in submodels of interest; for a solvent-based CO2 capture system, these may include physical properties and equipment performance submodels (e.g., mass transfer, interfacial area). This uncertainty is propagated through the full process model, over variable operating conditions, for estimating the resulting uncertainty in key model outputs (e.g., percentage of CO2 capture, solvent regeneration energy requirement). In developing a data collection plan, the predicted output uncertainty is incorporated into an algorithm that seeks simultaneously to select process operating conditions for which the predicted uncertainty is relatively high and to ensure that the entire space of operation is well represented. This test plan is then used to guide operation of the pilot plant at varying steady-state conditions, with resulting process data incorporated into the existing model using Bayesian inference to refine parameter distributions. The updated stochastic model, with reduced parametric uncertainty from data collected, is then used to guide additional data collection, thus the sequential nature of the experimental design. The SDoE process was implemented at the pilot test unit (12 MWe in scale) at Norway’s Technology Centre Mongstad (TCM) in a summer 2018 test campaign with aqueous monoethanolamine (MEA). During the test campaign, the varied operating conditions included the flowrates of circulated solvent, flue gas, and reboiler steam and the CO2 concentration in the flue gas. The process data were used to update probability distributions of mass transfer and interfacial area parameters of a stochastic process model developed by the CCSI2 team. Two iterations of the SDoE process were executed, resulting in the uncertainty in model predicted CO2 capture percentage decreasing by an average of 58.0 ± 4.7% over the full input space of interest. This work demonstrates the potential of the SDoE process for model refinement through reduction in process model parametric uncertainty, and ultimately risk in scale-up, in CO2 capture technology performance.

carbon capture↗