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,513 records · Page 84

HighDimMixedModels.jl: Robust high-dimensional mixed-effects models across omics data

High-dimensional mixed-effects models are an increasingly important form of regression in which the number of covariates rivals or exceeds the number of samples, which are collected in groups or clusters. The penalized likelihood approach to fitting these models relies on a coordinate descent algorithm that lacks guarantees of convergence to a global optimum. Here, we empirically study the behavior of this algorithm on simulated and real examples of three types of data that are common in modern biology: transcriptome, genome-wide association, and microbiome data. Our simulations provide new insights into the algorithm’s behavior in these settings, and, comparing the performance of two popular penalties, we demonstrate that the smoothly clipped absolute deviation (SCAD) penalty consistently outperforms the least absolute shrinkage and selection operator (LASSO) penalty in terms of both variable selection and estimation accuracy across omics data. To empower researchers in biology and other fields to fit models with the SCAD penalty, we implement the algorithm in a Julia package, HighDimMixedModels.jl .

Gorstein, Evan↗

Rutgers University Subcontract B611610 Final Report

Given an incomplete (i.e., partially-observed) network, which nodes should we actively probe in order to achieve the highest accuracy for a given network feature? For example, consider a cyber-network administrator who observes only a portion of the network at time t and wants to accurately identify the most important (e.g., highest PageRank) nodes in the complete network. She has a limited budget for probing the network. Of all the nodes she has observed, which should she probe in order to most accurately identify the important nodes? We propose a novel and scalable algorithm, MaxOutProbe, and evaluate it w.r.t. four network features (largest connected component, PageRank, core-periphery, and community detection), five network sampling strategies, and seven network datasets from different domains. Across a range of conditions, MaxOutProbe demonstrates consistently high performance relative to several baseline strategies

97 MATHEMATICS AND COMPUTING↗

Quantifying Damage Accumulation During Ductile Plastic Deformation Using Synchrotron Radiation

Under this grant, we have developed and demonstrated the ability of near-field High Energy Diffraction Microscopy (nf-HEDM) to map crystal orientation fields over three dimensions in deformed polycrystalline materials. Experimental work was performed at the Advanced Photon Source (APS) at beamline 1-ID. Applications of this new capability to ductile deformation of copper and zirconium samples were demonstrated as was the comparison of the experimental observations to computational plasticity models using a fast Fourier transform based algorithm that is able to handle the large experimental data sets. No such spatially resolved, direct comparison between measured and computed microstructure evolutions had previously been possible. The impact of this work is reflected in numerous publications and presentations as well as in the investments by DOE and DOD laboratories of millions of dollars in applying the technique, developing sophisticated new hardware that allows the technique to be applied to a wide variety of materials and materials problems, and in the use of the technique by other researchers. In essence, the grant facilitated the development of a new form of three dimensional microscopy and its application to technologically critical states of polycrystalline materials that are used throughout the U.S. and world economies. On-going collaborative work is further optimizing experimental and computational facilities at the APS and is pursuing expanded facilities.

36 MATERIALS SCIENCE↗

PtychoNet: Fast and High Quality Phase Retrieval for Ptychography

Ptychography is a coherent diffractive imaging method that captures multiple diffraction patterns of a sample with a set of shifted localized illuminations (“probes”). The reconstruction problem, known as “phase retrieval”, is typically solved by iterative algorithms. In this paper, we propose PtychoNet, a deep learning based method to perform phase retrieval for ptychography in a non-iterative manner. We devise a generative network to encode a full ptychography scan, reverse the diffractions at each scanning point and compute the amplitude and phase of the object. We demonstrate successful reconstructions using PtychoNet as well as recovering fine features in the case of extreme sparse scanning where conventional iterative methods fail to give recognizable features.

97 MATHEMATICS AND COMPUTING↗

Few measurement shots challenge generalization in learning to classify entanglement

The ability to extract general laws from a few known examples depends on the complexity of the problem and on the amount of training data. In the quantum setting, the learner's generalization performance is further challenged by the destructive nature of quantum measurements that, together with the no-cloning theorem, limits the amount of information that can be extracted from each training sample. In this paper we focus on hybrid quantum learning techniques where classical machine-learning methods are paired with quantum algorithms and show that, in some settings, the uncertainty coming from a few measurement shots can be the dominant source of errors. We identify an instance of this possibly general issue by focusing on the classification of maximally entangled vs. separable states, showing that this toy problem becomes challenging for learners unaware of entanglement theory. Finally, we introduce an estimator based on classical shadows that performs better in the big data, few copy regime. Our results show that the naive application of classical machine-learning methods to the quantum setting is problematic, and that a better theoretical foundation of quantum learning is required.

97 MATHEMATICS AND COMPUTING↗

A Bayesian Integration Model of High-Throughput Proteomics and Metabolomics Data for Improved Early Detection of Microbial Infections

High-throughput (HTP) technologies offer the capability to evaluate the genome, proteome, and metabolome of organisms at a global scale. This opens up new opportunities to define complex signatures of disease that involve signals from multiple types of biomolecules. Integrating these data types however is difficult due to the heterogeneity of the data. We present a Bayesian approach to integration that uses posterior probabilities to assign class memberships to samples using individual and multiple data sources; these probabilities are based on lower level likelihood functions derived from standard statistical learning algorithms. We demonstrate this approach on microbial infections of mice, where the bronchial alveolar lavage fluid was analyzed by two HTP proteomic and one HTP metabolomic technologies. We demonstrate that integration of the three datasets improves classification accuracy to ~89% from the best individual dataset at ~83%. In addition, we present a new visualization tool called Visual Integration for Bayesian Evaluation (VIBE) that allows the user to observe classification accuracies at the class level and evaluate classification accuracies on any subset of available data types based on the posterior probability models defined for the individual and integrated data.

59 BASIC BIOLOGICAL SCIENCES↗

HIGH-RESOLUTION NEAR-INFRARED IMAGING OF SUBMILLIMETER GALAXIES

We present F110W ({approx}J) and F160W ({approx}H) observations of 10 submillimeter galaxies (SMGs) obtained with the Hubble Space Telescope's (HST's) NICMOS camera. Our targets have optical redshifts in the range 2.20 {<=} z {<=} 2.81 confirmed by millimeter CO or mid-IR spectroscopy, guaranteeing that the two bands sample the rest-frame optical with the Balmer break falling between them. Eight of ten are detected in both bands, while two are detected in F160W only. We study their F160W morphologies, applying a maximum-deblending detection algorithm to distinguish multiple- from single-component configurations, leading to reassessments for several objects. Based on our NICMOS imaging and/or previous dynamical evidence we identify five SMGs as multiple sources, which we interpret as merging systems. Additionally, we calculate morphological parameter asymmetry (A) and the Gini coefficient (G); thanks to our sample's limited redshift range we recover the trend that multiple-component, merger-like morphologies are reflected in higher asymmetries. We analyze the stellar populations of nine objects with F110W/F160W photometry, using archival HST optical data when available. For multiple systems, we are able to model the individual components that build up an SMG. With the available data we cannot discriminate among star formation histories, but we constrain stellar masses and mass ratios for merger-like SMG systems, obtaining a mean log (M{sub *}/M{sub Sun }) = 10.9 {+-} 0.2 for our full sample, with individual values log (M{sub *}/M{sub Sun }) {approx} 9.6-11.8. The morphologies and mass ratios of the least and most massive systems match the predictions of the major-merger and cold accretion SMG formation scenarios, respectively, suggesting that both channels may have a role in the population's origin.

79 ASTRONOMY AND ASTROPHYSICS↗

Sample Complexity of Power System State Estimation using Matrix Completion: Preprint

In this paper, we propose an analytical framework to quantify the amount of data samples needed to obtain accurate state estimation in a power system-a problem known as \emph{sample complexity} analysis in computer science. Motivated by the increasing adoption of distributed energy resources into the distribution-level grids, it becomes imperative to estimate the state of distribution grids in order to ensure stable operation. Traditional power system state estimation techniques mainly focus on the transmission network which involve solving an overdetermined system and eliminating bad data. However, distribution networks are typically \emph{underdetermined} due to the large number of connection points and high cost of pervasive installation of measurement devices. In this paper, we consider the recently proposed state-estimation method for underdetermined systems that is based on \emph{matrix completion}. In particular, a \emph{constrained} matrix completion algorithm was proposed, wherein the standard matrix completion problem is augmented with additional equality constraints representing the physics (namely power-flow constraints). We analyze the sample complexity of this general method by proving an upper bound on the sample complexity that depends directly on the properties of these constraints that can lower number of needed samples as compared to the unconstrained problem. To demonstrate the improvement that the constraints add to state estimation, we test the method on a 141-bus distribution network case study and compare it to the traditional least squares minimization state estimation method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A study on fast digital discrimination of neutron and gamma-ray for improvement neutron emission profile measurement

Neutron and γ-ray (n-γ) discrimination with a digital signal processing system has been used to measure the neutron emission profile in magnetic confinement fusion devices. However, a sampling rate must be set low to extend the measurement time because the memory storage is limited. Time jitter decreases a discrimination quality due to a low sampling rate. As described in this paper, a new charge comparison method was developed. Furthermore, automatic n-γ discrimination method was examined using a probabilistic approach. Analysis results were investigated using the figure of merit. Results show that the discrimination quality was improved. Automatic discrimination was applied using the EM algorithm and k-means algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficient antisymmetrization algorithm for the partially correlated wave functions in the free complement-local Schrödinger equation method

We propose here fast antisymmetrization procedures for the partially correlated wave functions that appear in the free complement-local Schrödinger equation (FC-LSE) method. Pre-analysis of the correlation diagram, referred to as dot analysis, combined with the determinant update technique based on the Laplace expansion, drastically reduces the orders of the antisymmetrization computations. When the complement functions include only up to single-correlated terms, the order of computations is O(N{sup 3}), which is the same as the non-correlated case. Similar acceleration is obtained for general correlated functions as a result of dot analysis. This algorithm has been successfully used in our laboratory in actual FC-LSE calculations for accurately solving the many-electron Schrödinger equations of atoms and molecules. The proposed method is general and applicable to the sampling-type methodology of other partially correlated wave functions like those in the quantum Monte Carlo and modern Hylleraas-type methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

XFEL OSCILLATOR SIMULATION INCLUDING ANGLE-DEPENDENT CRYSTAL REFLECTIVITY

The oscillator package within the GINGER FEL simulation code has now been extended to include angle-dependent reflectivity properties of Bragg crystals. Previously, the package was modified to include frequencydependent reflectivity in order to model x-ray FEL oscillators from start-up from shot noise through to saturation. We present a summary of the algorithms used for modeling the crystal reflectivity and radiation propagation outside the undulator, discussing various numerical issues relevant to the domain of high Fresnel number and efficient Hankel transforms. We give some sample XFEL-O simulation results obtained with the angle-dependent reflectivity model, with particular attention directed to the longitudinal and transverse coherence of the radiation output.

43 PARTICLE ACCELERATORS↗

Hyperspectral Image Classification Using Graph Clustering Methods

Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nyström extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes.

47 OTHER INSTRUMENTATION↗

New graph-neural-network flavor tagger for Belle II and measurement of sin 2⁢𝜙 1 in 𝐵 0 → 𝐽/𝜓⁢𝐾$^0_ S$ decays

We present GFlaT, a new algorithm that uses a graph-neural-network to determine the flavor of neutral 𝐵 mesons produced in ϒ⁡(4⁢𝑆) decays. It improves previous algorithms by using the information from all charged final-state particles and the relations between them. We evaluate its performance using 𝐵 decays to flavor-specific hadronic final states reconstructed in a 362 fb −1 sample of electron-positron collisions collected at the ϒ⁡(4⁢𝑆) resonance with the Belle II detector at the SuperKEKB collider. We achieve an effective tagging efficiency of (37.40 ± 0.43 ± 0.36%), where the first uncertainty is statistical and the second systematic, which is 18% better than the previous Belle II algorithm. Demonstrating the algorithm, we use 𝐵 0 →𝐽/𝜓⁢𝐾$^0_ S$ decays to measure the mixing-induced and direct 𝐶⁢𝑃 violation parameters, 𝑆 = (0.724 ± 0.035 ± 0.009) and 𝐶 = (−0.035 ± 0.026 ± 0.029).

CP violation↗

Correcting for fibre assignment incompleteness in the DESI Bright Galaxy Survey

The Dark Energy Spectroscopic Instrument (DESI) Bright Galaxy Survey (BGS) will be a survey of bright, low-redshift galaxies, which is planned to cover an area of ~14000 square degrees in three passes. Each pass will cover the survey area with ~2000 pointings, each of area ~8 square degrees. The BGS is currently proposed to consist of a bright high priority sample to an r-band magnitude limit r ~ 19.5, with a fainter low priority sample to r ~ 20. The geometry of the DESI fibre positioners in the focal plane of the telescope affects the completeness of the survey and has a non-trivial impact on clustering measurements. Using a BGS mock catalogue, we demonstrate that completeness due to fibre assignment primarily depends on the surface density of galaxies. Completeness is high (>95 per cent) in low-density regions, but very low (<10 per cent) in the centre of massive clusters. We apply the pair inverse probability (PIP) weighting correction to clustering measurements from a BGS mock which has been through the fibre assignment algorithm. This method is only unbiased if it is possible to observe every galaxy pair. To expedite this, we randomly promote a small fraction of the fainter sample to be high priority, and dither the set of tile positions by a small angle. We show that inverse pair weighting combined with angular upweighting provides an unbiased correction to galaxy clustering measurements for the complete three pass survey, and also after one pass, which is highly incomplete.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient loading of reduced data ensembles produced at ORNL SNS/HFIR neutron time-of-flight facilities

We present algorithmic improvements to the loading operations of certain reduced data ensembles produced from neutron scattering experiments at Oak Ridge National Laboratory (ORNL) facilities. Ensembles from multiple measurements are required to cover a wide range of the phase space of a sample material of interest. They are stored using the standard NeXus schema on individual HDF5 files. This makes it a scalability challenge, as the number of experiments stored increases in a single ensemble file. The present work follows up on our previous efforts on data management algorithms, to address identified input output (I/O) bottlenecks in Mantid, an open-source data analysis framework used across several neutron science facilities around the world. We reuse an in-memory binary-tree metadata index that resembles data access patterns, to provide a scalable search and extraction mechanism. In addition, several memory operations are refactored and optimized for the current common use cases, ranging most frequently from 10 to 180, and up to 360 separate measurement configurations. Results from this work show consistent speed ups in wall-clock time on the Mantid LoadMD routine, ranging from 19% to 23% on average, on ORNL production computing systems. The latter depends on the complexity of the targeted instrument-specific data and the system I/O and compute variability for the shared computational resources available to users of ORNL’s Spallation Neutron Source (SNS) and the High Flux Isotope Reactor (HFIR) instruments. Nevertheless, we continue to highlight the need for more research to address reduction challenges as experimental data volumes, user time and processing costs increase.

Godoy, William↗

Massively parallel Monte Carlo for many-particle simulations on GPUs

Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little attention because of the inherent serial nature of the statistical sampling. In this paper, we present a massively parallel method that obeys detailed balance and implement it for a system of hard disks on the GPU. We reproduce results of serial high-precision Monte Carlo runs to verify the method. This is a good test case because the hard disk equation of state over the range where the liquid transforms into the solid is particularly sensitive to small deviations away from the balance conditions. On a Tesla K20, our GPU implementation executes over one billion trial moves per second, which is 148 times faster than on a single Intel Xeon E5540 CPU core, enables 27 times better performance per dollar, and cuts energy usage by a factor of 13. With this improved performance we are able to calculate the equation of state for systems of up to one million hard disks. These large system sizes are required in order to probe the nature of the melting transition, which has been debated for the last forty years. In this paper we present the details of our computational method, and discuss the thermodynamics of hard disks separately in a companion paper.

97 MATHEMATICS AND COMPUTING↗

Novel Proppant Logging Technique for Infill Drilling of Unconventional Shale Wells

Summary During the development of an unconventional play, wells are drilled and completed in batches, and depending on the development plans, current and expected energy market trends, as well as other developmental considerations, new wells are drilled and hydraulically fractured later near existing producing laterals. This creates challenges in terms of optimizing resource recovery and reducing interwell communication. A novel approach is proposed that utilizes systematic composite sampling and analysis of drilling mud returns to look for and quantitatively identify sand particles. The workflow involves cleaning, drying, and segregation of samples into sizes of interest to us (size distribution of pumped proppant in offset parent wells). These samples are imaged at a very high resolution and analyzed for grains using characteristic optical imaging properties to classify proppant sand particles using computer vision algorithms. Further analysis, such as elemental compositional analysis, is used to validate the results from the imaging workflow. We present a case study from the Permian Basin, where a new child well was used as a test case to prove this technology at the Hydraulic Fracturing Test Site (HFTS-2) in Delaware Basin. We introduce new proppant parameters that help identify sustained proppant zones vs. localized propped fractures. We have used additional diagnostics and data collected at the test site to validate observations from the proppant log and have successfully interpreted significantly propped vs. unpropped zones. A key finding from this test has been the significant proppant transport distances observed away from parent wells. Observable proppant was found at a lateral distance of approximately 425 m for one set of parent wells and more than 915 m for another set of parent wells. While a major limitation of this technique is the sampling rate, given adequate sampling, the proposed technology represents a systematic and one-of-a-kind interpretation of spatial proppant distribution while drilling infill wells. It provides us with unique opportunities to better understand the current state of the reservoir being targeted, including zones that are likely highly drained relative to others, and how the planned hydraulic fracturing of child wells can be improved.

Energy & Fuels↗

Nuclear Forensics for Irradiated Materials using Kernel Regression Models

The ultimate purpose of nuclear forensics is to locate the origin of nuclear and other radioactive materials out of regulatory control used in nuclear security events such as classical forensics. For this purpose, some specific characteristics of interdicted materials (referred to as 'signatures') should be defined to compare the known sample database. In some cases, involved with irradiated material, the signatures could be specific amount of fission product inventory depending on reactor operational histories such as reactor type, initial enrichment, burn up rate of nuclear fuel and cooling period after irradiation in the reactor. In order to make inference model for irradiated material for nuclear forensics, we suggested 3 ways as follows; (i) analyzing ORIGEN produced nuclear substances for the fission product inventory, (ii) classifying the range of reactor type, (iii) predicting the operational history from the fission product inventory. In terms of nuclear substance analysis, the construction of spent fuel database has been internationally carried out since ITWG (Nuclear Smuggling International Technical Working Group) was established in 1995. However, enough sample data cannot be obtained in Korea to determine reactor type and operational histories because analyzing nuclear substances have been limited due to the international regulation. Thus, this study does not mention how to obtain mass or ratios of nuclides for the spent fuel. We just have generated simulation sample data as a fission product inventory using ORIGEN to construct spent fuel database. When unidentified radioactive materials are discovered, it is assumed that mass or ratios of the nuclides are analyzed by certain methods which are available in Korea as well as other countries. Then, a reactor type is determined, and finally, regression model can locate the origin or source of the radioactive materials by inferring operational histories using the fission product inventory. There are some studies on the classification of reactor type using statistical methods. As a part of predicting the operational history, this paper focuses on the development of spent fuel inference algorithm for nuclear forensics to estimate reactor operational histories that reflect characteristics of a reactor from the fission product inventory. The spent fuel inference algorithm for nuclear forensics has been developed on the basis of Kernel Regression (KR) which can conditionally generate the estimated output data by giving weight depending on geometric distance between sample data and input data. Also the KR which comprises Auto-Associative KR and Inferential KR have some benefits that can estimate only using data without assumption for specific physical model and re-learning process. Auto-associative KR (AAKR) was used to sort out outliers of input data and Inferential KR (IKR) was carried out to predict the operational histories for spent fuel. All of regression algorithms were performed in R programming tool. From the validation of both AAKR and IKR, it is expected that kernel regression has enough accuracy to be applied to nuclear forensics for spent fuel. Once the nuclear substance is measured to fill the fission product inventory with a certain reactor type, this kernel regression algorithm would predict the operational histories of spent fuel with high accuracy. Finally, this information is expected to be useful to find the origin of irradiated materials. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗