Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of Problems”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Predictor-corrector models for lightweight massive machine-type communications in Industry 4.0

Future Industry 4.0 scenarios are characterized by seamless integration between computational and physical processes. To achieve this objective, dense platforms made of small sensing nodes and other resource constraint devices are ubiquitously deployed. All these devices have a limited number of computational resources, just enough to perform the simple operation they are in charge of. The remaining operations are delegated to powerful gateways that manage sensing nodes, but resources are never unlimited, and as more and more devices are deployed on Industry 4.0 platforms, gateways present more problems to handle massive machine-type communications. Although the problems are diverse, those related to security are especially critical. To enable sensing nodes to establish secure communications, several semiconductor companies are currently promoting a new generation of devices based on Physical Unclonable Functions, whose usage grows every year in many real industrial scenarios. Those hardware devices do not consume any computational resource but force the gateway to keep large key-value catalogues for each individual node. In this context, memory usage is not scalable and processing delays increase exponentially with each new node on the platform. In this paper, we address this challenge through predictor-corrector models, representing the key-value catalogues. Models are mathematically complex, but we argue that they consume less computational resources than current approaches. The lightweight models are based on complex functions managed as Laurent series, cubic spline interpolations, and Boolean functions also developed as series. Unknown parameters in these models are predicted, and eventually corrected to calculate the output value for each given key. The initial parameters are based on the Kane Yee formula. An experimental analysis and a performance evaluation are provided in the experimental section, showing that the proposed approach causes a significant reduction in the resource consumption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multitask Recommender Systems for Cancer Drug Response

The problem we are currently trying to address is that there are many types of cancer drugs and many types of cancers and there is not always experimental data for a specific cancer type and cancer drug interaction. While there is a large possible set of feasible drug and cancer combinations, testing each pair is not realistic due to the high monetary cost of cell-based assays. Thus, this leaves researchers with a difficult choice of what drugs they should test on specific cancer types. This issue is known as the cold-start problem. Our focus is on developing recommender systems capable of addressing the cold-start problem as it relates to interaction between cancer types and cancer drugs. One of the most effective ways to address the cold-start problem is through large data analysis, however due to the cost prohibitive nature of cancer research the largest available data set size is the Genomics of Drug Sensitivity in Cancer with 494,973 genomic associations. To achieve optimal model performance on the cold-start problem, it is advantageous to employ multitask algorithms that are capable of transferring information between cancer datasets. The aim of this report is to draw from adaptations and state of the art developments in both algorithms for recommender systems and multitask learning to model the interaction between cancer cell lines and cancer drugs. Cancer cell lines are defined by the US National Cancer Institute as "cancer cells that keep dividing and growing over time, under certain conditions in a laboratory". This paper will focus on evaluating the performance of Neural Collaborative Filtering and Gaussian Processes, as well as their multitask adaptations, on cancer datasets from CCLE, NCI60, GDSC and CTRP. These methods will be evaluated on model performance in regression prediction but also in interpretability.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

QBTNs - Quantum Boolean Tensor Networks

We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.

Alexandrov, Boian↗
DOE OSTI2023

Information loss, mixing and emergent type III 1 factors

A manifestation of the black hole information loss problem is that the two-point function of probe operators in a large Anti-de Sitter black hole decays in time, whereas, on the boundary CFT, it is expected to be an almost periodic function of time. We point out that the decay of the two-point function (clustering in time) holds important clues to the nature of observable algebras, states, and dynamics in quantum gravity. We call operators that cluster in time “mixing” and explore the necessary and sufficient conditions for mixing. The information loss problem is a special case of the statement that in type I algebras, there exists no mixing operators. We prove that, in a thermofield double state (KMS state), if mixing operators form an algebra (close under multiplication), the resulting algebra must be a von Neumann type III 1 factor. In other words, the physically intuitive requirement that all nonconserved operators should exponentially mix is so strong that it fixes the observable algebra to be an exotic algebra called a type III1 factor. More generally, for an arbitrary out-of-equilibrium state of a general quantum system (von Neumann algebra), we show that if the set of operators that mix under modular flow forms an algebra, it is a type III1 von Neumann factor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Machine learning on neutron and x-ray scattering and spectroscopies

Neutron and x-ray scattering represent two classes of state-of-the-art materials characterization techniques that measure materials structural and dynamical properties with high precision. These techniques play critical roles in understanding a wide variety of materials systems from catalysts to polymers, nanomaterials to macromolecules, and energy materials to quantum materials. In recent years, neutron and x-ray scattering have received a significant boost due to the development and increased application of machine learning to materials problems. This article reviews the recent progress in applying machine learning techniques to augment various neutron and x-ray techniques, including neutron scattering, x-ray absorption, x-ray scattering, and photoemission. We highlight the integration of machine learning methods into the typical workflow of scattering experiments, focusing on problems that challenge traditional analysis approaches but are addressable through machine learning, including leveraging the knowledge of simple materials to model more complicated systems, learning with limited data or incomplete labels, identifying meaningful spectra and materials representations, mitigating spectral noise, and others. We present an outlook on a few emerging roles machine learning may play in broad types of scattering and spectroscopic problems in the foreseeable future.

Chen, Zhantao↗
DOE OSTI2022

Active learning with multifidelity modeling for efficient rare event simulation

Here, while multifidelity modeling provides a cost-effective way to conduct uncertainty quantification with computationally expensive models, much greater efficiency can be achieved by adaptively deciding the number of required high-fidelity (HF) simulations, depending on the type and complexity of the problem and the desired accuracy in the results. We propose a framework for active learning with multifidelity modeling emphasizing the efficient estimation of rare events. Our framework works by fusing a low-fidelity (LF) prediction with an HF-inferred correction, filtering the corrected LF prediction to decide whether to call the high-fidelity model, and for enhanced subsequent accuracy, adapting the correction for the LF prediction after every HF model call. The framework does not make any assumptions as to the LF model type or its correlations with the HF model. In addition, for improved robustness when estimating smaller failure probabilities, we propose using dynamic active learning functions that decide when to call the HF model. We demonstrate our framework using several academic case studies (including some high-dimensional problems) and two finite element model case studies: estimating Navier-Stokes velocities using the Stokes approximation and estimating stresses in a transversely isotropic model subjected to displacements via a coarsely meshed isotropic model. Across these case studies, not only did the proposed framework estimate the failure probabilities accurately, but compared with either Monte Carlo or a standard variance reduction method, it also required only a small fraction of the calls to the HF model.

42 ENGINEERING↗
DOE OSTI2024

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Neural Lyapunov Control for Power System Transient Stability: A Deep Learning-Based Approach

We report that power system control and transient stability analysis play essential roles in secure system operation. Control of power systems typically involves highly nonlinear and complex dynamics. Most of the existing works address such problems with additional assumptions in system dynamics, leading to a requirement for a complete and general solution. This paper, therefore, proposes a novel control framework for various power system control and stability problems leveraging a learning-based approach. The proposed framework includes a two-module structure that iteratively and jointly learns the candidate Lyapunov function and control law via deep neural networks in a learning module. Meanwhile, it guides the learning procedure towards valid results satisfying Lyapunov conditions in a falsification module. The introduced termination criteria ensure provable system stability. This control framework is verified through several studies handling different types of power system control problems. The results show that the proposed framework is generalizable and can simplify the control design for complex power systems with the stability guarantee and enlarged region of attraction.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

INTEGRATION OF DATA ANALYTICS WITH SYSTEM HEALTH PROGRAMS

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry developed and regulatory programs. However, these programs have proven to be labor intensive and expensive. There is an opportunity to significantly enhance the collection, analysis, and use of this information to provide more cost-effective plant operation. Additionally, there is an acute industry need to leverage advanced technology to reduce costs and improve operational effectiveness. The goal of this paper is to provide effective and efficient analytical methods and tools to support risk-informed decisions for the equipment reliability and asset management programs at nuclear power plants. This is accomplished by creating a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). Here we are supporting typical system engineer decisions regarding maintenance activity scheduling and component ageing management. This is performed in a risk-informed context where herein the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow. A challenge is that the structure of this workflow strongly depends on the decision that needs to be made, the type of data available, and the constraints that need to be considered. Current methods are designed to provide specific answers to specific problems; however, these methods might prove to be inadequate even when problem settings slightly change (e.g., different types of requirements, additional dependencies between system reliability and economics). We tackled this challenge by designing framework in a flexible and modular fashion such that the user can assemble and customize his/her own workflow that integrates SSC economic lifecycle models (e.g., maintenance and replacement costs), system reliability models, and optimization methods.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Assessment of fine-tuned large language models for real-world chemistry and material science applications

The current generation of large language models (LLMs) has limited chemical knowledge. Recently, it has been shown that these LLMs can learn and predict chemical properties through fine-tuning. Using natural language to train machine learning models opens doors to a wider chemical audience, as field-specific featurization techniques can be omitted. In this work, we explore the potential and limitations of this approach. We studied the performance of fine-tuning three open-source LLMs (GPT-J-6B, Llama-3.1-8B, and Mistral-7B) for a range of different chemical questions. We benchmark their performances against “traditional” machine learning models and find that, in most cases, the fine-tuning approach is superior for a simple classification problem. Depending on the size of the dataset and the type of questions, we also successfully address more sophisticated problems. The most important conclusions of this work are that, for all datasets considered, their conversion into an LLM fine-tuning training set is straightforward and that fine-tuning with even relatively small datasets leads to predictive models. These results suggest that the systematic use of LLMs to guide experiments and simulations will be a powerful technique in any research study, significantly reducing unnecessary experiments or computations.

Van Herck, Joren↗
DOE OSTI2024

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗
DOE OSTI2024

Unraveling the Nature of Lasing Emission from Hybrid Silicon Nitride and Colloidal Nanocrystal Photonic Crystals with Low Refractive Index Contrast

Silicon nitride is used for its low optical loss and high thermal stability, making it a suitable platform for visible-light applications in integrated photonic devices. However, its application has been limited due to inefficient light emission, a problem addressed by integrating various types of light emitters onto the platform. In particular, the integration of solution-processable colloidal nanocrystals (NCs) as optical gain materials onto the silicon nitride platform is a promising route but requires a more solid theoretical footing. By leveraging 2D surface-emitting photonic crystal structures combined with NCs, we effectively confine and manipulate light to achieve lasing from green to red. Building on this, we model the light–matter interactions of the low index contrast NC/nitride platform, validated by extensive experimental validations through Fourier imaging techniques, revealing the full photonic band structure and showing clear mode congestion. Finally, these comprehensive studies confirm the potential of hybrid NC-based structures for fully integrated on-chip laser applications and indicate routes for further improvement.

BIC Lasing↗
DOE OSTI2020

Machine learning-based multidomain processing for texture-based image segmentation and analysis

Atomic and molecular resolved atomic force microscopy (AFM) images offer unique insights into materials' properties such as local ordering, molecular orientation, and topological defects, which can be used to pinpoint physical and chemical interactions occurring at the surface. Utilizing machine learning for extracting underlying physical parameters increases the throughput of AFM data processing and eliminates inconsistencies intrinsic to manual image analysis, thus enabling the creation of reliable frameworks for qualitative and quantitative evaluation of experimental data. Here, we present a robust and scalable approach to the segmentation of AFM images based on flexible pre-selected classification criteria. The usage of supervised learning and feature extraction allows us to retain the consideration of specific problem-dependent features (such as types of periodical structures observed in the images and the associated numerical parameters: spacing, orientation, etc.). We highlight the applicability of this approach for the segmentation of molecular resolved AFM images based on the crystal orientation of the observed domains, automated selection of boundaries, and collection of relevant statistics. Finally, we outline a general strategy for machine learning-enabled analysis of nanoscale systems exhibiting periodic order that could be applied to any analytical imaging technique

36 MATERIALS SCIENCE↗
DOE OSTI2020

Efficient optimization method for finding minimum energy paths of magnetic transitions

Here, efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line search can, therefore, not be performed, the use of limited memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) and conjugate gradient algorithms in conjunction with orthogonal spin optimization (OSO) approach is shown to greatly outperform the previously used velocity projection and dissipative Landau–Lifschitz dynamics optimization methods. The implementation makes use of energy weighted springs for the distribution of the discretization points along the path and this is found to improve performance significantly. The various methods are applied to several test problems using a Heisenberg-type Hamiltonian, extended in some cases to include Dzyaloshinskii–Moriya and exchange interactions beyond nearest neighbours. Minimum energy paths are found for magnetization reversals in a nano-island, collapse of skyrmions in two-dimensional layers and annihilation of a chiral bobber near the surface of a three-dimensional magnet. The LBFGS-OSO method is found to outperform the dynamics based approaches by up to a factor of 8 in some cases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Magnetized rotating isothermal winds

ABSTRACT We consider the general problem of a Parker-type non-relativistic isothermal wind from a rotating and magnetic star. Using the magnetohydrodynamics code athena++, we construct an array of simulations in the stellar rotation rate Ω* and the isothermal sound speed cT, and calculate the mass, angular momentum, and energy loss rates across this parameter space. We also briefly consider the 3D case, with misaligned magnetic and rotation axes. We discuss applications of our results to the spin-down of normal stars, highly irradiated exoplanets, and to nascent highly magnetic and rapidly rotating neutron stars born in massive star core-collapse.

Astronomy & Astrophysics↗
DOE OSTI2020

Coordinate transformation methodology for simulating quasistatic elastoplastic solids

Molecular dynamics simulations frequently employ periodic boundary conditions where the positions of the periodic images are manipulated in order to apply deformation to the material sample. For example, Lees-Edwards conditions use moving periodic images to apply simple shear. Here, we examine the problem of precisely comparing this type of simulation to continuum solid mechanics. We employ a hypo-elastoplastic mechanical model, and develop a projection method to enforce quasi-static equilibrium. We introduce a simulation framework that uses a fixed Cartesian computational grid on a reference domain, and imposes deformation via a time-dependent coordinate transformation to the physical domain. As a test case for our method, we consider the evolution of shear bands in a bulk metallic glass using the shear transformation zone theory of amorphous plasticity. We examine the growth of shear bands in simple shear and pure shear conditions as a function of the initial preparation of the bulk metallic glass.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗