Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic”

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 415 records · Page 23

Tracking Extremes in Exascale Simulations Utilizing Exascale Platforms

There is a growing recognition in the literature that understanding variability and trends in hydrometeorological extremes relies on understanding variability and trends in the meteorological phenomena that drive these extremes. Such phenomenon-focused understanding relies critically on a robust methodology for identifying the occurrence of these phenomena in observations and model output, but a robust methodology does not currently exist. There are a variety of heuristic methods reported in the literature for identifying, and in some cases temporally tracking, meteorological phenomena. However, there have been several intercomparison projects (and resulting papers) indicating that there is a large uncertainty associated with choices in the identification methods; this is the case for extratropical cyclones (ETCs), atmospheric rivers (ARs), and even tropical cyclones (TCs); and we hypothesize that this is a general issue with heuristic identification methods altogether. These studies clearly show that this identification uncertainty leads to a large, and previously under-recognized, quantitative and even qualitative uncertainty in our understanding of these phenomena. In light of these issues, we suggest that the field could be advanced by addressing two overarching questions. First, can we explicitly quantify uncertainty associated with detecting hydrometeorological phenomena? Second, can we decompose detection uncertainty into reducible and irreducible parts?

58 GEOSCIENCES↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

A simple levelset contact algorithm for large overlap removal and robust preloads

A simple approach to simulate contact between deformable objects is presented which relies on levelset descriptions of the Lagrangian geometry and an optimization-based solver. Modeling contact between objects remains a significant challenge for computational mechanics simulations. Common approaches are either plagued by lack of robustness or are exceedingly complex and require a significant number of heuristics. In contrast, the levelset contact approach presented herein is essentially heuristic free. Furthermore, the presented algorithm enables resolving and enforcing contact between objects with a significant amount of initial overlap. Examples demonstrating the feasibility of this approach are shown, including the standard Hertz contact problem, the robust removal of overlap between two overlapping blocks, and overlap-removal and pre-load for a bolted configuration.

42 ENGINEERING↗

Economic Analysis of Battery Energy Storage Systems Incorporating Uncertain Battery Model

A high-fidelity battery model is essential for precise economic analysis of battery energy storage systems (BESSs), but these models are computationally intensive. Heuristic models offer computational efficiency but compromise the accuracy of economic analysis results. We assess the impact of errors in heuristic battery models on economic analysis by utilizing open-circuit voltage (OCV) measurements from battery experiments.

Choi, Hyungjin [Sandia National Laboratories (SNL-↗

DAiSES: Dynamic Adaptivity in Support of Extreme Scale Department of Energy Project No. ER25622 Prime Contract No. DE-FG02-04ER25622 Final Report for September 15, 2004-September 14, 2008

The DAiSES project [Te04] was focused on enabling conventional operating systems, in particular, those running on extreme scale systems, to dynamically customize system resource management in order to offer applications the best possible environment in which to execute. Such dynamic adaptation allows operating systems to modify the execution environment in response to changes in workload behavior and system state. The main challenges of this project included determination of what operating system (OS) algorithms, policies, and parameters should be adapted, when to adapt them, and how to adapt them. We addressed these challenges by using a combination of static analysis and runtime monitoring and adaptation to identify a priori profitable targets of adaptation and effective heuristics that can be used to dynamically trigger adaptation. Dynamic monitoring and adaptation of the OS was provided by either kernel modifications or the use of KernInst and Kperfmon [Wm04]. Since Linux, an open source OS, was our target OS, patches submitted by kernel developers and researchers often facilitated kernel modifications. KernInst operates on unmodified commodity operating systems, i.e., Solaris and Linux; it is fine-grained, thus, there were few constraints on how the underlying OS can be modified. Dynamically adaptive functionality of operating systems, both in terms of policies and parameters, is intended to deliver the maximum attainable performance of a computational environment and meet, as best as possible, the needs of high-performance applications running on extreme scale systems, while meeting system constraints. DAiSES research endeavored to reach this goal by developing methodologies for dynamic adaptation of OS parameters and policies to manage stateful and stateless resources [Te06] and pursuing the following two objectives: (1) Development of mechanisms to dynamically sense, analyze, and adjust common performance metrics, fluctuating workload situations, and overall system environment conditions. (2) Demonstration, via Linux prototypes and experiments, of dynamic self-tuning and self-provisioning in HPC environments. From a high level, the DAiSES methodology, depicted in Figure 1, includes characterization of application resource usage patterns, identification of candidate (profitable) adaptation targets, determination of feasible adaptation ranges, definition of heuristics to trigger adaptation, design and implementation of OS monitoring, triggering, and adaptation code, and quantification of performance gains.

97 MATHEMATICS AND COMPUTING↗

Signature molecular descriptor : advanced applications.

In this work we report on the development of the Signature Molecular Descriptor (or Signature) for use in the solution of inverse design problems as well as in highthroughput screening applications. The ultimate goal of using Signature is to identify novel and non-intuitive chemical structures with optimal predicted properties for a given application. We demonstrate this in three studies: green solvent design, glucocorticoid receptor ligand design and the design of inhibitors for Factor XIa. In many areas of engineering, compounds are designed and/or modified in incremental ways which rely upon heuristics or institutional knowledge. Often multiple experiments are performed and the optimal compound is identified in this brute-force fashion. Perhaps a traditional chemical scaffold is identified and movement of a substituent group around a ring constitutes the whole of the design process. Also notably, a chemical being evaluated in one area might demonstrate properties very attractive in another area and serendipity was the mechanism for solution. In contrast to such approaches, computer-aided molecular design (CAMD) looks to encompass both experimental and heuristic-based knowledge into a strategy that will design a molecule on a computer to meet a given target. Depending on the algorithm employed, the molecule which is designed might be quite novel (re: no CAS registration number) and/or non-intuitive relative to what is known about the problem at hand. While CAMD is a fairly recent strategy (dating to the early 1980s), it contains a variety of bottlenecks and limitations which have prevented the technique from garnering more attention in the academic, governmental and industrial institutions. A main reason for this is how the molecules are described in the computer. This step can control how models are developed for the properties of interest on a given problem as well as how to go from an output of the algorithm to an actual chemical structure. This report provides details on a technique to describe molecules on a computer, called Signature, as well as the computer-aided molecule design algorithm built around Signature. Two applications are provided of the CAMD algorithm with Signature. The first describes the design of green solvents based on data in the GlaxoSmithKline (GSK) Solvent Selection Guide. The second provides novel non-steroidal glucocorticoid receptor ligands with some optimally predicted properties. In addition to using the CAMD algorithm with Signature, it is demonstrated how to employ Signature in a high-throughput screening study. Here, after classifying both active and inactive inhibitors for the protein Factor XIa using Signature, the model developed is used to screen a large, publicly-available database called PubChem for the most active compounds.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing Price-Informed Operation of a Battery Storage System in an Office Building

New prescriptive efficiency requirements amended to US model energy codes historically have been evaluated using an average, blended electricity rate, which obscures demand charges. Post 2019, new measures can be evaluated using a representative time-of-use (TOU) tariff yet more sophisticated analysis methods are needed to consider a variety of TOU tariffs and assess price-informed control. To address these needs, this study couples building prototype simulation model with varying-in-sophistication battery storage operating strategies for different electricity TOU tariffs. The analysis compares the impact of operating a battery storage system following simpler rule-of-thumb methods versus a semi-optimized priced-informed heuristic approach. The investigation demonstrates that the heuristic approach results in greater electricity cost savings and is practical to implement.

Lei, Xuechen↗

Teaching Freight Mode Choice Models New Tricks Using Interpretable Machine Learning Methods

Understanding and forecasting the intricate freight mode choice behavior under various industry, policy, and technology contexts is essential in freight planning and policymaking. Numerous models have been developed in prior studies to provide insights into freight mode selection, the majority of which use discrete choice models such as multinomial logit (MNL) models. However, logit models often rely on linear specifications of independent variables, despite potential nonlinear relationships in the data. Moreover, there often lacks a heuristic and efficient approach to identify such complex relationships to define the logit model specifications. To fill this gap, we developed an MNL model for freight mode choice using the insights from state-of-the- art machine learning (ML) models. ML models can capture the nonlinear nature of the complex decision-making process, and recent advances in 'explainable AI' have greatly improved their interpretability. The interpretable ML methods help enhance the performance of MNL models and advance knowledge of freight mode choice. Specifically, the influential factors and their relationship with individual modes are identified using SHapley Additive exPlanations (SHAP) to improve the MNL's performance. The workflow is demonstrated in a case study of Austin, Texas, and the SHAP results reveal multiple nonlinear relationships predicted by ML models. Incorporating those relationships into MNL model specifications improves the interpretability and accuracy of the MNL model compared to a conventional MNL model. Findings from this study can be used to guide freight planning and inform policymakers and practitioners on how key factors affect freight decision-making.

ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗

Physical and Functional Constraints on Viable Belowground Acquisition Strategies

Since their emergence onto land, terrestrial plants have developed diverse strategies to acquire soil resources. However, we lack a framework that adequately captures how these strategies vary among species. Observations from around the world now allow us to quantify the variation observed in commonly-measured fine-root traits but it is unclear how root traits are interrelated and whether they fall along an “economic” spectrum of acquisitive to conservative strategies. We assessed root trait variation and mycorrhizal colonization rates by leveraging the largest global database of fine-root traits (the Fine-Root Ecology Database; FRED). We also developed a heuristic model to explore the role of mycorrhizal fungi in defining belowground exploration efficiency across a gradient of thin- to thick-diameter roots. In support of the expectations of the “root economic spectrum,” we found that root diameter was negatively related to specific root length (Pearson’s r=-0.76). However, we found an unexpected negative relationship between root diameter and root tissue density (Pearson’s r = -0.40), and we further observed that root nitrogen content was largely unrelated to other economic traits. Mycorrhizal colonization was most closely associated with root diameter (Pearson’s r = 0.62) and was unrelated to root tissue density and root nitrogen. The heuristic model demonstrated that while thinner roots have inherently greater capacity to encounter soil resources based on higher surface area per unit mass, the potential for increased associations with mycorrhizal fungi in thicker roots, combined with greater hyphal growth, can result in equally acquisitive strategies for both thin- and thick roots. Taken together, our assessments of root trait variation, trade-offs with mycorrhizal fungi, and broader connections to root longevity allowed us to propose a series of fundamental constraints on belowground resource acquisition strategies. Physical tradeoffs based on root construction (i.e., economic traits) and functional limitations related to the capacity of a root to encounter and acquire soil resources combine to limit the two-dimensional belowground trait space. Within this trait space there remains a diversity of additional variation in root traits that facilitates a wide range of belowground resource acquisition strategies.

59 BASIC BIOLOGICAL SCIENCES↗

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗

Model Predictive Control of the Exit Part Temperature for an Austenitization Furnace

Quench hardening is the process of strengthening and hardening ferrous metals and alloys by heating the material to a specific temperature to form austenite (austenitization), followed by rapid cooling (quenching) in water, brine or oil to introduce a hardened phase called martensite. The material is then often tempered to increase toughness, as it may decrease from the quench hardening process. The austenitization process is highly energy-intensive and many of the industrial austenitization furnaces were built and equipped prior to the advent of advanced control strategies and thus use large, sub-optimal amounts of energy. The model computes the energy usage of the furnace and the part temperature profile as a function of time and position within the furnace under temperature feedback control. In this paper, the aforementioned model is used to simulate the furnace for a batch of forty parts under heuristic temperature set points suggested by the operators of the plant. A model predictive control (MPC) system is then developed and deployed to control the the part temperature at the furnace exit thereby preventing the parts from overheating. An energy efficiency gain of 5.3% was obtained under model predictive control compared to operation under heuristic temperature set points tracked by a regulatory control layer.

36 MATERIALS SCIENCE↗

A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

42 ENGINEERING↗

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗

An Optimization-Based Law of Mass Action Precipitation/Dissolution Model

Rare earth elements (REE) and many other critical minerals are necessary for the manufacturing of modern everyday technologies, including microchips, batteries and electric motors. Recovery of these materials typically involves aqueous systems which can be modeled as chemical equilibrium problems. One common method for solving these problems is the law of mass action approach (LMA), where a system of non-linear equations involving the equilibrium constants is solved. However, despite being theoretically simple, these problems are in practice very difficult to solve. Currently, the use of iterative heuristics based on saturation indices to decide on which species and reactions to include in the calculations is the state of the art to arrive at a solution. Here, we present an optimization-based alternative to solve chemical equilibria problems involving precipitation/dissolution reactions without the need for such heuristics. Our approach is first validated against the LMA software MINTEQ and PHREEQC for a number of case studies, and then applied to a novel REE recovery process reported in the literature. Overall, our approach was found to have close agreement with MINTEQ and PHREEQC, and we were able to successfully replicate the reported yield and purity for the published REE process.

42 ENGINEERING↗

Combining active learning suggestions

We study the problem of combining active learning suggestions to identify informative training examples by empirically comparing methods on benchmark datasets. Many active learning heuristics for classification problems have been proposed to help us pick which instance to annotate next. But what is the optimal heuristic for a particular source of data? Motivated by the success of methods that combine predictors, we combine active learners with bandit algorithms and rank aggregation methods. We demonstrate that a combination of active learners outperforms passive learning in large benchmark datasets and removes the need to pick a particular active learner a priori. We discuss challenges to finding good rewards for bandit approaches and show that rank aggregation performs well.

97 MATHEMATICS AND COMPUTING↗

A second quantized model of anharmonicity.

A heuristic description is given for a simple harmonic oscillator as a basis for a model of anharmonicity. A formalism is applied in the process, which applies to complex excitation fields involving particle clusters and also facilitates a description of nonequilibrium multibody configurations by classical methods. The heuristic description is based on Streit's results (1965) and is free of linearization requirements in most physically interesting situations.

Rasetti, M.↗

Digital processing of stereoscopic image pairs.

The problem under consideration is concerned with scene analysis during robot navigation on the surface of Mars. In this mode, the world model of the robot must be continuously updated to include sightings of new obstacles and scientific samples. In order to describe the content of a particular scene, it is first necessary to segment it into known objects. One technique for accomplishing this segmentation is by analyzing the pair of images produced by the stereoscopic cameras mounted on the robot. A heuristic method is presented for determining the range for each point in the two-dimensional scene under consideration. The method is conceptually based on a comparison of corresponding points in the left and right images of the stereo pair. However, various heuristics which are adaptive in nature are used to make the algorithm both efficient and accurate. Examples are given of the use of this so-called range picture for the purpose of scene segmentation.

Levine, M. D.↗

Steady-state currents in p-n junction filaments or grains in case of large surface recombination velocities at lateral surfaces

Recently it has been pointed out that the saturation current of a semiconductor filament which constitutes part of a p-n junction diverges when the surface recombination velocity at the faces become infinitely large. Here it is pointed out that this is to be expected on physical grounds since, whenever the carrier concentration is kept off equilibrium by an outside agent, and at the same time recombination lifetimes in the bulk or in surface layers tend to zero, concentration gradients tend to infinity. As also previously noted, the situation can be remedied by using realistic (finite) surface recombination velocities in model calculations. However, this procedure leads to mathematical complexities which have been circumvented recently by the introduction of a heuristic approach. It is the aim of this paper to assess the validity of the heuristic approach by means of detailed and exact calculations.

Von Roos, O.↗