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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique

The ability of the ITD identification algorithm in identifying a complete set of structural modal parameters using a large number of free-response time histories simultaneously in one analysis, assuming a math model with a high number of degrees-of-freedom, has been studied. Identification results using simulated free responses of a uniform rectangular plate, with 225 measurement stations, and experimental responses from a ground vibration test of the Long Duration Exposure Facility (LDEF) Space Shuttle payload, with 142 measurement stations, are presented. As many as 300 degrees-of-freedom were allowed in analyzing these data. In general, the use of a significantly oversized math model in the identification process was found to maintain or increase identification accuracy and to identify modes of low response level that are not identified with smaller math model sizes. The concept of a Mode Shape Correlation Constant is introduced for use when more than one identification analysis of the same structure are conducted. This constant quantifies the degree of correlation between any two sets of complex mode shapes identified using different excitation conditions, different user-selectable algorithm constants, or overlapping sets of measurements.

Ibrahim, S. R.↗
NASA NTRS1994

Determining structure in molecular clouds

We descibe an automatic, objective routine for analyzing the clumpy structure in a spectral line position-position-velocity data cube. The algorithm works by first contouring the data at a multiple of the rms noise of the observations, then searches for peaks of emission which locate the clumps, and then follows them down to lower intensities. No a proiri clump profile is assumed. By creating simulated data, we test the performance of the algorithm and show that a contour map most accurately depicts internal structure at a contouring interval equal to twice the rms noise of the map. Blending of clump emission leads to small errors in mass and size determinations and in severe cases can result in a number of clumps being misidentified as a single unit, flattening the measured clump mass spectrum. The algorithm is applied to two real data sets as an example of its use. The Rosette molecular cloud is a 'typical' star-forming cloud, but in the Maddalena molecular cloud high-mass star formation is completely absent. Comparison of the two clump lists generated by the algorithm show that on a one-to-one basis the clumps in the star-forming cloud have higher peak temperatures, higher average densities, and are more gravitationally bound than in the non-star-forming cloud. Collective properties of the clumps, such as temperature-size-line-width-mass relations appear very similar, however. Contrary to the initial results reported in a previous paper (Williams & Blitz 1993), we find that the current, more thoroughly tes ted analysis finds no significant difference in the clump mass spectrum of the two clouds.

Williams, Jonathan P.↗
DOE OSTI2021

SANS quantification of bound water in water-soluble polymers across multiple concentration regimes

Contrast-variation small-angle neutron scattering (CV-SANS) is a widely used technique for quantifying hydration water in soft matter systems, but it is predominantly applied in the dilute regime or for systems with a well-defined structure factor. Here, CV-SANS was used to quantify the number of hydration water molecules associating with three water-soluble polymers with different critical solution temperatures and types of water–solute interactions in dilute, semidilute, and concentrated solution through the exploration of novel methods of data fitting and analysis. Multiple SANS fitting workflows with varying levels of model assumptions were evaluated and compared to give insight into SANS model selection. These fitting pathways ranged from general, model-free algorithms to more standard form and structure factor fitting. In addition, Monte Carlo bootstrapping was evaluated as a method to estimate parameter uncertainty through simulation of technical replicates. The most robust fitting workflow for dilute solutions was found to be form factor fitting without CV-SANS ( i.e. polymer in 100% D 2 O). For semidilute and concentrated solutions, while the model-free approach can be mathematically defined for CV-SANS data, the addition of a structure factor imposes physical constraints on the optimization problem, suggesting that the optimal fitting pathway should include appropriate form and structure factor models. The measured hydration numbers were consistent with the number of tightly bound water molecules associated with each monomer unit, and the concentration dependence of the hydration number was largely governed by the chemistry-specific interactions between water and polymer. Polymers with weaker water–polymer interactions ( i.e. those with fewer hydration water molecules) were found to have more bound water at higher concentrations than those with stronger water–polymer interactions due to the increase in the number of forced water–polymer contacts in the concentrated system. This SANS-based method to count hydration water molecules can be applied to polymers in any concentration regime, which will lead to improved understanding of water–polymer interactions and their impact on materials design.

36 MATERIALS SCIENCE↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
DOE OSTI2018

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2010

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗
DOE OSTI2019

Is the Trotterized UCCSD Ansatz Chemically Well-Defined?

The variational quantum eigensolver (VQE) has emerged as one of the most enticing near-term quantum algorithms that can be used to simulate many-body systems such as molecular electronic structures. Serving as an attractive ansatz in the VQE algorithm, unitary coupled cluster (UCC) theory has seen a renewed interest in recent literature. Yet, unlike the original classical UCC theory, implementation on a quantum computer requires a finite-order Suzuki-Trotter decomposition to separate the exponentials of the large sum of Pauli operators. While previous literature has recognized the non-uniqueness of different orderings of the operators in the Trotterized form of UCC methods, the question of whether or not different orderings matter at the chemical scale has not been addressed. In this letter, we explore the effect of operator ordering on the Trotterized UCCSD ansatz, as well as the much more compact k-UpCCGSD ansatz recently proposed by Lee et al. We observe a significant, system-dependent variation in the energies of Trotterizations with different operator orderings. The energy variations occur on a chemical scale, sometimes on the order of hundreds of kcal/mol. This letter establishes the need to define not only the operators present in the ansatz, but also the order in which they appear. This is necessary for adhering to the quantum chemical notion of a ``model chemistry'', in addition to the general importance of scientific reproducibility. As a final note, we suggest a useful strategy to select out of the combinatorial number of possibilities, a single well-defined and effective ordering of the operators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Chance-Constrained Optimization for Critical Infrastructure Protection

Stochastic optimization deals with making highly reliable decisions under uncertainty. Chance constraints are a crucial tool of stochastic optimization to develop mathematical optimization models; they form the backbone of many important national security data science applications. These include critical infrastructure resiliency, cyber security, power system operations, and disaster relief management. However, existing algorithms to solve chance-constrained optimization models are severely limited by problem size and structure. In this investigative study, we (i) develop new algorithms to approximate chance-constrained optimization models, (ii) demonstrate the application of chance-constraints to a national security problem, and (iii) investigate related stochastic optimization problems. We believe our work will pave way for new research is stochastic optimization as well as secure national infrastructures against unforeseen attacks.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2017

High-pressure structures of yttrium hydrides

In this study, the crystal structures of YH 3 and YH 4 at high pressure (100–250 GPa) have been explored using a genetic algorithm combined with first-principles calculations. New structures of YH 3 with space group symmetries of P21/m and I4/mmm were predicted. The electronic structures and the phonon dispersion properties of various YH 3 and YH 4 structures at different temperatures and pressures were investigated. Among YH 3 phases, the P21/m structure of YH 3 was found to have a relatively high superconducting transformation temperature T c of 19 K at 120 GPa, which is reduced to 9 K at 200 GPa. Other YH 3 structures have much lower T c s . Compared with YH 3 , the T c of the YH 4 compound is much higher, i.e. 94 K at 120 GPa and 55 K at 200 GPa.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Optimal processor assignment for pipeline computations

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Nicol, David M.↗
DOE OSTI2013

Three-dimensional reconstruction and morphologic characteristics of porous metal fiber sintered sheet

This paper presents an approach to achieve morphological characterizing for complex porous materials based on micro X-ray tomography images, with an example of a novel porous metal fiber sheet produced through solid-state sintering method. The geometrical reconstruction was performed after selection of volume of interest and image processing of anisotropic diffusion smooth. The reconstructed gray level images were then transferred into binary images by adjusting binarization threshold according to the actual porosity. Taking into account the tubular structural feature of the fibers, skeleton extraction algorithm based on the distance transform function was applied and further improved by the scale axis transform method. The skeleton was later pruned and segmented according to the contact points to perform morphological characterizing. Compared with actual manufacturing parameters, the style, length, radius, orientation and tortuosity of fiber segments were discussed. The results show that our proposed method can well describe the actual geometrical and morphological characteristics, which will provide a promising method for the structural description of fibrous networks. - Highlights: • Micro-CT technology was used to achieve the 3D geometrical reconstruction. • Skeleton extraction algorithm was modified to get the medial skeleton. • Skeleton filter operation was adopted to deal with the segmented skeleton. • Useful morphological statistics was obtained through skeleton segments. • Relationship between structure and manufacturing processes was discussed.

36 MATERIALS SCIENCE↗
NASA NTRS1993

Recent advances and progress towards an integrated interdisciplinary thermal-structural finite element technology

An integrated finite element approach is presented for interdisciplinary thermal-structural problems. Of the various numerical approaches, finite element methods with direct time integration procedures are most widely used for these nonlinear problems. Traditionally, combined thermal-structural analysis is performed sequentially by transferring data between thermal and structural analysis. This approach is generally effective and routinely used. However, to solve the combined thermal-structural problems, this approach results in cumbersome data transfer, incompatible algorithmic representations, and different discretized element formulations. The integrated approach discussed in this paper effectively combines thermal and structural fields, thus overcoming the above major shortcomings. The approach follows Lax-Wendroff type finite element formulations with flux and stress based representations. As a consequence, this integrated approach uses common algorithmic representations and element formulations. Illustrative test examples show that the approach is effective for integrated thermal-structural problems.

Namburu, Raju R.↗
DOE OSTI2022

Fock-Space Schrieffer–Wolff Transformation: Classically-Assisted Rank-Reduced Quantum Phase Estimation Algorithm

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer–Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity-transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

SU-E-T-316: The Design of a Risk Index Method for 3D Patient Specific QA

Purpose: To suggest a new guidance for the evaluation of 3D patient specific QA, a structure-specific risk-index (RI) method was designed and implemented. Methods: A new algorithm was designed to assign the score of Pass, Fail or Pass with Risk to all 3D voxels in each structure by improving a conventional Gamma Index (GI) algorithm, which implied the degree of the risk of under-dose to the treatment target or over-dose to the organ at risks (OAR). Structure-specific distance to agreement (DTOA), dose difference and minimum checkable dose were applied to the GI algorithm, and additional parameters such as dose gradient factor and dose limit of structures were used to the RI method. Maximum passing rate (PR) and minimum PR were designed and calculated for each structure with the RI method. 3D doses were acquired from a spine SBRT plan by simulating the shift of beam iso-center, and tested to show the feasibility of the suggested method. Results: When the iso-center was shifted by 1 mm, 2 mm, and 3 mm, the PR of conventional GI method between shifted and non-shifted 3D doses were 99.9%, 97.4%, and 89.7% for PTV, 99.8%, 84.8%, and 63.2% for spinal cord, and 100%, 99.5%, 91.7% for right lung. The minimum PRs from the RI method were 98.9%, 96.9%, and 89.5% for PTV, and 96.1%, 79.3%, 57.5% for spinal cord, and 92.5%, 92.0%, 84.4% for right lung, respectively. The maximum PRs from the RI method were equal or less than the PRs from the conventional GI evaluation. Conclusion: Designed 3D RI method showed more strict acceptance level than the conventional GI method, especially for OARs. The RI method is expected to give the degrees of risks in the delivered doses, as well as the degrees of agreements between calculated 3D doses and measured (or simulated) 3D doses.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1979

FORTRAN subroutines for out-of-core solutions of large complex linear systems

The design and usage of two main subprograms using direct methods to solve large linear complex systems, of the form Ax = b, whose coeffficient matrices are too large to be stored in core are described. The first main subprogram is for systems whose coefficient matrices are of a particular sparse structure, namely, the matrix A can be written in the form B + D, where B is a block-banded system, and D has only a few columns of nonzeros. Key elements of the algorithms used in the subprograms include: the data structure, the strategy for preserving numerical stability, the adaptability of the algorithms for dense systems as well as for block-profile systems.

Yip, E. L.↗
DOE OSTI2014

Frequency up-conversion in nonpolar a-plane GaN/AlGaN based multiple quantum wells optimized for applications with silicon solar cells

We have described a method for structural parameters optimization of GaN/AlGaN multiple quantum well based up-converter for silicon solar cells. It involves a systematic tuning of individual step quantum wells by use of the genetic algorithm for global optimization. In quantum well structures, the up-conversion process can be achieved by utilizing nonlinear optical effects based on intersubband transitions. Both single and double step quantum wells have been tested in order to maximize the second order susceptibility derived from the density matrix formalism. The results obtained for single step wells proved slightly better and have been further pursued to obtain a more complex design, optimized for conversion of an entire range of incident photon energies.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗