Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “use cases”

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,747 records · Page 97

Decision-tree structures utilizing a phase-transition material

The rich internal physics due to competing electronic phases present in phase-transition materials such as VO2 offer the potential for compact building block design for emerging non-von Neumann computing technologies. Here, based on the relaxation dynamics of an insulator-metal phase transition, we demonstrate experimentally a decision-tree classifier embedded within a single volatile resistive switching device. The tree is constructed by the combination of the voltage pulse and relaxation time and can adapt to different tasks. We use machine learning to analyze the relaxation process, enabling a predictive voltage-relaxation time phase diagram for the electrical resistance state. Classification of the etiology of the chronic cough is presented as a proof-of-principle use case. Further, our approach can be generalized to broader classes of solid-state and solid-liquid interfacial systems that demonstrate a variety of phase relaxations.

36 MATERIALS SCIENCE↗

Entanglement-enhanced ac magnetometry in the presence of Markovian noise

Entanglement is a resource to improve the sensitivity of quantum sensors. In an ideal case, using an entangled state as a probe to detect target fields, we can beat the standard quantum limit by which all classical sensors are bounded. However, since entanglement is fragile against decoherence, it is unclear whether entanglement-enhanced metrology is useful in a noisy environment. Its benefit is indeed limited when estimating the amplitude of dc magnetic fields under the effect of parallel Markovian decoherence, where the noise operator is parallel to the target field. In this paper, on the contrary, we show an advantage to using an entanglement over the classical strategy under the effect of parallel Markovian decoherence when we try to detect ac magnetic fields. We consider a scenario to induce a Rabi oscillation of the qubits with the target ac magnetic fields. Although we can, in principle, estimate the amplitude of the ac magnetic fields from the Rabi oscillation, the signal becomes weak if the qubit frequency is significantly detuned from the frequency of the ac magnetic field. We show that, by using the Greenberger-Horne-Zeilinger (GHZ) states, we can significantly enhance the signal of the detuned Rabi oscillation even under the effect of parallel Markovian decoherence. Further, our method is based on the fact that the interaction time between the GHZ states and ac magnetic fields scales as 1/L to mitigate the decoherence effect, where L is the number of qubits, which contributes to improving the bandwidth of the detectable frequencies of the ac magnetic fields. Our results pave the way for new applications of entanglement-enhanced ac magnetometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple approach to approximate quantum error correction based on the transpose channel

We demonstrate that there exists a universal, near-optimal recovery map--the transpose channel--for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions and generalize them to a set of conditions for approximate QEC (AQEC) codes. This forms the basis of a simple algorithm for finding AQEC codes. Our analytical approach is a departure from earlier work relying on exhaustive numerical search for the optimal recovery map, with optimality defined based on entanglement fidelity. For the practically useful case of codes encoding a single qubit of information, our algorithm is particularly easy to implement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imprint of spatial curvature on inflation power spectrum

If the Universe had a large curvature before inflation there is a deviation from the scale invariant perturbations of the inflaton at the beginning of inflation. This may have some effect on the cosmic microwave background anisotropy at large angular scales. We calculate the density perturbations for both open and closed universe cases using the Bunch-Davies vacuum condition on the initial state. We use our power spectrum to calculate the temperature anisotropy spectrum and compare the results with the Wilkinson microwave anisotropy map five year data. We find that our power spectrum gives a lower quadrupole anisotropy when {omega}-1>0, but matches the temperature anisotropy calculated from the standard Ratra-Peebles power spectrum at large l. The determination of spatial curvature from temperature anisotropy data is not much affected by the different power spectra which arise from the choice of different boundary conditions for the inflaton perturbation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Controlled expansion for pairing in a polarized band with strong repulsion

Can strong repulsive interactions be shown to give rise to pairing in a controlled way? We find that for a single flavor polarized band, there is a small expansion parameter in the low density limit, once the Bloch wavefunction form factor is taken into account. A perturbative expansion is possible, even if the interaction is much stronger than the Fermi energy ε F . As a matter of principle, our work shows analytically how strong pairing can emerge from strong repulsion. Here, we illustrate our method with two examples: a 2D Dirac model and a 1D tight binding model with two orbitals. In the latter case, using density matrix renormalization group, we show that the analytical theory indeed guided us to discover the parameter regime where p-wave pairing with order-1 strength is dominant.

Ferromagnetic superconductors↗

CrystalPlan: an Experiment Planning Tool for Crystallography

Beam time at large user program based x-ray and neutron scattering facilities is in high demand and always at a premium. CrystalPlan, a highly efficient experiment planning software has been developed to maximize the use of available beamtime per sample per experiment. This program can calculate and optimize the data coverage of a crystal in reciprocal space in a single-crystal diffraction time-of- flight experiment. CrystalPlan can help a user build an experiment plan that will acquire the most data possible, with sufficient coverage but limited redundancy, therefore increasing scientific productivity. A user friendly GUI including a 3D viewer, an automated coverage optimizer, and an option to reorient the crystal for the measurement of selected hkls on specific detector positions are among its useful features. A sample use case of the program with the TOPAZ beamline at SNS will be presented.

data collection strategy↗

Improving reproducibility in synchrotron tomography using implementation-adapted filters

For reconstructing large tomographic datasets fast, filtered backprojection-type or Fourier-based algorithms are still the method of choice, as they have been for decades. These robust and computationally efficient algorithms have been integrated in a broad range of software packages. The continuous mathematical formulas used for image reconstruction in such algorithms are unambiguous. However, variations in discretization and interpolation result in quantitative differences between reconstructed images, and corresponding segmentations, obtained from different software. This hinders reproducibility of experimental results, making it difficult to ensure that results and conclusions from experiments can be reproduced at different facilities or using different software. In this paper, a way to reduce such differences by optimizing the filter used in analytical algorithms is proposed. These filters can be computed using a wrapper routine around a black-box implementation of a reconstruction algorithm, and lead to quantitatively similar reconstructions. Use cases for this approach are demonstrated by computing implementation-adapted filters for several open-source implementations and applying them to simulated phantoms and real-world data acquired at the synchrotron. Our contribution to a reproducible reconstruction step forms a building block towards a fully reproducible synchrotron tomography data processing pipeline.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PvaPy streaming framework for real-time data processing

User facility upgrades, new measurement techniques, advances in data analysis algorithms as well as advances in detector capabilities result in an increasing amount of data collected at X-ray beamlines. Some of these data must be analyzed and reconstructed on demand to help execute experiments dynamically and modify them in real time. In turn, this requires a computing framework for real-time processing capable of moving data quickly from the detector to local or remote computing resources, processing data, and returning results to users. In this paper, we discuss the streaming framework built on top of PvaPy, a Python API for the EPICS pvAccess protocol. We describe the framework architecture and capabilities, and discuss scientific use cases and applications that benefit from streaming workflows implemented on top of this framework. We also illustrate the framework's performance in terms of achievable data-processing rates for various detector image sizes.

EPICS pvAccess↗

X-ray magnetic diffraction under high pressure

Advances in both non-resonant and resonant X-ray magnetic diffraction since the 1980s have provided researchers with a powerful tool for exploring the spin, orbital and ion degrees of freedom in magnetic solids, as well as parsing their interplay. Here, we discuss key issues for performing X-ray magnetic diffraction on single-crystal samples under high pressure (above 40 GPa) and at cryogenic temperatures (4 K). We present case studies of both non-resonant and resonant X-ray magnetic diffraction under pressure for a spin-flip transition in an incommensurate spin-density-wave material and a continuous quantum phase transition of a commensurate all-in–all-out antiferromagnet. Both cases use diamond-anvil-cell technologies at third-generation synchrotron radiation sources. In addition to the exploration of the athermal emergence and evolution of antiferromagnetism discussed here, these techniques can be applied to the study of the pressure evolution of weak charge order such as charge-density waves, antiferro-type orbital order, the charge anisotropic tensor susceptibility and charge superlattices associated with either primary spin order or softened phonons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Temporal Forecasting of Distributed Temperature Sensing in a Thermal Hydraulic System With Machine Learning and Statistical Models

We benchmark performance of long-short term memory (LSTM) network machine learning model and autoregressive integrated moving average (ARIMA) statistical model in temporal forecasting of distributed temperature sensing (DTS). Data in this study consists of fluid temperature transient measured with two co-located Rayleigh scattering fiber optic sensors (FOS) in a forced convection mixing zone of a thermal tee. We treat each gauge of a FOS as an independent temperature sensor. We first study prediction of DTS time series using Vanilla LSTM and ARIMA models trained on prior history of the same FOS that is used for testing. The results yield maximum absolute percentage error (MaxAPE) and root mean squared percentage error (RMSPE) of 1.58% and 0.06% for ARIMA, and 3.14% and 0.44% for LSTM, respectively. Next, we investigate zero-shot forecasting (ZSF) with LSTM and ARIMA trained on history of the co-located FOS only, which is advantageous when limited training data is available. The ZSF MaxAPE and RMSPE values for ARIMA are comparable to those of the Vanilla use case, while the error values for LSTM increase. We show that in ZSF, performance of LSTM network can be improved by training on most correlated gauges between the two FOS, which are identified by calculating the Pearson correlation coefficient. The improved ZSF MaxAPE and RMSPE for LSTM are 4.4% and 0.33%, respectively. Performance of ZSF LSTM can be further enhanced through transfer learning (TL), where LSTM is re-trained on a subset of the FOS that is the target of forecasting. We show that LSTM pre-trained on correlated dataset and re-trained on 30% of testing target dataset achieves MaxAPE and RMSPE values of 2.32% and 0.28%, respectively.

ARIMA↗

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗

Charge Management for an Inductively Charged On-Demand Battery-Electric Shuttle Service with High Penetration of Renewable Energy

This paper presents a charge management control strategy for an on-demand battery-electric shuttle van operating at the National Renewable Energy Laboratory (NREL) campus and supported by day-time inductive charging at the vehicle's waiting spot. A new control algorithm has been proposed for reducing the demand charge costs incurred from wireless charging of the on-demand shuttle. A custom controller has been developed to monitor the shuttle, wireless charger, renewable energy generation, and various loads at NREL's campus, and regulate charging behavior for demand response. The intermittent renewable generation and sporadic operation of the on-demand shuttle service contribute to a high level of uncertainty in expected campus load profile, which must be carefully managed. The control algorithm predicts energy profile to estimate the mobility needs of the vehicle and maintain uninterrupted service during operation while still minimizing peak demand. The proposed controller has been designed and optimized using a Simulink model for the entire system. Next, it has been implemented and tested in real-time on the NREL campus. Two primary vehicle-use cases, charge sustaining and charge depletion operation, are tested under different load profiles and drive cycles to assess the controller's effectiveness at reducing peak demand and therefore demand charges. The proposed controller showed robust performance under different driving scenarios with high correlation between simulated and experimental data. The results showed that proper demand response can be achieved with an average of 94% reduction of charging loads during peak demand events.

ADVANCED PROPULSION SYSTEMS,ENERGY STORAGE↗

Integration of Multiple Real-time Simulation Platforms with AIO for Scalability

This paper introduces a practical and scalable approach to extend interoperability of Controller Hardware in the Loop (CHIL) validations for large scale microgrids, networked microgrids, and power electronics-based feeders. The work focuses on integrating multiple real-time simulators using Analog Input/Output (AIO) interface techniques in heterogeneous CHIL environment. It explores interfacing methods, highlighting key challenges related to dynamic accuracy and maintaining bidirectional power balance. A comparative evaluation of the Ideal Transformer Method is presented, assessing its effectiveness in multi-CHIL integration scenarios. The feasibility of this setup is demonstrated through a real-time use case involving multiple Typhoon HIL and Opal-RT platforms, showcasing its applicability for distributed system studies.

Khalid, Mohammad [ORNL] (ORCID:0000000179208805)↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

Multi-Channel Large Network Simulation Including Adversarial Activity

Using network simulation to generate high fidelity networks is essential to test adversarial search problems, in addition to their benefits of privacy preservation and benchmarking purposes. Different generative models have been developed to generate single-channel, homogeneous networks that can model domains such as social networks, communication, and co-authorship. Modeling adversarial activity compounds the complexity of network simulation as it requires generating multi-channel networks simultaneously with correlated channel attributes at scale. We present a methodology along with scalable graph modeling and generation tools to produce realistic large-scale synthetic background activity graphs with embedded an adversarial activity. We present a concrete use case based on an attack scenario developed with the help of subject matter experts (SMEs). We discuss challenges in modeling integration across channels, scalability of the generative models, and integration across such models. We also discuss required aspects to simulate high fidelity multi-channel networks up-to an order of billion edges.

Network simulation, Multi-channel simulation, Adve↗

Efficient loading of reduced data ensembles produced at ORNL SNS/HFIR neutron time-of-flight facilities

We present algorithmic improvements to the loading operations of certain reduced data ensembles produced from neutron scattering experiments at Oak Ridge National Laboratory (ORNL) facilities. Ensembles from multiple measurements are required to cover a wide range of the phase space of a sample material of interest. They are stored using the standard NeXus schema on individual HDF5 files. This makes it a scalability challenge, as the number of experiments stored increases in a single ensemble file. The present work follows up on our previous efforts on data management algorithms, to address identified input output (I/O) bottlenecks in Mantid, an open-source data analysis framework used across several neutron science facilities around the world. We reuse an in-memory binary-tree metadata index that resembles data access patterns, to provide a scalable search and extraction mechanism. In addition, several memory operations are refactored and optimized for the current common use cases, ranging most frequently from 10 to 180, and up to 360 separate measurement configurations. Results from this work show consistent speed ups in wall-clock time on the Mantid LoadMD routine, ranging from 19% to 23% on average, on ORNL production computing systems. The latter depends on the complexity of the targeted instrument-specific data and the system I/O and compute variability for the shared computational resources available to users of ORNL’s Spallation Neutron Source (SNS) and the High Flux Isotope Reactor (HFIR) instruments. Nevertheless, we continue to highlight the need for more research to address reduction challenges as experimental data volumes, user time and processing costs increase.

Godoy, William↗

Transactional Knowledge Graph Generation To Model Adversarial Activities

A Knowledge Graph (KG) is a formal and structured representation of facts, relationships, and semantic descriptions of a set of entities. Traditionally, KGs are used to describe metadata about entities and to provide additional context to target application results. Many real-world domains also involve temporal interactions between entities in addition to the metadata data. Modeling these attributed transactions is a critical requirement when using KGs in complex real-world applications. Modeling adversarial activities is one such application that develops methodology and tools to produce realistic large-scale background activity graphs that include embedded Weapons of Mass Destruction (WMD) activity patterns. We present a novel platform for constructing a transactional knowledge graph from a diverse set of sources. We present the core components and architecture of the framework, and a use case for generating a background knowledge graph and WMD activity template to evaluate network alignment and subgraph matching algorithms.

Purohit, Sumit↗

Adaptive Generation of Training Data for ML Reduced Model Creation

Machine learning proxy models are often used to speed up or completely replace complex computational models. The greatly reduced and deterministic computational costs enable new use cases such as digital twin control systems and global optimization. The challenge of building these proxy models is generating the training data. A naive uniform sampling of the input space can result in a non-uniform sampling of the output space of a model. This can cause gaps in the training data coverage that can miss finer scale details resulting in poor accuracy. While larger and larger data sets could eventually fill in these gaps, the computational burden of full-scale simulation codes can make this prohibitive. In this paper, we present an adaptive data generation method that utilizes uncertainty estimation to identify regions where training data should be augmented. By targeting data generation to areas of need, representative data sets can be generated efficiently. The effectiveness of this method will be demonstrated on a simple one-dimensional function and a complex multidimensional physics model.

Cianciosa, Mark↗