Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation 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 1,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Computational methods in solution-based plastics purification

Plastic waste can be recycled into resins with near-virgin properties by solution-based purification processes that selectively dissolve polymers, remove contaminants, or detach printing residues. Here, in this review, we examine computational methods for predicting the behavior governing solution-based plastic purification, motivated by the vast polymer–solvent–contaminant compositional space. We discuss thermodynamic and machine learning methods for predicting polymer–solvent and polymer–contaminant interaction and review physics-based molecular dynamics simulations that resolve molecular-scale phenomena within polymer matrices inaccessible to screening methods. We highlight how these methods have informed experimental design for dissolution-based recycling and solvent-based contaminant removal. Finally, we discuss the prospective role of agentic AI in integrating these computational tools with real-time sorting data to adapt purification conditions to the compositional variability of real post-consumer feedstocks. This review charts a path toward computationally guided solution-based purification workflows that can respond to the complexity inherent in plastic waste streams.

Altamimi, Ali [Univ. of Wisconsin, Madison, WI (Un↗
DOE OSTI2023

Energetic particle marginal stability profile for HL-2M integrated simulation based on neural network module

Abstract A critical gradient model is employed to develop a module of energetic particle (EP) marginal stability profiles in OMFIT integrated simulations for studying EP transport. Currently, each iteration of transport evolution is approximately 10 min in the integrated simulation, whereas, the EP marginal stability profile, which serves as an input in the integrated simulation could take much longer; the reason being a combination of the TGLFEP and EPtran codes is employed in our previous investigation. To reduce the simulation time, the critical gradient is predicted by a neural network instead of the TGLFEP code, and the EPtran code is revised with parallel computing, so that the running time of this module can be controlled to within 5 min. The predictions are in good agreement with previous approaches. The integrated simulation of HL-2M with Alfven eigenmodes transported by neutral beam EP profiles indicates that EP transport reduces the total pressure and current as expected, but could also under some conditions raise the safety factor in the core, which is favorable for reversed magnetic shear and high-performance plasmas.

Physics↗
DOE OSTI2020

Fast matrix algebra for Bayesian model calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Simultaneously improving accuracy and computational cost under parametric constraints in materials property prediction tasks

Abstract Modern data mining techniques using machine learning (ML) and deep learning (DL) algorithms have been shown to excel in the regression-based task of materials property prediction using various materials representations. In an attempt to improve the predictive performance of the deep neural network model, researchers have tried to add more layers as well as develop new architectural components to create sophisticated and deep neural network models that can aid in the training process and improve the predictive ability of the final model. However, usually, these modifications require a lot of computational resources, thereby further increasing the already large model training time, which is often not feasible, thereby limiting usage for most researchers. In this paper, we study and propose a deep neural network framework for regression-based problems comprising of fully connected layers that can work with any numerical vector-based materials representations as model input. We present a novel deep regression neural network, iBRNet, with branched skip connections and multiple schedulers, which can reduce the number of parameters used to construct the model, improve the accuracy, and decrease the training time of the predictive model. We perform the model training using composition-based numerical vectors representing the elemental fractions of the respective materials and compare their performance against other traditional ML and several known DL architectures. Using multiple datasets with varying data sizes for training and testing, We show that the proposed iBRNet models outperform the state-of-the-art ML and DL models for all data sizes. We also show that the branched structure and usage of multiple schedulers lead to fewer parameters and faster model training time with better convergence than other neural networks. Scientific contribution: The combination of multiple callback functions in deep neural networks minimizes training time and maximizes accuracy in a controlled computational environment with parametric constraints for the task of materials property prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Hybrid Recurrent Neural Network Modeling for Traffic Delay Prediction at Signalized Intersections Along an Urban Arterial

This paper studies the traffic delay prediction modeling for multiple signalized intersections along the Ala Moana Boulevard and Nimitz Highway in Hawaii. Several machine learning (ML) based approaches have been studied in the literature, and most of them focused on prediction accuracy rather than the end use of real-time control and implementation. These ML models tend to be very complex and non-linear in nature, making it challenging to achieve fast inferences and are computationally heavy for real-time signal control implementation. As such, in this paper, a simple yet accurate hybrid modeling method is proposed to predict traffic delay one-step ahead with the model made suitable for real-time implementation to control traffic flow. Since real-time road-side measurements are recorded in unstructured form, the paper also discusses other issues related to data extraction and the pre-processing process. Finally, a simple signal control loop is developed to demonstrate the proposed modeling approach, which has shown advantages in model accuracy and computation efficiency compared against several existing modeling methods.

42 ENGINEERING↗
DOE OSTI2025

Data-driven emulation of modal aerosol microphysics via neural operator-based modeling

The complexity and the small characteristic scales of aerosol microphysical processes pose a big challenge for accurate and efficient Earth system simulations at regional and global scales. In this work, we construct and evaluate a surrogate model: the aerosol deep operator network (ADON), a physics-inspired dual-net architecture for emulating the aerosol microphysics parameterization suite in the version 2 of the Energy Earth System Model (E3SMv2). The current version of the surrogate model is trained on a dataset comprising 9.8 million samples obtained from a global E3SMv2 simulation with the horizontal resolution of about one degree under cloud-free conditions. Incorporating domain spatial and temporal coordinates, as well as principle components extracted from training data, the dual-net surrogate model effectively captures the intricate representations of aerosol and the relationship with atmospheric state variables, achieving an R-squared score over $$95.7\%$$ for all the lognormal aerosol modes in the extrapolated regime. The validated model provides feature importance of input variables and their impact on the predictive capacity of the surrogate model in relation to the E3SM. The computational cost of online inference time deployed on CPUs and GPUs with lower precisions highlights ADON’s efficiency and potential in robust predictive modeling for large-scale Earth system computations.

Bai, Zhe↗
DOE OSTI2023

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Dynamic signature generation from keystroke dynamics

Described herein are various technologies pertaining to extracting cryptographic keys from user behavioral biometrics, specifically keystroke dynamics. Such cryptographic keys can be used for, among other things, user authentication throughout computer sessions. Keystroke dynamics are timing data indicating when keys were pressed and when they were released.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Snowmass Letter of Interest - Cloud Computing - CompF4

The world currently spends more than $30B per quarter on the consumption of Cloud Computing services. This is 17 times the size of the entire FY20 budget for the Office of Science at the Department of Energy. These resources have been successfully used for scientific computing in HEP and elsewhere under a pay-as-you-go model where users are billed monthly based on the resources they have consumed. There are a wide range of Cloud services, but we categorize them into “capability” and “capacity”. Capability services represent a unique set of features that we have not provisioned on-premises for a variety of reasons (cost-effectiveness, power consumption, proprietary solutions, etc.) Capacity services are services that allow us to scale out commodity services; historically we have focused on high-throughput (batch) computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Comparison of spherical harmonics method and discrete ordinates method for radiative transfer in a turbulent jet flame

Here, in this study, we systematically compared the accuracy and computational cost of two popular solution methods for the radiative transfer equation (RTE): the spherical harmonics method (P N ) and the discrete ordinates method (DOM). We first investigated convergence characteristics of different orders of P N and DOM in a series of 1D homogeneous configurations with varying optical thicknesses. Both solvers perform better for optically thicker cases. The accuracy of P N methods increases with its order, , but the gain in accuracy reduces with the increase in , i.e., improvement of P 7 over P 5 is less than that of P 3 over P 1 . This decreasing trend becomes more prominent as the optical thickness decreases. On the other hand, DOM’s accuracy increases almost linearly with the increase in the number of ordinates (or polar angles in this study) in all cases. While comparing the directional profile of radiative intensity, both solvers perform better when the radiative intensity is more isotropic. These solvers were then connected with a full spectrum k-distribution (FSK) spectral model and used to perform radiation-coupled simulations of a turbulent jet flame in an axi-symmetric cylindrical domain. Results obtained from P 1 to P 7 approximations for P N , and 2 x 4, 4 x 4, 4 x 8, 8 x 8 finite angles for DOM are compared with that from an optically thin model, and a reference solution from line-by-line (LBL) photon Monte Carlo (PMC) method. The choice of radiation solver shows a noticeable impact on the temperature distribution of the flame. The P N solvers lead to slightly higher radiant fractions and the DOM solvers lead to slightly lower radiant fractions than the PMC benchmark solution. Finally, the computational costs of each of these solvers are also reported and an intermittent evaluation / time blending scheme to improve the computational efficiency of radiation solvers in radiation-coupled simulations are also demonstrated.

42 ENGINEERING↗
DOE OSTI2023

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Adaptive Machine Learning for Robust Diagnostics and Control of Time-Varying Particle Accelerator Components and Beams

Machine learning (ML) is growing in popularity for various particle accelerator applications including anomaly detection such as faulty beam position monitor or RF fault identification, for non-invasive diagnostics, and for creating surrogate models. ML methods such as neural networks (NN) are useful because they can learn input-output relationships in large complex systems based on large data sets. Once they are trained, methods such as NNs give instant predictions of complex phenomenon, which makes their use as surrogate models especially appealing for speeding up large parameter space searches which otherwise require computationally expensive simulations. However, quickly time varying systems are challenging for ML-based approaches because the actual system dynamics quickly drifts away from the description provided by any fixed data set, degrading the predictive power of any ML method, and limits their applicability for real time feedback control of quickly time-varying accelerator components and beams. In contrast to ML methods, adaptive model-independent feedback algorithms are by design robust to un-modeled changes and disturbances in dynamic systems, but are usually local in nature and susceptible to local extrema. In this work, we propose that the combination of adaptive feedback and machine learning, adaptive machine learning (AML), is a way to combine the global feature learning power of ML methods such as deep neural networks with the robustness of model-independent control. We present an overview of several ML and adaptive control methods, their strengths and limitations, and an overview of AML approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An Alternative Timing and Synchronization Approach for Situational Awareness and Predictive Analytics

Accurate and synchronized timing information is required by power system operators for controlling the grid infrastructure (relays, Phasor Measurement Units (PMUs), etc.) and determining asset positions. Satellite-based global positioning system (GPS) is the primary source of timing information. However, GPS disruptions today (both intentional and unintentional) can significantly compromise the reliability and security of our electric grids. A robust alternate source for accurate timing is critical to serve both as a deterrent against malicious attacks and as a redundant system in enhancing the resilience against extreme events that could disrupt the GPS network. To achieve this, we rely on the highly accurate, terrestrial atomic clock-based network for alternative timing and synchronization. In this paper, we discuss an experimental setup for an alternative timing approach. The data obtained from this experimental setup is continuously monitored and analyzed using various time deviation metrics. We also use these metrics to compute deviations of our clock with respect to the National Institute of Standards and Technologys (NIST) GPS data. The results obtained from these metric computations are elaborately discussed. Finally, we discuss the integration of the procedures involved, like real-time data ingestion, metric computation, and result visualization, in a novel microservices-based architecture for situational awareness.

Chinthavali, Supriya↗
DOE OSTI2020

Computer-aided classification of suspicious pigmented lesions using wide-field images

Early identification of melanoma is conducted through whole-body visual examinations to detect suspicious pigmented lesions, a situation that fluctuates in accuracy depending on the experience and time of the examiner. Computer-aided diagnosis tools for skin lesions are typically trained using pre-selected single-lesion images, taken under controlled conditions, which limits their use in wide-field scenes. Here, we propose a computer-aided classifier system with such input conditions to aid in the rapid identification of suspicious pigmented lesions at the primary care level. 133 patients with a multitude of skin lesions were recruited for this study. All lesions were examined by a board-certified dermatologist and classified into “suspicious” and “non-suspicious”. A new clinical database was acquired and created by taking Wide-Field images of all major body parts with a consumer-grade camera under natural illumination condition and with a consistent source of image variability. 3–8 images were acquired per patient on different sites of the body, and a total of 1759 pigmented lesions were extracted. A machine learning classifier was optimized and build into a computer aided classification system to binary classify each lesion using a suspiciousness score. In a testing set, our computer-aided classification system achieved a sensitivity of 100% for suspicious pigmented lesions that were later confirmed by dermoscopy examination (“SPL_A”) and 83.2% for suspicious pigmented lesions that were not confirmed after examination (“SPL_B”). Sensitivity for non-suspicious lesions was 72.1%, and accuracy was 75.9%. With these results we defined a suspiciousness score that is aligned with common macro-screening (naked eye) practices. This work demonstrates that wide-field photography combined with computer-aided classification systems can distinguish suspicious from non-suspicious pigmented lesions, and might be effective to assess the severity of a suspicious pigmented lesions. We believe this approach could be useful to support skin screenings at a population-level.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control

Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Numerical Modeling of Atmospheric Rime Ice Accretion on an Airfoil Using an Eulerian Approach

This paper presents an approach to numerically simulate the inherently unsteady rime ice accretion problem on a two-dimensional airfoil and elucidate the associated variations under different icing conditions. The airflow field and the water impingement on the airfoil are obtained based on an Eulerian two-phase model. A dynamic mesh strategy is employed to unsteadily account for the changes in the ice profile and its impact on the air and droplet flow by continuously reconstructing the computational grid at each time-step through smoothing and layering mechanisms. All main icing modules including the airflow field, droplet trajectory, icing thickness profile, and mesh management are fully coupled within the same computational framework without resorting to any external tools. Classical icing theory is employed to model the rime ice roughness, and it is assumed that the ice accretes in a direction normal to the airfoil surface. The governing Reynolds-averaged Navier–Stokes (RANS) conservation equations along with the energy and continuity equations are solved to produce the velocity and temperature fields. A convective film heat transfer coefficient is computed based on the surface heat flux and a recovery temperature which takes into account the dissipative heat release in the boundary layer in the vicinity of the airfoil surface. With the implemented strategy and calculating the convective heat transfer coefficient, the water film thickness is also calculated along with the ice shape. Furthermore, the model is validated by comparing the local collection efficiency distribution and ice shape with experimental data, and the results show that the implemented approach provides acceptable predictions of ice accretion profiles and rates.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations

We present the first application of field programmable gate arrays (FPGAs) as new, customizable hardware architectures for carrying out fast and energy-efficient quantum dynamics simulations of large chemical/material systems. Instead of tailoring the software to fixed hardware, which is the typical case for writing quantum chemistry code for central processing units (CPUs) and graphics processing units (GPUs), FPGAs allow us to directly customize the underlying hardware (even at the level of specific electrical signals in the circuit) to give a truly optimized computational performance for quantum dynamics calculations. By offloading the most intensive and repetitive calculations onto an FPGA, we show that the computational performance of our real-time electron dynamics calculations can even exceed that of optimized commercial mathematical libraries running on high-performance GPUs. In addition to this impressive computational speedup, we show that FPGAs are immensely energy-efficient and consume 4 times less energy than modern GPU or CPU architectures. These energy savings are a practical and important metric for supercomputing centers (many of which exceed over $1 million in power costs alone), as exascale computing capabilities become more widespread and commonplace. Taken together, the implementation techniques and performance metrics of our study demonstrate that FPGAs could play a promising role in upcoming quantum chemistry and materials science applications, particularly for the acceleration and energy-efficient execution of quantum dynamics calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗