SEARCH · Engineering Papers
Results for “sampling algorithm”
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.
The Kalai-Smorodinsky solution for many-objective Bayesian optimization
An ongoing aim of research in multiobjective Bayesian optimization is to extend its applicability to a large number of objectives. While coping with a limited budget of evaluations, recovering the set of optimal compromise solutions generally requires numerous observations and is less interpretable since this set tends to grow larger with the number of objectives. We thus propose to focus on a specific solution originating from game theory, the Kalai-Smorodinsky solution, which possesses attractive properties. In particular, it ensures equal marginal gains over all objectives. We further make it insensitive to a monotonic transformation of the objectives by considering the objectives in the copula space. A novel tailored algorithm is proposed to search for the solution, in the form of a Bayesian optimization algorithm: sequential sampling decisions are made based on acquisition functions that derive from an instrumental Gaussian process prior. Our approach is tested on four problems with respectively four, six, eight, and nine objectives. The method is available in the R package GPGame available on CRAN at https://cran.r-project.org/package=GPGame.
Machine Learning for Advanced Building Construction: Preprint
High-efficiency retrofits can play a key role in reducing carbon emissions associated with buildings if processes can be scaled-up to reduce cost, time, and disruption. Here we demonstrate an artificial intelligence/computer vision (AI/CV)- enabled framework for converting exterior build scans and dimensional data directly into manufacturing and installation specifications for overclad panels. In our workflow point clouds associated with LiDAR-scanned buildings are segmented into a facade feature space, vectorized features are extracted using an iterative random-sampling consensus algorithm, and from this representation an optimal panel design plan satisfying manufacturing constraints is generated. This system and the corresponding construction process is demonstrated on a test facade structure constructed at the National Renewable Energy Laboratory (NREL). We also include a brief summary of a techno-economic study designed to estimate the potential energy and cost impact of this new system.
Machine Learning for Advanced Building Construction
High-efficiency retrofits can play a key role in reducing carbon emissions associated with buildings if processes can be scaled-up to reduce cost, time, and disruption. Here we demonstrate an artificial intelligence/computer vision (AI/CV)-enabled framework for converting exterior build scans and dimensional data directly into manufacturing and installation specifications for overclad panels. In our workflow point clouds associated with LiDAR-scanned buildings are segmented into a facade feature space, vectorized features are extracted using an iterative random-sampling consensus algorithm, and from this representation an optimal panel design plan satisfying manufacturing constraints is generated. This system and the corresponding construction process is demonstrated on a test facade structure constructed at the National Renewable Energy Laboratory (NREL). We also include a brief summary of a techno-economic study designed to estimate the potential energy and cost impact of this new system.
R and DE Robotic Sensor Intern Team: Sensor Suite Software and User Interface
The sensor tree developed for the H-Canyon tunnel inspection project produces a large quantity of camera and Lidar data. A postprocessing pipeline was created to facilitate the analysis of these data. The pipeline follows the following routine: 1) Registration - Salient local features in subsequent scans are identified and used to align the scans with one another. This allows production of a single cohesive map of the tunnel. 2) Sensor Fusion - RGB camera data is 'painted' onto the depth data created by the Lidar. 3) Segmentation - Individual surfaces from within the scene are segmented out separately for individual analysis. 4) Degradation Analysis - Automatic mapping of local deviation from the plane in position or surface normal is performed, as is detection of exposed rebar using Lidar return intensity. 5) Obstacle Detection - Lidar data is also used in real time to detect obstacles in the environment. This could give feedback to the operator to successfully drive in the tunnel. 6) Graphic User Interface - a custom GUI was created to facilitate customer use of the system. The system provides real-time feedback from both the cameras and Lidar. During alignment, local features are used to recognize points within the walls that are especially unique and noticeable (salient) based on their deviation from the expected surface of the wall. These are used as landmarks to register the clouds, which also informs precise localization of the base at each scan point. After registration, clouds are 'painted' with RGB data from the spherical cameras, as shown below. The painted clouds provide a 3D, colorized model of the environment which improves the realism of the experience for the user. Painting also labels high-resolution color imagery from the 3D cameras with depth values. Following sensor fusion, individual walls and cylindrical duct surfaces are segmented from the scene for individual analysis using a Random Sample Consensus algorithm. This algorithm allows segmentation of planar walls and cylindrical ducts. Once individual walls are identified, each point within the wall can be compared to its neighbors and the wall overall in order to detect local areas with damaged concrete. Automatic rebar detection is also performed using the contrast in Lidar return intensity between iron and concrete. The Lidar point-cloud data is also used for obstacle detection. As the Lidar spins, various algorithms are run to analyze the current 'slice' and obstacles in the environment are determined and registered on a cost-map. A Graphical User Interface (GUI) was developed to allow the user to easily command the crawler to set the rotational speed of the Lidar, perform a scan, and register and save the 3D generated cloud after a scan is done. For the good of the crawler, a critical aspect of the GUI design is to allow the user to cancel a scan any time after it is commanded and before it is saved.
𝑁-dimensional maximum-entropy tomography via particle sampling
We propose a modified maximum-entropy (MENT) algorithm for six-dimensional phase space tomography. The algorithm uses particle sampling and low-dimensional density estimation to approximate large sets of high-dimensional integrals in the original MENT formulation. We implement this approach using Markov Chain Monte Carlo (MCMC) sampling techniques and demonstrate convergence of six-dimensional MENT on both synthetic and measured data.
Adaptive Data-Driven Deep-Learning Surrogate Model for Frontal Polymerization in Dicyclopentadiene
Frontal polymerization (FP) is a self-sustaining curing process that enables rapid and energy-efficient manufacturing of thermoset polymers and composites. Computational methods conventionally used to simulate the FP process are time-consuming, and repeating simulations are required for sensitivity analysis, uncertainty quantification, or optimization of the manufacturing process. Here, in this work, we develop an adaptive surrogate deep-learning model for FP of dicyclopentadiene (DCPD), which predicts the evolution of temperature and degree of cure orders of magnitude faster than the finite-element method (FEM). The adaptive algorithm provides a strategy to select training samples efficiently and save computational costs by reducing the redundancy of FEM-based training samples. The adaptive algorithm calculates the residual error of the FP governing equations using automatic differentiation of the deep neural network. A probability density function expressed in terms of the residual error is used to select training samples from the Sobol sequence space. The temperature and degree of cure evolution of each training sample are obtained by a 2D FEM simulation. The adaptive method is more efficient and has a better prediction accuracy than the random sampling method. With the well-trained surrogate neural network, the FP characteristics (front speed, shape, and temperature) can be extracted quickly from the predicted temperature and degree-of-cure fields.
Identifying Important Ions and Positions in Mass Spectrometry Imaging Data Using CUR Matrix Decompositions
Mass spectrometry imaging enables label-free, high-resolution spatial mapping of the chemical composition of complex, biological samples. Typical experiments require selecting ions and/or positions from the images: ions for fragmentation studies to identify keystone compounds and positions for follow up validation measurements using microdissection or other orthogonal techniques. Unfortunately, with modern imaging machines, these must be selected from an overwhelming amount of raw data. Existing techniques to reduce the volume of data, the most popular of which are principle component analysis and non-negative matrix factorization, have the disadvantage that they return difficult-to-interpret linear combinations of actual data elements. In this work, we show that CX and CUR matrix decompositions can be used directly to address this selection need. CX and CUR matrix decompositions use empirical statistical leverage scores of the input data to provide provably good low-rank approximations of the measured data that are expressed in terms of actual ions and actual positions, as opposed to difficult-to-interpret eigenions and eigenpositions. We show that this leads to effective prioritization of information for both ions and positions. In particular, important ions can be found either by using the leverage scores as a ranking function and using a deterministic greedy selection algorithm or by using the leverage scores as an importance sampling distribution and using a random sampling algorithm; however, selection of important positions from the original matrix performed significantly better when they were chosen with the random sampling algorithm. Also, we show that 20 ions or 40 locations can be used to reconstruct the original matrix to a tolerance of 17% error for a widely studied image of brain lipids; and we provide a scalable implementation of this method that is applicable for analysis of the raw data where there are often more than a million rows and/or columns, which is larger than SVD-based low-rank approximation methods can handle. Lastly, these results introduce the concept of CX/CUR matrix factorizations to mass spectrometry imaging, describing their utility and illustrating principled algorithmic approaches to deal with the overwhelming amount of data generated by modern mass spectrometry imaging.
A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment
This paper presents a new variant of periodic vehicle routing problem in which the reaching time to the customers affects market share. Thus, there is a competition between distributors to achieve more market share by reaching the customers earlier than others; moreover, travel time between each two pairs of customers is uncertain. This situation is called an uncertain competitive environment. For the given problem, a new bi-objective mathematical model including minimization of total traveled time and maximization of the market share is presented. In order to solve this model, a multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied; and to evaluate the algorithm performance, some samples are generated; and the results of algorithms are compared based on some comparison metrics. The results demonstrate that the proposed LMOPSO algorithm leads to a better performance compared to the MOPSO in most comparison metrics.
Curiosity driven exploration to optimize structure–property learning in microscopy
Rapidly determining structure–property correlations in materials is an important challenge in better understanding fundamental mechanisms and greatly assists in materials design. In microscopy, imaging data provides a direct measurement of the local structure, while spectroscopic measurements provide relevant functional property information. Deep kernel active learning approaches have been utilized to rapidly map local structure to functional properties in microscopy experiments, but are computationally expensive for multi-dimensional and correlated output spaces. Here, we present an alternative lightweight curiosity algorithm which actively samples regions with unexplored structure–property relations, utilizing a deep-learning based surrogate model for error prediction. We show that the algorithm outperforms random sampling for predicting properties from structures, and provides a convenient tool for efficient mapping of structure–property relationships in materials science.
A comb-sampling method for enhanced mass analysis in linear electrostatic ion traps
In this paper an algorithm for extracting spectral information from signals containing a series of narrow periodic impulses is presented. Such signals can typically be acquired by pickup detectors from the image-charge of ion bunches oscillating in a linear electrostatic ion trap, where frequency analysis provides a scheme for high-resolution mass spectrometry. To provide an improved technique for such frequency analysis, we introduce the CHIMERA algorithm (Comb-sampling for High-resolution IMpulse-train frequency ExtRAaction). This algorithm utilizes a comb function to generate frequency coefficients, rather than using sinusoids via a Fourier transform, since the comb provides a superior match to the data. This new technique is developed theoretically, applied to synthetic data, and then used to perform high resolution mass spectrometry on real data from an ion trap. If the ions are generated at a localized point in time and space, and the data is simultaneously acquired with multiple pickup rings, the method is shown to be a significant improvement on Fourier analysis. The mass spectra generated typically have an order of magnitude higher resolution compared with that obtained from fundamental Fourier frequencies, and are absent of large contributions from harmonic frequency components.
Advanced trust region optimization strategies for glass box / black box models
We present an improved trust region filter (TRF) method for optimization of combined glass box/black box systems. Glass box systems refer to models that are easily expressed in an algebraic modeling language, providing cheap and accurate derivative information. By contrast, black box systems may be computationally expensive and derivatives are unavailable. The TRF method, as first introduced in our previous work (Eason and Biegler, AIChE J . 2016; 62:3124–3136), is able to handle hybrid systems containing both glass and black box components, which can frequently arise in chemical engineering, for example, when a multiphase reactor model is included in a flow sheet optimization problem. We discuss several recent modifications in the algorithm such as the sampling region, which maintains the algorithm's global convergence properties without requiring the trust region to shrink to zero in the limit. To benchmark the development of this optimization method, a test set of problems is generated based on modified problems from the CUTEr and COPS sets. The modified algorithm demonstrates improved performance using the test problem set. Finally, the algorithm is implemented within the Pyomo environment and demonstrated on a rigorous process optimization case study for carbon capture. © 2018 American Institute of Chemical Engineers AIChE J , 64: 3934–3943, 2018
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.
Use of a Radon Stripping Algorithm for Retrospective Assessment of Air Filter Samples
An evaluation of a large number of air sample filters was undertaken using a commercial alpha and beta spectroscopy system employing a passive implanted planar silicon (PIPS) detector. Samples were only measured after air flow through the filters had ceased. Use of a commercial radon stripping algorithm was implemented to discriminate anthropogenic alpha and beta activity on the filters from the radon progeny. When uncontaminated air filters were evaluated, the results showed that there was a time-dependent bias in both average estimates and measurement dispersion with the relative bias being small compared to the dispersion. By also measuring environmental air sample filters simultaneously with electroplated alpha and beta sources, use of the radon stripping algorithm demonstrated a number of substantial unexpected deviations. Use of the current algorithm is therefore not recommended for assay applications and so use of the PIPS detector should only be utilized for gross counting without appropriate modifications to the curve fitting algorithm. As a screening method, the radon stripping algorithm might be expected to see elevated alpha and beta activities on air sample filters (not due to radon progeny) around the 200 dpm level.
Search for Heavy Resonances in the Dimuon Channel with the DØ Detector
High-energy particle physics is often described as the quest for a fundamental theory. One can think of one theory as being more "fundamental" than a second theory if the first explains some or all of the predictions of the second in terms of processes at smaller distance scales and higher energies. Another sense in which a theory can be thought of as being more fundamental than another, is if the first theory "explains" the second; that is, if some arbitrary aspect of the second theory is a special case of a more general principle in the first theory. The Standard Model of particle physics is the most fundamental experimentally tested theory in either sense. It was developed in its final form in the 1960's and 1970's and continues to successfully predict the outcomes of high-energy physics experiments; the research presented in this thesis offers no exception to this trend ( unfortunately). However, the Standard Model only makes sense as an effective theory; that is, a theory that is not actually fundamental, but which is a low-energy limit of some underlying theory, without being dependent on the details of that underlying theory. Moreover, one important aspect of the Standard Model so far remains unexplained, namely electroweak symmetry breaking. Phase transitions occur in many places in physics, and can often be explained as a low-energy aspect of some more fundamental process. However, there is no such underlying process for electroweak symmetry breaking within the Standard Model; the introduction of the scalar Higgs field does not, in itself, explain electroweak symmetry breaking, it merely parameterizes it. Therefore, it is perhaps not surprising that the (most obvious) problem with the Standard Model, the '·gauge hierarchy problem", occurs in relation with the Higgs field. This problem, the "unnaturalness" of the Standard Model, will be discussed (briefly) in the next chapter. It so happens that the unnaturalness of the Standard Model strongly suggests the presence of new physics at an energy scale that is very close to the energies achieved with the Tevatron collider (and presumably well within the reach of the next collider, the LHC). Therefore, there is a general expectation that new physics is "just around the corner". Many, many models for new physics exist, and it is not possible to devise an optimal search strategy for all of them at once. Therefore (and possibly to reduce bias), it is preferable to search for new physics in a model-independent way. While the analysis presented in this thesis is certainly not model-independent, it uses the fact that many, often very different models share the prediction of a new mass resonance. Specifically, we search for such resonances in the dimuon channel. Since no new resonance was in fact observed, the various models only serve to parameterize the degree to which nothing was found. In chapter 2, an outline of the Standard Model is given, and some extensions to the Standard Model are described. Chapter 3 describes the accelerator complex and the D0 detector. Chapter 4 describes the simulation of both Standard Model and new physics processes and the detector simulation. Chapter 5 describes the data sample, the reconstruction algorithms, the event selection and the kinematic fit. A sample of high-PT dimuon events is obtained by applying a number of cuts, and the simulation is tuned to match the efficiencies and track resolution measured on Z→ μ + μ - data. The integrated luminosity times the trigger efficiency of the final sample is determined by comparing it to the predicted (and well-tested) Z cross section. The mass resolution is improved by a kinematic fit which uses the transverse energy balance in the event to constrain the muon track P T for each event in the final selection. In chapter 6, a final cut on the (fitted) invariant mass of the selected events is chosen in such a way that it maximizes the sensitivity to the presence of new physics for specific models and resonance masses. A counting experiment is performed for several values of the mass of a hypothetical new particle. Since no excess over the predicted background is observed, Bayesian credibility limits on the production cross-section times branching ratio of the hypothetical new particles were calculated, as well as limits on the parameters of new physics models. The uncertainties on the theory and detector simulation are taken into account. An event display of the highest reconstructed mass event is shown as well. Finally, chapter 7 gives a conclusion, some prospects of improving the result and a brief outlook.
Light-cone matrix product
We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at {delta}=0.5, we simulate to a time of {approx_equal}22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either 'revivals' in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.
Hashed Binary Search Sampling for Convolutional Network Training with Large Overhead Image Patches
Very large overhead imagery associated with ground truth maps has the potential to generate billions of training image patches for machine learning algorithms. However, random sampling selection criteria often leads to redundant and noisy-image patches for model training. With minimal research efforts behind this challenge, the current status spells missed opportunities to develop supervised learning algorithms that generalize over wide geographical scenes. In addition, much of the computational cycles for large scale machine learning are poorly spent crunching through noisy and redundant image patches. We demonstrate a potential framework to address these challenges specifically, while evaluating a human settlement detection task. A novel binary search tree sampling scheme is fused with a kernel based hashing procedure that maps image patches into hash-buckets using binary codes generated from image content. The framework exploits inherent redundancy within billions of image patches to promote mostly high variance preserving samples for accelerating algorithmic training and increasing model generalization.
Randomized Sampling for Large Data Applications of SVM
A trend in machine learning is the application of existing algorithms to ever-larger datasets. Support Vector Machines (SVM) have been shown to be very effective, but have been difficult to scale to large-data problems. Some approaches have sought to scale SVM training by approximating and parallelizing the underlying quadratic optimization problem. This paper pursues a different approach. Our algorithm, which we call Sampled SVM, uses an existing SVM training algorithm to create a new SVM training algorithm. It uses randomized data sampling to better extend SVMs to large data applications. Experiments on several datasets show that our method is faster than and comparably accurate to both the original SVM algorithm it is based on and the Cascade SVM, the leading data organization approach for SVMs in the literature. Further, we show that our approach is more amenable to parallelization than Cascade SVM.