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 1,063 records · Page 59

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Scanning holographic optical tweezers

The aim of this Letter is to introduce a new optical tweezers approach, called scanning holographic optical tweezers (SHOT), which drastically increases the working area (WA) of the holographic-optical tweezers (HOT) approach, while maintaining tightly focused laser traps. A 12-fold increase in the WA is demonstrated. The SHOT approach achieves its utility by combining the large WA of the scanning optical tweezers (SOT) approach with the flexibility of the HOT approach for simultaneously moving differently structured optical traps in and out of the focal plane. This Letter also demonstrates a new heuristic control algorithm for combining the functionality of the SOT and HOT approaches to efficiently allocate the available laser power among a large number of traps. The proposed approach shows promise for substantially increasing the number of particles that can be handled simultaneously, which would enable optical tweezers additive fabrication technologies to rapidly assemble microgranular materials and structures in reasonable build times.

42 ENGINEERING↗

FastBLAST: Homology Relationships for Millions of Proteins

Background: All-versus-all BLAST, which searches for homologous pairs of sequences in a database of proteins, is used to identify potential orthologs, to find new protein families, and to provide rapid access to these homology relationships. As DNA sequencing accelerates and data sets grow, all-versus-all BLAST has become computationally demanding. Methodology/Principal Findings: We present FastBLAST, a heuristic replacement for all-versus-all BLAST that relies on alignments of proteins to known families, obtained from tools such as PSI-BLAST and HMMer. FastBLAST avoids most of the work of all-versus-all BLAST by taking advantage of these alignments and by clustering similar sequences. FastBLAST runs in two stages: the first stage identifies additional families and aligns them, and the second stage quickly identifies the homologs of a query sequence, based on the alignments of the families, before generating pairwise alignments. On 6.53 million proteins from the non-redundant Genbank database (‘‘NR’’), FastBLAST identifies new families 25 times faster than all-versus-all BLAST. Once the first stage is completed, FastBLAST identifies homologs for the average query in less than 5 seconds (8.6 times faster than BLAST) and gives nearly identical results. For hits above 70 bits, FastBLAST identifies 98% of the top 3,250 hits per query. Conclusions/Significance: FastBLAST enables research groups that do not have supercomputers to analyze large protein sequence data sets. FastBLAST is open source software and is available at http://microbesonline.org/fastblast.

59 BASIC BIOLOGICAL SCIENCES↗

FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments

Background: We recently described FastTree, a tool for inferring phylogenies for alignments with up to hundreds of thousands of sequences. Here, we describe improvements to FastTree that improve its accuracy without sacrificing scalability. Methodology/Principal Findings: Where FastTree 1 used nearest-neighbor interchanges (NNIs) and the minimum-evolution criterion to improve the tree, FastTree 2 adds minimum-evolution subtree-pruning-regrafting (SPRs) and maximumlikelihood NNIs. FastTree 2 uses heuristics to restrict the search for better trees and estimates a rate of evolution for each site (the ‘‘CAT’’ approximation). Nevertheless, for both simulated and genuine alignments, FastTree 2 is slightly more accurate than a standard implementation of maximum-likelihood NNIs (PhyML 3 with default settings). Although FastTree 2 is not quite as accurate as methods that use maximum-likelihood SPRs, most of the splits that disagree are poorly supported, and for large alignments, FastTree 2 is 100–1,000 times faster. FastTree 2 inferred a topology and likelihood-based local support values for 237,882 distinct 16S ribosomal RNAs on a desktop computer in 22 hours and 5.8 gigabytes of memory. Conclusions/Significance: FastTree 2 allows the inference of maximum-likelihood phylogenies for huge alignments. FastTree 2 is freely available at http://www.microbesonline.org/fasttree.

59 BASIC BIOLOGICAL SCIENCES↗

Behavioral and Physiological Changes during Benthic-Pelagic Transition in the Harmful Alga, Heterosigma akashiwo : Potential for Rapid Bloom Formation

Many species of harmful algae transition between a motile, vegetative stage in the water column and a non-motile, resting stage in the sediments. Physiological and behavioral traits expressed during benthic-pelagic transition potentially regulate the timing, location and persistence of blooms. The roles of key physiological and behavioral traits involved in resting cell emergence and bloom formation were examined in two geographically distinct strains of the harmful alga, Heterosigma akashiwo. Physiological measures of cell viability, division and population growth, and cell fatty acid content were made using flow cytometry and gas chromatography – mass spectrometry techniques as cells transitioned between the benthic resting stage and the vegetative pelagic stage. Video-based tracking was used to quantify cell-level swimming behaviors. Data show increased temperature and light triggered rapid emergence from the resting stage and initiated cell swimming. Algal strains varied in important physiological and behavioral traits, including survivorship during life-stage transitions, population growth rates and swimming velocities. Collectively, these traits function as “population growth strategies” that can influence bloom formation. Many resting cells regained the up-swimming capacity necessary to cross an environmentally relevant halocline and the ability to aggregate in near-surface waters within hours after vegetative growth supporting conditions were restored. Using a heuristic model, we illustrate how strain-specific population growth strategies can govern the timescales over which H. akashiwo blooms form. Our findings highlight the need for identification and quantification of strain-specific physiological and behavioral traits to improve mechanistic understanding of bloom formation and successful bloom prediction.

59 BASIC BIOLOGICAL SCIENCES↗

Maximal Sum of Metabolic Exchange Fluxes Outperforms Biomass Yield as a Predictor of Growth Rate of Microorganisms

Growth rate has long been considered one of the most valuable phenotypes that can be measured in cells. Aside from being highly accessible and informative in laboratory cultures, maximal growth rate is often a prime determinant of cellular fitness, and predicting phenotypes that underlie fitness is key to both understanding and manipulating life. Despite this, current methods for predicting microbial fitness typically focus on yields [e.g., predictions of biomass yield using GEnomescale metabolic Models (GEMs)] or notably require many empirical kinetic constants or substrate uptake rates, which render these methods ineffective in cases where fitness derives most directly from growth rate. Here we present a new method for predicting cellular growth rate, termed SUMEX, which does not require any empirical variables apart from a metabolic network (i.e., a GEM) and the growth medium. SUMEX is calculated by maximizing the SUM of molar EXchange fluxes (hence SUMEX) in a genome-scale metabolic model. SUMEX successfully predicts relative microbial growth rates across species, environments, and genetic conditions, outperforming traditional cellular objectives (most notably, the convention assuming biomass maximization). The success of SUMEX suggests that the ability of a cell to catabolize substrates and produce a strong proton gradient enables fast cell growth. Easily applicable heuristics for predicting growth rate, such as what we demonstrate with SUMEX, may contribute to numerous medical and biotechnological goals, ranging from the engineering of faster-growing industrial strains, modeling of mixed ecological communities, and the inhibition of cancer growth.

59 BASIC BIOLOGICAL SCIENCES↗

Detecting multiple communities using quantum annealing on the D-Wave system

A very important problem in combinatorial optimization is the partitioning of a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection, and has become very important in various fields of science including chemistry, biology and social sciences. The problem of community detection is a twofold problem that consists of determining the number of communities and, at the same time, finding those communities. This drastically increases the solution space for heuristics to work on, compared to traditional graph partitioning problems. In many of the scientific domains in which graphs are used, there is the need to have the ability to partition a graph into communities with the “highest quality” possible since the presence of even small isolated communities can become crucial to explain a particular phenomenon. We have explored community detection using the power of quantum annealers, and in particular the D-Wave 2X and 2000Q machines. It turns out that the problem of detecting at most two communities naturally fits into the architecture of a quantum annealer with almost no need of reformulation. This paper addresses a systematic study of detecting two or more communities in a network using a quantum annealer.

97 MATHEMATICS AND COMPUTING↗

Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers

The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count. To compensate for the reduced number of qubits, one has to rely on special heuristic software such as qbsolv, the purpose of which is to decompose a large quadratic unconstrained binary optimization (QUBO) problem into smaller pieces that fit onto a quantum annealer. In this work, we compare the performance of the open-source qbsolv which is a part of the D-Wave Ocean tools and a new Mukai QUBO solver from Quantum Computing Inc. (QCI). The comparison is done for solving the electronic structure problem and is implemented in a classical mode (Tabu search techniques). The Quantum Annealer Eigensolver is used to map the electronic structure eigenvalue-eigenvector equation to a QUBO problem, solvable on a D-Wave annealer. We find that the Mukai QUBO solver outperforms the Ocean qbsolv with one to two orders of magnitude more accurate energies for all calculations done in the present work, both the ground and excited state calculations. This work stimulates the further development of software to assist in the utilization of modern quantum annealers.

97 MATHEMATICS AND COMPUTING↗

Dataset for Blueprinting Electrified Transit System Implementation

This dataset contains the figures and tabulated results generated from a system-level optimization study of transit fleet electrification planning. The dataset does not include executable modeling code required to reproduce the optimization. The dataset includes results for optimized charging infrastructure deployment by location and power level and service block assignments by fuel type, battery capacity selections, and distributed energy resource sizing. It also contains aggregated financial results, capital expenditures, operating cost summaries, net present cost comparisons across scenarios, and quantified air quality impacts. Results are structured to reflect multiple planning scenarios, including heuristic electrification plans, system-optimized configurations, and sensitivity cases with alternative objective weightings. The modeling was developed using publicly available General Transit Feed Specification data from Omnitrans and standardized modeling assumptions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Dataset for Blueprinting Electrified Transit System Implementation

This dataset contains the figures and tabulated results generated from a system-level optimization study of transit fleet electrification planning. The dataset does not include executable modeling code required to reproduce the optimization. The dataset includes results for optimized charging infrastructure deployment by location and power level and service block assignments by fuel type, battery capacity selections, and distributed energy resource sizing. It also contains aggregated financial results, capital expenditures, operating cost summaries, net present cost comparisons across scenarios, and quantified air quality impacts. Results are structured to reflect multiple planning scenarios, including heuristic electrification plans, system-optimized configurations, and sensitivity cases with alternative objective weightings. The modeling was developed using publicly available General Transit Feed Specification data from Omnitrans and standardized modeling assumptions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Artificial intelligence for materials research at extremes

Abstract Materials development is slow and expensive, taking decades from inception to fielding. For materials research at extremes, the situation is even more demanding, as the desired property combinations such as strength and oxidation resistance can have complex interactions. Here, we explore the role of AI and autonomous experimentation (AE) in the process of understanding and developing materials for extreme and coupled environments. AI is important in understanding materials under extremes due to the highly demanding and unique cases these environments represent. Materials are pushed to their limits in ways that, for example, equilibrium phase diagrams cannot describe. Often, multiple physical phenomena compete to determine the material response. Further, validation is often difficult or impossible. AI can help bridge these gaps, providing heuristic but valuable links between materials properties and performance under extreme conditions. We explore the potential advantages of AE along with decision strategies. In particular, we consider the problem of deciding between low-fidelity, inexpensive experiments and high-fidelity, expensive experiments. The cost of experiments is described in terms of the speed and throughput of automated experiments, contrasted with the human resources needed to execute manual experiments. We also consider the cost and benefits of modeling and simulation to further materials understanding, along with characterization of materials under extreme environments in the AE loop. Graphical abstract AI sequential decision-making methods for materials research: Active learning, which focuses on exploration by sampling uncertain regions, Bayesian and bandit optimization as well as reinforcement learning (RL), which trades off exploration of uncertain regions with exploitation of optimum function value. Bayesian and bandit optimization focus on finding the optimal value of the function at each step or cumulatively over the entire steps, respectively, whereas RL considers cumulative value of the labeling function, where the latter can change depending on the state of the system (blue, orange, or green).

36 MATERIALS SCIENCE↗

A Stochastic Covariance Shrinkage Approach in Ensemble Transform Kalman Filtering

The Ensemble Kalman Filters (EnKF) employ a Monte-Carlo approach to represent covariance information, and are affected by sampling errors in operational settings where the number of model realizations is much smaller than the model state dimension. To alleviate the effects of these errors EnKF relies on model-specific heuristics such as covariance localization, which takes advantage of the spatial locality of correlations among the model variables. This work proposes an approach to alleviate sampling errors that utilizes a locally averaged-in-time dynamics of the model, described in terms of a climatological covariance of the dynamical system. We use this covariance as the target matrix in covariance shrinkage methods, and develop a stochastic covariance shrinkage approach where synthetic ensemble members are drawn to enrich both the ensemble subspace and the ensemble transformation. We additionally provide for a way in which this methodology can be localized similar to the state-of-the-art LETKF method, and that for a certain model setup, our methodology significantly outperforms it.

54 ENVIRONMENTAL SCIENCES↗

Joint optimal scheduling for electric vehicle battery swapping-charging system based on wind farms

Insufficiencies in charging facilities limit the broad application of electric vehicles (EVs). In addition, EV can hardly represent a green option if its electricity primarily depends on fossil energy. Considering these two problems, this paper studies a battery swapping-charging system based on wind farms (hereinafter referred to as W-BSCS). In a W-BSCS, the wind farms not only supply electricity to the power grid but also cooperate with a centralized charge station (CCS), which can centrally charge EV batteries and then distribute them to multiple battery swapping stations (BSSs). The operational framework of the W-BSCS is analyzed, and some preprocessing technologies are developed to reduce complexity in modeling. Then, a joint optimal scheduling model involving a wind power generation plan, battery swapping demand, battery charging and discharging, and a vehicle routing problem (VRP) is established. Then a heuristic method based on the exhaustive search and the Genetic Algorithm is employed to solve the formulated NP-hard problem. Numerical results verify the effectiveness of the joint optimal scheduling model, and they also show that the W-BSCS has great potential to promote EVs and wind power.

17 WIND ENERGY↗

Opiate Sensitivity in Fruit Flies

Substance use disorder is a debilitating clinical condition in which behavioral dependence results from biological, environmental, genetic, and psychosocial factors. An epidemic surrounding the use and abuse of opioids is ravaging the world. While considerable efforts have explored the social drivers of addiction, a deeper understanding of biological causes and genetic vulnerabilities, preventative interventions, and effective treatments, have all proven elusive. This perspective article aims to remind readers that addictive natural compounds such as cocaine, nicotine, cathinone, or morphine, evolved as defensive metabolites to deter insect herbivory. The molecular mechanisms underlying motivational seeking and learning/reward show remarkable conservation since their early emergence in bilateral metazoans. An extended coevolutionary arms race subsequently weaponized these compounds into disruptors of learning, motivation, and incentivized attention. When plant chemical defenses attack insect physiology, humans are rendered susceptible due to strong conservation in the underlying molecular machinery. This perspective addresses the paradox that opiates were shaped to target insect neuropharmacology, even though this taxon appears to lack the recognized opioid receptor clade of mammals. We argue that the link is to be found in the allatostatin receptor, a basal ortholog of opioid receptors. Moreover, preliminary evidence indicates that morphine reduces Drosophila feeding and locomotion, concordant with a purported role as a defensive compound reducing herbivory. An implementation via allatostatin-mediated mechanisms is likely. This research argues for a broader heuristic perspective of substance abuse and a recognition of the evolutionary constraints that have likely shaped the biological drivers of opioid sensitivity and of its behavioral targets.

59 BASIC BIOLOGICAL SCIENCES↗

URC Assessment Method

This tool evaluates the potential occurrence of URC resources using a series of validated heuristics as outlined in "Creason, C.G., Justman, D., Rose, K. et al. A Geo-Data Science Method for Assessing Unconventional Rare-Earth Element Resources in Sedimentary Systems. Nat Resour Res (2023). https://doi.org/10.1007/s11053-023-10163-x"

Critical Minerals↗

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗

Discovery of Innovative Polymers for Next-Generation Gas-Separation Membranes using Interpretable Machine Learning

Polymer membranes perform innumerable separations with far-reaching environmental implications. Despite decades of research on membrane technologies, design of new membrane materials remains a largely Edisonian process. To address this shortcoming, we demonstrate a generalizable, accurate machine-learning (ML) implementation for the discovery of innovative polymers with ideal separation performance. Specifically, multitask ML models are trained on available experimental data to link polymer chemistry to gas permeabilities of He, H2, O2, N2, CO2, and CH4. Here, we interpret the ML models and extract chemical heuristics for membrane design, through Shapley Additive exPlanations (SHAP) analysis. We then screen over nine million hypothetical polymers through our models and identify thousands of candidates that lie well above current performance upper bounds. Notably, we discover hundreds of never-before-seen ultrapermeable polymer membranes with O2 and CO2 permeability greater than 104 and 105 Barrer, respectively. These hypothetical polymers are capable of overcoming undesirable trade-off relationship between permeability and selectivity, thus significantly expanding the currently limited library of polymer membranes for highly efficient gas separations. High-fidelity molecular dynamics simulations confirm the ML-predicted gas permeabilities of the promising candidates, which suggests that many can be translated to reality.

Yang, Jason↗

Three-dimensional multiphase segmentation of X-ray CT data of porous materials using a Bayesian Markov random field framework

Advancements in noninvasive imaging methods such as X-ray computed tomography (CT) have led to a recent surge of applications in porous media research with objectives ranging from theoretical aspects of pore-scale fluid and interfacial dynamics to practical applications such as enhanced oil recovery and advanced contaminant remediation. While substantial efforts and resources have been devoted to advance CT technology, microscale analysis, and fluid dynamics simulations, the development of efficient and stable three-dimensional multiphase image segmentation methods applicable to large data sets is lacking. To eliminate the need for wet-dry or dual-energy scans, image alignment, and subtraction analysis, commonly applied in X-ray micro-CT, a segmentation method based on a Bayesian Markov random field (MRF) framework amenable to true three-dimensional multiphase processing was developed and evaluated. Furthermore, several heuristic and deterministic combinatorial optimization schemes required to solve the labeling problem of the MRF image model were implemented and tested for computational efficiency and their impact on segmentation results. Test results for three grayscale data sets consisting of dry glass beads, partially saturated glass beads, and partially saturated crushed tuff obtained with synchrotron X-ray micro-CT demonstrate great potential of the MRF image model for three-dimensional multiphase segmentation. While our results are promising and the developed algorithm is stable and computationally more efficient than other commonly applied porous media segmentation models, further potential improvements exist for fully automated operation.

42 ENGINEERING↗