Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,351 records · Page 75
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

A Finite Element Approach for Simplified 2D Nonlinear Dynamic Contact/Impact Analysis

In this paper, a simplified numerical approach for finite element dynamic analysis of an inelastic solid structure subjected to solid object impact is presented. The approach approximates the impacting solid as the selected multiple nodes, for which mass of the impactor is distributed. The node-to-segment contact formulation with the penalty constraint technique incorporated is employed to impose contact conditions between the nodes and the surface of the receiver structure. The node-to-segment algorithm is integrated into Newton–Raphson time integration scheme and the Lagrange multiplier technique is applied to enforce the identical displacements for the selected nodes throughout the analysis process. The approach is verified using two-dimensional plane strain models considering elastic-perfectly-plastic material behavior. The results obtained using the proposed approach are in a good agreement with those simulated using a commercial finite element code, ABAQUS dynamic/implicit, in terms of displacements and stress distribution fields. The proposed approach is shown to be computationally superior to general finite element method-based contact/impact analysis without significantly sacrificing the accuracy.

Seungwook Seok↗
DOE OSTI2017

Observing the Next Galactic Supernova with the NOvA Detectors

The next galactic core-collapse supernova will deliver a wealth of neutrinos which for the first time we are well-situated to measure. These explosions produce neutrinos with energies between 10 and 100 MeV over a period of tens of seconds. Galactic supernovae are relatively rare events, occurring with a frequency of just a few per century. It is therefore essential that all neutrino detectors capable of detecting these neutrinos are ready to trigger on this signal when it occurs. This poster describes a data-driven trigger which is designed to detect the neutrino signal from a galactic core-collapse supernova with the NOvA detectors. The trigger analyzes 5ms blocks of detector activity and applies background rejection algorithms to detect the signal time structure over the background. This background reduction is an essential part of the process, as the NOvA detectors are designed to detect neutrinos from Fermilab's NuMI beam which have an average energy of 2GeV--well above the average energy of supernova neutrinos.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

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

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

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Unraveling the Planar-Globular Transition in Gold Nanoclusters through Evolutionary Search

Au nanoclusters are of technological relevance for catalysis, photonics, sensors, and of fundamental scientific interest owing to planar to globular structural transformation at an anomalously high number of atoms i.e. in the range 12-14. The nature and causes of this transition remain a mystery. In order to unravel this conundrum, high throughput density functional theory (DFT) calculations, coupled with a global structural optimization scheme based on a modified genetic algorithm (GA) are conducted. Furthermore, more than 20,000 Au 12 , Au 13 , and Au 14 nanoclusters are evaluated. With any DFT functional, globular and planar structures coexist across the size range of interest. Contrary to what was previously believed, the planar-globular transition is gradual at room temperature rather than a sharp transition. The effects of anionicity, s-d band hybridization and long range interactions on the dimensional transition are quantified by using the structures adjacent to minima. Anionicity marginally changes the relative stability of the clusters. The degree of s-d hybridization is varied via changing the Hubbard U value which corroborate that s-d hybridization alone does not stabilize planar structures. van der Waals interactions, on the other hand, stabilize globular structures. Our results elucidate the balance between the different reasons of the dimensional transition in gold nanoclusters.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Generalized representative structures for atomistic systems

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g. the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40–72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted.

atomic cluster expansion↗
DOE OSTI2021

Clinical Natural Language Processing for Radiation Oncology: A Review and Practical Primer

Natural language processing (NLP), which aims to convert human language into expressions that can be analyzed by computers, is one of the most rapidly developing and widely used technologies in the field of artificial intelligence. Natural language processing algorithms convert unstructured free text data into structured data that can be extracted and analyzed at scale. In medicine, this unlocking of the rich, expressive data within clinical free text in electronic medical records will help untap the full potential of big data for research and clinical purposes. Recent major NLP algorithmic advances have significantly improved the performance of these algorithms, leading to a surge in academic and industry interest in developing tools to automate information extraction and phenotyping from clinical texts. Thus, these technologies are poised to transform medical research and alter clinical practices in the future. Radiation oncology stands to benefit from NLP algorithms if they are appropriately developed and deployed, as they may enable advances such as automated inclusion of radiation therapy details into cancer registries, discovery of novel insights about cancer care, and improved patient data curation and presentation at the point of care. However, challenges remain before the full value of NLP is realized, such as the plethora of jargon specific to radiation oncology, nonstandard nomenclature, a lack of publicly available labeled data for model development, and interoperability limitations between radiation oncology data silos. Successful development and implementation of high quality and high value NLP models for radiation oncology will require close collaboration between computer scientists and the radiation oncology community. Here, we present a primer on artificial intelligence algorithms in general and NLP algorithms in particular; provide guidance on how to assess the performance of such algorithms; review prior research on NLP algorithms for oncology; and describe future avenues for NLP in radiation oncology research and clinics.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

Brief announcement: Hypergraph parititioning for parallel sparse matrix-matrix multiplication

The performance of parallel algorithms for sparse matrix-matrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the input matrices. In this paper, we characterize the communication cost of a sparse matrix-matrix multiplication algorithm in terms of the size of a cut of an associated hypergraph that encodes the computation for a given input nonzero structure. Obtaining an optimal algorithm corresponds to solving a hypergraph partitioning problem. Furthermore, our hypergraph model generalizes several existing models for sparse matrix-vector multiplication, and we can leverage hypergraph partitioners developed for that computation to improve application-specific algorithms for multiplying sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

New approach for absolute fluence distribution calculations in Monte Carlo simulations of light propagation in turbid media

A novel way to attain three dimensional fluence rate maps from Monte-Carlo simulations of photon propagation is presented in this work. The propagation of light in a turbid medium is described by the radiative transfer equation and formulated in terms of radiance. For many applications, particularly in biomedical optics, the fluence rate is a more useful quantity and directly derived from the radiance by integrating over all directions. Contrary to the usual way which calculates the fluence rate from absorbed photon power, the fluence rate in this work is directly calculated from the photon packet trajectory. The voxel based algorithm works in arbitrary geometries and material distributions. It is shown that the new algorithm is more efficient and also works in materials with a low or even zero absorption coefficient. The capabilities of the new algorithm are demonstrated on a curved layered structure, where a non-scattering, non-absorbing layer is sandwiched between two highly scattering layers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1972

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗
NASA NTRS1989

Optimum structural design with static aeroelastic constraints

The static aeroelastic performance characteristics, divergence velocity, control effectiveness and lift effectiveness are considered in obtaining an optimum weight structure. A typical swept wing structure is used with upper and lower skins, spar and rib thicknesses, and spar cap and vertical post cross-sectional areas as the design parameters. Incompressible aerodynamic strip theory is used to derive the constraint formulations, and aerodynamic load matrices. A Sequential Unconstrained Minimization Technique (SUMT) algorithm is used to optimize the wing structure to meet the desired performance constraints.

Bowman, Keith B↗
NASA NTRS1983

A sea surface height estimator using synthetic aperture radar complex imagery

A method is developed for estimating the sea surface height using the complex imagery from synthetic aperture radar (SAR). Algorithms are developed for the envelope and phase demodulation, regression, and filtering of the SAR complex imagery and are applied to simulated and actual satellite radar SEASAT-SAR data. A simulation of a simplified stationary scene is utilized in order to establish tentative sufficient conditions on large-scale SAR and sampling parameters for the accurate estimation of the scale structure's height. It is shown that the algorithm accurately estimated a long wavelength low-amplitude sea height structure present in the SEASAT-SAR data, which was determined to be consistent with observations.

Harger, R. O.↗
NASA NTRS1989

Probalistic structural analysis methods for select space propulsion system structural components

A summary of the status of this five-year project which is now in its third year of research and development is presented. The goal of the project is the development of several methodologies for probabilistic structural modeling. Probabilistic structural modeling consists of stochastic models of material properties, part geometries, boundary conditions, as well as loading conditions. The current presentation focuses on one methodology - coupling of an advanced finite element structural analysis code with probabilistic modeling strategies. The essential algorithm developments for combining the finite element and probabilistic analysis methods are reported. The validity of the resulting probabilistic structural analysis method is confirmed through a series of test problems with exact results based on Monte Carlo simulations. Additionally, the applicability of the method to a Space Propulsion System (a turbine blade) is demonstrated for static stresses.

Cruse, T. A.↗
NASA NTRS2002

Field-Programmable Gate Array Computer in Structural Analysis: An Initial Exploration

This paper reports on an initial assessment of using a Field-Programmable Gate Array (FPGA) computational device as a new tool for solving structural mechanics problems. A FPGA is an assemblage of binary gates arranged in logical blocks that are interconnected via software in a manner dependent on the algorithm being implemented and can be reprogrammed thousands of times per second. In effect, this creates a computer specialized for the problem that automatically exploits all the potential for parallel computing intrinsic in an algorithm. This inherent parallelism is the most important feature of the FPGA computational environment. It is therefore important that if a problem offers a choice of different solution algorithms, an algorithm of a higher degree of inherent parallelism should be selected. It is found that in structural analysis, an 'analog computer' style of programming, which solves problems by direct simulation of the terms in the governing differential equations, yields a more favorable solution algorithm than current solution methods. This style of programming is facilitated by a 'drag-and-drop' graphic programming language that is supplied with the particular type of FPGA computer reported in this paper. Simple examples in structural dynamics and statics illustrate the solution approach used. The FPGA system also allows linear scalability in computing capability. As the problem grows, the number of FPGA chips can be increased with no loss of computing efficiency due to data flow or algorithmic latency that occurs when a single problem is distributed among many conventional processors that operate in parallel. This initial assessment finds the FPGA hardware and software to be in their infancy in regard to the user conveniences; however, they have enormous potential for shrinking the elapsed time of structural analysis solutions if programmed with algorithms that exhibit inherent parallelism and linear scalability. This potential warrants further development of FPGA-tailored algorithms for structural analysis.

Singleterry, Robert C., Jr.↗
DOE OSTI2020

The structural information filtered features (SIFF) potential: Maximizing information stored in machine-learning descriptors for materials prediction

Machine learning inspired potentials continue to improve the ability for predicting structures of materials. However, many challenges still exist, particularly when calculating structures of disordered systems. These challenges are primarily due to the rapidly increasing dimensionality of the feature-vector space which in most machine-learning algorithms is dependent on the size of the structure. In this article, we present a feature-engineered approach that establishes a set of principles for representing potentials of physical structures (crystals, molecules, and clusters) in a feature space rather than a physically motivated space. Our goal in this work is to define guiding principles that optimize information storage of the physical parameters within the feature representations. In this manner, we focus on keeping the dimensionality of the feature space independent of the number of atoms in the structure. Our Structural Information Filtered Features (SIFF) potential represents structures by utilizing a feature vector of low-correlated descriptors, which correspondingly maximizes information within the descriptor. We present results of our SIFF potential on datasets composed of disordered (carbon and carbon–oxygen) clusters, molecules with C 7 O 2 H 2 stoichiometry in the GDB9-14B dataset, and crystal structures of the form (Al x Ga y In z ) 2 O 3 as proposed in the NOMAD Kaggle competition. Our potential's performance is at least comparable, sometimes significantly more accurate, and often more efficient than other well-known machine-learning potentials for structure prediction. However, primarily, we offer a different perspective on how researchers should consider opportunities in maximizing information storage for features.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Interface Structure Prediction from First-Principles

Information about the atomic structures at solid–solid interfaces is crucial for understanding and predicting the performance of materials. Due to the complexity of the interfaces, it is very challenging to resolve their atomic structures using either experimental techniques or computer simulations. In this paper, we present an efficient first-principles computational method for interface structure prediction based on an adaptive genetic algorithm. This approach significantly reduces the computational cost, while retaining the accuracy of first-principles prediction. The method is applied to the investigation of both stoichiometric and nonstoichiometric SrTiO3 Σ3(112)[1¯10] grain boundaries with unit cell containing up to 200 atoms. Several novel low-energy structures are discovered, which provide fresh insights into the structure and stability of the grain boundaries.

36 MATERIALS SCIENCE↗
NASA NTRS1998

Effect of Uncertainty of Identified Parameters on Structural Damage Detection

This paper presents a study of the effect of the uncertainty of identified parameters on the damage detection of structure. The identified parameters, which are obtained by applying system identification algorithms to analyze the time-domain response data, have uncertainty due to noise, environmental change, etc. The damage of some structural elements may have less effect on the identified parameters than noise or environmental change, so some damage situations cannot be distinguished under these circumstances. An algorithm is presented to determine whether the considered damage can be distinguished. A twenty-bay truss structure is used to demonstrate and verify the study.

Davidson, Mario↗
DOE OSTI2019

Generation and characterization of carbon fiber microstructure in atomistic simulations

A clear understanding of carbon fiber (CF) microstructure is necessary for the development of high strength CFs. Here, we present an atomistic approach for generating and characterizing realistic mi- crostructures of CFs. Large-scale reactive molecular dynamics simulations are used to generate a set of distinct CF microstructures. Comprehensive characterization of the simulated microstructures is enabled by the development of a suite of computational structural analysis tools capable of evaluation of hy- bridization states of carbon atoms, populations and orientations of individual carbon rings, degree of graphitization, and pore size distribution. The calculation of X-ray diffraction profiles provides a direct link between the structural features of simulated samples and experimental data available for CFs. The CF generation algorithm is shown to produce microstructures with experimental densities and with structural characteristics matching those of PAN-based CFs. The key structural features affecting the properties of CFs, such as the relative fractions of graphitic, turbostratic and amorphous micro- constituents, degree of alignment, pore size distributions, and chemical cross-linking can be effectively controlled in simulations, thus enabling efficient exploration of structureeproperties relationships in CFs. The capabilities of the developed approach are illustrated by performing computational analysis of the mechanical deformation and fracture of CFs under axial tensile loading.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗