Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 883 records · Page 49

TEAMER - Acoustic Particle Velocity Measurements - CRADA 601 (Abstract)

With relatively few deployments of tidal turbines, the extent and effect of underwater sounds generated from these turbines is not well understood. The University of Washington (UW) is deploying a cross-flow turbine system, the Turbine Lander, in the entrance channel to Sequim Bay. The deployment of this system provides an opportunity to understand the noise radiated by the turbine and its sources. There are three hypothesized sound sources associated with operation of the turbine: 1) a continuous tone associated with energized power electronics; 2) sound associated with the generator when the turbine is rotating; and 3) sound associated with the bearing pack that supports the rotor. PNNL is collaborating with UW and Integral Consulting Inc. (Integral) to simultaneously measure sound sources using three different devices. The NoiseSpotter®, an acoustic sensor system designed by Integral, measures acoustic pressure and a three-dimensional particle velocity vector. The NoiseSpotter, along with a commercial-off-the-shelf acoustic particle motion and pressure sensor (M20-105, Geospectrum Technologies Inc.) owned by PNNL will be deployed on the seabed approximately 50-100 m from the Turbine Lander. UW will concurrently deploy Drifting Acoustic Instrumentation SYstems (DAISYs) to characterize acoustic pressure near the Turbine Lander and localize sounds using a Time Delay of Arrival (TDOA) algorithm. Integral, UW, and PNNL will collaborate on data analysis and interpretation, with the intention of jointly authoring an archival paper on the results. The noise generated from the Turbine Lander is not expected to be significant, yet this experiment will help to evaluate the efficacy of combining technologies to characterize noise and provide insights for approaches to consider for future turbine deployments at other locations.

16 TIDAL AND WAVE POWER↗

iTOUGH2 Universal Optimization Using the PEST Protocol

iTOUGH2 (http://www-esd.lbl.gov/iTOUGH2) is a computer program for parameter estimation, sensitivity analysis, and uncertainty propagation analysis [Finsterle, 2007a, b, c]. iTOUGH2 contains a number of local and global minimization algorithms for automatic calibration of a model against measured data, or for the solution of other, more general optimization problems (see, for example, Finsterle [2005]). A detailed residual and estimation uncertainty analysis is conducted to assess the inversion results. Moreover, iTOUGH2 can be used to perform a formal sensitivity analysis, or to conduct Monte Carlo simulations for the examination for prediction uncertainties. iTOUGH2's capabilities are continually enhanced. As the name implies, iTOUGH2 is developed for use in conjunction with the TOUGH2 forward simulator for nonisothermal multiphase flow in porous and fractured media [Pruess, 1991]. However, iTOUGH2 provides FORTRAN interfaces for the estimation of user-specified parameters (see subroutine USERPAR) based on user-specified observations (see subroutine USEROBS). These user interfaces can be invoked to add new parameter or observation types to the standard set provided in iTOUGH2. They can also be linked to non-TOUGH2 models, i.e., iTOUGH2 can be used as a universal optimization code, similar to other model-independent, nonlinear parameter estimation packages such as PEST [Doherty, 2008] or UCODE [Poeter and Hill, 1998]. However, to make iTOUGH2's optimization capabilities available for use with an external code, the user is required to write some FORTRAN code that provides the link between the iTOUGH2 parameter vector and the input parameters of the external code, and between the output variables of the external code and the iTOUGH2 observation vector. While allowing for maximum flexibility, the coding requirement of this approach limits its applicability to those users with FORTRAN coding knowledge. To make iTOUGH2 capabilities accessible to many application models, the PEST protocol [Doherty, 2007] has been implemented into iTOUGH2. This protocol enables communication between the application (which can be a single 'black-box' executable or a script or batch file that calls multiple codes) and iTOUGH2. The concept requires that for the application model: (1) Input is provided on one or more ASCII text input files; (2) Output is returned to one or more ASCII text output files; (3) The model is run using a system command (executable or script/batch file); and (4) The model runs to completion without any user intervention. For each forward run invoked by iTOUGH2, select parameters cited within the application model input files are then overwritten with values provided by iTOUGH2, and select variables cited within the output files are extracted and returned to iTOUGH2. It should be noted that the core of iTOUGH2, i.e., its optimization routines and related analysis tools, remains unchanged; it is only the communication format between input parameters, the application model, and output variables that are borrowed from PEST. The interface routines have been provided by Doherty [2007]. The iTOUGH2-PEST architecture is shown in Figure 1. This manual contains installation instructions for the iTOUGH2-PEST module, and describes the PEST protocol as well as the input formats needed in iTOUGH2. Examples are provided that demonstrate the use of model-independent optimization and analysis using iTOUGH2.

15 GEOTHERMAL ENERGY↗

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗

Error Analysis of ZFP Compression for Floating-Point Data

Compression of floating-point data will play an important role in high-performance computing as data bandwidth and storage become dominant costs. Lossy compression of floating-point data is powerful, but theoretical results are needed to bound its errors when used to store look-up tables, simulation results, or even the solution state during the computation. In this paper, we analyze the round-off error introduced by ZFP, a lossy compression algorithm. Here, the stopping criteria for ZFP depends on the compression mode specified by the user: fixed rate, fixed accuracy, or fixed precision [P. Lindstrom, ZFP 0.5.3 Documentation, 2018]. While most of our discussion is focused on the fixed precision mode of ZFP, we establish a bound on the error introduced by all three compression modes. In order to tightly capture the error, first we introduce a vector space that allows us to work with binary representations of components. Under this vector space, we define operators that implement each step of the ZFP compression and decompression to establish a bound on the error caused by ZFP. To conclude, numerical tests are provided to demonstrate the accuracy of the established bounds.

97 MATHEMATICS AND COMPUTING↗

PREDICTING CORONAL MASS EJECTIONS USING MACHINE LEARNING METHODS

Of all the activity observed on the Sun, two of the most energetic events are flares and coronal mass ejections (CMEs). Usually, solar active regions that produce large flares will also produce a CME, but this is not always true. Despite advances in numerical modeling, it is still unclear which circumstances will produce a CME. Therefore, it is worthwhile to empirically determine which features distinguish flares associated with CMEs from flares that are not. At this time, no extensive study has used physically meaningful features of active regions to distinguish between these two populations. As such, we attempt to do so by using features derived from (1) photospheric vector magnetic field data taken by the Solar Dynamics Observatory ’s Helioseismic and Magnetic Imager instrument and (2) X-ray flux data from the Geostationary Operational Environmental Satellite’s X-ray Flux instrument. We build a catalog of active regions that either produced both a flare and a CME (the positive class) or simply a flare (the negative class). We then use machine-learning algorithms to (1) determine which features distinguish these two populations, and (2) forecast whether an active region that produces an M- or X-class flare will also produce a CME. We compute the True Skill Statistic, a forecast verification metric, and find that it is a relatively high value of ∼0.8 ± 0.2. We conclude that a combination of six parameters, which are all intensive in nature, will capture most of the relevant information contained in the photospheric magnetic field.

79 ASTRONOMY AND ASTROPHYSICS↗

A thermomechanical anisotropic model for shock loading of elastic-plastic and elastic-viscoplastic materials with application to jointed rock

Here, a large deformation thermomechanical model is developed for shock loading of a material that can exhibit elastic and inelastic anisotropy. Use is made of evolution equations for a triad of microstructural vectors m i (i=1,2,3) which model elastic deformations and directions of anisotropy. Specific constitutive equations are presented for a material with orthotropic elastic response. The rate of inelasticity depends on an orthotropic yield function that can be used to model weak fault planes with failure in shear and which exhibits a smooth transition to isotropic response at high compression. Moreover, a robust, strongly objective numerical algorithm is proposed for both rate-independent and rate-dependent response. The predictions of the continuum model are examined by comparison with exact steady-state solutions. Also, the constitutive equations are used to obtain a simplified continuum model of jointed rock which is compared with high fidelity numerical solutions that model a persistent system of joints explicitly in the rock medium.

36 MATERIALS SCIENCE↗

Electronic structures of [001]- and [111]-oriented InSb and GaSb free-standing nanowires

We report on a theoretical study of the electronic structures of InSb and GaSb nanowires oriented along the [001] and [111] crystallographic directions. The nanowires are described by atomistic, tight-binding models, including spin-orbit interaction. The band structures and the wave functions of the nanowires are calculated by means of a Lanczos iteration algorithm. For the [001]-oriented InSb and GaSb nanowires, the systems with both square and rectangular cross sections are considered. Here, it is found that all the energy bands are doubly degenerate. Although the lowest conduction bands in these nanowires show good parabolic dispersions, the top valence bands show rich and complex structures. In particular, the topmost valence bands of the nanowires with a square cross section show a double maximum structure. In the nanowires with a rectangular cross section, this double maximum structure is suppressed, and the top valence bands gradually develop into parabolic bands as the aspect ratio of the cross section is increased. For the [111]-oriented InSb and GaSb nanowires, the systems with hexagonal cross sections are considered. It is found that all the bands at the Γ-point are again doubly degenerate. However, some of them will split into non-degenerate bands when the wave vector moves away from the Γ-point. Although the lowest conduction bands again show good parabolic dispersions, the topmost valence bands do not show the double maximum structure. Instead, they show a single maximum structure with its maximum at a wave vector slightly away from the Γ-point. The wave functions of the band states near the band gaps of the [001]- and [111]-oriented InSb and GaSb nanowires are also calculated and are presented in terms of probability distributions in the cross sections. It is found that although the probability distributions of the band states in the [001]-oriented nanowires with a rectangular cross section could be qualitatively described by one-band effective mass theory, the probability distributions of the band states in the [001]-oriented nanowires with a square cross section and the [111]-oriented nanowires with a hexagonal cross section show characteristic patterns with symmetries closely related to the irreducible representations of the relevant double point groups and, in general, go beyond the prediction of a simple one-band effective mass theory. We also investigate the effects of quantum confinement on the band structures of the [001]- and [111]-oriented InSb and GaSb nanowires and present an empirical formula for the description of quantization energies of the band edge states in the nanowires, which could be used to estimate the enhancement of the band gaps of the nanowires as a result of quantum confinement. The size dependencies of the electron and hole effective masses in these nanowires are also investigated and discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient track-before detect algorithm with minimal prior knowledge

Apparatus, system and method for tracking an image target in a system, wherein a system receives an image comprising a plurality of pixels. The received image is processed via a plurality of different recursive motion model kernels in parallel to provide a plurality of kernel outputs, wherein each of the motion model kernels may include a respective pixel mask. Per-pixel energy is estimated of at least some of the plurality of kernel outputs. Velocity of at least one of the image pixels may also be estimated by generating a directional energy vector for each motion model kernel. The per-pixel energy and velocity estimates are fused to produce a fused estimate representing at least some of the motion model kernels for the image.

42 ENGINEERING↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

TU-AB-202-05: GPU-Based 4D Deformable Image Registration Using Adaptive Tetrahedral Mesh Modeling

Purpose: Deformable image registration (DIR) has been employed today as an automated and effective segmentation method to transfer tumor or organ contours from the planning image to daily images, instead of manual segmentation. However, the computational time and accuracy of current DIR approaches are still insufficient for online adaptive radiation therapy (ART), which requires real-time and high-quality image segmentation, especially in a large datasets of 4D-CT images. The objective of this work is to propose a new DIR algorithm, with fast computational speed and high accuracy, by using adaptive feature-based tetrahedral meshing and GPU-based parallelization. Methods: The first step is to generate the adaptive tetrahedral mesh based on the image features of a reference phase of 4D-CT, so that the deformation can be well captured and accurately diffused from the mesh vertices to voxels of the image volume. Subsequently, the deformation vector fields (DVF) and other phases of 4D-CT can be obtained by matching each phase of the target 4D-CT images with the corresponding deformed reference phase. The proposed 4D DIR method is implemented on GPU, resulting in significantly increasing the computational efficiency due to its parallel computing ability. Results: A 4D NCAT digital phantom was used to test the efficiency and accuracy of our method. Both the image and DVF results show that the fine structures and shapes of lung are well preserved, and the tumor position is well captured, i.e., 3D distance error is 1.14 mm. Compared to the previous voxel-based CPU implementation of DIR, such as demons, the proposed method is about 160x faster for registering a 10-phase 4D-CT with a phase dimension of 256×256×150. Conclusion: The proposed 4D DIR method uses feature-based mesh and GPU-based parallelism, which demonstrates the capability to compute both high-quality image and motion results, with significant improvement on the computational speed.

60 APPLIED LIFE SCIENCES↗

Localized Exponential Time Differencing Method for Shallow Water Equations: Algorithms and Numerical Study

Here, we explore the performance of the exponential time differencing (ETD) method applied to the rotating shallow water equations. Comparing with explicit time stepping of the same order accuracy in time, the ETD algorithms could reduce the computational time in many cases by allowing the use of large time step sizes while still maintaining numerical stability. To accelerate the ETD simulations, we propose a localized approach that synthesizes the ETD method and overlapping domain decomposition. By dividing the original problem into many subdomain problems of smaller sizes and solving them locally, the proposed approach could speed up the calculation of matrix exponential vector products. Several standard test cases for shallow water equations of one or multiple layers are considered. The results show great potential of the localized ETD method for high-performance computing because each subdomain problem can be naturally solved in parallel at every time step.

58 GEOSCIENCES↗

A Machine Learning Method for the Forensics Attribution of Separated Plutonium

Plutonium (Pu) source attribution would be a powerful tool to support nuclear nonproliferation efforts. This capability to find the source of a Pu sample would act as a deterrent to smuggling efforts, and also help regulatory agencies verify declared nuclear activities. Work at Texas A&M University yielded a nuclear forensics methodology, which is capable of determining separated Pu’s reactor of origin, fuel burnup, and the time since irradiation (TSI)—three parameters of interest. The methodology used a set of ten intra-element isotopic ratios found in separated Pu, which was compared to a library of isotopic ratio values produced using neutronics simulations for reactors of interest. By calculating the probability that unknown Pu sample’s isotopic ratio set matched a set in the library, the methodology could predict the three parameters of interest of the sample. One shortcoming of this methodology was an inability to correctly attribute spoofed Pu, where Pu sourced from two different reactors or two different fuel burnup levels are mixed. A new methodology to rectify this vulnerability using machine learning (ML) technique is developed, instead of the maximum likelihood calculation previously used and the results are satisfactory. The ML approach leverages the existing simulated data for training the algorithm, but use them efficiently by only using intra-element isotope ratios that contribute to the attribution one of the three parameters at a time. Previously, all isotope ratios were used to attribute all three parameters together. The new methodology attributes the Pu parameters in three steps, one for each parameter, rather than resolving all of the three parameters simultaneously like the previous maximum likelihood approach. First, a support vector machine classifier with a set of seven isotopic ratios finds the reactor of origin and a set of regression models trained using gaussian process predicts the burnup with a different set of seven isotopes. Finally, TSI is calculated analytically using decay equations. Thus far, the new methodology is capable of attributing pure Pu samples and has been validated using experimental data. The next step will to be augment the classifier training data set with spoofed Pu data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Application of a new hybrid particle swarm optimization-mixed kernels function-based support vector machine model for reservoir porosity prediction: A case study in Jacksonburg-Stringtown oil field, West Virginia, USA

Porosity is a fundamental property that characterizes the storage capability of fluid and gas-bearing formations in a reservoir. An accurate porosity value can be measured from core samples in the laboratory; however, core analysis is expensive and time consuming. Well-log data can be used to calculate porosity, but the availability of log suites is often limited in mature fields. Therefore, robust porosity prediction requires integration of core-measured porosity with available well-log suites to control for changes in lithology and fluid content. A support vector machine (SVM) model with mixed kernel function (MKF) is used to construct the relationship between limited conventional well-log suites and sparse core data. Porosity is the desired output, and two conventional well-log responses (gamma ray [GR] and bulk density) and three well-log-derived parameters (the slope of GR, the slope of density, and [Formula: see text]) are input parameters. A global stochastic searching algorithm, particle swarm optimization (PSO), is applied to improve the efficiency of locating the appropriate values of five control parameters in MKF-SVM model. The results of SVM with different traditional kernel functions were compared, and the MKF-SVM model provided an improvement over the traditional SVM model. To confirm the advantage of the hybrid PSO-MKF-SVM model, the results from three models: (1) radial basis function (RBF)-based least-squares SVM, (2) multilayer perceptron artificial neural network (ANN), and (3) RBF ANN, are compared with the result of the hybrid PSO-MKF-SVM model. The results indicate that the hybrid PSO-MKF-SVM model improves porosity prediction with the highest correlation coefficient ([Formula: see text] of 0.9560), the highest coefficient of determination ([Formula: see text] of 0.9140), the lowest root-mean-square error (1.6505), average absolute error value (1.4050), and maximum absolute error (2.717).

Geochemistry & Geophysics↗

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

Reduced Common-Mode Voltage PWM Scheme for Full-SiC Three-Level Uninterruptible Power Supply With Small DC-Link Capacitors

In this article, a pulsewidth modulation (PWM) scheme for three-level full-SiC uninterruptible power supplies is developed to achieve a high power density. Two key passive components are selected for size reduction of the ac-ac stage: common-mode (CM) EMI filter, and dc-link capacitors. To reduce the CM noise, a new vector combination is proposed based on synchronous switching among three-phases. The proposed combinations align CM voltage (CMV) to be a single pulse per switching period. Owing to the simple shape, CMV cancellation between a three-level rectifier and inverter can be maximally utilized. A transition between the three combinations can control the drift of neutral point voltage. An equivalent carrier-based implementation is developed. Second, a simple algorithm to compensate neutral point voltage fluctuation is proposed both for differential mode (DM) and CM output voltage. Low-order harmonics on three-phase currents and an additional high-frequency CM noise by misaligned switching instant can be eliminated. The proposed compensation can be implemented by a simple correction on carrier slopes and injected zero-sequence voltage. The proposed PWM scheme is verified with 20-kW full-SiC UPS switching at 60 kHz with 140 μF dc-link capacitors.

42 ENGINEERING↗

SU-E-J-140: Simulation Study Using Thermoacoustics to Image Proton Dose and Range in Water and Skull Phantom

Purpose: In this study, thermoacoustic pressure signals generated from a proton beam were simulated in water and currently within a skull phantom to investigate the sensitivity of radioacoustic CT imaging in the brain. Methods: Thermoacoustically generated pressure signals from a pulse pencil proton beam (12, 15, 20, and 27cm range) were simulated in water. These simulated pressure signal are detected using a (71) transducer array placed along the surface of a cylinder (30cm × 40cm) and rotated over 2π (in 2 degree increments), where the normal vector to the surface of each transducer intersects the isocenter of the scanner. Currently, a software skull phantom is positioned at isocenter, where the scattering, absorption and speed of dispersion of the thermoacoustic signal through a three layer cortical-trabecular-cortical structure is being simulated. Based on data obtained from the literature, the effects of acoustic attenuation and speed-of-sound (dispersion) will be applied within the 3D FBP algorithm to obtain dosimetric images. Results: Based on hydrophone detector specifications, a 0.5MHz bandwidth and 50dB re 1μPa per Hz^1/2, a 1.6cGy sensitivity at the Bragg peak was demonstrated while maintaining a 1.0 mm (FWHM) range resolution along the central axis of the beam. Utilizing this same information, the integral dose within the Bragg peak and distal edge compared to MC had a 2% (statistical) and 5% voxel-based RMS at this same dose sensitivity. We plan to present preliminary data determining the range sensitivity for a head phantom for this scanner design and the feasibility of imaging the proton dose in patients with a brain tumor undergoing therapy. Conclusion: RACT scanner provides 3D dosimetric images with 1.6cGy (Bragg peak) sensitivity with 1mm range sensitivity. Simulations will be performed to determine feasibility to treat brain cancer patients.

60 APPLIED LIFE SCIENCES↗