Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Recursion”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Human motion planning based on recursive dynamics and optimal control techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Non-NASA Center↗
NASA NTRS2010

On the Shock-Response-Spectrum Recursive Algorithm of Kelly and Richman

The monograph Principles and Techniques of Shock Data Analysis written by Kelly and Richman in 1969 has become a seminal reference on the shock response spectrum (SRS) [1]. Because of its clear physical descriptions and mathematical presentation of the SRS, it has been cited in multiple handbooks on the subject [2, 3] and research articles [4 10]. Because of continued interest, two additional versions of the monograph have been published: a second edition by Scavuzzo and Pusey in 1996 [11] and a reprint of the original edition in 2008 [12]. The main purpose of this note is to correct several typographical errors in the manuscript's presentation of a recursive algorithm for SRS calculations. These errors are consistent across all three editions of the monograph. The secondary purpose of this note is to present a Matlab implementation of the corrected algorithm.

Martin, Justin N.↗
NASA NTRS2006

Modified Recursive Hierarchical Segmentation of Data

An algorithm and a computer program that implements the algorithm that performs recursive hierarchical segmentation (RHSEG) of data have been developed. While the current implementation is for two-dimensional data having spatial characteristics (e.g., image, spectral, or spectral-image data), the generalized algorithm also applies to three-dimensional or higher dimensional data and also to data with no spatial characteristics. The algorithm and software are modified versions of a prior RHSEG algorithm and software, the outputs of which often contain processing-window artifacts including, for example, spurious segmentation-image regions along the boundaries of processing-window edges.

Tilton, James C.↗
NASA NTRS2008

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗
NASA NTRS2012

Doubly-Shadowed Regions in Lunar Polar Craters: Hydrogen Accumulation in the Presence of Recursive Plasma Wakes

Permanently shadowed regions (PSRs) of the Moon have been identified as unique environments of extreme cold and comprise a natural cold trap for sequestering volatiles [Paige et al. 2010]. The diverse chemical composition of the LCROSS impact plume provided evidence for a volatile-rich and chemically-complex PSR environment [Cola prete et al. 2010, Schultz et al. 2010]. Additionally, the polar electrostatic environment is highly complex, with the possibility of strong, localized electric fields that divert solar wind ions directly into polar cold traps [Farrell et al. 2010, Zimmerman et al. 2011]. Thus, regional plasma physics processes couple directly with volatile sequestration. In the present work, kinetic simulations show that recursive plasma wake structure arises in the presence of step-like topographic features (Le. doubly-shadowed craters). Combining the plasma code with a numerical sputtering model demonstrates that solar wind protons can be either a hydrogen source via implantation or a volatile loss mechanism via sputtering, depending on properties of the regolith and solar wind. The present model provides a novel theoretical pathway toward understanding the lunar surface/solar wind physical and chemical interactions for complex topography near the poles.

Zimmerman, Michael I.↗
NASA NTRSDate not supplied

Progressive Damage Response of 3D Woven Composites via the Multiscale Recursive Micromechanics Solution with Tailored Fidelity

Progressive failure simulations have been performed for orthogonal 3D woven composites consisting of RTM6 resin matrix and AS4 carbon fibers. The Multiscale Recursive Micromechanics approach has been used, which, while being computationally efficient, captures the primary effects of the microstructure at each considered length scale. This approach also enables use of any micromechanics theory at any length scale, and herein, the fidelity of the chosen theories across the scales has been tailored to strike a balance with computational efficiency. The Mori-Tanaka method is employed at the lowest length scale, the Generalized Method of Cells is used at intermediate scales, and the High-Fidelity Generalized Method of Cells is used at the highest woven composite repeating unit cell scale. Furthermore, two different damage models, also with different levels of fidelity and efficiency, have been used for the resin material at the lowest length scale. Results for the mechanical behavior in response to loading in various directions are compared for the two damage models and with available test data.

3D woven↗
NASA NTRS2021

A Recursive Multi-step Machine Learning Approach for Airport Configuration Prediction

Airport configuration selection is a complex decision-making process that involves several operational and human factors. In this paper we propose a novel recursive multi-step machine learning (ML) approach to predict airport configuration. The multi-step approach guarantees stability of the predicted configuration by taking as input the configuration predicted at the previous time step. The features of the proposed model include weather data, future arrival and departure counts and current configuration. Due to the importance of arrival and departure counts in predicting the airport configuration, arrival counts are calculated using landing time predictions selected from physics-based landing time predictions available in FAA System Wide Information Management data feeds for each flight. The selection rules were developed and refined to select the most accurate time for different phases of flight. The proposed model predicts the airport configurations up to 6 hours ahead. In this paper we show the predictive performance of the proposed model for six major US airports, including Charlotte Douglas International Airport (CLT), Dallas/Fort Worth International Airport (DFW), John F. Kennedy International Airport (JFK), Newark Liberty International Airport (EWR), LaGuardia Airport (LGA) and Dallas Love Field Airport (DAL). We trained and evaluated models on 2019 and 2020 data in order to study the effect of the pandemic and how changes in traffic patterns affected the performance of the proposed model. Results are compared with a baseline assuming no airport configuration changes. In our results for DFW, we obtained a prediction accuracy of 89.3% for 3 hours ahead prediction, and 82.8% for 6 hours ahead when applied on 2019 data.

machine learning↗
NASA NTRS2021

A Recursive Multi-step Machine Learning Approach for Airport Configuration Prediction

Airport configuration selection is a complex decision-making process that involves several operational and human factors. In this paper we propose a novel recursive multi-step machine learning (ML) approach to predict airport configuration. The multi-step approach guarantees stability of the predicted configuration by taking as input the configuration predicted at the previous time step. The features of the proposed model include weather data, future arrival and departure counts and current configuration. Due to the importance of arrival and departure counts in predicting the airport configuration, arrival counts are calculated using landing time predictions selected from physics-based landing time predictions available in FAA System Wide Information Management data feeds for each flight. The selection rules were developed and refined to select the most accurate time for different phases of flight. The proposed model predicts the airport configurations up to 6 hours ahead. In this paper we show the predictive performance of the proposed model for six major US airports, including Charlotte Douglas International Airport (CLT), Dallas/Fort Worth International Airport (DFW), John F. Kennedy International Airport (JFK), Newark Liberty International Airport (EWR), LaGuardia Airport (LGA) and Dallas Love Field Airport (DAL). We trained and evaluated models on 2019 and 2020 data in order to study the effect of the pandemic and how changes in traffic patterns affected the performance of the proposed model. Results are compared with a baseline assuming no airport configuration changes. In our results for DFW, we obtained a prediction accuracy of 89.3% for 3 hours ahead prediction, and 82.8% for 6 hours ahead when applied on 2019 data.

machine learning↗
NASA NTRSDate not supplied

An Integrated Recursive Framework for Arbitrarily Multiscale and Multi-fidelity Modeling

The NASA Multiscale Analysis Tool (NAMSAT) serves as a state-of-the-art, “plug and play,” massively multiscale modeling (M3) platform for hierarchical materials and structures. The development of NASMAT has focused on modularity, upgradability and maintainability, interoperability, and utility. Application Program Interfaces (APIs) have been developed to facilitate the integration NASMAT into other programs (commercial, research, and user-defined) as well as the integration of other codes into NASMAT. NASMAT is an integrated, recursive platform that seamlessly allows for an arbitrary number of scales, and a variety of modeling fidelity, in a single, non-linear analysis. Thus, the macroscopic response of a material can be directly linked to the behavior of the microstructure(s), including subscale defects, making it a suitable tool for integrated computational materials engineering (ICME) because . Examples using NASMAT for simulation of polycrystalline metals at elevated temperatures will be presented.

Multiscale Modeling↗
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 OSTI2023

Coolant Pump Predictive Data Analytics from Signatures Generated by the Recursive Short Time Fast Fourier Transform

Although a nuclear reactor is a hostile environment for sensors and signal transmissions, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure installed at the Advanced Test Reactor (ATR) nozzle trench area records acoustic signals that can capture reactor operating states. The distinct states produce unique signatures that can be identified and tracked using data processing and data analytics. The infrastructure relies on acoustic transmission through ATR in-pile structural components, piping, and coolant that transmit acoustically modified signals generated by the coolant pumps. This paper will discuss results from using the Recursive Short Time Fast Fourier Transform (RSTFFT) technique used to process acoustic signals and provide signatures that are identified and monitored by analytics. The RSTFFT is applied to ATR data to understand the vibration levels and signatures for different operating regimes as displayed by the spectrogram. The combination of coolant pumps for normal and high-power operation generate unique signatures. These acoustic signatures are used to develop machine learning approaches to automatically classify operating regimes. Two machine-learning models, Support Vector Machines and Linear Discriminant Analysis, were developed to classify two event classes. Class 1 is a normal steady-state operation, and Class 2 is any event that is due to start up, shut down, or other actions. Both types of machine learning models had over a 96% prediction accuracy for the two classes. These results lay the foundation for predictive analytic frameworks that can be leveraged by ATR to optimize operations and maintenance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2011

Validation and Simplification of the Radiation Therapy Oncology Group Recursive Partitioning Analysis Classification for Glioblastoma

Purpose: Previous recursive partitioning analysis (RPA) of patients with malignant glioma (glioblastoma multiforme [GBM] and anaplastic astrocytoma [AA]) produced six prognostic groups (I-VI) classified by six factors. We sought here to determine whether the classification for GBM could be improved by using an updated Radiation Therapy Oncology Group (RTOG) GBM database excluding AA and by considering additional baseline variables. Methods and Materials: The new analysis considered 42 baseline variables and 1,672 GBM patients from the expanded RTOG glioma database. Patients receiving radiation only were excluded such that all patients received radiation+carmustine. 'Radiation dose received' was replaced with 'radiation dose assigned.' The new RPA models were compared with the original model by applying them to a test dataset comprising 488 patients from six other RTOG trials. Fitness of the original and new models was evaluated using explained variation. Results: The original RPA model explained more variations in survival in the test dataset than did the new models (20% vs. 15%) and was therefore chosen for further analysis. It was reduced by combining Classes V and VI to produce three prognostic classes (Classes III, IV, and V+VI), as Classes V and VI had indistinguishable survival in the test dataset. The simplified model did not further improve performance (explained variation 18% vs. 20%) but is easier to apply because it involves only four variables: age, performance status, extent of resection, and neurologic function. Applying this simplified model to the updated GBM database resulted in three distinct classes with median survival times of 17.1, 11.2, and 7.5 months for Classes III, IV, and V+VI, respectively. Conclusions: The final model, the simplified original RPA model combining Classes V and VI, resulted in three distinct prognostic groups defined by age, performance status, extent of resection, and neurologic function. This classification will be used in future RTOG GBM trials.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2016

Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning

We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

47 OTHER INSTRUMENTATION↗