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

AHF: Array-Based Half-Facet Data Structure for Mixed-Dimensional and Non-Manifold Meshes

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixed-dimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

Dyedov, Volodymyr↗

THE AREA DISTRIBUTION OF SOLAR MAGNETIC BRIGHT POINTS

Magnetic bright points (MBPs) are among the smallest observable objects on the solar photosphere. A combination of G-band observations and numerical simulations is used to determine their area distribution. An automatic detection algorithm, employing one-dimensional intensity profiling, is utilized to identify these structures in the observed and simulated data sets. Both distributions peak at an area of {approx}45,000 km{sup 2}, with a sharp decrease toward smaller areas. The distributions conform with log-normal statistics, which suggests that flux fragmentation dominates over flux convergence. Radiative magneto-convection simulations indicate an independence in the MBP area distribution for differing magnetic flux densities. The most commonly occurring bright point size corresponds to the typical width of inter-granular lanes.

79 ASTRONOMY AND ASTROPHYSICS↗

Unsupervised Learning Through Randomized Algorithms for High-Volume High-Velocity Data (ULTRA-HV).

Through long-term investments in computing, algorithms, facilities, and instrumentation, DOE is an established leader in massive-scale, high-fidelity simulations, as well as science-leading experimentation. In both cases, DOE is generating more data than it can analyze and the problem is intensifying quickly. The need for advanced algorithms that can automatically convert the abundance of data into a wealth of useful information by discovering hidden structures is well recognized. Such efforts however, are hindered by the massive volume of the data and its high velocity. Here, the challenge is developing unsupervised learning methods to discover hidden structure in high-volume, high-velocity data.

97 MATHEMATICS AND COMPUTING↗

Status and prospects of computational fluid dynamics for unsteady transonic viscous flows

Applications of computational aerodynamics to aeronautical research, design, and analysis have increased rapidly over the past decade, and these applications offer significant benefits to aeroelasticians. The past developments are traced by means of a number of specific examples, and the trends are projected over the next several years. The crucial factors that limit the present capabilities for unsteady analyses are identified; they include computer speed and memory, algorithm and solution methods, grid generation, turbulence modeling, vortex modeling, data processing, and coupling of the aerodynamic and structural dynamic analyses. The prospects for overcoming these limitations are presented, and many improvements appear to be readily attainable. If so, a complete and reliable numerical simulation of the unsteady, transonic viscous flow around a realistic fighter aircraft configuration could become possible within the next decade. The possibilities of using artificial intelligence concepts to hasten the achievement of this goal are also discussed.

Mccroskey, W. J.↗

Status and prospects of computational fluid dynamics for unsteady transonic flow

Applications of computational aerodynamics to aeronautical research, design, and analysis have increased rapidly over the past decade, and these applications offer significant benefits to aeroelasticians. The past developments are traced by means of a number of specific examples, and the trends are projected over the next several years. The crucial factors that limit the present capabilities for unsteady analyses are identified; they include computer speed and memory, algorithm and solution methods, grid generation, turbulence modeling, vortex modeling, data processing, and coupling of the aerodynamic and structural dynamic analyses. The prospects for overcoming these limitations are presented, and many improvements appear to be readily attainable. If so, a complete and reliable numerical simulation of the unsteady, transonic viscous flow around a realistic fighter aircraft configuration could become possible within the next decade. The possibilities of using artificial intelligence concepts to hasten the achievement of this goal are also discussed.

Mccroskey, W. J.↗

Some experiences with the Eigensystem Realization Algorithm

The Eigensystem Realization Algorithm (ERA) is a multiinput/multioutput time-domain algorithm for minimum-order system realization and modal parameter identification. It has been used for structural dynamics data analysis at the Langley Research Center for several years. Some of the practical experiences encountered in these projects are discussed in this paper. Three examples are used: the Galileo spacecraft, the Solar Array Flight Experiment, and a laboratory space-truss model. Several techniques for assessing identification accuracy are illustrated.

Pappa, Richard S.↗

Topology of large-scale structure. IV - Topology in two dimensions

In a recent series of papers, an algorithm was developed for quantitatively measuring the topology of the large-scale structure of the universe and this algorithm was applied to numerical models and to three-dimensional observational data sets. In this paper, it is shown that topological information can be derived from a two-dimensional cross section of a density field, and analytic expressions are given for a Gaussian random field. The application of a two-dimensional numerical algorithm for measuring topology to cross sections of three-dimensional models is demonstrated.

Melott, Adrian L.↗

Reliable Transport over SpaceWire for James Webb Space Telescope (JWST) Focal Plane Electronics (FPE) Network

NASA's James Webb Space Telescope (JWST) faces difficult technical and budgetary challenges to overcome before it is scheduled launch in 2010. The Integrated Science Instrument Module (ISIM), shares these challenges. The major challenge addressed in this paper is the data network used to collect, process, compresses and store Infrared data. A total of 114 Mbps of raw information must be collected from 19 sources and delivered to the two redundant data processing units across a twenty meter deployed thermally restricted interface. Further data must be transferred to the solid-state recorder and the spacecraft. The JWST detectors are kept at cryogenic temperatures to obtain the sensitivity necessary to measure faint energy sources. The Focal Plane Electronics (FPE) that sample the detector, generate packets from the samples, and transmit these packets to the processing electronics must dissipate little power in order to help keep the detectors at these cold temperatures. Separating the low powered front-end electronics from the higher-powered processing electronics, and using a simple high-speed protocol to transmit the detector data minimize the power dissipation near the detectors. Low Voltage Differential Signaling (LVDS) drivers were considered an obvious choice for physical layer because of their high speed and low power. The mechanical restriction on the number cables across the thermal interface force the Image packets to be concentrated upon two high-speed links. These links connect the many image packet sources, Focal Plane Electronics (FPE), located near the cryogenic detectors to the processing electronics on the spacecraft structure. From 12 to 10,000 seconds of raw data are processed to make up an image, various algorithms integrate the pixel data Loss of commands to configure the detectors as well as the loss of science data itself may cause inefficiency in the use of the telescope that are unacceptable given the high cost of the observatory. This combination of requirements necessitates a redundant, fault tolerant, high- speed, low mass, low power network with a low Bit error Rate(1E-9- 1E-12). The ISIM systems team performed many studies of the various network architectures that meeting these requirements. The architecture selected uses the Spacewire protocol, with the addition of a new transport and network layer added to implement end-to-end reliable transport. The network and reliable transport mechanism must be implemented in hardware because of the high average information rate and the restriction on the ability of the detectors to buffer data due to power and size restrictions. This network and transport mechanism was designed to be compatible with existing Spacewire links and routers so that existing equipment and designs may be leveraged upon. The transport layer specification is being coordinated with European Space Agency (ESA), Spacewire Working Group and the Consultative Committee for Space Data System (CCSDS) PlK Standard Onboard Interface (SOIF) panel, with the intent of developing a standard for reliable transport for Spacewire. Changes to the protocol presented are likely since negotiations are ongoing with these groups. A block of RTL VHDL that implements a multi-port Spacewire router with an external user interface will be developed and integrated with an existing Spacewire Link design. The external user interface will be the local interface that sources and sinks packets onto and off of the network (Figure 3). The external user interface implements the network and transport layer and handles acknowledgements and re-tries of packets for reliable transport over the network. Because the design is written in RTL, it may be ported to any technology but will initially be targeted to the new Actel Accelerator series (AX) part. Each link will run at 160 Mbps and the power will be about 0.165 Watt per link worst case in the Actel AX.

Rakow, Glenn↗

Collisional and dynamical history of Gaspra

Interpretation of the impact record on Gaspra requires understanding of the effects of collisions on a target body of Gaspra's size and shape, recognition of impact features that may have different morphologies from craters on larger planets, and models of the geological processes that erase and modify impact features. Crater counts on the 140 sq km of Gaspra imaged at highest resolution by the Galileo spacecraft show a steep size-frequency distribution (cumulative power-law index near -3.5) from the smallest resolvable size (150 m diameter) up through the large feature (1.5 km diameter crater) of familiar crater-like morphology. In addition, there appear to be as many as eight roughly circular concavities with diameters greater than 3 km visible on the asteroid. If we restrict our crater counts to features with traditionally recognized crater morphologies, these concavities would not be included. However, if we define craters to include any concave structures that may represent local or regional damage at an impact size, then the larger features on Gaspra are candidates for consideration. Acceptance of the multi-km features as craters has been cautious for several reasons. First, scaling laws (the physically plausible algorithms for extrapolating from experimental data) indicate that Gaspra could not have sustained such large-crater-forming impacts without being disrupted; second, aside from concavity, the larger structures have no other features (e.g. rims) that can be identified with known impact craters; and third, extrapolation of the power-law size distribution for smaller craters predicts no craters larger than 3 km over the entire surface. On the other hand, recent hydrocode modeling of impacts shows that for given impact (albeit into a sphere), the crater size is much larger than given by scaling laws. Gaspra-size bodies can sustain formation of up to 8-km craters without disruption. Besides allowing larger impact craters, this result doubles the lifetime since the last catastrophic fragmentation event up to one billion years. Events that create multi-km craters also globally damage the material structure, such that regolith is produced, whether or not Gaspra 'initially' had a regolith, contrary to other models in which initial regolith is required in order to allow current regolith. Because the globally destructive shock wave precedes basin formation, crater size is closer to the large size extrapolated from gravity-scaling rather than the strength-scaling that had earlier been assumed for such small bodies. This mechanism may also help explain the existence of Stickney on Phobos. Moreover, rejection of the large concavities as craters based on unfamiliar morphology would be premature, because (aside from Stickney) we have no other data on such large impact structures on such a small, irregular body. The eight candidate concavities cover an area greater than that counted for smaller craters, because they are most apparent where small craters cannot be seen: on low resolution images and at the limb on high resolution images. We estimate that there are at least two with diameter greater than 4 km per 140 sq km, which would have to be accounted for in any model that claims these are impact craters.

Greenberg, R.↗

Constrained GAN-Generated X-Ray CT Data For Self-Supervised And Foundation-Model Segmentation Of Concrete Microstructures

Three-dimensional characterization of materials using X-ray computed tomography (XCT) is challenging due to the complexity of internal structures, noise, and variations in resolution. Traditional computer vision models often struggle to accurately segment these images, particularly in domain-specific applications like materials science. While supervised deep learning approaches have been developed to address the limitations of conventional algorithms, they typically require large amounts of labeled training data and often fail to generalize across different datasets. Self-supervised, few-and zero-shot learning methods have gained prominence in natural image processing and segmentation tasks, but their application to scientific imaging remains limited due to the unique structural complexity, noise, and textural artifacts present in materials science data. In this work, we investigate how domain adaptation, leveraging physics-based and GAN-generated synthetic data, impacts segmentation performance. We introduce a modified Contrastive Unpaired Translation (CUT) model designed to generate realistic labeled data, which can be used for training, pre-training, and fine-tuning segmentation models for real XCT microstructure data. We evaluate the performance of two segmentation approaches: a self-supervised network (SSL-ALPNet) and a foundation model (Segment Anything Model), assessing their improvements when pre-trained and/or fine-tuned on the synthesized data. Our results demonstrate that leveraging synthetic data significantly enhances segmentation performance, particularly in challenging materials science applications.

Ziabari, Amir [ORNL] (ORCID:000000034776457X)↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

A Network-Based Algorithm for Clustering Multivariate Repeated Measures Data

The National Aeronautics and Space Administration (NASA) Astronaut Corps is a unique occupational cohort for which vast amounts of measures data have been collected repeatedly in research or operational studies pre-, in-, and post-flight, as well as during multiple clinical care visits. In exploratory analyses aimed at generating hypotheses regarding physiological changes associated with spaceflight exposure, such as impaired vision, it is of interest to identify anomalies and trends across these expansive datasets. Multivariate clustering algorithms for repeated measures data may help parse the data to identify homogeneous groups of astronauts that have higher risks for a particular physiological change. However, available clustering methods may not be able to accommodate the complex data structures found in NASA data, since the methods often rely on strict model assumptions, require equally-spaced and balanced assessment times, cannot accommodate missing data or differing time scales across variables, and cannot process continuous and discrete data simultaneously. To fill this gap, we propose a network-based, multivariate clustering algorithm for repeated measures data that can be tailored to fit various research settings. Using simulated data, we demonstrate how our method can be used to identify patterns in complex data structures found in practice.

Koslovsky, Matthew↗

Large space structures control algorithm characterization

Feedback control algorithms are developed for sensor/actuator pairs on large space systems. These algorithms have been sized in terms of (1) floating point operation (FLOP) demands; (2) storage for variables; and (3) input/output data flow. FLOP sizing (per control cycle) was done as a function of the number of control states and the number of sensor/actuator pairs. Storage for variables and I/O sizing was done for specific structure examples.

Fogel, E.↗

The value of protein structure classification information-Surveying the scientific literature

The Structural Classification of Proteins (SCOP) and Class, Architecture, Topology, Homology (CATH) databases have been valuable resources for protein structure classification for over 20 years. Development of SCOP (version 1) concluded in June 2009 with SCOP 1.75. The SCOPe (SCOP-extended) database offers continued development of the classic SCOP hierarchy, adding over 33,000 structures. We have attempted to assess the impact of these two decade old resources and guide future development. To this end, we surveyed recent articles to learn how structure classification data are used. Of 571 articles published in 2012-2013 that cite SCOP, 439 actually use data from the resource. We found that the type of use was fairly evenly distributed among four top categories: A) study protein structure or evolution (27% of articles), B) train and/or benchmark algorithms (28% of articles), C) augment non-SCOP datasets with SCOP classification (21% of articles), and D) examine the classification of one protein/a small set of proteins (22% of articles). Most articles described computational research, although 11% described purely experimental research, and a further 9% included both. We examined how CATH and SCOP were used in 158 articles that cited both databases: while some studies used only one dataset, the majority used data from both resources. Protein structure classification remains highly relevant for a diverse range of problems and settings.

59 BASIC BIOLOGICAL SCIENCES↗

Specification of inputs and instrumentation for flutter testing of multivariable systems

The application of system identification methods in flutter testing of aeroelastic structure is discussed. The accuracy with which flutter parameters are estimated depends upon the test plan and on the algorithms used to reduce the data. The techniques for selecting the kinds and optimal positions of inputs and instrumentation, under typical test constraints, are presented. Identification results for both the input/output transfer function and the value of physical parameters are given. Numerical results on the optimal input spectrum and the accelerometer location for estimating flutter parameters of a two dimensional wing are obtained using these algorithms. Current work on applying system identification methods to high order three dimensional aeroelastic structures is reported.

Gupta, N. K.↗

Multi-physics Topology OPtimization and Additive Manufacturing for High-temperature Heat Exchangers

This research significantly advances the understanding of high-temperature heat exchanger design through an integrated approach that combines topology optimization (TO), triply periodic minimal surface (TPMS) structures, additive manufacturing (AM) and thermohydraulic testing. Each of these components contributes uniquely to a unified, high-performance design, fabrication and testing workflow. Topology optimization serves as the foundation of the design methodology by providing a systematic way to determine the most effective material layout for separating hot and cold fluids while maximizing thermal performance. The researchers introduced a novel three-material optimization framework using two density fields to represent hot fluid, cold fluid, and solid domains. This approach enables automated discovery of optimal shapes and flow paths that cannot be intuitively designed, especially under constraints imposed by manufacturing technologies. Furthermore, constraints such as minimal wall thickness and overhang angles were embedded into the optimization process, ensuring that resulting designs are not only thermally efficient but also manufacturable using modern additive techniques. In parallel, the study delves into the use of Gyroid-based TPMS geometries for constructing the core of the heat exchanger. TPMS structures are known for their high surface area, excellent fluid mixing capabilities, and minimal pressure drop characteristics. The researchers applied a data-driven modeling framework using Heteroscedastic Sparse Gaussian Process Regression (HSGPR) combined with genetic algorithms. This allowed for the rapid evaluation and optimization of key geometric parameters such as frequency, iso-value, and phase shift. The result was a set of Gyroid structures tailored for high heat transfer and low flow resistance, demonstrating clear improvements over conventional straight-channel designs. After the designing process, additive manufacturing played a critical role by turning these highly complex, optimized geometries into physical components. Utilizing Laser Powder Bed Fusion (LPBF) with Haynes 282, the study demonstrated the feasibility of fabricating these heat exchangers at high precision. Post-processing methods, including dilation-erosion operations, were applied to ensure local features adhered to self-supporting constraints. The fabricated structures were then subjected to thermohydraulic testing under conditions representative of supercritical CO 2 Brayton cycles, validating the predicted performance and confirming the viability of the full design-to-fabrication pipeline. Finally, thermohydraulic testing across the above studies served as a crucial experimental validation of advanced heat exchanger. Under consistent high-temperature and high-pressure conditions using supercritical CO 2 , the testing demonstrated that both TO and Gyroid-based TPMS designs significantly outperformed conventional straight-channel HXs. The TO design achieved a 115% increase in UA and NTU and a 27.6% boost in gravimetric power density, while the data-driven optimized Gyroid design delivered a 166% increase in UA and NTU and improved effectiveness from 68.7% to 86.1%. These results validate the simulation models, confirm the manufacturability of complex geometries under AM constraints, and provide key insights into design-performance trade-offs, thereby advancing the development of high-efficiency, compact heat exchangers for extreme environments.

36 MATERIALS SCIENCE↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Accurate Cold-Test Model of Helical TWT Slow-Wave Circuits

Recently, a method has been established to accurately calculate cold-test data for helical slow-wave structures using the three-dimensional (3-D) electromagnetic computer code, MAxwell's equations by the Finite Integration Algorithm (MAFIA). Cold-test parameters have been calculated for several helical traveLing-wave tube (TWT) slow-wave circuits possessing various support rod configurations, and results are presented here showing excellent agreement with experiment. The helical models include tape thickness, dielectric support shapes and material properties consistent with the actual circuits. The cold-test data from this helical model can be used as input into large-signal helical TWT interaction codes making It possible, for the first time, to design complete TWT via computer simulation.

Kory, Carol L.↗