Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “timing”

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,261 records · Page 70

Mining User Dwell Time for Personalized Web Search Re-Ranking

We propose a personalized re-ranking algorithm through mining user dwell times derived from a user's previously online reading or browsing activities. We acquire document level user dwell times via a customized web browser, from which we then infer conceptword level user dwell times in order to understand a user's personal interest. According to the estimated concept word level user dwell times, our algorithm can estimate a user's potential dwell time over a new document, based on which personalized webpage re-ranking can be carried out. We compare the rankings produced by our algorithm with rankings generated by popular commercial search engines and a recently proposed personalized ranking algorithm. The results clearly show the superiority of our method. In this paper, we propose a new personalized webpage ranking algorithmthrough mining dwell times of a user. We introduce a quantitative model to derive concept word level user dwell times from the observed document level user dwell times. Once we have inferred a user's interest over the set of concept words the user has encountered in previous readings, we can then predict the user's potential dwell time over a new document. Such predicted user dwell time allows us to carry out personalized webpage re-ranking. To explore the effectiveness of our algorithm, we measured the performance of our algorithm under two conditions - one with a relatively limited amount of user dwell time data and the other with a doubled amount. Both evaluation cases put our algorithm for generating personalized webpage rankings to satisfy a user's personal preference ahead of those by Google, Yahoo!, and Bing, as well as a recent personalized webpage ranking algorithm.

99 GENERAL AND MISCELLANEOUS↗

A Gaussian Process Based Online Change Detection Algorithm for Monitoring Periodic Time Series

Online time series change detection is a critical component of many monitoring systems, such as space and air-borne remote sensing instruments, cardiac monitors, and network traffic profilers, which continuously analyze observations recorded by sensors. Data collected by such sensors typically has a periodic (seasonal) component. Most existing time series change detection methods are not directly applicable to handle such data, either because they are not designed to handle periodic time series or because they cannot operate in an online mode. We propose an online change detection algorithm which can handle periodic time series. The algorithm uses a Gaussian process based non-parametric time series prediction model and monitors the difference between the predictions and actual observations within a statistically principled control chart framework to identify changes. A key challenge in using Gaussian process in an online mode is the need to solve a large system of equations involving the associated covariance matrix which grows with every time step. The proposed algorithm exploits the special structure of the covariance matrix and can analyze a time series of length T in O(T^2) time while maintaining a O(T) memory footprint, compared to O(T^4) time and O(T^2) memory requirement of standard matrix manipulation methods. We experimentally demonstrate the superiority of the proposed algorithm over several existing time series change detection algorithms on a set of synthetic and real time series. Finally, we illustrate the effectiveness of the proposed algorithm for identifying land use land cover changes using Normalized Difference Vegetation Index (NDVI) data collected for an agricultural region in Iowa state, USA. Our algorithm is able to detect different types of changes in a NDVI validation data set (with ~80% accuracy) which occur due to crop type changes as well as disruptive changes (e.g., natural disasters).

54 ENVIRONMENTAL SCIENCES↗

Space-time least-squares Petrov-Galerkin projection in nonlinear model reduction.

Our work proposes a space-time least-squares Petrov-Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply Petrov-Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space-time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space-time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted ℓ 2 -norm. This norm can be de ned to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space-time collocation and space-time GNAT variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov-Galerkin projection include: (1) a reduction of both the spatial and temporal dimensions of the dynamical system, (2) the removal of spurious temporal modes (e.g., unstable growth) from the state space, and (3) error bounds that exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

Multigrid methods with space–time concurrency

Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporal dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.

97 MATHEMATICS AND COMPUTING↗

PPINN: Parareal physics-informed neural network for time-dependent PDEs

Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time–space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speed-up for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion–reaction equation. Furthermore, our results demonstrate that PPINNs converge in a few iterations with significant speed-ups proportional to the number of time-subdomains employed.

42 ENGINEERING↗

On Which Microphysical Time Scales to Use in Studies of Entrainment-Mixing Mechanisms in Clouds

The commonly used time scales in entrainment-mixing studies are examined in this paper to seek the most appropriate one, based on aircraft observations of cumulus clouds from the RACORO campaign and numerical simulations with the Explicit Mixing Parcel Model. The time scales include: τ evap , the time for droplet complete evaporation; τ phase , the time for saturation ratio deficit (S) to reach 1/e of its initial value; τ satu , the time for S to reach -0.5%; τ react , the time for complete droplet evaporation or S to reach -0.5%. It is found that the proper time scale to use depends on the specific objectives of entrainment-mixing studies. First, if the focus is on the variations of liquid water content (LWC) and S, then τ react for saturation, τ satu and τ phase are almost equivalently appropriate, because they all represent the rate of dry air reaching saturation or of LWC decrease. Second, if one focuses on the variations of droplet size and number concentration, τ react for complete evaporation and τ evap are proper because they characterize how fast droplets evaporate and whether number concentration decreases. Moreover, τ react for complete evaporation and τ evap are always positively correlated with homogeneous mixing degree (ψ), thus the two time scales, especially τ evap , are recommended for developing parameterizations. However, ψ and the other time scales can be negatively, positively, or not correlated, depending on the dominant factors of the entrained air (i.e., relative humidity or aerosols). Third and finally, all time scales are proportional to each other under certain microphysical and thermodynamic conditions.

54 ENVIRONMENTAL SCIENCES↗

Using dynamic mode decomposition to predict the dynamics of a two-time non-equilibrium Green’s function

Computing the numerical solution of the Kadanoff–Baym equations, a set of nonlinear integral differential equations satisfied by the two-time Green's functions derived from many-body perturbation theory for a quantum many-body system away from equilibrium, is a challenging task. Recently, we have successfully applied dynamic mode decomposition (DMD) to construct a data driven reduced order model that can be used to extrapolate the time-diagonal of a two-time Green's function from numerical solutions of the KBE within a small time window. In this paper, we extend the previous work and use DMD to predict off-diagonal elements of the two-time Green's function. We partition the two-time Green's function into a number of one-time functions along the diagonal and subdiagonals of the two-time window as well as in horizontal and vertical directions. We use DMD to construct separate reduced order models to predict the dynamics of these one-time functions in a two-step procedure. We extrapolate along diagonal and several subdiagonals within a subdiagonal band of a two-time window in the first step. In the second step, we use DMD to extrapolate the Green's function outside of the sub-diagonal band. In conclusion, we demonstrate the efficiency and accuracy of this approach by applying it to a two-band Hubbard model problem.

97 MATHEMATICS AND COMPUTING↗

Investigation of a digitizer for the plastic scintillation detectors of time-of-flight mass measurements

A CAEN DT5742 digitizer has been investigated to process the fast signals from the photomultiplier tubes of the time-of-flight detectors for fast ion beams. A test setup consisting of two plastic scintillation detectors and a pulsed laser source provided signals which were recorded by the digitizer and systematically analyzed with different algorithms to derive the amplitude, rise time and arrival time of the detection signal. To obtain the best amplitude and time resolutions, various optimization techniques including peak fitting and signal smoothing, interpolation improvement, and time-walk correction by amplitude and rise time have been performed and compared in detail. Here we compared the time resolutions obtained by three digital algorithms of leading-edge, zero-crossing constant-fraction (ZC-CFD) and direct constant-fraction discriminations. Finally, we found that the best time-of-flight resolution between two PMTs can be achieved as 12 ps by the method using sample minimum for peak location and using the time-walk-resistant ZC-CFD with 4-point interpolation for timing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

High spatiotemporal variability of bacterial diversity over short time scales with unique hydrochemical associations within a shallow aquifer

Understanding microbial community structure and function within the subsurface is critical to assessing overall quality and maintenance of groundwater; however, the factors that determine microbial community assembly, structure, and function in groundwater systems and their impact on water quality remains poorly understood. In this study, three shallow wells (FW301, FW303, FW305) in a non-contaminated shallow aquifer in the ENIGMA-Oak Ridge Field Research Center (Oak Ridge, TN) were sampled approximately 3 times a week over a period of three months to measure changes in groundwater geochemistry and microbial diversity. It was expected that the sampled microbial diversity from two historic field wells (FW301, FW303) would be relatively stable, while diversity from a newer well (FW305) would be less stable over time. The wells displayed some degree of hydrochemical variability over time unique to each well, with FW303 being overall the most stable well and FW301 being the most dynamic based upon dissolved oxygen, conductivity, and nitrate. Community analysis via ss-rRNA paired-end sequencing and distribution-based clustering revealed higher OTU richness, diversity, and variability in groundwater communities of FW301 than the other two wells for diversity binned over all time points. Microbial community composition of a given well was on average > 50% dissimilar to any other well at a given time (days), yet, functional gene diversity as measured with GeoChip remained relatively constant. Similarities in community structure across wells were observed with respect to the presence of 20 shared bacterial groups in all samples in all wells, although at varying levels over the tested time period. Similarity percentage (SIMPER) analysis revealed that variability in FW301 was largely attributed to low abundance, highly-transient populations, while variability in the most hydrochemically stable well (FW303) was due to fluctuations in more highly abundant and frequently present taxa. Additionally, the youngest well FW305 showed a dramatic shift in community composition towards the end of the sampling period that was not observed in the other wells, suggesting possible succession events over time. Time-series analysis using vector auto-regressive models and Granger causality showed unique relationships between richness and geochemistry over time in each well. Finally, these results indicate temporally dynamic microbial communities over short time scales, with day-to-day population shifts in local community structure influenced by available source community diversity and local groundwater hydrochemistry.

59 BASIC BIOLOGICAL SCIENCES↗

An inexpensive technique for the time resolved laser induced plasma spectroscopy

We present an efficient and inexpensive method for calculating the time resolved emission spectrum from the time integrated spectrum by monitoring the time evolution of neutral and singly ionized species in the laser produced plasma. To validate our assertion of extracting time resolved information from the time integrated spectrum, the time evolution data of the Cu II line at 481.29 nm and the molecular bands of AlO in the wavelength region (450–550 nm) have been studied. The plasma parameters were also estimated from the time resolved and time integrated spectra. A comparison of the results clearly reveals that the time resolved information about the plasma parameters can be extracted from the spectra registered with a time integrated spectrograph. Our proposed method will make the laser induced plasma spectroscopy robust and a low cost technique which is attractive for industry and environmental monitoring.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Assessing methods in fusion and fitting for time series construction in remote sensing-based earth observations

This study evaluates the comparative performance of spatiotemporal fusion and time-series fitting methods for constructing high-spatiotemporal-resolution remote sensing time-series data. Due to in-class similarity of fusion methods and fitting methods, we employ the Fit-FC (Fitting, spatial Filtering, and residual Compensation) model as a representative fusion method and the linear harmonic fitting model as a representative fitting method. Both Fit-FC and the linear harmonic fitting are widely used for high-spatiotemporal-resolution time-series data construction, and we modify the original Fit-FC model to enable automatic time-series fusion. To ensure data representativeness, we use 3 years (2019–2021) of Harmonized Landsat and Sentinel-2 surface reflectance datasets and Terra MCD43A4 products. Eight experimental regions are selected worldwide to guarantee generalization of the comparative performance between fusion and fitting methods, covering diverse land-use types (cropland, developed land, forest, and grassland) and varying climatological conditions. Time-series of NDVI and surface reflectance are analyzed under both actual observations and simulated data-missing scenarios. The constructed time-series data reveals that (1) the modified Fit-FC and linear harmonic fitting model achieve excellent performance in constructing high-resolution time-series images; (2) the fusion method outperforms the fitting method in constructing time-series of NDVI and surface reflectance images in cropland-, forest-, and grassland-dominated regions; (3) both methods achieve comparable performance in developed-dominated regions; (4) the fusion method is more robust to missing data, and better captures abrupt phenological transitions under conditions of continuous missing data; (5) the fitting method is computationally more efficient, making it suitable for large-scale time-series image reconstruction. This study provides valuable insights for selecting optimal strategies to generate high-resolution time-series images across diverse application scenarios and lays a foundation for extensions to other vegetation indices or land surface variables.

54 ENVIRONMENTAL SCIENCES↗

Time scales of tunneling decay of a localized state

Motivated by recent time-domain experiments on ultrafast atom ionization, we analyze the transients and time scales that characterize, aside from the relatively long lifetime, the decay of a localized state by tunneling. While the tunneling starts immediately, some time is required for the outgoing flux to develop. This short-term behavior depends strongly on the initial state. For the initial state, tightly localized so that the initial transients are dominated by over-the-barrier motion, the time scale for flux propagation through the barrier is close to the Buettiker-Landauer traversal time. Then a quasistationary, slow-decay process follows, which sets ideal conditions for observing diffraction in time at longer times and distances. To define operationally a tunneling time at the barrier edge, we extrapolate backward the propagation of the wave packet that escaped from the potential. This extrapolated time is considerably longer than the time scale of the flux and density buildup at the barrier edge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Electric Vehicles Charging Time Constrained Deliverable Provision of Secondary Frequency Regulation

Aggregation of electric vehicles (EVs) is a promising technique for providing secondary frequency regulation (SFR) in highly renewable energy-penetrated power systems. Equipped with energy storage devices, EV aggregation can provide reliable SFR. However, the main challenge is to guarantee reliable intra-interval SFR capacities and inter-interval delivery following the automatic generation control (AGC) signal. Furthermore, aggregated EV SFR provision will be further complicated by the EV charging time anxiety because SFR provision might extend EV's charging time. This paper proposes a deliverable EV SFR provision with a charging-time-constrained control strategy. First, a charging-time-constrained EV aggregation is proposed to address the uncertainty of EV capacity based on the state-space model considering the charging-time restriction of EV owners. Second, a real-time economic dispatch and time domain simulation (RTED-TDS) cosimulation framework is proposed to verify financial results and the dynamic performance of the EV SFR provision. Last, the proposed charging time-constrained EV aggregation is validated on the IEEE 39-bus system. In conclusion, the results demonstrate that with charging time-constrained EV aggregation, the dynamic performance of the system can be improved with a marginal increase in total cost. More importantly, the charging time constraint can be respected in the proposed SFR provision of the EV aggregation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems: A Case Study

The need for parallelism in the time dimension is being driven by changes in computer architectures, where performance increases are now provided through greater concurrency, not faster clock speeds. This creates a bottleneck for sequential time marching schemes because they lack parallelism in the time dimension. Multigrid reduction in time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficiency is defined as achieving similar performance when compared to an equivalent linear problem. The benchmark nonlinear problem is the p-Laplacian, where p=4 corresponds to a well-known nonlinear diffusion equation and p=2 corresponds to the standard linear diffusion operator, our benchmark linear problem. The key difficulty encountered is that the nonlinear time-step solver becomes progressively more expensive on coarser time levels as the time-step size increases. To overcome such difficulties, multigrid research has historically targeted an accumulated body of experience regarding how to choose an appropriate solver for a specific problem type. To that end, this paper develops a library of MGRIT optimizations and modifications, most important an alternate initial guess for the nonlinear time-step solver and delayed spatial coarsening, that will allow many nonlinear parabolic problems to be solved with parallel scaling behavior comparable to the corresponding linear problem.

parareal↗

PHISICS/RELAP5-3D Adaptive Time-Step Method Demonstrated for the HTTR LOFC#1 Simulation

A collaborative effort between Japan Atomic Energy Agency (JAEA) and Idaho National Laboratory (INL) as part of the Civil Nuclear Energy Working Group is underway to model the high temperature engineering test reactor (HTTR) loss of forced cooling (LOFC) transient that was performed in December 2010. The coupled version of RELAP5-3D, a thermal fluids code, and PHISICS, a neutronics code, were used to model the transient. The focus of this report is to summarize the changes made to the PHISICS-RELAP5-3D code for implementing an adaptive time step methodology into the code for the first time, and to test it using the full HTTR PHISICS/RELAP5-3D model developed by JAEA and INL and the LOFC simulation. Various adaptive schemes are available based on flux or power convergence criteria that allow significantly larger time steps to be taken by the neutronics module. The report includes a description of the HTTR and the associated PHISICS/RELAP5-3D model test results as well as the University of Rome sub-contractor report documenting the adaptive time step theory and methodology implemented in PHISICS/RELAP5-3D. Two versions of the HTTR model were tested using 8 and 26 energy groups. It was found that most of the new adaptive methods lead to significant improvements in the LOFC simulation time required without significant accuracy penalties in the prediction of the fission power and the fuel temperature. In the best performing 8 group model scenarios, a LOFC simulation of 20 hours could be completed in real-time, or even less than real-time, compared with the previous version of the code that completed the same transient 3-8 times slower than real-time. A few of the user choice combinations between the methodologies available and the tolerance settings did however result in unacceptably high errors or insignificant gains in simulation time. The study is concluded with recommendations on which methods to use for this HTTR model. An important caveat is that these findings are very model-specific and cannot be generalized to other PHISICS/RELAP5-3D models.

97 MATHEMATICS AND COMPUTING↗

An Alternative Time Metric to Modified Tau for Unmanned Aircraft System Detect And Avoid

A new horizontal time metric, Time to Protected Zone, is proposed for use in the Detect and Avoid (DAA) Systems equipped by unmanned aircraft systems (UAS). This time metric has three advantages over the currently adopted time metric, modified tau: it corresponds to a physical event, it is linear with time, and it can be directly used to prioritize intruding aircraft. The protected zone defines an area around the UAS that can be a function of each intruding aircraft's surveillance measurement errors. Even with its advantages, the Time to Protected Zone depends explicitly on encounter geometry and may be more sensitive to surveillance sensor errors than modified tau. To quantify its sensitivity, simulation of 972 encounters using realistic sensor models and a proprietary fusion tracker is performed. Two sensitivity metrics, the probability of time reversal and the average absolute time error, are computed for both the Time to Protected Zone and modified tau. Results show that the sensitivity of the Time to Protected Zone is comparable to that of modified tau if the dimensions of the protected zone are adequately defined.

alert↗