Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Labeling”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Sneaking in SpyCatcher using cell penetrating peptides for in vivo imaging

Abstract In vivo imaging of protein complexes is a powerful method for understanding the underlying biological function of these key biomolecules. Though the engineering of small, high affinity nanobodies have become more prevalent, the off-rates of these tags may result in incomplete or partial labeling of proteins in live cells. The SpyCatcher003 and SpyTag split protein system allow for irreversible, covalent binding to a short target peptide unlike nanobody-affinity based probes. However, delivering these tags into a cell without disrupting its normal function is a key challenge. Cell penetrating peptides (CPPs) are short peptide sequences that facilitate the transduction of otherwise membrane-impermeable ‘cargo’ , such as proteins, into cells. Here we report on our efforts to engineer and characterize CPP-SpyCatcher003 fusions as modular imaging probes. We selected three CPPs, CUPID, Pentratin, and pVEC, to engineer fusion protein probes for superresolution microscopy, with the aim to eliminate prior permeabilization treatments that could introduce imaging artifacts. We find that fusing the CPP sequences to SpyCatcher003 resulted in dimer and multimer formation as determined by size exclusion chromatography, dynamic light scattering, and SDS resistant dimers on SDS-PAGE gels. By isolating and labeling the monomeric forms of the engineered protein, we show these constructs retained their ability to bind SpyTag and all three CPP sequences remain membrane active, as assessed by CD spectroscopy in the presence of SDS detergent. Using fluorescence and super resolution Lattice structured illumination microscopy (Lattice SIM) imaging we show that the CPPs did not enhance uptake of SpyCatcher by E. coli, however with Caulobacter crescentus cells, we show that Penetratin, and to a lesser degree CUPID, does enhance uptake. Our results demonstrate the ability of the CPP-SpyCatcher003 to label targets within living cells, providing the groundwork for using split protein systems for targeted in vivo imaging.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Coincidence anomaly detection for unsupervised locating of edge localized modes in the DIII-D tokamak dataset

Using supervised learning to train a machine learning model to predict an on-coming edge localized mode (ELM) requires a large number of labeled samples. Creating an appropriate data set from the very large database of discharges at a long-running tokamak, such as DIII-D, would be a very time-consuming process for a human. Considering this need and difficulty, we use coincidence anomaly detection, an unsupervised learning technique, to train an ELM-identifier to identify and label ELMs in the DIII-D discharge database. This ELM-identifier shows, simultaneously, a precision of 0.68 and a recall of 0.63 (AUC is 0.73) on identifying ELMs in example time series pulled from thousands of discharges spanning five years. In a test set of 50 discharges, the algorithm finds over 26 thousand ELM candidates, more than 5 times the existing catalog of ELMs labeled by humans.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

BioADAPT-MRC: adversarial learning-based domain adaptation improves biomedical machine reading comprehension task

ABSTRACT Motivation Biomedical machine reading comprehension (biomedical-MRC) aims to comprehend complex biomedical narratives and assist healthcare professionals in retrieving information from them. The high performance of modern neural network-based MRC systems depends on high-quality, large-scale, human-annotated training datasets. In the biomedical domain, a crucial challenge in creating such datasets is the requirement for domain knowledge, inducing the scarcity of labeled data and the need for transfer learning from the labeled general-purpose (source) domain to the biomedical (target) domain. However, there is a discrepancy in marginal distributions between the general-purpose and biomedical domains due to the variances in topics. Therefore, direct-transferring of learned representations from a model trained on a general-purpose domain to the biomedical domain can hurt the model’s performance. Results We present an adversarial learning-based domain adaptation framework for the biomedical machine reading comprehension task (BioADAPT-MRC), a neural network-based method to address the discrepancies in the marginal distributions between the general and biomedical domain datasets. BioADAPT-MRC relaxes the need for generating pseudo labels for training a well-performing biomedical-MRC model. We extensively evaluate the performance of BioADAPT-MRC by comparing it with the best existing methods on three widely used benchmark biomedical-MRC datasets—BioASQ-7b, BioASQ-8b and BioASQ-9b. Our results suggest that without using any synthetic or human-annotated data from the biomedical domain, BioADAPT-MRC can achieve state-of-the-art performance on these datasets. Availability and implementation BioADAPT-MRC is freely available as an open-source project at https://github.com/mmahbub/BioADAPT-MRC. Supplementary information Supplementary data are available at Bioinformatics online.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Escherichia coli amino acid auxotrophic expression host strains for investigating protein structure–function relationships

Abstract A set of C43(DE3) and BL21(DE3) Escherichia coli host strains that are auxotrophic for various amino acids is briefly reviewed. These strains require the addition of a defined set of one or more amino acids in the growth medium, and have been specifically designed for overproduction of membrane or water-soluble proteins selectively labelled with stable isotopes, such as 2H, 13C and 15N. The strains described here are available for use and have been deposited into public strain banks. Although they cannot fully eliminate the possibility of isotope dilution and mixing, metabolic scrambling of the different amino acid types can be minimized through a careful consideration of the bacterial metabolic pathways. The use of a suitable auxotrophic expression host strain with an appropriately isotopically labelled growth medium ensures high levels of isotope labelling efficiency as well as selectivity for providing deeper insight into protein structure–function relationships.

Biochemistry & Molecular Biology↗
DOE OSTI2022

Practical galaxy morphology tools from deep supervised representation learning

Astronomers have typically set out to solve supervised machine learning problems by creating their own representations from scratch. We show that deep learning models trained to answer every Galaxy Zoo DECaLS question learn meaningful semantic representations of galaxies that are useful for new tasks on which the models were never trained. We exploit these representations to outperform several recent approaches at practical tasks crucial for investigating large galaxy samples. The first task is identifying galaxies of similar morphology to a query galaxy. Given a single galaxy assigned a free text tag by humans (e.g. ‘#diffuse’), we can find galaxies matching that tag for most tags. The second task is identifying the most interesting anomalies to a particular researcher. Our approach is 100 per cent accurate at identifying the most interesting 100 anomalies (as judged by Galaxy Zoo 2 volunteers). The third task is adapting a model to solve a new task using only a small number of newly labelled galaxies. Models fine-tuned from our representation are better able to identify ring galaxies than models fine-tuned from terrestrial images (ImageNet) or trained from scratch. We solve each task with very few new labels; either one (for the similarity search) or several hundred (for anomaly detection or fine-tuning). This challenges the longstanding view that deep supervised methods require new large labelled data sets for practical use in astronomy. To help the community benefit from our pretrained models, we release our fine-tuning code zoobot. Zoobot is accessible to researchers with no prior experience in deep learning.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Monomer-dimer tensor-network basis for qubit-regularized lattice gauge theories

Traditional SU⁡(𝑁) lattice gauge theories (LGTs) can be formulated using an orthonormal basis constructed from the irreducible representations (irreps) 𝑉 𝜆 of the SU⁡(𝑁) gauge symmetry. On a lattice, the elements of this basis are tensor networks comprising dimer tensors on the links labeled by a set of irreps {𝜆 ℓ } and monomer tensors on sites labeled by {𝜆 𝑠 }. These tensors naturally define a local site Hilbert space, ℋ$^𝑔_𝑠$, on which gauge transformations act. Gauss’s law introduces an additional index 𝛼 𝑠 =1,2,…,𝒟⁡(ℋ$^𝑔_𝑠$) that labels an orthonormal basis of the gauge-invariant subspace of ℋ$^𝑔_𝑠$. This monomer-dimer tensor-network (MDTN) basis, |{𝜆 𝑠 },{𝜆 ℓ },{𝛼 𝑠 }⟩, of the physical Hilbert space enables the construction of new qubit-regularized SU⁡(𝑁) gauge theories that are free of sign problems while preserving key features of traditional LGTs. Here, we investigate finite-temperature confinement-deconfinement transitions in a simple qubit-regularized SU(2) and SU(3) gauge theory in 𝑑 =2 and 𝑑 =3 spatial dimensions, formulated using the MDTN basis, and show that they reproduce the universal results of traditional LGTs at these transitions. Additionally, in 𝑑 =1, we demonstrate using a plaquette chain that the string tension at zero temperature can be continuously tuned to zero by adjusting a model parameter that plays the role of the gauge coupling in traditional LGTs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Convolutional Variational Autoencoder-based Unsupervised Learning for Power Systems Faults

Classification of power system event data is a growing need, particularly where non-protective relaying-based sensors are used to monitor grid performance. Given the high burden of obtaining event data with appropriate labeling, an unsupervised approach is highly valuable. This approach enables using event data without labeling, which is far easier to obtain. This paper presents an unsupervised learning method to classify and label transients observed in the distribution grid. A Convolutional Variational Autoencoder (CVAE) was developed for this purpose. We demonstrate the efficacy of our approach using the transient data generated from the simulations. The simulation data is used to train the CVAE that identifies different faults as different clusters in the latent space. The clusters are then used as the foundation model to categorize the real-world data.

Alam, Maksudul↗
DOE OSTI2022

A Novel Data Segmentation Method for Data-driven Phase Identification

This paper presents a smart meter phase identification algorithm for two cases: meter-phase-label-known and meter-phase-label-unknown. To improve the identification accuracy, a data segmentation method is proposed to exclude data segments that are collected when the voltage correlation between smart meters on the same phase is weakened. Then, using the selected data segments, a hierarchical clustering method is used to calculate the correlation distances and cluster the smart meters. If the phase labels are unknown, a Connected-Triple-based Similarity (CTS) method is adapted to further improve the phase identification accuracy of the ensemble clustering method. The methods are developed and tested on both synthetic and real feeder data sets. Here, simulation results show that the proposed phase identification algorithm outperforms the state-of-the-art methods in both accuracy and robustness.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Associative nitrogen fixation linked with three perennial bioenergy grasses in field and greenhouse experiments

Abstract Associative nitrogen (N 2 )‐fixation (ANF) by bacteria in the root‐zone of perennial bioenergy grasses has the potential to replace or supplement N fertilizer and support sustainable production of biomass, but its application in marginal ecosystems requires further evaluation. In this study, we first combined both greenhouse and field experiments, to explore the N 2 fixation effects of three temperate feedstocks Miscanthus × giganteus (giant miscanthus, Freedom), Panicum virgatum (switchgrass, Alamo), and Saccharum sp. (energycane, Ho 02‐147). In field studies across three growing seasons, plant and soil pools of candidate feedstocks were partially composed of N derived from the atmosphere (Ndfa). Energycane, giant miscanthus, and switchgrass were estimated to derive >30%, %Ndfa. Greenhouse studies were also performed to trace isotopically labeled 15 N 2 into plant biomass and soil pools. Evidence for Ndfa was detected in all three feedstock grasses (using reference 15 N of soil, chicory, and sorghum, δ 15 N~+7.0). Isotopically labeled 15 N 2 was traced into biomass (during grass elongation stage) and soil pools. Extrapolation of rates during the 24 hr labeling period to 50 days estimated 30%–55% of plant Ndfa, with the greatest Ndfa for energycane. The findings of the field natural abundance and greenhouse 15 N 2 feeding experiments provided complementary evidence that perennial bioenergy grasses have the potential to support relatively high rates of ANF, and accumulate diazotroph‐derived N into biomass when grown on non‐fertilized soil.

09 BIOMASS FUELS↗
DOE OSTI2026

Hydrazinoacetic acid is a biosynthetic precursor of the bacterially produced nitramine, N -nitroglycine

Nitramines [R(R′)N–NO 2 ; R,R′=H or alkyl] are valuable synthetic products, but knowledge of the biosynthetic processes that generate these compounds is limited. This work sought to elucidate the biosynthesis of a nitramine natural product, N-nitroglycine (NNG) by Streptomyces noursei . Stable isotope studies showed that S. noursei cells supplemented with L-(ε- 15 N)lysine, ( 15 N)glycine, or ( 13 C)hydrazinoacetic acid (HAA) incorporated 67%, 88%, and 67% of the isotope label into NNG, respectively, indicating that these compounds are biosynthetic precursors of NNG. Liquid chromatography coupled tandem mass spectrometry (LC-MS/MS) of 15 N-Lys-labeled NNG confirmed that the nitro nitrogen of NNG originates from Lys. Bioinformatics analysis of the S. noursei genome showed evidence for a biosynthetic gene cluster (BGC) that contained machinery for HAA biosynthesis ( nngKLM ), consistent with the results of the isotope labeling. In vitro reconstitution of the gene products produced HAA. The borders of this BGC were defined by cross-referencing the predicted BGC with previously published differential proteomics data. Furthermore, we show that azaserine is produced alongside NNG in S. noursei cultures, linking the two biosynthetic pathways via a proposed nitrosamine biosynthetic intermediate. Finally, the oxygen balance for NNG is −20.2% for the formation of carbon dioxide (CO 2 ), which is comparable to that of hexahydro-1,3,5- trinitro-1,3,5-triazene (common name: RDX; −21.6%). Crystal structure data of NNG indicate that the unit crystalizes as a pure material, not a hydrate, suggesting a favorable energetic crystallization phase. The combined results suggest a route that, with further development, could lead to sustainable production of energetic nitramines via synthetic biology or biocatalytic approaches.

biosynthesis↗
DOE OSTI2020

Development of Strong Anaerobic Fluorescent Reporters for Clostridium acetobutylicum and Clostridium ljungdahlii Using HaloTag and SNAP-tag Proteins

One of the biggest limitations in the study and engineering of anaerobic Clostridium organisms is the lack of strong fluorescent reporters capable of strong and real-time fluorescence. Recently, we developed a strong fluorescent reporter system for Clostridium organisms based on the FAST protein. Here, we report the development of two new strong fluorescent reporter systems for Clostridium organisms based on the HaloTag and SNAP-tag proteins, which produce strong fluorescent signals when covalently bound to fluorogenic ligands. These new fluorescent reporters are orthogonal to the FAST ligands and to each other, allowing for simultaneous labeling and visualization. We used HaloTag and SNAP-tag to label the strictly anaerobic organisms Clostridium acetobutylicum and Clostridium ljungdahlii. We have also identified a new strong promoter for protein expression in C. acetobutylicum, based on the phosphotransacetylase gene (pta) from C. ljungdahlii. Furthermore, the HaloTag and the SNAP-tag, in combination with the previously described FAST system, were successfully used to measure cell populations in bacterial mixed cultures and showed the simultaneous orthogonal labeling of HaloTag and SNAP-tag together with the FAST protein reporter. Finally, we show the expression of recombinant fusion protein of FAST and the ZapA division protein (from C. acetobutylicum) in C. ljungdahlii. The availability of multiple strong fluorescent reporters is a major addition to the genetic toolkit of Here, Clostridium and other anaerobes that will lead to better understanding of these unique organisms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Quantitative Stable-Isotope Probing (qSIP) with Metagenomics Links Microbial Physiology and Activity to Soil Moisture in Mediterranean-Climate Grassland Ecosystems

The growth and physiology of soil microorganisms, which play vital roles in biogeochemical cycling, are shaped by both current and historical soil environmental conditions. Here, we developed and applied a genome-resolved metagenomic implementation of quantitative stable isotope probing (qSIP) with an H 2 18 O labeling experiment to identify actively growing soil microorganisms and their genomic capacities. qSIP enabled measurement of taxon-specific growth because isotopic incorporation into microbial DNA requires production of new genome copies. We studied three Mediterranean grassland soils across a rainfall gradient to evaluate the hypothesis that historic precipitation levels are an important factor controlling trait selection. We used qSIP-informed genome-resolved metagenomics to resolve the active subset of soil community members and identify their characteristic ecophysiological traits. Higher year-round precipitation levels correlated with higher activity and growth rates of flagellar motile microorganisms. In addition to heavily isotopically labeled bacteria, we identified abundant isotope-labeled phages, suggesting phage-induced cell lysis likely contributed to necromass production at all three sites. Further, there was a positive correlation between phage activity and the activity of putative phage hosts. Contrary to our expectations, the capacity to decompose the diverse complex carbohydrates common in soil organic matter or oxidize methanol and carbon monoxide were broadly distributed across active and inactive bacteria in all three soils, implying that these traits are not highly selected for by historical precipitation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Semi-supervised graph neural networks for pileup noise removal

Abstract The high instantaneous luminosity of the CERN Large Hadron Collider leads to multiple proton–proton interactions in the same or nearby bunch crossings (pileup). Advanced pileup mitigation algorithms are designed to remove this noise from pileup particles and improve the performance of crucial physics observables. This study implements a semi-supervised graph neural network for particle-level pileup noise removal, by identifying individual particles produced from pileup. The graph neural network is firstly trained on charged particles with known labels, which can be obtained from detector measurements on data or simulation, and then inferred on neutral particles for which such labels are missing. This semi-supervised approach does not depend on the neutral particle pileup label information from simulation, and thus allows us to perform training directly on experimental data. The performance of this approach is found to be consistently better than widely-used domain algorithms and comparable to the fully-supervised training using simulation truth information. The study serves as the first attempt at applying semi-supervised learning techniques to pileup mitigation, and opens up a new direction of fully data-driven machine learning pileup mitigation studies.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

HangulFonts v1.0.0

The software creates the Hangul Fonts data set.The Hangul Fonts Datasets consists of all possible blocks for each font along with a set of labels and features for each block which are common across all fonts. We provide scripts to render each block and font into an image and store them together in an HDF5 file for each font and fontsize specified. Each font has 11,172 possible blocks and we have curated 35 fonts for a total of 391,020 possible images. The spoken consonants and vowel correspond to a set of "initial", "medial", and "final" labels for each block with 19, 21, and 28 classes respectively. In addition, each block can also be assigned a hierarchy label based on the block geometry. Finally, the individual glyphs (atoms) are composed across the initial, medial, and final locations along with potential scalings, translations, or rotations. These features of the data set make it uniquely positioned in the deep representation learning field because of its compositionally and hierarchical organization, while retaining diverse types of variation in the realizations.

Bouchard, Kristofer↗
DOE OSTI2022

DistGANS- Distributed Generative Adversarial Neural Networks

DistGANs is a Python package to perform distributed training of conditional generative adversarial neural networks for multi-class labeled image data. DistGANs partitionins the training data according to data labels, and enhances scalability by performing a parallel training where multiple generators are concurrently trained, each one of them focusing on a single data label.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗
DOE OSTI2024

XRF-XFS-XAS-Auto v1.0 - Beta release

This software allows to analyze XRF maps, XFS spectra and XAS spectra collected at the Advanced Light Source's Beamline 10.3.2. Features include: 1) XRF maps: - process XRF maps, all elemental maps are saved as bmp automatically and labeled with the incident energy used, the scale bar is also labeled and can be controlled. - XRF elemental correlation plots, save the correlation plots automatically - Extract single or multiple transects in XRF maps on one or several regions of interest, each transect profile is numbered and saved in a corresponding folder, along with the corresponding maps showing transect location. 2) XFS spectra - save in log10 scale the XFS spectra, either a single or multiple files all at once. The files are saved as .bmp. - XFS spectra are labeled according to tabulated fluorescence emission lines. 3) XAS spectra - allows to plot individual scalers in the raw data. - allows calibration of the spectra using an Io internal glitch present in all spectra and performing 1st derivative. - Least-square linear combination fitting of XANES or extended XANES spectra using a database of standards using 1, 2 or 3 components maximum. It also provides the 5 top combinations and provide the user for the possibility of saving the 2nd, 3rd, 4th and 5th best combinations in addition to the best one. The processed spectra (pre-edge background substracted, post-edge normalized), the fits and residuals are automatically saved. A table of the component, with fit% and SSN is provided and saved automatically as well.

Fakra, Sirine↗
DOE OSTI2024

batteryNET v0.0.1

Code to organize, prepare, and segment multi-scan, larger-than-memory, volumetric dataset. Deep learning segmentation uses pytorch-lightning for code organization, logging and metrics, and multi-GPU parallelization of training and prediction. Also uses moani for volumetric data augmentation and model implementation (currently U-Net++). Training can be done slice-by-slice with 2D models trained on 2D patches either aligned with or perpendicular to the electrode plane, or with 3D models on 3D patches. Sparse labels can be used to minimize required hand-labeling -- less than 0.1% of the entire dataset was labeled. Also includes code for data preparation (alignment/cropping/patching).

Ushizima, Daniela↗