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 433 records · Page 24

A SPECTROSCOPIC SURVEY OF THE FIELDS OF 28 STRONG GRAVITATIONAL LENSES: THE GROUP CATALOG

With a large, unique spectroscopic survey in the fields of 28 galaxy-scale strong gravitational lenses, we identify groups of galaxies in the 26 adequately sampled fields. Using a group-finding algorithm, we find 210 groups with at least 5 member galaxies; the median number of members is 8. Our sample spans redshifts of 0.04 ≤ z {sub grp} ≤ 0.76 with a median of 0.31, including 174 groups with 0.1 < z {sub grp} < 0.6. The groups have radial velocity dispersions of 60 ≤ σ {sub grp} ≤ 1200 km s{sup −1} with a median of 350 km s{sup −1}. We also discover a supergroup in field B0712+472 at z = 0.29 that consists of three main groups. We recover groups similar to ∼85% of those previously reported in these fields within our redshift range of sensitivity and find 187 new groups with at least five members. The properties of our group catalog, specifically, (1) the distribution of σ {sub grp}, (2) the fraction of all sample galaxies that are group members, and (3) the fraction of groups with significant substructure, are consistent with those for other catalogs. The distribution of group virial masses agrees well with theoretical expectations. Of the lens galaxies, 12 of 26 (46%) (B1422+231, B1600+434, B2114+022, FBQS J0951+2635, HE0435-1223, HST J14113+5211, MG0751+2716, MGJ1654+1346, PG 1115+080, Q ER 0047-2808, RXJ1131-1231, and WFI J2033-4723) are members of groups with at least five galaxies, and one more (B0712+472) belongs to an additional, visually identified group candidate. There are groups not associated with the lens that still are likely to affect the lens model; in six of 25 (24%) fields (excluding the supergroup), there is at least one massive ( σ {sub grp} ≥ 500 km s{sup −1}) group or group candidate projected within 2′ of the lens.

79 ASTRONOMY AND ASTROPHYSICS↗

Energy Storage Sizing and Operation of an Integrated Utility-Scale PV+ESS Power Plant

Integration of an energy storage system (ESS) into a large-scale grid-connected photovoltaic (PV) power plant is highly desirable to improve performance of the system and overcome the stochastic nature of PV power generation. Algorithms to size ESS within an integrated PV and ESS ( PV+ESS) power plant, conventionally, require a large number of high-resolution samples of PV generation. These algorithms are computationally expensive. In this paper, a two-day optimization algorithm that utilizes n-step constant power output dispatch every day from the PV+ESS power plant is proposed to size the ESS. Additionally, an n-step power dispatch every day through the one-year timeframe based optimization of the size of ESS is also performed. The proposed methods are computationally cheaper and provide acceptable accuracy with respect to the conventional sizing methods. The economics identified from the proposed methods are compared with the typical day-ahead hourly dispatch-based power production from the PV+ESS power plant. This comparison has shown similar economic performance showcasing the accuracy of the proposed methods in sizing the ESS. It also shows the potential for operating PV+ESS power plant in n-step constant power generation mode.

Xia, Qian↗

Sampling strategies for subsampled segmented EPI PRF thermometry in MR guided high intensity focused ultrasound

Purpose: To investigate k-space subsampling strategies to achieve fast, large field-of-view (FOV) temperature monitoring using segmented echo planar imaging (EPI) proton resonance frequency shift thermometry for MR guided high intensity focused ultrasound (MRgHIFU) applications. Methods: Five different k-space sampling approaches were investigated, varying sample spacing (equally vs nonequally spaced within the echo train), sampling density (variable sampling density in zero, one, and two dimensions), and utilizing sequential or centric sampling. Three of the schemes utilized sequential sampling with the sampling density varied in zero, one, and two dimensions, to investigate sampling the k-space center more frequently. Two of the schemes utilized centric sampling to acquire the k-space center with a longer echo time for improved phase measurements, and vary the sampling density in zero and two dimensions, respectively. Phantom experiments and a theoretical point spread function analysis were performed to investigate their performance. Variable density sampling in zero and two dimensions was also implemented in a non-EPI GRE pulse sequence for comparison. All subsampled data were reconstructed with a previously described temporally constrained reconstruction (TCR) algorithm. Results: The accuracy of each sampling strategy in measuring the temperature rise in the HIFU focal spot was measured in terms of the root-mean-square-error (RMSE) compared to fully sampled “truth.” For the schemes utilizing sequential sampling, the accuracy was found to improve with the dimensionality of the variable density sampling, giving values of 0.65 °C, 0.49 °C, and 0.35 °C for density variation in zero, one, and two dimensions, respectively. The schemes utilizing centric sampling were found to underestimate the temperature rise, with RMSE values of 1.05 °C and 1.31 °C, for variable density sampling in zero and two dimensions, respectively. Similar subsampling schemes with variable density sampling implemented in zero and two dimensions in a non-EPI GRE pulse sequence both resulted in accurate temperature measurements (RMSE of 0.70 °C and 0.63 °C, respectively). With sequential sampling in the described EPI implementation, temperature monitoring over a 192 × 144 × 135 mm{sup 3} FOV with a temporal resolution of 3.6 s was achieved, while keeping the RMSE compared to fully sampled “truth” below 0.35 °C. Conclusions: When segmented EPI readouts are used in conjunction with k-space subsampling for MR thermometry applications, sampling schemes with sequential sampling, with or without variable density sampling, obtain accurate phase and temperature measurements when using a TCR reconstruction algorithm. Improved temperature measurement accuracy can be achieved with variable density sampling. Centric sampling leads to phase bias, resulting in temperature underestimations.

42 ENGINEERING↗

Noise Reduction with Microphone Arrays for Speaker Identification

Reducing acoustic noise in audio recordings is an ongoing problem that plagues many applications. This noise is hard to reduce because of interfering sources and non-stationary behavior of the overall background noise. Many single channel noise reduction algorithms exist but are limited in that the more the noise is reduced; the more the signal of interest is distorted due to the fact that the signal and noise overlap in frequency. Specifically acoustic background noise causes problems in the area of speaker identification. Recording a speaker in the presence of acoustic noise ultimately limits the performance and confidence of speaker identification algorithms. In situations where it is impossible to control the environment where the speech sample is taken, noise reduction filtering algorithms need to be developed to clean the recorded speech of background noise. Because single channel noise reduction algorithms would distort the speech signal, the overall challenge of this project was to see if spatial information provided by microphone arrays could be exploited to aid in speaker identification. The goals are: (1) Test the feasibility of using microphone arrays to reduce background noise in speech recordings; (2) Characterize and compare different multichannel noise reduction algorithms; (3) Provide recommendations for using these multichannel algorithms; and (4) Ultimately answer the question - Can the use of microphone arrays aid in speaker identification?

42 ENGINEERING↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

A Christoffel function weighted least squares algorithm for collocation approximations

Here, we propose, theoretically investigate, and numerically validate an algorithm for the Monte Carlo solution of least-squares polynomial approximation problems in a collocation framework. Our investigation is motivated by applications in the collocation approximation of parametric functions, which frequently entails construction of surrogates via orthogonal polynomials. A standard Monte Carlo approach would draw samples according to the density defining the orthogonal polynomial family. Our proposed algorithm instead samples with respect to the (weighted) pluripotential equilibrium measure of the domain, and subsequently solves a weighted least-squares problem, with weights given by evaluations of the Christoffel function. We present theoretical analysis to motivate the algorithm, and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest.

97 MATHEMATICS AND COMPUTING↗

Structure–activity relationship-based chemical classification of highly imbalanced Tox21 datasets

Abstract The specificity of toxicant-target biomolecule interactions lends to the very imbalanced nature of many toxicity datasets, causing poor performance in Structure–Activity Relationship (SAR)-based chemical classification. Undersampling and oversampling are representative techniques for handling such an imbalance challenge. However, removing inactive chemical compound instances from the majority class using an undersampling technique can result in information loss, whereas increasing active toxicant instances in the minority class by interpolation tends to introduce artificial minority instances that often cross into the majority class space, giving rise to class overlapping and a higher false prediction rate. In this study, in order to improve the prediction accuracy of imbalanced learning, we employed SMOTEENN, a combination of Synthetic Minority Over-sampling Technique (SMOTE) and Edited Nearest Neighbor (ENN) algorithms, to oversample the minority class by creating synthetic samples, followed by cleaning the mislabeled instances. We chose the highly imbalanced Tox21 dataset, which consisted of 12 in vitro bioassays for > 10,000 chemicals that were distributed unevenly between binary classes. With Random Forest (RF) as the base classifier and bagging as the ensemble strategy, we applied four hybrid learning methods, i.e., RF without imbalance handling (RF), RF with Random Undersampling (RUS), RF with SMOTE (SMO), and RF with SMOTEENN (SMN). The performance of the four learning methods was compared using nine evaluation metrics, among which F 1 score, Matthews correlation coefficient and Brier score provided a more consistent assessment of the overall performance across the 12 datasets. The Friedman’s aligned ranks test and the subsequent Bergmann-Hommel post hoc test showed that SMN significantly outperformed the other three methods. We also found that a strong negative correlation existed between the prediction accuracy and the imbalance ratio (IR), which is defined as the number of inactive compounds divided by the number of active compounds. SMN became less effective when IR exceeded a certain threshold (e.g., > 28). The ability to separate the few active compounds from the vast amounts of inactive ones is of great importance in computational toxicology. This work demonstrates that the performance of SAR-based, imbalanced chemical toxicity classification can be significantly improved through the use of data rebalancing.

Idakwo, Gabriel↗

A novel off-axis scanning method for an enlarged ellipse cone-beam computed tomography field of view

Purpose: Current on-board imaging systems commonly used by modern linear accelerators (LINACs) have a limited field of view (FOV) for a cone-beam CT (CBCT) scan, which is typically less than 50 cm. Consequently, truncation artifacts often occur for large patients. The goal of this work is to investigate a novel method to increase the FOV for current on-board CBCT systems. Methods: When a large patient is scanned with CBCT, any region outside the FOV is only partially sampled within a short range of projection angles, and at other angles no x-ray beams may pass through that region. To increase the sampling rate for the region outside the FOV, we have designed a new source trajectory by shifting the center of rotation during a CBCT scan. This resulted in a reduced sampling rate at the central area and increased sampling rate at the edges. The tradeoff led to a more balanced sampling for an enlarged FOV. An iterative algorithm was also developed to reconstruct the CT image under the new sampling scheme using a compressed sensing technique. Results: The method was validated by numerical simulations mimicking a Varian Trilogy CBCT system, and it was found that artifact-free images could be obtained with the FOV as large as 80 cm. Conclusions: The new CT scanning trajectory can be easily realized under current clinical setup with little modification of the control system, and this can be useful for treating obese patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Fast adaptive flat-histogram ensemble for calculating density of states and enhanced sampling in large systems

We presented an efficient algorithm, fast adaptive flat-histogram ensemble (FAFE), to estimate the density of states (DOS) and to enhance sampling in large systems. FAFE calculates the means of an arbitrary extensive variable U in generalized ensembles to form points on the curve {beta}{sub s}(U) {equivalent_to}{partial_derivative}S(U)/frac/{partial_derivative}U, the derivative of the logarithmic DOS. Unlike the popular Wang-Landau-like (WLL) methods, FAFE satisfies the detailed-balance condition through out the simulation and automatically generates non-uniform ({beta}{sub i}, U{sub i}) data points to follow the real change rate of {beta}{sub s}(U) in different U regions and in different systems. Combined with a U-compression transformation, FAFE reduces the required simulation steps from O(N{sup 3/2}) in WLL to O(N{sup 1/2}), where N is the system size. We demonstrate the efficiency of FAFE in Lennard-Jones liquids with several N values. More importantly, we show its abilities in finding and identifying different macroscopic states including meta-stable states in phase co-existing regions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Performance Comparison of Low-Cost Near-Infrared (NIR) Spectrometers to a Conventional Laboratory Spectrometer for Rapid Biomass Compositional Analysis

The performance of a conventional laboratory near-infrared (NIR) spectrometer and two NIR spectrometer prototypes (a Texas Instruments NIRSCAN Nano evaluation model (EVM) and an InnoSpectra NIR-M-R2 spectrometer) are compared by collecting reflectance spectra of 270 well-characterized herbaceous biomass samples, building calibration models using the partial least squares (PLS-2) algorithm to predict five constituents of the samples from the reflectance spectra, and comparing the resulting model statistics. The prediction models developed using spectra from the Foss XDS spectrometer were slightly better than the prediction models developed using spectra from either the TI NIRSCAN Nano EVM and the InnoSpectra NIR-M-R2 as measured by the root mean square error (RMSECV) and the correlation coefficient (R 2 _cv) for “leave-one-out” cross-validation (CV). The models built from the two prototype units were not statistically significantly different from each other (p = 0.05). The Foss spectrometer has a larger wavelength range (400–2500 nm) compared with the two prototypes (900–1700 nm). When the spectra from the Foss XDS spectrometer were truncated so their wavelength range matched the wavelength range of the two prototype units, the resulting model was not statistically significantly different from the models from either prototype.

47 OTHER INSTRUMENTATION↗

POF-Darts: Geometric adaptive sampling for probability of failure

We introduce a novel technique, POF-Darts, to estimate the Probability Of Failure based on random disk-packing in the uncertain parameter space. POF-Darts uses hyperplane sampling to explore the unexplored part of the uncertain space. We use the function evaluation at a sample point to determine whether it belongs to failure or non-failure regions, and surround it with a protection sphere region to avoid clustering. We decompose the domain into Voronoi cells around the function evaluations as seeds and choose the radius of the protection sphere depending on the local Lipschitz continuity. As sampling proceeds, regions uncovered with spheres will shrink, improving the estimation accuracy. After exhausting the function evaluation budget, we build a surrogate model using the function evaluations associated with the sample points and estimate the probability of failure by exhaustive sampling of that surrogate. In comparison to other similar methods, our algorithm has the advantages of decoupling the sampling step from the surrogate construction one, the ability to reach target POF values with fewer samples, and the capability of estimating the number and locations of disconnected failure regions, not just the POF value. Furthermore, we present various examples to demonstrate the efficiency of our novel approach.

97 MATHEMATICS AND COMPUTING↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗

Model-Based Iterative Reconstruction of Magnetization Using Vector Field Electron Tomography

Vector field electron tomography (VFET) is extensively used for three-dimensional (3-D) imaging of magnetic materials at nanometer resolutions. The conventional approach is to reconstruct and visualize the magnetic vector potential or the magnetic field associated with the sample. There is a lack of algorithms capable of reconstructing the 3-D distribution of magnetization from VFET data. Unlike magnetic vector potential and magnetic field, magnetization is a fundamental physical property of the sample that does not extend beyond the dimensions of the sample. We present a model-based iterative reconstruction algorithm (MBIR) that reconstructs the magnetization by minimizing a cost function consisting of a forward model term and a prior model term. The forward model uses the physics of imaging to model the VFET data as a function of the magnetization, and the prior model enforces sparsity in the magnetization reconstruction. We then formulate an optimization algorithm based on the theory of alternate direction method of multipliers to minimize the resulting MBIR cost function. In conclusion, using simulated and real data, we show that our algorithm accurately reconstructs both the magnetization and the magnetic vector potential.

97 MATHEMATICS AND COMPUTING↗

MO-F-CAMPUS-I-04: Characterization of Fan Beam Coded Aperture Coherent Scatter Spectral Imaging Methods for Differentiation of Normal and Neoplastic Breast Structures

Purpose: This study intends to characterize the spectral and spatial resolution limits of various fan beam geometries for differentiation of normal and neoplastic breast structures via coded aperture coherent scatter spectral imaging techniques. In previous studies, pencil beam raster scanning methods using coherent scatter computed tomography and selected volume tomography have yielded excellent results for tumor discrimination. However, these methods don’t readily conform to clinical constraints; primarily prolonged scan times and excessive dose to the patient. Here, we refine a fan beam coded aperture coherent scatter imaging system to characterize the tradeoffs between dose, scan time and image quality for breast tumor discrimination. Methods: An X-ray tube (125kVp, 400mAs) illuminated the sample with collimated fan beams of varying widths (3mm to 25mm). Scatter data was collected via two linear-array energy-sensitive detectors oriented parallel and perpendicular to the beam plane. An iterative reconstruction algorithm yields images of the sample’s spatial distribution and respective spectral data for each location. To model in-vivo tumor analysis, surgically resected breast tumor samples were used in conjunction with lard, which has a form factor comparable to adipose (fat). Results: Quantitative analysis with current setup geometry indicated optimal performance for beams up to 10mm wide, with wider beams producing poorer spatial resolution. Scan time for a fixed volume was reduced by a factor of 6 when scanned with a 10mm fan beam compared to a 1.5mm pencil beam. Conclusion: The study demonstrates the utility of fan beam coherent scatter spectral imaging for differentiation of normal and neoplastic breast tissues has successfully reduced dose and scan times whilst sufficiently preserving spectral and spatial resolution. Future work to alter the coded aperture and detector geometries could potentially allow the use of even wider fans, thereby making coded aperture coherent scatter imaging a clinically viable method for breast cancer detection. United States Department of Homeland Security; Duke University Medical Center - Department of Radiology; Carl E Ravin Advanced Imaging Laboratories; Duke University Medical Physics Graduate Program.

60 APPLIED LIFE SCIENCES↗

Automatic microseismic event picking via unsupervised machine learning

SUMMARY Effective and efficient arrival picking plays an important role in microseismic and earthquake data processing and imaging. Widely used short-term-average long-term-average ratio (STA/LTA) based arrival picking algorithms suffer from the sensitivity to moderate-to-strong random ambient noise. To make the state-of-the-art arrival picking approaches effective, microseismic data need to be first pre-processed, for example, removing sufficient amount of noise, and second analysed by arrival pickers. To conquer the noise issue in arrival picking for weak microseismic or earthquake event, I leverage the machine learning techniques to help recognizing seismic waveforms in microseismic or earthquake data. Because of the dependency of supervised machine learning algorithm on large volume of well-designed training data, I utilize an unsupervised machine learning algorithm to help cluster the time samples into two groups, that is, waveform points and non-waveform points. The fuzzy clustering algorithm has been demonstrated to be effective for such purpose. A group of synthetic, real microseismic and earthquake data sets with different levels of complexity show that the proposed method is much more robust than the state-of-the-art STA/LTA method in picking microseismic events, even in the case of moderately strong background noise.

Chen, Yangkang↗