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 757 records · Page 42

X-ray tomography of large objects with limited measurement angle

In this paper we present an efficient implementation of an algorithm for reconstructing a 3D volume from limited angle projection data, based on statistical inversion theory. We demonstrate the strength of the method for detecting structural defects in large composite aerospace components, whose dimensions prevent acquiring measurements over the full circle. In comparison with a number of other tomographic reconstruction methods that can be applied to the limited angle case, such as tomosynthesis or simultaneous algebraic reconstruction technique (SART), we achieve superior depth resolution with reduced noise and artifacts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗

Deformable complex network for refining low-resolution X-ray structures

A new refinement algorithm called the deformable complex network that combines a novel angular network-based restraint with a deformable elastic network model in the target function has been developed to aid in structural refinement in macromolecular X-ray crystallography. In macromolecular X-ray crystallography, building more accurate atomic models based on lower resolution experimental diffraction data remains a great challenge. Previous studies have used a deformable elastic network (DEN) model to aid in low-resolution structural refinement. In this study, the development of a new refinement algorithm called the deformable complex network (DCN) is reported that combines a novel angular network-based restraint with the DEN model in the target function. Testing of DCN on a wide range of low-resolution structures demonstrated that it constantly leads to significantly improved structural models as judged by multiple refinement criteria, thus representing a new effective refinement tool for low-resolution structural determination.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DES science portal: Computing photometric redshifts

We present the Dark Energy Survey (DES) Science Portal, an integratedweb-based data interface designed to facilitate scientific analysis. Wedemonstrate how the Portal can provide a reliable environment to accesscomplete data sets, provide validation algorithms and metrics in the case ofmultiple methods and training configurations, and maintain the provenancebetween the different steps of a complex calculation, while ensuringreproducibility of the results. We use the estimation of DES photometricredshifts (photo-$z$s) as an example. A significant challenge facingphotometric surveys for cosmological purposes, such as DES, is the need toproduce reliable redshift estimates. The choice between competing algorithmsand configurations and the maintenance of an up-to-date spectroscopic databaseto build training sets, for example, are complex tasks when dealing with largeamounts of data that are regularly updated and constantly growing. We show howthe DES Science Portal can be used to train and validate several photo-$z$algorithms using the DES first year (Y1A1) data. The photo-$z$s estimated inthe Portal are used to feed the creation of catalogs for scientific workflows.While the DES collaboration is still developing techniques to obtain precisephoto-$z$s, having a structured framework like the one presented here iscritical for the systematic vetting of DES algorithmic improvements and theconsistent production of photo-$z$s in future DES releases.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nucleotide Docking: Prediction of Reactant State Complexes for Ribonuclease Enzymes

Ribonuclease enzymes (RNases) play key roles in the maturation and metabolism of all RNA molecules. Computational simulations of the processes involved can help to elucidate the underlying enzymatic mechanism and is often employed in a synergistic approach together with biochemical experiments. Theoretical calculations require atomistic details regarding the starting geometries of the molecules involved, which, in the absence of crystallographic data, can only be achieved from computational docking studies. Fortunately, docking algorithms have improved tremendously in recent years, so that reliable structures of enzyme-ligand complexes can now be successfully obtained from computation. However, most docking programs are not particularly optimized for nucleotide docking. In order to assist our studies on the cleavage of RNA by the two most important ribonuclease enzymes, RNase A and RNase H, we evaluated four docking tools - MOE2009, Glide 5.5, QXP-Flo+0802, and Autodock 4.0 - for their ability to simulate complexes between these enzymes and RNA oligomers. To validate our results, we analyzed the docking results with respect to the known key interactions between the protein and the nucleotide. In addition, we compared the predicted complexes with X-ray structures of the mutated enzyme as well as with structures obtained from previous calculations. In this manner, we were able to prepare the desired reaction state complex so that it could be used as the starting structure for further DFT/B3LYP QM/MM reaction mechanism studies.

59 BASIC BIOLOGICAL SCIENCES↗

Experimental Nuclear Reaction Data Uncertainties: Basic Concepts and Documentation

This paper has been written to provide experimental nuclear data researchers and data compilers with practical guidance on dealing with experimental nuclear reaction data uncertainties. It outlines some of the properties of random variables as well as principles of data uncertainty estimation, and illustrates them by means of simple examples which are relevant to the field of nuclear data. Emphasis is placed on the importance of generating mathematical models (or algorithms) that can adequately represent individual experiments for the purpose of estimating uncertainties in their results. Several types of uncertainties typically encountered in nuclear data experiments are discussed. The requirements and procedures for reporting information on measurement uncertainties for neutron reaction data, so that they will be useful in practical applications, are addressed. Consideration is given to the challenges and opportunities offered by reports, conference proceedings, journal articles, and computer libraries as vehicles for reporting and documenting numerical experimental data. Finally, contemporary formats used to compile reported experimental covariance data in the widely used library EXFOR are discussed, and several samples of EXFOR files are presented to demonstrate their use.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An automated miniature robotic vehicle inspection system

A novel, autonomous reconfigurable robotic inspection system for quantitative NDE mapping is presented. The system consists of a fleet of wireless (802.11g) miniature robotic vehicles, each approximately 175 × 125 × 85 mm with magnetic wheels that enable them to inspect industrial structures such as storage tanks, chimneys and large diameter pipe work. The robots carry one of a number of payloads including a two channel MFL sensor, a 5 MHz dry coupled UT thickness wheel probe and a machine vision camera that images the surface. The system creates an NDE map of the structure overlaying results onto a 3D model in real time. The authors provide an overview of the robot design, data fusion algorithms (positioning and NDE) and visualization software.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the rejection-based algorithm for simulation and analysis of large-scale reaction networks

Stochastic simulation for in silico studies of large biochemical networks requires a great amount of computational time. We recently proposed a new exact simulation algorithm, called the rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)], to improve simulation performance by postponing and collapsing as much as possible the propensity updates. In this paper, we analyze the performance of this algorithm in detail, and improve it for simulating large-scale biochemical reaction networks. We also present a new algorithm, called simultaneous RSSA (SRSSA), which generates many independent trajectories simultaneously for the analysis of the biochemical behavior. SRSSA improves simulation performance by utilizing a single data structure across simulations to select reaction firings and forming trajectories. The memory requirement for building and storing the data structure is thus independent of the number of trajectories. The updating of the data structure when needed is performed collectively in a single operation across the simulations. The trajectories generated by SRSSA are exact and independent of each other by exploiting the rejection-based mechanism. We test our new improvement on real biological systems with a wide range of reaction networks to demonstrate its applicability and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A General Spatiotemporal Imputation Framework for Missing Sensor Data

Many applications from precision agriculture, environmental monitoring and transportation networks rely on data collected across space and time over a large geographic area. Missing data poses a significant challenge for any data-driven inference and control tasks. Data imputation or the estimation of missing data can help fill these gaps by utilizing inherent spatial relationships and temporal patterns. A variety of spatiotemporal imputation models have been developed to address missing data in spatiotemporal datasets. However, these classical methods rely on the assumption that the underlying data follows a smooth trend and fail to provide accurate estimates when there is a large number of missing points in the data. Even though there are machine learning driven tensor completion approaches such as convolutional neural network based tensor completion (CoSTCo) that capture the non-linear relationships in the dataset, the transductive nature makes the algorithm less scalable. Thus, existing approaches for estimating the missing information do not effectively capture all dimensions of the spatiotemporal data structure, resulting in erroneous predictions and poor performance. The main contributions of this paper are: (1) We propose a novel inductive framework (G-LSTM) for missing data imputation that integrates a graph neural network with LSTMs to effectively capture both spatial and temporal dependencies. (2) Experimental results on a traffic dataset demonstrate that the proposed GNN integrated with an LSTM framework achieves improved imputation and maintains steady performance even when there are extreme missing conditions in comparison with the state-of-the-art imputation framework (i.e, CoSTCo). (3) The simulation results on a traffic network show up to 69% reduction in mean absolute error and 61% reduction in root mean square error when compared to CoSTCo.

Tharzeen, Aabila↗

Fine Structure in 3C 120 and 3C 84

Seven epochs of very long baseline radio interferometric observations of the Seyfert galaxies 3C 120 and 3C 84, at 3.8-cm wave length using stations at Westford, Massachusetts, Goldstone, California, Green Bank, West Virginia, and Onsala, Sweden, have been analyzed for source structure. An algorithm for reconstructing the brightness distribution of a spatially confined source from fringe amplitude and so called closure phase data has been developed and successfully applied to artificially generated test data and to data on the above mentioned sources. Over the two year time period of observation, 3C 120 was observed to consist of a double source showing apparent super relativistic expansion and separation velocities. The total flux changes comprising one outburst can be attributed to one of these components. 3C 84 showed much slower changes, evidently involving flux density changes in individual stationary components rather than relative motion.

Hutton, L. K.↗

Using spatial logic in classification of Landsat TM data

A strategy for spatial/spectral classification of Landsat TM data is presented. The strategy is founded upon 'spatial logic', a logic that seeks to emulate important aspects of visual image interpretation. The carefully structured classification process begins with spectral stratification of the data into water, vegetated and non-vegetated pixels. A region growing algorithm is then used to define 'fields' of similar land cover composition. Fields are characterized by cover composition, size and neighborhood characteristics. A supervised iterative contextual classification algorithm is developed to assign final land use/land cover labels. Maps are generalized using a spatial post-processing technique. Positive, though preliminary, results are presented.

Merchant, J. W.↗

Measuring the topology of large-scale structure in the universe

An algorithm for quantitatively measuring the topology of large-scale structure has now been applied to a large number of observational data sets. The present paper summarizes and provides an overview of some of these observational results. On scales significantly larger than the correlation length, larger than about 1200 km/s, the cluster and galaxy data are fully consistent with a sponge-like random phase topology. At a smoothing length of about 600 km/s, however, the observed genus curves show a small shift in the direction of a meatball topology. Cold dark matter (CDM) models show similar shifts at these scales but not generally as large as those seen in the data. Bubble models, with voids completely surrounded on all sides by wall of galaxies, show shifts in the opposite direction. The CDM model is overall the most successful in explaining the data.

Gott, J. Richard, III↗

A survey on the structured singular value

The structured singular value, U, is an important linear algebra tool to study a class of matrix perturbation problems. It is useful for analyzing the robustness of stability and performance of uncertain, (nominally) linear systems. Computation of (M) is difficult, and usually, upper and lower bounds are all that can be reliably computed. Upper bounds give conservative estimates of the sizes of allowable perturbations. The maximum singular value of a matrix M is an upper bound for (M). As an upper bound, it can be improved by finding a transformations to the data (i.e. M) which do not change the structured singular value, but do reduce the maximum singular value. Typically, upper bound algorithms involve searches over sets of transformations to yield the tightest bound. Lower bound algorithms are intelligent searches for minimum-norm solutions to multivariable polynomial equations, and are based on various optimality conditions that hold at the global (and, unfortunately, some local) minima. The current methods to compute both of these types of bounds are reviewed. Theoretical justification and extensive numerical experience with the various algorithms are covered.

Packard, Andy↗

Numerical aspects of computing high Reynolds number flows on unstructured meshes

An edge-data structure describing a mesh edge-wise given the vertices of each edge and neighboring cell information is used developing algorithms for the Navier-Stokes equations on triangular meshes. Edge formulas for the Galerkin and finite-element discretization of gradient, divergence, Hessian, and Laplacian operators are derived. A simple edge formula is derived for the discretization of the Laplacian operator, where precise theoretical conditions for a discrete maximum principle can be ascertained. Practical issues associated with solving the Navier-Stokes equations on unstructured meshes are addressed, along with issues concerning the generation of highly stretched triangular meshes and the modeling of turbulence on unstructured meshes. A turbulence modeling strategy is proposed, and numerical results for a high-Reynolds-number flow about single- and multielement airfoils are discussed.

Barth, Timothy J.↗

Algorithms For Postprocessing Computed Flow Data

Paper discusses algorithms used to make visible displays from arrays of numerical data representing computed flow fields. Intended to help researchers discern flow structures. Displays include, principally, contours and particle traces on two-dimensional and three-dimensional grids.

Buning, Pieter↗

An inverse problem approach for structural damage detection - Finite element model refinement

In this work, a methodology for incorporating measured modal data into an existing refined finite element model is examined with the objective of detecting and locating structural damage. This same algorithm is also useful in terms of finite element model refinement. The algorithm is based on the partial inverse problem, in that only partial spectral information is required. The technique utilizes a symmetric eigenstructure assignment algorithm to perform the partial spectral assignment. Algorithms to enhance mode shape assignability and to preserve sparsity in the updated model are developed. The sparsity preservation is of particular importance when considering damage detection in truss-like structures. Several examples are presented which highlight the key points made within the paper.

Zimmerman, D. C.↗

Measurement of Atmospheric Composition from Geostationary Platforms

Satellite instruments flown since 1970 have had great success in elucidating the processes that control stratospheric ozone. In contrast, space-based data for tropospheric constituents that affect air quality and climate have only recently become available. While these datasets highlight the rapidly advancing capabilities of spacebased tropospheric sensors, they are also pointing to the limitations of sun-synchronous, low-earth orbiting (SSO/LEO) satellite platforms for making such measurements. In our talk we will highlight the science requirements for new missions and the technological and algorithmic approaches that we are developing to meet these requirements. From these studies a clear need for advanced atmospheric composition sensors has emerged that can be put on geostationary (GEO) platforms to provide 5 km horizontal resolution with 15-60 minutes repeat cycle. Such measurements have been high priority in the recently released Decadal Survey report by the US National Research Council. The need for GEO is driven not only by the science requirements to track rapidly changing pollution events but also by the need to provide altitude-resolved information about tropospheric constituents. Currently, with the exception of aerosols, it is not possible to derive profile information about lower tropospheric constituents from satellite measurements. New algorithmic approaches are being developed to obtain this information by combining UV and IR data, by monitoring the spatial and temporal structures of the constituents, and by using low-level clouds to separate boundary layer constituents from free troposphere. All these approaches require better spatial and temporal resolution than that provided by LEO sensors.

Bhartia, P. K.↗

Experiments on Evolving Software Models of Analog Circuits

Analog circuits are of great importance in electronic system design since the world is fundamentally analog in nature. While the amount of digital design activity far outpaces that of analog design, most digital systems require analog modules for interfacing with the external world. It was recently estimated that approximately 60% of digital application- specific integrated circuit designs incorporated analog circuits. With challenging analog circuit design problems and few analog design engineers, there are economic reasons for automating the analog design process, especially time-to-market considerations. Techniques for analog circuit design automation began appearing about two decades ago. These methods incorporated heuristics [6], knowledge bases [1], simulated annealing [5], and other algorithms. Efforts using techniques from evolutionary computation began appearing over the last few years. These include the use of genetic algorithms to select electronic component values (for example, the resistance value of a resistor), to select circuit topologies, and to design amplifiers using a limited set of canned topologies [4]. A genetic programming-based analog circuit design system has been demonstrated in which the circuit sizes, component values, and the circuit topologies are determined automatically [3]. The genetic-algorithm systems typically represent circuit structures as vectors of parameters encoded in binary strings, while the genetic programming system manipulates tree data structures.

Lohn, Jason D.↗