Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling 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 325 records · Page 18

Design Optimization of Structural Health Monitoring Systems

Sensor networks drive decisions. Approach: Design networks to minimize the expected total cost (in a statistical sense, i.e. Bayes Risk) associated with making wrong decisions and with installing maintaining and running the sensor network itself. Search for optimal solutions using Monte-Carlo-Sampling-Adapted Genetic Algorithm. Applications include structural health monitoring and surveillance.

42 ENGINEERING↗

On the Numerical Dispersion of Electromagnetic Particle-In-Cell Code : Finite Grid Instability

The Particle-In-Cell (PIC) method is widely used in relativistic particle beam and laser plasma modeling. However, the PIC method exhibits numerical instabilities that can render unphysical simulation results or even destroy the simulation. For electromagnetic relativistic beam and plasma modeling, the most relevant numerical instabilities are the finite grid instability and the numerical Cherenkov instability. We review the numerical dispersion relation of the electromagnetic PIC algorithm to analyze the origin of these instabilities. We rigorously derive the faithful 3D numerical dispersion of the PIC algorithm, and then specialize to the Yee FDTD scheme. In particular, we account for the manner in which the PIC algorithm updates and samples the fields and distribution function. Temporal and spatial phase factors from solving Maxwell's equations on the Yee grid with the leapfrog scheme are also explicitly accounted for. Numerical solutions to the electrostatic-like modes in the 1D dispersion relation for a cold drifting plasma are obtained for parameters of interest. In the succeeding analysis, we investigate how the finite grid instability arises from the interaction of the numerical 1D modes admitted in the system and their aliases. The most significant interaction is due critically to the correct representation of the operators in the dispersion relation. We obtain a simple analytic expression for the peak growth rate due to this interaction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Margins Associated with Loss of Assured Safety for Systems with Multiple Time-Dependent Failure Modes.

Representations for margins associated with loss of assured safety (LOAS) for weak link (WL)/strong link (SL) systems involving multiple time-dependent failure modes are developed. The following topics are described: (i) defining properties for WLs and SLs, (ii) background on cumulative distribution functions (CDFs) for link failure time, link property value at link failure, and time at which LOAS occurs, (iii) CDFs for failure time margins defined by (time at which SL system fails) – (time at which WL system fails), (iv) CDFs for SL system property values at LOAS, (v) CDFs for WL/SL property value margins defined by (property value at which SL system fails) – (property value at which WL system fails), and (vi) CDFs for SL property value margins defined by (property value of failing SL at time of SL system failure) – (property value of this SL at time of WL system failure). Included in this presentation is a demonstration of a verification strategy based on defining and approximating the indicated margin results with (i) procedures based on formal integral representations and associated quadrature approximations and (ii) procedures based on algorithms for sampling-based approximations.

97 MATHEMATICS AND COMPUTING↗

Data Science and Machine Learning for Genome Security

This report describes research conducted to use data science and machine learning methods to distinguish targeted genome editing versus natural mutation and sequencer machine noise. Genome editing capabilities have been around for more than 20 years, and the efficiencies of these techniques has improved dramatically in the last 5+ years, notably with the rise of CRISPR-Cas technology. Whether or not a specific genome has been the target of an edit is concern for U.S. national security. The research detailed in this report provides first steps to address this concern. A large amount of data is necessary in our research, thus we invested considerable time collecting and processing it. We use an ensemble of decision tree and deep neural network machine learning methods as well as anomaly detection to detect genome edits given either whole exome or genome DNA reads. The edit detection results we obtained with our algorithms tested against samples held out during training of our methods are significantly better than random guessing, achieving high F1 and recall scores as well as with precision overall.

59 BASIC BIOLOGICAL SCIENCES↗

The Massive and Distant Clusters of WISE Survey. I. Survey Overview and a Catalog of >2000 Galaxy Clusters at z ≃ 1

We introduce the Massive and Distant Clusters of WISE Survey (MaDCoWS), a search for galaxy clusters at 0.7 ≲ z ≲ 1.5 based upon data from the Wide-field Infrared Survey Explorer (WISE) mission. MaDCoWS is the first cluster survey capable of discovering massive clusters at these redshifts over the full extragalactic sky. The search is divided into two regions—the region of the extragalactic sky covered by Pan-STARRS (δ > –30°) and the remainder of the southern extragalactic sky at δ < –30° for which shallower optical data from the SuperCOSMOS Sky Survey is available. Here, we describe the search algorithm, characterize the sample, and present the first MaDCoWS data release—catalogs of the 2433 highest amplitude detections in the WISE–Pan-STARRS region and the 250 highest amplitude detections in the WISE –SuperCOSMOS region. A total of 1723 of the detections from the WISE –Pan-STARRS sample have also been observed with the Spitzer Space Telescope , providing photometric redshifts and richnesses, and an additional 64 detections within the WISE –SuperCOSMOS region also have photometric redshifts and richnesses. Spectroscopic redshifts for 38 MaDCoWS clusters with IRAC photometry demonstrate that the photometric redshifts have an uncertainty of σ z /(1 + z) ≃ 0.036. Combining the richness measurements with Sunyaev–Zel'dovich observations of MaDCoWS clusters, we also present a preliminary mass–richness relation that can be used to infer the approximate mass distribution of the full sample. The estimated median mass for the WISE–Pan-STARRS catalog is ${M}_{500}={1.6}_{-0.8}^{+0.7}\times {10}^{14}\,{M}_{\odot }$, with the Sunyaev–Zel'dovich data confirming that we detect clusters with masses up to M 500 ~ 5 × 10 14 M ⊙ (M 200 ~ 10 15 M ⊙ ).

79 ASTRONOMY AND ASTROPHYSICS↗

Event-by-Event Fission with FREYA

The recently developed code FREYA (Fission Reaction Event Yield Algorithm) generates large samples of complete fission events, consisting of two receding product nuclei as well as a number of neutrons and photons, all with complete kinematic information. Thus it is possible to calculate arbitrary correlation observables whose behavior may provide unique insight into the fission process. The presentation first discusses the present status of FREYA, which has now been extended up to energies where pre-equilibrium emission becomes significant and one or more neutrons may be emitted prior to fission. Concentrating on {sup 239}Pu(n,f), we discuss the neutron multiplicity correlations, the dependence of the neutron energy spectrum on the neutron multiplicity, and the relationship between the fragment kinetic energy and the number of neutrons and their energies. We also briefly suggest novel fission observables that could be measured with modern detectors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

C-SAW: a framework for graph sampling and random walk on GPUs

Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing technologies. Fortunately, recent research efforts find out graph sampling and random walk, which significantly reduce the size of original graphs, can benefit the tasks of learning, mining, analyzing and visualizing large graphs by capturing the desirable graph properties. This paper introduces C-SAW, the first framework that accelerates Sampling and Random Walk framework on GPUs. Particularly, C-SAW makes three contributions: First, our framework provides a generic API which allows users to implement a wide range of sampling and random walk algorithms with ease. Second, offloading this framework on GPU, we introduce warp-centric parallel selection, and two novel optimizations for collision migration. Third, towards supporting graphs that exceed the GPU memory capacity, we introduce efficient data transfer optimizations for out-of-memory and multi-GPU sampling, such as workload-aware scheduling and batched multi-instance sampling. Taken together, our framework constantly outperforms the state of the art projects in addition to the capability of supporting a wide range of sampling and random walk algorithms.

97 MATHEMATICS AND COMPUTING↗

Ultrasonic Characterization of Cast Austenitic Stainless Steel Microstructure: Discrimination between Equiaxed- and Columnar-Grain Material – An Interim Study

Ultrasonic nondestructive evaluation (NDE) and inspection of cast austenitic stainless steel (CASS) components used in the nuclear power industry is neither as effective nor reliable as is needed due to detrimental effects upon the interrogating ultrasonic beam and interference from ultrasonic backscatter. The root cause is the coarse-grain microstructure inherent to this class of materials. Some ultrasonic techniques perform better for particular microstructural classifications and this has led to the hypothesis that an ultrasonic inspection can be optimized for a particular microstructural class, if a technique exists to reliably classify the microstructure for feedback to the inspection. This document summarizes scoping experiments of in-situ ultrasonic methods for classification and/or characterization of the material microstructures in CASS components from the outside surface of a pipe. The focus of this study was to evaluate ultrasonic methods and provide an interim report that documents results and technical progress. An initial set of experiments were performed to test the hypothesis that in-service characterization of cast austenitic stainless steel (CASS) is feasible, and that, if reliably performed, such data would provide real-time feedback to optimize in-service inspections in the field. With this objective in mind, measurements for the experiment were restricted to techniques that should be robust if carried forward to eventual field implementation. Two parameters were investigated for their ability to discriminate between different microstructures in CASS components. The first parameter was a time-of-flight ratio of a normal incidence shear wave to that of a normal incidence longitudinal wave (TOFRSL). The ratio removed dependency on component thickness which may not be accurately reported in the field. The second parameter was longitudinal wave attenuation. The selected CASS specimens provided five equiaxed-grain material samples and five columnar-grain material samples for a two-class discrimination problem. Qualitative TOFRSL estimates and a threshold algorithm classified all 10 material samples correctly and indicated a reliable and robust technique. Qualitative longitudinal wave attenuation estimates and a threshold algorithm also classified all 10 materials samples correctly; however, the technique was not as robust as TOFRSL. The experiments provided promising results and demonstrated that good potential exists for future development of techniques to implement real-time classification of CASS material. However, the reported measurements need to be substantiated with measurements on additional specimens.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A three-dimensional reconstruction algorithm for scanning transmission electron microscopy data from thick samples

Increasing interest in three-dimensional nanostructures adds impetus to electron microscopy techniques capable of imaging at or below the nanoscale in three dimensions. We present a reconstruction algorithm that takes as input a focal series of four-dimensional scanning transmission electron microscopy (4D-STEM) data and transcends the prevalent structure retrieval algorithm assumption of a very thin specimen homogenous along the optic axis. We demonstrate this approach by reconstructing the different layers of a lead iridate (Pb$_2$Ir$_2$O$_7$) and yttrium-stabilized zirconia (Y$_{0.095}$Zr$_{0.905}$O$_2$) heterostructure from data acquired with the specimen in a single plan-view orientation, with the epitaxial layers stacked along the beam direction.

Brown, Hamish G↗

On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes

Several computer codes simulating chemical reactions in particles systems are based on the Green's functions of the diffusion equation (GFDE). Indeed, many types of chemical systems have been simulated using the exact GFDE, which has also become the gold standard for validating other theoretical models. In this work, a simulation algorithm is presented to sample the interparticle distance for partially diffusion-controlled reversible ABCD reaction. This algorithm is considered exact for 2-particles systems, is faster than conventional look-up tables and uses only a few kilobytes of memory. The simulation results obtained with this method are compared with those obtained with the independent reaction times (IRT) method. This work is part of our effort in developing models to understand the role of chemical reactions in the radiation effects on cells and tissues and may eventually be included in event-based models of space radiation risks. However, as many reactions are of this type in biological systems, this algorithm might play a pivotal role in future simulation programs not only in radiation chemistry, but also in the simulation of biochemical networks in time and space as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Detecting 127 Xe in an atmospheric tracer experiment

The Xcounts algorithm for calculating air concentrations of radioactive xenon isotopes (Eslinger et al., 2023) has been extended to estimate 127 Xe in addition to 131m Xe, 133m Xe, 133 Xe, and 135 Xe. The algorithm was applied to 119 samples collected with a SAUNA Q B system (Ringbom et al., 2023) during a two-month atmospheric tracer release experiment. Finally, the algorithm identified two samples with 127 Xe present from a single 1.5 h release about 3.5 km upwind of the sampler and no false detections of 127 Xe were observed in the other samples.

127Xe calibration↗

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗

Possibilities and Limitations of Kinematically Identifying Stars from Accreted Ultra-faint Dwarf Galaxies

Abstract The Milky Way has accreted many ultra-faint dwarf galaxies (UFDs), and stars from these galaxies can be found throughout our Galaxy today. Studying these stars provides insight into galaxy formation and early chemical enrichment, but identifying them is difficult. Clustering stellar dynamics in 4D phase space ( E , L z , J r , J z ) is one method of identifying accreted structure that is currently being utilized in the search for accreted UFDs. We produce 32 simulated stellar halos using particle tagging with the Caterpillar simulation suite and thoroughly test the abilities of different clustering algorithms to recover tidally disrupted UFD remnants. We perform over 10,000 clustering runs, testing seven clustering algorithms, roughly twenty hyperparameter choices per algorithm, and six different types of data sets each with up to 32 simulated samples. Of the seven algorithms, HDBSCAN most consistently balances UFD recovery rates and cluster realness rates. We find that, even in highly idealized cases, the vast majority of clusters found by clustering algorithms do not correspond to real accreted UFD remnants and we can generally only recover 6% of UFDs remnants at best. These results focus exclusively on groups of stars from UFDs, which have weak dynamic signatures compared to the background of other stars. The recoverable UFD remnants are those that accreted recently, z accretion ≲ 0.5. Based on these results, we make recommendations to help guide the search for dynamically linked clusters of UFD stars in observational data. We find that real clusters generally have higher median energy and J r , providing a way to help identify real versus fake clusters. We also recommend incorporating chemical tagging as a way to improve clustering results.

79 ASTRONOMY AND ASTROPHYSICS↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wavelength-resolved Neutron Tomography for Crystalline Materials

Wavelength-resolved (WR) neutron transmission tomography is an emerging technique to characterize engineering materials. While tomographic reconstruction for amorphous samples is straightforward, it is challenging to reconstruct samples with single-crystal domains because the attenuation of the sample varies as a function of its orientation with respect to the incident beam due to Bragg scattering. In this paper, we present an algorithm that can reconstruct samples with single-crystal domains from WR neutron tomographic measurements. In particular, we use a model-based iterative reconstruction (MBIR) technique that reconstructs the volume by identifying and leaving out the regions of the measurement that are affected by Bragg scatter. We combine the output of the MBIR method with an algorithm that matches the reconstruction to the identified Bragg scatter to reconstruct a feature that corresponds to the local crystallography of the sample being measured. Using simulated data, we demonstrate how our algorithm can reconstruct materials with single-crystal domains, thereby adding a powerful new capability for WR neutron imaging instruments.

Singanallur Vaidyanathan, Venkatakrishnan↗

Small-Noise Analysis and Symmetrization of Implicit Monte Carlo Samplers

Implicit samplers are algorithms for producing independent, weighted samples from multivariate probability distributions. These are often applied in Bayesian data assimilation algorithms. We use Laplace asymptotic expansions to analyze two implicit samplers in the small noise regime. Our analysis suggests a symmetrization of the algorithms that leads to improved implicit sampling schemes at a relatively small additional cost. Here, computational experiments confirm the theory and show that symmetrization is effective for small noise sampling problems.

97 MATHEMATICS AND COMPUTING↗

Frequency extrapolation by nonconvex compressive sensing

Tomographic imaging modalities sample subjects with a discrete, finite set of measurements, while the underlying object function is continuous. Because of this, inversion of the imaging model, even under ideal conditions, necessarily entails approximation. The error incurred by this approximation can be important when there is rapid variation in the object function or when the objects of interest are small. In this work, we investigate this issue with the Fourier transform (FT), which can be taken as the imaging model for magnetic resonance imaging (MRl) or some forms of wave imaging. Compressive sensing has been successful for inverting this data model when only a sparse set of samples are available. We apply the compressive sensing principle to a somewhat related problem of frequency extrapolation, where the object function is represented by a super-resolution grid with many more pixels than FT measurements. The image on the super-resolution grid is obtained through nonconvex minimization. The method fully utilizes the available FT samples, while controlling aliasing and ringing. The algorithm is demonstrated with continuous FT samples of the Shepp-Logan phantom with additional small, high-contrast objects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Ghost marker detection and elimination in marker-based optical tracking systems for real-time tracking in stereotactic body radiotherapy

Purpose: To propose a simple model to explain the origin of ghost markers in marker-based optical tracking systems (OTS) and to develop retrospective strategies to detect and eliminate ghost markers. Methods: In marker-based OTS, ghost markers are virtual markers created due to the cross-talk between the two camera sensors, which can lead to system execution failure or inaccuracy in patient tracking. As a result, the users have to limit the number of markers and avoid certain marker configurations to reduce the chances of ghost markers. In this work, the authors propose retrospective strategies to detect and eliminate ghost markers. The two camera sensors were treated as mathematical points in space. The authors identified the coplanar within limit (CWL) condition as the necessary condition for ghost marker occurrence. A simple ghost marker detection method was proposed based on the model. Ghost marker elimination was achieved through pattern matching: a ghost marker-free reference set was matched with the optical marker set observed by the OTS; unmatched optical markers were eliminated as either ghost markers or misplaced markers. The pattern matching problem was formulated as a constraint satisfaction problem (using pairwise distances as constraints) and solved with an iterative backtracking algorithm. Wildcard markers were introduced to address missing or misplaced markers. An experiment was designed to measure the sensor positions and the limit for the CWL condition. The ghost marker detection and elimination algorithms were verified with samples collected from a five-marker jig and a nine-marker anthropomorphic phantom, rotated with the treatment couch from −60° to +60°. The accuracy of the pattern matching algorithm was further validated with marker patterns from 40 patients who underwent stereotactic body radiotherapy (SBRT). For this purpose, a synthetic optical marker pattern was created for each patient by introducing ghost markers, marker position uncertainties, and marker displacement. Results: The sensor positions and the limit for the CWL condition were measured with excellent reproducibility (standard deviation ≤ 0.39 mm). The ghost marker detection algorithm had perfect detection accuracy for both the jig (1544 samples) and the anthropomorphic phantom (2045 samples). Pattern matching was successful for all samples from both phantoms as well as the 40 patient marker patterns. Conclusions: The authors proposed a simple model to explain the origin of ghost markers and identified the CWL condition as the necessary condition for ghost marker occurrence. The retrospective ghost marker detection and elimination algorithms guarantee complete ghost marker elimination while providing the users with maximum flexibility in selecting the number of markers and their configuration to meet their clinic needs.

60 APPLIED LIFE SCIENCES↗