Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TiMo”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Dark dimension and the grand unification of forces

The dark dimension scenario, predicting one extra mesoscopic dimension in the micron range, has emerged by applying various swampland principles to the dark energy. In this note we find that realizing the grand unification of gauge forces is highly constraining in this context. Without actually constructing any grand unified theory (GUT) models, we argue that the mere assumption of grand unification of forces in this scenario, together with the experimental bounds on massive replicas of the Standard Model gauge bosons, predicts an upper bound for the GUT scale, 𝑀 GUT ≲ 10 16 GeV. Combined with the experimental bound on the proton lifetime, this predicts that the 𝑋 gauge boson mediating proton decay is a 5D solitonic string of Planckian tension stretched across a length scale 𝐿 ∼ (1–10 TeV) −1 ending on gauge branes of the same diameter ∼𝐿. This leads to a mass of 𝑀 𝑋 ∼ 10 15 –10 16 GeV. In particular assuming grand unification in the dark dimension scenario results in a tower of Kaluza-Klein excitations of Standard Model gauge bosons on the gauge branes in the 1–10 TeV range. This suggests that the diameter/separation 𝐿 of the gauge branes correlates with both the weak scale ∼1/𝐿 near a TeV and the GUT scale ∼𝑀$^2_5$⁢𝐿 at 10 16 GeV.

branes↗
DOE OSTI2020

Ab Initio Nuclear Thermodynamics

Here, we propose a new Monte Carlo method called the pinhole trace algorithm for ab initio calculations of the thermodynamics of nuclear systems. For typical simulations of interest, the computational speedup relative to conventional grand-canonical ensemble calculations can be as large as a factor of one thousand. Using a leading-order effective interaction that reproduces the properties of many atomic nuclei and neutron matter to a few percent accuracy, we determine the location of the critical point and the liquid-vapor coexistence line for symmetric nuclear matter with equal numbers of protons and neutrons. We also present the first ab initio study of the density and temperature dependence of nuclear clustering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Anisotropic Flow in Fixed-Target 208 Pb + 20 Ne Collisions as a Probe of Quark-Gluon Plasma

The System for Measuring Overlap with Gas (SMOG2) at the LHCb detector enables the study of fixed-target ion-ion collisions at relativistic energies ($\sqrt{𝑠_{NN}}$ ∼ 100 GeV in the center of mass). Here, with input from ab initio calculations of the structure of 16 O and 20 Ne , we compute 3+1⁢D hydrodynamic predictions for the anisotropic flow of Pb+Ne and Pb+O collisions to be tested with upcoming LHCb data. This will allow the detailed study of quark-gluon plasma formation as well as experimental tests of the predicted nuclear shapes. Elliptic flow (𝑣 2 ) in Pb + Ne collisions is greatly enhanced compared to the Pb + O baseline due to the shape of 20 Ne , which is deformed in a bowling-pin geometry. Owing to the large 208 Pb radius, this effect is seen in a broad centrality range, a unique feature of this collision configuration. Larger elliptic flow further enhances the quadrangular flow (𝑣 4 ) of Pb + Ne collisions via nonlinear coupling, and impacts the sign of the kurtosis of the elliptic flow vector distribution (𝑐 2 ⁡{4}). Exploiting the shape of 20 Ne proves thus an ideal method to investigate the formation of quark-gluon plasma in fixed-target experiments at LHCb, and demonstrates the power of System for Measuring Overlap with Gas as a tool to image nuclear ground states.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Right band gaps for the right reason at low computational cost with a meta-GGA

In density functional theory, traditional explicit density functionals such as the local density approximation and generalized gradient approximations cannot accurately predict the band gap of solids for a fundamental reason: They lack the exchange-correlation derivative discontinuity. By comparing Kohn-Sham and generalized Kohn-Sham calculations, we here show that the nonempirical meta-generalized-gradient-approximation (meta-GGA) TASK from Aschebrock and Kümmel [Phys. Rev. Res. 1, 033082 (2019)] predicts the right gaps for the right reason, i.e., as a combination of a proper Kohn-Sham gap and a substantial derivative discontinuity contribution. For many materials from small-gap semiconductors to large-gap insulators, the proper band gap is thus obtained. Here we further study a group of metal-halide perovskites for which the band gap is notoriously hard to predict. For these materials, TASK yields band gaps very similar to the nonlocal screened hybrid Heyd-Scuseria-Ernzerhof functional, yet at a fraction of the hybrid functional’s computational cost. We discuss the influence of correlation functionals, and open questions in the comparison of calculated band gaps with experimental ones.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Physics-informed transformation toward improving the machine-learned NLTE models of ICF simulations

The integration of machine-learning techniques into inertial confinement fusion (ICF) simulations has emerged as a powerful approach for enhancing computational efficiency. By replacing the costly nonlocal thermodynamic equilibrium (NLTE) model with machine-learning models, significant reductions in calculation time have been achieved. However, determining how to optimize machine-learning-based NLTE models in order to match ICF simulation dynamics remains challenging, underscoring the need for physically relevant error metrics and strategies to enhance model accuracy with respect to these metrics. Thus, we propose novel physics-informed transformations designed to emphasize energy transport, use these transformations to establish new error metrics, and demonstrate that they yield smaller errors within reduced principal-component spaces compared to conventional transformations. Published by the American Physical Society 2025

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Preface IEEE LDAV 2023

Join us for the 13th IEEE Symposium on Large Data Analysis and Visualization (IEEE LDAV) on Monday, October 23rd 2023 collocated with IEEE VIS 2023 in Melbourne, Victoria, Australia.

Bremer, Peer-Timo↗
DOE OSTI2024

IEEE LDAV 2024 Preface

Join us here for the 14th IEEE Symposium on Large Data Analysis and Visualization (IEEE LDAV) on Sunday, October 13th 2024 collocated with IEEE VIS 2024 in St. Pete Beach, Florida, USA.

Beyer, Johanna↗
DOE OSTI2025

Do Research Software Engineers and Software Engineering Researchers Speak the Same Language?

Anecdotal evidence suggests that research software engineers (RSEs) and software engineering researchers (SERs) often use different terminologies for similar concepts, creating communication challenges. To better understand these divergences, we have started investigating how software engineering fundamentals from the SER community are interpreted within the RSE community, identifying aligned concepts, knowledge gaps, and areas for potential adaptation. In conclusion, our preliminary findings reveal opportunities for mutual learning and collaboration, and our systematic methodology for terminology mapping provides a foundation for a crowdsourced extension and validation in the future.

Kehrer, Timo [Univ. of Bern (Switzerland)] (ORCID:↗
DOE OSTI2020

Vector Field Decompositions Using Multiscale Poisson Kernel

Extraction of multiscale features using scale-space is one of the fundamental approaches to analyze scalar fields. However, similar techniques for vector fields are much less common, even though it is well known that, for example, turbulent flows contain cascades of nested vortices at different scales. The challenge is that the ideas related to scale-space are based upon iteratively smoothing the data to extract features at progressively larger scale, making it difficult to extract overlapping features. Instead, we consider spatial regions of influence in vector fields as scale, and introduce a new approach for the multiscale analysis of vector fields. Rather than smoothing the flow, we use the natural Helmholtz-Hodge decomposition to split it into small-scale and large-scale components using progressively larger neighborhoods. Our approach creates a natural separation of features by extracting local flow behavior, for example, a small vortex, from large-scale effects, for example, a background flow. We demonstrate our technique on large-scale, turbulent flows, and show multiscale features that cannot be extracted using state-of-the-art techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

SpotSDC: Revealing the Silent Data Corruption Propagation in High-Performance Computing Systems

We report the trend of rapid technology scaling is expected to make the hardware of high-performance computing (HPC) systems more susceptible to computational errors due to random bit flips. Some bit flips may cause a program to crash or have a minimal effect on the output, but others may lead to silent data corruption (SDC), i.e., undetected yet significant output errors. Classical fault injection analysis methods employ uniform sampling of random bit flips during program execution to derive a statistical resiliency profile. However, summarizing such fault injection result with sufficient detail is difficult, and understanding the behavior of the fault-corrupted program is still a challenge. In this article, we introduce SpotSDC, a visualization system to facilitate the analysis of a program's resilience to SDC. SpotSDC provides multiple perspectives at various levels of detail of the impact on the output relative to where in the source code the flipped bit occurs, which bit is flipped, and when during the execution it happens. SpotSDC also enables users to study the code protection and provide new insights to understand the behavior of a fault-injected program. Based on lessons learned, we demonstrate how what we found can improve the fault injection campaign method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Towards replacing physical testing of granular materials with a Topology-based Model

In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. Here, we provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Scalable Comparative Visualization of Ensembles of Call Graphs

Optimizing the performance of large-scale parallel codes is critical for efficient utilization of computing resources. Code developers often explore various execution parameters, such as hardware configurations, system software choices, and application parameters, and are interested in detecting and understanding bottlenecks in different executions. They often collect hierarchical performance profiles represented as call graphs, which combine performance metrics with their execution contexts. The crucial task of exploring multiple call graphs together is tedious and challenging because of the many structural differences in the execution contexts and significant variability in the collected performance metrics (e.g., execution runtime). In this paper, we present Ensemble CallFlow to support the exploration of ensembles of call graphs using new types of visualizations, analysis, graph operations, and features. We introduce ensemble-Sankey , a new visual design that combines the strengths of resource-flow (Sankey) and box-plot visualization techniques. Whereas the resource-flow visualization can easily and intuitively describe the graphical nature of the call graph, the box plots overlaid on the nodes of Sankey convey the performance variability within the ensemble. Our interactive visual interface provides linked views to help explore ensembles of call graphs, e.g., by facilitating the analysis of structural differences, and identifying similar or distinct call graphs. Finally, we demonstrate the effectiveness and usefulness of our design through case studies on large-scale parallel codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

AMM: Adaptive Multilinear Meshes

Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data. Usual solutions are designed broadly along two themes: reducing data precision, e.g., through compression, or adapting data resolution, e.g., using spatial hierarchies. Additionally, recent research suggests that combining the two approaches, i.e., adapting both resolution and precision simultaneously, can offer significant gains over using them individually. However, there currently exist no practical solutions to creating and evaluating such representations at scale. In this work, we present a new resolution-precision-adaptive representation to support hybrid data reduction schemes and offer an interface to existing tools and algorithms. Through novelties in spatial hierarchy, our representation, Adaptive Multilinear Meshes (AMM), provides considerable reduction in the mesh size. AMM creates a piecewise multilinear representation of uniformly sampled scalar data and can selectively relax or enforce constraints on conformity, continuity, and coverage, delivering a flexible adaptive representation. AMM also supports representing the function using mixed-precision values to further the achievable gains in data reduction. We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams. By interfacing with state-of-the-art rendering tools through VTK, we demonstrate the practical and computational advantages of our representation for visualization techniques. With an open-source release of our tool to create AMM, we make such evaluation of data reduction accessible to the community, which we hope will foster new opportunities and future data reduction schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Visual Comparison of Silent Error Propagation

High-performance computing (HPC) systems play a critical role in facilitating scientific discoveries. Their scale and complexity (e.g., the number of computational units and software stack) continue to grow as new systems are expected to process increasingly more data and reduce computing time. However, with more processing elements, the probability that these systems will experience a random bit-flip error that corrupts a program's output also increases, which is often recognized as silent data corruption. Analyzing the resiliency of HPC applications in extreme-scale computing to silent data corruption is crucial but difficult. An HPC application often contains a large number of computation units that need to be tested, and error propagation caused by error corruption is complex and difficult to interpret. Here, to accommodate this challenge, we propose an interactive visualization system that helps HPC researchers understand the resiliency of HPC applications and compare their error propagation. Our system models an application's error propagation to study a program's resiliency by constructing and visualizing its fault tolerance boundary. Coordinating with multiple interactive designs, our system enables domain experts to efficiently explore the complicated spatial and temporal correlation between error propagations. At the end, the system integrated a nonmonotonic error propagation analysis with an adjustable graph propagation visualization to help domain experts examine the details of error propagation and answer such questions as why an error is mitigated or amplified by program execution.

97 MATHEMATICS AND COMPUTING↗