Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,495 records · Page 83

Subspace-based Inverse Uncertainty Quantification for Nuclear Data Assessment

Safety analysis and design optimization depend on the accurate prediction of various reactor attributes. Predictions can be enhanced by reducing the uncertainty associated with the attributes of interest. An inverse problem can be defined and solved to assess the sources of uncertainty, and experimental effort can be subsequently directed to further improve the uncertainty associated with these sources. In this work a subspace-based algorithm for inverse sensitivity/uncertainty quantification (IS/UQ) has been developed to enable analysts account for all sources of nuclear data uncertainties in support of target accuracy assessment-type analysis. An approximate analytical solution of the optimization problem is used to guide the search for the dominant uncertainty subspace. By limiting the search to a subspace, the degrees of freedom available for the optimization search are significantly reduced. A quarter PWR fuel assembly is modeled and the accuracy of the multiplication factor and the fission reaction rate are used as reactor attributes whose uncertainties are to be reduced. Numerical experiments are used to demonstrate the computational efficiency of the proposed algorithm. Our ongoing work is focusing on extending the proposed algorithm to account for various forms of feedback, e.g., thermal-hydraulics and depletion effects.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

MO-C-17A-11: A Segmentation and Point Matching Enhanced Deformable Image Registration Method for Dose Accumulation Between HDR CT Images

Purpose: To propose and validate a novel and accurate deformable image registration (DIR) scheme to facilitate dose accumulation among treatment fractions of high-dose-rate (HDR) gynecological brachytherapy. Method: We have developed a method to adapt DIR algorithms to gynecologic anatomies with HDR applicators by incorporating a segmentation step and a point-matching step into an existing DIR framework. In the segmentation step, random walks algorithm is used to accurately segment and remove the applicator region (AR) in the HDR CT image. A semi-automatic seed point generation approach is developed to obtain the incremented foreground and background point sets to feed the random walks algorithm. In the subsequent point-matching step, a feature-based thin-plate spline-robust point matching (TPS-RPM) algorithm is employed for AR surface point matching. With the resulting mapping, a DVF characteristic of the deformation between the two AR surfaces is generated by B-spline approximation, which serves as the initial DVF for the following Demons DIR between the two AR-free HDR CT images. Finally, the calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. Results: The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative results as well as the visual inspection of the DIR indicate that our proposed method can suppress the interference of the applicator with the DIR algorithm, and accurately register HDR CT images as well as deform and add interfractional HDR doses. Conclusions: We have developed a novel and robust DIR scheme that can perform registration between HDR gynecological CT images and yield accurate registration results. This new DIR scheme has potential for accurate interfractional HDR dose accumulation. This work is supported in part by the National Natural ScienceFoundation of China (no 30970866 and no 81301940)

60 APPLIED LIFE SCIENCES↗

Evaluation of an automatic system for detection and positioning of small pore defects using digital radiography

A recently developed algorithm for positioning of small defects within metal bodies using digital radiography has been experimentally validated. The algorithm has been validated in the high contrast to noise limit. A calibration method has also been developed and validated. The average error in defect interspacings are found to be approximately 0.03mm with a maximum at 0.2 mm, this is at the same order as the errors predicted by simulations. The relative error in interspacings are all less than 2% which is comparable to simulated ideal case at 0.25%.

42 ENGINEERING↗

Stochastic derivative-free optimization using a trust region framework

This study presents a trust region algorithm to minimize a function f when one has access only to noise-corrupted function values f¯. The model-based algorithm dynamically adjusts its step length, taking larger steps when the model and function agree and smaller steps when the model is less accurate. The method does not require the user to specify a fixed pattern of points used to build local models and does not repeatedly sample points. If f is sufficiently smooth and the noise is independent and identically distributed with mean zero and finite variance, we prove that our algorithm produces iterates such that the corresponding function gradients converge in probability to zero. As a result, we present a prototype of our algorithm that, while simplistic in its management of previously evaluated points, solves benchmark problems in fewer function evaluations than do existing stochastic approximation methods.

97 MATHEMATICS AND COMPUTING↗

Leveraging staggered tessellation for enhanced spatial resolution in high-granularity calorimeters

Here we advance the concept of high-granularity calorimeters with staggered tessellations, underscoring the effectiveness of a design incorporating multifold staggering cycles based on hexagonal cells to enhance position resolution. Moreover, we introduce HEXPLIT, a sub-cell re-weighting algorithm tailored to harness staggered designs, resulting in additional performance improvements. By combining our proposed staggered design with HEXPLIT, we achieve an approximately twofold enhancement in position resolution for neutrons across a wide energy range, as compared to unstaggered designs. These findings hold the potential to elevate particle-flow performance across various forthcoming facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

BDDC algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

Here, a BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a new type of weighted average an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced. Assuming that the subdomains are all built from elements of a coarse triangulation of the given domain, and that in each subdomain the material parameters are consistent, one obtains a bound for the preconditioned linear system's condition number which is independent of the values and jumps of these parameters across the subdomains' interface. Numerical experiments, using the PETSc library, are also presented which support the theory and show the algorithms' effectiveness even for problems not covered by the theory. Also included are experiments with Brezzi-Douglas-Marini finite-element approximations.

97 MATHEMATICS AND COMPUTING↗

Traffic Signal Control With Adaptive Online-Learning Scheme Using Multiple-Model Neural Networks

This article proposes a new traffic signal control algorithm to deal with unknown-traffic-system uncertainties and reduce delays in vehicle travel time. Unknown-traffic-system dynamics are approximated using a recurrent neural network (NN). To accurately identify the traffic system model, an online-learning scheme is developed to switch among a set of candidate NNs (i.e., multiple-model NNs) based on their estimation errors. Then, a bank of optimal signal-timing controllers is designed based on the online identification of the traffic system. Simulation studies have been carried out for the obtained control strategies using multiple-model NNs, and the desired results have been obtained. Moreover, compared with the widely used actuated traffic signal control schemes, it is shown that the proposed method can reduce vehicle travel delays and improve traffic system robustness.

99 GENERAL AND MISCELLANEOUS↗

In vivo verification of proton beam path by using post-treatment PET/CT imaging

Purpose: The purpose of this study is to establish the in vivo verification of proton beam path by using proton-activated positron emission distributions. Methods: A total of 50 PET/CT imaging studies were performed on ten prostate cancer patients immediately after daily proton therapy treatment through a single lateral portal. The PET/CT and planning CT were registered by matching the pelvic bones, and the beam path of delivered protons was defined in vivo by the positron emission distribution seen only within the pelvic bones, referred to as the PET-defined beam path. Because of the patient position correction at each fraction, the marker-defined beam path, determined by the centroid of implanted markers seen in the post-treatment (post-Tx) CT, is used for the planned beam path. The angular variation and discordance between the PET- and marker-defined paths were derived to investigate the intrafraction prostate motion. For studies with large discordance, the relative location between the centroid and pelvic bones seen in the post-Tx CT was examined. The PET/CT studies are categorized for distinguishing the prostate motion that occurred before or after beam delivery. The post-PET CT was acquired after PET imaging to investigate prostate motion due to physiological changes during the extended PET acquisition. Results: The less than 2 deg. of angular variation indicates that the patient roll was minimal within the immobilization device. Thirty of the 50 studies with small discordance, referred as good cases, show a consistent alignment between the field edges and the positron emission distributions from the entrance to the distal edge. For those good cases, average displacements are 0.6 and 1.3 mm along the anterior-posterior (D{sub AP}) and superior-inferior (D{sub SI}) directions, respectively, with 1.6 mm standard deviations in both directions. For the remaining 20 studies demonstrating a large discordance (more than 6 mm in either D{sub AP} or D{sub SI}), 13 studies, referred as motion-after-Tx cases, also show large misalignment between the field edge and the positron emission distribution in lipomatous tissues around the prostate. These motion-after-Tx cases correspond to patients with large changes in volume of rectal gas between the post-Tx and the post-PET CTs. The standard deviations for D{sub AP} and D{sub SI} are 5.0 and 3.0 mm, respectively, for these motion-after-Tx cases. The final seven studies, referred to as position-error cases, which had a large discordance but no misalignment, were found to have deviations of 4.6 and 3.6 mm in D{sub AP} and D{sub SI}, respectively. The position-error cases correspond to a large discrepancy on the relative location between the centroid and pelvic bones seen in post-Tx CT and recorded x-ray radiographs. Conclusions: Systematic analyses of proton-activated positron emission distributions provide patient-specific information on prostate motion ({sigma}{sub M}) and patient position variability ({Sigma}{sub p}) during daily proton beam delivery. The less than 2 mm of displacement variations in the good cases indicates that population-based values of {Sigma}{sub p} and {sigma}{sub M} used in margin algorithms for treatment planning at the authors' institution are valid for the majority of cases. However, a small fraction of PET/CT studies (approximately 14%) with {approx}4 mm displacement variations may require different margins. Such data are useful in establishing patient-specific planning target volume margins.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Generative Vulnerability Assessment for Cyber-Physical Systems

Cyber-physical systems (CPS) are highly susceptible to malicious attacks due to their complex dynamics and interconnectivity. A comprehensive understanding of their vulnerabilities is essential for designing effective resilience measures. This paper presents a data-driven attack generative system for evaluating the vulnerability of CPS. The proposed approach formulates the vulnerability assessment problem as determining the feasibility of a specific attack set based on two boundary functions that represent the effectiveness and stealthiness of attacks. The attack generative model is trained using a custom loss function, with two universal approximators designed to learn the effectiveness and stealthiness functions simultaneously. Theoretical results for successful generation and asymptotic convergence of the resulting training algorithm are given. As a result, the proposed approach is evaluated via numerical simulation of an IEEE 14-bus system and gas pipeline systems, demonstrating its viability in learning how to attack nonlinear CPS and identify potential vulnerabilities.

Computer systems organization↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

Calculating Time-Integral Quantities in Depletion Calculations

A method referred to as tally nuclides is presented for accurately and efficiently calculating the time-step averages and integrals of any quantities that are weighted sums of atomic densities with constant weights during the step. The method allows all such quantities to be calculated simultaneously as a part of a single depletion solution with existing depletion algorithms. Some examples of the results that can be extracted include step-average atomic densities and macroscopic reaction rates, the total number of fissions during the step, and the amount of energy released during the step. Furthermore, the method should be applicable with several depletion algorithms, and the integrals or averages should be calculated with an accuracy comparable to that reached by the selected algorithm for end-of-step atomic densities. The accuracy of the method is demonstrated in depletion calculations using the Chebyshev rational approximation method. Here, we demonstrate how the ability to calculate energy release in depletion calculations can be used to determine the accuracy of the normalization in a constant-power burnup calculation during the calculation without a need for a reference solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Status on Establishing the Feasibility of Lead Slowing Down Spectroscopy for Direct Measurement of Plutonium in Used Fuel

Developing a method for the accurate, direct, and independent assay of the fissile isotopes in bulk materials (such as used fuel) from next-generation domestic nuclear fuel cycles is a goal of the Office of Nuclear Energy, Fuel Cycle R&D, Material Protection and Control Technology (MPACT) Campaign. To meet this goal, MPACT supports a multi-institutional collaboration to study the feasibility of Lead Slowing Down Spectroscopy. This technique is an active nondestructive assay method that has the potential to provide independent, direct measurement of Pu and U isotopic masses in used fuel with an uncertainty considerably lower than the approximately 10% typical of today’s confirmatory assay methods. This paper will present efforts on the development of time-spectral analysis algorithms, fast neutron detector advances, and validation and testing measurements.

LSDS, used fuel, spent fuel, nondestructive assay↗

Numerical solution of the Sinanoǧlu equation using a multicentre radial-angular grid

The pair functions that minimize the correlation energy of second-order many-body perturbation (MP2) theory (the Hylleraas functional) are obtained as solutions to the corresponding Sinanoglu equation by expanding them on a six-dimensional, multicenter, radial-angular grid of two electrons. Cusps in the pair functions at the nuclei are described numerically accurately by the multicenter grid. A cusp in each singlet pair function at the coalescence of the two electrons is taken into account analytically by a correlation factor. With a grid of approximately 10,000 points per atom, the MP2 correlation energies for atoms and polyatomic molecules are obtained usually within 0.1 mE h of the complete-basis-set results. The correlation factor, auxiliary basis functions, and a judicious choice of integration algorithms are all necessary to stabilize the grid-based MP2 and underlying Hartree–Fock (HF) calculations. The auxiliary basis set, in particular, largely restores the Hermiticity and diagonal dominance of the Fock matrix as well as furnishes virtual orbitals used in a resolution-of-the-identity approximation to lower the dimension of some integrals. The results of the grid-based HF and MP2 calculations without a correlation factor are found to suffer from large, nonsystematic errors frequently.

Many-body perturbation theory↗

Hyperspectral Image Classification Using Graph Clustering Methods

Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nyström extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes.

47 OTHER INSTRUMENTATION↗

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational capacity in hydrodynamic real-time hybrid simulation applied to simulate the dynamic response of floating offshore wind turbines

Real-time hybrid simulation (RTHS) mitigates similitude distortions in model-scale tests of floating offshore wind turbines (FOWTs) by coupling physical experiments with numerical models in real time. The coupling requires faster-than-real-time numerical computations to satisfy temporal similitude with the physical experiment, presenting a bottleneck for using more complex numerical models in RTHS. This paper presents a hydrodynamic-RTHS (hydro-RTHS) framework for FOWTs that simulates the hydrodynamics physically and the aerodynamics numerically with sensor feedback from the physical testing. The framework adapts the three-loop hardware architecture to leverage greater computational resources and mitigate strict temporal requirements, enabling more computationally demanding numerical analyses in hydro-RTHS. The three-loop hardware architecture integrates multiple machines, each dedicated to either numerical analysis or RTHS controls, with a rate-transition algorithm to synchronize the tasks executed across the different machine processors. Virtual and physical tests verified and validated the hydro-RTHS framework, respectively. The ”virtual” tests, which approximates the physical domain numerically, verified the RTHS framework with respect to a numerical full-scale complete FOWT model simulated in the open-source software, OpenFAST. The virtual tests were able to maintain comparable control signals while enabling greater computational resources for the numerical calculations. Real-world physical tests demonstrated that the hydro-RTHS framework computes aerodynamic forces similar to the complete OpenFAST model, validating the hydro-RTHS framework using the three-loop hardware architecture. Findings show that the hydro-RTHS framework with the three-loop hardware architecture is computationally efficient, with reserve capacity to simulate more complex problems due to the customized software, hardware, and rate-transition algorithm.

17 WIND ENERGY↗

An Efficient Sweep-Based Solver for the S N Equations on High-Order Meshes

In this study, we propose a graph-based sweep algorithm for solving the steady-state, monoenergetic discrete ordinates on meshes of high-order (HO) curved mesh elements. Our spatial discretization consists of arbitrarily HO discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights. Once the set of removed edges is determined, transport sweeps are performed by lagging the upwind dependency associated with the removed edges. The proposed algorithm is tested on several two-dimensional and three-dimensional meshes composed of HO curved mesh elements.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-184: Feasibility of Superabsorbent Polymers as a Buildup Material

Purpose: To investigate the feasibility of superabsorbent polymers as a buildup material for radiation therapy Methods: A standard bolus, a layered damp towel, and a superabsorbent polymer (SAP) phantom were created and scanned to compare the Hounsfield units of each buildup material. A single field plan was developed on Eclipse TPS with AAA dose calculation algorithm to examine dose buildup. Relative film dosimetery (EBT3) was performed to evaluate the surface dose with each buildup material. Each buildup material had an approximate thickness of 0.5 cm and 100 monitor units with 6MV were delivered with solid water placed underneath film to simulate backscatter and more realistic surface dose. Results: The average HU units of the bolus, wet towel, and SAP phantom were 75 (SD=3), -378 (SD=113), -198 (SD=45) respectively. AAA dose calculation demonstrated sufficient dose buildup in all three materials. The relative surfaces doses to film were 23.7% without buildup, 87.5% with 0.5 cm bolus, 92.4% for the SAP phantom, and 87.1% for the damp towel. Conclusion: We demonstrate that superabsorbent polymers can provide sufficient dose buildup. Furthermore, due to the form in which SAPs are traditionally manufactured, this material is less expensive conforms more easily to irregular surfaces than standard sheets of bolus. Also, as a substance which is designed to absorb and retain water efficiently, SAPs are much more comfortable and more consistent than damp towels.

60 APPLIED LIFE SCIENCES↗