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 73 records · Page 4

Management of Large-Scale Wireless Sensor Networks Utilizing Multi-Parent Recursive Area Hierarchies

Autonomously configuring and self-healing a largescale wireless sensor network requires a light-weight maintenance protocol that is scalable. Further, in a battery powered wireless sensor network duty-cycling a node’s radio can reduce the power consumption of a device and extend the lifetime of a network. With duty-cycled nodes the power consumption of a node’s radio depends on the amount of communication is must perform and by reducing the communication the power consumption can also be reduced. Multi-parent hierarchies can be used to reduce the communication cost when constructing a recursive area clustering hierarchy when compared to singleparent solutions that utilize inefficient communication methods such as flooding and information propagation via single-hop broadcasts. The multi-parent hierarchies remain scalable and provides a level of redundancy for the hierarchy.

Environmental Molecular Sciences Laboratory↗

Recursive Blind Forecasting of Photovoltaic Generation and Consumer Load for Microgrids

Existing forecasting frameworks that predict time-series photovoltaic (PV) generation and consumer load for micro-grids' operation and control assume near-continuous availability of real-time predictors from the field. The incoming data are used to periodically re-train the models and update forecast snapshots over a moving horizon window. However, such frameworks are not resilient to disruptions in data availability caused by losses in communications between the field sensors and data loggers. This paper bridges the shortcoming by leveraging a previously proposed forecasting framework that is resilient to abrupt changes in data quality caused by communication losses. Assuming no availability of real-time field system data, which is typical in extreme weather events such as hurricanes, the framework uses lightweight recursive time-series models to independently forecast solar irradiance, ambient temperature, PV power, and consumer load for three horizon windows: 24 hours, 12 hours, and 1 hour. Four types of ensemble-based regression trees-simple gradient boosted trees (GBR), GBR with an adaptive component (A-GBR), random forests (RF), and extra trees (ExTR)-are leveraged and their performances are compared against a simple historical weekly mean. Numerical results show that A-GBR performs better on average by 32% for 24-hour horizon and 39% for 12-hour horizon, whereas ExTR outdoes the other models on average by 10% for 1-hour horizon.

Sundararajan, Aditya↗

Emergent Recursive Multiscale Interaction in Complex Systems

This project studied the potential for multiscale group dynamics in complex social systems, including emergent recursive interaction. Current social theory on group formation and interaction focuses on a single scale (individuals forming groups) and is largely qualitative in its explanation of mechanisms. We combined theory, modeling, and data analysis to find evidence that these multiscale phenomena exist, and to investigate their potential consequences and develop predictive capabilities. In this report, we discuss the results of data analysis showing that some group dynamics theory holds at multiple scales. We introduce a new theory on communicative vibration that uses social network dynamics to predict group life cycle events. We discuss a model of behavioral responses to the COVID-19 pandemic that incorporates influence and social pressures. Finally, we discuss a set of modeling techniques that can be used to simulate multiscale group phenomena.

42 ENGINEERING↗

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↗

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 ↗

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↗

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↗

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↗

A multiscale multi-permeability poroplasticity model linked by recursive homogenizations and deep learning

Many geological materials, such as shale, mudstone, carbonate rock, limestone and rock salt are multi-porosity porous media in which pores of different scales may co-exist in the host matrix. When fractures propagate in these multi-porosity materials, these pores may enlarge and coalesce and therefore change the magnitude and the principal directions of the effective permeability tensors. The pore-fluid inside the cracks and the pores of host matrix may interact and exchange fluid mass, but the difference in hydraulic properties of these pores often means that a single homogenized effective permeability tensor field is insufficient to characterize the evolving hydraulic properties of these materials at smaller time scale. Furthermore, the complexity of the hydro-mechanical coupling process and the induced mechanical and hydraulic anisotropy originated from the micro-fracture and plasticity at grain scale also makes it difficult to propose, implement and validate separated macroscopic constitutive laws for numerical simulations. Here this article presents a hybrid data-driven method designed to capture the multiscale hydro-mechanical coupling effect of porous media with pores of various different sizes. At each scale, data-driven models generated from supervised machine learning are hybridized with classical constitutive laws in a directed graph that represents the numerical models. By using sub-scale simulations to generate database to train material models, an offline homogenization procedure is used to replace the up-scaling procedure to generate cohesive laws for localized physical discontinuities at both grain and specimen scales. Through a proper homogenization procedure that preserves spatial length scales, the proposed method enables field-scale simulations to gather insights from meso-scale and grain-scale micro-structural attributes. This method is proven to be much more computationally efficient than the classical DEM–FEM or FEM2 approach while at the same time more robust and flexible than the classical surrogate modeling approach. Due to the usage of bridging-scale technique, the proposed model may provide multiple opportunities to incorporate different types of simulations and experimental data across different length scales for machine learning. Numerical issues will also be discussed.

42 ENGINEERING↗

Real-time cure monitoring of fiber-reinforced polymer composites using infrared thermography and recursive Bayesian filtering

Despite the desirable characteristics of fiber-reinforced polymer (FRP) composites, their utilization in high volume production industries is limited by a lack of efficient manufacturing techniques. Monitoring the curing process of these composites can help with improving the quality and efficiency of the manufacturing process. This article discusses a method that uses Kalman-filter-based fusion of the information obtained from infrared thermography (surface temperature measurements) and a heat conduction model to estimate degrees of cure and internal temperatures of curing FRP composite parts in real time. The effectiveness of the methodology is demonstrated by successfully monitoring the curing of an FRP composite part in a laboratory experiment. Finally, the proposed methodology is a crucial step towards identifying anomalies in the curing process that negatively impact the quality of FRP composite parts.

36 MATERIALS SCIENCE↗