Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomized algorithms”

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,009 records · Page 56
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantifying wildfire drivers and predictability in boreal peatlands using a two-step error-correcting machine learning framework in TeFire v1.0

Abstract. Wildfires are becoming an increasing challenge to the sustainability of boreal peatland (BP) ecosystems and can alter the stability of boreal carbon storage. However, predicting the occurrence of rare and extreme BP fires proves to be challenging, and gaining a quantitative understanding of the factors, both natural and anthropogenic, inducing BP fires remains elusive. Here, we quantified the predictability of BP fires and their primary controlling factors from 1997 to 2015 using a two-step correcting machine learning (ML) framework that combines multiple ML classifiers, regression models, and an error-correcting technique. We found that (1) the adopted oversampling algorithm effectively addressed the unbalanced data and improved the recall rate by 26.88 %–48.62 % when using multiple datasets, and the error-correcting technique tackled the overestimation of fire sizes during fire seasons; (2) nonparametric models outperformed parametric models in predicting fire occurrences, and the random forest machine learning model performed the best, with the area under the receiver operating characteristic curve ranging from 0.83 to 0.93 across multiple fire datasets; and (3) four sets of factor-control simulations consistently indicated the dominant role of temperature, air dryness, and climate extreme (i.e., frost) for boreal peatland fires, overriding the effects of precipitation, wind speed, and human activities. Our findings demonstrate the efficiency and accuracy of ML techniques in predicting rare and extreme fire events and disentangle the primary factors determining BP fires, which are critical for predicting future fire risks under climate change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Kinetic Monte Carlo Simulation of Hydrogen Diffusion in Tungsten

Nuclear fusion is considered as the most promising sustainable energy source. If achieved, it could provide electricity to the mankind for millions of years. During the reaction, the fusion ash is continuously removed from the magnetic gap, the divertor region, and the divertor facing component is subjected to intense plasma bombardment. It is proposed to use tungsten as the divertor facing material, because it has low physical sputtering yield and superior thermomechanical properties. However, the high mobility of hydrogen in tungsten and the high bombardment flux bring the hydrogen isotopes deep into the tungsten tile. The presence of hydrogen in tungsten tends to weaken the gram boundaries and produce surface blistering. The ejection of tungsten particulates into the plasma core will cool the reaction and cease the fusion reactions. Therefore, it is important to have a detailed understanding of the hydrogen diffusion in tungsten bulk. The KMC method is a stochastic computer simulation to predict the time evolution of a certain system. Typically, at a given time, the system will evolve through a few possible paths with known probabilities. In each step, the KMC method analyzes the entire system and randomly determines the system evolving events based on all transition rates of all possible events and advance the physical time. This process is repeated till the simulation of the entire physical time is completed. In previous work, the authors developed a kinetic Monte Carlo (KMC) algorithm and program to simulate hydrogen diffusion process on tungsten reconstructed surface. In this article, this KMC method is extended to model the hydrogen diffusion in tungsten bulk. The diffusion coefficients are calculated and fitted to the Arrhenius equation. The result matches the experiment measurement very well. KMC diffusion simulation needs the locations of the hydrogen trapping sites, diffusion paths and the corresponding diffusion energy barriers. The hydrogen interstitial sites in tungsten crystal have been thoroughly studied by density function theory (DFT) and molecular dynamics (MD). Johnson and Carter used DFT to determine the preferred location of the hydrogen interstitial sites m tungsten crystal, which are the tetrahedral sites (T-sites) in body-centered-cubic (bcc) lattice surfaces. All T-sites are located on the surfaces of a lattice cell. There are four T-sites per surface and twelve T-sites per lattice cell. The hydrogen atoms diffuse by traveling from one T-site to one of its nearest four T-site neighbors. Thus, each T-site is surrounded by two neighbors on the same surface, and one neighbor on each of the two adjacent surfaces perpendicular to the surface holding the center T-site. The diffusion barrier between two neighboring T-sites was calculated to be 0.38 eV. Knowing the diffusion path, energy barrier, and the crystal structure, the KMC simulation is readily to be performed. Based on other researchers' DFT calculations, the hydrogen stable interstitial site in tungsten bulk is determined as the tetrahedral site on the surface of the bee lattice. Each T-site has 4 neighbors and the energy barrier between two adjacent T-sites are estimated to be 0.38 eV. Based on those facts and the KMC theory, a MATLAB program is developed to model the hydrogen diffusion in tungsten bulk. In the MATLAB program, substrate temperature, hydrogen concentration, physical time to be simulated, and the number of cycles are all customizable. To compare the KMC determined diffusion coefficients with experiment results in the literature, the simulations are performed for temperature 300 K - 2500 K and low hydrogen concentration (0.1%), mimicking the experiment condition. The calculated diffusion coefficients match the reference values measured by the experiment under low hydrogen concentration condition. The results are also fitted to the Arrhenius equation. The pre-exponential factor and the average activation energy in Arrhenius equation are obtained. The good agreement between simulation and experiment proves that the developed KMC algorithm truly reflect the well-established theory of interstitial hydrogens in tungsten. The developed program could easily be used to model the diffusion process and predict the diffusion coefficients under other concentrations and temperatures. This work is part of the ongoing development of hydrogen diffusion in tungsten integrating surface diffusion (previous work), bulk diffusion (this work), and adsorption/desorption on surface (future work)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

SU-C-BRB-03: Cross-Institutional Validation of An Ultrafast Automatic Planning Platform for Breast Irradiation

Purpose: Recently an ultrafast automatic planning system for breast irradiation using tangential beams was developed by modeling relationships between patient anatomy and achieved dose distribution. This study evaluates the performance of this system when applied to a different patient population and dose calculation algorithm. Methods: The system and its anatomy-to-dose models was developed at institution A based on 20 cases, which were planned using manual fluence painting technique and calculated WITH heterogeneity correction. Institution B uses field-in-field planning technique and dose calculation WITHOUT heterogeneity correction. 11 breast cases treated at Institution B were randomly selected for retrospective study, including left and right sides, and different breast size (irradiated volumes defined by Jaw/MLC opening range from 875cc to 3516cc). Comparisons between plans generated automatically (Auto-Plans) and those used for treatment (Clinical-Plans) included: energy choice (single/mixed), volumes receiving 95%/100%/105%/110% Rx dose (V95%/V100%/V105%/V100%) relative to irradiated volume, D1cc, and LungV20Gy. Results: In 9 out of 11 cases single/mixed energy choice made by the software agreed with Clinical-Plans. For the remaining 2 cases software recommended using mixed energy and dosimetric improvements were observed. V100% were similar (p=0.223, Wilcoxon Signed-Rank test) between Auto-Plans and Clinical-Plans (57.6±8.9% vs. 54.8±9.5%). V95% is 2.3±3.0% higher for Auto-Plans (p=0.027), indicating reduced cold areas. Hot spot volume V105% were significantly reduced in Auto-Plan by 14.4±7.2% (p=0.004). Absolute V105% was reduced from 395.6±359.9cc for Clinical-Plans to 108.7±163cc for Auto-Plans. D1cc was 107.4±2.8% for Auto-Plans, and 109.2±2.4% for Clinical-Plans (p=0.056). LungV20Gy were 13.6±4.0% for Auto-Plan vs. 14.0±4.1% for Clinical-Plans (p=0.043). All optimizations were finished within 1.5min. Conclusion: The performance of this breast auto-planning system remained stable and satisfactory when applied to a different patient population and dose calculation algorithm. The auto-planning system was able to produce clinically similar Rx dose coverage with significantly improved homogeneity inside breast tissue, in less than 1.5min.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Using machine learning to predict the correlation of spectra using SDSS magnitudes as an improvement to the Locus Algorithm

The Locus Algorithm is a new technique to improve the quality of differential photometry by optimising the choices of reference stars. At the heart of this algorithm is a routine to assess how good each potential reference star is by comparing its SDSS magnitude values to those of the target star. In this way, the difference in wavelength-dependent effects of the Earth’s atmospheric scattering between target and reference can be minimised. This paper sets out a new way to estimate the quality of each reference star using machine learning. A random subset of stars from SDSS with spectra was chosen. For each one, a suitable reference star, also with a spectrum, was chosen. The correlation between the two spectra in the SDSS r band (between 550 nm and 700 nm) was taken to be the gold-standard measure of how well they match up for differential photometry. The five SDSS magnitude values for each of these stars were used as predictors. A number of supervised machine learning models were constructed on a training set of the stars and were each evaluated on a testing set. The model using Support Vector Regression had the best performance of these models. It was then tested on a final, hold-out, validation set of stars to get an unbiased measure of its performance. With an R 2 of 0.62, the SVR model presents enhanced performance for the Locus Algorithm technique.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2012

A Comprehensive Comparison of IMRT and VMAT Plan Quality for Prostate Cancer Treatment

Purpose: We performed a comprehensive comparative study of the plan quality between volumetric-modulated arc therapy (VMAT) and intensity-modulated radiation therapy (IMRT) for the treatment of prostate cancer. Methods and Materials: Eleven patients with prostate cancer treated at our institution were randomly selected for this study. For each patient, a VMAT plan and a series of IMRT plans using an increasing number of beams (8, 12, 16, 20, and 24 beams) were examined. All plans were generated using our in-house-developed automatic inverse planning (AIP) algorithm. An existing eight-beam clinical IMRT plan, which was used to treat the patient, was used as the reference plan. For each patient, all AIP-generated plans were optimized to achieve the same level of planning target volume (PTV) coverage as the reference plan. Plan quality was evaluated by measuring mean dose to and dose-volume statistics of the organs at risk, especially the rectum, from each type of plan. Results: For the same PTV coverage, the AIP-generated VMAT plans had significantly better plan quality in terms of rectum sparing than the eight-beam clinical and AIP-generated IMRT plans (p < 0.0001). However, the differences between the IMRT and VMAT plans in all the dosimetric indices decreased as the number of beams used in IMRT increased. IMRT plan quality was similar or superior to that of VMAT when the number of beams in IMRT was increased to a certain number, which ranged from 12 to 24 for the set of patients studied. The superior VMAT plan quality resulted in approximately 30% more monitor units than the eight-beam IMRT plans, but the delivery time was still less than 3 min. Conclusions: Considering the superior plan quality as well as the delivery efficiency of VMAT compared with that of IMRT, VMAT may be the preferred modality for treating prostate cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗
DOE OSTI2021

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗
DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗
DOE OSTI2015

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elastic wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.

58 GEOSCIENCES↗
DOE OSTI2012

Single-Shot Femtosecond X-ray Diffraction from Randomly Oriented Ellipsoidal Nanoparticles

Coherent diffractive imaging of single particles using the single-shot 'diffract and destroy' approach with an x-ray free electron laser (FEL) was recently demonstrated. A high-resolution low-noise coherent diffraction pattern, representative of the object before it turns into a plasma and explodes, results from the interaction of the FEL with the particle. Iterative phase retrieval algorithms are used to reconstruct two-dimensional projection images of the object from the recorded intensities alone. Here we describe the first single-shot diffraction data set that mimics the data proposed for obtaining 3D structure from identical particles. Ellipsoidal iron oxide nanoparticles (250 nm x 50 nm) were aerosolized and injected through an aerodynamic lens stack into a soft x-ray FEL. Particle orientation was not controlled with this injection method. We observed that, at the instant the x-ray pulse interacts with the particle, a snapshot of the particle's orientation is encoded in the diffraction pattern. The results give credence to one of the technical concepts of imaging individual nanometer and subnanometer-sized objects such as single molecules or larger clusters of molecules using hard x-ray FELs and will be used to help develop robust algorithms for determining particle orientations and 3D structure.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

SU-F-T-609: Impact of Dosimetric Variation for Prescription Dose Using Analytical Anisotropic Algorithm (AAA) in Lung SBRT

Purpose: Actual irradiated prescription dose to patients cannot be verified. Thus, independent dose verification and second treatment planning system are used as the secondary check. AAA dose calculation engine has contributed to lung SBRT. We conducted a multi-institutional study to assess variation of prescription dose for lung SBRT when using AAA in reference to using Acuros XB and Clarkson algorithm. Methods: Six institutes in Japan participated in this study. All SBRT treatments were planed using AAA in Eclipse and Adaptive Convolve (AC) in Pinnacle3. All of the institutes used a same independent dose verification software program (Simple MU Analysis: SMU, Triangle Product, Ishikawa, Japan), which implemented a Clarkson-based dose calculation algorithm using CT image dataset. A retrospective analysis for lung SBRT plans (73 patients) was performed to compute the confidence limit (CL, Average±2SD) in dose between the AAA and the SMU. In one of the institutes, a additional analysis was conducted to evaluate the variations between the AAA and the Acuros XB (AXB). Results: The CL for SMU shows larger systematic and random errors of 8.7±9.9 % for AAA than the errors of 5.7±4.2 % for AC. The variations of AAA correlated with the mean CT values in the voxels of PTV (a correlation coefficient : −0.7) . The comparison of AXB vs. AAA shows smaller systematic and random errors of −0.7±1.7%. The correlation between dose variations for AXB and the mean CT values in PTV was weak (0.4). However, there were several plans with more than 2% deviation of AAPM TG114 (Maximum: −3.3 %). Conclusion: In comparison for AC, prescription dose calculated by AAA may be more variable in lung SBRT patient. Even AXB comparison shows unexpected variation. Care should be taken for the use of AAA in lung SBRT. This research is partially supported by Japan Agency for Medical Research and Development (AMED)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2011

Predicting the fidelity of JPEG2000 compressed CT images using DICOM header information

Purpose: To propose multiple logistic regression (MLR) and artificial neural network (ANN) models constructed using digital imaging and communications in medicine (DICOM) header information in predicting the fidelity of Joint Photographic Experts Group (JPEG) 2000 compressed abdomen computed tomography (CT) images. Methods: Our institutional review board approved this study and waived informed patient consent. Using a JPEG2000 algorithm, 360 abdomen CT images were compressed reversibly (n = 48, as negative control) or irreversibly (n = 312) to one of different compression ratios (CRs) ranging from 4:1 to 10:1. Five radiologists independently determined whether the original and compressed images were distinguishable or indistinguishable. The 312 irreversibly compressed images were divided randomly into training (n = 156) and testing (n = 156) sets. The MLR and ANN models were constructed regarding the DICOM header information as independent variables and the pooled radiologists' responses as dependent variable. As independent variables, we selected the CR (DICOM tag number: 0028, 2112), effective tube current-time product (0018, 9332), section thickness (0018, 0050), and field of view (0018, 0090) among the DICOM tags. Using the training set, an optimal subset of independent variables was determined by backward stepwise selection in a four-fold cross-validation scheme. The MLR and ANN models were constructed with the determined independent variables using the training set. The models were then evaluated on the testing set by using receiver-operating-characteristic (ROC) analysis regarding the radiologists' pooled responses as the reference standard and by measuring Spearman rank correlation between the model prediction and the number of radiologists who rated the two images as distinguishable. Results: The CR and section thickness were determined as the optimal independent variables. The areas under the ROC curve for the MLR and ANN predictions were 0.91 (95% CI; 0.86, 0.95) and 0.92 (0.87, 0.96), respectively. The correlation coefficients of the MLR and ANN predictions with the number of radiologists who responded as distinguishable were 0.76 (0.69, 0.82, p < 0.001) and 0.78 (0.71, 0.83, p < 0.001), respectively. Conclusions: The MLR and ANN models constructed using the DICOM header information offer promise in predicting the fidelity of JPEG2000 compressed abdomen CT images.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Poisson-response Tensor-on-Tensor Regression and Applications

We introduce Poisson-response tensor-on-tensor regression (PToTR), a novel regression framework designed to handle tensor responses composed element-wise of random Poisson-distributed counts. Tensors, or multi-dimensional arrays, composed of counts are common data in fields such as inter national relations, social networks, epidemiology, and medical imaging, where events occur across multiple dimensions like time, location, and dyads. PToTR accommodates such tensor responses alongside tensor covariates, providing a versatile tool for multi dimensional data analysis. We propose algorithms for maximum likelihood estimation under a canonical polyadic (CP) structure on the regression coefficient tensor that satisfy the positivity of Poisson parameters and then provide an initial theoretical error analysis for PToTR estimators. We also demonstrate the utility of PToTR through three concrete applications: longitudinal data analysis of the Integrated Crisis Early Warning System database, positron emission tomography (PET) image reconstruction, and change-point detection of communication patterns in longitudinal dyadic data. These applications highlight the versatility of PToTR in addressing complex, structured count data across various domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

SU-E-T-613: Dosimetric Consequences of Systematic MLC Leaf Positioning Errors

Purpose: The purpose of this study is to determine the dosimetric consequences of systematic MLC leaf positioning errors for clinical IMRT patient plans so as to establish detection tolerances for quality assurance programs. Materials and Methods: Dosimetric consequences were simulated by extracting mlc delivery instructions from the TPS, altering the file by the specified error, reloading the delivery instructions into the TPS, recomputing dose, and extracting dose-volume metrics for one head-andneck and one prostate patient. Machine error was simulated by offsetting MLC leaves in Pinnacle in a systematic way. Three different algorithms were followed for these systematic offsets, and are as follows: a systematic sequential one-leaf offset (one leaf offset in one segment per beam), a systematic uniform one-leaf offset (same one leaf offset per segment per beam) and a systematic offset of a given number of leaves picked uniformly at random from a given number of segments (5 out of 10 total). Dose to the PTV and normal tissue was simulated. Results: A systematic 5 mm offset of 1 leaf for all delivery segments of all beams resulted in a maximum PTV D98 deviation of 1%. Results showed very low dose error in all reasonably possible machine configurations, rare or otherwise, which could be simulated. Very low error in dose to PTV and OARs was shown in all possible cases of one leaf per beam per segment being offset (<1%), or that of only one leaf per beam being offset (<.2%). The errors resulting from a high number of adjacent leaves (maximum of 5 out of 60 total leaf-pairs) being simultaneously offset in many (5) of the control points (total 10–18 in all beams) per beam, in both the PTV and the OARs analyzed, were similarly low (<2–3%). Conclusions: The above results show that patient shifts and anatomical changes are the main source of errors in dose delivered, not machine delivery. These two sources of error are “visually complementary” and uncorrelated (albeit not additive in the final error) and one can easily incorporate error resulting from machine delivery in an error model based purely on tumor motion.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Differentially Private Map Matching (DPMM) v1.0

Human mobility trajectories provide valuable information for developing mobility applications, as they contain diverse and rich information about the users. User mobility data is valuable for various applications such as intelligent transportation systems (ITS), commercial business models, and disease-spread models. However, such spatio-temporal traces may pose a threat to user privacy. GPS trajectories in their raw form are not suitable for transportation studies, as they require matching locations with nearest road links — a process called map-matching. This software implements a differential privacy (DP)-based map-matching algorithm, called DPMM, that generates link-level location trajectories in a privacy-preserving manner to protect users' origin destinations (OD) and travel paths. OD privacy is achieved by injecting Planar Laplace noise to the user OD GPS points. Travel-path privacy is provided with randomized travel path construction using exponential DP mechanism. The injected noise level is selected adaptively, by considering the link density of the location and the functional category of the localized links. For path privacy, our mechanism samples waypoints and selects candidate paths between waypoints. DPMM provides privacy effectively with respect to link density instead of other trajectory samples in the database compared to other privacy mechanisms. Compared to the different baseline models our DP-based privacy model offers closer query responses to the raw data in terms of individual and aggregate trajectory-level statistics with an average at absolute deviation from the baseline for individual statistics on ϵ = 1.0. Beyond individual trajectory statistics, the DPMM outperforms the other benchmark DP-based mechanisms on different aggregate statistics with up to 8x improvement in utility.

Peisert, Sean [Lawrence Berkeley National Laborato↗
DOE OSTI2021

Intelligent Sampling for Surrogate Modeling, Hyperparameter Optimization, and Data Analysis

Sampling techniques are used in many fields, including design of experiments, image processing, and graphics. The techniques in each field are designed to meet the constraints specific to that field such as uniform coverage of the range of each dimension or random samples that are at least a certain distance apart from each other. When an application imposes new constraints, for example, by requiring samples in a non-rectangular domain or the addition of new samples to an existing set, a common solution is to modify the algorithm currently in use, often with less than satisfactory results. As an alternative, we propose the concept of intelligent sampling, where we devise algorithms specifically tailored to meet our sampling needs, either by creating new algorithms or by modifying suitable algorithms from other fields. Surprisingly, both qualitative and quantitative comparisons indicate that some relatively simple algorithms can be easily modified to meet the many sampling requirements of surrogate modeling, hyperparameter optimization, and data analysis; these algorithms outperform their more sophisticated counterparts currently in use, resulting in better use of time and computer resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

The Random Ray Method for neutral particle transport

A new approach to solving partial differential equations (PDEs) based on the method of characteristics (MOC) is presented. The Random Ray Method (TRRM) uses a stochastic rather than deterministic discretization of characteristic tracks to integrate the phase space of a problem. TRRM is potentially applicable in a number of transport simulation fields where long characteristic methods are used, such as neutron transport and gamma ray transport in reactor physics as well as radiative transfer in astrophysics. In this study, TRRM is developed and then tested on a series of exemplar reactor physics benchmark problems. The results show extreme improvements in memory efficiency compared to deterministic MOC methods, while also reducing algorithmic complexity, allowing for a sparser computational grid to be used while maintaining accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗