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,243 records · Page 69

Massively parallel X-ray scattering simulations

Although present X-ray scattering techniques can provide tremendous information on the nano-structural properties of materials that are valuable in the design and fabrication of energy-relevant nano-devices, a primary challenge remains in the analyses of such data. In this paper we describe a high-performance, flexible, and scalable Grazing Incidence Small Angle X-ray Scattering simulation algorithm and codes that we have developed on multi-core/CPU and many-core/GPU clusters. We discuss in detail our implementation, optimization and performance on these platforms. Our results show speedups of ~125x on a Fermi-GPU and ~20x on a Cray-XE6 24-core node, compared to a sequential CPU code, with near linear scaling on multi-node clusters. To our knowledge, this is the first GISAXS simulation code that is flexible to compute scattered light intensities in all spatial directions allowing full reconstruction of GISAXS patterns for any complex structures and with highresolutions while reducing simulation times from months to minutes.

Sarje, Abhinav↗

via machinae : Searching for stellar streams using unsupervised machine learning

ABSTRACT We develop a new machine learning algorithm, via machinae, to identify cold stellar streams in data from the Gaia telescope. via machinae is based on ANODE, a general method that uses conditional density estimation and sideband interpolation to detect local overdensities in the data in a model agnostic way. By applying ANODE to the positions, proper motions, and photometry of stars observed by Gaia, via machinae obtains a collection of those stars deemed most likely to belong to a stellar stream. We further apply an automated line-finding method based on the Hough transform to search for line-like features in patches of the sky. In this paper, we describe the via machinae algorithm in detail and demonstrate our approach on the prominent stream GD-1. Though some parts of the algorithm are tuned to increase sensitivity to cold streams, the via machinae technique itself does not rely on astrophysical assumptions, such as the potential of the Milky Way or stellar isochrones. This flexibility suggests that it may have further applications in identifying other anomalous structures within the Gaia data set, for example debris flow and globular clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Integrated Predictive Demand Response Controller for Commercial Buildings (Final Scientific Technical Report)

This project provides algorithms to perform demand response using the thermal mass of a building. Using the thermal mass of the building is an attractive method for performing demand response because there is no need for capital expenditure. The algorithms rely on the thermal capacitance inherent in the building’s construction materials. A near-optimal “day ahead” predictive approach is developed that is meant to keep the building’s electrical demand constant during the high cost periods. This type of approach is appropriate for both time-of-use and critical peak pricing utility rate structures. The approach uses the past days data in order to determine the best temperature setpoints for the building during the high price periods on the next day. A second “model predictive approach” (MPC) uses a thermal model of the building to determine the best temperature for the next sample period. The approach uses constant feedback from the building and is capable of appropriately handling real time pricing. Both approaches are capable of using weather forecasts to improve performance. Algorithm performance was tested on a municipal library in Sacramento, CA and a large office building in Milwaukee, WI. In both cases the algorithms were capable of storing thermal energy in the building mass in such a way that the electrical demand was reduced during periods of high cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Copula-based Joint Deficit Index for Droughts

Current drought information is based on indices that do not capture the joint behaviors of hydrologic variables. To address this limitation, the potential of copulas in characterizing droughts from multiple variables is explored in this study. Starting from the standardized index (SI) algorithm, a modified index accounting for seasonality is proposed for precipitation and streamflow marginals. Utilizing Indiana stations with long-term observations (a minimum of eighty years for precipitation and fifty years for streamflow), the dependence structures of precipitation and streamflow marginals with various window sizes from 1- to 12-months are constructed from empirical copulas. A joint deficit index (JDI) is defined by using the distribution function of copulas that provides an objective (probability-based) description of the overall drought status. Not only is the proposed JDI able to reflect both emerging and prolonged droughts in a timely manner, it also allows a month-by-month drought assessment such that the required amount of precipitation for achieving normal conditions in future can be computed. The use of JDI is generalizable to other hydrologic variables as evidenced by similar drought severities gleaned from JDIs constructed separately from precipitation and streamflow data. JDI further allows the construction of an inter-variable drought index, where the entire dependence structure of precipitation and streamflow marginals is preserved.

54 ENVIRONMENTAL SCIENCES↗

The combined force field-sampling problem in simulations of disordered amyloid-β peptides

Molecular dynamics simulations of intrinsically disordered proteins (IDPs) can provide high resolution structural ensembles if the force field is accurate enough and if the simulation sufficiently samples the conformational space of the IDP with the correct weighting of sub-populations. Here, we investigate the combined force field–sampling problem by testing a standard force field as well as newer fixed charge force fields, the latter specifically motivated for better description of unfolded states and IDPs, and comparing them with a standard temperature replica exchange (TREx) protocol and a non-equilibrium Temperature Cool Walking (TCW) sampling algorithm. The force field and sampling combinations are used to characterize the structural ensembles of the amyloid-beta peptides Aβ42 and Aβ43, which both should be random coils as shown recently by experimental nuclear magnetic resonance (NMR) and 2D Förster resonance energy transfer (FRET) experiments. The results illustrate the key importance of the sampling algorithm: while the standard force field using TREx is in poor agreement with the NMR J-coupling and nuclear Overhauser effect and 2D FRET data, when using the TCW method, the standard and optimized protein-water force field combinations are in very good agreement with the same experimental data since the TCW sampling method produces qualitatively different ensembles than TREx. Lastly, we also discuss the relative merit of the 2D FRET data when validating structural ensembles using the different force fields and sampling protocols investigated in this work for small IDPs such as the Aβ42 and Aβ43 peptides.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

EMPIRICAL CONSTRAINTS ON THE OBLATENESS OF AN EXOPLANET

We show that the gas giant exoplanet HD 189733b is less oblate than Saturn, based on Spitzer Space Telescope photometry of seven transits. The observable manifestations of oblateness would have been slight anomalies during the ingress and egress phases, as well as variations in the transit depth due to spin precession. Our nondetection of these effects gives the first empirical constraints on the shape of an exoplanet. The results are consistent with the theoretical expectation that the planetary rotation period and orbital period are synchronized, in which case the oblateness would be an order of magnitude smaller than our upper limits. Conversely, if HD 189733b is assumed to be in a synchronous, zero-obliquity state, then the data give an upper bound on the quadrupole moment of the planet (J{sub 2} < 0.068 with 95% confidence) that is too weak to constrain the interior structure of the planet. An Appendix describes a fast algorithm for computing the transit light curve of an oblate planet, which was necessary for our analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Event Definition for the Automated Detection of Nuclear Proliferation Activities

In FY2020, Savannah River National Laboratory (SRNL) in collaboration with the Discovery Analytics Center (DAC) at Virginia Polytechnic Institute and State University (VT) began developing a demonstration prototype system that uses multiple machine learning and data analytic methods on largescale open data sources to identify new, developing, or undeclared nuclear programs. One of the most challenging aspects of applying machine learning techniques to such a problem is the high likelihood of extremely sparse data from disparate sources. To overcome this challenge, the current work will use a strategic combination of supervised, semi-supervised, and unsupervised learning techniques to ingest and fuse data streams to make a forecast of nuclear activities in a targeted geospatial location. Identifying potential data sources and training supervised learning algorithms is dependent upon the development of a robust foundation of targeted event domains that fundamentally define the nuclear activities of interest. This report documents the definition of a hierarchical structure for both nuclear activity and event domains that will be used to guide the research team in development or use of existing semantic dictionaries that are instrumental to searching, parsing, and categorizing events for the forecasting system’s use.

97 MATHEMATICS AND COMPUTING↗

A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks

Machine learning algorithms are heavily relied on to understand the vast amounts of data from high-energy particle collisions at the CERN Large Hadron Collider (LHC). The data from such collision events can naturally be represented with graph structures. Therefore, deep geometric methods, such as graph neural networks (GNNs), have been leveraged for various data analysis tasks in high-energy physics. One typical task is jet tagging, where jets are viewed as point clouds with distinct features and edge connections between their constituent particles. The increasing size and complexity of the LHC particle datasets, as well as the computational models used for their analysis, have greatly motivated the development of alternative fast and efficient computational paradigms such as quantum computation. In addition, to enhance the validity and robustness of deep networks, we can leverage the fundamental symmetries present in the data through the use of invariant inputs and equivariant layers. In this paper, we provide a fair and comprehensive comparison of classical graph neural networks (GNNs) and equivariant graph neural networks (EGNNs) and their quantum counterparts: quantum graph neural networks (QGNNs) and equivariant quantum graph neural networks (EQGNN). The four architectures were benchmarked on a binary classification task to classify the parton-level particle initiating the jet. Based on their area under the curve (AUC) scores, the quantum networks were found to outperform the classical networks. However, seeing the computational advantage of quantum networks in practice may have to wait for the further development of quantum technology and its associated application programming interfaces (APIs).

Forestano, Roy T. (ORCID:0000000203552076)↗

Alternating direction adaptive grid generation

The present investigation is concerned with the development of an alternating direction method which can adaptively resolve numerical solutions involving physical problems by moving the points of a coordinate grid. The alternating direction movement algorithm is applied to adapt a grid to surface data and weights which are given with respect to the grid itself. Attention is given to details concerning the alternating direction method, aspects of algorithmic construction, the choice of weights which controls the coordinate movement and structure, and questions regarding the applications of the alternating direction movement algorithm. On an analytical basis, the method is seen to move points in a nonsingular fashion.

Eiseman, P. R.↗

Communications network design and costing model programmers manual

Otpimization algorithms and techniques used in the communications network design and costing model for least cost route and least cost network problems are examined from the programmer's point of view. All system program modules, the data structures within the model, and the files which make up the data base are described.

Logan, K. P.↗

On the accuracy of modelling the dynamics of large space structures

Proposed space missions will require large scale, light weight, space based structural systems. Large space structure technology (LSST) systems will have to accommodate (among others): ocean data systems; electronic mail systems; large multibeam antenna systems; and, space based solar power systems. The structures are to be delivered into orbit by the space shuttle. Because of their inherent size, modelling techniques and scaling algorithms must be developed so that system performance can be predicted accurately prior to launch and assembly. When the size and weight-to-area ratio of proposed LSST systems dictate that the entire system be considered flexible, there are two basic modeling methods which can be used. The first is a continuum approach, a mathematical formulation for predicting the motion of a general orbiting flexible body, in which elastic deformations are considered small compared with characteristic body dimensions. This approach is based on an a priori knowledge of the frequencies and shape functions of all modes included within the system model. Alternatively, finite element techniques can be used to model the entire structure as a system of lumped masses connected by a series of (restoring) springs and possibly dampers. In addition, a computational algorithm was developed to evaluate the coefficients of the various coupling terms in the equations of motion as applied to the finite element model of the Hoop/Column.

Diarra, C. M.↗

On the accuracy of modelling the dynamics of large space structures

Proposed space missions will require large scale, light weight, space based structural systems. Large space structure technology (LSST) systems will have to accommodate (among others): ocean data systems; electronic mail systems; large multibeam antenna systems; and, space based solar power systems. The structures are to be delivered into orbit by the Space Shuttle. Because of their inherent size, modelling techniques and scaling algorithms must be developed so that system performance can be predicted accurately prior to launch and assembly. When the size and weight-to-area ratio of proposed LSST systems dictate that the entire system be considered flexible, there are two basic modelling methods which can be used. The first is a continuum approach, a mathematical formulation for predicting the motion of a general orbiting flexible body, in which elastic deformations are considered small compared with characteristic body dimensions. This approach is based on an a priori knowledge of the frequencies and shape functions of all modes included within the system model. Alternatively, finite element techniques can be used to model the entire structure as a system of lumped masses connected by a series of (restoring) springs and possibly dampers. In addition, a computational algorithm was developed to evaluate the coefficients of the various coupling terms in the equations of motion as applied to the finite element model of the Hoop/Column.

Diarra, C. M.↗

Alternative majority-voting methods for real-time computing systems

Two techniques that provide a compromise between the high time overhead in maintaining synchronous voting and the difficulty of combining results in asynchronous voting are proposed. These techniques are specifically suited for real-time applications with a single-source/single-sink structure that need instantaneous error masking. They provide a compromise between a tightly synchronized system in which the synchronization overhead can be quite high, and an asynchronous system which lacks suitable algorithms for combining the output data. Both quorum-majority voting (QMV) and compare-majority voting (CMV) are most applicable to distributed real-time systems with single-source/single-sink tasks. All real-time systems eventually have to resolve their outputs into a single action at some stage. The development of the advanced information processing system (AIPS) and other similar systems serve to emphasize the importance of these techniques. Time bounds suggest that it is possible to reduce the overhead for quorum-majority voting to below that for synchronous voting. All the bounds assume that the computation phase is nonpreemptive and that there is no multitasking.

Shin, Kang G.↗

Determining state-space models from sequential output data

This talk focuses on the determination of state-space models for large space systems using only the output data. The output data could be generated by the unknown or deliberate initial conditions of the space structure in question. We shall review some relevant fundamental work on the state-space modeling of sequential output data that is potentially applicable to large space structures. If formulated in terms of some generalized Markov parameters, this approach is in some sense similar to, but much simpler than, the Juang-Pappa Eigensystem Realization Algorithm (ERA) and the Ho-Kalman construction procedure.

Lin, Jiguan Gene↗

Vector quantizer designs for joint compression and terrain categorization of multispectral imagery

Two vector quantizer designs for compression of multispectral imagery and their impact on terrain categorization performance are evaluated. The mean-squared error (MSE) and classification performance of the two quantizers are compared, and it is shown that a simple two-stage design minimizing MSE subject to a constraint on classification performance has a significantly better classification performance than a standard MSE-based tree-structured vector quantizer followed by maximum likelihood classification. This improvement in classification performance is obtained with minimal loss in MSE performance. The results show that it is advantageous to tailor compression algorithm designs to the required data exploitation tasks. Applications of joint compression/classification include compression for the archival or transmission of Landsat imagery that is later used for land utility surveys and/or radiometric analysis.

Gorman, John D.↗

STS-74/Mir Photogrammetric Appendage Structural Dynamics Experiment Preliminary Data Analysis

The Photogrammetric Appendage Structural Dynamics Experiment was designed, developed, and flown to demonstrate and prove measurement of the structural vibration response of a Russian Space Station Mir solar array using photogrammetric methods. The experiment flew on the STS-74 Space Shuttle mission to Mir in November 1995 and obtained video imagery of solar array structural response to various excitation events. The video imagery has been digitized and triangulated to obtain response time history data at discrete points on the solar array. This data has been further processed using the Eigensystem Realization Algorithm modal identification technique to determine the natural vibration frequencies, damping, and mode shapes of the solar array. The results demonstrate that photogrammetric measurement of articulating, non-optically targeted, flexible solar arrays and appendages is a viable, low-cost measurement option for the International Space Station.

Gilbert, Michael G.↗