Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TIME”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Estimating time in quantum chaotic systems and black holes

We characterize new universal features of the dynamics of chaotic quantum many-body systems, by considering a hypothetical task of "time estimation". Most macroscopic observables in a chaotic system equilibrate to nearly constant late-time values. Intuitively, it should become increasingly difficult to estimate the precise value of time by making measurements on the state. We use a quantity called the Fisher information from quantum metrology to quantify the minimum uncertainty in estimating time. Due to unitarity, the uncertainty in the time estimate does not grow with time if we have access to optimal measurements on the full system. Restricting the measurements to act on a small subsystem or to have low computational complexity leads to results expected from equilibration, where the time uncertainty becomes large at late times. With optimal measurements on a subsystem larger than half of the system, we regain the ability to estimate the time very precisely, even at late times. Hawking's calculation for the reduced density matrix of the black hole radiation in semiclassical gravity contradicts our general predictions for unitary quantum chaotic systems. Hawking's state always has a large uncertainty for attempts to estimate the time using the radiation, whereas our general results imply that the uncertainty should become small after the Page time. This gives a new version of the black hole information loss paradox in terms of the time estimation task. By restricting to simple measurements on the radiation, the time uncertainty becomes large. This indicates from a new perspective that the observations of computationally bounded agents are consistent with the semiclassical effective description of gravity.

Black holes↗
DOE OSTI2024

Full time-dependent SOLPS-ITER simulation of the SPARC tokamak: actuator design for particle and divertor condition control *

Abstract This paper presents the application of full time-dependent SOLPS-ITER simulations for actuator design in the SPARC tokamak. This study employs both the EIRENE module, a neutral solver, and the B2.5 plasma module in a time-dependent mode. This is in contrast to most SOLPS simulations, which focus on steady-state solutions, where the neutral distribution is evolved without any time limit or for a time step of 1 ⋅ 10 − 3 second, which is several orders of magnitude larger than the fluid plasma time step. The time-dependent EIRENE was tested with a fixed B2.5 background and compared with a simple conductance based model in a simplified pump chamber geometry. This comparison aimed to verify the reliability of the neutral relaxation timescale derived from the time-dependent EIRENE. Subsequently, a full time-dependent simulation was performed in a realistic geometry, with the Monte-Carlo neutral time step synchronized with the plasma fluid time step. The numerical setup of the code, including relative time steps and the size of the census data used to store Monte-Carlo particle information is considered. The full-time dependent simulations are then applied to inform the design of the SPARC louver structure, which affects divertor plasma parameters by regulating the neutral conductance from the divertor to the pump. The response of the plasma and neutral parameters was captured on a timescale that enables the design of the actuator to consider time-dependent control capability. It was found that changing the louver opacity has an equivalent effect as varying the gas throughput via puff actuation. Therefore, equivalent divertor plasma conditions can be obtained from both actuators, while the neutral pressure distribution in the pump and divertor differs for each actuator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A space-time parallel algorithm with adaptive mesh refinement for computational fluid dynamics

This work describes a space-time parallel algorithm with space-time adaptive mesh refinement (AMR). AMR with subcycling is added to multigrid reduction-in-time (MGRIT) in order to provide solution efficient adaptive grids with a reduction in work performed on coarser grids. This algorithm is achieved by integrating two software libraries: XBraid (Parallel time integration with multigrid. https://computation.llnl.gov/projects/parallel-timeintegration-multigrid) and Chombo (Chombo software package for AMR applications—design document, 2014). The former is a parallel time integration library using multigrid and the latter is a massively parallel structured AMR library. Employing this adaptive space-time parallel algorithm is Chord (Comput Fluids 123:202–217, 2015), a computational fluid dynamics (CFD) application code for solving compressible fluid dynamics problems. For the same solution accuracy, speedups are demonstrated from the use of space-time parallelization over the time-sequential integration on Couette flow and Stokes’ second problem. On a transient Couette flow case, at least a 1.5× speedup is achieved, and with a time periodic problem, a speedup of up to 13.7× over the time-sequential case is obtained. In both cases, the speedup is achieved by adding processors and exploring additional parallelization in time. The numerical experiments show the algorithm is promising for CFD applications that can take advantage of the time parallelism. Future work will focus on improving the parallel performance and providing more tests with complex fluid dynamics to demonstrate the full potential of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Time Resolution Measurements of EJ-232Q With Single- and Dual-Sided Readouts

In view of its importance to applications in high energy physics, nuclear security, and time-of-flight PET, the time resolution of 0.5% benzophenone-quenched EJ-232Q plastic scintillators of various lengths was studied using a fast waveform digitizer and fast PMTs. The scintillator sizes were 5 mm × 5 mm × 10, 25, 50, 75, or 100 mm. First, the timing measurements were performed by using a single PMT reading out one end. The degradation in time resolution with increasing scintillator length was studied. The irradiation geometry was also observed to have a non-negligible impact on the time resolution due to the variation of depth-of-interaction positions, especially for the scintillators with a high aspect ratio. Second, two PMTs were employed for a dual-sided readout. This readout together with the mean time method was demonstrated to be an effective approach to improve the timing performance since the depth-of-interaction-related effect was considerably mitigated. A time resolution of 79 ± 1 ps (full-width at half-maximum) has been achieved for the 5 × 5 × 10 mm 3 scintillator. The 5 × 5 × 100 mm 3 scintillator can still provide a time resolution as good as 172 ± 1 ps. Here, the energy range used for each was between 340 keVee and 450 keVee. In addition, the time information from individual PMTs in a dual-sided readout was able to show a time resolution almost identical to that determined with the mean-time-based technique after correcting for the depth-of-interaction variation for the 100 mm long scintillator.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Characterizing Performance of Freshwater Wetland Methane Models Across Time Scales at FLUXNET-CH 4 Sites Using Wavelet Analyses

Process-based land surface models are important tools for estimating global wetland methane (CH 4 ) emissions and projecting their behavior across space and time. So far there are no performance assessments of model responses to drivers at multiple time scales. In this study, we apply wavelet analysis to identify the dominant time scales contributing to model uncertainty in the frequency domain. We evaluate seven wetland models at 23 eddy covariance tower sites. Our study first characterizes site-level patterns of freshwater wetland CH 4 fluxes (FCH 4 ) at different time scales. A Monte Carlo approach was developed to incorporate flux observation error to avoid misidentification of the time scales that dominate model error. Our results suggest that (a) significant model-observation disagreements are mainly at multi-day time scales (<15 days); (b) most of the models can capture the CH 4 variability at monthly and seasonal time scales (>32 days) for the boreal and Arctic tundra wetland sites but have significant bias in variability at seasonal time scales for temperate and tropical/subtropical sites; (c) model errors exhibit increasing power spectrum as time scale increases, indicating that biases at time scales <5 days could contribute to persistent systematic biases on longer time scales; and (d) differences in error pattern are related to model structure (e.g., proxy of CH 4 production). Our evaluation suggests the need to accurately replicate FCH 4 variability, especially at short time scales, in future wetland CH 4 model developments.

58 GEOSCIENCES↗
DOE OSTI2025

Absolute timing calibration of the Resolve microcalorimeter spectrometer on the X-ray Imaging and Spectroscopy Mission

The Resolve microcalorimeter spectrometer on the X-ray Imaging and Spectroscopy Mission (XRISM) is designed to have a good timing capability with the mission-level requirement of 1 ms as the absolute time tagging accuracy to suffice the needs for observatory science. In the ground calibration campaign, the absolute and relative timing offsets were measured using pulsed X-rays from the modulated X-ray sources. These offsets were used to determine calibration parameters, the Resolve timing coefficients, which are used in the offline correction of event times. In the orbit, reevaluation of the timing coefficients was carried out using the Crab pulsar, which was observed in two periods, one in the performance verification phase and the other in the guest observation phase. We report the absolute timing calibration of XRISM/Resolve using the ground and in-orbit data. Although the requirement is likely satisfied with the ground parameters, the timing coefficients have been refined using the in-orbit calibration to improve the timing accuracy. In addition, for the first time, we present the interpretation of the absolute timing offset originating from the analog and digital processing of X-ray events unique to a microcalorimeter spectrometer and present a complete view of the timing error of the Resolve instrument.

Astronomy and AstroPhysics↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The ETROC2 as the Final Version for CMS Endcap Timing Layer (ETL) Upgrade

The ETROC (Endcap Timing Readout Chip) is being developed for the LGAD-based CMS Endcap Timing Layer (ETL) at HL-LHC. The ETL on each side of the interaction region will be instrumented with a two-disk system of MIP-sensitive LGAD (Low Gain Avalanche Diodes) silicon devices, read out by ETROCs for precision timing measurement with down to ~30 ps timing resolution per track. The ETROC is designed to handle a 16 x 16 pixel cell matrix, with each pixel being 1.3 mm x 1.3 mm to match the LGAD sensor pixel size. The front-end design for preamplifier and discriminator has been specifically optimized for the reduced LGAD signals, with enough flexibilities to meet the ETL specific needs for time resolution, power budget and radiation profile. The ETROC chip is implemented in a commercial 65nm CMOS process. Each channel consists of a preamplifier, a discriminator, a TDC used for TOA (Time Of Arrival) and TOT (Time Over Threshold) measurements, and a memory for data storage and readout. An in-pixel auto threshold calibration is included, along with a self-testing pattern generator. The TOT is used for time-walk correction of the TOA measurement. The detailed hit information (TOA and TOT) from each cell will be read out from a local circular buffer after each Level-1 Accept (about 1 MHz). In addition, a charge injection circuit is implemented to allow for testing and calibration. For more detailed monitoring of the signal pulses, waveform sampling circuits are included for one pixel. The clock distribution is based on a 16x16 H-tree design with a shielding structure to alleviate potential interference. The global peripheral circuits include a PLL, a phase shifter, an I2C slave controller, a fast control block, a global readout, and a data driver along with an efuse and temperature sensor. The ETROC builds event data frames for each L1A selected event and is also capable of providing L1 trigger information for user-defined delayed hits. The main design challenge is how to extract precision timing information from the small LGAD signals in the presence of high irradiation fluence, while keeping the power consumption and digital activity low. The ETL design goal for the time resolution of 50 ps per hit is required to achieve a 35 ps arrival time measurement for a MIP particle, which has its track registered in two ETL disk layers. The LGAD contribution is known to be about 30 ps, this means that the jitter from the ETROC has to be kept below 40 ps. The ETROC2 is the first full size full functionality prototype design fully compatible with the final chip specifications for CMS ETL and now becomes the final version. The ETROC2 chips have been extensively tested. We will present here new testing results including the bump bonding yield improvement study, the time walk correction (TWC) generality study with one pixel TWC applying to all pixels, the final SEU testing using both heavy ion and proton beam, more beam test studies including different sensors, and readiness for the ETROC2 production for CMS ETL upgrade.

Liu, Tiehui [Fermilab] (ORCID:0009000765225605)↗
DOE OSTI2020

DEEP CELLULAR RECURRENT NEURAL ARCHITECTURE FOR EFFICIENT MULTIDIMENSIONAL TIME-SERIES DATA PROCESSING

Efficient processing of time series data is a fundamental yet challenging problem in pattern recognition. Though recent developments in machine learning and deep learning have enabled remarkable improvements in processing large scale datasets in many application domains, most are designed and regulated to handle inputs that are static in time. Many real-world data, such as in biomedical, surveillance and security, financial, manufacturing and engineering applications, are rarely static in time, and demand models able to recognize patterns in both space and time. Current machine learning (ML) and deep learning (DL) models adapted for time series processing tend to grow in complexity and size to accommodate the additional dimensionality of time. Specifically, the biologically inspired learning based models known as artificial neural networks that have shown extraordinary success in pattern recognition, tend to grow prohibitively large and cumbersome in the presence of large scale multi-dimensional time series biomedical data such as EEG. Consequently, this work aims to develop representative ML and DL models for robust and efficient large scale time series processing. First, we design a novel ML pipeline with efficient feature engineering to process a large scale multi-channel scalp EEG dataset for automated detection of epileptic seizures. With the use of a sophisticated yet computationally efficient time-frequency analysis technique known as harmonic wavelet packet transform and an efficient self-similarity computation based on fractal dimension, we achieve state-of-the-art performance for automated seizure detection in EEG data. Subsequently, we investigate the development of a novel efficient deep recurrent learning model for large scale time series processing. For this, we first study the functionality and training of a biologically inspired neural network architecture known as cellular simultaneous recurrent neural network (CSRN). We obtain a generalization of this network for multiple topological image processing tasks and investigate the learning efficacy of the complex cellular architecture using several state-of-the?art training methods. Finally, we develop a novel deep cellular recurrent neural network (CDRNN) architecture based on the biologically inspired distributed processing used in CSRN for processing time series data. The proposed DCRNN leverages the cellular recurrent architecture to promote extensive weight sharing and efficient, individualized, synchronous processing of multi-source time series data. Experiments on a large scale multi-channel scalp EEG, and a machine fault detection dataset show that the proposed DCRNN offers state-of-the-art recognition performance while using substantially fewer trainable recurrent units.

Vidyaratne, Lasitha S.↗
DOE OSTI2022

Capturing the interactions between ice sheets, sea level and the solid Earth on a range of timescales: a new “time window” algorithm

Retreat and advance of ice sheets perturb the gravitational field, solid surface and rotation of the Earth, leading to spatially variable sea-level changes over a range of timescales $\textit{O}$ (10 0–6 years), which in turn feed back onto ice-sheet dynamics. Coupled ice-sheet–sea-level models have been developed to capture the interactive processes between ice sheets, sea level and the solid Earth, but it is computationally challenging to capture short-term interactions $\textit{O}$ (10 0–2 years) precisely within longer $\textit{O}$ (10 3–6 years) simulations. The standard forward sea-level modelling algorithm assigns a uniform temporal resolution in the sea-level model, causing a quadratic increase in total CPU time with the total number of input ice history steps, which increases with either the length or temporal resolution of the simulation. In this study, we introduce a new “time window” algorithm for 1D pseudo-spectral sea-level models based on the normal mode method that enables users to define the temporal resolution at which the ice loading history is captured during different time intervals before the current simulation time. Utilizing the time window, we assign a fine temporal resolution $\textit{O}$ (10 0–2 years) for the period of ongoing and recent history of surface ice and ocean loading changes and a coarser temporal resolution $\textit{O}$ (10 3–6 years) for earlier periods in the simulation. This reduces the total CPU time and memory required per model time step while maintaining the precision of the model results. We explore the sensitivity of sea-level model results to the model temporal resolution and show how this sensitivity feeds back onto ice-sheet dynamics in coupled modelling. We apply the new algorithm to simulate sea-level changes in response to global ice-sheet evolution over two glacial cycles and the rapid collapse of marine sectors of the West Antarctic Ice Sheet in the coming centuries and provide appropriate time window profiles for each application. The time window algorithm reduces the total CPU time by ~ 50 % in each of these examples and changes the trend of the total CPU time increase from quadratic to linear. This improvement would increase with longer simulations than those considered here. Our algorithm also allows for coupling time intervals of annual temporal scale for coupled ice-sheet–sea-level modelling of regions such as West Antarctica that are characterized by rapid solid Earth response to ice changes due to the thin lithosphere and low mantle viscosities.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Discrete time analog front end circuit implemented in a receiver device

A device can comprise a peaked integrator circuit that generates an output signal from a continuous time signal based on a sub rate clock timing cycle. The device can further comprise a track and hold circuit coupled to the output of the peaked integrator that generates a held discrete time signal from the output of the peaked integrator based on a second sub rate clock timing cycle that is offset in time from the sub rate clock timing cycle by a single time unit interval. The device can further comprise an integrator circuit coupled to an output of the track and hold circuit that integrates the held discrete time signal, based on the second sub rate clock timing cycle that is offset in time from the sub rate clock timing cycle by a single time unit interval.

42 ENGINEERING↗
DOE OSTI2023

Quantifying and Understanding the Access Time to Dockless Micromobility: A Case Study in Washington, D.C.

Micromobility has been widely deployed in many cities. Similar as how access time/distance affects the travel demand to use public transit and informs transit system design, access time/distance to micromobility service measures its service efficiency and also serves as an equity indicator to inform city agencies from a regulation perspective. Though there is an increasing need to understand it, access to micromobility has not been sufficiently studied. This paper developed a framework to quantity the access time to dockless micromobility service (i.e., the minimum time needed to walk to reach the closest dockless micromobility vehicles). Based on the real-time vehicle location data collected from Washington, DC, this research quantified the access time to dockless micromobility, analyzed its spatial and temporal variation patterns and investigated its relationship with socio-demographic variables (i.e., population density, employment density and low-income population). The results revealed that the access time to dockless micromobility ranges between 0 to 4 minutes with the most frequently observed range of 0.5 to 1 minutes, and the city center area tends to have shorter access time than the outskirts areas. Results also indicate a quite stable access time level in DC with access time standard deviation of 0.2 to 0.5 minutes. After correlating the access time at census-block-group level with socio-demographic data, it was discovered that shorter access time usually aligns with larger population and employment density, and the proportion of low-income population was found not helpful with explaining the access time variation, which indicating a relatively equitable micromobility program.

access time↗
DOE OSTI2020

Comparing light-front quantization with instant-time quantization

Here in this paper we compare light-front quantization and instant-time quantization both at the level of operators and at the level of their Feynman diagram matrix elements. At the level of operators light-front quantization and instant-time quantization lead to equal light-front time commutation (or anticommutation) relations that appear to be quite different from equal instant-time commutation (or anticommutation) relations. Despite this we show that at unequal times instant-time and light-front commutation (or anticommutation) relations actually can be transformed into each other, with it only being the restriction to equal times that makes the commutation (or anticommutation) relations appear to be so different. While our results are valid for both bosons and fermions, for fermions there are subtleties associated with tip of the light cone contributions that need to be taken care of. At the level of Feynman diagrams we show for non-vacuum Feynman diagrams that the pole terms in four-dimensional light-front Feynman diagrams reproduce the widely used three-dimensional light-front on-shell Hamiltonian Fock space formulation in which the light-front energy and light-front momentum are on shell. Moreover, we show that the contributions of pole terms in non-vacuum instant-time and non-vacuum light-front Feynman diagrams are equal. However, because of circle at infinity contributions we show that this equivalence of pole terms fails for four-dimensional light-front vacuum tadpole diagrams. Then, and precisely because of these circle at infinity contributions, we show that light-front vacuum tadpole diagrams are not only nonzero, they quite remarkably are actually equal to the pure pole term instant-time vacuum tadpole diagrams. Light-front vacuum diagrams are not correctly describable by the on-shell Hamiltonian formalism, and thus not by the closely related infinite momentum frame prescription either. Thus for the light-front vacuum sector we must use the off-shell Feynman formalism as it contains information that is not accessible in the on-shell Hamiltonian Fock space approach. We show that light-front quantization is intrinsically nonlocal, and that for fermions this nonlocality is present in Ward identities. One can project fermion spinors into so-called good and bad components, and both of these components contribute in Ward identities. Central to our analysis is that the transformation from instant-time coordinates and fields to light-front coordinates and fields is a unitary, spacetime-dependent translation. Consequently, not only are instant-time quantization and light-front quantization equivalent, because of general coordinate invariance they are unitarily equivalent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Scale-Dependent Value of QPF for Real-Time Streamflow Forecasting

Incorporating rainfall forecasts into a real-time streamflow forecasting system extends the forecast lead time. Since quantitative precipitation forecasts (QPFs) are subject to substantial uncertainties, questions arise on the trade-off between the time horizon of the QPF and the accuracy of the streamflow forecasts. This study explores the problem systematically, exploring the uncertainties associated with QPFs and their hydrologic predictability. The focus is on scale dependence of the trade-off between the QPF time horizon, basin-scale, space-time scale of the QPF, and streamflow forecasting accuracy. To address this question, the study first performs a comprehensive independent evaluation of the QPFs at 140 U.S. Geological Survey (USGS) monitored basins with a wide range of spatial scales (~10 – 40,000 km 2 ) over the state of Iowa in the Midwestern United States. The study uses High-Resolution Rapid Refresh (HRRR) and Global Forecasting System (GFS) QPFs for short and medium-range forecasts, respectively. Using Multi-Radar Multi-Sensor (MRMS) quantitative precipitation estimate (QPE) as a reference, the results show that the rainfall-to-rainfall QPF errors are scale-dependent. The results from the hydrologic forecasting experiment show that both QPFs illustrate clear value for real-time streamflow forecasting at longer lead times in the short- to medium-range relative to the no-rain streamflow forecast. The value of QPFs for streamflow forecasting is particularly apparent for basin sizes below 1,000 km 2 . The space-time scale, or reference time t r ) (ratio of forecast lead time to basin travel time) ~ 1 depicts the largest streamflow forecasting skill with a systematic decrease in forecasting accuracy for t r > 1.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Technical Gaps in Hanford High-Level Waste Solids Settling Behavior and Settling Time Evaluation for Direct Feed High-Level Waste (DFHLW) Operations

Settling of high-level waste (HLW) solids in process vessels is a key conceptual process step in providing HLW feed directly to the Hanford Waste Treatment and Immobilization Plant (WTP) HLW Vitrification Facility. Direct Feed High-Level Waste (DFHLW) is a potential approach to initiating HLW vitrification prior to completing of the WTP Pretreatment Facility. Settling would be used with subsequent supernatant decant to concentrate HLW feed. To support planning for DFHLW, Washington River Protection Solutions (WRPS) requested support from the Pacific Northwest National Laboratory to evaluate the current data set available to predict the time needed for HLW solids to settle, to identify gaps in the understanding and predictive capability of HLW solids waste settling times, and to provide scoping estimates of the potential settling time. Eight technical gaps were identified for predicting settling times and characteristics of the formed sediment layers including: Gap 1: In-Tank Settling Rates Faster than Settling of Laboratory Samples, Gap 2: Effect of Sludge Leaching/Washing on Predicted Settling Times, Gap 3: Predicting Waste Settling from Waste Chemistry (Waste Type), Gap 4: Predicting Waste Settling from Particle Size and Density Distributions (PSDDs), Gap 5: Insufficient Laboratory and In-Tank Settling Data to Represent Hanford Waste, Gap 6: Methods for Real-Time, In-Tank Tracking of Settling, Gap 7: Prediction of Sediment Erosion Resistance as a Function of Settling Time, and Gap 8: Prediction of Sediment Solids Content as a Function of Settling Time. In addition to the data gaps, an overarching observation of the settling rate and settled layer data is the significant variation in behavior. At similar solids concentrations, settling rates can vary by as much as 3 orders of magnitude depending on the source waste tank, and significantly different settling rates are noted between laboratory and in situ tests for the same waste tank. The range of average solids concentration in existing HLW sediment, which may have been quiescent for decades, can vary from less than 7 wt% to greater than 74 wt% solids. The shear strengths (or yield stresses) measured on laboratory samples range from less than 27 Pa to greater than 6400 Pa. These variations can challenge process planning for the application of a settle/decant process for DFHLW. This report describes the significance of the gaps to the settle/decant process and presents uncertainties by way of examples. Potential technical approaches for resolving these gaps are described and the estimated difficulty in resolving these gaps is evaluated. Based on the significance of the gap and the difficulty of resolution, recommendations are made to address specific gaps. Scoping estimates of the potential settling times for DFHLW solids have been made based on the existing data set with its associated gaps. Depending on the process vessel depth and final sediment concentration, substantial fractions of the scoping estimate results for settling times for characterized HLW exceed the 2-week period that has been previously assumed for process planning. There is also significant disparity, potentially greater than a factor of 5000 difference, in the estimated settling times depending on process vessel depth and final sediment solid concentration. This variation in results underscores the significance of the identified gaps and uncertainties with respect to process planning for utilizing settle/decant operations for DFHLW.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗
DOE OSTI2022

THE DESIGN OF LAYER TIME OPTIMIZATION IN LARGE SCALE ADDITIVE MANUFACTURING WITH FIBER REINFORCED POLYMER COMPOSITES

In this study, we have developed a method to optimize a layer deposition time (a.k.a. layer time) for large-scale additive manufacturing (AM) via physics-based simulations. A long layer time leads to an over-cooled surface on which a new layer is deposited, and therefore, it may result in a weak bonding or debonding between layers, cracking, or warping. A short layer time leads to a high temperature of the structure due to insufficient cooling, and therefore, the structure may not be stiff enough and may collapse during manufacturing. Therefore, it is important to estimate the optimal layer time in additive manufacturing for a high-quality product. The temperature of a top layer right before deposition is recommended to be slightly higher than the glass temperature of the material. A temperature cooling was approximated to an exponential function of time, and the optimized layer time was obtained based on a target temperature while maintaining a minimal printing time. The material used is carbon fiber-reinforced polycarbonate (CF/PC), and the large-scale deposition system used is LSAM TM from Thermwood Corporation. Three different layer time cases were used for experiments, and a series of thermal images were obtained via an infra-red (IR) camera during the entire AM processes. AM process simulations were performed using a finite element method and the temperature profiles from the simulation were in good agreement with those from experiments. The layer time optimization was performed based on the temperature profiles from the simulations. A layer temperature with the optimal layer time was confirmed as the target temperature through simulation.

Jo, Eonyeon↗