Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Random Allocation”

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 55 records · Page 3

A decreasing carbon allocation to belowground autotrophic respiration in global forest ecosystems

Belowground autotrophic respiration (RAsoil) depends on carbohydrates from photosynthesis flowing to roots and rhizospheres, and is one of the most important but least understood components in forest carbon cycling. Carbon allocation plays an important role in forest carbon cycling and reflects forest adaptation to changing environmental conditions. However, carbon allocation to RAsoil has not been fully examined at the global scale. To fill this knowledge gap, first, the spatio-temporal patterns of RAsoil from 1981 to 2017 were predicted by a Random Forest (RF) algorithm using the most updated Global Soil Respiration Database (v5) with global environmental variables; second, carbon allocation from photosynthesis to RAsoil (CAB), was calculated as the ratio of RAsoil to gross primary production; and its temporal and spatial patterns were assessed in global forest ecosystems. . Globally, mean RAsoil from forests was 8.9 ± 0.08 Pg C yr-1 (mean ± standard deviation) from 1981 to 2017 with strong spatial variabilities. Temporally, RAsoil increased at a rate of 0.0059 Pg C yr-2, paralleling broader soil respiration changes and indicating increasing carbon respired by roots. Mean CAB was 0.243 ± 0.016 and decreased over time. The temporal trend of CAB varied greatly in space, reflecting uneven responses of CAB to environmental changes. This study is the first attempt to predict global CAB and analyze its temporal and spatial patterns. With the linkage of carbon use efficiency, the developed CAB offers an completely independent approach to quantify global aboveground autotropic respiration spatially and temporally, which could provide crucial insights into carbon flux partition and global carbon cycling under climate change.

Tang, Xiaolu↗

Subsurface Characterization and Machine Learning Predictions at Brady Hot Springs Results

Geothermal power plants typically show decreasing heat and power production rates over time. Mitigation strategies include optimizing the management of existing wells - increasing or decreasing the fluid flow rates across the wells - and drilling new wells at appropriate locations. The latter is expensive, time-consuming, and subject to many engineering constraints, but the former is a viable mechanism for periodic adjustment of the available fluid allocations. Data and supporting literature from a study describing a new approach combining reservoir modeling and machine learning to produce models that enable strategies for the mitigation of decreased heat and power production rates over time for geothermal power plants. The computational approach used enables translation of sets of potential flow rates for the active wells into reservoir-wide estimates of produced energy and discovery of optimal flow allocations among the studied sets. In our computational experiments, we utilize collections of simulations for a specific reservoir (which capture subsurface characterization and realize history matching) along with machine learning models that predict temperature and pressure timeseries for production wells. We evaluate this approach using an "open-source" reservoir we have constructed that captures many of the characteristics of Brady Hot Springs, a commercially operational geothermal field in Nevada, USA. Selected results from a reservoir model of Brady Hot Springs itself are presented to show successful application to an existing system. In both cases, energy predictions prove to be highly accurate: all observed prediction errors do not exceed 3.68% for temperatures and 4.75% for pressures. In a cumulative energy estimation, we observe prediction errors that are less than 4.04%. A typical reservoir simulation for Brady Hot Springs completes in approximately 4 hours, whereas our machine learning models yield accurate 20-year predictions for temperatures, pressures, and produced energy in 0.9 seconds. This paper aims to demonstrate how the models and techniques from our study can be applied to achieve rapid exploration of controlled parameters and optimization of other geothermal reservoirs. Includes a synthetic, yet realistic, model of a geothermal reservoir, referred to as open-source reservoir (OSR). OSR is a 10-well (4 injection wells and 6 production wells) system that resembles Brady Hot Springs (a commercially operational geothermal field in Nevada, USA) at a high level but has a number of sufficiently modified characteristics (which renders any possible similarity between specific characteristics like temperatures and pressures as purely random). We study OSR through CMG simulations with a wide range of flow allocation scenarios. Includes a dataset with 101 simulated scenarios that cover the period of time between 2020 and 2040 and a link to the published paper about this project, where we focus on the Machine Learning work for predicting OSR's energy production based on the simulation data, as well as a link to the GitHub repository where we have published the code we have developed (please refer to the repository's readme file to see instructions on how to run the code). Additional links are included to associated work led by the USGS to identify geologic factors associated with well productivity in geothermal fields. Below are the high-level steps for applying the same modeling + ML process to other geothermal reservoirs: 1. Develop a geologic model of the geothermal field. The location of faults, upflow zones, aquifers, etc. need to be accounted for as accurately as possible 2. The geologic model needs to be converted to a reservoir model that can be used in a reservoir simulator, such as, for instance, CMG STARS, TETRAD, or FALCON 3. Using native state modeling, the initial temperature and pressure distributions are evaluated, and they become the initial conditions for dynamic reservoir simulations 4....

15 GEOTHERMAL ENERGY↗

Dynamic decisions and work load in multitask supervisory control

A paradigm is developed for the problem of allocating in time a single resource to multiple simultaneous task demands which appear randomly, last for various periods, and offer varying rewards for service. Based upon a dynamic optimizing algorithm plus an estimator, and including response time and future discounting constraints, a model of the human decisionmaker is compared to experimental results for human subjects performing such a task at a computer-graphics terminal. Results indicate a reasonable fit, under various model parameters and task conditions, and suggest interesting hypotheses about the nature of human 'planning ahead' and mental work load.

Tulga, M. K.↗

Automated Construction of Artificial Lattice Structures with Designer Electronic States

Manipulating matter with a scanning tunneling microscope (STM) enables the creation of atomically defined artificial structures that host designer quantum states. However, the time-consuming nature of the manipulation process, coupled with the sensitivity of the STM tip, constrains the exploration of diverse configurations and limits the size of the designed features. In this study, we present a reinforcement learning (RL)-based framework for creating artificial structures by spatially manipulating carbon monoxide (CO) molecules on a copper substrate by using the STM tip. The automated workflow combines molecule detection and manipulation, employing deep-learning-based object detection to locate CO molecules and linear assignment algorithms to allocate these molecules to designated target sites. We initially perform molecule maneuvering based on randomized parameter sampling for sample bias, tunneling current set point, and manipulation speed. This data set is then structured into an action trajectory used to train an RL agent. The model is subsequently deployed on the STM for real-time fine-tuning of the manipulation parameters during structure construction. Our approach incorporates path-planning protocols coupled with active drift compensation to enable atomically precise fabrication of structures with significantly reduced human input while realizing larger-scale artificial lattices with the desired electronic properties. Furthermore, using our approach, we demonstrate the automated construction of an extended artificial graphene lattice and confirm the existence of a characteristic Dirac point in its electronic structure. Further challenges regarding the RL-based structural assembly scalability are discussed.

Algorithms↗

Accuracy of predictions made by machine learned models for biocrude yields obtained from hydrothermal liquefaction of organic wastes

Hydrothermal liquefaction (HTL) has potential for converting abundant wet organic wastes into renewable fuels. Because HTL consists of a complex reaction network, deterministic, physics-based prediction of its biocrude yield is prohibitively difficult. Data-driven methods provide an alternative to the physics-based approach; however, rigorous testing must be performed to ensure the accuracy of predictions made by data-driven methods. To this end, a data set was assembled consisting of 570 data points appearing in the open literature. The data set was divided into training, validation, and test sub-sets and used for evaluating different machine learning regression approaches to predict biocrude yield. Among the tested algorithms, Random Forest and eXtreme Gradient Boosting (XGBoost) predicted biocrude yields in a test set that had not been used for training with the greatest accuracy, with root mean square errors (RMSE) of 8.34 and 8.57, respectively. Further refinement of the Random Forest model reduced its RMSE to 8.07. In comparison, predictions of a series of literature models resulted in RMSE ranging from 9.16 in the most accurate case to 27.6 in the least accurate; most literature models yielded RMSE values > 10. Using biocrude yield predictions from the most accurate Random Forest model and a probabilistic economic analysis found that the model accuracy is sufficient to prioritize allocation of resources based on projected minimum fuel selling price. In our report the models and analysis represent a major advance in the ability to use readily available data to predict biocrude yields on new feedstocks that have not previously been studied.

42 ENGINEERING↗

A Dynamic Testing Complexity Metric

This paper introduces a dynamic metric that is based on the estimated ability of a program to withstand the effects of injected "semantic mutants" during execution by computing the same function as if the semantic mutants had not been injected. Semantic mutants include: (1) syntactic mutants injected into an executing program and (2) randomly selected values injected into an executing program's internal states. The metric is a function of a program, the method used for injecting these two types of mutants, and the program's input distribution; this metric is found through dynamic executions of the program. A program's ability to withstand the effects of injected semantic mutants by computing the same function when executed is then used as a tool for predicting the difficulty that will be incurred during random testing to reveal the existence of faults, i.e., the metric suggests the likelihood that a program will expose the existence of faults during random testing assuming faults were to exist. If the metric is applied to a module rather than to a program, the metric can be used to guide the allocation of testing resources among a program's modules. In this manner the metric acts as a white-box testing tool for determining where to concentrate testing resources. Index Terms: Revealing ability, random testing, input distribution, program, fault, failure.

Voas, Jeffrey↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sharing Resources In Mobile/Satellite Communications

Report presents preliminary theoretical analysis of several alternative schemes for allocation of satellite resource among terrestrial subscribers of landmobile/satellite communication system. Demand-access and random-access approaches under code-division and frequency-division concepts compared.

Yan, Tsun-Yee↗

Two Extremely Red Galaxies

This report concerns one of the major observational studies in the ISO Central Programme, the ISO Normal Galaxy Survey. This is a survey of an unbiased sample of spiral and lenticular galaxies selected from the Revised Shapley-Ames Catalog. It is therefore optically-selected, with a brightness limit of blue magnitude = 12, and otherwise randomly chosen. The original sample included 150 galaxies, but this was reduced to 74 when the allocated observing time was expended because the ISO overheads encountered in flight were much larger than predicted.

Joseph, Robert D.↗

Learning linear optical circuits with coherent states

We analyze the energy and training data requirements for supervised learning of an M-mode linear optical circuit by minimizing an empirical risk defined solely from the action of the circuit on coherent states. When the linear optical circuit acts non-trivially only on k < M unknown modes (i.e. a linear optical k-junta), we provide an energy-efficient, adaptive algorithm that identifies the junta set and learns the circuit. We compare two schemes for allocating a total energy, E, to the learning algorithm. In the first scheme, each of the T random training coherent states has energy E/T. In the second scheme, a single random MT-mode coherent state with energy E is partitioned into T training coherent states. The latter scheme exhibits a polynomial advantage in training data size sufficient for convergence of the empirical risk to the full risk due to concentration of measure on the $(2MT-1)$-sphere. Specifically, generalization bounds for both schemes are proven, which indicate that for ε-approximation of the full risk by the empirical risk with high probability, $O(E^{2/3}M^{2/3}/\epsilon^{2/3})$ training states are sufficient for the first scheme and $O(E^{1/3}M^{1/3}/\epsilon^{2/3})$ training states are sufficient for the second scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superstructure Optimization of Waste Plastic Pyrolysis, Integrating Thermal, Catalytic, and Plasma Technologies with Machine Learning

Global plastic waste generation exceeds 430 million tonnes per year, yet fewer than 9% are recycled in the United States. Pyrolysis offers a chemical recycling route at scale, but existing techno-economic and life cycle assessments fix product yields to single pure polymers, producing economic and environmental outputs that break down when the feed composition changes. Here, we present a superstructure optimization framework that addresses this by embedding a composition-aware random forest yield predictor, trained on 566 pyrolysis experiments, within a full-scale process simulation. Product distributions update automatically as feed allocation shifts across four reactor chemistries: conventional thermal, catalytic (HZSM-5), thermal oxo-degradation, and nonequilibrium CO2 plasma. The optimal superstructure achieves minimum selling prices of −0.56 to −0.76/kg feed and global warming potentials of −0.276 to −0.322 kg CO2-eq/kg feed across four commodity price scenarios, confirming profitable, carbon-negative operation without tipping fees. Carbon abatement costs of $\$$0.46 to $\$$1.25/kg CO2-eq are competitive with direct air capture. Sensitivity analysis shows that the catalytic-plasma split fraction is the single largest driver of both economic and climate performance, while hydrocracking allocation in the wax upgrading stage is emission-neutral across the full variable range. Mixed plastic waste streams, evaluated as composition-variable feedstocks rather than pure resins, are profitable and carbon-negative across realistic market conditions. These results give a quantitative basis for reactor selection, circular economy investment, and policy design targeting chemical recycling on a large scale.

Life cycle assessment↗

Airport Risk Assessment Model (ARAM)

The Airport Risk Assessment Model (ARAM) model automatically determines the optimal allocation of limited security resources to minimize total risk to the airport. At the same time, the model adds an element of randomness to the, reducing the predictability of asset schedules and further increasing countermeasure effectiveness.

Brigantic, Robert↗

The correspondence of surface climate parameters with satellite and terrain data

One of the goals of the research was to develop a ground sampling stragegy for calibrating remotely sensed measurements of surface climate parameters. The initial sampling strategy involved the stratification of the terrain based on important ancillary surface variables such as slope, exposure, insolation, geology, drainage, fire history, etc. For a spatially heterogeneous population, sampling error is reduced and efficiency increased by stratification of the landscape into more homogeneous sub-areas and by employing periodic random spacing of samples. These concepts were applied in the initial stratification of the study site for the purpose of locating and allocating instrumentation.

Dozier, Jeff↗

Scheduling the NASA Deep Space Network with Deep Reinforcement Learning

With three complexes spread evenly across the Earth, NASA’s Deep Space Network (DSN) is the primary means of communications as well as a significant scientific instrument for dozens of active missions around the world. A rapidly rising number of spacecraft and increasingly complex scientific instruments with higher bandwidth requirements have resulted in demand that exceeds the network’s capacity across its 12 antennae. The existing DSN scheduling process operates on a rolling weekly basis and is time-consuming; for a given week, generation of the final baseline schedule of spacecraft tracking passes takes roughly 5 months from the initial requirements submission deadline, with several weeks of peer-to-peer negotiations in between. This paper proposes a deep reinforcement learning (RL) approach to generate candidate DSN schedules from mission requests and spacecraft ephemeris data with demonstrated capability to address real-world operational constraints. A deep RL agent is developed that takes mission requests for a given week as input, and interacts with a DSN scheduling environment to allocate tracks such that its reward signal is maximized. A comparison is made between an agent trained using Proximal Policy Optimization and its random, untrained counterpart. The results represent a proof-of-concept that, given a well-shaped reward signal, a deep RL agent can learn the complex heuristics used by experts to schedule the DSN. A trained agent can potentially be used to generate candidate schedules to bootstrap the scheduling process and thus reduce the turnaround cycle for DSN scheduling.

Wilson, Brian↗

Statistical methods for efficient design of community surveys of response to noise: Random coefficients regression models

Research studies of residents' responses to noise consist of interviews with samples of individuals who are drawn from a number of different compact study areas. The statistical techniques developed provide a basis for those sample design decisions. These techniques are suitable for a wide range of sample survey applications. A sample may consist of a random sample of residents selected from a sample of compact study areas, or in a more complex design, of a sample of residents selected from a sample of larger areas (e.g., cities). The techniques may be applied to estimates of the effects on annoyance of noise level, numbers of noise events, the time-of-day of the events, ambient noise levels, or other factors. Methods are provided for determining, in advance, how accurately these effects can be estimated for different sample sizes and study designs. Using a simple cost function, they also provide for optimum allocation of the sample across the stages of the design for estimating these effects. These techniques are developed via a regression model in which the regression coefficients are assumed to be random, with components of variance associated with the various stages of a multi-stage sample design.

Tomberlin, T. J.↗

Learning and optimization with cascaded VLSI neural network building-block chips

To demonstrate the versatility of the building-block approach, two neural network applications were implemented on cascaded analog VLSI chips. Weights were implemented using 7-b multiplying digital-to-analog converter (MDAC) synapse circuits, with 31 x 32 and 32 x 32 synapses per chip. A novel learning algorithm compatible with analog VLSI was applied to the two-input parity problem. The algorithm combines dynamically evolving architecture with limited gradient-descent backpropagation for efficient and versatile supervised learning. To implement the learning algorithm in hardware, synapse circuits were paralleled for additional quantization levels. The hardware-in-the-loop learning system allocated 2-5 hidden neurons for parity problems. Also, a 7 x 7 assignment problem was mapped onto a cascaded 64-neuron fully connected feedback network. In 100 randomly selected problems, the network found optimal or good solutions in most cases, with settling times in the range of 7-100 microseconds.

Duong, T.↗

Probabilistic Zonal Reserve Requirements for Improved Energy Deliverability with Wind Power

In power systems with high penetration of renewable energy resources, uncertainty and variability of these stochastic resources introduce additional challenges for the operation of power systems. To improve the power system's reliability in the face of uncertainty, reserves are required as additional generation capacity to rebalance the power system following random disturbances. However, reserve deliverability is not guaranteed, because it may encounter potential transmission line congestion. Zonal reserve requirements can address this issue, but operators lack efficient ways to allocate reserves to zones while accounting for wind power forecast uncertainty. Herein we propose a methodology for probabilistic zonal reserve requirements to address wind power forecast uncertainties. This method estimates the probability distribution of line flows based on the system generation margin and injection shift factor. This estimate is then used to construct pre-defined and post-zonal reserve requirements. Case studies demonstrate that the proposed method efficiently schedules energy and reserves to balance energy and manage deliverability with wind power forecast uncertainty.We also discuss operational implications of the proposed method.

17 WIND ENERGY↗

The biasing scheme in N-body simulations

A popular prescription for the galaxy formation, i.e., identifying peaks in the linear density field as sites of galaxy formation, is numerically justified under the Cold Dark Matter cosmogony. In particular, the peak-background scheme, originally developed to simplify analytic calculations of peak properties in a Gaussian random density field, is proven to be an excellent prescription for assigning peak tracers in low-resolution N-body simulations through many statistical comparisons. It is found that statistical properties of peak tracers allocated by the peak-background scheme closely resemble those of true peaks when the background smoothing length is about three times the galaxy scale and the correspondence improves as they evolve gravitationally. It is also shown that these peak particles are indeed strongly associated with nonlinear objects that are presently collapsed.

Park, Changbom↗