Engineering Papers⌕ Search

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.

At least 307 records · Page 17

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

Eason, John P.↗

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↗

A predictive guidance algorithm for Mars entry

This report presents the derivation, logic, and performance of a Mars entry guidance algorithm for the Mars Rover Sample Return Mission. This algorithm guides the Mars entry vehicle along an equilibrium glide trajectory designed to satisfy a set of equality and inequality constraints at chute deploy. An equilibrium glide assumption permits analytic prediction of terminal state conditions and eliminates the need for determining numeric state sensitivities. Trajectory deviations due to dispersions or uncertainties in Martian atmosphere, vehicle aerodynamics, or entry interface conditions are accommodated simply by predicting the compensating equilibrium glide profile and achieving this profile with the available lift control. This Mars Predictive Equilibrium Glide guidance scheme was tested on a range of vehicle configurations with a variety of aerodynamic, atmosphere, and trajectory dispersions with a high degree of success.

Tigges, M. A.↗

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.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An algorithm for extraction of periodic signals from sparse, irregularly sampled data

Temporal gaps in discrete sampling sequences produce spurious Fourier components at the intermodulation frequencies of an oscillatory signal and the temporal gaps, thus significantly complicating spectral analysis of such sparsely sampled data. A new fast Fourier transform (FFT)-based algorithm has been developed, suitable for spectral analysis of sparsely sampled data with a relatively small number of oscillatory components buried in background noise. The algorithm's principal idea has its origin in the so-called 'clean' algorithm used to sharpen images of scenes corrupted by atmospheric and sensor aperture effects. It identifies as the signal's 'true' frequency that oscillatory component which, when passed through the same sampling sequence as the original data, produces a Fourier image that is the best match to the original Fourier space. The algorithm has generally met with succession trials with simulated data with a low signal-to-noise ratio, including those of a type similar to hourly residuals for Earth orientation parameters extracted from VLBI data. For eight oscillatory components in the diurnal and semidiurnal bands, all components with an amplitude-noise ratio greater than 0.2 were successfully extracted for all sequences and duty cycles (greater than 0.1) tested; the amplitude-noise ratios of the extracted signals were as low as 0.05 for high duty cycles and long sampling sequences. When, in addition to these high frequencies, strong low-frequency components are present in the data, the low-frequency components are generally eliminated first, by employing a version of the algorithm that searches for non-integer multiples of the discrete FET minimum frequency.

Wilcox, J. Z.↗

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Aerosol Detection from the Cloud Aerosol Transport System on the International Space Station: Algorithm Overview and Implications for Diurnal Sampling

Concentrations of particulate aerosols and their vertical placement in the atmosphere determine their interaction with the Earth system and their impact on air quality. Space-based lidar, such as the Cloud–Aerosol Transport System (CATS) technology demonstration instrument, is well-suited for determining the vertical structure of these aerosols and their diurnal cycle. Through the implementation of aerosol-typing algorithms, vertical layers of aerosols are assigned a type, such as marine, dust, and smoke, and a corresponding extinction-to-backscatter (lidar) ratio. With updates to the previous aerosol-typing algorithms, we find that CATS, even as a technology demonstration, observed the documented seasonal cycle of aerosols, comparing favorably with the Cloud–Aerosol Lidar with Orthogonal Polarization (CALIOP) space-based lidar and the NASA Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA-2) model reanalysis. By leveraging the unique orbit of the International Space Station, we find that CATS can additionally resolve the diurnal cycle of aerosol altitude as observed by ground-based instruments over the Maritime Continent of Southeast Asia.

Edward P Nowottnick↗

Space Flown Rodent Liver RNA Sequencing Data for Machine Learning in Space Biology Research

High-throughput nucleic acid sequencing (DNA-seq, RNA-seq) has become widespread in biomedical research due to the growing availability and affordability of these assays. Data analysis has been accelerated in recent years by the adoption of artificial intelligence (AI) and machine learning (ML) techniques by biomedical researchers. In space biology research, RNAseq datasets from space-flown experimental samples are critical for characterizing the gene expression aberrations associated with exposure to spaceflight stressors. However, space biological experiments tend to be very low sample size, so identifying proper AI/ML algorithms for sequencing data analysis is an ongoing challenge since these algorithms typically require large sample size. The NASA Science Mission Directorate (SMD) has started the “Benchmark Initiative for AI/ML”, focused on creating datasets meant for three main applications: 1) scientific benchmarking, which finds the best algorithm for a specific problem; 2) application benchmarking, which measures algorithm performance against a set of parameters; and 3) system benchmarking, which evaluates performance of hardware and software architecture. These scientific benchmarks consist of an AI-ready dataset and a reference implementation on a specific scientific question. In this work, we focused on generating standardized datasets to allow the scientific community to benchmark AI/ML algorithms in the domain of space biology. We present here a standardized, AI-ready, publicly available benchmark dataset for space biology RNA-seq data as a collaboration between the NASA AI4LS (Artificial Intelligence for Life Sciences) working group. and NASA’s SMD. This dataset consists of space-flown and ground control mouse liver found in the NASA GeneLab omics database. However, to amplify the small sample number (n=112 samples) for ML purposes, we employ Gaussian noise and a generative adversarial network to extend this dataset to 6,000 synthetic samples, matching the original gene expression characteristics.

James Casaletto↗

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.

Lunga, Dalton↗

Advisory Algorithm for Scheduling Open Sectors, Operating Positions, and Workstations

Air traffic controller supervisors configure available sector, operating position, and work-station resources to safely and efficiently control air traffic in a region of airspace. In this paper, an algorithm for assisting supervisors with this task is described and demonstrated on two sample problem instances. The algorithm produces configuration schedule advisories that minimize a cost. The cost is a weighted sum of two competing costs: one penalizing mismatches between configurations and predicted air traffic demand and another penalizing the effort associated with changing configurations. The problem considered by the algorithm is a shortest path problem that is solved with a dynamic programming value iteration algorithm. The cost function contains numerous parameters. Default values for most of these are suggested based on descriptions of air traffic control procedures and subject-matter expert feedback. The parameter determining the relative importance of the two competing costs is tuned by comparing historical configurations with corresponding algorithm advisories. Two sample problem instances for which appropriate configuration advisories are obvious were designed to illustrate characteristics of the algorithm. Results demonstrate how the algorithm suggests advisories that appropriately utilize changes in airspace configurations and changes in the number of operating positions allocated to each open sector. The results also demonstrate how the advisories suggest appropriate times for configuration changes.

Bloem, Michael↗

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.

large data↗

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assignment of Freight Traffic in a Large-scale Intermodal Network under Uncertainty

This paper presents a methodology for freight traffic assignment in a large-scale road-rail intermodal network under uncertainty. Network uncertainties caused by natural disasters have dramatically increased in recent years. Several of these disasters (e.g., Hurricane Sandy, Mississippi River Flooding, and Hurricane Harvey) severely disrupted the U.S. freight transportation network, and consequently, the supply chain. To account for these network uncertainties, a stochastic freight traffic assignment model is formulated. An algorithmic framework, involving the sample average approximation and gradient projection algorithm, is proposed to solve this challenging problem. The developed methodology is tested on the U.S. intermodal network with freight flow data from the Freight Analysis Framework. The experiments consider three types of natural disasters that have different risks and impacts on transportation networks: earthquakes, hurricanes, and floods. It is found that for all disaster scenarios, freight ton-miles are higher compared to the base case without uncertainty. The increase in freight ton-miles is the highest under the flooding scenario; this is because there are more states in the flood-risk areas, and they are scattered throughout the U.S.

42 ENGINEERING↗

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗