Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “times”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 883 records · Page 49

Relationship of the time course of venous gas bubbles to altitude decompression illness

The correlation is low between the occurrence of gas bubbles in the pulmonary artery, called venous gas emboli (VGE), and subsequent decompression illness (DCI). The correlation improves when a "grade" of VGE is considered; a zero to four categorical classification based on the intensity and duration of the VGE signal from a Doppler bubble detector. Additional insight about DCI might come from an analysis of the time course of the occurrence of VGE. Using the NASA Hypobaric Decompression Sickness Databank, we compared the time course of the VGE outcome between 322 subjects who exercised and 133 Doppler technicians who did not exercise to evaluate the role of physical activity on the VGE outcome and incidence of DCI. We also compared 61 subjects with VGE and DCI with 110 subjects with VGE but without DCI to identify unique characteristics about the time course of the VGE outcome to try to discriminate between DCI and no-DCI cases. The VGE outcome as a function of time showed a characteristic short lag, rapid response, and gradual recovery phase that was related to physical activity at altitude and the presence or absence of DCI. The average time for DCI symptoms in a limb occurred just before the time of the highest fraction of VGE in the pulmonary artery. It is likely, but not certain, that an individual will report a DCI symptom if VGE are detected early in the altitude exposure, the intensity or grade of VGE rapidly increases from a limb region, and the intensity or grade of VGE remains high.

NASA Discipline Environmental Health↗

Enhancing the Traffic Management Advisor's Schedule by Time Advance

A time advance algorithm associated with the scheduling functionalities of the Traffic Management Advisor (TMA) for arrival flights is presented and evaluated. The algorithm enhances TMA's meter fix schedule by advancing the flights' Scheduled Time of Arrival (STA) by an amount that minimizes their systemic operating cost. The systemic operating cost leverages the inherent trade-off of time and fuel efficiency resident in the cost index of modern flight management systems. The resulting STAs are achievable by speeding up the leading flights from their desired nominal speed profiles. A key advantage of this approach is that it reduces systemic delay to tight groupings of arriving aircraft as well as increases sustained throughput of the operation. A fast-time, Monte Carlo simulation that emulates TMA's scheduling functionalities is performed for arrival flights to the Phoenix Airport to quantify the benefit of the time advance algorithm. Results show consistent time saving benefits, ranging from 3 to 50 minutes for 112 flights with varying levels of traffic congestion.

arrival traffic management↗

The Value of Near Real-Time Earth Observations for Improved Flood Disaster Response

Information is a critical resource in disaster response scenarios. Data regarding the geographic extent, severity, and socioeconomic impacts of a disaster event can help guide emergency responders and relief operations, particularly when delivered within hours of data acquisition. Information from remote observations provides a valuable tool for assessing conditions "on the ground" more quickly and efficiently. Here, we evaluate the social value of a near real-time flood impact system using a disaster response case study, and quantify the Value of Information (VOI) of satellite-based observations for rapid response using a hypothetical flooding disaster in Bangkok, Thailand. MODIS imagery from NASA's Land, Atmosphere Near real-time Capability for EOS (LANCE) system is used to produce operational estimates of inundation depths and economic damages.These rapid Earth observations are coupled with a decision-analytical model to inform decisions on emergency vehicle routing. Emergency response times from vehicles routed using flood damage data are compared with baseline routes without the benefit of advance information on road conditions. Our results illustrate how the application of near real-time Earth observations can improve the response time and reduce potential encounters with flood hazards when compared with baseline routing strategies. Results indicate a potential significant economic benefit (i.e.,millions of dollars) from applying near real-time Earth observations for improved flood disaster response and management.

emergency response↗

A Higher-Order Space-Time Finite-Element Method for Moving-Body and Fluid-Structure Interaction Problems

We present a high-order finite-element method for moving body and fluid/structure interaction problems. Our solution strategy is based on a space-time discontinuous Galerkin (DG) spectral-element discretization which extends to arbitrary order of accuracy. The space-time DG discretization is a natural choice for moving body and fluid-structure interaction problems as moving surfaces are incorporated simply by considering curved space-time elements whose space-time faces align with the moving body. We present a discontinuous-Galerkin in time discretization for six-degree of motion modeling of rigid bodies, and a continuous-Galerkin discretization for equations of linear elasticity to generate curved space-time meshes. Numerical results for several simple 2D test cases are presented in order to verify the implementation of the different models. Finally we present a preliminary dynamic simulation of a parachute.

High-Order↗

Real-time Unimpeded Taxi Out Machine Learning Service

This paper describes a study on the estimation of the unimpeded taxi out time using Machine Learning (ML) tools and proposes an implementation that can be used to make real-time predictions at any airport in the National Airspace System. Kedro, an open-source pipeline framework, is used to develop the model definition and training. Models are stored in scikit-learn containers on a MLFlow server where they can be retrieved and served to make predictions in the live system. These open source frameworks provide common structures between ML services, allow for easier maintenance and updates, and overall deliver an easier CI/CD (Continuous Integration/Continuous Deployment) process. The current models were trained on data acquired at KCLT and KDFW from June 1st to December 31st, 2019 and compute taxi time in the ramp, airport movement area (AMA) and total (from gates to runways). The current versions of the models achieve relatively low uncertainties of about 10 to 15% for the total and AMA taxi times and about 20% for the ramp taxi time at both KCLT and KDFW. Initial tests on offline data from 2020 and 2021 show a small degradation (10 to 15%) in accuracy performance indicating the model’s resilience to operational changes over time.

machine learning↗

Real-time Unimpeded Taxi Out Machine Learning Service

This presentation describes a study on the estimation of the unimpeded taxi out time using Machine Learning (ML) tools and proposes an implementation that can be used to make real-time predictions at any airport in the National Airspace System. Kedro, an open-source pipeline framework, is used to develop the model definition and training. Models are stored in scikit-learn containers on a MLFlow server where they can be retrieved and served to make predictions in the live system. These open source frameworks provide common structures between ML services, allow for easier maintenance and updates, and overall deliver an easier CI/CD (Continuous Integration/Continuous Deployment) process. The current models were trained on data acquired at KCLT and KDFW from June 1st to December 31st, 2019 and compute taxi time in the ramp, airport movement area (AMA) and total (from gates to runways). The current versions of the models achieve relatively low uncertainties of about 10 to 15% for the total and AMA taxi times and about 20% for the ramp taxi time at both KCLT and KDFW. Initial tests on offline data from 2020 and 2021 show a small degradation (10 to 15%) in accuracy performance indicating the model’s resilience to operational changes over time.

Machine Learning↗

Flight Testing of In-Time Safety Assurance Technologies for UAS Operations

Ongoing research at NASA is driven by a strategic plan defined by the Aeronautics Research Mission Directorate and a vision for future In-Time Aviation Safety Management Systems (IASMS) as described by the National Academies. In both visions, system safety awareness and provision are expanded through increased access to relevant data; integrated analysis and predictive capabilities; improved real-time detection and alerting of domain-specific hazards; decision support, and in some cases, automated risk mitigation strategies. One primary research focus is to develop means by which more timely (i.e., “in-time”) actions may be taken to mitigate precursors, anomalies, or trends that are observed during operations. In this paper, we describe such means as a collection of Services, Functions, and Capabilities (SFCs) that are supported by an underlying information system. For example, an integrated risk assessment capability is envisioned that continuously monitors safety-related metrics and margins and recommends timely operational changes. Assessment functions and/or services can be based on data analytics and predictive models derived from heterogeneous data sets that span relevant indicator metrics and their time histories. Likewise, on-board functions can identify and reduce susceptibility to precursor conditions that have led (and can lead) to aircraft loss-of-control or out-of-control accidents. This paper summarizes development and testing of such an information system tailored to hazards anticipated for future highly autonomous flight missions near and over densely populated areas. Testing is accomplished via simulation and by using small, unmanned aircraft operating over a test range at NASA’s Langley Research Center. Flight plans and test scenarios are defined to emulate several use-cases, including package delivery; reconnaissance; fire management; and urban air taxi vertiport operations. Two test phases are summarized with Phase 1 occurring in (2019-2020) and Phase 2 ongoing (2021-present). Results focus on SFC performance, technology readiness level assessment, and requirements discovery/validation. Companion papers are cited throughout for additional details on the recent testing.

safety management↗

A Reproducible Validation of Algorithms for Estimating Array Tilt and Azimuth from Photovoltaic Power Time Series

In this research, we assess the viability of four different, publicly available algorithms for estimating the azimuth and tilt parameters of solar photovoltaic systems using only the associated AC power time series data and site latitude-longitude coordinates. In this work, we curated a benchmarking data set of 44 fixed-tilt systems, comprising 275 measured AC power inverter data streams, with known azimuth and tilt parameters. Additionally, we isolated test cases in the data set with real-world issues, including shading and clipping, to determine how algorithm performance varies based on the presence of these phenomena. Using this data set for benchmarking, we evaluated the estimated vs. actual system characteristics for each algorithm, as well as the associated algorithm execution time using a standardized benchmarking process. The two highest performing algorithms were the Solar Data Tools and the PVWatts 5-based methods, which both achieved a median absolute error of approximately 5 and 1 degrees for azimuth and tilt, respectively. During run time analysis, the SDT method was approximately 5 times faster than the PVWatts 5-based method, with the median execution time for a stream varying between 6 and 8 seconds vs. a median run time of 31 seconds for the PVWatts 5-based method.

algorithm validation↗

On Soft Mathematical Models of Subjective Time Acceleration with Age

It is a commonplace perception that speed of time subjectively experienced by humans significantly differs from chronological (objective) time and shows a great deal of variability. An often cited example is the phenomenon of the time acceleration with age - subjectively, the time passes faster as we get older. While the exact mechanisms behind it are not yet fully established, here we consider three 'soft' (conceptual) mathematical models that might be applicable to the speeding time phenomenon: two proportionality theories widely discussed in the past and the original model that takes into account the novelty of experience effect. Furthermore, the latter is found the most plausible, as not only it satisfactorily describes the decadal subjective time acceleration, but also offers a reasonable explanation of the human life experience accumulation with age.

acceleration↗

Data and scripts associated with “Sequential Precipitation Input Tagging (SPIT) to Estimate Water Transit Times and Hydrologic Tracer Dynamics within Water-Tagging Enabled Hydrologic Models” (v3)

This data package is associated with the publication “Sequential Precipitation Input Tagging (SPIT) to Estimate Water Transit Times and Hydrologic Tracer Dynamics within Water-Tagging Enabled Hydrologic Models” submitted to Journal of Advances in Modeling Earth Systems (Butler et al. 2025). This study developed the Sequential Precipitation Input Tagging (SPIT) framework to tag input precipitation and estimate water transit times and hydrologic tracers. SPIT tags all precipitation events at regular intervals over an extended period (monthly tags over seven years) in a hydrologic model from 2016-2022. SPIT is applied at six National Ecological Observatory Network (NEON) sites across the continental United States to calculate transit time distributions (TTD) and derive from these mean transit times (MTT), fractions of young water (Fyw), and hydrologic tracer concentrations in stream water (δ18O) within a water-tagging enabled version of the Weather Research and Forecast (WT-WRF-Hydro) model with national water model (NWM) configurations. We go on to validate WT-WRF-Hydro estimates against Butler et al. (2023), who analyzed the same NEON sites using stable water isotope data to estimate water transit times. This new tracking method provides a detailed picture of water movement and helps improve predictions about water availability in the future. This data package was originally published in January 2025. It was updated May 2025 (v2; new and modified files) and October 2025 (v3; new and modified files). File and folder names were not revised to indicate changes. See the change history section in the readme for more details. This data package contains the data and scripts used to develop the SPIT framework WT-WRF-Hydro (Water Tagging Weather Research and Forecasting Hydrologic) model and is associated with the following GitHub repository: https://github.com/zbutler33/SPIT-Framework. This data package contains five parent folders: (1) “Manipulated_outputs”, (2) “Metadata”, (3) “Observed”, (4) “Outputs”, and (5) “Scripts”. Each of these parent folders contains additional subfolders and files. Please see the FLMD (“v*_Butler_2024_WT_WRF_Hydro_flmd.csv”) for a list of all the files contained in this data package and descriptions for each. See the data dictionary (“v*_Butler_2024_WT_WRF_Hydro_dd.csv”) for definitions and units of all of the tabular (files ending in “.csv” and ".tsv") column headers.

54 ENVIRONMENTAL SCIENCES↗

Time Synchronization Techniques in the Modern Smart Grid: A Comprehensive Survey

In modern smart grids, accurate and synchronized time signals are essential for effective monitoring, protection, and control. Various time synchronization methods exist, each tailored to specific application needs. Widely adopted solutions, such as GPS, however, are vulnerable to challenges such as signal loss and cyber-attacks, underscoring the need for reliable backup or supplementary solutions. This paper examines the timing requirements across different power grid applications and provides a comprehensive review of available time synchronization mechanisms. Through a comparative analysis of timing methods based on accuracy, flexibility, reliability, and security, this study offers insights to guide the selection of optimal solutions for seamless grid integration.

comparison↗

Energy and Carbon Payback Times for Modern U.S. Utility Photovoltaic Systems

Manufacturing and operating a PV system consumes non-renewable energy and produces carbon emissions, as does end-of-life handling when PV systems are eventually decommissioned. To fully account for PV's contribution toward decarbonization, these life cycle impacts must be quantified. A 2023 NREL LCA of utility PV systems in the United States Study show energy payback times between 0.5 and 1.2 years and carbon payback times between 0.8 to 20 years, depending on the system install location. Payback times are affected by the amount of local solar radiation, and carbon payback time is significantly affected by the carbon-intensity of the local grid it offsets, as well as the future projected grid mix for the location it is installed. In an average U.S. location, carbon payback times are less than 2 years.

carbon payback time↗

Quantifying the time‐specific kinetic energy of simulated rainfall using a dynamic rain gauge system

Abstract Raindrop impact derives from the kinetic energy of falling raindrops. Determining the kinetic energy of rainfall requires the size distribution and terminal velocity of raindrops, which necessitates complex instrumentation. To avoid this, empirical relations have been developed that relate rainfall intensity and the rate of kinetic energy, i.e., time‐specific kinetic energy (KE time ). In this study, a dynamic rain gauge system (DRGS) was used to quantify the KE time generated by a rainfall simulator without need of measuring raindrop size distributions or impact velocities. In a series of 10 rainfall tests, the KE time and rainfall intensity were 860.9 (±88.6) J m 2 h −1 and 72.1 (±1.9) mm h −1 , respectively. Estimated KE time was found to agree well with the power‐law relation presented by Petrů and Kalibová for high‐intensity simulated rainfall, which are the conditions when higher deviations occur. The DRGS may be a useful tool in quantifying the KE time of rainfall simulators in hopes to better understand raindrop impact mechanisms.

Wacha, Kenneth M.↗

Measuring Thread Timing to Assess the Feasibility of Early-Bird Message Delivery Across Systems and Scales

Early-bird communication is a communication/computation overlap technique that leverages fine-grained communication to improve application run-time. Communication is divided such that each individual thread can initiate transmission of its portion of the data upon completion rather than waiting for a dedicated communication phase. The benefit of early-bird communication depends on the completion timing of the individual threads: On the one hand, if all threads are complete at nearly the same time, the overheads of sending multiple messages will accumulate, leading to performance that is worse than if a single message had been sent. On the other hand, if thread completions are spread out in time, those that complete earlier can send data while others continue working, leading to performance that is better than if a single message had been sent. The challenge is that the completion times are currently unknown and can vary based on application, problem size, system software, and underlying hardware. In this paper, we address this lacuna by measuring and evaluating the potential overlap afforded by early-bird communication for a selection of proxy applications. These measurements help us understand whether a given application could benefit from early-bird communication. Here, we present our technique for gathering this data and evaluate data collected from three proxy applications: MiniFE, MiniMD, and MiniQMC. Each application is run on three systems with distinct CPU architectures and strong scales across three run sizes. To characterize the behavior of these workloads, we study the trends of thread timings at both a macro level, across all threads across all runs of an application, and a micro level, that is, within a single process of a single run. We observe that our tested applications exhibit significantly different thread arrival distributions. The machine used had a significant impact, with the window of potential overlap varying by as much as an order of magnitude.

97 MATHEMATICS AND COMPUTING↗

Loop corrections in Minkowski spacetime away from equilibrium. Part II. Finite-time results

Loop corrections to finite-time correlation functions in quantum field theories away from equilibrium can be calculated using the in-in path integral approach. In this paper, we calculate the unequal-time two-point correlator for different massless self-interacting scalar quantum field theories on a Minkowski background, starting the field evolution at an arbitrary initial time. We find the counterterms that need to be added to UV-renormalize the result, including usual in-out counterterms in the dynamics and additional initial state counterterms that are required to cancel all UV divergences. We find that the late-time limit of the renormalized correlation function exhibits a linear or logarithmic growth in time, depending on whether the interaction strength is dimension-one or dimensionless, respectively. The late-time correlations match those obtained in our companion paper and, as shown there, the divergences do not indicate a real IR issue, consistent with what one would expect in Minkowski.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Firewalls at exponentially late times

We consider a version of the typical state firewall setup recently reintroduced by Stanford and Yang, who found that wormholes may create firewalls. We examine a late-time scaling limit in JT gravity in which one can resum the expansion in the number of wormholes, and we use this to study the exact distribution of interior slices at times exponential in the entropy. We consider a thermofield double with and without early perturbations on a boundary. These perturbations can appear on interior slices as dangerous high energy shockwaves. For exponentially late times, wormholes tend to teleport the particles created by perturbations and render the interior more dangerous. In states with many perturbations separated by large times, the probability of a safe interior is exponentially small, even though these would be safe without wormholes. With perturbation, even in the safest state we conceive, the odds of encountering a shock are fifty-fifty. One interpretation of the phenomenon is that wormholes can change time-ordered contours into effective out-of-time-ordered folds, making shockwaves appear in unexpected places.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Recurrent Convolutional Deep Neural Networks for Modeling Time-Resolved Wildfire Spread Behavior

The increasing incidence and severity of wildfires underscores the necessity of accurately predicting their behavior. While high-fidelity models derived from first principles offer physical accuracy, they are too computationally expensive for use in real-time fire response. Low-fidelity models sacrifice some physical accuracy and generalizability via the integration of empirical measurements, but enable real-time simulations for operational use in fire response. Machine learning techniques have demonstrated the ability to bridge these objectives by learning first-principles physics while achieving computational speedups. While deep learning approaches have demonstrated the ability to predict wildfire propagation over large time periods, time-resolved fire-spread predictions are needed for active fire management. Here, in this work, we evaluate the ability of deep learning approaches in accurately modeling the time-resolved dynamics of wildfires. We use an autoregressive process in which a convolutional recurrent deep learning model makes predictions that propagate a wildfire over 15 min increments. We apply the model to four simulated datasets of increasing complexity, containing both field fires with homogeneous fuel distribution as well as real-world topologies sampled from the California region of the United States. We show that even after 100 autoregressive predictions representing more than 24 h of simulated fire spread, the resulting models generate stable and realistic propagation dynamics, achieving a Jaccard score between 0.89 and 0.94 when predicting the resulting fire scar. The inference time of the deep learning models are examined and compared, and directions for future work are discussed.

54 ENVIRONMENTAL SCIENCES↗

Queue wait time prediction in high performance computing (HPC) systems

High Performance Computing (HPC) systems are critical enablers for groundbreaking scientific research across various domains. Efficient resource allocation, facilitated by job scheduling, is paramount for maximizing the utilization of HPC systems. However, the variability in wait times for queued jobs poses challenges for users, necessitating accurate job wait time estimation. This paper explores the influence of job characteristics, including job size (the number of nodes requested and walltime), the queue to which the job is submitted and other resource requirements, on job wait times in leadership-class HPC systems. Focusing on the Theta Cray XC40 and Polaris machines at Argonne National Laboratory, the study evaluates the performance of different supervised learning algorithms in predicting job wait times. It also evaluates the impact of data preprocessing, including outlier detection, Principal Component Analysis (PCA), and feature selection, on the performance of wait time prediction models. The findings reveal insights into the relationship between job characteristics and wait times, offering a foundation for optimizing resource allocation and enhancing user experience. The methodologies and tools developed in this study are adaptable to other leadership-class HPC systems, providing a valuable contribution to the broader HPC community aiming to improve job scheduling efficiency and user satisfaction.

Okafor, Nwamaka↗