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 775 records · Page 43

A k-mer based approach for classifying viruses without taxonomy identifies viral associations in human autism and plant microbiomes

Viruses are an underrepresented taxa in the study and identification of microbiome constituents; however, they play an essential role in health, microbiome regulation, and transfer of genetic material. Only a few thousand viruses have been isolated, sequenced, and assigned a taxonomy, which limits the ability to identify and quantify viruses in the microbiome. Additionally, the vast diversity of viruses represents a challenge for classification, not only in constructing a viral taxonomy, but also in identifying similarities between a virus’ genotype and its phenotype. However, the diversity of viral sequences can be leveraged to classify their sequences in metagenomic and metatranscriptomic samples, even if they do not have a taxonomy. To identify and quantify viruses in transcriptomic and genomic samples, we developed a dynamic programming algorithm for creating a classification tree out of 715,672 metagenome viruses. To create the classification tree, we clustered proportional similarity scores generated from the k-mer profiles of each of the metagenome viruses to create a database of metagenomic viruses. The resulting Kraken2 database of the metagenomic viruses can be found here: https://www.osti.gov/biblio/1615774 and is compatible with Kraken2. We then integrated the viral classification database with databases created with genomes from NCBI for use with ParaKraken (a parallelized version of Kraken provided in Supplemental Zip 1), a metagenomic/transcriptomic classifier. To illustrate the breadth of our utility for classifying metagenome viruses, we analyzed data from a plant metagenome study identifying genotypic and compartment specific differences between two Populus genotypes in three different compartments. We also identified a significant increase in abundance of eight viral sequences in post mortem brains in a human metatranscriptome study comparing Autism Spectrum Disorder patients and controls. We also show the potential accuracy for classifying viruses by utilizing both the JGI and NCBI viral databases to identify the uniqueness of viral sequences. Finally, we validate the accuracy of viral classification with NCBI databases containing viruses with taxonomy to identify pathogenic viruses in known COVID-19 and cassava brown streak virus infection samples. Our method represents the compulsory first step in better understanding the role of viruses in the microbiome by allowing for a more complete identification of sequences without taxonomy. Better classification of viruses will improve identifying associations between viruses and their hosts as well as viruses and other microbiome members. Despite the lack of taxonomy, this database of metagenomic viruses can be used with any tool that utilizes a taxonomy, such as Kraken, for accurate classification of viruses.

59 BASIC BIOLOGICAL SCIENCES↗

Digital Filter Separates Signal From Noise

Variance of signal-estimation error minimized. Mathematical technique extracts best estimates of signal component from periodic digital samples of signal plus noise. Technique combines Kalman- and smoothingfilter algorithms to minimize mean-square estimation error based on past, present, and predicted samples of signal plus noise. Technique useful in image analysis and other applications involving processing of noisy signals.

Lear, W. M.↗

Cosmic voids and void lensing in the Dark Energy Survey science verification data

Galaxies and their dark matter halos populate a complicated filamentary network around large, nearly empty regions known as cosmic voids. Cosmic voids are usually identified in spectroscopic galaxy surveys, where 3D information about the large-scale structure of the Universe is available. Although an increasing amount of photometric data is being produced, its potential for void studies is limited since photometric redshifts induce line-of-sight position errors of ~50 Mpc/h or more that can render many voids undetectable. In this paper we present a new void finder designed for photometric surveys, validate it using simulations, and apply it to the high-quality photo-z redMaGiC galaxy sample of the Dark Energy Survey Science Verification (DES-SV) data. The algorithm works by projecting galaxies into 2D slices and finding voids in the smoothed 2D galaxy density field of the slice. Fixing the line-of-sight size of the slices to be at least twice the photo- z scatter, the number of voids found in these projected slices of simulated spectroscopic and photometric galaxy catalogs is within 20% for all transverse void sizes, and indistinguishable for the largest voids of radius ~70 Mpc/h and larger. The positions, radii, and projected galaxy profiles of photometric voids also accurately match the spectroscopic void sample. Applying the algorithm to the DES-SV data in the redshift range 0.2 < z < 0.8 , we identify 87 voids with comoving radii spanning the range 18-120 Mpc/h, and carry out a stacked weak lensing measurement. With a significance of 4.4σ, the lensing measurement confirms the voids are truly underdense in the matter field and hence not a product of Poisson noise, tracer density effects or systematics in the data. In conclusion, it also demonstrates, for the first time in real data, the viability of void lensing studies in photometric surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Digital Electronics For The Versatile Array Of Neutron Detectors At Low Energies

A {chi}{sup 2} minimization algorithm has been developed to extract sub-sampling-time information from digitized waveforms, to be used to instrument the future Versatile Array of Neutron Detectors at Low energies. The algorithm performance has been characterized with a fast Arbitrary Function Generator, obtaining time resolution better than 1 ns for signals of amplitudes between 50 mV and 1V, with negligible walk in the whole range. The proof-of-principle measurement of the beta-delayed neutron emission from {sup 89}Br indicates a resolution of 1 ns can be achieved in realistic experimental conditions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sampling Errors in Monthly Rainfall Totals for TRMM and SSM/I, Based on Statistics of Retrieved Rain Rates and Simple Models

Estimates from TRMM satellite data of monthly total rainfall over an area are subject to substantial sampling errors due to the limited number of visits to the area by the satellite during the month. Quantitative comparisons of TRMM averages with data collected by other satellites and by ground-based systems require some estimate of the size of this sampling error. A method of estimating this sampling error based on the actual statistics of the TRMM observations and on some modeling work has been developed. "Sampling error" in TRMM monthly averages is defined here relative to the monthly total a hypothetical satellite permanently stationed above the area would have reported. "Sampling error" therefore includes contributions from the random and systematic errors introduced by the satellite remote sensing system. As part of our long-term goal of providing error estimates for each grid point accessible to the TRMM instruments, sampling error estimates for TRMM based on rain retrievals from TRMM microwave (TMI) data are compared for different times of the year and different oceanic areas (to minimize changes in the statistics due to algorithmic differences over land and ocean). Changes in sampling error estimates due to changes in rain statistics due 1) to evolution of the official algorithms used to process the data, and 2) differences from other remote sensing systems such as the Defense Meteorological Satellite Program (DMSP) Special Sensor Microwave/Imager (SSM/I), are analyzed.

Bell, Thomas L.↗

Hyperspectral imaging for real-time waste materials characterization and recovery using endmember extraction and abundance detection

Hyperspectral imaging, combined with advanced spectral unmixing techniques and artificial intelligence, offers a powerful solution for improving material identification and classification. Here, this study evaluates the effectiveness of the pixel purity index and the sequential maximum angle convex cone algorithms in extracting and validating spectral signatures from pure samples of paper components (cellulose and lignin) and plastic (polypropylene). Principal-component analysis showed that both algorithms captured nearly all relevant variance for the tested materials. Spectral signatures were compared using the spectral angle mapper, revealing high similarity in the short-wave infrared region and greater variability in the visible near-infrared range. The methodology was then applied to a disposable coffee cup to detect and quantify mixed materials, accurately estimating material abundance and object area with less than 1% error. This approach enhances material classification, supporting product verification, quality control, and automated sorting for sustainable waste management and resource recovery.

36 MATERIALS SCIENCE↗

A Dark Target research aerosol algorithm for MODIS observations over eastern China: increasing coverage while maintaining accuracy at high aerosol loading

Satellite aerosol products such as the Dark Target (DT) produced from the MODerate resolution Imaging Spectroradiometer (MODIS) are useful for monitoring the progress of air pollution. Unfortunately, the DT often fails to retrieve during the heaviest aerosol events as well as the more moderate events in winter. Some of the literature at-tributes this lack of retrieval to the cloud mask. However, we found this lack of retrieval is mainly traced to thresholds used for masking of inland water and snow. Modifications to these two masks greatly increase 50 % of the retrievals of aerosol optical depth at 0.55 μm (AOD) greater than 1.0. The “extra”-high-AOD retrievals tend to be biased when com-pared with a ground-based sun photometer (AErosol RObotic NETwork, AERONET). Reducing bias in new retrievals re-quires two additional steps. One is an update to the assumed aerosol optical properties (aerosol model); the haze in this region is both less absorbing and lower in altitude than what is assumed in the global algorithm. The second is account-ing for the scale height of the aerosol, specifically that the heavy-aerosol events in the region are much closer to the surface than what is assumed by the global DT algorithm. The resulting combination of modified masking thresholds, new aerosol model, and lower aerosol layer scale height was applied to 3 months of MODIS observations (January–March2013) over eastern China. After these two additional steps are implemented, the significant increase in new retrievals introduces no overall bias at a high-AOD regime but does degrade other overall validation statistics. We also find that the research algorithm is able to identify additional pollution events that AERONET instruments may not due to different spatial sampling. Mean AOD retrieved from the re-search algorithm increases from 0.11 to 0.18 compared to values calculated from the operational DT algorithm during January to March of 2013 over the study area. But near Beijing, where the severe pollution occurs, the new algorithm increases AOD by as much as 3.0 for each 0.5°grid box over the previous operational-algorithm values.

Dark Target↗

Modern Numerical Methods for Classical Sampled System Analysis-SAMSAN

SAMSAN aids control-system analyst by providing self-consistent set of computer algorithms that support large-order control-system design and evaluation studies, with emphasis placed on sampled system analysis. Program provides set of algorithms readily integrated for solving control-system problems.

Frisch, H. P.↗

Tractable minor-free generalization of planar zero-field Ising models

In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.

97 MATHEMATICS AND COMPUTING↗

Utilizing Adjoint-Based Error Estimates for Surrogate Models to Accurately Predict Probabilities of Events

In thist study, we develop a procedure to utilize error estimates for samples of a surrogate model to compute robust upper and lower bounds on estimates of probabilities of events. We show that these error estimates can also be used in an adaptive algorithm to simultaneously reduce the computational cost and increase the accuracy in estimating probabilities of events using computationally expensive high-fidelity models. Specifically, we introduce the notion of reliability of a sample of a surrogate model, and we prove that utilizing the surrogate model for the reliable samples and the high-fidelity model for the unreliable samples gives precisely the same estimate of the probability of the output event as would be obtained by evaluation of the original model for each sample. The adaptive algorithm uses the additional evaluations of the high-fidelity model for the unreliable samples to locally improve the surrogate model near the limit state, which significantly reduces the number of high-fidelity model evaluations as the limit state is resolved. Numerical results based on a recently developed adjoint-based approach for estimating the error in samples of a surrogate are provided to demonstrate (1) the robustness of the bounds on the probability of an event, and (2) that the adaptive enhancement algorithm provides a more accurate estimate of the probability of the QoI event than standard response surface approximation methods at a lower computational cost.

97 MATHEMATICS AND COMPUTING↗

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Poster - 14: Batch Effect Reduction in in-vitro Raman Microscopic Radiosensitivity Study Using Ovarian Cancer Cells

Purpose: To improve classification by reducing batch effect in samples from the ovarian carcinoma cell lines A2780s (parental wild type) and A2780cp (cisplatin cross-radio-resistant), before, right after, and 24 hours after irradiation to 10Gy. Methods: Spectra were acquired with a home built confocal Raman microscope in 3 distinct runs of six samples: unirradiated s&cp (control pair), then 0h and 24h after irradiation. The Raman spectra were noise reduced, then background subtracted with SMIRF algorithm. ∼35 cell spectra were collected from each sample in 1024 channels from 700cm-1 to 1618cm-1. The spectra were analyzed by regularized multiclass LDA. For feature reduction the spectra were grouped into 3 overlapping group pairs: s-cp, 0Gy–10Gy0h and 0Gy10–Gy24h. The three features, the three differences of the mean spectra were mapped to the analysis sub-space by the inverse regularized covariance matrix. The batch effect noticeably confounded the dose and time effect. Results: To remove the batch effect, the 2+2=4D subspace extended by the covariance matrix of the means of the 0Gy control groups was subtracted from the spectra of each sample. Repeating the analysis on the spectra with the control group variability removed, the batch effect was dramatically reduced in the dose and time directions enabling sharp linear discrimination. The cell type classification also improved. Conclusions: We identified a efficient batch effect removal technique crucial to the applicability of Raman microscopy to radiosensitivity studies both on cell cultures and potential clinical diagnostic applications.

60 APPLIED LIFE SCIENCES↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

Line curvature algorithm in laser ektacytometry of red blood cells

The iso-intensity line curvature algorithm in laser ektacytometry of red blood cells is investigated by numerical simulation. The algorithm is designed to measure the average deformability, as well as the width and asymmetry of the red blood cell deformability distribution in a blood sample under study. The accuracy and scope of the algorithm are determined. Using a bimodal ensemble as an example, the possibility of determining the fraction of weakly deformable red blood cells in a blood sample by laser ektacytometry is demonstrated. (laser medicine)

60 APPLIED LIFE SCIENCES↗

An algorithm for detecting and quantifying disturbance and recovery in high-frequency time series

Determining when a disturbance has occurred, its severity, and when the system recovered, is important to numerous questions in the aquatic sciences. This problem can be conceptualized as the timing and degree of perturbation from a typical state, and when the system returns to that typical state. We present an algorithm for detecting disturbance and recovery designed for high-frequency time series, e.g., data produced by automated sampling devices in instrumented buoys and flux towers. The algorithm quantifies differences in the empirical cumulative distribution functions of moving windows over reference and evaluation periods, and is sensitive to changes in the mean, variance, and higher statistical moments. Tests on simulated data show it accurately identifies disturbance and recovery. Three case studies illustrate the application of our algorithm in different empirical settings. A case study on dissolved oxygen in a Florida, USA estuary following a hurricane identified the disturbance and recovery 73 d later. A case study on air temperature and net ecosystem exchange in the Florida everglades identified cold snaps coinciding with periods of reduced carbon uptake. A case study on rotifer abundance following zebra mussel invasion in the Hudson River, NY showed rotifer collapse following invasion and recovery over a decade later. Methods such as ours can improve understanding response to disturbance and facilitate comparative and synthetic study of disturbance impacts across ecosystems.

54 ENVIRONMENTAL SCIENCES↗

Resolution-adapted recombination of structural features significantly improves sampling in restraint-guided structure calculation

Recent work has shown that NMR structures can be determined by integrating sparse NMR data with structure prediction methods such as Rosetta. The experimental data serve to guide the search for the lowest energy state towards the deep minimum at the native state which is frequently missed in Rosetta de novo structure calculations. However, as the protein size increases, sampling again becomes limiting; for example, the standard Rosetta protocol involving Monte Carlo fragment insertion starting from an extended chain fails to converge for proteins over 150 amino acids even with guidance from chemical shifts (CS-Rosetta) and other NMR data. The primary limitation of this protocol—that every folding trajectory is completely independent of every other—was recently overcome with the development of a new approach involving resolution-adapted structural recombination (RASREC). Here we describe the RASREC approach in detail and compare it to standard CS-Rosetta. We show that the improved sampling of RASREC is essential in obtaining accurate structures over a benchmark set of 11 proteins in the 15-25 kDa size range using chemical shifts, backbone RDCs and H N -H N NOE data; in a number of cases the improved sampling methodology makes a larger contribution than incorporation of additional experimental data. Experimental data are invaluable for guiding sampling to the vicinity of the global energy minimum, but for larger proteins, the standard Rosetta fold-from-extended-chain protocol does not converge on the native minimum even with experimental data and the more powerful RASREC approach is necessary to converge to accurate solutions.

59 BASIC BIOLOGICAL SCIENCES↗

Automated path planning for functionally graded materials considering phase stability and solidification behavior: Application to the Mo-Nb-Ta-Ti system

Functionally graded materials have the potential to improve upon monolithic parts by locally tailoring compositions to surrounding environmental conditions. Difficulties arise when designing composition gradients as incompatible materials can result in detrimental phase formation and failure of the gradient joint. As many alloys are multi-component, designing a composition gradient free of detrimental phases is difficult due to the large composition space available to explore. A framework was developed that improves the path planning algorithm and surrogate models with adaptive sampling schemes specific to their problem definition. A cost function was created to minimize a property (such as cracking susceptibility) along a path. This framework was applied to the Mo-Nb-Ta-Ti system as a case study to showcase the efficiency in building the surrogate models and in iterating different optimal compositionally graded paths.

36 MATERIALS SCIENCE↗

Radiosensitivity Differences Between Liver Metastases Based on Primary Histology Suggest Implications for Clinical Outcomes After Stereotactic Body Radiation Therapy

Purpose/Objectives: Evidence from the management of oligometastases with stereotactic body radiation therapy (SBRT) reveals differences in outcomes based on primary histology. We have previously identified a multigene expression index for tumor radiosensitivity (RSI) with validation in multiple independent cohorts. In this study, we assessed RSI in liver metastases and assessed our clinical outcomes after SBRT based on primary histology. Methods and Materials: Patients were identified from our prospective, observational protocol. The previously tested RSI 10 gene assay was run on samples and calculated using the published algorithm. An independent cohort of 33 patients with 38 liver metastases treated with SBRT was used for clinical correlation. Results: A total of 372 unique metastatic liver lesions were identified for inclusion from our prospective, institutional metadata pool. The most common primary histologies for liver metastases were colorectal adenocarcinoma (n=314, 84.4%), breast adenocarcinoma (n=12, 3.2%), and pancreas neuroendocrine (n=11, 3%). There were significant differences in RSI of liver metastases based on histology. The median RSIs for liver metastases in descending order of radioresistance were gastrointestinal stromal tumor (0.57), melanoma (0.53), colorectal neuroendocrine (0.46), pancreas neuroendocrine (0.44), colorectal adenocarcinoma (0.43), breast adenocarcinoma (0.35), lung adenocarcinoma (0.31), pancreas adenocarcinoma (0.27), anal squamous cell cancer (0.22), and small intestine neuroendocrine (0.21) (P<.0001). The 12-month and 24-month Kaplan-Meier rates of local control (LC) for colorectal lesions from the independent clinical cohort were 79% and 59%, compared with 100% for noncolorectal lesions (P=.019), respectively. Conclusions: In this analysis, we found significant differences based on primary histology. This study suggests that primary histology may be an important factor to consider in SBRT radiation dose selection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗