Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “combinatorial”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

Technological and Medical Human Health and Well-Being Options in Deep Space

Zeroth order, maintenance of human health requires supportive protection from the hazards of space, including supplying breathable air, comfortable temperatures, a supportive diet/nutrition, radiation protection, and sufficient gravity to avoid the combinatorial impacts of such effecting human operability and health. Spacecraft operability must be “fail-safe” to ensure these basic human life support conditions are maintained throughout the mission and the mission(s) must be affordable. There are known effects and unknowns effects regarding aspects of human health for Mars duration missions. Mars has the order of a third g. We have no data regarding the health impacts of this on humans or the combinatorial effects associated with 45% GCR on the Martian surface over time. There is a suspicion that if humans survive such conditions over long times they will evolve to living at reduced g and become “Martians”. Cascading failures and subcritical degradations in systems of systems causing an overall unrecoverable failure are a potential issue. There are two exremely complex systems associated with humans-Mars missions: the technical, engineering, and architectural system of systems that enable the mission and the humans. Both need to be mutually configured and operated to mitigate the overall risks and hazards of the mission. Regarding the humans that mitigation includes both the mission risks and supporting-to-increasing the human immune and other concomitant physiological systems. This report will summarize the risks, current mitigation approaches, and putative approaches including lifestyle, nutrition, and “wellness” approaches to possibly improve the human capacity to withstand the large number of combinatorial human physiological rigors of the missions. The wellness observations also apply to and are derived from Earth terrestrial applicable research.

Dennis M Bushnell↗
DOE OSTI2021

Neutralizing Antibodies to SARS-CoV-2 Selected from a Human Antibody Library Constructed Decades Ago

Combinatorial antibody libraries not only effectively reduce antibody discovery to a numbers game, but enable documentation of the history of antibody responses in an individual. The severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) pandemic has prompted a wider application of this technology to meet the public health challenge of pandemic threats in the modern era. Herein, a combinatorial human antibody library constructed 20 years before the coronavirus disease 2019 (COVID-19) pandemic is used to discover three highly potent antibodies that selectively bind SARS-CoV-2 spike protein and neutralize authentic SARS-CoV-2 virus. Compared to neutralizing antibodies from COVID-19 patients with generally low somatic hypermutation (SHM), these three antibodies contain over 13–22 SHMs, many of which are involved in specific interactions in their crystal structures with SARS-CoV-2 spike receptor binding domain. The identification of these somatically mutated antibodies in a pre-pandemic library raises intriguing questions about the origin and evolution of these antibodies with respect to their reactivity with SARS-CoV-2.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Tropical amplitudes for colored Lagrangians

Recently a new formulation for scattering amplitudes in Tr(Φ 3 ) theory has been given based on simple combinatorial ideas in the space of kinematic data. This allows all-loop integrated amplitudes to be expressed as “curve integrals” defined using tropical building blocks — the “headlight functions”. This paper shows how the formulation extends to the amplitudes of more general Lagrangians. We will present a number of different ways of introducing tropical “numerator functions” that allow us to describe general Lagrangian interactions. The simplest family of these “tropical numerators” computes the amplitudes of interesting Lagrangians with infinitely many interactions. We also describe methods for tropically formulating the amplitudes for general Lagrangians. One uses a variant of “Wick contraction” to glue together numerator factors for general interaction vertices. Another uses a natural characterization of polygons on surfaces to give a novel combinatorial description of all possible diagrams associated with arbitrary valence interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Toward computing bounds for Ramsey numbers using quantum annealing

Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems, such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum annealing as a tool for use in exploring combinatorial mathematics research problems. We consider the monochromatic triangle problem and the Ramsey number problem, both examples of graph coloring. Conversion to quadratic unconstrained binary optimization (QUBO) form is required to run on quantum hardware. While the monochromatic triangle problem is quadratic by nature, the Ramsey number problem requires the use of order reduction methods for a quadratic formulation. The goal is to provide a method for producing special colorings of graphs which if successful would provide lower bounds for certain Ramsey numbers. We discuss implementations, limitations, and results when running on the D-Wave Advantage quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Charged particle tracking with quantum annealing optimization

Abstract At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for physics analysis will need to be upgraded to scale with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework for HL-LHC conditions. We develop additional techniques to embed the problem onto existing and near-term quantum annealing hardware. Results using simulated annealing and quantum annealing with the D-Wave 2X system on the TrackML open dataset are presented, demonstrating the successful application of a quantum annealing algorithm to the track reconstruction challenge. We find that combinatorial optimization problems can effectively reconstruct tracks, suggesting possible applications for fast hardware-specific implementations at the HL-LHC while leaving open the possibility of a quantum speedup for tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Algebraic Structures in the Coupling of Gravity to Gauge Theories

Highlights: • Geometric foundation for Quantum General Relativity coupled to Quantum Electrodynamics. • Rigorous introduction to Hopf algebraic renormalization. • Appropriate modifications in case renormalization Hopf algebra is ill-defined. • Generalization of Furry’s Theorem to include gravitons and ghosts. • Discussion of obstructions to multiplicative renormalization. This article is an extension of the author’s second master thesis, Prinz (2017). It aims to introduce to the theory of perturbatively quantized General Relativity coupled to Spinor Electrodynamics, provide the results thereof and set the notation to serve as a starting point for further research in this direction. It includes the differential geometric and Hopf algebraic background, as well as the corresponding Lagrange density and some renormalization theory. Then, a particular problem in the renormalization of Quantum General Relativity coupled to Quantum Electrodynamics is addressed and solved by a generalization of Furry’s Theorem. Next, the restricted combinatorial Green’s functions for all two-loop propagators and all one-loop divergent subgraphs thereof are presented. Finally, relations between these one-loop restricted combinatorial Green’s functions necessary for multiplicative renormalization are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multiobjective Optimal Controlled Variable Selection for a Gas Turbine–Solid Oxide Fuel Cell System Using a Multiagent Optimization Platform

Hybrid gas turbine–fuel cell systems have immense potential for high efficiency in electrical power generation with cleaner emissions compared with fossil-fueled power generation. We report a systematic controlled variable (CV) selection method is deployed for a hybrid gas turbine–fuel cell system in the HyPer (hybrid performance) facility at the U.S. Department of Energy’s National Energy Technology Laboratory (NETL) for maximizing its economic and control performance. A three-stage approach is used for the CV selection comprising a priori analysis, multiobjective optimization, and a posteriori analysis. The a priori analysis helps to screen off several candidate CVs, thus reducing the size of the combinatorial optimization problem for multiobjective CV selection. For optimal CV selection, a transfer function model of the HyPer facility is identified. By considering several candidate models, the final transfer function model is selected using Akaike’s Final Prediction Error criterion. Experimental data from the HyPer facility are used to estimate the noise in the measurement data. For solving the combinatorial multiobjective optimization problem for CV selection, a multiagent optimization platform comprising simulated annealing, genetic algorithm, and efficient ant colony optimization algorithms is used. Pareto-optimal CV sets exhibit a high trade-off between the economic and control objective. The a posteriori analysis is undertaken for several top Pareto-optimal CV sets. An optimal CV set is selected that shows the best compromise between process economics and controllability under both nominal and off-design conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗
DOE OSTI2023

Scalable generalized screening for high-order terms in the many-body expansion: Algorithm, open-source implementation, and demonstration

The many-body expansion lies at the heart of numerous fragment-based methods that are intended to sidestep the nonlinear scaling of ab initio quantum chemistry, making electronic structure calculations feasible in large systems. In principle, inclusion of higher-order n-body terms ought to improve the accuracy in a controllable way, but unfavorable combinatorics often defeats this in practice and applications with n ≥ 4 are rare. Here, we outline an algorithm to overcome this combinatorial bottleneck, based on a bottom-up approach to energy-based screening. This is implemented within a new open-source software application (“Fragme∩t”), which is integrated with a lightweight semi-empirical method that is used to cull subsystems, attenuating the combinatorial growth of higher-order terms in the graph that is used to manage the calculations. This facilitates applications of unprecedented size, and we report four-body calculations in (H2O)64 clusters that afford relative energies within 0.1 kcal/mol/monomer of the supersystem result using less than 10% of the unique subsystems. We also report n-body calculations in (H2O)20 clusters up to n = 8, at which point the expansion terminates naturally due to screening. These are the largest n-body calculations reported to date using ab initio electronic structure theory, and they confirm that high-order n-body terms are mostly artifacts of basis-set superposition error.

Chemistry↗
DOE OSTI2023

Pumping Iron: A Multi-omics Analysis of Two Extremophilic Algae Reveals Iron Economy Management

Marine algae are responsible for half of the world's primary productivity, but this critical carbonsink is often constrained by insufficient iron. One species of marine algae, Dunaliella tertiolecta, isremarkable for its ability to maintain photosynthesis and thrive in low-iron environments. A relatedspecies, Dunaliella salina Bardawil, shares this attribute but is an extremophile found in hypersaline environments. To elucidate how algae manage their iron requirements, we produced highquality genome assemblies and transcriptomes for both species to serve as a foundation for acomparative multi-omics analysis. We identified a host of iron-uptake proteins in both species,including a massive expansion of transferrins and a novel family of siderophore-iron uptakeproteins. Complementing these multiple iron-uptake routes, ferredoxin functions as a large ironreservoir that can be released by induction of flavodoxin. Proteomic analysis revealed reducedinvestment in the photosynthetic apparatus coupled with remodeling of antenna proteins bydramatic iron-deficiency induction of TIDI1, a light harvesting complex protein found also in otherchlorophytes. These combinatorial iron scavenging and sparing strategies make Dunaliellaunique among photosynthetic organisms

iron homeostasis, phytoplankton, Iron starvation i↗
DOE OSTI2025

Structural stability, elemental ordering, and transport properties of layered ScTaN 2

Ternary transition metal (TM) nitrides have gained significant attention in thin film research due to their promising properties for a broad range of applications. Particularly, some of the ternary TM nitrides have been predicted to adopt layered structures that make them interesting for thermoelectric conversion and quantum materials applications. Unfortunately, synthesis of TM ternary nitride films by physical vapor deposition often favors disordered 3D structures rather than the predicted 2D-like layered structure. In this study, we investigate the structural interplay in the Sc-Ta-N ternary system using a combinatorial approach. Combinatorial libraries S⁢c 𝑥 ⁢T⁢a 1−𝑥 ⁢N are synthesized following a two-step method: First, deposit film precursors by cosputtering and then process the resulting 3D-structured samples with rapid thermal annealing. Synchrotron grazing-incidence wide-angle x-ray scattering on films annealed at 1200 ⁢°⁢C for 20 min leads to the nucleation of ScTaN 2 layered structure (𝑃⁢6 3 /𝑚⁢𝑚⁢𝑐) near stoichiometry. We find that the layered structure can accommodate large off-stoichiometry in the Ta-rich region (𝑥 < 0.5), facilitated by the alloying with quasi-isostructural Ta 5 ⁢N 6 compound that exists on a composition tie line at 𝑥 = 0. While focusing on ScTaN 2 , we estimate the long-range order parameter in near-stoichiometric films to be 0.86, corresponding to a fraction of Sc/Ta antisites of 7%. Transport measurements on ScTaN 2 reveal a nearly temperature-independent high carrier density (10 21 c⁢m −3 ), suggesting a heavily doped semiconductor or semimetallic character, consistent with a small positive Seebeck coefficient of +19 µV/K. The carrier mobility at 2 K is relatively small (9.5c⁢m 2 V −1 s −1 ) and the residual-resistivity ratio is minor, suggesting that electrical conduction is dominated by defects or disorder. Measured magnetoresistance suggests possible weak antilocalization at 2 K. This paper highlights the interplay between ScTaN 2 and Ta 5 ⁢N 6 crystal structures in stabilizing layered materials, emphasizes the importance of cation order/disorder for potential tunable alloys, and suggests that ScTaN 2 is a promising platform for exploring electronic properties.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Experimental realization of classical Z 2 spin liquids in a programmable quantum device

We build and probe a Z 2 spin liquid in a programmable quantum device, the D-Wave DW-2000Q. Specifically, we observe the classical eight-vertex and six-vertex (spin ice) states and transitions between them. To realize this state of matter, we design a Hamiltonian with combinatorial gauge symmetry using only pairwise-qubit interactions and a transverse field, i.e., interactions which are accessible in this quantum device. The combinatorial gauge symmetry remains exact along the full quantum annealing path, landing the system onto the classical eight-vertex model at the endpoint of the path. The output configurations from the device allow us to directly observe the loop structure of the classical model. Moreover, we deform the Hamiltonian so as to vary the weights of the eight vertices and show that we can selectively attain the classical six-vertex (ice) model, or drive the system into a ferromagnetic state. Additionally, we present studies of the classical phase diagram of the system as a function of the eight-vertex deformations and effective temperature, which we control by varying the relative strengths of the programmable couplings, and we show that the experimental results are consistent with theoretical analysis. Finally, we identify additional capabilities that, if added to these devices, would allow us to realize Z 2 quantum spin liquids on which to build topological qubits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Magnetism in metastable and annealed compositionally complex alloys

Compositionally complex materials (CCMs) present a potential paradigm shift in the design of magnetic materials. These alloys exhibit long-range structural order coupled with limited or no chemical order. As a result, extreme local environments exist with a large variations in the magnetic energy terms, which can manifest large changes in the magnetic behavior. In the current work, the magnetic properties of (Cr, Mn, Fe, Ni) alloys are presented. These materials were prepared by room-temperature combinatorial sputtering, resulting in a range of compositions with a single bcc structural phase and no chemical ordering. The combinatorial growth technique allows CCMs to be prepared outside of their thermodynamically stable phase, enabling the exploration of otherwise inaccessible order. The mixed ferromagnetic and antiferromagnetic interactions in these alloys causes frustrated magnetic behavior, which results in an extremely low coercivity (<1mT), which increases rapidly at 50 K. At low temperatures, the coercivity achieves values of nearly 500 mT, which is comparable to some high-anisotropy magnetic materials. Further, commensurate with the divergent coercivity is an atypical drop in the temperature dependent magnetization. These effects are explained by a mixed magnetic phase model, consisting of ferro-, antiferro-, and frustrated magnetic regions, and are rationalized by simulations. A machine-learning algorithm is employed to visualize the parameter space and inform the development of subsequent compositions. Annealing the samples at 600 °C orders the sample, more-than doubling the Curie temperature and increasing the saturation magnetization by as much as 5×. Simultaneously, the large coercivities are suppressed, resulting in magnetic behavior that is largely temperature independent over a range of 350 K. The ability to transform from a hard magnet to a soft magnet over a narrow temperature range makes these materials promising for heat-assisted recording technologies.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Learning Molecular Mixture Property Using Chemistry-Aware Graph Neural Network

Recent advances in machine learning (ML) are expediting materials discovery and design. One significant challenge facing ML for materials is the expansive combinatorial space of potential materials formed by diverse constituents and their flexible configurations. This complexity is particularly evident in molecular mixtures, a frequently explored space for materials, such as battery electrolytes. Owing to the complex structures of molecules and the sequence-independent nature of mixtures, conventional ML methods have difficulties in modeling such systems. Here, we present MolSets, a specialized ML model for molecular mixtures, to overcome the difficulties. Representing individual molecules as graphs and their mixture as a set, MolSets leverages a graph neural network and the deep sets architecture to extract information at the molecular level and aggregate it at the mixture level, thus addressing local complexity while retaining global flexibility. We demonstrate the efficacy of MolSets in predicting the conductivity of lithium battery electrolytes and highlight its benefits in the virtual screening of the combinatorial chemical space. Published by the American Physical Society 2024

Zhang, Hengrui (ORCID:0000000231831654)↗