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,081 records · Page 60

Vehicle energy consumption estimation using large scale simulations and machine learning methods

Vehicle energy consumption and powertrain operations for future vehicle powertrain technologies are predicted through full-vehicle simulations using Autonomie, a simulation tool developed at Argonne National Laboratory. Over 1 million vehicles, with different powertrain types (conventional and numerous electrified powertrains) and component technologies (advanced engines, batteries, electrical machines, light weighting) are simulated for outputs including vehicle fuel economy and cost. Despite the ability of Autonomic to predict fuel economy given various combination of vehicle inputs, the full-vehicle simulation is very time-consuming. It takes approximately 84 h to simulate for 33,060 vehicles even using distributed computing on a cluster of 128 worker nodes. Moreover, Autonomic is unable to populate a continuous output space through simulation since it only yields outputs with discrete values instead of an input-output relation. This paper proposes a novel large-scale learning and prediction process (LSLPP) via machine learning approaches to answer the need for a continuous space of vehicle fuel economy and a more efficient simulation process. By learning in a supervised fashion to discover structures in data, the machine learning approaches seek to train a model that can explain the data with which we can perform prediction over unseen data. As such, we are able to accomplish analytic continuation on the current discrete space of simulation results. In addition, we present a random sampling -based numerosity reduction algorithm incorporated in LSLPP that reduces simulation runs and improves efficiency of data procurement. We analytically derive a theoretical bound in order to guarantee the effectiveness of our algorithm. We also compare random sampling to stratified sampling and suggest sampling strategies. A user-friendly tool is developed to support the process. Our experimental results confirm that the proposed LSLPP is able to greatly accelerate prediction and analysis of vehicle fuel economy. The output of this study is used by the US government to evaluate the impact of its R&D funding on energy security and CO 2 emission as well as for the setting of Corporate Average Fuel Economy (CAFE) standards.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗

A dynamic model for social networks

Social network graph models are data structures representing entities (often people, corporations, or accounts) as "vertices" and their interactions as "edges" between pairs of vertices. These graphs are most often total-graph models — the overall structure of edges and vertices in a bidirectional or directional graph are described in global terms and the network is generated algorithmically. We are interested in "egocentrie or "agent-based" models of social networks where the behavior of the individual participants are described and the graph itself is an emergent phenomenon. Our hope is that such graph models will allow us to ultimately reason from observations back to estimated properties of the individuals and populations, and result in not only more accurate algorithms for link prediction and friend recommendation, but also a more intuitive understanding of human behavior in such systems than is revealed by previous approaches. This report documents our preliminary work in this area; we describe several past graph models, two egocentric models of our own design, and our thoughts about the future direction of this research.

97 MATHEMATICS AND COMPUTING↗

HyMARC Seedling: Optimized Hydrogen Adsorbents via Machine Learning and Crystal Engineering

This final report is presented in two parts: In Part 1, the H 2 capacities of a diverse set of 918,734 metal-organic frameworks (MOFs) sourced from 19 databases is predicted via machine learning (ML). Using only 7 structural features as input, ML identifies 8,282 MOFs with the potential to exceed the capacities of state-of-the-art materials. The identified MOFs are predominantly hypothetical compounds having low densities (<0.31 g/cm3) in combination with high surface areas (>5,300 m2/g), void fractions ($0.90), and pore volumes (>3.3 cm3/g). The relative importance of the input features are characterized, and dependencies on the ML algorithm and training set size are quantified. The most important features for predicting H 2 uptake are pore volume (for gravimetric capacity) and void fraction (for volumetric capacity). The ML models are available on the web, allowing for rapid and accurate predictions of the hydrogen capacities of MOFs from limited structural data; the simplest models require only a single crystallographic feature. In part 2, ways to improve the poor powder packing density of MOFs is discussed. More specifically, a strategy that improves packing efficiency and volumetric hydrogen gas storage density dramatically through engineered morphologies and controlled-crystal size distributions is presented that holds promise for maximizing storage capacity for a given MOF. The packing density improvement, demonstrated for the benchmark sorbent MOF-5, leads to a significant enhancement of volumetric hydrogen storage performance relative to commercial MOF-5. System model projections demonstrate that engineering of crystal morphology/size or use of a bimodal distribution of cubic crystal sizes in tandem with system optimization can surpass the 25 g/L volumetric capacity of a typical 700 bar compressed storage system and exceed the DOE targets 2020 volumetric capacity (30 g/L). Finally, a critical link between improved powder packing density and reduced damage upon compaction is revealed leading to sorbents with both high surface area and high density.

08 HYDROGEN↗

ARM SGP PBLH and MLH datasets from Raman lidar and Doppler lidar

The planetary boundary layer (PBL) plays a critical role in the atmosphere by transferring heat, moisture, and momentum. The warm PBL has a distinct diurnal cycle including the daytime convective mixing layer (ML) and nighttime residual layer developments. Thus, simultaneous determinations of PBL height (PBLH) and ML height (MLH) are necessary for studying PBL characterization and processes. Here, new approaches are developed to provide reliable PBLH and MLH estimates to characterize warm PBL evolution. The approaches use Raman lidar (RL) water vapor mixing ratio (WVMR) and Doppler lidar (DL) vertical velocity measurements at the Southern Great Plains (SGP) atmospheric observatory, which was established by the Atmospheric Radiation Measurement (ARM) User Facility. Compared to widely used lidar aerosol measurements for PBLH, WVMR is a better tracer for PBL vertical mixing. For PBLH, the approach classifies PBL water vapor structures into a few general patterns, then uses a slope method and dynamic threshold method to determine PBLH. For MLH, wavelet analysis is used to reconstruct 2D variance from DL vertical wind velocity measurements according to the turbulence eddy size to minimize the impacts of gravity wave and eddy size on variance calculations; then, a dynamic threshold method is used to determine MLH. Remotely-sensed PBLHs and MLHs are compared with radiosonde measurements based on the Richardson number method. Good agreements between them confirm that the proposed new algorithms are reliable for PBLH and MLH characterization. The algorithms are applied to warm-season RL and ML measurements at the SGP site for five years to study warm-season PBL structure and processes. The weekly composited diurnal evolutions of PBLHs and MLHs in a warm climate were provided to illustrate diurnal and seasonal PBL evolutions. This reliable data set of PBLH and MLH values will be valuable for studying PBL processes, model evolution, and PBL parameterization improvements. The MLH dataset includes the MLH in values of km above ground level. The PBLH dataset includes the PBLH in values of km above ground level, along with a flag ("situation_PBLH") to determine the state of the PBL (1 = Cloudy Condition, 2 = Stable Layer, 3 = Multi-layer WVMR structure, 4 = Well-Mixed PBL, 5 = A de-coupled layer, 6 = Other).

mixing layer height↗

High fidelity ultrasound imaging of concrete structures

As plans are made to extend licenses for the aging fleet of commercial nuclear power plants for periods of sixty years and beyond, research into the long-term integrity of their concrete structures has increased. Ultrasound tomography is a useful tool for nondestructive evaluation of these concrete structures. Typically, pulse-echo measurements are made over a large surface and are processed using a reconstruction algorithm, producing a 3D image of the structure that highlights embedded defects. These measurements are processed using a delay-and-sum algorithm such as the synthetic aperture focusing technique (SAFT). Oak Ridge National Laboratory is developing novel ultrasound model-based image reconstruction (U-MBIR) algorithms to improve the imaging capability of pulse-echo ultrasound array imagers. U-MBIR is an inversion technique that reconstructs the sample under test from the ultrasound measurements by formulating and solving a mathematical optimization problem using two sets of terms: one set ensures that the reconstruction matches measured data based on a model for the physics of beam propagation with the noise in the detector, and another set ensures that the reconstruction has certain properties based on a model for the object being scanned. This paper compares three techniques: SAFT, frequency-banded SAFT (FB-SAFT), and U-MBIR. The U-MBIR method produces higher quality images of the underlying concrete structures compared to the images produced using SAFT and FB-SAFT from the same set of measurements. This paper also illustrates the detection of various defects with higher confidence due to the lower noise and artifact-free U-MBIR images.

Ezell, N Dianne↗

Damage imaging using Lamb waves for SHM applications

2-D ultrasonic arrays, due to their beam-steering capability and all azimuth angle coverage are a very promising tool for the inspection of plate-like structures using Lamb waves (LW). Contrary to the classical linear phased arrays (PAs) the 2D arrays enable unequivocal defect localization and they are even capable of mode selectivity of the received LWs . Recently, it has been shown that multistatic synthetic focusing (SF) algorithms applied for 2D arrays are much more effective than the classical phase array mode commonly used in NDT. The multistatic SF assumes multiple transmissions of elements in a transmitting aperture and off-line processing of the data acquired by a receiving aperture. In the simplest implementation of the technique, only a single multiplexed input and a number of output channels are required, which results in significant hardware simplification compared with the PA systems. On the one hand implementation of the multistatic SF to 2D arrays creates additional degrees of freedom during the design of the array topology, which complicates the array design process. On the other hand, it enables designing sparse arrays with performance similar to that of the fully populated dense arrays. In this paper we present a general systematic approach to the design and optimization of imaging systems based on the 2D array operating in the multistatic mode. We start from presenting principles of the SF schemes applied to LW imaging. Then, we outline the coarray concept and demonstrate how it can be used for reducing number of elements of the 2D arrays. Finally, efficient tools for the investigation and experimental verification of the designed 2D array prototypes are presented. The first step in the investigation is theoretical evaluation performed using frequency-dependent structure transfer function (STF), which enables approximate simulation of an array excited with a tone-burst in a dispersive medium. Finally, we show how scanning laser vibrometer, sensing waves in multiple points corresponding to the locations of the 2D receiving array elements, can be used as a tool for rapid experimental verification of the developed topologies. The presented methods are discussed in terms of the beampatterns and sparse versions of the fully populated array topologies are be presented. The effect of apodization applied to the array elements is also investigated. Both simulated and experimental results are included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The interatomic vector's method, algorithms, and programs for the solution of atomic structure of nanoclusters in crystal

A calculation technique and corresponding algorithms have been developed using the formalism of Fourier transform of finite functions. A software package for obtaining distributions of cluster interatomic vectors from diffuse X-ray scattering has been written and debugged. The programs were checked on a 30-atom cluster [CdTb{sub 3}F{sub 26}]. The attempts to obtain experimental data on a single crystal with nanoclusters using an Xcalibur S diffractometer (Oxford Diffraction) with a coordinate CCD detector were no success. The standard diffractometer software contains errors that lead to incorrect results upon the reconstruction of the distribution of diffuse scattering from different runs. These errors are of little importance when Bragg peaks are processed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise-resolution tradeoffs in x-ray CT imaging: A comparison of penalized alternating minimization and filtered backprojection algorithms

Purpose: In comparison with conventional filtered backprojection (FBP) algorithms for x-ray computed tomography (CT) image reconstruction, statistical algorithms directly incorporate the random nature of the data and do not assume CT data are linear, noiseless functions of the attenuation line integral. Thus, it has been hypothesized that statistical image reconstruction may support a more favorable tradeoff than FBP between image noise and spatial resolution in dose-limited applications. The purpose of this study is to evaluate the noise-resolution tradeoff for the alternating minimization (AM) algorithm regularized using a nonquadratic penalty function. Methods: Idealized monoenergetic CT projection data with Poisson noise were simulated for two phantoms with inserts of varying contrast (7%-238%) and distance from the field-of-view (FOV) center (2-6.5 cm). Images were reconstructed for the simulated projection data by the FBP algorithm and two penalty function parameter values of the penalized AM algorithm. Each algorithm was run with a range of smoothing strengths to allow quantification of the noise-resolution tradeoff curve. Image noise is quantified as the standard deviation in the water background around each contrast insert. Modulation transfer functions (MTFs) were calculated from six-parameter model fits to oversampled edge-spread functions defined by the circular contrast-insert edges as a metric of local resolution. The integral of the MTF up to 0.5 lp/mm was adopted as a single-parameter measure of local spatial resolution. Results: The penalized AM algorithm noise-resolution tradeoff curve was always more favorable than that of the FBP algorithm. While resolution and noise are found to vary as a function of distance from the FOV center differently for the two algorithms, the ratio of noises when matching the resolution metric is relatively uniform over the image. The ratio of AM-to-FBP image variances, a predictor of dose-reduction potential, was strongly dependent on the shape of the AM's nonquadratic penalty function and was also strongly influenced by the contrast of the insert for which resolution is quantified. Dose-reduction potential, reported here as the fraction (%) of FBP dose necessary for AM to reconstruct an image with comparable noise and resolution, for one penalty parameter value of the AM algorithm was found to vary from 70% to 50% for low-contrast and high-contrast structures, respectively, and from 70% to 10% for the second AM penalty parameter value. However, the second penalty, AM-700, was found to suffer from poor low-contrast resolution when matching the high-contrast resolution metric with FBP. Conclusions: The results of this simulation study imply that penalized AM has the potential to reconstruct images with similar noise and resolution using a fraction (10%-70%) of the FBP dose. However, this dose-reduction potential depends strongly on the AM penalty parameter and the contrast magnitude of the structures of interest. In addition, the authors' results imply that the advantage of AM can be maximized by optimizing the nonquadratic penalty function to the specific imaging task of interest. Future work will extend the methods used here to quantify noise and resolution in images reconstructed from real CT data.

60 APPLIED LIFE SCIENCES↗

Effects of sparse sampling schemes on image quality in low-dose CT

Purpose: Various scanning methods and image reconstruction algorithms are actively investigated for low-dose computed tomography (CT) that can potentially reduce a health-risk related to radiation dose. Particularly, compressive-sensing (CS) based algorithms have been successfully developed for reconstructing images from sparsely sampled data. Although these algorithms have shown promises in low-dose CT, it has not been studied how sparse sampling schemes affect image quality in CS-based image reconstruction. In this work, the authors present several sparse-sampling schemes for low-dose CT, quantitatively analyze their data property, and compare effects of the sampling schemes on the image quality.Methods: Data properties of several sampling schemes are analyzed with respect to the CS-based image reconstruction using two measures: sampling density and data incoherence. The authors present five different sparse sampling schemes, and simulated those schemes to achieve a targeted dose reduction. Dose reduction factors of about 75% and 87.5%, compared to a conventional scan, were tested. A fully sampled circular cone-beam CT data set was used as a reference, and sparse sampling has been realized numerically based on the CBCT data.Results: It is found that both sampling density and data incoherence affect the image quality in the CS-based reconstruction. Among the sampling schemes the authors investigated, the sparse-view, many-view undersampling (MVUS)-fine, and MVUS-moving cases have shown promising results. These sampling schemes produced images with similar image quality compared to the reference image and their structure similarity index values were higher than 0.92 in the mouse head scan with 75% dose reduction.Conclusions: The authors found that in CS-based image reconstructions both sampling density and data incoherence affect the image quality, and suggest that a sampling scheme should be devised and optimized by use of these indicators. With this strategic approach, one can acquire optimally sampled sparse data so that the CS-based algorithms can best perform in terms of image quality.

61 RADIATION PROTECTION AND DOSIMETRY↗

Impact of Domain Knowledge on the Property Prediction of Specialized Machine Learning Models

Developing transferable machine learning models is trending in data-driven materials research. However, how to apply such models to a specific research domain remains unclear. Here, in this work, we choose high-entropy materials as a platform with a specialized data set containing 145,323 DFT-relaxed materials. This data set is used to explore the role of domain-specific knowledge in training effective models. Our tests with three representative graph neural network architectures indicate the model complexity has much smaller influence on performance than the data itself. Specifically, the consideration of low-energy atomic ordering, structures with diverse elemental coverage, and high-order interactions significantly influences the model performance. We also find that domain knowledge-driven sampling can greatly enhance unsupervised learning techniques. This research highlights that developing specialized data sets is more beneficial than further complicating deep learning architectures. Additionally, physics-inspired sampling algorithms are crucially needed for better machine learning models for a specific materials research domain.

36 MATERIALS SCIENCE↗

A Dataset of 3D Structural and Simulated Transport Properties of Complex Porous Media

Physical processes that occur within porous materials have wide-ranging applications including - but not limited to - carbon sequestration, battery technology, membranes, oil and gas, geothermal energy, nuclear waste disposal, water resource management. The equations that describe these physical processes have been studied extensively; however, approximating them numerically requires immense computational resources due to the complex behavior that arises from the geometrically-intricate solid boundary conditions in porous materials. Here, we introduce a new dataset of unprecedented scale and breadth, DRP-372: a catalog of 3D geometries, simulation results, and structural properties of samples hosted on the Digital Rocks Portal. The dataset includes 1736 flow and electrical simulation results on 217 samples, which required more than 500 core years of computation. This data can be used for many purposes, such as constructing empirical models, validating new simulation codes, and developing machine learning algorithms that closely match the extensive purely-physical simulation. This article offers a detailed description of the contents of the dataset including the data collection, simulation schemes, and data validation.

3D images↗

Adversarial Binaries: AI-guided Instrumentation Methods for Malware Detection Evasion

Adversarial binaries are executable files that have been altered without loss of function by an AI agent in order to deceive malware detection systems. Progress in this emergent vein of research has been constrained by the complex and rigid structure of executable files. Although prior work has demonstrated that these binaries deceive a variety of malware classification models which rely on disparate feature sets, a consensus as to the best approach has not been reached, either in terms of the optimization algorithms or the instrumentation methods. Furthermore, although inconsistencies in the data sets, target classifiers, and functionality verification methods make head-to-head comparisons difficult, here we extract lessons learned and make recommendations for future research.

malware obfuscation↗

Review of Graph Databases for Big Data Dynamic Entity Scoring

Modeling data as a graph enables users to quickly analyze networked phenomenon, such as social network-based marketing data (e.g., linking entities in social media based on their friends and their "likes", their friend-of-a-friend's "likes", etc.) and scientific data, such as in biology to assess a gene's proximity in a graph to particular disease phenotype. Numerous purpose-built graph databases (DBs) called “NoSQL” or “Not Only SQL” DBs are emerging to support this type of graph analysis. These DBs differ from traditional relational DBs in that they are optimized to improve storage and query performance across large, complex graphs. This document reviews the state of the art in graph DBs and identifies potential DBs that show promise for dynamic entity-scoring algorithms. Dynamic entity scoring is a new area of research that allows analysis of data within graphs using undirected methods to weigh the edges of the graph based on the proximity or ambient influence of near-by nodes. The EntityScore (eScore) methodology developed at Lawrence Livermore National Laboratory (LLNL) is one application of these emerging graph-analysis algorithms to help analysts identify and prioritize entities, based on complex, analyst-defined weighting criteria. Our review examines a wide range of different, well-known graph DBs in use since at least 2010 and identifies unique advantages and disadvantages that may impact eScore-specific requirements. Specifically, we review data structures employed, query features employed, load times, query calculation times, memory usage and several other important attributes reported in the literature. We limited our considerations for eScore to Blueprints-compliant graph DBs (https://github.com/tinkerpop/blueprints/) because they provide a standard, java application programming interface (API) based on the property graph model.

42 ENGINEERING↗

Validation of LOCA2 and STAR-ESDM Statistically Downscaled Products

The National Climate Assessment (NCA) is the preeminent national report examining current and future risks posed by climate change. Countless agencies, policymakers, stakeholders and other end-users rely upon guidance from the NCA to plan for an uncertain future. These groups all depend on modern curated data, provided alongside the NCA, to quantify the impact of climate change on metrics of relevance for their decision processes. In its fifth iteration (NCA5), two statistically downscaled ensemble products, each providing data at grid spacing of approximately 5km over the contiguous United States, were selected to accompany the report. These include LOCalized Analogs version 2 (LOCA2) and Seasonal Trends and Analysis of Residuals Empirical-Statistical Downscaling Model (STAR-ESDM). Both data products are produced through a process known as statistical downscaling, where relatively coarse Global Climate Model (GCM) data is refined to locally relevant scales through the application of scientifically-supported empirical and algorithmic relationships. In support of the NCA effort, this report provides an independent validation of these two products against historical observations, with a focus on precipitation and near-surface temperature variables. Based on the results of this validation, several recommendations are provided related to the use of these data products. The structure of this report is as follows: In section 2, we review three gridded observational products that are used as part of our intercomparison. In section 3, we describe the two statistical downscaling techniques and their corresponding datasets that are the focus of this study. In section 4, the methodology we employ for validation is described. Section 5 provides results of the validation, which in turn motivate our recommendations on the use of these data products. A brief summary is provided in section 6.

54 ENVIRONMENTAL SCIENCES↗

Data Structure Alchemy

In an increasingly more data-driven world, the project set out to uncover the first principles of data-structure design, chart the immense design space they form, and build automation that can synthesize an optimal structure, or even a whole storage engine, for any given workload, hardware platform, and cost target. Data structures are at the center of every computational system and are directly responsible for its performance. Two core technical thrusts were defined: 1) Mapping design spaces for key data-centric abstractions (filters, hash functions, storage-engine layouts, neural-network topologies, blockchain protocols, image layouts, etc.). 2) Developing search & synthesis algorithms, initially analytical cost models, later neural-guided bi-level optimisers that navigate sextillions of candidate designs in seconds and materialise the best one as ready‐to-run code. This report distills the key insights, accomplishments, and impact.

97 MATHEMATICS AND COMPUTING↗