Search NASASearch

SEARCH · Search NASA

Results for “combinatorial optimization”

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.

143 records · Page 8

The Evolution of Software and Its Impact on Complex System Design in Robotic Spacecraft Embedded Systems

The growth in computer hardware performance, coupled with reduced energy requirements, has led to a rapid expansion of the resources available to software systems, driving them towards greater logical abstraction, flexibility, and complexity. This shift in focus from compacting functionality into a limited field towards developing layered, multi-state architectures in a grand field has both driven and been driven by the history of embedded processor design in the robotic spacecraft industry.The combinatorial growth of interprocess conditions is accompanied by benefits (concurrent development, situational autonomy, and evolution of goals) and drawbacks (late integration, non-deterministic interactions, and multifaceted anomalies) in achieving mission success, as illustrated by the case of the Mars Reconnaissance Orbiter. Approaches to optimizing the benefits while mitigating the drawbacks have taken the form of the formalization of requirements, modular design practices, extensive system simulation, and spacecraft data trend analysis. The growth of hardware capability and software complexity can be expected to continue, with future directions including stackable commodity subsystems, computer-generated algorithms, runtime reconfigurable processors, and greater autonomy.

software

Complexity Science Applications to Dynamic Trajectory Management: Research Strategies

The promise of the Next Generation Air Transportation System (NextGen) is strongly tied to the concept of trajectory-based operations in the national airspace system. Existing efforts to develop trajectory management concepts are largely focused on individual trajectories, optimized independently, then de-conflicted among each other, and individually re-optimized, as possible. The benefits in capacity, fuel, and time are valuable, though perhaps could be greater through alternative strategies. The concept of agent-based trajectories offers a strategy for automation of simultaneous multiple trajectory management. The anticipated result of the strategy would be dynamic management of multiple trajectories with interacting and interdependent outcomes that satisfy multiple, conflicting constraints. These constraints would include the business case for operators, the capacity case for the Air Navigation Service Provider (ANSP), and the environmental case for noise and emissions. The benefits in capacity, fuel, and time might be improved over those possible under individual trajectory management approaches. The proposed approach relies on computational agent-based modeling (ABM), combinatorial mathematics, as well as application of "traffic physics" concepts to the challenge, and modeling and simulation capabilities. The proposed strategy could support transforming air traffic control from managing individual aircraft behaviors to managing systemic behavior of air traffic in the NAS. A system built on the approach could provide the ability to know when regions of airspace approach being "full," that is, having non-viable local solution space for optimizing trajectories in advance.

Sawhill, Bruce

Biosensor-driven strain engineering reveals key cellular processes for maximizing isoprenol production in Pseudomonas putida

Synthetic biology generates vast combinatorial designs, yet high-throughput analytical methods to screen them are poorly matched to interrogate this search space. We address this challenge by developing a biosensor-driven, growth-coupled selection strategy in Pseudomonas putida for isoprenol, a potential aviation fuel precursor. We found and characterized a noncanonical signaling pathway, revealing a functional and physical complex between a hybrid histidine kinase and an alcohol dehydrogenase, whose activity is tuned by heterodimerization. Leveraging this biosensor in a pooled CRISPRi library selection, we identified key host limitations. Iterative combinatorial strain engineering derived from these hits yielded a 36-fold titer increase to ~900 milligrams per liter. Integrated omics analysis revealed that metabolic rewiring toward amino acid catabolism was crucial for this improvement. This observation was found to be beneficial by technoeconomic analysis. Our modular workflow provides a powerful strategy for optimizing complex heterologous pathways and uncovering emergent host biology.

CRISPRi

On k-ary n-cubes: Theory and applications

Many parallel processing networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and toruses. In this paper, combinatorial properties of k-ary n-cubes are explored. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These theoretical results are then used to compute a lower bounding function in branch-and-bound partitioning algorithms and to establish the optimality of some irregular partitions.

Mao, Weizhen

Systems-Level Modeling for CRISPR-Based Metabolic Engineering

The CRISPR-Cas system has enabled the development of sophisticated, multigene metabolic engineering programs through the use of guide RNA-directed activation or repression of target genes. To optimize biosynthetic pathways in microbial systems, we need improved models to inform design and implementation of transcriptional programs. Recent progress has resulted in new modeling approaches for identifying gene targets and predicting the efficacy of guide RNA targeting. Genome-scale and flux balance models have successfully been applied to identify targets for improving biosynthetic production yields using combinatorial CRISPR-interference (CRISPRi) programs. Here, the advent of new approaches for tunable and dynamic CRISPR activation (CRISPRa) promises to further advance these engineering capabilities. Once appropriate targets are identified, guide RNA prediction models can lead to increased efficacy in gene targeting. Developing improved models and incorporating approaches from machine learning may be able to overcome current limitations and greatly expand the capabilities of CRISPR-Cas9 tools for metabolic engineering.

59 BASIC BIOLOGICAL SCIENCES

Improved Statistics for F-theory Standard Models

Much of the analysis of F-theory-based Standard Models boils down to computing cohomologies of line bundles on matter curves. By varying parameters one can degenerate such matter curves to singular ones, typically with many nodes, where the computation is combinatorial and straightforward. The question remains to relate the (a priori possibly smaller) value on the original curve to the singular one. In this work, we introduce some elementary techniques (pruning trees and removing interior edges) for simplifying the resulting nodal curves to a small collection of terminal ones that can be handled directly. When applied to the QSMs, these techniques yield optimal results in the sense that obtaining more precise answers would require currently unavailable information about the QSM geometries. This provides us with an opportunity to enhance the statistical bounds established in earlier research regarding the absence of vector-like exotics on the quark-doublet curve.

Bies, Martin

Self-Driving Microscopy for AI/ML-Enabled Physics Discovery and Materials Optimization

Materials are the bedrock of economy and foundation for all real-world technologies. The viability of space travel, grid energy storage, solar to fuels conversion, methane removal, and photovoltaic energy solutions hinge on the discovery and optimization of novel materials and rapid scaling toward manufacturing. The last 20 years have seen an exponential growth in the theoretical predictive capability for crystalline materials and small molecules. However, it is only in the last five years that we have seen the rapid expansion of high-throughput synthesis enabled by laboratory robotics and microfluidics, as well as a resurgence of combinatorial synthesis (Abolhasani and Kumacheva 2023; Epps and Abolhasani 2021; Jiang et al. 2022; Rajan 2008; Soldatov et al. 2021; Szymanski et al. 2023). Combinatorial synthesis, microfluidics, and ultimately dip-pen megalibraries have demonstrated the ability to “write” multicomponent nanomaterials at high throughput scale, generating millions of material examples in the 3D, 4D, and 5D composition spaces (Chen et al. 2016, 2019; Jibril et al. 2022).

36 MATERIALS SCIENCE

Modeling Strong Light-Matter Coupling in Correlated Systems: State-Averaged Cavity Quantum Electrodynamics Complete Active Space Self-Consistent Field Theory

The description of strongly correlated systems interacting with quantized cavity modes poses significant theoretical challenges due to the combinatorial scaling of electronic and photonic degrees of freedom. Recent advances addressing this complexity include cavity quantum electrodynamics (QED) generalizations of complete active space configuration interaction and density matrix renormalization group methods. In this work, we introduce a QED extension of state-averaged complete active space self-consistent field theory, which incorporates cavity-induced correlations through a second-order orbital optimization framework with robust convergence properties. The method is implemented using both photon number state and coherent state representations, with the latter showing robust origin invariance in the energies regardless of the completeness of the photonic Fock space. The implementation enables symmetry-free orbital relaxations to account for photon-mediated symmetry breaking in polaritonic systems. Numerical validation on lithium hydride, hydroxide anion, and magnesium hydride cation demonstrates that this method achieves significantly improved accuracy in modeling ground-state and polariton potential energy surfaces compared to QED-CASCI in a fixed orbital basis. In these studies, we reach sub-kcal/mol accuracy in potential energy surface in much smaller active spaces than are required for QED-CASCI. This advancement provides a more robust approach for studying cavity-altered chemical landscapes for ground and exited strongly coupled systems.

CASSCF

Flame Spray Strain Gages with Improved Durability and Lifetimes

The focus of this APP research program was to improve the bond coats used in the fabrication of flame sprayed instrumentation. Typically. a bond coat is applied to a superalloy surface prior to the application of a thin dielectric coating onto which instrumentation is placed. After affixing the instrumentation, a much thicker ceramic topcoat is typically applied to protect the instrumentation from harsh environments. The fatigue life of NiCoCrAlY coated superalloys was extended beyond current state-of-the-art by relatively simple and cost effective means. Heat treatment in reduced oxygen partial pressures at 1750 to 1800 F effectively doubled the fatigue life of NiCoCrAlY coated substrates relative to as-sprayed substrates and when used in conjunction with platinum diffusion barriers yielded a four fold increase in the fatigue life of NiCoCrAlY coated substrates. Further improvements in the fatigue life of thermally sprayed coatings were made by employing intermediate coatings, which minimized thermal expansion differences between the bond coat and top coat. Combinatorial chemistry experiments yielded an optimum composition for an intermediate TCE matching coating that showed considerable promise in extending the fatigue life of thermal spray instrumentation. The intermediate coating had two functions: to reduce the surface roughness of the peaks and valleys associated with the as-sprayed NiCoCrAlY bond coat, and to produce a thin layer of a mixture of Al2O3 and NiCoCrAlY that exhibited an intermediate TCE. The optimal composition of the intermediate coating consisted of 60 wt% Al2O3 and 40 wt% NiCoCrAlY, as determined by energy dispersive analysis of x-rays (EDS). Intermediate coatings having this composition were prepared by physical vapor deposition and the resulting coating systems are being evaluated in our test facility.

Fralick, Gustave

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.

Straguzzi, Nicholas

Machine Learning-Enabled Image Classification for Automated Electron Microscopy

Abstract Traditionally, materials discovery has been driven more by evidence and intuition than by systematic design. However, the advent of “big data” and an exponential increase in computational power have reshaped the landscape. Today, we use simulations, artificial intelligence (AI), and machine learning (ML) to predict materials characteristics, which dramatically accelerates the discovery of novel materials. For instance, combinatorial megalibraries, where millions of distinct nanoparticles are created on a single chip, have spurred the need for automated characterization tools. This paper presents an ML model specifically developed to perform real-time binary classification of grayscale high-angle annular dark-field images of nanoparticles sourced from these megalibraries. Given the high costs associated with downstream processing errors, a primary requirement for our model was to minimize false positives while maintaining efficacy on unseen images. We elaborate on the computational challenges and our solutions, including managing memory constraints, optimizing training time, and utilizing Neural Architecture Search tools. The final model outperformed our expectations, achieving over 95% precision and a weighted F-score of more than 90% on our test data set. This paper discusses the development, challenges, and successful outcomes of this significant advancement in the application of AI and ML to materials discovery.

Materials Science

Reducing model error using optimized galaxy selection: weak lensing cluster mass estimation

Galaxy clusters are one of the most powerful probes to study extensions of General Relativity and the Standard Cosmological Model. Upcoming surveys like the Vera Rubin Observatory’s Legacy Survey of Space and Time are expected to revolutionise the field, by enabling the analysis of cluster samples of unprecedented size and quality. To reach this era of high-precision cluster cosmology, the mitigation of sources of systematic error is crucial. A particularly important challenge is bias in cluster mass measurements induced by the mismodelling of photometric redshift estimates of source galaxies. This work proposes a method to optimise the source sample selection in cluster weak lensing analyses drawn from wide-field survey lensing catalogs to reduce the bias on reconstructed cluster masses. We use a combinatorial optimisation scheme and methods from variational inference to select galaxies in latent space to produce a probabilistic galaxy source sample catalog for highly accurate cluster mass estimation. We show that our method reduces the critical surface mass density Σ crit relative modelling bias on the 60-70% level, while maintaining up to 90% of galaxies. We highlight that our methodology has applications beyond cluster mass estimation as an approach to jointly combine galaxy selection and model inference under sources of systematics.

79 ASTRONOMY AND ASTROPHYSICS

Enhancing Electron Microscopy Image Classification Using Data Augmentation

Manual labeling for machine learning tasks such as image classification is tedious and labor-intensive; as a result, scientific datasets suitable for deep learning applications are scarce and limited. While data augmentation techniques have shown promise for extending image datasets, very little work has been done to understand the impact of combining multiple augmentation methods sequentially or the limits of their effectiveness when combined. Our work addresses this gap by examining how standard and combinatorial data augmentation affects the performance of machine learning models when trained on small datasets for label classification tasks. For our analysis, we generate single, double and quadruple-augmented datasets for a microscopy image classification task using six standard augmentation methods, and compare the resultant improvements observed in binary classification accuracy with three standard image classification models (DenseNet169, MobileNetV2, ResNet101V2). Our experiments show a non-monotonic relationship between the number of simultaneous augmentation methods and classification accuracy, indicating that there is a trade-off between the degree of augmentation and the model performance. These findings suggest that the optimal number of augmentation methods will vary by domain and use case. We also find that the order in which augmentation methods are applied to a limited dataset matters when combining augmentation schemes, with our use case showing performance differences up to 2.6% when the augmentation order is reversed for double-augmented datasets. Our work offers insights to the limits of data augmentation when working on image classification tasks with limited datasets.

Welsman, Jordan A

A Rapid Target-Search Technique for KBO Exploration Trajectories

A rapid, grid-based, target-search algorithm is presented to find candidate se-quences of small-body encounters for mission design. The algorithm is especially relevant for cases with large combinatorial spaces. In this paper, the al-gorithm is used to identify candidate flyby sequences of multiple Kuiper-Belt Ob-jects (KBOs). Before reaching the first KBO in the sequence, the trajectories in this paper first use gravity assists at one or more of the giant planets to pump-uptheir orbital energy—reducing launch C3. The target-search algorithm consists offour sequential steps: (1) parameter definition, (2) fine-tuned Lambert-based gridsearch of ballistic trajectories visiting one KBO, (3) rapid, ∆V-based proximitysearch for additional KBOs using the state transition matrices (STMs), and (4) tra-jectory optimization of the most promising KBO sequences using the EvolutionaryMission Trajectory Generator (EMTG). The paper also defines an empirical-basedprocess to characterize the maximum step size for the target arrival dates in theLambert grid search. Lastly, a candidate mission to two KBOs is presented. Theresults indicate that the ∆V computed from the STM propagations is not repre-sentative of the final ∆V computed in EMTG; however, it does serve as a useful‘reachability’ metric to identify nearby KBOs.

Miguel Benayas Penas

The Problem of Size in Robust Design

To facilitate the effective solution of multidisciplinary, multiobjective complex design problems, a departure from the traditional parametric design analysis and single objective optimization approaches is necessary in the preliminary stages of design. A necessary tradeoff becomes one of efficiency vs. accuracy as approximate models are sought to allow fast analysis and effective exploration of a preliminary design space. In this paper we apply a general robust design approach for efficient and comprehensive preliminary design to a large complex system: a high speed civil transport (HSCT) aircraft. Specifically, we investigate the HSCT wing configuration design, incorporating life cycle economic uncertainties to identify economically robust solutions. The approach is built on the foundation of statistical experimentation and modeling techniques and robust design principles, and is specialized through incorporation of the compromise Decision Support Problem for multiobjective design. For large problems however, as in the HSCT example, this robust design approach developed for efficient and comprehensive design breaks down with the problem of size - combinatorial explosion in experimentation and model building with number of variables -and both efficiency and accuracy are sacrificed. Our focus in this paper is on identifying and discussing the implications and open issues associated with the problem of size for the preliminary design of large complex systems.

Koch, Patrick N.

Runway Configuration Management with Offline Reinforcement Learning

Runway configuration management (RCM) is a challenging task, and it affects the efficiency of the National Airspace System (NAS) and airport surface operations significantly. Each airport, depending on the geometry, capacity, local climate patterns, etc. has multiple configurations for the runway usage for arriving and departing flights. Many factors such as the incoming/outgoing traffic load, wind direction and speed, convective weather, cloud ceiling and other environmental factors might affect the choice of a runway configuration at any point in time. However, other factors such as safety measures and regulations, noise abatement, capacity of each configuration, and preference of the air traffic controllers (ATCs) can also play a significant role in selecting the configuration. A sub-optimal selection of the runway configuration, or delay in making configuration changes might result in significant increase in taxi times for aircraft on the surface of the airport, fuel and energy use of the aircraft, and maintenance costs. It can also lead to safety concerns, such as an aircraft performing one or more go-arounds before being able to land. All these factors make RCM an extremely important and challenging decision-making process for the ATCs. The current state of practice sets the runway configuration by the ATCs based on relevant information available at the time including weather, traffic, noise abatement, safety bounds, etc. This makes the decision-making process subjective based on the accuracy of the available information and the bias in human decision making. Unfortunately, this approach yields poor results (e.g., significant delays) if the predicted outcomes are uncertain and their relative impact is not well understood. This is especially evident when the uncertainty increases the size of possible predicted outcomes (combinatorial explosion in possible scenarios) that cannot be handled by human reasoning. On the other hand, an automated approach based on machine intelligence can make use of historical data and search through all (or significant amount of) possible scenarios under uncertainty and make well-informed decisions.

Milad Memarzadeh

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING