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 1,783 records · Page 99

Toward accurate prediction of partial-penetration laser weld performance informed by three-dimensional characterization – Part II: μCT based finite element simulations

The mechanical behavior of partial-penetration laser welds exhibits significant variability in engineering quantities such as strength and apparent ductility. Understanding the root cause of this variability is important when using such welds in engineering designs. In Part II of this work, we develop finite element simulations with geometry derived from micro-computed tomography (μCT) scans of partial-penetration 304L stainless steel laser welds that were analyzed in Part I. We use these models to study the effects of the welds’ small-scale geometry, including porosity and weld depth variability, on the structural performance metrics of weld ductility and strength under quasi-static tensile loading. We show that this small-scale geometry is the primary cause of the observed variability for these mechanical response quantities. Additionally, we explore the sensitivity of model results to the conversion of the μCT data to discretized model geometry using different segmentation algorithms, and to the effect of small-scale geometry simplifications for pore shape and weld root texture. The modeling approach outlined and results of this work may be applicable to other material systems with small-scale geometric features and defects, such as additively manufactured materials.

36 MATERIALS SCIENCE↗

Genomic Functionalization: The Next Revolution In Biology

We have implemented a ligand-alignment algorithm into our developed computational pipeline for identifying specificity-determining features (SDFs) in protein-ligand complexes. Given a set of protein-ligand complex structures, the algorithm aligns the complexes by ligand rather than by the C -RMSD or standard approach, providing a single reference frame for extracting SDFs. We anticipate that this ligand-alignment capability will be highly useful for protein function prediction. We already have a database containing > 20 K ligand-protein complex crystal structures taken from the Protein Data Bank. By aligning these proteins to single reference frames using ligand alignment, we can submit the complexes to our pipeline for SDF extraction. The SDFs derived from this training procedure can be used as thumbprints that are hallmarks of individual enzyme classes. These SDF thumbprints may then serve as guides to the prediction of function of new unknown proteins.

59 BASIC BIOLOGICAL SCIENCES↗

Portable Parallel Algorithms and Frameworks for Exascale Graph Analytics

Graphs (or networks) are a tool used to model the interactions among various entities. Efficiently processing large graphs has recently attracted significant attention due to the applications of graphs in various domains, such as biology, chemistry, and cyber-security. Analyzing the structure and properties of these graphs is an important component of many scientific computing pipelines. With the explosion in the volume of data, graphs have become very large and can contain hundreds of billions of vertices and trillions of edges. Therefore, it is crucial to develop high-performance methods to enable graph analysis to be done quickly and energy-efficiently. Furthermore, these solutions should be highly parallel in order to take advantage of modern parallel machines. However, designing efficient solutions is not enough. With the wide variety of computing environments available, each with different programmability and performance characteristics, it is necessary to develop solutions that are portable in terms of both performance (i.e., provide theoretical guarantees) and programmability (i.e., provide high level abstractions).

97 MATHEMATICS AND COMPUTING↗

A study of trends and techniques for space base electronics

A sputtering system was developed to deposit aluminum and aluminum alloys by the dc sputtering technique. This system is designed for a high level of cleanliness and for monitoring the deposition parameters during film preparation. This system is now ready for studying the deposition and annealing parameters upon double-level metal preparation. A technique recently applied for semiconductor analysis, the finite element method, was studied for use in the computer modeling of two dimensional MOS transistor structures. It was concluded that the method has not been sufficiently well developed for confident use at this time. An algorithm was developed for confident use at this time. An algorithm was developed for implementing a computer study which is based upon the finite difference method. The program which was developed was modified and used to calculate redistribution data for boron and phosphorous which had been predeposited by ion implantation with range and straggle conditions. Data were generated for 111 oriented SOS films with redistribution in N2, dry O2 and steam ambients.

Trotter, J. D.↗

Antenna pointing of large flexible telecommunications spacecraft

Attitude control problems for large flexible telecommunications spacecraft were investigated. A typical S/C configuration is described and modeled by modal data derived from a finite element analysis. The effect of structural flexibility on radio-frequency sensor is analyzed. Model reduction using modal gain considerations is applied. Two control concepts are investigated: separate central body and antenna pointing control using direct feedback laws, centralized control using modal observer and optimal control. Performances of each concept and the algorithm implementation are assessed.

Govin, B.↗

A constitutive material model for nonlinear finite element structural analysis using an iterative matrix approach

A unified numerical method for the integration of stiff time dependent constitutive equations is presented. The solution process is directly applied to a constitutive model proposed by Bodner. The theory confronts time dependent inelastic behavior coupled with both isotropic hardening and directional hardening behaviors. Predicted stress-strain responses from this model are compared to experimental data from cyclic tests on uniaxial specimens. An algorithm is developed for the efficient integration of the Bodner flow equation. A comparison is made with the Euler integration method. An analysis of computational time is presented for the three algorithms.

Koenig, Herbert A.↗

Wing flutter boundary prediction using an unsteady Euler aerodynamic method

Modifications to an existing three-dimensional, implicit, upwind Euler/Navier-Stokes code (CFL3D Version 2.1) for the aeroelastic analysis of wings are described. These modifications, which were previously added to CFL3D Version 1.0, include the incorporation of a deforming mesh algorithm and the addition of the structural equations of motion for their simultaneous time-integration with the government flow equations. The paper gives a brief description of these modifications and presents unsteady calculations which check the modifications to the code. Euler flutter results for an isolated 45 degree swept-back wing are compared with experimental data for seven freestream Mach numbers which define the flutter boundary over a range of Mach number from 0.499 to 1.14. These comparisons show good agreement in flutter characteristics for freestream Mach numbers below unity. For freestream Mach numbers above unity, the computed aeroelastic results predict a premature rise in the flutter boundary as compared with the experimental boundary. Steady and unsteady contours of surface Mach number and pressure are included to illustrate the basic flow characteristics of the time-marching flutter calculations and to aid in identifying possible causes for the premature rise in the computational flutter boundary.

Lee-Rausch, Elizabeth M.↗

Wing flutter boundary prediction using unsteady Euler aerodynamic method

Modifications to an existing 3D implicit upwind Euler/Navier-Stokes code for the aeroelastic analysis of wings are described. These modifications include the incorporation of a deforming mesh algorithm and the addition of the structural equations of motion for their simultaneous time-integration with the governing flow equations. The paper gives a brief description of these modifications and presents unsteady calculations which check the modifications to the code. Euler flutter results for an isolated 45 deg swept-back wing are compared with experimental data for seven freestream Mach numbers which define the flutter boundary over a range of Mach number from 0.499 to 1.14. These comparisons show good agreement in flutter characteristics for freestream Mach numbers below unity. For freestream Mach numbers above unity, the computed aeroelastic results predict a premature rise in the flutter boundary as compared with the experimental boundary. Steady and unsteady contours of surface Mach number and pressure are included to illustrate the basic flow characteristics of the time-marching flutter calculations and to aid in identifying possible causes for the premature rise in the computational flutter boundary.

Lee-Rausch, Elizabeth M.↗

Detection and Height Measurement of Tenuous Clouds and Blowing Snow in ICESat-2 ATLAS Data

Tenuous atmospheric layers, such as high, thin cirrus clouds and blowing snow over Antarctica, play an important role in the climate system, affecting energy fluxes between the Earth and the atmosphere. Our knowledge of the structure of the atmosphere is largely derived from atmospheric satellite measurements. Yet tenuous layers can be hard to detect in satellite lidar data, especially in daylight data characterized by high solar background. In this study, we introduce an approach to detect tenuous atmospheric layers in the atmospheric lidar measurements of NASA's ICESat-2. The density-dimension algorithm for ICESat-2 atmospheric data (DDA-atmos) identifies atmospheric layers while automatically adapting to different background conditions of night, twilight, and daylight data. This capability, demonstrated for tenuous clouds and blowing snow, offers a data-based solution to an important climate modeling problem. Atmospheric layer boundaries, detection confidence, and density fields resultant from the DDA-atmos are reported in ICESat-2 atmospheric data product ATL09.

Ute Herzfeld↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

heterogeneous processing system↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

David K. Rutishauser↗

Novel deep learning methods for track reconstruction

For the past year, the HEP.TrkX project has been investigating machine learning solutions to LHC particle track reconstruction problems. A variety of models were studied that drew inspiration from computer vision applications and operated on an image-like representation of tracking detector data. While these approaches have shown some promise, image-based methods face challenges in scaling up to realistic HL-LHC data due to high dimensionality and sparsity. In contrast, models that can operate on the spacepoint representation of track measurements ("hits") can exploit the structure of the data to solve tasks efficiently. In this paper we will show two sets of new deep learning models for reconstructing tracks using space-point data arranged as sequences or connected graphs. In the first set of models, Recurrent Neural Networks (RNNs) are used to extrapolate, build, and evaluate track candidates akin to Kalman Filter algorithms. Such models can express their own uncertainty when trained with an appropriate likelihood loss function. The second set of models use Graph Neural Networks (GNNs) for the tasks of hit classification and segment classification. These models read a graph of connected hits and compute features on the nodes and edges. They adaptively learn which hit connections are important and which are spurious. The models are scaleable with simple architecture and relatively few parameters. Results for all models will be presented on ACTS generic detector simulated data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On efficient Hessian computation using the edge pushing algorithm in Julia

Evaluating the Hessian matrix of second-order derivatives at a sequence of points can be costly when applying second-order methods for nonlinear optimization. In this work, we discuss our experiences implementing the recently proposed Edge Pushing (EP) method in Julia as an experimental replacement for the current colouring-based methods used by JuMP, an open-source algebraic modelling language. We propose an alternative data structure for sparse Hessians to avoid the use of hash tables and analyse the space and time complexity of EP method. In our benchmarks, we find that EP is very competitive in terms of both preprocessing time and Hessian evaluation time. As a result, we identify cases where EP closes the performance gap between JuMP's previous implementation and the implementation in AMPL, a commercial software package with similar functionality.

97 MATHEMATICS AND COMPUTING↗

Real‐time XFEL data analysis at SLAC and NERSC: A trial run of nascent exascale experimental data analysis

X‐ray scattering experiments using free electron lasers (XFELs) are a powerful tool to determine the molecular structure and function of unknown samples (such as COVID‐19 viral proteins). XFEL experiments are a challenge to computing in two ways: (i) due to the high cost of running XFELs, a fast turnaround time from data acquisition to data analysis is essential to make informed decisions on experimental protocols; (ii) data‐collection rates are growing exponentially, requiring new scalable algorithms. Here we report our experiences analyzing data from two experiments at the Linac Coherent Light Source (LCLS) during September 2020. Raw data were analyzed on NERSC's Cori XC40 system, using the Superfacility paradigm: our workflow automatically moves raw data between LCLS and NERSC, where it is analyzed using the software package CCTBX. We achieved real time data analysis with a turnaround time from data acquisition to full molecular reconstruction in as little as 10 min—sufficient time for the experiment's operators to make informed decisions. By hosting the data analysis on Cori, and by automating LCLS‐NERSC interoperability, we achieved a data analysis rate which matches the data acquisition rate. Completing data analysis within 10 min is a first for XFEL experiments and an important milestone if we are to keep up with data‐collection trends.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A high-throughput workflow to analyze sequence-conformation relationships and explore hydrophobic patterning in disordered peptoids

Understanding how a macromolecule’s primary sequence governs its conformational landscape is crucial for elucidating its function, yet these design principles are still emerging for macromolecules with intrinsic disorder. Herein, we introduce a high-throughput workflow that implements a practical colorimetric conformational assay, introduces a semi-automated sequencing protocol using matrix-assisted laser desorption/ionization and tandem mass spectrometry (MALDI-MS/MS), and develops a generalizable sequence-structure algorithm. Using a model system of 20mer peptidomimetics containing polar glycine and hydrophobic N-butylglycine residues, we identified nine classifications of conformational disorder and isolated 122 unique sequences across varied compositions and conformations. Conformational distributions of three compositionally identical library sequences were corroborated through atomistic simulations and ion mobility spectrometry coupled with liquid chromatography. A data-driven strategy was developed using existing sequence variables and data-derived “motifs” to inform a machine-learning algorithm toward conformation prediction. Here, this multifaceted approach enhances our understanding of sequence-conformation relationships and offers a powerful tool for accelerating the discovery of materials with conformational control.

data-driven analysis↗

Probabilistic Context Neighborhood model for lattices

Here we present the Probabilistic Context Neighborhood model designed for two-dimensional lattices as a variation of a Markov random field assuming discrete values. In this model, the neighborhood structure has a fixed geometry but a variable order, depending on the neighbors’ values. Our model extends the Probabilistic Context Tree model, originally applicable to one-dimensional space. It retains advantageous properties, such as representing the dependence neighborhood structure as a graph in a tree format, facilitating an understanding of model complexity. Furthermore, we adapt the algorithm used to estimate the Probabilistic Context Tree to estimate the parameters of the proposed model. We illustrate the accuracy of our estimation methodology through simulation studies. Additionally, we apply the Probabilistic Context Neighborhood model to spatial real-world data, showcasing its practical utility.

97 MATHEMATICS AND COMPUTING↗

Hypercrosslinked polystyrene networks: An atomistic molecular dynamics simulation combined with a mapping/reverse mapping procedure

An algorithm involving classical molecular dynamics simulations with mapping and reverse mapping procedure is here suggested to simulate the crosslinking of the polystyrene dissolved in dichloroethane by monochlorodimethyl ether. The algorithm comprises consecutive stages: molecular dynamics atomistic simulation of a polystyrene solution, the mapping of atomistic structure onto coarse-grained model, the crosslink formation, the reverse mapping, and finally relaxation of the structure dissolved in dichloroethane and in dry state. The calculated values of the specific volume and the elastic modulus are in reasonable quantitative correspondence with experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On Distributed Model-Free Reinforcement Learning Control with Stability Guarantee

Distributed learning can enable scalable and effective decision making in numerous complex cyber-physical systems such as smart transportation, robotics swarm, power systems, etc. However, the stability of the system is usually not guaranteed in most existing learning paradigms; and this limitation can hinder the wide deployment of machine learning in decision making of safety-critical systems. This paper presents a stability guaranteed distributed reinforcement learning (SGDRL) framework for interconnected linear subsystems, without knowing the subsystem models. While the learning process requires data from a peer-to-peer (p2p) communication architecture, the control implementation of each subsystem is only based on its local state. The stability of the interconnected subsystems will be ensured by a diagonally dominant eigenvalue condition, which will then be used in a model-free RL algorithm to learn the feedback control gains. The RL algorithm structure follows an off-policy iterative framework, with interleaved policy evaluation and policy update steps. We numerically validate our theoretical results by performing simulations on four interconnected sub-systems.

Mukherjee, Sayak↗