Ensuring Data Integrity at the Source
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
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.
Electric Vehicle Supply Equipment Cybersecurity Through Emulation
As the grid evolves, it is paramount to understand the risks that cyberattacks pose before assets are deployed. Leveraging the ARIES Cyber Range, NREL has created a platform to conduct analysis of EV charging protocol cybersecurity to understand the risks and impacts that cyberattacks may pose to critical infrastructure.
bug bounty prize↗
Mechanical verification of a schematic Byzantine clock synchronization algorithm
Schneider generalizes a number of protocols for Byzantine fault tolerant clock synchronization and presents a uniform proof for their correctness. The authors present a machine checked proof of this schematic protocol that revises some of the details in Schneider's original analysis. The verification was carried out with the EHDM system developed at the SRI Computer Science Laboratory. The mechanically checked proofs include the verification that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm satisfies the requirements of Schneider's protocol.
Shankar, Natarajan↗
Capturing the Page curve and entanglement dynamics of black holes in quantum computers
Quantum computers are emerging technologies expected to become important tools for exploring various aspects of fundamental physics in the future. Therefore, we pose the question of whether quantum computers can help us to study the Page curve and the black hole information dynamics, which has been a key focus in fundamental physics. In this regard, we rigorously examine the qubit transport model, a toy qubit model of black hole evaporation on IBM’s superconducting quantum computers, to shed light on this question. Specifically, we implement the quantum simulation of the scrambling dynamics in black holes using an efficient random unitary circuit. Furthermore, we employ the swap-based many-body interference protocol and the randomized measurement protocol to measure the entanglement entropy of Hawking radiation qubits in this model. Finally, by incorporating quantum error mitigation techniques into our challenging implementation of entanglement entropy measurement protocols on the IBM quantum hardware, we accurately determine the Rényi entropy in the qubit transport model, thus showcasing the utility of quantum computers for future investigations of complex quantum systems.
97 MATHEMATICS AND COMPUTING↗
Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society 2025
Liu, Zhenning (ORCID:000000020794419X)↗
Automated Lane Centering: An Off-the-Shelf Computer Vision Product vs. Infrastructure-Based Chip-Enabled Raised Pavement Markers
Safe autonomous vehicle (AV) operations depend on an accurate perception of the driving environment, which necessitates the use of a variety of sensors. Computational algorithms must then process all of this sensor data, which typically results in a high on-vehicle computational load. For example, existing lane markings are designed for human drivers, can fade over time, and can be contradictory in construction zones, which require specialized sensing and computational processing in an AV. But, this standard process can be avoided if the lane information is simply transmitted directly to the AV. High definition maps and road side units (RSUs) can be used for direct data transmission to the AV, but can be prohibitively expensive to establish and maintain. Additionally, to ensure robust and safe AV operations, more redundancy is beneficial. A cost-effective and passive solution is essential to address this need effectively. In this research, we propose a new infrastructure information source (IIS), chip-enabled raised pavement markers (CERPMs), which provide environmental data to the AV while also decreasing the AV compute load and the associated increase in vehicle energy use. CERPMs are installed in place of traditional ubiquitous raised pavement markers along road lane lines to transmit geospatial information along with the speed limit using long range wide area network (LoRaWAN) protocol directly to nearby vehicles. This information is then compared to the Mobileye commercial off-the-shelf traditional system that uses computer vision processing of lane markings. Our perception subsystem processes the raw data from both CEPRMs and Mobileye to generate a viable path required for a lane centering (LC) application. To evaluate the detection performance of both systems, we consider three test routes with varying conditions. Our results show that the Mobileye system failed to detect lane markings when the road curvature exceeded ±0.016 m -1 . For the steep curvature test scenario, it could only detect lane markings on both sides of the road for just 6.7% of the given test route. On the other hand, the CERPMs transmit the programmed geospatial information to the perception subsystem on the vehicle to generate a reference trajectory required for vehicle control. The CERPMs successfully generated the reference trajectory for vehicle control in all test scenarios. Moreover, the CERPMs can be detected up to 340 m from the vehicle’s position. Our overall conclusion is that CERPM technology is viable and that it has the potential to address the operational robustness and energy efficiency concerns plaguing the current generation of AVs.
33 ADVANCED PROPULSION SYSTEMS↗
Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model
Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.
Segui, John S.↗
Message Passing vs. Shared Address Space on a Cluster of SMPs
The convergence of scalable computer architectures using clusters of PCs (or PC-SMPs) with commodity networking has become an attractive platform for high end scientific computing. Currently, message-passing and shared address space (SAS) are the two leading programming paradigms for these systems. Message-passing has been standardized with MPI, and is the most common and mature programming approach. However message-passing code development can be extremely difficult, especially for irregular structured computations. SAS offers substantial ease of programming, but may suffer from performance limitations due to poor spatial locality, and high protocol overhead. In this paper, we compare the performance of and programming effort, required for six applications under both programming models on a 32 CPU PC-SMP cluster. Our application suite consists of codes that typically do not exhibit high efficiency under shared memory programming. due to their high communication to computation ratios and complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications: however, on certain classes of problems SAS performance is competitive with MPI. We also present new algorithms for improving the PC cluster performance of MPI collective operations.
Shan, Hongzhang↗
Topologically protected Grover's oracle for the partition problem
The number partitioning problem (NPP) is one of the NP-complete (nondeterministic polynomial-time complete) computational problems. Its definite exact solution generally requires a check of all $N$ solution candidates, which is exponentially large. Here we describe a path to the fast solution of this problem in $\sqrt{N}$ quasi-adiabatic quantum annealing steps. We argue that the errors due to the finite duration of the quantum annealing can be suppressed if the annealing time scales with $N$ only logarithmically. Moreover, our adiabatic oracle is topologically protected, in the sense that it is robust against small uncertainty and slow time dependence of the physical parameters or the choice of the annealing protocol. In conclusion, we also argue that our approach can solve many other famous NP-complete computational problems in $\sqrt{N}$ steps.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
Quantum volume is a full-stack benchmark for near-term quantum computers. It quantifies the largest size of a square circuit which can be executed on the target device with reasonable fidelity. Error mitigation is a set of techniques intended to remove the effects of noise present in the computation of noisy quantum computers when computing an expectation value of interest. Effective quantum volume is a proposed metric that applies error mitigation to the quantum volume protocol to evaluate the effectiveness not only of the target device but also of the error mitigation algorithm. Digital zero-noise extrapolation is an error mitigation technique that estimates the noiseless expectation value using circuit folding to amplify errors by known scale factors and then extrapolating computed expectation values to the zero-noise limit. Here we demonstrate that zero-noise extrapolation, with global and local unitary folding with fractional scale factors, in conjunction with dynamical decoupling, can increase the effective quantum volume over the vendor-measured quantum volume. Specifically, we measure the effective quantum volume of four IBM Quantum superconducting processor units, obtaining values that are larger than the vendor-measured quantum volume on each device. This is the first such increase reported.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Optimizing accuracy and efficacy in data-driven materials discovery for the solar production of hydrogen
The production of hydrogen fuels, via water splitting, is of practical relevance for meeting global energy needs and mitigating the environmental consequences of fossil-fuel-based transportation. Water photoelectrolysis has been proposed as a viable approach for generating hydrogen, provided that stable and inexpensive photocatalysts with conversion efficiencies over 10% can be discovered, synthesized at scale, and successfully deployed. While a number of first-principles studies have focused on the data-driven discovery of photocatalysts, in the absence of systematic experimental validation, the success rate of these predictions may be limited. We address this problem by developing a screening procedure with co-validation between experiment and theory to expedite the synthesis, characterization, and testing of the computationally predicted, most desirable materials. Here, starting with 70 150 compounds in the Materials Project database, the proposed protocol yielded 71 candidate photocatalysts, 11 of which were synthesized as single-phase materials. Experiments confirmed hydrogen generation and favorable band alignment for 6 of the 11 compounds, with the most promising ones belonging to the families of alkali and alkaline-earth indates and orthoplumbates. This study shows the accuracy of a nonempirical, Hubbard-corrected density-functional theory method to predict band gaps and band offsets at a fraction of the computational cost of hybrid functionals, and outlines an effective strategy to identify photocatalysts for solar hydrogen generation.
08 HYDROGEN↗
HPC4Mfg with Sepion
A computational framework was developed for predictive determination of polymer membrane porosity based solely on proposed polymer chemistry employing a multi-scale theoretical approach. The resulting polymer structures matched measured density and porosity measurements and established a protocol for future predictions.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
A protocol for calculating basal melt rates in the ISMIP6 Antarctic ice sheet projections
Climate model projections have previously been used to compute ice shelf basal melt rates in ice sheet models, but the strategies employed – e.g., ocean input, parameterization, calibration technique, and corrections – have varied widely and are often ad hoc. Here, a methodology is proposed for the calculation of circum-Antarctic basal melt rates for floating ice, based on climate models, that is suitable for ISMIP6, the Ice Sheet Model Intercomparison Project for CMIP6 (6th Coupled Model Intercomparison Project). The past and future evolution of ocean temperature and salinity is derived from a climate model by estimating anomalies with respect to the modern day, which are added to a present-day climatology constructed from existing observational datasets. Temperature and salinity are extrapolated to any position potentially occupied by a simulated ice shelf. A simple formulation is proposed for a basal melt parameterization in ISMIP6, constrained by the observed temperature climatology, with a quadratic dependency on either the nonlocal or local thermal forcing. Two calibration methods are proposed: (1) based on the mean Antarctic melt rate (MeanAnt) and (2) based on melt rates near Pine Island's deep grounding line (PIGL). Future Antarctic mean melt rates are an order of magnitude greater in PIGL than in MeanAnt. The PIGL calibration and the local parameterization result in more realistic melt rates near grounding lines. PIGL is also more consistent with observations of interannual melt rate variability underneath Pine Island and Dotson ice shelves. This work stresses the need for more physics and less calibration in the parameterizations and for more observations of hydrographic properties and melt rates at interannual and decadal timescales.
54 ENVIRONMENTAL SCIENCES↗
Improving UDP/IP Transmission Without Increasing Congestion
Datagram Retransmission (DGR) is a computer program that, within certain limits, ensures the reception of each datagram transmitted under the User Datagram Protocol/Internet Protocol. [User Datagram Protocol (UDP) is considered unreliable because it does not involve a reliability-ensuring connection-initiation dialogue between sender and receiver. UDP is well suited to issuing of many small messages to many different receivers.] Unlike prior software for ensuring reception of UDP datagrams, DGR does not contribute to network congestion by retransmitting data more frequently as an ever-increasing number of messages and acknowledgements is lost. Instead, DGR does just the opposite: DGR includes an adaptive timeout-interval- computing component that provides maximum opportunity for reception of acknowledgements, minimizing retransmission. By monitoring changes in the rate at which message-transmission transactions are completed, DGR detects changes in the level of congestion and responds by imposing varying degrees of delay on the transmission of new messages. In addition, DGR maximizes throughput by not waiting for acknowledgement of a message before sending the next message. All DGR communication is asynchronous, to maximize efficient utilization of network connections. DGR manages multiple concurrent datagram transmission and acknowledgement conversations.
Burleigh, Scott↗
Accelerating the Design of Space Vehicles
One of NASA's key goals is to increase the safety and reduce the cost of space transportation. Thus, a key element of NASA's new Integrated Space Transportation Plan is to develop new propulsion, structures, and operations for future generations of reusable launch vehicles (RLVs). As part of this effort to develop the next RLV, the ClCT Program's Computing, Networking, and Information Systems (CNIS) Project is developing and demonstrating collaborative software technologies that use the collective power of the NASA Grid to accelerate spacecraft design. One of these technologies, called AeroDB, automates the execution and monitoring of computational fluid dynamics (CFD) parameter studies on the NASA Grid. About the NASA Grid The NASA Grid, or Information Power Grid,. is being developed to leverage the distributed resources of NASA's many computers. instruments, simulators, and data storage systems. The goal is to use these combined resources to sdve difficult NASA challenges, such as iimulating the entire flight of a space vehicle from ascent to descent.To realize the vision of the NASA Grid, the CNIS Project is developing the software framework and protocols for building domain-specific environments and interfaces, new Grid services based on emerging industry standards, and advanced networking and computing testbeds to support new Grid-based applications such as AeroDB.
Laufenberg, Larry↗
The VLBA correlator: Real-time in the distributed era
The correlator is the signal processing engine of the Very Long Baseline Array (VLBA). Radio signals are recorded on special wideband (128 Mb/s) digital recorders at the 10 telescopes, with sampling times controlled by hydrogen maser clocks. The magnetic tapes are shipped to the Array Operations Center in Socorro, New Mexico, where they are played back simultaneously into the correlator. Real-time software and firmware controls the playback drives to achieve synchronization, compute models of the wavefront delay, control the numerous modules of the correlator, and record FITS files of the fringe visibilities at the back-end of the correlator. In addition to the more than 3000 custom VLSI chips which handle the massive data flow of the signal processing, the correlator contains a total of more than 100 programmable computers, 8-, 16- and 32-bit CPUs. Code is downloaded into front-end CPU's dependent on operating mode. Low-level code is assembly language, high-level code is C running under a RT OS. We use VxWorks on Motorola MVME147 CPU's. Code development is on a complex of SPARC workstations connected to the RT CPU's by Ethernet. The overall management of the correlation process is dependent on a database management system. We use Ingres running on a Sparcstation-2. We transfer logging information from the database of the VLBA Monitor and Control System to our database using Ingres/NET. Job scripts are computed and are transferred to the real-time computers using NFS, and correlation job execution logs and status flow back by the route. Operator status and control displays use windows on workstations, interfaced to the real-time processes by network protocols. The extensive network protocol support provided by VxWorks is invaluable. The VLBA Correlator's dependence on network protocols is an example of the radical transformation of the real-time world over the past five years. Real-time is becoming more like conventional computing. Paradoxically, 'conventional' computing is also adopting practices from the real-time world: semaphores, shared memory, light-weight threads, and concurrency. This appears to be a convergence of thinking.
Wells, D. C.↗
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↗
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↗