Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed data structures”

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 793 records · Page 44

Local structure elucidation of tungsten-substituted vanadium dioxide (V$$_{1-x}$$W$$_x$$O$$_2$$)

Abstract Initially, vanadium dioxide seems to be an ideal first-order phase transition case study due to its deceptively simple structure and composition, but upon closer inspection there are nuances to the driving mechanism of the metal-insulator transition (MIT) that are still unexplained. In this study, a local structure analysis across a bulk powder tungsten-substitution series is utilized to tease out the nuances of this first-order phase transition. A comparison of the average structure to the local structure using synchrotron x-ray diffraction and total scattering pair-distribution function methods, respectively, is discussed as well as comparison to bright field transmission electron microscopy imaging through a similar temperature-series as the local structure characterization. Extended x-ray absorption fine structure fitting of thin film data across the substitution-series is also presented and compared to bulk. Machine learning technique, non-negative matrix factorization, is applied to analyze the total scattering data. The bulk MIT is probed through magnetic susceptibility as well as differential scanning calorimetry. The findings indicate the local transition temperature ( $$T_c$$ T c ) is less than the average $$T_c$$ T c supporting the Peierls-Mott MIT mechanism, and demonstrate that in bulk powder and thin-films, increasing tungsten-substitution instigates local V-oxidation through the phase pathway VO $$_2\, \rightarrow$$ 2 → V $$_6$$ 6 O $$_{13} \, \rightarrow$$ 13 → V $$_2$$ 2 O $$_5$$ 5 .

Wilson, Catrina E. (ORCID:0000000173397318)↗

An Active Learning-Based Streaming Pipeline for Reduced Data Training of Structure Finding Models in Neutron Diffractometry

Structure determination workloads in neutron diffractometry are computationally expensive and routinely require several hours to many days to determine the structure of a material from its neutron diffraction patterns. The potential for machine learning models trained on simulated neutron scattering patterns to significantly speed up these tasks have been reported recently. However, the amount of simulated data needed to train these models grows exponentially with the number of structural parameters to be predicted and poses a significant computational challenge. To overcome this challenge, we introduce a novel batch-mode active learning (AL) policy that uses uncertainty sampling to simulate training data drawn from a probability distribution that prefers labelled examples about which the model is least certain. We confirm its efficacy in training the same models with ∼ 75% less training data while improving the accuracy. We then discuss the design of an efficient stream-based training workflow that uses this AL policy and present a performance study on two heterogeneous platforms to demonstrate that, compared with a conventional training workflow, the streaming workflow delivers ∼ 20% shorter training time without any loss of accuracy.

Wang, Tianle [Brookhaven National Laboratory (BNL)↗

SU-F-R-18: Updates to the Computational Environment for Radiological Research for Image Analysis

Purpose: To present new tools in CERR for Texture Analysis and Visualization. Method: (1) Quantitative Image Analysis: We added the ability to compute Haralick texture features based on local neighbourhood. The Texture features depend on many parameters used in their derivation. For example: (a) directionality, (b) quantization of image, (c) patch-size for the neighborhood, (d) handling of the edge voxels within the region of interest, (e) Averaging co-occurance matrix vs texture features for different directions etc. A graphical user interface was built to set these parameters and then visualize their impact on the resulting texture maps. The entire functionality was written in Matlab. Array indexing was used to speed up the texture calculation. The computation speed is very competitive with the ITK library. Moreover, our implementation works with multiple CPUs and the computation time can be further reduced by using multiple processor threads. In order to reduce the Haralick texture maps into scalar features, we propose the use of Texture Volume Histograms. This lets users make use of the entire distribution of texture values within the region of interest rather than using just the mean and the standard deviations. (2) Qualitative/Visualization tools: The derived texture maps are stored as a new scan (derived) within CERR’s planC data structure. A display that compares various scans was built to show the raw image and the derived texture maps side-by-side. These images are positionally linked and can be navigated together. CERR’s graphics handling was updated and sped-up to be compatible with the newer Matlab versions. As a result, the users can use (a) different window levels and colormaps for different viewports, (b) click-and-drag or use mouse scroll-wheel to navigate slices. Results: The new features and updates are available via https://www.github.com/adityaapte/cerr . Conclusion: Features added to CERR increase its utility in Radiomics and Outcomes modeling.

60 APPLIED LIFE SCIENCES↗

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗

Distributed-Memory Breadth-First Search on Massive Graphs. IN: Parallel Graph Algorithms

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

97 MATHEMATICS AND COMPUTING↗

Arrangements for communicating data in a computing system using multiple processors

Systems and methods for reducing data movement in a computer system. The systems and methods use information or knowledge about the structure of an algorithm, operations to be executed at a receiving processing unit, variables or subsets or groups of variables in a distributed algorithm, or other forms of contextual information, for reducing the number of bits transmitted from at least one transmitting processing unit to at least one receiving processing unit or storage device.

Gonzalez, Juan Guillermo↗

Risk-Informed Condition Evaluation of Solar-centered Energy Generation and Distribution Networks through Bayesian Learning and Inference

We develop a methodology based on Bayesian inference over Probabilistic Graphical Models (PGMs) to understand and quantify risk in solar-centered grids using targeted measurements and learned system behavior. Being non-prescriptive but, rather, able to infer system behavior and, ultimately, address risk queries from data, our machine learning-type paradigm is tailored for diverse topologies and threat scenarios often associated with distributed energy generation and photovoltaic distributed energy resources (PV-DERs) in particular. We describe algorithmic processes for: (i) learning the structure of PGMs that result from attack-prone PV-DER-proliferated distribution systems, (ii) quantifying cause-effect relationships, and (iii) evaluating risk queries based on diverse evidence. The contributions are illustrated on a residential grid subject to output impairment attacks on its PV-DER infrastructure.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Arrangements for communicating and processing data in a computing system

Systems and methods for reducing data movement in a computer system. The systems and methods use information or knowledge about the structure of an algorithm, operations to be executed at a receiving processing unit, variables or subsets or groups of variables in a distributed algorithm, or other forms of contextual information, for reducing the number of bits transmitted from at least one transmitting processing unit to at least one receiving processing unit or storage device.

Gonzalez, Juan Guillermo↗

Forward and Off-Forward Parton Distributions from Lattice QCD

The interpretation of (semi-)inclusive and certain exclusive scattering processes relies on the factorization of hard parton level cross sections from long-range and non-perturbative parton correlations. The familiar Parton Distribution Functions (PDFs) and Generalized Parton Distributions quantify the non-perturbative dynamics in these situations and address a number of key questions surrounding the structure of hadrons. A certain class of matrix elements accessible in lattice QCD, so called Lattice Cross Sections, have been shown to factorize into these collinear distributions in a manner akin to the factorization of hadronic cross sections. In the short-distance regime, matrix elements of space-like separated two-current operators and parton bilinears can be expressed as the convolution of perturbative coefficient functions and the PDFs. Matrix elements of this type are isolated in the pion and nucleon, each offering a glimpse of the unpolarized valence quark content of these phenomenologically important hadronic states. The calculations within the nucleon represent the first application of the distillation spatial smearing paradigm to the collinear structure of hadrons, and is found to offer higher precision data compared to similar calculations in the literature. A novel method to obtain PDFs from these lattice data, while simultaneously controlling systematic effects, is developed and applied to the nucleon dataset. The coordinate space factorization of space-like separated parton bilinears has also recently been extended to include Generalized Parton Distributions. Preliminary results in off-forward nucleon matrix elements using distillation are explored.

Egerer, Colin↗

Nonmonotonic-potential description of polarization effects, fusion, and nuclear rainbows in elastic scattering of 6 Li + 12 C at 4.5–600 MeV

The experimental differential cross-section (CS) and analyzing power (AP) data of the 6 Li + 12 C elastic scattering over a wide laboratory energy scale (4.5MeV≤𝐸 lab ≤600MeV) are analyzed within the framework of the optical model (OPM) using nonmonotonic (NM) nucleus–nucleus potentials. The real part of the NM potentials is derived from the Pauli-embodied energy density-functional (EDF) formalism with the sudden approximation. The real part of the noncentral spin-orbit and tensor terms, as well as the imaginary parts, are treated phenomenologically. The effect of the radius of sensitivity on the CS and AP data is found to be more important at lower energies. The diffractive and refractive scattering with Airy structures in the whole angular region of the elastic scattering across the studied energy range is successfully described within the OPM using the NM 6 Li + 12 C potential. The near- and far-side (N and F) decomposition of the total elastic-scattering amplitudes has also been studied using our NM potentials. The evolution of the Airy minima in the angular distributions, coupled with the fitting of the AP data, provides an accurate description of Airy minima of different orders. The OPM calculations with the NM potentials describe exceptionally well the CS, vector analyzing power (VAP), and tensor analyzing power data at 𝐸 lab =9.0,19.24,20,30, and 50MeV. In agreement with our past successful descriptions of CS and the opposite signs of the VAP data for the 6 Li and 7 Li elastic scattering using NM potentials in OPM, the present results appear to provide a better fit, so far, than those obtained from the coupled-channels method. The fusion cross sections of 6 Li + 12 C have been predicted in the energy range (4.5MeV≤𝐸 lab ≤20MeV), fitting the experimental data well in the range 𝐸 lab =2.97–11.77MeV. The EDF potential without any energy dependence and renormalization is also found to describe satisfactorily the experimental CS and AP data at energies up to several hundreds of MeV.

6 ≤ A ≤ 19↗

Structural and Proteomic Studies of the Aureococcus anophagefferens Virus Demonstrate a Global Distribution of Virus-Encoded Carbohydrate Processing

Viruses modulate the function(s) of environmentally relevant microbial populations, yet considerations of the metabolic capabilities of individual virus particles themselves are rare. We used shotgun proteomics to quantitatively identify 43 virus-encoded proteins packaged within purified Aureococcus anophagefferens Virus (AaV) particles, normalizing data to the per-virion level using a 9.5-Å-resolution molecular reconstruction of the 1900-Å (AaV) particle that we generated with cryogenic electron microscopy. This packaged proteome was used to determine similarities and differences between members of different giant virus families. We noted that proteins involved in sugar degradation and binding (e.g., carbohydrate lyases) were unique to AaV among characterized giant viruses. To determine the extent to which this virally encoded metabolic capability was ecologically relevant, we examined the TARA Oceans dataset and identified genes and transcripts of viral origin. Our analyses demonstrated that putative giant virus carbohydrate lyases represented up to 17% of the marine pool for this function. In total, our observations suggest that the AaV particle has potential prepackaged metabolic capabilities and that these may be found in other giant viruses that are widespread and abundant in global oceans.

59 BASIC BIOLOGICAL SCIENCES↗

Accessing the Single-Particle Structure of the Pygmy Dipole Resonance in 208 Pb

New experimental data on the neutron single-particle character of the Pygmy Dipole Resonance (PDR) in Pb 208 are presented. They were obtained from ( d , p ) and resonant proton scattering experiments performed at the Q3D spectrograph of the Maier-Leibnitz Laboratory in Garching, Germany. The new data are compared to the large suite of complementary, experimental data available for Pb 208 and establish ( d , p ) as an additional, valuable, experimental probe to study the PDR and its collectivity. Furthermore, besides the single-particle character of the states, different features of the strength distributions are discussed and compared to large-scale shell model (LSSM) and energy-density functional plus quasiparticle-phonon model theoretical approaches to elucidate the microscopic structure of the PDR in Pb 208 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantifying model structural error: Efficient Bayesian calibration of a regional groundwater flow model using surrogates and a data-driven error model

Groundwater model structural error is ubiquitous, due to simplification and/or misrepresentation of real aquifer systems. During model calibration, the basic hydrogeological parameters may be adjusted to compensate for structural error. This may result in biased predictions when such calibrated models are used to forecast aquifer responses to new forcing. Here, we investigate the impact of model structural error on calibration and prediction of a real-world groundwater flow model, using a Bayesian method with a data-driven error model to explicitly account for model structural error. The error-explicit Bayesian method jointly infers model parameters and structural error and thereby reduces parameter compensation. In this study, Bayesian inference is facilitated using high performance computing and fast surrogate models (based on machine learning techniques) as a substitute for the computationally expensive groundwater model. We demonstrate that with explicit treatment of model structural error, the Bayesian method yields parameter posterior distributions that are substantially different from those derived using classical Bayesian calibration that does not account for model structural error. We also found that the error-explicit Bayesian method gives signficantly more accurate prediction along with reasonable credible intervals. Finally, through variance decomposition, we provide a comprehensive assessment of prediction uncertainty contributed from parameter, model structure, and measurement uncertainty. The results suggest that the error-explicit Bayesian approach provides a solution to real-world modeling applications for which data support the presence of model structural error, yet model deficiency cannot be specifically identified or corrected.

54 ENVIRONMENTAL SCIENCES↗

Discovering causal structure with reproducing-kernel Hilbert space ε -machines

We merge computational mechanics’ definition of causal states (predictively equivalent histories) with reproducing-kernel Hilbert space (RKHS) representation inference. The result is a widely applicable method that infers causal structure directly from observations of a system’s behaviors whether they are over discrete or continuous events or time. A structural representation—a finite- or infinite-state kernel ϵ-machine—is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology. In this way, the system dynamics are represented by a stochastic (ordinary or partial) differential equation that acts on causal states. We introduce an algorithm to estimate the associated evolution operator. Paralleling the Fokker–Planck equation, it efficiently evolves causal-state distributions and makes predictions in the original data space via an RKHS functional mapping. We demonstrate these techniques, together with their predictive abilities, on discrete-time, discrete-value infinite Markov-order processes generated by finite-state hidden Markov models with (i) finite or (ii) uncountably infinite causal states and (iii) continuous-time, continuous-value processes generated by thermally driven chaotic flows. The method robustly estimates causal structure in the presence of varying external and measurement noise levels and for very high-dimensional data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

Acoustic Impedance Inversions for Offshore CO 2 Storage: South Georgia Embayment, United States

This study builds and expands on previous CO 2 storage resource assessment studies of the southeastern offshore Atlantic margin by providing a detailed evaluation on how rock porosities and permeabilities are distributed across the Upper Cretaceous strata restricted to the South Georgia Embayment (SGE). Using legacy industry two-dimensional seismic reflection and well data, this assessment is the first application of multiple seismic inversion techniques in this area. This workflow provides a reliable and repeatable model-based inversion which gives an improved image to discriminate lithology and predict porosity. The workflow is applicable to future CO 2 storage resource assessment studies elsewhere. The inversion results indicate that distinct porosity and permeability regimes are present and distributed in the Upper Cretaceous strata within the SGE. The impedance and porosity relationships show well-founded and reliable correlation. These relationships reveal low impedance coincident to the high porosity intervals which are proposed as potential reservoir intervals for CO 2 storage. In addition, the result shows that the Upper Cretaceous strata have two main potential reservoirs in the lower part. These are overlain by a thick impermeable interval, mostly shale, which has high impedance, low porosity, and low permeability and extends within the SGE. This result is in agreement with a previous study that also proposed two significant storage reservoirs for CO 2 in the Upper Cretaceous strata. Since porosity distribution is estimated using multiple methods, it follows the trends of seismic signature and structures of the Upper Cretaceous strata. The extracted values of porosity, ranging from 15 to 36%, and permeability, ranging from 1 to 100 mD, are close to the measured values from the well core data at the Upper Cretaceous strata interval.

54 ENVIRONMENTAL SCIENCES↗

Understanding nanoscale structural distortions in Pb(Zr 0.2 Ti 0.8 )O 3 by utilizing X-ray nanodiffraction and clustering algorithm analysis

Hard X-ray nanodiffraction provides a unique nondestructive technique to quantify local strain and structural inhomogeneities at nanometer length scales. However, sample mosaicity and phase separation can result in a complex diffraction pattern that can make it challenging to quantify nanoscale structural distortions. In this work, a k-means clustering algorithm was utilized to identify local maxima of intensity by partitioning diffraction data in a three-dimensional feature space of detector coordinates and intensity. This technique has been applied to X-ray nanodiffraction measurements of a patterned ferroelectric PbZr 0.2 Ti 0.8 O 3 sample. The analysis reveals the presence of two phases in the sample with different lattice parameters. A highly heterogeneous distribution of lattice parameters with a variation of 0.02 Å was also observed within one ferroelectric domain. This approach provides a nanoscale survey of subtle structural distortions as well as phase separation in ferroelectric domains in a patterned sample.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Understanding the Origin of the Hadron Mass within the Standard Model

Understanding the origin of the hadron mass, which constitutes 99% of our visible universe, is one of the central goals of nuclear physics. Although the Higgs mechanism provides mass for the fundamental building blocks of matter, it can only contribute less than 2% of the proton mass. The vast majority of the proton mass is believed to come from the strong force that tightly binds quarks and gluons (collectively called partons) together as described by Quantum Chromodynamics (QCD). The mass that emerges as a consequence of the strong interactions within QCD is commonly denoted as Emergent Hadronic Mass (EHM). Understanding how the nucleon mass emerges in QCD is a prerequisite to an explanation of how the Universe came into being, therefore it is of utmost importance and one of the key questions to be addressed by the future Electron-Ion Collider (EIC). When it comes to light mesons, particularly pions, the mass decomposition is drastically different. Since the pion is naturally massless in the chiral limit, the majority of its observed mass needs to come from other mechanisms within QCD. Any successful explanation for the EHM needs to be able to reconcile both the heavy proton mass and the very light pion mass (~15% of proton mass) simultaneously. The EHM theories have direct measurable implications on the description of the internal structure of the hadron, i.e., how the partons distribute inside the hadron. Precise measurement of the parton distribution functions (PDFs) will provide necessary experimental verifications and constraints of potential EHM mechanisms. We propose to carry out a comprehensive study of the poorly known pion PDFs at the AMBER experiment at CERN. The measurement will provide vital input to constrain the global analysis of the pion PDFs, which are still based on limited data obtained more than 30 years ago. The proposed pion measurement is the only direct measurement achievable within this decade, which could lead to a future major meson structure program parallel to the EIC’s proton structure measurement.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗