Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer experiments”

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 271 records · Page 15

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

Foundational Science to Accelerate Nuclear Energy Innovation [Brochure]

The foundational science gaps inhibiting the advancement of nuclear energy technologies are identified and tackled in five priority research opportunities. These opportunities pave the way to accelerate the development and ultimately the adoption of new nuclear energy systems. They include the fundamental aspects of ion-electron interactions; novel properties of next-generation coolants and solvents; interfacial dynamics, not only in solids, but in other aspects of nuclear reactors; novel operando and in-situ monitoring and sensing; and artificial intelligence to accelerate condensed phases discovery. Building on the foundation established by previous BES workshops, these opportunities encompass recent advances in fundamental knowledge and focus on the experimental and computational methods needed to resolve major technical challenges for nuclear energy technologies. Through developing fundamental scientific insight as well as pushing the frontiers of modeling complex systems and probing the operation of materials and chemical systems in extreme environments, research motivated by the priorities identified here will further develop the promise, potential, and utilization of nuclear energy for a clean energy future. The PROs are as follows: (1) Master complex electronic structures to tailor thermochemical reactivity, transport, and microstructural evolution; (2) Interrogate and direct the physics and chemistry underpinning next-generation coolants and solvents; (3) Elucidate and control the underlying physics and chemistry of interfaces in complex nuclear environments; (4) Bridge multi-fidelity multi-resolution experiments, computational modeling, and data science to control dynamic behavior; and (5) Harness artificial intelligence to design inherently resilient condensed phases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

X-33 Rev-F Turbulent Aeroheating Results From Test 6817 in NASA Langley 20-Inch Mach 6 Air Tunnel and Comparisons With Computations

Measurements and predictions of the X-33 turbulent aeroheating environment have been performed at Mach 6, perfect-gas air conditions. The purpose of this investigation was to compare measured turbulent aeroheating levels on smooth models, models with discrete trips, and models with arrays of bowed panels (which simulate bowed thermal protections system tiles) with each other and with predictions from two Navier-Stokes codes, LAURA and GASP. The wind tunnel testing was conducted at free stream Reynolds numbers based on length of 1.8 x 10(exp 6) to 6.1 x 10(exp 6) on 0.0132 scale X-33 models at a = 40-deg. Turbulent flow was produced by the discrete trips and by the bowed panels at ill but the lowest Reynolds number, but turbulent flow on the smooth model was produced only at the highest Reynolds number. Turbulent aeroheating levels on each of the three model types were measured using global phosphor thermography and were found to agree to within .he estimated uncertainty (plus or minus 15%) of the experiment. Computations were performed at the wind tunnel free stream conditions using both codes. Turbulent aeroheating levels predicted using the LAURA code were generally 5%-10% lower than those from GASP, although both sets of predictions fell within the experimental accuracy of the wind tunnel data.

Hollis, Brian R.↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

Uncertainty quantification for molecular property predictions with graph neural architecture search

Graph Neural Networks (GNNs) have emerged as a prominent class of data-driven methods for molecular property prediction. However, a key limitation of typical GNN models is their inability to quantify uncertainties in the predictions. This capability is crucial for ensuring the trustworthy use and deployment of models in downstream tasks. To that end, we introduce AutoGNNUQ, an automated uncertainty quantification (UQ) approach for molecular property prediction. AutoGNNUQ leverages architecture search to generate an ensemble of high-performing GNNs, enabling the estimation of predictive uncertainties. Our approach employs variance decomposition to separate data (aleatoric) and model (epistemic) uncertainties, providing valuable insights for reducing them. In our computational experiments, we demonstrate that AutoGNNUQ outperforms existing UQ methods in terms of both prediction accuracy and UQ performance on multiple benchmark datasets, and generalizes well to out-of-distribution datasets. Additionally, we utilize t-SNE visualization to explore correlations between molecular features and uncertainty, offering insight for dataset improvement. AutoGNNUQ has broad applicability in domains such as drug discovery and materials science, where accurate uncertainty quantification is crucial for decision-making.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using Computationally-Determined Properties for Machine Learning Prediction of Self-Diffusion Coefficients in Pure Liquids

The ability to predict transport properties of liquids quickly and accurately will greatly improve our understanding of fluid properties both in bulk and complex mixtures, as well as in confined environments. Such information could then be used in the design of materials and processes for applications ranging from energy production and storage to manufacturing processes. As a first step, we consider the use of machine learning (ML) methods to predict the diffusion properties of pure liquids. Recent results have shown that Artificial Neural Networks (ANNs) can effectively predict the diffusion of pure compounds based on the use of experimental properties as the model inputs. In the current study, a similar ANN approach is applied to modeling diffusion of pure liquids using fluid properties obtained exclusively from molecular simulations. A diverse set of 102 pure liquids is considered, ranging from small polar molecules (e.g., water) to large nonpolar molecules (e.g., octane). Self-diffusion coefficients were obtained from classical molecular dynamics (MD) simulations. Since nearly all the molecules are organic compounds, a general set of force field parameters for organic molecules was used. The MD methods are validated by comparing physical and thermodynamic properties with experiment. Computational input features for the ANN include physical properties obtained from the MD simulations as well as molecular properties from quantum calculations of individual molecules. Furthermore, fluid properties describing the local liquid structure were obtained from center of mass radial distribution functions (COM-RDFs). Feature sensitivity analysis revealed that isothermal compressibility, heat of vaporization, and the thermal expansion coefficient were the most impactful properties used as input for the ANN model to predict the MD simulated self-diffusion coefficients. The MD-based ANN successfully predicts the MD self-diffusion coefficients with only a subset (2 to 3) of the available computationally determined input features required. A separate ANN model was developed using literature experimental self-diffusion coefficients as model targets. Although this second ML model was not as successful due to a limited number of data points, a good correlation is still observed between experimental and ML predicted self-diffusion coefficients.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mechanisms of Degradation of Toxic Nerve Agents: Quantum-chemical Insight into Interactions of Sarin and Soman with Molybdenum Dioxide

With the urgent need to provide an efficient and reliable protection for people from fatal chemical and biological weapons, our fundamental understanding of how toxins interact with filters is far from complete. The situation is further complicated by natural difficulties of performing experimental measurements with lethal toxins. Unlike experiments, computational modeling offers an attractive and safe yet reliable way of studying behavior of toxic agents on a variety of substrates at a great level of detail. Here, we report DFT-based quantum-chemical calculations of adsorption and decomposition of DMMP, sarin and soman on MoO 2 (011) surface. Our calculations show that MoO 2 strongly adsorbs toxic nerve agents and quickly decomposes them. Decomposition of DMMP on the MoO 2 (011) surface proceeds via the PO-CH 3 bond breaking and a formation of a surface methoxy group. The calculated activation barrier for this reaction is 131.5 kJ mol -1 . Unlike DMMP, decomposition of sarin and soman proceeds via the dealkylation reaction yielding propene and 3,3-dimethyl-1-butene, respectively. Decomposition of sarin requires a remarkably low energy (53.7 kJ mol- 1 ), whereas the similar reaction in soman requires 50 kJ mol -1 more energy. We also make specific predictions to guide Ambient-Pressure X-ray Photoelectron Spectroscopy (APXPS) experiments on sarin interaction with MoO 2 samples. We conclude that MoO 2 serves as an efficient substrate able of degrading toxins.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Surrogate Modeling and Optimization of a Combustor with an Interdigitated Flushwall Injector

Design and Analysis of Computer Experiments (DACE) methods are applied and used to perform surrogate modeling and optimization of a simplified combustor flowpath with an interdigitated flushwall injector. The objectives of the optimization are the thrust potential and combustion efficiency, which are evaluated across a range of flight Mach numbers, duct heights, spanwise spacings, and injection angles. The focus of this work is to highlight the application of a sequential learning approach, in order to learn about the responses of the objective functions over the design space and to identify local regions of interest for further analysis. This approach is contrasted to a previous effort where only a single sampling set was used to fit surrogate models and perform optimization. The optimal solutions resulting from the previous and present approaches are different, due to surrogate model-guided local refinement of the design space allowed by the sequential learning method. The values of the global error estimates between the previous and present approaches are comparable, but the sequential method proved more computationally cost-effective. Further refinement in the optimal regions might be needed to improve predictive capability of surrogate models and to obtain the optimal solutions sets.

Rajiv R Shenoy↗

Unsteady numerical simulations of the stability and dynamics of flames

In this report we describe the research performed at the Naval Research Laboratory in support of the NASA Microgravity Science and Applications Program over the past three years (from Feb. 1992) with emphasis on the work performed since the last microgravity combustion workshop. The primary objective of our research is to develop an understanding of the differences in the structure, stability, dynamics and extinction of flames in earth gravity and in microgravity environments. Numerical simulations, in which the various physical and chemical processes can be independently controlled, can significantly advance our understanding of these differences. Therefore, our approach is to use detailed time-dependent, multi-dimensional, multispecies numerical models to perform carefully designed computational experiments. The basic issues we have addressed, a general description of the numerical approach, and a summary of the results are described in this report. More detailed discussions are available in the papers published which are referenced herein. Some of the basic issues we have addressed recently are (1) the relative importance of wall losses and gravity on the extinguishment of downward-propagating flames; (2) the role of hydrodynamic instabilities in the formation of cellular flames; (3) effects of gravity on burner-stabilized flames, and (4) effects of radiative losses and chemical-kinetics on flames near flammability limits. We have also expanded our efforts to include hydrocarbon flames in addition to hydrogen flames and to perform simulations in support of other on-going efforts in the microgravity combustion sciences program. Modeling hydrocarbon flames typically involves a larger number of species and a much larger number of reactions when compared to hydrogen. In addition, more complex radiation models may also be needed. In order to efficiently compute such complex flames recent developments in parallel computing have been utilized to develop a state-of-the-art parallel flame code. This is discussed below in some detail after a brief discussion of the numerical models.

Kailasanath, K.↗

Active Subspace Methods for Data-Intensive Inverse Problems

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗

Active Subspace Methods for Data-Intensive Inverse Problems (Final Report)

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗

Progress on Demonstration of a MOOSE-Based Coupled Capability for Hot Channel Factors in Fast Reactors

Hot channel factors (HCFs) are computed values that account for the impact on predicted peak fuel, cladding, and coolant temperatures due to uncertainties in the as-built reactor’s material properties and geometry as well as uncertainties due to modeling approximations. Reduction in computed HCF values via reduction or elimination of modeling approximations may translate to significant economic savings if the reactor power can be raised due to the extra temperature margin gained. While limited historical datasets exist for sodium-cooled fast reactors (SFRs), there are no available HCF data for lead-cooled fast reactors (LFRs) outside of work generated previously within NEAMS. The computation of HCFs involves insights from reactor physics, thermal fluids and heat conduction calculations to determine how the peak temperatures respond to various uncertainties in the design. Due to the significant advantages for multi-physics coupling offered by the MOOSE framework, Griffin (MOOSE-based reactor physics code), MOOSE Heat Conduction Module, and Cardinal (MOOSE-wrapped multi-physics application which includes the NekRS thermal fluids code) are being coupled together using the MOOSE MultiApp System to develop a highfidelity multi-physics modeling capability for HCF simulations. This high-fidelity coupling workflow may also be beneficial for other fast reactor applications in the future. In previous work, Griffin and NekRS were individually assessed to ensure the necessary capabilities were in place. This work describes initial efforts to couple the codes (including folding in the MOOSE Heat Conduction Module) and determining the workflow for the perturbed calculations which will leverage the Stochastic Tools Module (STM). To our knowledge, this is the first coupling of Griffin and NekRS as well as the first exploratory use of Stochastic Tools Module for Cardinal. In this report, the neutronics code Griffin, the heat conduction solver in MOOSE, and the MOOSE-wrapped application containing NekRS (Cardinal) are linked together to demonstrate the coupled capability. Griffin and Cardinal are linked dynamically by specifying shared libraries. Different coupling hierarchies are tested for selecting the most appropriate coupling strategy. A coupling scheme is selected based on the efficiency of calculation and ease of data communication. Multiple tests are performed to choose suitable mesh structure, model configurations, scheme setup and boundary conditions to avoid loss of energy due to data interpolation between different modules or weak imposition of fluxes in finite element codes. Computational experiments are performed to study the tolerance control of each type of iteration to avoid false convergence. The coupled capability is demonstrated in both single pin and 7-pin models based on LFR materials and geometry. The study finds that the use of too large a time step size in the heat conduction module can lead to temperature oscillation even though the heat conduction equation does not have a time-derivative kernel, but only the time-dependent boundary condition. A 7-pin model without duct region achieved good convergence in the coupled calculation while a 7 pin model with duct region experienced data communication issues which need to be resolved.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling Subsurface Performance of a Geothermal Reservoir Using Machine Learning

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. In this study, we describe a new approach combining reservoir modeling and machine learning to produce models that enable such a strategy. Our computational approach allows us, first, to translate sets of potential flow rates for the active wells into reservoir-wide estimates of produced energy, and second, to find 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 h, whereas our machine learning models yield accurate 20-year predictions for temperatures, pressures, and produced energy in 0.9 s. 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.

15 GEOTHERMAL ENERGY↗

Dynamic Motions of Topological Defects in Nematic Liquid Crystals under Spatial Confinement

Abstract Topological defects (TDs) have become a sensational topic due to their significant influence on the unusual optical and physiochemical characteristics of the material. To facilitate their application across a wide range of disciplines it is desirable to analyze and gain fundamental understanding of TDs in both equilibrium and nonequilibrium systems. Liquid crystals (LCs) are considered an ideal system for study given the direct visualization of TDs and a straightforward analyzation process. In addition to the equilibrium morphology of LC TDs, it is also of great interest to track and control the formation and annihilation of defects during thermodynamic processes. However, controlling the dynamic behavior of formed defects remains a challenge. Here, nematic LCs confined in a cell exhibiting surfaces with periodic anchoring conditions containing surface topography are relied on. The effects of patterned surface characteristics such as width, periodicity, and degree of curvature on defects dynamic motion, stabilization, and annihilation are explored. The computational experiments recapitulate the TDs transition path and provide free energy‐based predictions of critical distances for defect annihilation. Taken together, this simple approach offers a promising opportunity to control the dynamics of TDs in LCs through chemical patterned surfaces with topography.

36 MATERIALS SCIENCE↗

A multi-stage stochastic programming model for adaptive biomass processing operation under uncertainty

Variations of physical and chemical characteristics of biomass reduce equipment utilization and increase operational costs of biomass processing. Biomass processing facilities use sensors to monitor the changes in biomass characteristics. Integrating sensory data into the operational decisions in biomass processing will increase its flexibility to the changing biomass conditions. In this paper, we propose a multi-stage stochastic programming model that minimizes the expected operational costs by identifying the initial inventory level and creating an operational decision policy for equipment speed settings. These policies take the sensory information data and the current biomass inventory level as inputs to dynamically adjust inventory levels and equipment settings according to the changes in the biomass' characteristics. We ensure that a prescribed target reactor utilization is consistently achieved by penalizing the violation of the target reactor feeding rate. A case study is developed using real-world data collected at Idaho National Laboratory's biomass processing facility. We show the value of multi-stage stochastic programming from an extensive computational experiment. Our sensitivity analysis indicates that updating the infeed rate of the system, the processing speed of equipment, and bale sequencing based on the moisture level of biomass improves the processing rate of the reactor and reduces operating costs.

09 BIOMASS FUELS↗