Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Sparse Coding”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

High-Performance Sparse Matrix-Matrix Products on Intel KNL and Multicore Architectures

Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is vastly used in areas ranging from traditional numerical applications to recent big data analysis and machine learning. While many SpGEMM algorithms have been proposed, hardware specific optimizations for multi- and many-core processors are lacking and a detailed analysis of their performance under various use cases and matrices is not available. We firstly identify and mitigate multiple bottlenecks with memory management and thread scheduling on Intel Xeon Phi (Knights Landing or KNL). Specifically targeting multi- and many-core processors, we develop a hash-table-based algorithm and optimize a heap-based shared-memory SpGEMM algorithm. We investigate their performance together with other publicly available codes. Different from the literature, our evaluation also includes use cases that are representative of real graph algorithms, such as multi-source breadth-first search or triangle counting. Our hash-table and heap-based algorithms are showing significant speedups from libraries in the majority of the cases while different algorithms dominate the other scenarios with different matrix size, sparsity, compression factor and operation type. We wrap up in-depth evaluation results and make a recipe to give the best SpGEMM algorithm for target scenario. In conclusion, a critical finding is that hash-table-based SpGEMM gets a significant performance boost if the nonzeros are not required to be sorted within each row of the output matrix.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Ultrafast processing of pixel detector data with machine learning frameworks

Modern photon science performed at high repetition rate free-electron laser (FEL) facilities and beyond relies on 2D pixel detectors operating at increasing frequencies (towards 100 kHz at LCLS-II) and producing rapidly increasing amounts of data (towards TB/s). This data must be rapidly stored for offline analysis and summarized in real time for online feedback to the scientists. While at LCLS all raw data has been stored, at LCLS-II this would lead to a prohibitive cost; instead, enabling real time processing of pixel detector data (dark, gain, common mode, background, charge summing, subpixel position, photon counting, data summarization) allows reducing the size and cost of online processing, offline processing and storage by orders of magnitude while preserving full photon information. This could be achieved by taking advantage of the compressibility of sparse data typical for LCLS-II applications. Faced with a similar big data challenge a decade ago, computer vision stimulated revolutionary advances in machine learning hardware and software. We investigated if these developments are useful in the field of data processing for high speed pixel detectors and found that typical deep learning models and autoencoder architectures failed to yield useful noise reduction while preserving full photon information, presumably because of the very different statistics and feature sets in computer vision and radiation imaging. However, the raw performance of modern frameworks like Tensorflow inspired us to redesign in Tensorflow mathematically equivalent versions of the state-of-the-art, “classical” algorithms used at LCLS. The novel Tensorflow models resulted in elegant, compact and hardware agnostic code, gaining 1 to 2 orders of magnitude faster processing on an inexpensive consumer GPU, reducing by 3 orders of magnitude the projected cost of online analysis and compression without photon loss at LCLS-II. The novel Tensorflow models also enabled ongoing development of a pipelined hardware system expected to yield an additional 3 to 4 orders of magnitude speedup, necessary for meeting the data acquisition and storage requirements at LCLS-II, potentially enabling acquiring every single FEL pulse at full speed. Computer vision a decade ago was dominated by hand-crafted filters; their structure inspired the deep learning revolution resulting in modern deep convolutional networks; similarly, our novel Tensorflow filters provide inspiration for designing future deep learning models for ultrafast and efficient processing and classification of pixel detector images at FEL facilities.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Bayesian differential programming for robust systems identification under uncertainty

This paper presents a machine learning framework for Bayesian systems identification from noisy, sparse and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of recent developments in differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling. This allows an efficient inference of the posterior distributions over plausible models with quantified uncertainty, while the use of sparsity-promoting priors enables the discovery of interpretable and parsimonious representations for the underlying latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed methods, including nonlinear oscillators, predator–prey systems and examples from systems biology. Taken together, our findings put forth a flexible and robust workflow for data-driven model discovery under uncertainty. All codes and data accompanying this article are available at https://bit.ly/34FOJMj .

Science & Technology - Other Topics↗
DOE OSTI2016

A universal preconditioner for simulating condensed phase materials

We introduce a universal sparse preconditioner that accelerates geometry optimisation and saddle point search tasks that are common in the atomic scale simulation of materials. Our preconditioner is based on the neighbourhood structure and we demonstrate the gain in computational efficiency in a wide range of materials that include metals, insulators, and molecular solids. The simple structure of the preconditioner means that the gains can be realised in practice not only when using expensive electronic structure models but also for fast empirical potentials. Even for relatively small systems of a few hundred atoms, we observe speedups of a factor of two or more, and the gain grows with system size. An open source Python implementation within the Atomic Simulation Environment is available, offering interfaces to a wide range of atomistic codes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2011

Toward Supersonic Retropropulsion CFD Validation

This paper begins the process of verifying and validating computational fluid dynamics (CFD) codes for supersonic retropropulsive flows. Four CFD codes (DPLR, FUN3D, OVERFLOW, and US3D) are used to perform various numerical and physical modeling studies toward the goal of comparing predictions with a wind tunnel experiment specifically designed to support CFD validation. Numerical studies run the gamut in rigor from code-to-code comparisons to observed order-of-accuracy tests. Results indicate that this complex flowfield, involving time-dependent shocks and vortex shedding, design order of accuracy is not clearly evident. Also explored is the extent of physical modeling necessary to predict the salient flowfield features found in high-speed Schlieren images and surface pressure measurements taken during the validation experiment. Physical modeling studies include geometric items such as wind tunnel wall and sting mount interference, as well as turbulence modeling that ranges from a RANS (Reynolds-Averaged Navier-Stokes) 2-equation model to DES (Detached Eddy Simulation) models. These studies indicate that tunnel wall interference is minimal for the cases investigated; model mounting hardware effects are confined to the aft end of the model; and sparse grid resolution and turbulence modeling can damp or entirely dissipate the unsteadiness of this self-excited flow.

Kleb, Bil↗
NASA NTRS1995

Imaging spectrometer measurement of water vapor in the 400 to 2500 nm spectral region

The Airborne Visible-Infrared Imaging Spectrometer (AVIRIS) measures the total upwelling spectral radiance from 400 to 2500 nm sampled at 10 nm intervals. The instrument acquires spectral data at an altitude of 20 km above sea level, as images of 11 by up to 100 km at 17x17 meter spatial sampling. We have developed a nonlinear spectral fitting algorithm coupled with a radiative transfer code to derive the total path water vapor from the spectrum, measured for each spatial element in an AVIRIS image. The algorithm compensates for variation in the surface spectral reflectance and atmospheric aerosols. It uses water vapor absorption bands centered at 940 nm, 1040 nm, and 1380 nm. We analyze data sets with water vapor abundances ranging from 1 to 40 perceptible millimeters. In one data set, the total path water vapor varies from 7 to 21 mm over a distance of less than 10 km. We have analyzed a time series of five images acquired at 12 minute intervals; these show spatially heterogeneous changes of advocated water vapor of 25 percent over 1 hour. The algorithm determines water vapor for images with a range of ground covers, including bare rock and soil, sparse to dense vegetation, snow and ice, open water, and clouds. The precision of the water vapor determination approaches one percent. However, the precision is sensitive to the absolute abundance and the absorption strength of the atmospheric water vapor band analyzed. We have evaluated the accuracy of the algorithm by comparing several surface-based determinations of water vapor at the time of the AVIRIS data acquisition. The agreement between the AVIRIS measured water vapor and the in situ surface radiometer and surface interferometer measured water vapor is 5 to 10 percent.

Green, Robert O.↗
DOE OSTI2017

Compressive Classification for TEM-EELS

Acquiring atomic-resolution images of beam sensitive materials or under dynamic conditions (e.g. operando STEM) is very difficult and requires precise dose fractioning to minimize the dose delivered to the sample and acquire the data more rapidly than dynamics present. Typical methods of low-dose STEM imaging include adjusting the beam current, dwell-time, and probe Scanning transmission electron microscopy (STEM) is used routinely to obtain atomic-resolution images of a small selection of radiation tolerant materials under stable conditions.size. All three of these determine the dose over a spatial area in STEM. Recently, compressive sensing [1] has been applied to electron microscopy. The computational imaging method of inpainting [2] has been proposed as a method to reduce dose and increase acquisition speed for STEM. Inpainting is a technique to recover missing pixels in an image. By skipping pixels (randomly) during acquisition, a fourth dose-control mechanism is realized [3]. A few implementations of randomly-subsampled STEM exist (e.g., [4]). To make the concepts of compressive sensing accessible to the microscopy community we begin with an example using atomic resolution images of a GaAs crystal (see Figure 1). Because the crystal is periodic it has a sparse representation in reciprocal space. In fact, a sparse representation is a key component of compressive sensing. If an image is sub-sampled randomly we find that the Fourier transform remains sparse, but becomes increasing noisy as less and less data is acquired. Yet, by finding the peaks in the reciprocal image and removing the noise it is possible to recover atomic resolution images with only 1% of the pixels. Figure 1 shows the reconstruction process for GaAs sub-sampled at 50%, 10%, 5%, and 1%. Periodic images form a special class for which the optimal sampling approach (according to CS theory) is a random selection of pixels. For non-periodic images, such as those arising in in-situ STEM, methods such as dictionary learning are necessary [2,5]. The data can be compressed in time for TEM [5] or pixels can be skipped randomly for STEM. There are several issues that arise in developing a random scan for STEM [4] and a coded aperture for TEM. The remainder of the talk will address these issues. References: [1] E Candes and M Wakin. Signal Processing Magazine, IEEE. 2(25) (2008), pp. 21. [2] A Stevens, Pu Y, Sun Y, et al. Artificial Intelligence & Statistics (AISTATS), 2017. [3] A Stevens, H Yang, L Carin et al. Microscopy 63(1), (2014), pp. 41. [4] L Kovarik, A Stevens, A Liyu et al. Appl. Phys. Lett. 109, 164102 (2016). [5] A Stevens, L Kovarik, P Abellan et al. Adv. Structural and Chemical Imaging 1(10), (2015), pp. 1. [6] Supported by the Chemical Imaging, Signature Discovery, and Analytics in Motion Initiatives at PNNL. PNNL is operated by Battelle Memorial Inst. for the US DOE; contract DE-AC05-76RL01830.

Hao, Weituo↗
DOE OSTI2022

Guidelines for Publicly Archiving Terrestrial Model Data to Enhance Usability, Intercomparison, and Synthesis

Scientific communities are increasingly publishing data to evaluate, accredit, and build on published research. However, guidelines for curating data for publication are sparse for model-related research, limiting the usability of archived simulation data. In particular, there are no established guidelines for archiving data related to terrestrial models that simulate land processes and their coupled interactions with climate. Terrestrial modelers have a unique set of challenges when publishing data due to the diversity of scientific domains, research questions, and the types and scales of simulations. Researchers in the U.S. Department of Energy’s (DOE) projects use a variety of multiscale models to advance robust predictions of terrestrial and subsurface ecosystem processes. Here, we synthesize archiving needs for data associated with different DOE models, and provide guidelines for publishing terrestrial model data components following FAIR (Findable, Accessible, Interoperable, Reusable) principles. The guidelines recommend archiving model inputs and testing data used in final simulation runs along with associated codes, workflow scripts, and metadata in public repositories. Researchers should consider archiving model outputs if they are within the storage limits of the repository. We also provide considerations for how to bundle files into different data publications with citable digital object identifiers. Finally, we identify repository features and tools that would enable storage and reuse of model data. Given the diversity of DOE terrestrial models, these guidelines are transferable to other model types and will enable efficient reuse of simulation data for purposes such as model intercomparisons, initialization, benchmarking, synthesis, and comparisons with field observations.

58 GEOSCIENCES↗
DOE OSTI2019

Multi-fidelity classification using Gaussian processes: Accelerating the prediction of large-scale computational models

We report that machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational models which typically take days to run, thus hindering the potential of machine learning tools. In this work, we present a novel classifier that takes advantage of lower fidelity models and inexpensive approximations to predict the binary output of expensive computer simulations. We postulate an autoregressive model between the different levels of fidelity with Gaussian process priors. We adopt a fully Bayesian treatment for the hyper-parameters and use Markov Chain Monte Carlo samplers. We take advantage of the probabilistic nature of the classifier to implement active learning strategies. We also introduce a sparse approximation to enhance the ability of the multi-fidelity classifier to handle a large amount of low fidelity samples. We test these multi-fidelity classifiers against their single-fidelity counterpart with synthetic data, showing a median computational cost reduction of 23% for a target accuracy of 90%. In an application to cardiac electrophysiology, the multi-fidelity classifier achieves an F1 score, the harmonic mean of precision and recall, of 99.6% compared to 74.1% of a single-fidelity classifier when both are trained with 50 samples. In general, our results show that the multi-fidelity classifiers outperform their single-fidelity counterpart in terms of accuracy in all cases. Finally, we envision that this new tool will enable researchers to study classification problems that would otherwise be prohibitively expensive. Source code is available at https://github.com/fsahli/MFclass.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗
DOE OSTI2018

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., from 2D grid or mesh domains) and certain non-planar graphs (specifically for 3D grids and meshes). For planar graphs with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of O{log n} and latency by a factor of O{log n}. For non-planar cases, our algorithm can reduce the per-process communication volume by 3× and latency by O{n^1/3} times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in superLU. Our new 3D code achieves speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D superLU when run on 24,000 cores of a Cray XC30.

Sao, Piyush↗
DOE OSTI2022

Inference of bipolar neutrino flavor oscillations near a core-collapse supernova based on multiple measurements at Earth

Neutrinos in compact-object environments, such as core-collapse supernovae, can experience various kinds of collective effects in flavor space, engendered by neutrino-neutrino interactions. These include “bipolar” collective oscillations, which are exhibited by neutrino ensembles where different flavors dominate at different energies. Considering the importance of neutrinos in the dynamics and nucleosynthesis in these environments, it is desirable to ascertain whether an Earth-based detection could contain signatures of bipolar oscillations that occurred within a supernova envelope. To that end, we, in this study, continue examining a cost-function formulation of statistical data assimilation (SDA) to infer solutions to a small-scale model of neutrino flavor transformation. SDA is an inference paradigm designed to optimize a model with sparse data. Our model consists of two monoenergetic neutrino beams with different energies emanating from a source and coherently interacting with each other and with a matter background, with radially varying interaction strengths. We attempt to infer flavor transformation histories of these beams using simulated measurements of the flavor content at locations “in vacuum” (that is, far from the source), which could in principle correspond to Earth-based detectors. Within the scope of this small-scale model, we found that: (i) based on such measurements, the SDA procedure is able to infer whether bipolar oscillations had occurred within the protoneutron star envelope, and (ii) if the measurements sample the full amplitude of the neutrino oscillations in vacuum, then the amplitude of the prior bipolar oscillations is well predicted. This result intimates that the inference paradigm can well complement numerical integration codes, via its ability to infer flavor evolution at physically inaccessible locations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Analysis of the Temporal Response of Coupled Asymmetrical Zero-Power Subcritical Bare Metal Reactor Systems

The behavior of symmetrical coupled-core systems has been extensively studied, yet there is a dearth of research on asymmetrical systems due to the increased complexity of the analysis of such systems. In this research, the multipoint kinetics method is applied to asymmetrical zeropower, subcritical, bare metal reactor systems. Existing research on asymmetrical reactor systems assumes symmetry in the neutronic coupling; however, it will be shown that this cannot always be assumed. Deep subcriticality adds another layer of complexity and requires modification of the multipoint kinetics equations to account for the effect of the external neutron source. A modified set of multipoint kinetics equations is derived with this in mind. Subsequently, the Rossi-alpha equations are derived for a two-region asymmetrical reactor system. The predictive capabilities of the radiation transport code MCNP6 for neutron noise experiments are shown in a comparison to the results of a series of Rossi-alpha measurements performed by J. Mihalczo utilizing a coupled set of symmetrical bare highly-enriched uranium (HEU) cylinders. The ptrac option within MCNP6 can generate time-tagged counts in a cell (list-mode data). The list-mode data can then be processed similarly to measured data to obtain values for system parameters such as the dual prompt neutron decay constants observable in a coupled system. The results from the ptrac simulations agree well with the historical measured values. A series of case studies are conducted to study the effects of geometrical asymmetry in the coupling between two bare metal HEU cylinders. While the coupling behavior of symmetrical systems has been reported on extensively, that of asymmetrical systems remains sparse. In particular, it appears that there has been no previous research in obtaining the coupling time constants for asymmetrically-coupled systems. The difficulty in observing such systems is due in part to the inability to determine the individual coupling coefficients from measurement: unlike the symmetrical cases, only the product of the values can be obtained. A method is proposed utilizing MCNP6 tally ratios to separate the coupling coefficients for such systems. This work provides insight into the behavior of asymmetrically-coupled systems as the separation distance between the two cores is changed and also as the asymmetry is increased. As the asymmetry increases, both the slower and the faster observable prompt neutron decay constants increase in magnitude. The coupling time constants are determined from the measured decay constants. As the separation distance increases, both coupling coefficients decrease as expected. Based on these findings, an effective computational method utilizing MCNP6 and the Rossialpha technique can be applied to the prediction of asymmetrical coupled system measurements.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2019

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D algorithm for sparse LU uses a three-dimensional MPI process grid, exploits elimination tree parallelism, and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., those arising from 2D grid or mesh discretizations) and certain non-planar graphs (specifically for 3D grids and meshes). For a planar graph with $n$ vertices, our algorithm reduces communication volume asymptotically in $n$ by a factor of $\mathscr{O}$ $\Big(\sqrt{log \ n}\Big)$ and latency by a factor of $\mathscr{O}$ $(log \ n)$. For nonplanar cases, our algorithm can reduce the per-process communication volume by 3× and latency by $\mathscr{O}$ $\Big(n^\frac13\Big)$ times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in SuperLU_DIST. Our new 3D code achieves empirical speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D SuperLU_DIST when run on 24,000 cores of a Cray XC30. We extend the 3D algorithm for heterogeneous architectures by adding the Highly Asynchronous Lazy Offload (Halo) algorithm for co-processor offload. On 4096 nodes of a Cray XK7 with 32,768 CPU cores and 4096 Nvidia K20x GPUs, the 3D algorithm achieves empirical speedups up to 24× for planar graphs and 3.5× for non-planar graphs over the baseline 2D SuperLU_DIST with co-processor acceleration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits

In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes. In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior. We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space. This mapping predicts mean-field critical exponents v=–1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning

Large language models (LLMs) are increasingly adapted to downstream tasks via reinforcement learning (RL) methods like Group Relative Policy Optimization (GRPO), which often require thousands of rollouts to learn new tasks. We argue that the interpretable nature of language often provides a much richer learning medium for LLMs, compared to policy gradients derived from sparse, scalar rewards. To test this, we introduce GEPA (Genetic-Pareto), a prompt optimizer that thoroughly incorporates natural language reflection to learn high-level rules from trial and error. Given any AI system containing one or more LLM prompts, GEPA samples trajectories (e.g., reasoning, tool calls, and tool outputs) and reflects on them in natural language to diagnose problems, propose and test prompt updates, and combine complementary lessons from the Pareto frontier of its own attempts. As a result of GEPA's design, it can often turn even just a few rollouts into a large quality gain. Across six tasks, GEPA outperforms GRPO by 6% on average and by up to 20%, while using up to 35x fewer rollouts. GEPA also outperforms the leading prompt optimizer, MIPROv2, by over 10% (e.g., +12% accuracy on AIME-2025), and demonstrates promising results as an inference-time search strategy for code optimization. We release our code at https://github.com/gepa-ai/gepa.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Towards a self-consistent model of the convective core boundary in upper main sequence stars: I. 2.5D and 3D simulations

There is strong observational evidence that the convective cores of intermediate-mass and massive main sequence stars are substantially larger than those predicted by standard stellar-evolution models. However, it is unclear what physical processes cause this phenomenon or how to predict the extent and stratification of stellar convective boundary layers. Convective penetration is a thermal-timescale process that is likely to be particularly relevant during the slow evolution on the main sequence. We use our low-Mach-number S EVEN -L EAGUE H YDRO code to study this process in 2.5D and 3D geometries. Starting with a chemically homogeneous model of a 15 M ⊙ zero-age main sequence star, we construct a series of simulations with the luminosity increased and opacity decreased by the same factor, ranging from 10 3 to 10 6 . After reaching thermal equilibrium, all of our models show a clear penetration layer; its thickness becomes statistically constant in time and it is shown to converge upon grid refinement. The penetration layer becomes nearly adiabatic with a steep transition to a radiative stratification in simulations at the lower end of our luminosity range. This structure corresponds to the adiabatic ‘step overshoot’ model often employed in stellar-evolution calculations. The simulations with the highest and lowest luminosity differ by less than a factor of two in the penetration distance. The high computational cost of 3D simulations makes our current 3D data set rather sparse. Depending on how we extrapolate the 3D data to the actual luminosity of the initial stellar model, we obtain penetration distances ranging from 0.09 to 0.44 pressure scale heights, which is broadly compatible with observations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

WE-H-BRA-08: A Monte Carlo Cell Nucleus Model for Assessing Cell Survival Probability Based On Particle Track Structure Analysis

Purpose: To correlate the damage produced by particles of different types and qualities to cell survival on the basis of nanodosimetric analysis and advanced DNA structures in the cell nucleus. Methods: A Monte Carlo code was developed to simulate subnuclear DNA chromatin fibers (CFs) of 30nm utilizing a mean-free-path approach common to radiation transport. The cell nucleus was modeled as a spherical region containing 6000 chromatin-dense domains (CDs) of 400nm diameter, with additional CFs modeled in a sparser interchromatin region. The Geant4-DNA code was utilized to produce a particle track database representing various particles at different energies and dose quantities. These tracks were used to stochastically position the DNA structures based on their mean free path to interaction with CFs. Excitation and ionization events intersecting CFs were analyzed using the DBSCAN clustering algorithm for assessment of the likelihood of producing DSBs. Simulated DSBs were then assessed based on their proximity to one another for a probability of inducing cell death. Results: Variations in energy deposition to chromatin fibers match expectations based on differences in particle track structure. The quality of damage to CFs based on different particle types indicate more severe damage by high-LET radiation than low-LET radiation of identical particles. In addition, the model indicates more severe damage by protons than of alpha particles of same LET, which is consistent with differences in their track structure. Cell survival curves have been produced showing the L-Q behavior of sparsely ionizing radiation. Conclusion: Initial results indicate the feasibility of producing cell survival curves based on the Monte Carlo cell nucleus method. Accurate correlation between simulated DNA damage to cell survival on the basis of nanodosimetric analysis can provide insight into the biological responses to various radiation types. Current efforts are directed at producing cell survival curves for high-LET radiation.

60 APPLIED LIFE SCIENCES↗