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 1,675 records · Page 93

Optimized 3D co-registration of ultra-low-field and high-field magnetic resonance images

The prototypes of ultra-low-field (ULF) MRI scanners developed in recent years represent new, innovative, cost-effective and safer systems, which are suitable to be integrated in multi-modal (Magnetoencephalography and MRI) devices. Integrated ULF-MRI and MEG scanners could represent an ideal solution to obtain functional (MEG) and anatomical (ULF MRI) information in the same environment, without errors that may limit source reconstruction accuracy. However, the low resolution and signal-to-noise ratio (SNR) of ULF images, as well as their limited coverage, do not generally allow for the construction of an accurate individual volume conductor model suitable for MEG localization. Thus, for practical usage, a high-field (HF) MRI image is also acquired, and the HF-MRI images are co-registered to the ULF-MRI ones. We address here this issue through an optimized pipeline (SWIM—Sliding WIndow grouping supporting Mutual information). The co-registration is performed by an affine transformation, the parameters of which are estimated using Normalized Mutual Information as the cost function, and Adaptive Simulated Annealing as the minimization algorithm. The sub-voxel resolution of the ULF images is handled by a sliding-window approach applying multiple grouping strategies to down-sample HF MRI to the ULF-MRI resolution. The pipeline has been tested on phantom and real data from different ULF-MRI devices, and comparison with well-known toolboxes for fMRI analysis has been performed. Our pipeline always outperformed the fMRI toolboxes (FSL and SPM). The HF–ULF MRI co-registration obtained by means of our pipeline could lead to an effective integration of ULF MRI with MEG, with the aim of improving localization accuracy, but also to help exploit ULF MRI in tumor imaging.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of liquid water path below the melting layer in stratiform precipitation systems using radar measurements during MC3E

In this study, the liquid water path (LWP) below the melting layer in stratiform precipitation systems is retrieved, which is a combination of rain liquid water path (RLWP) and cloud liquid water path (CLWP). The retrieval algorithm uses measurements from the vertically pointing radars (VPRs) at 35 and 3 GHz operated by the US Department of Energy Atmospheric Radiation Measurement (ARM) and National Oceanic and Atmospheric Administration (NOAA) during the field campaign Midlatitude Continental Convective Clouds Experiment (MC3E). The measured radar reflectivity and mean Doppler velocity from both VPRs and spectrum width from the 35 GHz radar are utilized. With the aid of the cloud base detected by a ceilometer, the LWP in the liquid layer is retrieved under two different situations: (I) no cloud exists below the melting base, and (II) cloud exists below the melting base. In (I), LWP is primarily contributed from raindrops only, i.e., RLWP, which is estimated by analyzing the Doppler velocity differences between two VPRs. In (II), cloud particles and raindrops coexist below the melting base. The CLWP is estimated using a modified attenuation-based algorithm. Two stratiform precipitation cases (20 and 11 May 2011) during MC3E are illustrated for two situations, respectively. With a total of 13 h of samples during MC3E, statistical results show that the occurrence of cloud particles below the melting base is low (9 %); however, the mean CLWP value can be up to 0.56 kg m -2 , which is much larger than the RLWP (0.10 kg m -2 ). When only raindrops exist below the melting base, the average RLWP value is larger (0.32 kg m -2 ) than the with-cloud situation. The overall mean LWP below the melting base is 0.34 kg m -2 for stratiform systems during MC3E.

54 ENVIRONMENTAL SCIENCES↗

NEUTRON STAR MASS–RADIUS CONSTRAINTS USING EVOLUTIONARY OPTIMIZATION

The equation of state of cold supra-nuclear-density matter, such as in neutron stars, is an open question in astrophysics. A promising method for constraining the neutron star equation of state is modeling pulse profiles of thermonuclear X-ray burst oscillations from hot spots on accreting neutron stars. The pulse profiles, constructed using spherical and oblate neutron star models, are comparable to what would be observed by a next-generation X-ray timing instrument like ASTROSAT , NICER , or a mission similar to LOFT . In this paper, we showcase the use of an evolutionary optimization algorithm to fit pulse profiles to determine the best-fit masses and radii. By fitting synthetic data, we assess how well the optimization algorithm can recover the input parameters. Multiple Poisson realizations of the synthetic pulse profiles, constructed with 1.6 million counts and no background, were fitted with the Ferret algorithm to analyze both statistical and degeneracy-related uncertainty and to explore how the goodness of fit depends on the input parameters. For the regions of parameter space sampled by our tests, the best-determined parameter is the projected velocity of the spot along the observer’s line of sight, with an accuracy of ≤3% compared to the true value and with ≤5% statistical uncertainty. The next best determined are the mass and radius; for a neutron star with a spin frequency of 600 Hz, the best-fit mass and radius are accurate to ≤5%, with respective uncertainties of ≤7% and ≤10%. The accuracy and precision depend on the observer inclination and spot colatitude, with values of ∼1% achievable in mass and radius if both the inclination and colatitude are ≳60°.

79 ASTRONOMY AND ASTROPHYSICS↗

Identifying Light-Duty Vehicle Travel from Large-Scale Multimodal Wearable GPS Data with Novelty Detection Algorithms

Identifying travel mode within travel survey data sets, especially light-duty vehicle (LDV) travel, is foundational, though nontrivial, to travel behavior analysis and fuel consumption estimation. Current travel mode detection approaches require well-sampled and balanced data sets with ground truth travel mode labels. They are rarely applied and validated on large-scale, real-world data sets, which may not satisfy the data requirements. This paper proposes an LDV travel mode detection model as a supplement to current travel mode detection methods, for the case when the training set is highly (and/or completely) unbalanced, to the extent that classical machine-learning approaches become difficult or impossible to deploy. The proposed model uses a novelty detection technique-one-class support vector machines (OCSVMs)-and a novel exhaustive feature extraction (EFE) technique on continuous time series data (i.e., Global Positioning System [GPS] speed profiles) for single-mode trip trajectories. Training and validation of the model are conducted on a large-scale, real-world data set. The proposed method accurately identifies LDV trips from a broad set of multimodal trips by leveraging a wealth of preexisting in-vehicle GPS travel data. Additional sensitivity analysis sheds light on the optimal training size, which will benefit applications limited by highly imbalanced data. The paper also discusses performance comparison with regular machine-learning approaches, the model's robustness, and the potential to extend the proposed model to multimodal prediction.

47 OTHER INSTRUMENTATION↗

Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used technique proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

CHARACTERIZING THE SHARDS OF DISRUPTED MILKY WAY SATELLITES WITH LAMOST

We derive the fraction of substructure in the Galactic halo using a sample of over 10,000 spectroscopically confirmed halo giant stars from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) spectroscopic survey. By observing 100 synthetic models along each line of sight with the LAMOST selection function in that sky area, we statistically characterize the expected halo populations. We define as Stellar Halo Accretion Related Debris Structures (SHARDS) any stars in >3σ excesses above the model predictions. We find that at least 10% of the Milky Way (MW) halo stars from LAMOST are part of SHARDS. By running our algorithm on smooth halos observed with the LAMOST selection function, we show that the LAMOST data contain excess substructure over all Galactocentric radii R{sub GC}<40 kpc, beyond what is expected due to statistical fluctuations and incomplete sampling of a smooth halo. The level of substructure is consistent with the fraction of stars in SHARDS in model halos created entirely from accreted satellites. This work illustrates the potential of vast spectroscopic surveys with high filling factors over large sky areas to recreate the merging history of the MW.

79 ASTRONOMY AND ASTROPHYSICS↗

Final Report on HOLODEC 2 Technology Readiness Level

During the period of this project, the Holographic Detector for Clouds 2 (HOLODEC 2) instrument has advanced from a laboratory-proven instrument with some initial field testing to a fully flight-tested instrument capable of providing useful cloud microphysics measurements. This can be summarized as 'Technology Readiness Level 8: Technology is proven to work - Actual technology completed and qualified through test and demonstration.' As part of this project, improvements and upgrades have been made to the optical system, the instrument power control system, the data acquisition computer, the instrument control software, the data reconstruction and analysis software, and some of the basic algorithms for estimating basic microphysical variables like droplet diameter. Near the end of the project, the instrument flew on several research flights as part of the IDEAS 2011 project, and a small sample of data from the project is included as an example. There is one caveat in the technology readiness level stated above: the upgrades to the instrument power system were made after the flight testing, so they are not fully field proven. We anticipate that there will be an opportunity to fly the instrument as part of the IDEAS project in fall 2012.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Histogram-Free Multicanonical Monte Carlo Algorithm for the Basis Expansion of Density of States

We report a new multicanonical Monte Carlo (MC) algorithm to obtain the density of states (DOS) for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain an analytical form for the DOS expressed in a chosen basis set, instead of a numerical array of finite resolution as in previous variants of this class of MC methods such as the multicanonical (MUCA) sampling and Wang-Landau (WL) sampling. This is enabled by storing the visited states directly in a data set and avoiding the explicit collection of a histogram. This practice also has the advantage of avoiding undesirable artificial errors caused by the discretization and binning of continuous state variables. Our results show that this scheme is capable of obtaining converged results with a much reduced number of Monte Carlo steps, leading to a significant speedup over existing algorithms.

97 MATHEMATICS AND COMPUTING↗

A histogram-free multicanonical Monte Carlo algorithm for the construction of analytical density of states

We report a new multicanonical Monte Carlo (MC) algorithm to obtain the density of states (DOS) for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain an analytical form for the DOS expressed in a chosen basis set, instead of a numerical array of finite resolution as in previous variants of this class of MC methods such as the multicanonical (MUCA) sampling and Wang-Landau (WL) sampling. This is enabled by storing the visited states directly in a data set and avoiding the explicit collection of a histogram. This practice also has the advantage of avoiding undesirable artificial errors caused by the discretization and binning of continuous state variables. Our results show that this scheme is capable of obtaining converged results with a much reduced number of Monte Carlo steps, leading to a significant speedup over existing algorithms.

Li, Ying Wai↗

The Quantum Alternating Operator Ansatz on Maximum k -Vertex Cover

The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum k-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two XY -Hamiltonian mixing operators: the ring mixer and the complete graph mixer, (iii) an analysis of the distribution of solutions via Monte Carlo sampling, and (iv) the exploration of efficient angle selection strategies.

97 MATHEMATICS AND COMPUTING↗

The F-t-Pj-RG method: An adjacent-rolling-windows based steady-state detection technique for application to kinetic Monte Carlo simulations

A window-based steady-state detection algorithm has been developed for application to kinetic Monte Carlo simulation data. The algorithm, termed F-t-Pj-RG sequentially applies an F-test, a t-test, and a projection test on adjacent windows of the data while rolling (or shifting) and growing the windows when any of the tests fail. In aggregate, the algorithm is able to (a) automatically reject the warm-up period as not being at steady-state, as well as (b) determine an appropriate window size for converged statistics when sampling the data, which is necessary for detection of steady-state, and (c) detect steady-state within a particular tolerance. The last step, the projection test, is actually an oscillating-slope projection test, and is performed on j sequential data windows (i.e., more than two adjacent windows). It requires more than simply being within the user defined tolerance: the oscillating-slope projection test includes a condition that the slope must oscillate around zero when 2, which is an additional indication of steady-state. When all three tests are passed, the F-t-Pj test is passed, indicating that the prerequisites of steady-state detection have been met and also that conditions consistent with the definition of steady-state have been realized. This algorithm is applied to a variety of data sets that correspond to the diverse type of data trends that can be produced by kinetic Monte Carlo simulations. The algorithm is shown to be robust in its ability to handle differing functional forms, and is able to detect steady-state with low computational cost. Finally, the low computational cost of this method and its robustness towards varied data trends make it suitable for on-the-fly use in kinetic Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗

Coupling High-Throughput Experiments and Regression Algorithms to Optimize PGM-Free ORR Electrocatalyst Synthesis

Over the past decades, significant improvement has been achieved in the performance of platinum group metal-free (PGM-free) materials as an alternative to Pt-based electrocatalysts for oxygen reduction reaction (ORR). However, further progress in ORR activity requires evaluation of precursors and synthesis approaches. In response to this challenge, we generated a first of its kind experimental data set of 36 samples using high-throughput synthesis and activity measurements. Several control parameters (e.g., Fe precursor identity, the precursor content, and pyrolysis temperature) were varied. We then developed several state-of-the-art machine learning (ML) based regression models to predict ORR activity, dependent on selected synthesis variables. Through an iterative algorithm, higher prediction accuracy (smaller root-mean-square error) was achieved. We identified that gradient boosting regression (GBR) and support vector regression (SVR), among several methods, work best for this data set. Aided by our ML-based surrogate models, we decided to alter catalyst synthesis conditions, which resulted in a 36% increase in measured ORR activity in comparison to the maximum ORR mass activity value of 21.9 A/g catalyst in the original data set. Overall, this combined experiment and machine learning approach represents a promising path forward toward developing highly efficient next-generation ORR electrocatalysts and, more generally, functional materials.

25 ENERGY STORAGE↗

Optimal sampling efficiency in Monte Carlo sampling with an approximate potential

Building on the work of Iftimie et al., Boltzmann sampling of an approximate potential (the 'reference' system) is used to build a Markov chain in the isothermal-isobaric ensemble. At the endpoints of the chain, the energy is evaluated at a higher level of approximation (the 'full' system) and a composite move encompassing all of the intervening steps is accepted on the basis of a modified Metropolis criterion. For reference system chains of sufficient length, consecutive full energies are statistically decorrelated and thus far fewer are required to build ensemble averages with a given variance. Without modifying the original algorithm, however, the maximum reference chain length is too short to decorrelate full configurations without dramatically lowering the acceptance probability of the composite move. This difficulty stems from the fact that the reference and full potentials sample different statistical distributions. By manipulating the thermodynamic variables characterizing the reference system (pressure and temperature, in this case), we maximize the average acceptance probability of composite moves, lengthening significantly the random walk between consecutive full energy evaluations. In this manner, the number of full energy evaluations needed to precisely characterize equilibrium properties is dramatically reduced. The method is applied to a model fluid, but implications for sampling high-dimensional systems with ab initio or density functional theory (DFT) potentials are discussed.

74 ATOMIC AND MOLECULAR PHYSICS↗

SU-E-CAMPUS-T-05: Preliminary Results On a 2D Dosimetry System Based On the Optically Stimulated Luminescence of Al2O3

Purpose: To develop a precise 2D dose mapping technique based on the optically stimulated luminescence (OSL) from Al{sub 2}O{sub 3} films for medical applications. Methods: A 2D laser scanning reader was developed using fast F{sup +}-center (lifetime of <7 ns) and slow F-center (lifetime of 35 ms) OSL emission from newly developed Al{sub 2}O{sub 3} films (Landauer Inc.). An algorithm was developed to correct images for both material and system properties. Since greater contribution of the F??-center emission in the recorded signal increases the readout efficiency and robustness of image corrections, Al{sub 2}O{sub 3}:C,Mg film samples are being investigated in addition to Al{sub 2}O{sub 3}:C samples. Preliminary investigations include exposure of the films to a 6 MV photon beam at 10 cm depth in solid water phantom with an SSD of 100 cm, using a 10 cm × 10 cm flat field or a 4 cm × 4 cm field with a 60° wedge filter. Kodak EDR2 radiographic film and EBT2 Gafchromic film were also exposed for comparison. Results: The results indicate that the algorithm is able to correct images and calculate 2D dose. For the wedge field irradiation, the calculated dose at the center of the field was 0.9 Gy for Al{sub 2}O{sub 3}:C and 0.87 Gy for Al{sub 2}O{sub 3}:C,Mg, whereas, the delivered dose was 0.95 Gy. A good qualitative agreement of the dose profiles was obtained between the OSL films and EDR2 and EBT2 films. Laboratory tests using a beta source suggest that a large dynamic range (10{sup −2}−10{sup 2} Gy) can be achieved using this technique. Conclusion: A 2D dosimetry system and an in-house image correction algorithm were developed for 2D film dosimetry in medical applications. The system is in the preliminary stage of development, but the data demonstrates the feasibility of this approach. This work was supported by Landauer, Inc.

36 MATERIALS SCIENCE↗

Development of a new ion mobility time-of-flight mass spectrometer

Complex samples require multidimensional measurements with high resolution for full characterization of biological and environmental systems. To address this challenge, we developed a drift tube-based ion mobility spectrometry-Orbitrap mass spectrometry (IMS-Orbitrap MS) platform. To circumvent the timing difference between the fast IMS separation and the slow Orbitrap MS acquisition, we utilized a dual gate and pseudorandom sequence to multiplex ions into the drift tube and Orbitrap. The instrument was designed to operate in signal averaging (SA), single multiplexing (SM) and double multiplexing (DM) IMS modes to fully optimize the signal-to-ratio of the measurements. For the SM measurements, a previously developed algorithm was used to reconstruct the IMS data, while a new algorithm was developed for the DM analyses. The new algorithm is a two-step process that first recovers the SM data from the encoded DM data and then decoded the SM data. The algorithm also performs multiple refining procedures in order to minimize the demultiplexing artifacts traditionally observed in such scheme. The new IMS-Orbitrap MS platform was demonstrated for the analysis of proteomic and petroleum samples, where the integration of IMS and high mass resolution proved essential for accurate assignment of molecular formulae.

47 OTHER INSTRUMENTATION↗

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗

PS-Samp (Phase-Space Sampling)

PS-Samp is a software that reduces a given dataset by pruning data. Data is downselected such that it uniformly spans the phase-space, thereby ensuring that the full dataset is correctly represented. The algorithm relies on estimating the probability map of the data and using it to construct an acceptance probability. The software is designed to handle very large data sets.

Hassanaly, Malik↗