Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm”

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,369 records · Page 76

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Comparison of source-location algorithms for atmospheric samplers

Numerous algorithms have been developed to determine the source characteristics for an atmospheric release, e.g., (Bieringer et al., 2017). This study compares three models that have been applied to the data collected by the International Monitoring System operated by the Comprehensive Nuclear-Test-Ban Treaty Preparatory Commission to estimate source event parameters. Each model uses a different approach to estimate the parameters. A deterministic model uses a possible source region (PSR) approach (Ringbom et al., 2014) that is based on the correlation between predicted and measured sample values. An unnamed model developed at Pacific Northwest National Laboratory (herein called BAYEST) uses a Bayesian formulation (Eslinger et al., 2019; Eslinger et al., 2020; Eslinger and Schrom, 2016). The FREAR model uses a different Bayesian formulation (De Meutter and Hoffman, 2020; De Meutter et al., 2021; Pieter De Meutter, 2021). The performance of the three source-location models is evaluated with 100 synthetic release cases for the single xenon isotope, 133 Xe. The release cases resulted in detections in a fictitious network with 120 noble gas samplers. All three source-location models use the same sampling data. The two Bayesian models yield more accurate location estimates than the deterministic PSR model, with FREAR having slightly better location performance than BAYEST. Samplers with collection periods of 3, 6, 8, 12, and 24-h were used. Results from BAYEST show that location accuracy improves with each reduction in sample collection length. The BAYEST model is slightly better for estimating the start time of the release. The PSR model has about the same spread in start times as the FREAR model, but the PSR results have a better average start time. The Bayesian source-location algorithms give more accurate results than the PSR approach, and provide release magnitude estimates, while the base PSR model does not estimate the release magnitude. This investigation demonstrates that a reasonably dense sampling grid will sometimes yield poor location and time estimates regardless of the model. The poor estimates generally coincide with cases where there is a much larger distance between the release point and the first detecting sampler than the average sampler spacing.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

The Global LAnd Surface Satellite (GLASS) evapotranspiration product Version 5.0: Algorithm development and preliminary validation

An accurate estimation of spatially and temporally continuous global terrestrial evapotranspiration (ET) is essential in the assessment of surface energy, water and carbon cycles. The Global LAnd Surface Satellite (GLASS) ET product Version 4.0 (v4.0) based on the Bayesian model averaging (BMA) method was generated to estimate global terrestrial ET. However, certain uncertainty for the GLASS ET product v4.0 limits its application. In this study, we introduced the deep neural networks (DNN) merging framework to improve terrestrial ET estimation for GLASS ET product Version 5.0 (v5.0) generation by integrating five satellite-derived ET products [Moderate Resolution Imaging Spectroradiometer (MODIS) ET product (MOD16), Shuttleworth–Wallace dual-source ET product (SW), Priestley–Taylor-based ET product (PT-JPL), modified satellite-based Priestley–Taylor ET product (MS-PT) and simple hybrid ET product (SIM)]. We compared the performance of DNN method against other merging methods, including GLASS ET algorithm v4.0 (BMA), the gradient boosting regression tree (GBRT) method and the random forest (RF) method, based on 195 global eddy covariance (EC) flux towers covering observations from 2000 through 2015. Validations indicated that the DNN had the highest accuracy among four merging methods across different land cover types, yielding the highest average determination coefficients (R 2 , 0.62), root-mean-squared-error (RMSE, 24.1 W/m 2 ) and Kling–Gupta efficiency (KGE, 0.77) with a of 99% confidence interval. Compared with GLASS ET algorithm v4.0, the DNN improved on the R 2 by approximately 7% (p < 0.01) and the KGE by 10%. Based on the DNN, we then generated 8-day GLASS ET product v5.0 globally with a 1 km spatial resolution from 2001 to 2015 driven by GLASS vegetation and surface net radiation (R n ) datasets and Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA2) datasets. Finally, this global terrestrial ET product provides a valuable dataset for monitoring regional and global water resources and environmental changes.

54 ENVIRONMENTAL SCIENCES↗

Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization

On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.

36 MATERIALS SCIENCE↗

Algorithms of pulse shape analysis for Gammasphere under high count rate conditions

The implementation of digital electronics for the multi-detector Gammasphere array has provided an opportunity to perform experiments which exceed the technical capabilities of its analog counterpart. The pulse shape analysis of HPGe detectors is presented for the purpose of determining the γ-ray energy under high-counting rates and short integration times with the aim of improving the data throughput. A revised trapezoidal algorithm is delineated which is able to determine the γ-ray energies during the offline analysis without being constrained by predetermined parameters. The performance of this algorithm is discussed, and compared with that of the analog system. The measured energy resolution meets expectations for operations with high-counting rates and short integration times.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of the performance of event reconstruction algorithms in the JSNS 2 experiment using a 252 Cf calibration source

JSNS 2 investigates short-baseline neutrino oscillations using a 24-meter baseline and a 17-tonne Gd-loaded liquid scintillator target. Accurate event-reconstruction algorithms are crucial for analyzing experimental data. The algorithms undergo meticulous validation through calibration with a 252 Cf source. This paper outlines the methodology and evaluates the reconstruction performance, focusing on neutrino interactions up to approximately 50 MeV for sterile neutrino searches. Both 252 Cf and Michel electron events are studied to evaluate reconstruction accuracy. The analysis concludes that the uncertainty of the fiducial volume, with an appropriate correction, is much less than the requirement of JSNS 2 requirement (10%). Furthermore, the energy resolution is measured to be 3.3 ± 0.1% for the Michel electron endpoint and 4.3 ± 0.1% for the n-Gd peak in the central region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum algorithms for conformal bootstrap

With the help of recent developments in quantum algorithms for semidefinite programming, we discuss the possibility for quantum speedup for the numerical conformal bootstrap in conformal field theory. We show that quantum algorithms may have significant improvement in the computational performance for several numerical bootstrap problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New Calabi–Yau manifolds from genetic algorithms

Calabi–Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi–Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

Astronomy & Astrophysics↗

Recent numerical and algorithmic advances within the volume tracking framework for modeling interfacial flows

A review of recent advances made in numerical methods and algorithms within the volume tracking framework is presented. The volume tracking method, also known as the volume-of-fluid method has become an established numerical approach to model and simulate interfacial flows. Its advantage is its strict mass conservation. However, because the interface is not explicitly tracked but captured via the material volume fraction on a fixed mesh, accurate estimation of the interface position, its geometric properties and modeling of interfacial physics in the volume tracking framework remain difficult. Several improvements have been made over the last decade to address these challenges. In this study, the multimaterial interface reconstruction method via power diagram, curvature estimation via heights and mean values and the balanced-force algorithm for surface tension are highlighted.

97 MATHEMATICS AND COMPUTING↗

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗

Utilizing waste heat in wastewater treatment plants for water desalination: Modeling and Multi-Objective optimization of a Multi-Effect desalination system using Decision Tree Regression and Pelican optimization algorithm

This paper examines the feasibility of using waste heat from wastewater treatment plants (WWTPs) for water desalination. A model was developed to utilize waste heat from the gensets at As Samra WWTP in Jordan, using real data and TRNSYS® software to calculate available waste heat. The desalination process was then modeled with ASPEN PLUS® software, focusing on multi-effect desalination (MED). Both series and parallel configurations for the MED system were compared. The study investigated the effects of system feeding flow rate, feeding pressure, and heat input on productivity, performance ratio, and recovery ratio. The study also introduces a novel optimization technique combining machine learning and modern optimization algorithms to maximize system productivity and performance. Initially, a decision tree regression (DTR) model is developed to establish relationships between key independent variables (flow rate, feed pressure, and heat input) and dependent variables (productivity, performance ratio, and recovery ratio). The Pelican Optimization Algorithm (POA) is then used to identify the optimal values of the independent variables for maximum productivity and performance. The results show that using a series configuration yields a system productivity of 3984.2 kg/hr, a performance ratio of 3.78, and a recovery ratio of 0.991 at a feed flow rate of 4000 kg/hr, feed pressure of 3 bars, and heat input of 719 kW. Optimal productivity (4421 kg/hr), performance ratio (3.81), and recovery ratio (0.851) are achieved at a feed flow rate of 5166 kg/hr, feed pressure of 3.2 bars, and heat input of 794 kW. In conclusion, the techno-economic assessment indicates a levelized cost of water of 1.63 USD/m 3 for parallel configurations and 1.65 USD/m 3 for series configurations, with a payback period of less than two years.

42 ENGINEERING↗

RadioGalaxyNET: Dataset and novel computer vision algorithms for the detection of extended radio galaxies and infrared hosts

Abstract Creating radio galaxy catalogues from next-generation deep surveys requires automated identification of associated components of extended sources and their corresponding infrared hosts. In this paper, we introduce RadioGalaxyNET, a multimodal dataset, and a suite of novel computer vision algorithms designed to automate the detection and localization of multi-component extended radio galaxies and their corresponding infrared hosts. The dataset comprises 4 155 instances of galaxies in 2 800 images with both radio and infrared channels. Each instance provides information about the extended radio galaxy class, its corresponding bounding box encompassing all components, the pixel-level segmentation mask, and the keypoint position of its corresponding infrared host galaxy. RadioGalaxyNET is the first dataset to include images from the highly sensitive Australian Square Kilometre Array Pathfinder (ASKAP) radio telescope, corresponding infrared images, and instance-level annotations for galaxy detection. We benchmark several object detection algorithms on the dataset and propose a novel multimodal approach to simultaneously detect radio galaxies and the positions of infrared hosts.

Astronomy & Astrophysics↗

A gauge-compatible Hamiltonian splitting algorithm for particle-in-cell simulations using finite element exterior calculus

A particle-in-cell algorithm is derived with a canonical Poisson structure in the formalism of finite element exterior calculus. The resulting method belongs to the class of gauge-compatible splitting algorithms, which exactly preserve gauge symmetries and their associated conservation laws via the momentum map. We numerically demonstrate this time invariance of the momentum map and its usefulness in establishing precise initial conditions with a desired initial electric field and fixed background charge. The restriction of this canonical, finite element Poisson structure to the 1X2P $1\frac {1}{2}$ -dimensional phase space is also considered and simulated numerically.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Spectrally accurate, reverse-mode differentiable bounce-averaging algorithm and its applications

We present a fast, spectrally (exponentially) accurate, automatically differentiable bounce-averaging algorithm that is used to simplify kinetic models. Using this algorithm, implemented in the DESC stellarator optimisation suite, we can perform efficient optimisation of many objectives to improve stellarator performance, such as the effective ripple 𝜖 eff metric for the neoclassical transport coefficient in the low collisionality regime and proxies for energetic particle confinement. For the first time, we optimise a finite-beta stellarator to directly reduce neoclassical ripple transport using reverse-mode differentiation. This ensures the computational cost of differentiation is independent of the number of controllable parameters.

fusion plasma↗

The Differential Algebra Based Multiple Level Fast Multipole Algorithm for 3D Space Charge Field Calculation and Photoemission Simulation

Coulomb interaction between charged particles inside a bunch is one of the most importance collective effects in beam dynamics, becoming even more significant as the energy of the particle beam is lowered to accommodate analytical and low-Z material imaging purposes such as in the time resolved Ultrafast Electron Microscope (UEM) development currently underway at Michigan State University. In addition, space charge effects are the key limiting factor in the development of ultrafast atomic resolution electron imaging and diffraction technologies and are also correlated with an irreversible growth in rms beam emittance due to fluctuating components of the nonlinear electron dynamics. In the short pulse regime used in the UEM, space charge effects also lead to virtual cathode formation in which the negative charge of the electrons emitted at earlier times, combined with the attractive surface field, hinders further emission of particles and causes a degradation of the pulse properties. Space charge and virtual cathode effects and their remediation are core issues for the development of the next generation of high-brightness UEMs. Since the analytical models are only applicable for special cases, numerical simulations, in addition to experiments, are usually necessary to accurately understand the space charge effect. In this paper we will introduce a grid-free differential algebra based multiple level fast multipole algorithm, which calculates the 3D space charge field for n charged particles in arbitrary distribution with an efficiency of O(n), and the implementation of the algorithm to a simulation code for space charge dominated photoemission processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Configurational-Bias Monte Carlo Back-Mapping Algorithm for Efficient and Rapid Conversion of Coarse-Grained Water Structures into Atomistic Models

Coarse-grained molecular dynamics (MD) simulations represent a powerful approach to simulate longer time scale and larger length scale phenomena than those accessible to all-atom models. The gain in efficiency, however, comes at the cost of atomistic details. The reverse transformation, also known as back-mapping, of coarse grained beads into their atomistic constituents represents a major challenge. Most existing approaches are limited to specific molecules or specific force-fields and often rely on running a long time atomistic MD of the back-mapped configuration to arrive at an optimal solution. Such approaches are problematic when dealing with systems with high diffusion barriers. Here, we introduce a new extension of the configurational-bias-Monte-Carlo (CBMC) algorithm, which we term the crystalline-configurational-bias-Monte-Carlo (C-CBMC) algortihm, that allows rapid and efficient conversion of a coarse-grained model back into its atomistic representation. Although the method is generic, we use a coarse-grained water model as a representative example and demonstrate the back-mapping or reverse transformation for model systems ranging from the ice-liquid water interface to amorphous and crystalline ice configurations. A series of simulations using the TIP4P/Ice model are performed to compare the new CBMC method to several other standard Monte Carlo and Molecular Dynamics based back-mapping techniques. In all the cases, the C-CBMC algorithm is able to find optimal hydrogen bonded configuration many thousand evaluations/steps sooner than the other methods compared within this paper. For crystalline ice structures such as a hexagonal, cubic, and cubic-hexagonal stacking disorder structures, the C-CBMC was able to find structures that were between 0.05 and 0.1 eV/water molecule lower in energy than the ground state energies predicted by the other methods. Detailed analysis of the atomistic structures show a significantly better global hydrogen positioning when contrasted with the existing simpler back-mapping methods. The error in the RDFs of backmapped relative to reference configuration for the CCBMC, MD, and MC were found to be 6.9, 8.7, and 12.9 respectively for the hexagonal system. For the cubic system the relative error of the RDFs for the CCBMC, MD, and MC were found to be 18.2, 34.6, and 39.0 respectively. Finally, our results demonstrate the efficiency and efficacy of our new back-mapping approach, especially for crystalline systems where simple force-field based relaxations have a tendency to get trapped in local minima.

74 ATOMIC AND MOLECULAR PHYSICS↗

Constraining and Characterizing the Size of Atmospheric Rivers: A Perspective Independent From the Detection Algorithm

Abstract Atmospheric rivers (AR) are large and narrow filaments of poleward horizontal water vapor transport. Because of its direct relationship with horizontal vapor transport, extreme precipitation, and overall AR impacts over land, the AR size is an important characteristic that needs to be better understood. Current AR detection and tracking algorithms have resulted in large uncertainty in estimating AR sizes, with areas varying over several orders of magnitude among different detection methods. We develop and implement five independent size estimation methods to characterize the size of ARs that make landfall over the west coast of North America in the 1980–2017 period and reduce the range of size estimation from ARTMIP. ARs that originate in the Northwest Pacific (WP) (100°−180°E) have larger sizes and are more zonally oriented than those from the Northeast Pacific (EP) (180°−240°E). ARs become smaller through their life cycle, mainly due to reductions in their width. They also become more meridionally oriented toward the end of their life cycle. Overall, the size estimation methods proposed in this study provide a range of AR areas (between 7 × 10 11 and 10 13 m 2 ), that is, several orders of magnitude narrower than current methods estimation. This methodology can provide statistical constraints in size and geometry for the AR detection and tracking algorithms, and an objective insight for future studies about AR size changes under different climate scenarios.

54 ENVIRONMENTAL SCIENCES↗

Aerosol Vertical Turbulent Mass Flux Retrievals Through Novel Remote Sensing Algorithm

Abstract Integrated measurements of aerosol, radiation, cloud, and turbulent transport in the planetary boundary layer (PBL) are essential for understanding and modeling climate and air quality. Here, we developed a new technique for the identification of convective turbulent regions and deriving the vertical distribution of aerosol turbulent mass fluxes within PBL. The algorithm uses retrievals from coherent Doppler lidars and a high spectral resolution lidar. The technique was applied to study particle mass fluxes over 2 months (November–December 2020) during the campaign conducted at the DOE Atmospheric Radiation Measurement Southern Great Plains (SGP) site in Lamont, Oklahoma. The algorithm developed here is capable of continuously deriving vertically resolved (curtains) aerosol mass fluxes. Our data analysis shows that at the site, the 30‐min averaged fluxes at 135 m above the surface were mainly positive (upward) at ∼1 μg m −2 s −1 , suggesting that the surface is the primary source of the particle mass supplied to the boundary layer at the SGP site. Analyses of the individual case studies have revealed that not all the derived fluxes can be linked to surface emissions. Both positive and negative values in a range of ±5 μg m −2 s −1 can be caused by convective thermals interacting between the residual layer and the mixed layer and by rotation of the horizontal wind with the height. Large erroneous negative fluxes can also be caused by drizzling/precipitating clouds. We anticipate that the application of the current technique will lead to a more realistic representation of aerosol mass budgets and bidirectional mixing rates.

54 ENVIRONMENTAL SCIENCES↗