Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “protocol (computers)”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Collective mode Brownian dynamics: A method for fast relaxation of statistical ensembles

Sampling equilibrium configurations of correlated systems of particles with long relaxation times (e.g., polymeric solutions) using conventional molecular dynamics and Monte Carlo methods can be challenging. This is especially true for systems with complicated, extended bond network topologies and other interactions that make the use and design of specialized relaxation protocols infeasible. We introduce a method based on Brownian dynamics simulations that can reduce the computational time it takes to reach equilibrium and draw decorrelated samples. Importantly, the method is completely agnostic to the particle configuration and the specifics of interparticle forces. In particular, we develop a mobility matrix that excites non-local, collective motion of N particles and can be computed efficiently in $\mathcal{O}(N)$ time. Particle motion in this scheme is computed by integrating the overdamped Langevin equation with an Euler–Maruyama scheme, in which Brownian displacements are drawn efficiently using a low-rank representation of the mobility matrix in position and wave space. We demonstrate the efficacy of the method with various examples from the realm of soft condensed matter and release a massively parallel implementation of the code as a plugin for the open-source package HOOMD-blue [J. A. Anderson et al., J. Comput. Phys. 227, 5342 (2008) and J. Glaser et al., Comput. Phys. Commun. 192, 97 (2015)] which runs on graphics processing units

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

SetBERT: the deep learning platform for contextualized embeddings and explainable predictions from high-throughput sequencing

MOTIVATION: High-throughput sequencing (HTS) is a modern sequencing technology used to profile microbiomes by sequencing thousands of short genomic fragments from the microorganisms within a given sample. This technology presents a unique opportunity for artificial intelligence to comprehend the underlying functional relationships of microbial communities. However, due to the unstructured nature of HTS data, nearly all computational models are limited to processing DNA sequences individually. This limitation causes them to miss out on key interactions between microorganisms, significantly hindering our understanding of how these interactions influence the microbial communities as a whole. Furthermore, most computational methods rely on post-processing of samples which could inadvertently introduce unintentional protocol-specific bias. RESULTS: Addressing these concerns, we present SetBERT, a robust pre-training methodology for creating generalized deep learning models for processing HTS data to produce contextualized embeddings and be fine-tuned for downstream tasks with explainable predictions. By leveraging sequence interactions, we show that SetBERT significantly outperforms other models in taxonomic classification with genus-level classification accuracy of 95%. Furthermore, we demonstrate that SetBERT is able to accurately explain its predictions autonomously by confirming the biological-relevance of taxa identified by the model. AVAILABILITY AND IMPLEMENTATION: All source code is available at https://github.com/DLii-Research/setbert. SetBERT may be used through the q2-deepdna QIIME 2 plugin whose source code is available at https://github.com/DLii-Research/q2-deepdna.

Ludwig, David W↗
DOE OSTI2026

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A Prospective, Open-Label, Multicenter Phase 2 Trial of Neoadjuvant Therapy Using Full-Dose Gemcitabine and S-1 Concurrent with Radiation for Resectable Pancreatic Ductal Adenocarcinoma

Background: Neoadjuvant therapy reportedly shows only marginal clinical benefit in pancreatic ductal adenocarcinoma (PDAC), especially in resectable cases. However, with more effective regimens, neoadjuvant therapy may become a standard of care for resectable cases. A prospective, open-label, multicenter phases 1 and 2 trial of neoadjuvant therapy was conducted using full-dose gemcitabine and S-1 concurrently with 50.4 Gy of radiation therapy (GSRT) for resectable PDAC. This report describes the phase 2 results. Methods: The phase 2 part of this study enrolled 57 patients with cytologically or histologically proven PDAC deemed resectable based on imaging before neoadjuvant therapy. These patients received GSRT. After reevaluation by computed tomography scan, surgical exploration was performed, followed by adjuvant therapy. According to the prescribed protocol of the clinical trial, statistical analyses included 57 phase 2 patients and 6 phase 1 patients who received the same dosage as in phase 2. Results: This trial enrolled 63 patients (42 men and 21 women) with a median age of 70 years. Leukopenia or neutropenia of grade 3 or higher occurred for 79% of the patients, but no other severe adverse events were observed. Among the 63 patients, 54 underwent surgical resection. Intention-to-treat analysis of the 63 patients showed an excellent median survival time lasting as long as 55.3 months. The patients who completed neoadjuvant therapy, surgery, and adjuvant therapy had a 5-year survival rate of 56.6%. Conclusions: This regimen showed outstanding clinical efficacy with acceptable tolerability for patients with resectable PDAC.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2020

Probing quantum processor performance with pyGSTi

PyGSTi is a Python software package for assessing and characterizing the performance of quantum computing processors. It can be used as a standalone application, or as a library, to perform a wide variety of quantum characterization, verification, and validation (QCVV) protocols on as-built quantum processors. In this work, we outline pyGSTi's structure, and what it can do, using multiple examples. We cover its main characterization protocols with end-to-end implementations. These include gate set tomography, randomized benchmarking on one or many qubits, and several specialized techniques. We also discuss and demonstrate how power users can customize pyGSTi and leverage its components to create specialized QCVV protocols and solve user-specific problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

DGaaS: GPU as a Service on Distributed Computing System

In the rapidly evolving landscape of scientific computing, Graphics Processing Units (GPUs) have become indispensable for their unparalleled ability to handle parallel tasks in complex calculations, simulations, and data analysis. Their utility is further magnified in machine learning and AI applications, where they significantly accelerate model training and predictive analytics. Within this context, the Triton Inference Server emerges as a pivotal open-source tool, specializing in AI inferencing and optimizing GPU utilization across various platforms and frameworks. This paper presents an in-depth study on distributed High Throughput Computing (HTC), specifically focusing on the HTCondor framework and its resource provisioning tools, GlideinWMS and HEPCloud. These systems enable large-scale scientific experiments like CMS and DUNE to efficiently access and utilize vast computational resources. The paper explores the core architectural components of GlideinWMS, including jobs, user pools, and worker nodes, and discusses their integration with GPUs and the Triton server. The primary aim of this research is to develop a solution that optimizes GPU utilization by leveraging Glideins and containers. This approach allows computational jobs, particularly those involving AI models, to use GPUs only when essential, thereby facilitating efficient sharing of limited GPU resources. To validate this architecture, the study conducted three key tests involving custom scripts, container-based servers, and Triton server deployments. However, the study faces challenges, notably in locating the Triton server and ensuring secure remote access. To address these issues, future work will focus on developing a proxy mechanism and enhancing security protocols. In conclusion, this study offers a comprehensive roadmap for effective and efficient GPU utilization in distributed High Throughput Computing. It aims to contribute significantly to the scientific community by solving pressing problems and implementing robust solutions in collaboration with the GlideinWMS and HEPCloud teams. The research sets the stage for a more efficient, scalable, and cost-effective paradigm in scientific computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗
DOE OSTI2025

Hardness of Observing Strong-to-Weak Symmetry Breaking

Spontaneous symmetry breaking (SSB) is the cornerstone of our understanding of quantum phases of matter. Recent works have generalized this concept to the domain of mixed states in open quantum systems, where symmetries can be realized in two distinct ways dubbed strong and weak. Novel intrinsically mixed phases of quantum matter can then be defined by the spontaneous breaking of strong symmetry down to weak symmetry. However, proposed order parameters for strong-to-weak SSB (based on mixed-state fidelities or purities) seem to require exponentially many copies of the state, raising the question: Is it possible to efficiently detect strong-to-weak SSB, in general? In this work, we answer this question negatively in the paradigmatic cases of ℤ2 and U(1) symmetries. We construct ensembles of pseudorandom mixed states that do not break the strong symmetry yet are computationally indistinguishable from states that do. This rules out the existence of efficient state-agnostic protocols to detect strong-to-weak SSB.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Reductive quantum phase estimation

Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here, we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a smaller number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a tradeoff between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application. Published by the American Physical Society 2024

Papadopoulos, Nicholas J. C. (ORCID:00000002635700↗
DOE OSTI2021

Model-informed, Adaptive Physical Vapor Deposition to Fabricate Hierarchical Binary-alloy Thin-films

Designing next generation thin films, tailor-made for specific applications, relies on the availability of robust processing-structure-property relationships. Traditional structure zone diagrams are limited to low-dimensional mappings, with machine-learning methods only recently attempting to relate multiple processing parameters to the final microstructure. Despite this progress, structure-processing relationships are unknown for processing conditions that vary during thin-film deposition, limiting the range of microstructures and properties achievable. In this project, we employed a phase-field computational model combined with a genetic algorithm (GA) to identify and design time-dependent processing protocols that achieve tailor-made microstructures. We simulate the physical vapor deposition of a binary-alloy thin film by employing a phase-field model, where deposition rates and diffusivities are controlled via the genetic algorithm. Our GA-guided protocols achieve targeted microstructures with lateral and vertical concentration modulations, as well as more complex, hierarchical microstructures previously not described in simple structure zone diagrams. Our algorithm provides insight to experimentalists looking for additional avenues to design novel thin-film microstructures.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Self-driving thin film laboratory: autonomous epitaxial atomic-layer synthesis via real-time computer vision analysis of electron diffraction

Emerging materials science platforms with the ability to make autonomous decisions on the fly are fundamentally changing the outlook and protocols for materials optimization and discovery. Because AI-driven self-navigating schemes can effectively reduce the total number of iterations needed to arrive at the "answer" (i.e. the best stochiometric composition for a desired physical property, optimum materials processing parameters, etc.) by significant margins, they have the potential to revolutionize materials and chemical manufacturing processes at large in research laboratory settings as well as in industrial plants. Here, we demonstrate a successful implementation of real-time closed-loop autonomous navigation of a multi-dimensional materials synthesis parameter space for fabricating phase-pure epitaxial films of a metastable phase of a functional oxide in a combinatorial pulsed laser deposition chamber. Sequential epitaxial growth iterations in search of the optimized recipe to stabilize the desired crystal phase were performed using frame-by-frame quantitative computer vision analysis of reflection high-energy electron diffraction (RHEED) images of the unit-cell level film being deposited. The autonomous scheme regularly resulted in > 30-fold reduction in the number of required experiments compared to a comprehensive mapping of the parameter space. The real-time workflow developed here can be readily extended to a variety of thin film synthesis platforms opening the door for self-driving atomic-level materials design as well as autonomous optimization of semiconductor manufacturing.

36 MATERIALS SCIENCE↗
DOE OSTI2023

MS1Connect: a mass spectrometry run similarity measure

Abstract Motivation Interpretation of newly acquired mass spectrometry data can be improved by identifying, from an online repository, previous mass spectrometry runs that resemble the new data. However, this retrieval task requires computing the similarity between an arbitrary pair of mass spectrometry runs. This is particularly challenging for runs acquired using different experimental protocols. Results We propose a method, MS1Connect, that calculates the similarity between a pair of runs by examining only the intact peptide (MS1) scans, and we show evidence that the MS1Connect score is accurate. Specifically, we show that MS1Connect outperforms several baseline methods on the task of predicting the species from which a given proteomics sample originated. In addition, we show that MS1Connect scores are highly correlated with similarities computed from fragment (MS2) scans, even though these data are not used by MS1Connect. Availability and implementation The MS1Connect software is available at https://github.com/bmx8177/MS1Connect. Supplementary information Supplementary data are available at Bioinformatics online.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Seamless integration of commercial Clouds with ATLAS Distributed Computing

The CERN ATLAS Experiment successfully uses a worldwide dis-tributed computing Grid infrastructure to support its physics programme at the Large Hadron Collider (LHC). The Grid workflow system PanDA routinely manages up to 700,000 concurrently running production and analysis jobs to process simulation and detector data. In total more than 500 PB of data are distributed over more than 150 sites in the WLCG and handled by the ATLAS data management system Rucio. To prepare for the ever growing data rate in future LHC runs new developments are underway to embrace industry accepted protocols and technologies, and utilize opportunistic resources in a standard way. This paper reviews how the Google and Amazon Cloud computing ser-vices have been seamlessly integrated as a Grid site within PanDA and Rucio. Performance and brief cost evaluations will be discussed. Such setups could offer advanced Cloud tool-sets and provide added value for analysis facilities that are under discussions for LHC Run-4.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A holistic cyber-physical security protocol for authenticating the provenance and integrity of structural health monitoring imagery data

Modern infrastructure systems, such as bridges, dams, power generation stations, and buildings increasingly have an intrinsic cyber-physical nature to them. Infrastructure now commonly, includes actuators, network connections, sensors, control systems, and computational resources. It is of increasing concern that modern infrastructure is vulnerable to cyber-attacks that can damage both the cyber and physical nature of the infrastructure. To date, the physical and cyber health of infrastructure has been considered separately. However, the increasing concerns associated with the cyber-physical security of infrastructure coupled with the emergence of 5G networks made using components that are not universally considered trustworthy, and the emergence of techniques for creating deepfakes and adversarial examples suggests the time has come to begin considering cyber health and structural health with a more holistic approach. In this work, a protocol is developed for ensuring the imagery data captured by a structural health monitoring system can be unambiguously attributed to legitimate sensors associated with the structural health monitoring system. A computer vision approach based on the idea of mutual information is then presented to detect damage in an image. This work presents the protocol for authenticating the provenance of imager data and demonstrates that this protocol does not have overly adverse effects when used with the mutual information-based technique for detecting damage in the resulting imagery data.

Jung, HweeKwon↗
DOE OSTI2023

An introduction to financial option pricing on a qudit-based quantum computer

The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

Bornman, Nicholas↗
DOE OSTI2020

Converting Clinical Pathways to BPM+ Standards: A Case Study in Stable Ischemic Heart Disease

Clinical pathways (CPs) are structured healthcare plans designed to implement evidence-based clinical guidelines, medical algorithms, and protocols. In recent years, a community called BPM+ Health has worked to establish a shareable and computer-consumable representation of CP, leveraging standard notations. These notations, collectively referred to as BPM+, include the Business Process Management and Notation (BPMN), Case Management Model and Notation (CMMN), and Decision Model and Notation (DMN), which aim to support clinical management and standardized communication between different stakeholders. However, the adaptation of these notations for the existing guidelines has largely been left unexplored. This paper introduces procedural steps and criteria considerations to apply components of BPM+ notations to reconstruct a guideline for Stable Ischemic Heart Disease. This paper describes how each of the three different notations is mapped to a medical guideline and discusses the advantages and limitations of representing CPs with BPM+ as compared with paper-based medical guidelines.

Chae, Junghoon↗
DOE OSTI2021

C3PU:Real-Time Predictive Charge Control Software for Battery Management Systems (Code for Charge Control and Predictive Unit) [SWR-21-48]

C3PU sets up a model predictive control formulation for the optimal charging control of battery packs and can be deployed for real-time operation on an embedded microprocessor. C3PU uses electrochemical and thermal models of battery packs to predict the charging trajectories of the battery pack over a time horizon under different operating conditions. It then selects the optimal charging trajectory such that a pre-defined objective is minimized, which in the present state of the code is to minimize the charging duration of the battery pack. The optimal charging trajectory is obtained by solving an underlying mathematical problem. However, C3PU is flexible to incorporate other charging objectives. The underlying battery models can be swapped as well, as long as they follow certain mathematical properties. Mathematically, optimal control problems (in this case, optimally controlling the charging current of the battery pack) are computationally expensive. C3PU implements advanced numerical techniques, namely pseudo-spectral optimization, to reduce the computational burden of the underlying problem to solve. This allows for the problem to be solved in real-time in an embedded system. Once the optimal charging trajectory is computed over a time horizon, C3PU can package such data and send it out via appropriate communication protocols.

Mishra, Partha↗