Search NASA⌕ Search

SEARCH · Search NASA

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Progress on a High Sensitivity, High Purity, One-Electron-One-Proton Search for the MiniBooNE Low Energy Excess in the MicroBooNE Detector

MicroBooNE is a large liquid argon time projection chamber (LArTPC) located at Fermilab. One of the experiments primary aims is to investigate the CCQE-like excess of ν ϵ events observed by MiniBooNE at low energy. A novel approach to analyzing LArTPC data using an amalgam of Deep Learning and traditional algorithms has been developed and is capable of end to end reconstruction and selection. We report here an overview and progress to event selection which yields greater than 99.999% rejection of backgrounds. Statistical, flux, and some cross section systematics have also been evaluated. Detector systematics and additional cross section systematics are still under study.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Science Validation for Dark Energy Research with Optical Imaging Surveys

The Universe has been expanding at an accelerating rate over the past several billion years, as though an unknown form of dark energy permeates all of space. The ultimate scientific goal of the proposed research is to distinguish between different physical mechanisms that could account for this observed accelerated expansion, for example, the zero-point energy of the vacuum, a dynamical form of energy that varies in time and/or space, or a modification to our theory of gravity. Wide- field optical imaging surveys of the night sky can test these competing models by measuring both the cosmic expansion history and the growth of large-scale structure. To this end, the Dark Energy Survey (DES) has cataloged several hundred million galaxies and thousands of supernovae. The Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST), will enlarge the census to billions of galaxies and hundreds of thousands of supernovae. A critical question for these dark energy experiments is whether systematic uncertainties can continue to be controlled at a level to keep pace with the statistical precision offered by such enormous datasets. The immediate research objectives of this project were (1) to prepare and validate input datasets that are the foundation of cosmological analyses with DES, and (2) to prepare for value-added characterization of Rubin Observatory commissioning data to inform early operations and accelerate the realization of dark energy science from LSST data products. For DES, we assembled and curated cosmology-ready data releases that include value-added components such as enhanced photometric and astrometric calibrations, alternative source extraction algorithms, maps of the survey coverage and survey conditions, object classifications, object quality selections, galaxy shapes, and photometric redshifts. We used the galaxy clustering technique to validate the photometric redshift distributions of various galaxy samples to be used as lenses in combined studies of galaxy clustering and weak gravitational lensing. The galaxy clustering redshift analysis was enhanced by use of a larger sample of reference galaxies from the eBOSS spectroscopic survey that extends to higher redshifts. For LSST, we prepared for science validation studies of commissioning data aimed at dark energy science capability that extend beyond the normative system-level tests to be done by the Rubin Observatory Construction Project. We identified a set of proposed survey strategies and candidate target fields that could be observed during the commissioning period to enhance science validation activities related to studies of dark energy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

An Update on Microreactor Automated Control System (MACS)

Automation of control systems is expected to be important in the economic and safe operation of microreactors. There is a need to develop and demonstrate automated control for microreactors, along with the development of testbeds for this purpose. This report provides updates on the status of a microreactor automated control system (MACS) testbed developed to test control system automation. While a future goal is to demonstrate this system using a prototypic microreactor such as MARVEL, the present focus is on developing and testing within a non-nuclear testbed. The testbed, developed in collaboration with Idaho National Laboratory, includes hardware-in-the-loop simulation and uses a Modelica-based model of a prototypic microreactor for use in testing control automation. Research to date at Oak Ridge National Laboratory has focused on the development of prototypic software for automating plant-level control under selected scenarios. Empirical testing on the integrated MACS testbed was performed to quantify key characteristics of the integrated testbed and to demonstrate the use of the software for automating the calculation and use of actuation setpoints for selected load-following scenarios. Ongoing research is focused on integrating additional control algorithms that utilize data from newly included sensors within the MACS hardware testbed, as well as demonstrating and assessing the performance of the different automated control algorithms on multiple additional operational scenarios.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms

The efficient biological production of industrially and economically important compounds is a challenging problem. Brute-force determination of the optimal pathways to efficient production of a target chemical in a chassis organism is computationally intractable. Many current methods provide a single solution to this problem, but fail to provide all optimal pathways, optional sub-optimal solutions or hybrid biological/non-biological solutions. Here we present RetSynth, software with a novel algorithm for determining all optimal biological pathways given a starting biological chassis and target chemical. By dynamically selecting constraints, the number of potential pathways scales by the number of fully independent pathways and not by the number of overall reactions or size of the metabolic network. This feature allows all optimal pathways to be determined for a large number of chemicals and for a large corpus of potential chassis organisms. Additionally, this software contains other features including the ability to collect data from metabolic repositories, perform flux balance analysis, and to view optimal pathways identified by our algorithm using a built-in visualization module. This software also identifies sub-optimal pathways and allows incorporation of non-biological chemical reactions, which may be performed after metabolic production of precursor molecules. The novel algorithm designed for RetSynth streamlines an arduous and complex process in metabolic engineering. Our stand-alone software allows the identification of candidate optimal and additional sub-optimal pathways, and provides the user with necessary ranking criteria such as target yield to decide which route to select for target production. Furthermore, the ability to incorporate non-biological reactions into the final steps allows determination of pathways to production for targets that cannot be solely produced biologically. With this comprehensive suite of features RetSynth exceeds any open-source software or webservice currently available for identifying optimal pathways for target production.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

An Adaptive Reference Scheme to Extend the Functional Range of Optical Backscatter Reflectometry in Extreme Environments

Optical frequency domain reflectometry (OFDR) measurements are performed by recording the interference pattern of light backscattered by density fluctuations or Bragg gratings along the length of an optical fiber. Changes in local temperature or strain in the fiber cause shifts in the backscattered light spectrum, which can be calibrated to the applied temperature or strain. Comparing the backscattered optical spectra from each reflection site with a reference (unstrained) spectrum allows for quantification of local spectral shifts. While mature OFDR-based technologies can provide high-precision spatially distributed measurements over kilometer lengths, the post-processing approaches used to recover spectral shifts from raw optical intensity data can limit the use of OFDR in harsh environments. This paper presents a novel approach to post-processing OFDR data which extends the usability of optical fibers exposed to harsh environments. This approach is the first to use the spectral shift quality, calculated for two OFDR measurements, to identify an appropriate reference scan from which the spectral shift can be determined. Here, three experimental data sets are used to test the algorithm: (1) an optical fiber heated to >950°C, (2) an aluminum-embedded optical fiber under strain from differential thermal expansion, and (3) an optical fiber exposed to a total neutron flux of 2×10 13 n/cm 2 /s over 40 hours in a nuclear test reactor. Results show that using a metric of quality to select an appropriate reference measurement extends the functional range of OFDR strain and temperature sensors. Furthermore, this algorithm can be applied to existing OFDR data.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Development of a pattern recognition algorithm for reconstructing multi-particle events in the Mu2e detector

Mu2e is an upcoming experiment at Fermilab and its main goal is to search for the Charged Lepton Flavor Violation (CLFV) in the coherent transition of a muon into an electron on an Al target. In Mu2e, multi-particle events can occur simultaneously within the same time region and it is crucial to accurately identify each particle track, including signals, to improve the robustness of track finding methods and enhance reconstruction efficiency. ¯p annihilation is one of the background events and produces multiple particles that can mimic signal events. Additionally, photons from radiative pion captures can produce a γ → $e+e−$ pair, which can be used to calibrate the Mu2e momentum scale and the resolution. The Mu2e track reconstruction sequence begins by grouping hits produced in the tracker based on time and z coordinate information, called TimeCluster, and selected hits are processed to reconstruct helices and determine their momentum. The current pattern recognition algorithms identify a single helix per TimeCluster for single track events. A new pattern recognition algorithm is being developed to reconstruct multi-particle events and its features for finding multiple tracks and the current evaluation results are reported.

Kitagawa, H. [Pisa U.]↗
DOE OSTI2023

Online Adaptive Algorithm for Constraint Energy Minimizing Generalized Multiscale Discontinuous Galerkin Method

Here in this research, we propose an online basis enrichment strategy within the framework of a recently developed constraint energy minimizing generalized multiscale discontinuous Galerkin method. Combining the technique of oversampling, one makes use of the information of the current residuals to adaptively construct basis functions in the online stage to reduce the error of multiscale approximation. A complete analysis of the method is presented, which shows the proposed online enrichment leads to a fast convergence from multiscale approximation to the fine-scale solution. The error reduction can be made sufficiently large by suitably selecting oversampling regions and the number of oversampling layers. Further, the convergence rate of the enrichment algorithm depends on a factor of exponential decay regarding the number of oversampling layers and a user-defined parameter. Numerical results are provided to demonstrate the effectiveness and efficiency of the proposed online adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Q4Q: Quantum Computation for Quantum Prediction of Materials and Molecular Properties

We aim at exploring the potential of quantum computation to solve practical problems that are currently targeted by “traditional” high performance computing (HPC). Along the way, we will develop theoretical frameworks and algorithmic strategies. We propose computational research activities that will advance the application of quantum computers to selected materials/molecular properties: (1) Band structure of solids; (2) Molecular electronic/vibronic properties; (3) Free energies and phase transitions.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Exact and efficient hybrid Monte Carlo algorithm for accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

Single cells exhibit a significant amount of variability in transcript levels, which arises from slow, stochastic transitions between gene expression states. Elucidating the nature of these states and understanding how transition rates are affected by different regulatory mechanisms require state-of-the-art methods to infer underlying models of gene expression from single cell data. A Bayesian approach to statistical inference is the most suitable method for model selection and uncertainty quantification of kinetic parameters using small data sets. However, this approach is impractical because current algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piecewise deterministic Markov process. Here, we combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We demonstrate that kinetic parameters can be reasonably constrained for modestly sampled data sets if the model is known a priori. If there are many competing models, Bayesian evidence can rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics typically used for model selection.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Comparative Approach of MRI-Based Brain Tumor Segmentation and Classification Using Genetic Algorithm

The detection of a brain tumor and its classification from modern imaging modalities is a primary concern, but a time-consuming and tedious work was performed by radiologists or clinical supervisors. The accuracy of detection and classification of tumor stages performed by radiologists is depended on their experience only, so the computer-aided technology is very important to aid with the diagnosis accuracy. In this study, to improve the performance of tumor detection, we investigated comparative approach of different segmentation techniques and selected the best one by comparing their segmentation score. Further, to improve the classification accuracy, the genetic algorithm is employed for the automatic classification of tumor stage. The decision of classification stage is supported by extracting relevant features and area calculation. The experimental results of proposed technique are evaluated and validated for performance and quality analysis on magnetic resonance brain images, based on segmentation score, accuracy, sensitivity, specificity, and dice similarity index coefficient. The experimental results achieved 92.03% accuracy, 91.42% specificity, 92.36% sensitivity, and an average segmentation score between 0.82 and 0.93 demonstrating the effectiveness of the proposed technique for identifying normal and abnormal tissues from brain MR images. The experimental results also obtained an average of 93.79% dice similarity index coefficient, which indicates better overlap between the automated extracted tumor regions with manually extracted tumor region by radiologists.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2019

Studies of Front-End Electronics for High-Precision Timing Measurements with LGADs [Poster]

In Time-of-Arrival (ToA) measurements, simulations can be used to optimize precision detection and implementation methods of front-end electronics. The simulation tested in this project takes the response of a filter (in the s-domain) from a noisy input current signal from the detector, an LGAD (Low-Gain Avalanche Diode), and uses a threshold to determine the ToA value for the signal. Measuring the ToA values for a large sample of events and comparing them to a reference statistically produces the timing precision of the simulation. Here, the sub-algorithm to model LGAD events with piecewise linear (PWL) approximations (for more efficient Laplace transforms) was optimized. Using the Fourier Discrete Cosine Transform, 25 points could be selected to describe the primary behavior of the signal. Results showed that timing precision is on par with previous methods. We also found that the new algorithm is faster and equally consistent in producing accurate PWL approximations. Testi ng with larger samples is required to fully verify the new algorithm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Deployment of inference as a service at the US CMS Tier-2 data centers

Coprocessors, especially GPUs, will be a vital ingredient of data production workflows at the HL-LHC. At CMS, the GPU-as-a-service approach for production workflows is implemented by the SONIC project (Services for Optimized Network Inference on Coprocessors). SONIC provides a mechanism for outsourcing computationally demanding algorithms, such as neural network inference, to remote servers, where requests from multiple clients are intelligently distributed across multiple GPUs by a load-balancing service. This talk highlights the recent progress in deploying SONIC at selected U.S. CMS Tier-2 data centers. Using realistic CMS Run3 data processing workflows, such as those containing transformer-based algorithms, we demonstrate how SONIC is integrated into the production-like environment to enable accelerated inference offloading. We will present developments from both the client and server sides, including production job and data center configurations for NVIDIA and AMD GPUs. We will also present performance scaling benchmarks and discuss the challenges of operating SONIC in CMS production, such as server discovery, GPU saturation, fallback server logic, etc.

Holzman, Burt↗
DOE OSTI2024

Performance of Heterogeneous Algorithm Scheduling in CMSSW

The CMS experiment started to utilize Graphics Processing Units (GPU) to accelerate the online reconstruction and event selection running on its High Level Trigger (HLT) farm in the 2022 data taking period. The projections of the HLT farm to the High-Luminosity LHC foresee a significant use of compute accelerators in the LHC Run 4 and onwards in order to keep the cost, size, and power budget of the farm under control. This direction of leveraging compute accelerators has synergies with the increasing use of HPC resources in HEP computing, as HPC machines are employing more and more compute accelerators that are predominantly GPUs today. In this work we review the features developed for the CMS data processing framework, CMSSW, to support the effective utilization of both compute accelerators and many-core CPUs within a highly concurrent task-based framework. We measure the impact of various design choices for the scheduling of heterogeneous algorithms on the event processing throughput, using the Run-3 HLT application as a realistic use case.

Bocci, Andrea↗
DOE OSTI2021

Seeking Echoes of Circumstellar Disks in Kepler Light Curves

Light echoes of flares on active stars offer the opportunity for direct detection of circumstellar dust. We revisit the problem of identifying faint echoes in postflare light curves, focusing on debris disks from ongoing planet formation. Starting with simulations, we develop an algorithm for estimating the radial extent and total mass from disk echo profiles. We apply this algorithm to light curves from over 2100 stars observed by NASA’s Kepler mission, selected for multiple short-lived flares in either the long-cadence or short-cadence data sets. While flux uncertainties in light curves from individual stars preclude useful mass limits on circumstellar disks, catalog-averaged light curves yield constraints on disk mass that are comparable to estimates from known debris disks. The average mass in micron- to millimeter-sized dust around the Kepler stars cannot exceed 10% of an Earth mass in exo-Kuiper belts or 10% of a lunar mass in the terrestrial zone. We group stars according to IR excess, based on WISE W1–W3 color, as an indicator for the presence of circumstellar dust. The mass limits are greater for stars with strong IR excess, a hint that echoes are lurking not far beneath the noise in postflare light curves. With increased sensitivity, echo detection will let time-domain astronomy complement spectroscopic and direct-imaging studies in mapping how, when, and where planets form.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Application of deep learning methods for beam size control during user operation at the Advanced Light Source

Past research at the Advanced Light Source (ALS) provided a proof-of-principle demonstration that deep learning methods could be effectively employed to compensate for the significant perturbations to the transverse electron beam size induced by user-controlled adjustments of the insertion devices. However, incorporating these methods into the ALS’ daily operations has faced notable challenges. The complexity of the system’s operational requirements and the significant upkeep demands has restricted their sustained application during user operation. Here, we introduce the development of a more robust neural network (NN)-based algorithm that utilizes a novel online fine-tuning approach and its systematic integration into the day-to-day machine operations. Our analysis emphasizes the process of NN model selection, demonstrates the superior performance of the NN-based method over traditional feedback methods, and examines the effectiveness and resilience of the new algorithm during user-operation scenarios. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Mapping Geothermal Indicator Minerals Using Fusion of Target Detection Algorithms

Mineral mapping from satellite images provides valuable insights into subsurface mineral alteration for geothermal exploration. In previous studies, eight fundamental algorithms were used for mineral mapping utilizing USGS spectra, a collection of reflectance spectra containing samples of minerals, rocks, and soils created by the USGS. We used an ASD FieldSpec 4 Hi-RES NG portable spectrometer to collect spectra for analyzing ASTER images of the Coso Geothermal Field. Then, we established the ground-truth information and the spectral library by analyzing 97 samples. Samples collected from the field were analyzed using the CSIRO TSG (The Spectral Geologist of the Commonwealth Scientific and Industrial Research Organization). Based on the mineralogy study, multiple high-purity spectra of geothermal alteration minerals were selected from collected data, including alunite, chalcedony, hematite, kaolinite, and opal. Eight mineral spectral target detection algorithms were applied to the preprocessed satellite data with a proposed local spectral library. We measured the highest overall accuracy of 87% for alunite, 95% for opal, 83% for chalcedony, 60% for hematite, and 96% for kaolinite out of these eight algorithms. Three, four, five, and eight algorithms were fused to extract mineral alteration with the obtained target detection results. The results prove that the fusion of algorithms gives better results than using individual ones. In conclusion, this paper discusses the significance of evaluating different mapping algorithms. It proposes a robust fusion approach to extract mineral maps as an indicator for geothermal exploration.

Cavur, Mahmut↗