Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “times”

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 919 records · Page 51

Time-resolved X-ray Spectroscopy from the Atomic Orbital Ground State Up

X-ray spectroscopy has been a key method to determine ground and excited state properties of quantum materials with atomic specificity. Now, new x-ray facilities are opening the door to the study of pump-probe x-ray spectroscopy - specifically time-resolved x-ray absorption (trXAS) and time-resolved resonant inelastic x-ray scattering (trRIXS). In this paper we will present simulations of each of these spectroscopies using a time-domain full atomic multiplet, charge transfer Hamiltonian, adapted to study the properties of a generalized cluster model including a central transition metal ion caged by ligand atoms in a planar geometry. The numerically evaluated trXAS and trRIXS cross-sections for representative electron configurations 3d9 and 3d8 demonstrate the insights that can be obtained from charge transfer pumping, and how this nonequilibrium process affects ground and excited state properties. The straightforward characterization of the excitations in these systems, based on our analysis of the simulations, can serve as a benchmark for future experiments, as access to these time-resolved spectroscopic techniques becomes more widely available.

Jost, Daniel↗

Interplay Between Time and Energy in Bosonic Noisy Quantum Metrology

Quantum entanglement and coherence often allow for protocols that outperform classical ones in estimating a system’s parameter. When using infinite-dimensional probes (such as a bosonic mode), one could, in principle, obtain infinite precision in a finite time for both classical and quantum protocols, which makes it hard to quantify potential quantum advantage. However, such a situation is unphysical, as it would require infinite resources, so one needs to impose some additional constraint: typically the average energy employed by the probe is finite. Here we treat both energy and time as a resource, showing that, in the presence of noise, there is a nontrivial interplay between the average energy and the time devoted to the estimation. Our results are valid for the most general metrological schemes (e.g., adaptive schemes, which may involve entanglement with external ancillae or any kind of continuous measurement). We apply recently derived precision bounds for all parameters characterizing the paradigmatic case of a bosonic mode, subject to Lindbladian noise. We show how the time employed in the estimation should be partitioned in order to achieve the best possible precision. In most cases, the optimal performance may be obtained without the necessity of adaptivity or entanglement with ancilla. We compare results with classical strategies. Interestingly, for temperature estimation, applying a fast-prepare-and-measure protocol with Fock states provides better scaling with the number of photons than any classical strategy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗

A design of resonant inelastic X-ray scattering (RIXS) spectrometer for spatial- and time-resolved spectroscopy

The optical design of a Hettrick–Underwood-style soft X-ray spectrometer with Wolter type 1 mirrors is presented. The spectrometer with a nominal length of 3.1 m can achieve a high resolving power (resolving power higher than 10000) in the soft X-ray regime when a small source beam (<3 µm in the grating dispersion direction) and small pixel detector (5 µm effective pixel size) are used. Adding Wolter mirrors to the spectrometer before its dispersive elements can realize the spatial imaging capability, which finds applications in the spectroscopic studies of spatially dependent electronic structures in tandem catalysts, heterostructures, etc . In the pump–probe experiments where the pump beam perturbs the materials followed by the time-delayed probe beam to reveal the transient evolution of electronic structures, the imaging capability of the Wolter mirrors can offer the pixel-equivalent femtosecond time delay between the pump and probe beams when their wavefronts are not collinear. In combination with some special sample handing systems, such as liquid jets and droplets, the imaging capability can also be used to study the time-dependent electronic structure of chemical transformation spanning multiple time domains from microseconds to nanoseconds. The proposed Wolter mirrors can also be adopted to the existing soft X-ray spectrometers that use the Hettrick–Underwood optical scheme, expanding their capabilities in materials research.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Control Scheme to Mitigate the Dead-Time Effects in a Wireless Power Transfer System

In practice, a dead-time is always provided between the complementary switching instances of the inverter phase-leg devices. At higher operating frequencies, the dead-time issues in wireless power transfer (WPT) systems become critical, especially as the power level increases. In certain operating conditions, the dead-time effect in wireless power transfer system affects the switching characteristics. Consequently, the switching losses in the power semiconductor devices increase and also impact the efficiency of the overall system. In this paper, a simple control scheme is proposed to eliminate the dead-time effect (or voltage polarity reversal) in the WPT inverter. The proposed control scheme monitors the inverter output voltage, and the switching frequency is auto-tuned to eliminate the undesired switching instances in the inverter voltage. The proposed control scheme is validated using the closed-loop simulations in PLECS, and the experimental results on a 5.6 kW WPT prototype are also presented. After eliminating the voltage-polarity-reversal at the inverter output, the inverter losses were reduced by ~40%, and the overall system losses were reduced by ~17%.

Kavimandan, Utkarsh↗

Tula: Optimizing Time, Cost, and Generalization in Distributed Large-Batch Training

Distributed training increases the number of batches processed per iteration either by scaling-out (adding more nodes) or scaling-up (increasing the batch-size). However, the largest configuration does not necessarily yield the best performance. Horizontal scaling introduces additional communication overhead, while vertical scaling is constrained by computation cost and device memory limits. Thus, simply increasing the batch-size leads to diminishing returns: training time and cost decrease initially but eventually plateaus, creating a knee-point in the time/cost vs. batch-size pareto curve. The optimal batch-size therefore depends on the underlying model, data and available compute resources. Large batches also suffer from worse model quality due to the well-known “generalization gap”. In this paper, we present Tula, an online service that automatically optimizes time, cost, and convergence quality for large-batch training of convolutional models. It combines parallel-systems modeling with statistical performance prediction to identify the optimal batchsize. Tula predicts training time and cost within 7.5−14% error across multiple models, and achieves up to 20× overall speedup and improves test accuracy by ≈9% on average over standard large-batch training on various vision tasks, thus successfully mitigating the generalization gap and accelerating training at the same time.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗

Real-time Implementation of Grid Code Compliant Grid Edge Energy Management System

Integrated distributed energy resources (DER) in a distribution system need to follow grid codes to avoid violations that result in DER/circuit segment disconnection. To comply with grid code requirements at the grid edge level, network constrained grid edge energy management system (EMS) can be deployed. The objective of grid edge EMS is to provide economic solution for active and reactive power DER setpoints at each dispatch interval and ensure voltage regulation to support secure interconnection of the grid edge segment to the distribution system with multiple inverter based DER units. In this work, real-time simulation of grid code compliant grid edge EMS is deployed in a realistic feeder circuit segment. For real-time simulation, communication between the grid edge EMS and DERs is done exploiting IEC 61850-7-420. It enables interoperability among different DERs and grid edge EMS. No prior art has deployed IEC 61850-7-420 GOOSE communication protocol for grid edge EMS. Conversion of IEC 61850 GOOSE messages to Modbus communication protocol is also performed to communicate with grid edge EMS in commodity-off the shelf embedded boards in this work. The real-time simulation in OPAL-RT real-time digital simulator shows the out-performance of grid edge EMS by reducing the voltage violation in the distribution circuit.

Energy management system↗

Fidelity Comparison of Time-Bin and Fock State Encoding in Hybrid Quantum Systems Under Channel and Transduction Effects

Future quantum networks are expected to integrate a heterogeneous combination of quantum systems, owing to the diverse advantages offered by different physical platforms in terms of scalability, coherence times, and interfacing capabilities. Within the context of this emerging quantum communication paradigm, this paper presents an analytical comparison of two photonic encoding schemes—time-bin and Fock state (single rail)—in hybrid quantum systems where flying qubits are entangled with stationary matter qubits. We evaluate their resilience against fiber channel and quantum transduction effects by calculating the fidelity of the final states relative to their ideal forms. Employing the characteristic function approach, we derive analytical fidelity expressions and investigate their dependence on parameters such as transmissivity, noise levels, fiber length, and source generation success probability. Additionally, we simulate the scenario with a dedicated QuTiP software implementation to verify the validity of the theoretical models. Our findings reveal that due to its inherent single-mode structure, the Fock state encoding consistently outperforms time-bin encoding in fidelity, as this structure significantly minimizes susceptibility to losses compared to the two-mode nature of the time-bin scheme. This analysis offers valuable insights for future hybrid quantum communication and information processing applications.

Fiorini, Francesco [Pisa U.]↗

MAD: Self-Supervised Masked Anomaly Detection Task for Multivariate Time Series

In this paper, we introduce Masked Anomaly Detection (MAD), a general self-supervised learning task for multivariate time series anomaly detection. With the increasing availability of sensor data from industrial systems, being able to detecting anomalies from streams of multivariate time series data is of significant importance. Given the scarcity of anomalies in real-world applications, the majority of literature has been focusing on modeling normality. The learned normal representations can empower anomaly detection as the model has learned to capture certain key underlying data regularities. A typical formulation is to learn a predictive model, i.e., use a window of time series data to predict future data values. In this paper, we propose an alternative self-supervised learning task. By randomly masking a portion of the inputs and training a model to estimate them using the remaining ones, MAD is an improvement over the traditional left-to-right next step prediction (NSP) task. Our experimental results demonstrate that MAD can achieve better anomaly detection rates over traditional NSP approaches when using exactly the same neural network (NN) base models, and can be modified to run as fast as NSP models during test time on the same hardware, thus making it an ideal upgrade for many existing NSP-based NN anomaly detection models.

97 MATHEMATICS AND COMPUTING↗

Real-time Simulation of Coordinated Sub-Transmission Volt-Var Control Tool under High Distributed PV Penetration

With the rapid penetration of intermittent solar photovoltaic (PV) and other distributed energy resources (DER) into the grid, and subsequent changes in power flow patterns in both distribution and sub-transmission, voltage regulation is becoming a major challenge. It is prudent to leverage PV and DER to provide ancillary services to the grid, such as voltage regulation. Recently, a quasi-static, coordinated real-time sub transmission volt-var control algorithm (CReST-VCT) was developed for voltage regulation under high PV penetration by dispatching the reactive power settings of the shunt devices and PV inverters. The algorithm was validated offline, on a quasistatic study. Such quasi-static dispatching algorithms cannot guarantee its performance for highly nonlinear dynamical power systems. In this paper the performance of the algorithm is validated with a real time nonlinear dynamic simulation of a modified IEEE 118 bus system in Opal-RT. The real time simulation is used to emulate the actual system operation, providing a more realistic testing environment for CReST-VCT. The dispatch and control signals are communicated between the power system (Opal solver) and the control center (GAMS solver) in real-time with a MODBUS bridge. The results demonstrate i) system is stable with the new dispatch points ii) significant improvement in system-wide voltage profiles compared to an uncontrolled scenario. Another significant contribution of the work is developing a framework for dispatchable, long duration dynamic simulations that can be leveraged for market/dispatch studies.

CReST-VCT, Opal-RT, Volt/Var Control, renewable in↗

Real-Time Hardware-in-the-Loop Distributed Energy Resources System Testbed using IEEE 2030.5 Standard

IEEE 2030.5 standard is drawing special attention among communication protocols for smart inverters and distributed energy resources (DER). Moreover, California Rule 21 mandates new DER must be ready to communicate to a host utility using the IEEE 2030.5 standard. Therefore, development of an effective real-time simulation method for managing DER using IEEE 2030.5 network is crucial. This paper presents a real-time hardware-in-the-loop (HIL) DER system testbed using the IEEE 2030.5 standard. The proposed real-time co-simulation testbed consists of a DER physical system simulation using OP AL-RT real-time simulator and a cyber system simulation including DER gateways and a DER management system (DERMS) cloud server. Custom-built client and server programs are developed to meet the compliant with IEEE 2030.5-2018 standard and implemented in the DER gateways and a DERMS server, respectively. Furthermore, the feasibility of the proposed testbed for DER systems is validated by experiments.

42 ENGINEERING↗

Real-time Implementation of a Dual-Active-Bridge Based Multi-Level Photovoltaic Converter

Silicon-carbide based, multi-level converters with dual-active-bridge (DAB) are getting attention for medium voltage, direct grid-connected, utility-scale photovoltaic (PV) applications due to their higher efficiency and power density. To de-risk complex control development for these high-voltage and high-power inverters, hardware-in-the-loop techniques are often required. Due to the high switching frequency and the large number of power electronic switches, off-the-shelf, real-time simulation tools are not yet fully developed for this application, even with FPGA-based simulators. To address this, a new co-simulation approach in FPGA is presented that utilizes Time-Stamped Bridge (TSB) for the higher frequency converters along with detailed fixed conductance based discrete device simulation of the rest of the circuit. A complex DAB-based PV converter with maximum switching frequency of 50 kHz is successfully simulated in real-time in the FPGA and the results are compared with offline simulation results. A controller hardware-in-the-loop (CHIL) platform is developed to demonstrate real-time, closed-loop test results for this DAB-based PV converter.

Dong, Zerui↗

Pulsar Movement Animation and its Corresponding Signal Visualization for Timing Source

The global positioning system, widely used for synchronization in energy systems, faces vulnerabilities, while Pulsars—natural cosmic clocks—offer long-term stability as potential backup timing sources. Existing research lacks sufficient exploration of Pulsar signal animation under astrophysical factors, limiting practical applications. This study establishes a mathematical model based on the rotation dynamics of dual-beam Pulsars and implements dynamic signal visualization through MATLAB. The model dynamically illustrates the relative motion between Pulsar beams and observers via timeline calculations, beam intensity modeling, and rotation matrix derivation. A case study on the millisecond Pulsar J1939+2134 reveals that observer angles influence signal peak timing, while beam widths determine signal duration, highlighting the critical role of parameter calibration for timing accuracy. Open-source code and animation results are publicly shared, providing tools for interdisciplinary research. This study validates the feasibility of Pulsar-based timing in energy systems, offering new insights to enhance synchronization robustness.

Wu, Ori [ORNL] (ORCID:0000000326723410)↗

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

Real Time Data Analysis With the ATLAS Trigger at the LHC in Run-2

The trigger selection capabilities of the ATLAS detector have been significantly enhanced for the LHC Run- 2 in order to cope with the higher event rates and with the large number of simultaneous interactions (pile-up) per protonproton bunch crossing. A new hardware system, designed to analyse real time event-topologies at Level-1 came to full use in 2017. A hardware-based track reconstruction system, expected to be used real-time in 2018, is designed to provide track information to the high-level software trigger at its full input rate. The high-level trigger selections are largely relying on offline-like reconstruction techniques, and in some cases multivariate analysis methods. Despite the sudden change in LHC operations during the second half of 2017, which caused an increase in pile-up and therefore also in CPU usage of the trigger algorithms, the set of triggers (so called trigger menu) running online has undergone only minor modifications thanks to the robustness and redundancy of the trigger system, and the use of a levelling luminosity scheme in agreement with LHC and other experiments. Here, this presentation gives a brief yet comprehensive review of the real-time performance of the ATLAS trigger system in 2017. Considerations will be presented on the most relevant parameters of the trigger (efficiency to collect signal and output data rate) as well as details on some aspects of the algorithms which are run real-time on the High Level Trigger CPU farm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies

Here, in this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value; however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS socket.io server.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accelerated Probabilistic Marching Cubes by Deep Learning for Time-Varying Scalar Ensembles

Visualizing the uncertainty of ensemble simulations is challenging due to the large size and multivariate and temporal features of en-semble data sets. One popular approach to studying the uncertainty of ensembles is analyzing the positional uncertainty of the level sets. Probabilistic marching cubes is a technique that performs Monte Carlo sampling of multivariate Gaussian noise distributions for positional uncertainty visualization of level sets. However, the technique suffers from high computational time, making interactive visualization and analysis impossible to achieve. This paper introduces a deep-learning-based approach to learning the level-set uncertainty for two-dimensional ensemble data with a multivariate Gaussian noise assumption. We train the model using the first few time steps from time-varying ensemble data in our workflow. We demonstrate that our trained model accurately infers uncertainty in level sets for new time steps and is up to 170X faster than that of the original probabilistic model with serial computation and 10X faster than that of the original parallel computation.

Han, Mengjiao↗

State of the Art in Time‐Dependent Flow Topology: Interpreting Physical Meaningfulness Through Mathematical Properties

Abstract We present a state‐of‐the‐art report on time‐dependent flow topology. We survey representative papers in visualization and provide a taxonomy of existing approaches that generalize flow topology from time‐independent to time‐dependent settings. The approaches are classified based upon four categories: tracking of steady topology, reference frame adaption, pathline classification or clustering, and generalization of critical points. Our unique contributions include introducing a set of desirable mathematical properties to interpret physical meaningfulness for time‐dependent flow visualization, inferring mathematical properties associated with selective research papers, and utilizing such properties for classification. The five most important properties identified in the existing literature include coincidence with the steady case, induction of a partition within the domain, Lagrangian invariance, objectivity, and Galilean invariance.

Bujack, Roxana↗