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 865 records · Page 48

The ArborX Library: Version 2.0

This article provides an overview of the 2.0 release of the ArborX library, a performance portable geometric search library based on Kokkos. We describe the major changes in ArborX 2.0 including a new interface for the library to support a wider range of user problems, new search data structures (brute force and distributed), support for user functions to be executed on the results (callbacks), and an expanded set of the supported algorithms (ray tracing and clustering).

GPU↗

Acceleration of GPU-based Krylov solvers via data transfer reduction

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this study, we target the acceleration of Krylov subspace iterative methods for graphics processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA’s cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit’s computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Finally, considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.

97 MATHEMATICS AND COMPUTING↗

Integrating 3D seismic curvature and curvature gradient attributes for fracture characterization: Methodologies and interpretational implications

In 3D seismic interpretation, curvature is a popular attribute that depicts the geometry of seismic reflectors and has been widely used to detect faults in the subsurface; however, it provides only part of the solutions to subsurface structure analysis. This study extends the curvature algorithm to a new curvature gradient algorithm, and integrates both algorithms for fracture detection using a 3D seismic test data set over Teapot Dome (Wyoming). In fractured reservoirs at Teapot Dome known to be formed by tectonic folding and faulting, curvature helps define the crestal portion of the reservoirs that is associated with strong seismic amplitude and high oil productivity. In contrast, curvature gradient helps better define the regional northwest-trending and the cross-regional northeast-trending lineaments that are associated with weak seismic amplitude and low oil productivity. In concert with previous reports from image logs, cores, and outcrops, the current study based on an integrated seismic curvature and curvature gradient analysis suggests that curvature might help define areas of enhanced potential to form tensile fractures, whereas curvature gradient might help define zones of enhanced potential to develop shear fractures. In certain fractured reservoirs such as at Teapot Dome where faulting and fault-related folding contribute dominantly to the formation and evolution of fractures, curvature and curvature gradient attributes can be potentially applied to differentiate fracture mode, to predict fracture intensity and orientation, to detect fracture volume and connectivity, and to model fracture networks.

3D, attributes, fractures, visualization↗

Atomic electron tomography in three and four dimensions

Atomic electron tomography (AET) has become a powerful tool for atomic-scale structural characterization in three and four dimensions. It provides the ability to correlate structures and properties of materials at the single-atom level. With recent advances in data acquisition methods, iterative three-dimensional (3D) reconstruction algorithms, and post-processing methods, AET can now determine 3D atomic coordinates and chemical species with sub-Angstrom precision, and reveal their atomic-scale time evolution during dynamical processes. In this work, we review the recent experimental and algorithmic developments of AET and highlight several groundbreaking experiments, which include pinpointing the 3D atom positions and chemical order/disorder in technologically relevant materials and capturing how atoms rearrange during early nucleation at four-dimensional atomic resolution.

30 DIRECT ENERGY CONVERSION↗

End-to-end deep learning pipeline for real-time Bragg peak segmentation: from training to large-scale deployment

X-ray crystallography reconstruction, which transforms discrete X-ray diffraction patterns into three-dimensional molecular structures, relies critically on accurate Bragg peak finding for structure determination. As X-ray free electron laser (XFEL) facilities advance toward MHz data rates (1 million images per second), traditional peak finding algorithms that require manual parameter tuning or exhaustive grid searches across multiple experiments become increasingly impractical. While deep learning approaches offer promising solutions, their deployment in high-throughput environments presents significant challenges in automated dataset labeling, model scalability, edge deployment efficiency, and distributed inference capabilities. We present an end-to-end deep learning pipeline with three key components: (1) a data engine that combines traditional algorithms with our peak matching algorithm to generate high-quality training data at scale, (2) a modular architecture that scales from a few million to hundreds of million parameters, enabling us to train large expert-level models offline while deploying smaller, distilled models at the edge, and (3) a decoupled producer-consumer architecture that separates specialized data source layer from model inference, enabling flexible deployment across diverse computing environments. Using this integrated approach, our pipeline achieves accuracy comparable to traditional methods tuned by human experts while eliminating the need for experiment-specific parameter tuning. Although current throughput requires optimization for MHz facilities, our system's scalable architecture and demonstrated model compression capabilities provide a foundation for future high-throughput XFEL deployments.

Wang, Cong↗

Autonomous Frequency-Domain Indentification

Test and data-processing system determines plant models and uncertainties. Integrated system of methods, digital signal-processing, and algorithms identifies parametric model of large, flexible structures. Experiments in development of system conducted on laboratory model intended to represent large space antenna or flexible spacecraft. Also applicable to many terrestrial systems, robust control of dynamic plants and processes, robust control of systems about which knowledge uncertain or incomplete, decentralized control, and knowledge-based control systems.

Mettler, Edward↗

A Tone-Aided/Dual Vestigial Sideband (TA/DVSB) system for mobile satellite channels

Tone-aided modulation is one way of combatting the effects of multipath fading and Doppler frequency shifts. A new tone-aided modulation format for M-ary phase-shift keyed signals (MPSK) is discussed. A spectral null for the placement of the tone is created in the center of the MPSK signal by translating the upper sideband upwards in frequency by the same amount. The key element of the system is the algorithm for recombining the data sidebands in the receiver, a function that is performed by a specialized phase-locked loop (PLL). The system structure is discussed and simulation results showing the PLL acquisition performance are presented.

Saulnier, Gary J.↗

Reliability analysis of laminated CMC components through shell subelement techniques

An updated version of the integrated design program C/CARES (composite ceramic analysis and reliability evaluation of structures) was developed for the reliability evaluation of CMC laminated shell components. The algorithm is now split in two modules: a finite-element data interface program and a reliability evaluation algorithm. More flexibility is achieved, allowing for easy implementation with various finite-element programs. The new interface program from the finite-element code MARC also includes the option of using hybrid laminates and allows for variations in temperature fields throughout the component.

Starlinger, A.↗

Reduced-Order Modeling and Wavelet Analysis of Turbofan Engine Structural Response Due to Foreign Object Damage "FOD" Events

The development of a wavelet-based feature extraction technique specifically targeting FOD-event induced vibration signal changes in gas turbine engines is described. The technique performs wavelet analysis of accelerometer signals from specified locations on the engine and is shown to be robust in the presence of significant process and sensor noise. It is envisioned that the technique will be combined with Kalman filter thermal/ health parameter estimation for FOD-event detection via information fusion from these (and perhaps other) sources. Due to the lack of high-frequency FOD-event test data in the open literature, a reduced-order turbofan structural model (ROM) was synthesized from a finite-element model modal analysis to support the investigation. In addition to providing test data for algorithm development, the ROM is used to determine the optimal sensor location for FOD-event detection. In the presence of significant noise, precise location of the FOD event in time was obtained using the developed wavelet-based feature.

Turso, James A.↗

SHELXT – Integrated space-group and crystal-structure determination

SHELXT automates routine small-molecule structure determination starting from single-crystal reflection data, the Laue group and a reasonable guess as to which elements might be present. The new computer program SHELXT employs a novel dual-space algorithm to solve the phase problem for single-crystal reflection data expanded to the space group P1. Missing data are taken into account and the resolution extended if necessary. All space groups in the specified Laue group are tested to find which are consistent with the P1 phases. After applying the resulting origin shifts and space-group symmetry, the solutions are subject to further dual-space recycling followed by a peak search and summation of the electron density around each peak. Elements are assigned to give the best fit to the integrated peak densities and if necessary additional elements are considered. An isotropic refinement is followed for non-centrosymmetric space groups by the calculation of a Flack parameter and, if appropriate, inversion of the structure. The structure is assembled to maximize its connectivity and centred optimally in the unit cell. SHELXT has already solved many thousand structures with a high success rate, and is optimized for multiprocessor computers. It is, however, unsuitable for severely disordered and twinned structures because it is based on the assumption that the structure consists of atoms.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Labeling sequential data from noisy annotations

Crowdsourcing algorithms often work under the assumption that the data samples are independent. Recent work has shown that data dependence, such as temporal correlations in sequential data, can be leveraged to improve the label quality. Existing methods that exploit this special structure rely on third-order statistics of the annotator outputs to ensure the identifiability of key latent parameters, which are costly to acquire. This work proposes an approach for integrating crowdsourced annotations under the Dawid-Skene/Hidden Markov Model (DS-HMM) for sequential data based on second-order statistics, which naturally enjoys a lower sample complexity. An effective algorithm is proposed to tackle the challenging optimization problem associated with the proposed estimator. Numerical experiments showcase the effectiveness of the data labeling paradigm.

Marrinan, Timothy P.↗

Dynamical Classification of Trans-Neptunian Objects Detected by the Dark Energy Survey

The outer solar system contains a large number of small bodies (known as trans-Neptunian objects or TNOs) that exhibit diverse types of dynamical behavior. The classification of bodies in this distant region into dynamical classes—subpopulations that experience similar orbital evolution—aids in our understanding of the structure and formation of the solar system. In this work, we propose an updated dynamical classification scheme for the outer solar system. This approach includes the construction of a new (automated) method for identifying mean motion resonances. We apply this algorithm to the current data set of TNOs observed by the Dark Energy Survey (DES) and present a working classification for all of the DES TNOs detected to date. Our classification scheme yields 1 inner centaur, 19 outer centaurs, 21 scattering disk objects, 47 detached TNOs, 48 securely resonant objects, 7 resonant candidates, and 97 classical belt objects. Among the scattering and detached objects, we detect 8 TNOs with semimajor axes greater than 150 au.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel rendering

This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.

Crockett, Thomas W.↗

Beyond Taylor’s hypothesis: a novel volumetric reconstruction of velocity and density fields for variable‑density and shear flows

Abstract This work presents a novel numerical procedure for reconstructing volumetric density and velocity fields from planar laser-induced fluorescence (PLIF) and stereoscopic particle image velocimetry (SPIV) data. This new method is theoretically and practically demonstrated to provide more accurate 3D vortical structures and density fields in high shear flows than reconstruction methods based on the mean convective velocity. While Taylor’s hypothesis of frozen turbulence is commonly applied by using the local mean streamwise velocity, the proposed algorithm uses the measured local instantaneous velocity for data convection. It consists of a step-by-step reconstruction based on a mixed Lagrangian–Eulerian solver that includes the 3D interpolation of scattered flow data and that relaxes the Taylor’s hypothesis by iterative enforcement of the incompressibility constraint on the velocity field. This methodology provides 3D fields with temporal resolution, spatial resolution, and accuracy comparable to that of real 3D snapshots, thus providing a practical alternative to tomographic measurements. The procedure is validated using numerical data of the constant-density channel flow available on the Johns Hopkins University Turbulence Database (JHTDB), showing the accurate reconstruction of the 3D velocity field. The algorithm is applied to an experimental dataset of PLIF and SPIV measurements of a variable-density jet flow, demonstrating its capability to provide 3D velocity and density fields that are more consistent with the Navier–Stokes equations compared to the mean flow convective method. Graphic abstract

42 ENGINEERING↗

Image reconstruction from sparse data ion synchrotron-radiation-based micro-tomography.

Synchrotron-radiation-based microcomputed-tomography (SR-{micro}CT) is a powerful tool for yielding 3D structural information of high spatial and contrast resolution about a specimen preserved in its natural state. A large number of projection views are required currently for yielding SR-{micro}CT images by use of existing algorithms without significant artifacts. When a wet biological specimen is imaged, synchrotron x-ray radiation from a large number of projection views can result in significant structural deformation within the specimen. A possible approach to reducing imaging time and specimen deformation is to decrease the number of projection views. In the work, using reconstruction algorithms developed recently for medical computed tomography (CT), we investigate and demonstrate image reconstruction from sparse-view data acquired in SR-{micro}CT. Numerical results of our study suggest that images of practical value can be obtained from data acquired at a number of projection views significantly lower than those used currently in a typical SR-{micro}CT imaging experiment.

99 GENERAL AND MISCELLANEOUS↗

Constructing a Knowledge Graph & Applying Graph Algorithms to Draw Insights about GES-DISC Jira Tickets

In order to assess the complexities of Jira tickets created by NASA Goddard Earth Sciences Data and Information Services Center (GES-DISC), it was beneficial to create a knowledge graph. The knowledge graph receives ticket data through the Jira API. The creation of a knowledge graph will help to answer high-level questions about internal structure, knowledge gaps, and team organization within GES-DISC. To work towards this goal, the knowledge graph was constructed in adockerizedNeo4j graph database. Once the graph had been created, graph algorithms were applied to answer high-level questions, such as exploring the role of staff in relation to projects, which qualities of a ticket contribute to the formation of communities within the graph, etc. To answer these questions, centrality and community detection algorithms were applied using Cypher querying language. The analysis of the results of the algorithms indicated that, as expected, certain individuals were more connected to some projects, while others were serving as hub nodes between two or more projects. Similarly, specific keywords are more likely to increase a Jira ticket’s centrality in the graph. In terms of community detection, when tickets in a community have certain qualities, it is more probable for them to be grouped together. To best visualize which nodes had higher centrality scores or were grouped into certain communities, interactive graphs were created in Python using Plotly and Matplotlib. Ultimately, the project was successful in creating and deploying a knowledge graph to better understand the relationships between data in GES-DISC Jira tickets

Rebecca Lipton↗

Classifying and assembling two-dimensional X-ray laser diffraction patterns of a single particle to reconstruct the three-dimensional diffraction intensity function: resolution limit due to the quantum noise

A new algorithm is developed for reconstructing the high-resolution three-dimensional diffraction intensity function of a globular biological macromolecule from many quantum-noise-limited two-dimensional X-ray laser diffraction patterns, each for an unknown orientation. The structural resolution is expressed as a function of the incident X-ray intensity and quantities characterizing the target molecule. A new two-step algorithm is developed for reconstructing the three-dimensional diffraction intensity of a globular biological macromolecule from many experimentally measured quantum-noise-limited two-dimensional X-ray laser diffraction patterns, each for an unknown orientation. The first step is classification of the two-dimensional patterns into groups according to the similarity of direction of the incident X-rays with respect to the molecule and an averaging within each group to reduce the noise. The second step is detection of common intersecting circles between the signal-enhanced two-dimensional patterns to identify their mutual location in the three-dimensional wavenumber space. The newly developed algorithm enables one to detect a signal for classification in noisy experimental photon-count data with as low as ∼0.1 photons per effective pixel. The wavenumber of such a limiting pixel determines the attainable structural resolution. From this fact, the resolution limit due to the quantum noise attainable by this new method of analysis as well as two important experimental parameters, the number of two-dimensional patterns to be measured (the load for the detector) and the number of pairs of two-dimensional patterns to be analysed (the load for the computer), are derived as a function of the incident X-ray intensity and quantities characterizing the target molecule.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

In-service health monitoring of composite structures

The aerospace industry is witnessing a vast utilization of composites in critical structural applications and anticipates even more use of them in future aircraft. Therefore, a definite need exists for a composite health monitoring expert system to meet today's current needs and tomorrow's future demands. The primary goal for this conceptual health monitoring system is functional reliably for in-service operation in the environments of various composite structures. The underlying philosophy of this system is to utilize proven vibration techniques to assess the structural integrity of a fibrous composite. Statistical methods are used to determine if the variances in the measured data are acceptable for making a reliable decision on the health status of the composite. The flexible system allows for algorithms describing any composite fatigue or damage behavior characteristic to be provided as an input to the system. Alert thresholds and variances can also be provided as an input to this system and may be updated to allow for future changes/refinements in the composite's structural integrity behavior.

Pinto, Gino A.↗