Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “online”

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,351 records · Page 75
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Gen3 CSP Materials: Critical Review of Limited Existing and New Survey Data

Abstract Novel high temperature (≥ 700°C) Heat Transfer Medias (HTMs, e.g., molten salts) and corrosion-resistant Containment Materials (CMs, e.g., metal alloys or ceramics) are necessary for concentrated solar power (CSP) given the emphasis on higher temperatures and high cycle efficiency in the 3rd generation CSP (Gen3 CSP) technologies. In early 2019, we sent out an online survey to the Gen3 CSP community to fully assess the communal needs for thermophysical properties measurements of which HTMs and CMs, and what temperature range and other testing environments would be ideal for those materials. Based on the recorded responses, seven unique HTMs and twenty-six unique CMs were identified. Since then the list has been constantly updated, following our interactions and inputs from the Gen3 CSP community, with some new materials substituting their older counterparts. Currently, there are total of ten unique HTMs and twenty-nine unique CMs that are under consideration by the Gen3 CSP community. By analyzing the available body of research to date and combining it with our survey data from within the Gen3 CSP community, this paper presents trends of what people in the CSP world are thinking regarding materials worth investigating and suggests which thermophysical property measurements are critical to advance high-temperature CSP systems.

Gunawan, Andrey↗
DOE OSTI2020

Assessment of the frequency and nature of erroneous x-ray photoelectron spectroscopy analyses in the scientific literature

Here, this study was undertaken to understand the extent and nature of problems in x-ray photoelectron spectroscopy (XPS) data reported in the literature. It first presents an assessment of the XPS data in three high-quality journals over a six-month period. This analysis of 409 publications showing XPS spectra provides insight into how XPS is being used, identifies the common mistakes or errors in XPS analysis, and reveals which elements are most commonly analyzed. More than 65% of the 409 papers showed fitting of XP spectra. An ad hoc group (herein identified as “the committee”) of experienced XPS analysts reviewed these spectra and found that peak fitting was a common source of significant errors. The papers were ranked based on the perceived seriousness of the errors, which ranged from minor to major. Major errors, which, in the opinion of the ad hoc committee, can render the interpretation of the data meaningless, occurred when fitting protocols ignored underlying physics and chemistry or contained major errors in the analysis. Consistent with other materials analysis data, ca. 30% of the XPS data or analysis was identified as having major errors. Out of the publications with fitted spectra, ca. 40% had major errors. The most common elements analyzed by XPS in the papers sampled and researched at an online database, include carbon, oxygen, nitrogen, sulfur, and titanium. A scrutiny of the papers showing carbon and oxygen XPS spectra revealed the classes of materials being studied and the extent of problems in these analyses. As might be expected, C 1s and O 1s analyses are most often performed on sp2-type materials and inorganic oxides, respectively. These findings have helped focus a series of XPS guides and tutorials that deal with common analysis issues. The extent of problematic data is larger than the authors had expected. Quantification of the problem, examination of some of the common problem areas, and the development of targeted guides and tutorials may provide both the motivation and resources that enable the community to improve the overall quality and reliability of XPS analysis reported in the literature.

Major, George H.↗
DOE OSTI2021

DOE JGI Metagenome Workflow

The DOE Joint Genome Institute (JGI) Metagenome Workflow performs metagenome data processing, including assembly; structural, functional, and taxonomic annotation; and binning of metagenomic data sets that are subsequently included into the Integrated Microbial Genomes and Microbiomes (IMG/M) (I.-M. A. Chen, K. Chu, K. Palaniappan, A. Ratner, et al., Nucleic Acids Res, 49:D751–D763, 2021, https://doi.org/10.1093/nar/gkaa939) comparative analysis system and provided for download via the JGI data portal (https://genome.jgi.doe.gov/portal/). This workflow scales to run on thousands of metagenome samples per year, which can vary by the complexity of microbial communities and sequencing depth. Here, we describe the different tools, databases, and parameters used at different steps of the workflow to help with the interpretation of metagenome data available in IMG and to enable researchers to apply this workflow to their own data. We use 20 publicly available sediment metagenomes to illustrate the computing requirements for the different steps and highlight the typical results of data processing. The workflow modules for read filtering and metagenome assembly are available as a workflow description language (WDL) file (https://code.jgi.doe.gov/BFoster/jgi_meta_wdl). The workflow modules for annotation and binning are provided as a service to the user community at https://img.jgi.doe.gov/submit and require filling out the project and associated metadata descriptions in the Genomes OnLine Database (GOLD) (S. Mukherjee, D. Stamatis, J. Bertsch, G. Ovchinnikova, et al., Nucleic Acids Res, 49:D723–D733, 2021, https://doi.org/10.1093/nar/gkaa983).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

PlasmidHostFinder: Prediction of Plasmid Hosts Using Random Forest

Plasmids play a major role facilitating the spread of antimicrobial resistance between bacteria. Understanding the host range and dissemination trajectories of plasmids is critical for surveillance and prevention of antimicrobial resistance. Identification of plasmid host ranges could be improved using automated pattern detection methods compared to homology-based methods due to the diversity and genetic plasticity of plasmids. In this study, we developed a method for predicting the host range of plasmids using machine learning—specifically, random forests. We trained the models with 8,519 plasmids from 359 different bacterial species per taxonomic level; the models achieved Matthews correlation coefficients of 0.662 and 0.867 at the species and order levels, respectively. Our results suggest that despite the diverse nature and genetic plasticity of plasmids, our random forest model can accurately distinguish between plasmid hosts. This tool is available online through the Center for Genomic Epidemiology (https://cge.cbs.dtu.dk/services/PlasmidHostFinder/).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

SourceFinder: a Machine-Learning-Based Tool for Identification of Chromosomal, Plasmid, and Bacteriophage Sequences from Assemblies

High-throughput genome sequencing technologies enable the investigation of complex genetic interactions, including the horizontal gene transfer of plasmids and bacteriophages. However, identifying these elements from assembled reads remains challenging due to genome sequence plasticity and the difficulty in assembling complete sequences. In this study, we developed a classifier, using random forest, to identify whether sequences originated from bacterial chromosomes, plasmids, or bacteriophages. The classifier was trained on a diverse collection of 23,211 chromosomal, plasmid, and bacteriophage sequences from hundreds of bacterial species. In order to adapt the classifier to incomplete sequences, each complete sequence was subsampled into 5,000 nucleotide fragments and further subdivided into k-mers. This three-class classifier succeeded in identifying chromosomes, plasmids, and bacteriophages using k-mer distributions of complete and partial genome sequences, including simulated metagenomic scaffolds with minimum performance of 0.939 area under the receiver operating characteristic curve (AUC). This classifier, implemented as SourceFinder, has been made available as an online web service to help the community with predicting the chromosomal, plasmid, and bacteriophage sources of assembled bacterial sequence data (https://cge.food.dtu.dk/services/SourceFinder/).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗
DOE OSTI2023

The s process in massive stars, a benchmark for neutron capture reaction rates

A clear definition of the contribution from the slow neutron-capture process (s process) to the solar abundances between Fe and the Sr-Zr region is a crucial challenge for nuclear astrophysics. Robust s-process predictions are necessary to disentangle the contribution from other stellar processes producing elements in the same mass region. Nuclear uncertainties are affecting s-process calculations, but most of the needed nuclear input are accessible to present nuclear experiments or they will be in the near future. Neutron-capture rates have a great impact on the s process in massive stars, which is a fundamental source for the solar abundances of the lighter s-process elements heavier than Fe (weak s-process component). In this work we present a new nuclear sensitivity study to explore the impact on the s process in massive stars of 86 neutron-capture rates, including all the reactions between C and Si and between Fe and Zr. We derive the impact of the rates at the end of the He-burning core and at the end of the C-burning shell, where the 22 Ne(α,n) 25 Mg reaction is is the main neutron source. We confirm the relevance of the light isotopes capturing neutrons in competition with the Fe seeds as a crucial feature of the s process in massive stars. For heavy isotopes we study the propagation of the neutron-capture uncertainties, finding a clear difference of the impact of Fe and Co isotope rates with respect to the rates of heavier stable isotopes. The local uncertainty propagation due to the neutron-capture rates at the s-process branching points is also considered, discussing the example of 85 Kr. The complete results of our study for all the 86 neutron-capture rates are available online. Finally, we present the impact on the weak s process of the neutron-capture rates included in the new ASTRAL library (v0.2).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Polarized target nuclear magnetic resonance measurements with deep neural networks

Continuous-wave Nuclear Magnetic Resonance (CW-NMR) operated in constant-current mode has served as a foundational technique for polarization measurement in solid-state dynamically polarized targets within nuclear and high-energy physics experiments for several decades, and it remains an essential tool. Conventional Q-meter-based phase-sensitive detection is critical for precise real-time determination of target polarization during scattering runs. However, the accuracy and reliability of these measurements are frequently compromised by elevated noise levels, baseline drift, and systematic uncertainties arising from signal isolation and fitting, ultimately degrading the overall experimental figure of merit. In this work, we report the first successful application of neural network architectures to continuous-wave NMR polarization metrology. By leveraging advanced machine learning techniques for signal extraction and denoising, we achieve a substantial reduction of fitting uncertainties under a variety of realistic simulated and experimental conditions. These improvements translate directly into more robust real-time (online) polarization monitoring and higher precision in subsequent offline analysis. By reducing analysis-induced uncertainty, the resulting methodology can improve the effective figure of merit for scattering experiments employing dynamically polarized targets and provides a new toolset for NMR-based polarimetry in high-energy and nuclear physics.

Metrology↗
DOE OSTI2021

Configuration and performance of the ATLAS b -jet triggers in Run 2

Several improvements to the ATLAS triggers used to identify jets containing b-hadrons (b-jets) were implemented for data-taking during Run 2 of the Large Hadron Collider from 2016 to 2018. These changes include reconfiguring the b-jet trigger software to improve primary-vertex finding and allow more stable running in conditions with high pile-up, and the implementation of the functionality needed to run sophisticated taggers used by the offline reconstruction in an online environment. These improvements yielded an order of magnitude better light-flavour jet rejection for the same b-jet identification efficiency compared to the performance in Run 1 (2011–2012). The efficiency to identify b-jets in the trigger, and the conditional efficiency for b-jets that satisfy offline b-tagging requirements to pass the trigger are also measured. Correction factors are derived to calibrate the b-tagging efficiency in simulation to match that observed in data. The associated systematic uncertainties are substantially smaller than in previous measurements. In addition, b-jet triggers were operated for the first time during heavy-ion data-taking, using dedicated triggers that were developed to identify semileptonic b-hadron decays by selecting events with geometrically overlapping muons and jets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

The Pixel Luminosity Telescope: a detector for luminosity measurement at CMS using silicon pixel sensors

The Pixel Luminosity Telescope is a silicon pixel detector dedicated to luminosity measurement at the CMS experiment at the LHC. It is located approximately 1.75 m from the interaction point and arranged into 16 “telescopes”, with eight telescopes installed around the beam pipe at either end of the detector and each telescope composed of three individual silicon sensor planes. The per-bunch instantaneous luminosity is measured by counting events where all three planes in the telescope register a hit, using a special readout at the full LHC bunch-crossing rate of 40 MHz. The full pixel information is read out at a lower rate and can be used to determine calibrations, corrections, and systematic uncertainties for the online and offline measurements. This paper details the commissioning, operational history, and performance of the detector during Run 2 (2015–18) of the LHC, as well as preparations for Run 3, which will begin in 2022.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Publisher Erratum: CUPID, the Cuore upgrade with particle identification

Publisher Erratum: Eur. Phys. J. C (2025) 85:737 https://doi.org/10.1140/epjc/s10052-025-14352-1 The author M. Pavan (affiliations 9 and 10) was missing from the published author list. The online version of the article has been updated to include the author. Additionally, affiliations 4 and 17 have been corrected to reflect the proper institutional order. The publisher apologizes for the inconvenience caused.

Alfonso, K. [Virginia Polytechnic Institute and St↗
DOE OSTI2020

Activity Characterization for Modeling Behavioral-driven Human Mobility in Platial Networks

The population is increasingly becoming tractable as more and more people carry handheld devices as part of their everyday activities. Recent studies have shown that handheld devices' generated traffic share is now more than 50% of total global online traffic. This has created an unprecedented opportunity for modeling human mobility behavior. For example, aggregate check-ins and dwell time can reveal building level occupancies. However, there are clear limits to accurate modeling (e.g. reproducible, repeatable, and realistic), unless we decipher the underlying reason causing typical mobility patterns. We know that human behavior is a reflection of a set of activities, such as going to the gym or work, and which can be seen as a catalyst for humans to move from one location to another. This work envisions the use of activity characterization for modeling human mobility by introducing a context that maps activities to certain mobility patterns. In the end, we highlight the efficacy of the proposed approach by analyzing the impact of public policies surrounding stay at home order on human mobility.

Thakur, Gautam Malviya↗
DOE OSTI2020

Chimbuko: A Workflow-Level Scalable Performance Trace Analysis Tool

Due to the sheer volume of data it is typically impractical to analyze the detailed performance of an HPC application running at-scale. While conventional small-scale benchmarking and scaling studies are often sufficient for simple applications, many modern workflow-based applications couple multiple elements with competing resource demands and complex inter-communication patterns for which performance cannot easily be studied in isolation and at small scale. This work discusses Chimbuko, a performance analysis framework that provides real-time, in situ anomaly detection. By focusing specifically on performance anomalies and their origin (aka provenance), data volumes are dramatically reduced without losing necessary details. To the best of our knowledge, Chimbuko is the first online, distributed, and scalable workflow-level performance trace analysis framework. We demonstrate the tool's usefulness on Oak Ridge National Laboratory's Summit system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

MCS+: An Efficient Algorithm for Crawling the Community Structure in Multiplex Networks

In this article, we consider the problem of crawling a multiplex network to identify the community structure of a layer-of-interest. A multiplex network is one where there are multiple types of relationships between the nodes. In many multiplex networks, some layers might be easier to explore (in terms of time, money etc.). We propose MCS+, an algorithm that can use the information from the easier to explore layers to help in the exploration of a layer-of-interest that is expensive to explore. We consider the goal of exploration to be generating a sample that is representative of the communities in the complete layer-of-interest. This work has practical applications in areas such as exploration of dark (e.g., criminal) networks, online social networks, biological networks, and so on. For example, in a terrorist network, relationships such as phone records, e-mail records, and so on are easier to collect; in contrast, data on the face-to-face communications are much harder to collect, but also potentially more valuable. We perform extensive experimental evaluations on real-world networks, and we observe that MCS+ consistently outperforms the best baseline—the similarity of the sample that MCS+ generates to the real network is up to three times that of the best baseline in some networks. We also perform theoretical and experimental evaluations on the scalability of MCS+ to network properties, and find that it scales well with the budget, number of layers in the multiplex network, and the average degree in the original network.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2021

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗