Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms and data structure”

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 667 records · Page 37

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Automating Discovery of Physics-Informed Neural State Space Models via Learning and Evolution

Recent works exploring deep learning application to dynamical systems modeling have demonstrated that embedding physical priors into neural networks can yield more effective, physically-realistic, and data-efficient models. However, in the absence of complete prior knowledge of a dynamical system's physical characteristics, determining the optimal structure and optimization strategy for these models can be difficult. In this work, we explore methods for discovering neural state space dynamics models for system identification. Starting with a design space of block-oriented state space models and structured linear maps with strong physical priors, we encode these components into a model genome alongside network structure, penalty constraints, and optimization hyperparameters. Demonstrating the overall utility of the design space, we employ an asynchronous genetic search algorithm that alternates between model selection and optimization and obtains accurate physically consistent models of three physical systems: an aerodynamics body, a continuous stirred tank reactor, and a two tank interacting system.

genetic algorithms, neural architecture search, ne↗

The halo light-cone catalogues of ABACUSSUMMIT

We describe a method for generating halo catalogues on the light-cone using the AbacusSummit suite of N-body simulations. The main application of these catalogues is the construction of realistic mock galaxy catalogues and weak lensing maps on the sky. Our algorithm associates the haloes from a set of coarsely spaced snapshots with their positions at the time of light-cone crossing by matching halo particles to on-the-fly light-cone particles. It then records the halo and particle information into an easily accessible product, which we call the AbacusSummit halo light-cone catalogues. Our recommended use of this product is in the halo mass regime of M halo > 2.1 x 10 11 M ⊙ h -1 for the base resolution simulations, i.e. haloes containing at least 100 particles, where the interpolated halo properties are most reliable. To test the validity of the obtained catalogues, we perform various visual inspections and consistency checks. In particular, we construct galaxy mock catalogues of emission-line galaxies (ELGs) at z ~ 1 by adopting a modified version of the AbacusHOD script, which builds on the standard halo occupation distribution (HOD) method by including various extensions. We find that the multipoles of the autocorrelation function are consistent with the predictions from the full-box snapshot, implicitly validating our algorithm. In addition, we compute and output CMB convergence maps and find that the auto- and cross-power spectrum agrees with the theoretical prediction at the sub-per-cent level.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of a Unified Taxonomy for HVAC System Faults

Detecting and diagnosing HVAC faults is critical for maintaining building operation performance, reducing energy waste, and ensuring indoor comfort. An increasing deployment of commercial fault detection and diagnostics (FDD) software tools in commercial buildings in the past decade has significantly increased buildings’ operational reliability and reduced energy consumption. A massive amount of data has been generated by the FDD software tools. However, efficiently utilizing FDD data for ‘big data’ analytics, algorithm improvement, and other data-driven applications is challenging because the format and naming conventions of those data are very customized, unstructured, and hard to interpret. This paper presents the development of a unified taxonomy for HVAC faults. A taxonomy is an orderly classification of HVAC faults according to their characteristics and causal relations. The taxonomy includes fault categorization, physical hierarchy, fault library, relation model, and naming/tagging scheme. The taxonomy employs both a physical hierarchy of HVAC equipment and a cause-effect relationship model to reveal the root causes of faults in HVAC systems. A structured and standardized vocabulary library is developed to increase data representability and interpretability. The developed fault taxonomy can be used for HVAC system ‘big data’ analytics such as HVAC system fault prevalence analysis or the development of an HVAC FDD software standard. A common type of HVAC equipment-packaged rooftop unit (RTU) is used as an example to demonstrate the application of the developed fault taxonomy. Two RTU FDD software tools are used to show that after mapping FDD data according to the taxonomy, the meta-analysis of the multiple FDD reports is possible and efficient.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive continuity-preserving simplification of street networks

Street network data is widely used to study human-based activities and urban structure. Often, these data are geared towards transportation applications, which require highly granular, directed graphs that capture the complex relationships of potential traffic patterns. While this level of network detail is critical for certain fine-grained mobility models, it represents a hindrance for studies concerned with the morphology of the street network. For the latter case, street network simplification — the process of converting a highly granular input network into its most simple morphological form — is a necessary, but highly tedious preprocessing step, especially when conducted manually. In this manuscript, we develop and present a novel adaptive algorithm for simplifying street networks that is both fully automated and able to mimic results obtained through a manual simplification routine. The algorithm — available in the neatnet Python package — outperforms current state-of-the-art procedures when comparing those methods to manually, human-simplified data, while preserving network continuity.

Python↗

Determination of the Maturation Status of Dendritic Cells by Applying Pattern Recognition to High-Resolution Images

The maturation or activation status of dendritic cells (DCs) directly correlates with their behavior and immunofunction. A common means to determine the maturity of dendritic cells is from high-resolution images acquired via scanning electron microscopy (SEM) or atomic force microscopy (AFM). While direct and visual, the determination has been made by directly looking at the images by researchers. Here we report a machine learning approach using pattern recognition in conjunction with cellular biophysical knowledge of dendritic cells to determine the maturation status of dendritic cells automatically. The determination from AFM images reaches 100% accuracy. The results from SEM images reaches 94.9%. The results demonstrate the accuracy of using machine learning for accelerating data analysis, extracting information, and drawing conclusions from high-resolution cellular images, paving the way for future applications requiring high-throughput and automation, such as cellular sorting and selection based on morphology, quantification of cellular structure, and DC-based immunotherapy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable Computation of Topological Abstractions for Scalar Data

Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial and on single machines. This paper presents the state of the art in the scalable computation of topological abstractions on scalar data, in shared memory parallel on single machines, and in distributed memory parallel on multiple machines. We highlight results for set‐based, graph‐based and complex‐based abstractions and organize the state of the art based on this taxonomy. The paper identifies parallelization and distribution techniques common in topological algorithms and highlights further areas of interest with underdeveloped efforts.

97 MATHEMATICS AND COMPUTING↗

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗

Complete Performance Comparison Between the Optimized Image Construction Algorithm (U-MBIR) and the Existing Reconstruction Algorithm for Detecting Defects and Damage in Concrete

Reinforced concrete (RC) is a composite material subjected to mechanical, thermal, and chemical loads throughout its service life. Because of these external stressors and the susceptibility of RC structural members to shrinkage and microcracking, the material degrades throughout its life cycle. This deterioration can lead to a decrease in member capacity and, ultimately, poses a threat to the structural integrity. Thus, it is crucial that the damage caused by aging and degradation be monitored and assessed at regular intervals throughout the material’s service life. Since coring of the material is typically not feasible for in-service structural systems, non-destructive evaluation (NDE) methodologies are used to assess remaining structural capacity. NDE methods enable surface and subsurface examination without damaging or degrading the medium. Moreover, RC is a critical component of nuclear power plants; thus, its safety and reliability must be thoroughly examined throughout the life cycle of the structural system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To this end, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. More specifically, this report presents a comparison between reconstruction images produced via a widely employed ultrasonic NDE technique—the synthetic aperture focusing technique (SAFT)—and the ORNL-developed U-MBIR algorithm. These NDE methodologies are demonstrated using ultrasonic data collected from four concrete specimens. Overall, the U-MBIR algorithm eliminates artifacts and noise that are typically present within the SAFT reconstructions, and it shows defects and anomalies more clearly than the SAFT images. In conclusion, this algorithm is suitable for identifying concrete defects, although more improvements and optimization could be done to better define internal defects.

36 MATERIALS SCIENCE↗

Survey of Gravitationally lensed objects in HSC Imaging (SuGOHI). VIII. New galaxy-scale lenses from the HSC SSP

Abstract We conduct a search for galaxy-scale strong gravitational lens systems in Data Release 4 of the Hyper Suprime-Cam Subaru Strategic Program (HSC SSP), consisting of data taken up to the S21A semester. We select 103191 luminous red galaxies from the Baryon Oscillation Spectroscopic Survey (BOSS) sample that have deep multiband imaging from the HSC SSP and use the YattaLens algorithm to identify lens candidates with blue arc-like features automatically. The candidates are visually inspected and graded based on their likelihood of being a lens. We find eight definite lenses, 28 probable lenses, and 138 possible lenses. The new lens candidates generally have lens redshifts in the range 0.3 ≲ zL ≲ 0.9, a key intermediate redshift range to study the evolution of galaxy structure. Follow-up spectroscopy will confirm these new lenses and measure source redshifts to enable detailed lens modeling.

Astronomy & Astrophysics↗

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗

The Development of a Generalized Riser Flow Regime Map Based Upon Higher Moment and Chaotic Statistics Using Electrical Capacitance Volume Tomography (ECVT)

Dynamic analyses have been applied to the temporal signals from an Electro Capacitance Volume Tomography instrument located near mid-height on the riser of an industrial-scale cold-flow circulating fluidized bed to characterize gas-solids flow behavior in the riser. Twelve capacitance electrodes surround the cylindrical riser over a height of 1.3 m. The instrument used a neural network deconvolution algorithm to determine the spatially resolved solids fraction recorded at 52 Hz. Experiments were carried out over a range of gas and solids flows in the transport regime using a Geldart Group B bed material, high density polyethylene with mean particle size of 880 μm. The radial solids distribution was found to vary from one-time step to the next between profiles typical of laminar and turbulent flow. The duration of time spent in each of these flow profiles depended upon the operating regime – dilute, core-annular, or fast fluidized bed. The chaotic structure of the temporal data was characterized using the three conventional approaches: the first 4 moments from the distribution of signal in time, system memory parameters from the autocorrelation function and the Hurst exponent, and analysis of the correlationentropy and correlation dimension of the attractor. These signal analysis techniques were used to clearly distinguish differences between different transport operating regimes. Specifically, it was experimentally observed that a riser transitions from core annular flow profile to dilute and dense regimes via increasing the frequency of short term transients to either dilute or dense flow profiles, respectively. A regime map was generated based upon these dynamics using solids flux and gas velocity axes. Fast fluidized, core annular, and dilute each exhibited different degree of dynamic characteristics typical of fluid dominated or particle compromising behavior. It should be noted that the magnitude for the different statistics was in the same range regardless of the regime, it was the radial profile for the statistic that changed and subsequently identified that there was a change in the regime. Finally, a reduced regime map was developed consisting of plotting the gas velocity normalized by the upper transport velocity versus the solids flux normalized by the saturation carrying capacity. The use of this reduced plot allowed the data from widely different conditions to be plotted and compared on the same<p>graph. Note that in many instances, some of the statistics identified the operating point as being in one regime while others indicated that it was in another indicating a transition region between dilute or core annular regimes and between the core annular and fast fluidization regimes. This now provides a tool that can be used to optimize process performance, identify changes in operating states, or replicate process dynamics during process scaling or changing operating parameters. </p>

Breault, Ronald↗

Inverse design of hypoeutectoid pearlite steel microstructures using a deep learning and genetic algorithm optimization framework

Goal-oriented microstructure design in metallic materials is a challenging task due to complex structure-property relationships. Traditional experimental and computational approaches are time-intensive and economically inefficient, limiting their applicability for large-scale design space exploration. Here, in this work, we propose an end-to-end framework that integrates deep learning models with genetic optimization to design microstructures with targeted mechanical properties. Deep learning models enable accurate forward design, while their integration with genetic optimization enables efficient inverse design within a few hours, compared to days or weeks using conventional finite element simulations. The framework combines experimental characterization and finite element modeling to analyze the influence of microstructural features on the mechanical behavior of hypoeutectoid steels. Data from both experiments and simulations are used to train the deep learning models. To demonstrate its effectiveness, we apply the framework to 0.63% carbon steel with proeutectoid ferrite and pearlite phases, commonly used in industrial applications. In this study, 2D microstructures were used for modeling, selected primarily for computational efficiency and to establish proof of concept. The framework successfully optimizes microstructures for targeted yield strength, ultimate strength, and stress concentration factors while significantly reducing computational time. Beyond hypoeutectoid steels, this scalable framework can be extended to other material systems and integrated with additive manufacturing, offering an efficient approach for accelerating microstructure design for specific engineering applications.

ConvLSTM↗

Deep Learning for Spectroscopic X-ray Nano-Imaging Denoising

Synchrotron transmission X-ray microscopy with absorption near edge structure (TXM-XANES) is a powerful tool for investigating the structure and composition of materials at nano- to meso-scales. It is, however, often challenged by high levels of noise that obscure critical details at the single-pixel level. To address this issue, a deep learning-based algorithm is developed for suppressing the image noise, grounded in self-supervised learning principles. In contrast to traditional image denoising methods, this approach successfully enhances the visibility of fine details while significantly reducing the noise in the X-ray images. Through this advancement, the potential of the approach for improving the accuracy and interpretability of the TXM-XANES data is demonstrated, thereby enabling more precise detection of nanoscale phenomena such as inhomogeneous cation redox and metal segregation in battery cathode materials. This technique offers an effective new avenue for harnessing the full potential of synchrotron TXM-XANES imaging, paving the way for a range of exciting new studies in materials science and beyond.

36 MATERIALS SCIENCE↗

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling the role of local crystallographic correlations in microstructures of Ti-6Al-4V using a correlated structure visco-plastic self-consistent polycrystal plasticity formulation

This paper presents a multi-level crystal plasticity-based simulation framework for modeling mechanical response and microstructure evolution of Ti-6Al-4V with α-lath/lamellar microstructures. Here, the model is a correlated structure visco-plastic self-consistent (CS-VPSC) formulation linking three scales: a single crystals micro-scale, a lath/lamellar colony meso-scale, and a lath/lamellar aggregate macro-scale. A selected hardening law for the evolution of critical resolved shear stress per slip system used in CS-VPSC is phenomenological. However, it adjusts the resistances of basal and prismatic slip systems based on the geometry of slip transfer between adjacent lamellae. Consistent with experimental evidences, the resolved shear stress on the pyramidal slip planes is dependent not only on the stress in the direction of slip but also on the two orthogonal shear stress components and the three normal stress components (non-Schmid effects). Electron backscatter diffraction (EBSD) data in conjunction with a procedure relying on α→β phase transformation is used to construct paired variants of α-laths/lamellae satisfying their local crystallographic correlations. The procedure fits volume fractions of individual laths/lamellae with the experimental EBSD data and selects a distribution of habit planes between adjacent variants with respect to the loading direction. The simulation framework is applied to interpret the deformation behavior in tension and compression along two sample directions of Ti-6Al-4V fabricated via laser powder bed fusion. Moreover, the model is used to simulate texture evolution during rolling of the material to large strains. It is demonstrated that the model is capable of predicting plastic anisotropy/asymmetry and the concomitant texture evolution. While the model reveals a significant effect of habit plane inclination with respect to the loading direction on yield stress, the comparison of the data and model predictions shows that a random distribution of habit planes fits the flow response. It is further inferred that the tension-compression asymmetry arises from the non-Schmid effects.

36 MATERIALS SCIENCE↗