SEARCH · Search NASA
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.
PSUADE (Problem Solving testbed for Uncertainty Analysis and Design Exploration) is a mathematical software useful for performing uncertainty quantification and sensitivity analysis.
Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.
Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.
Multi-task learning (MTL) is an inductive transfer mechanism designed to leverage useful information from multiple tasks to improve generalization performance compared to single-task learning. It has been extensively explored in traditional machine learning to address issues such as data sparsity and overfitting in neural networks. In this work, we apply MTL to problems in science and engineering governed by partial differential equations (PDEs). However, implementing MTL in this context is complex, as it requires task-specific modifications to accommodate various scenarios representing different physical processes. To this end, we present a multi-task deep operator network (MT-DeepONet) to learn solutions across various functional forms of source terms in a PDE and multiple geometries in a single concurrent training session. We introduce modifications in the branch network of the vanilla DeepONet to account for various functional forms of a parameterized coefficient in a PDE. Additionally, we handle parameterized geometries by introducing a binary mask in the branch network and incorporating it into the loss term to improve convergence and generalization to new geometry tasks. Our approach is demonstrated on three benchmark problems: (1) learning different functional forms of the source term in the Fisher equation; (2) learning multiple geometries in a 2D Darcy Flow problem and showcasing better transfer learning capabilities to new geometries; and (3) learning 3D parameterized geometries for a heat transfer problem and demonstrate the ability to predict on new but similar geometries. Finally, our MT-DeepONet framework offers a novel approach to solving PDE problems in engineering and science under a unified umbrella based on synergistic learning that reduces the overall training cost for neural operators.
Not Available
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Abstract not provided.
Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.
We report a case study where an existing materials science course was modified to include numerical simulation projects on the micromagnetic behavior of materials. The Ubermag micromagnetic simulation software package is used in order to solve problems computationally. The simulation software is controlled through the Python code in Jupyter notebooks. Our experience is that the self-paced problem-solving nature of the project work can facilitate a better in-depth exploration of the course contents. We discuss which aspects of the Ubermag and the project Jupyter ecosystem have been beneficial for the students' learning experience and which could be transferred to similar teaching activities in other subject areas.
At Lawrence Livermore National Laboratory, applying cutting-edge science and technology to challenging security questions is an everyday thing. Systems Analysis is one way we solve problems—by bringing analytic rigor to missions like strategic deterrence and critical infrastructure defense. Working with the brightest minds in science, technology, and engineering, systems analysts at LLNL bring state-of-the-art analytic tools to bear on problems of national importance. From ensuring the safety, security, and effectiveness of our nation’s nuclear stockpile to shaping the future of inertial fusion energy—if you have a penchant for problem-solving using modeling and analysis tools—we have a place for you.
Solving a non-linear inverse problem is challenging in computational science and engineering. Sampling based methods require a large number of model valuations; gradientbased methods require fewer model evaluations but only find the local minima. Multifidelity optimization combines the low fidelity model and the high-fidelity model to achieve both high accuracy and high efficiency. In this paper, we present a bi-fidelity approach to solve non-linear inverse problems. In the bi-fidelity inversion method, the low-fidelity model is used to acquire a good initial guess, and the high-fidelity model is used to locate the global minimum. Combined with a multi-start optimization scheme, the proposed approach significantly increases the possibility of finding the global minimum for nonlinear inverse problems with many local minima. The method is tested with two toy problems and then applied to an electromagnetic well logging inverse problem, which is difficult to solve using traditional gradient-based methods. The bi-fidelity method provides promising inversion results and can be easily applied to traditional gradient-based methods.
Here, this article presents fusion intelligence (FI), a bio-inspired paradigm that synergistically integrates the intrinsic capabilities of intelligent biological organisms with the advanced potential of artificial intelligence (AI)-driven systems. FI harnesses the unique intelligence, sensing, actuation, and mobility attributes of living organisms, such as honeybees, blending these with the sophisticated data-driven problem-solving functionalities of AI. By bridging the gap between natural intelligence (NI) and AI, FI can transform how humans interact with and harness the capabilities of both natural and artificial systems. This article presents the model of FI and its application to solve practical problems, discusses the challenges and future directions of FI research, emphasizing a generalized approach to solve complex problems, where AI can observe/control NI in a closed-loop system. We demonstrate the potential for FI to enhance the performance of an agricultural IoT system via a simulated case study, which achieves 50% improvement in the efficacy of insect pollination (entomophily).
This work focuses on using variations of the Frank-Wolfe (FW) algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the IEEE Reliability Test System that the timeseries of demand responsive load decisions obtained through our approach are near optimal and describe how large-scale parallel implementations of our approach can be highly computationally efficient.
Given an input stream S of size N, a Φ-heavy hitter is an item that occurs at least ΦN times in S. The problem of finding heavy-hitters is extensively studied in the database literature. In this work, we study a real-time heavy-hitters variant in which an element must be reported shortly after we see its T = Φ N-th occurrence (and hence it becomes a heavy hitter). We call this the Timely Event Detection (TED) Problem. The TED problem models the needs of many real-world monitoring systems, which demand accurate (i.e., no false negatives) and timely reporting of all events from large, high-speed streams with a low reporting threshold (high sensitivity). Like the classic heavy-hitters problem, solving the TED problem without false-positives requires large space (Ω (N) words). Thus in-RAM heavy-hitters algorithms typically sacrifice accuracy (i.e., allow false positives), sensitivity, or timeliness (i.e., use multiple passes). We show how to adapt heavy-hitters algorithms to external memory to solve the TED problem on large high-speed streams while guaranteeing accuracy, sensitivity, and timeliness. Our data structures are limited only by I/O-bandwidth (not latency) and support a tunable tradeoff between reporting delay and I/O overhead. With a small bounded reporting delay, our algorithms incur only a logarithmic I/O overhead. We implement and validate our data structures empirically using the Firehose streaming benchmark. Multi-threaded versions of our structures can scale to process 11M observations per second before becoming CPU bound. In comparison, a naive adaptation of the standard heavy-hitters algorithm to external memory would be limited by the storage device’s random I/O throughput, i.e., ≈100K observations per second.
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.
Academic translational research efforts to industry are often an underlying sought–after goal among various researchers. Through the interchanges of research endeavors between academia–industry, great innovations can/has been achieved that cater to the real–world application by bridging “industrially relevant” problem solving with pursuing fundamental studies. It is pertinent that most of the studies from university–level research works may not translate into demonstrable market products due to various reasons. Funding support, individual researcher goals, socioeconomic factors, and most importantly the technical know–how of generating revenue strategies for startups, are a few of the factors that have slowed the pace of collaborative efforts. However, we believe that the most crucial component is the identification of the critical parameters that solve long–standing problems that hinder the scale–up of the lab scale research into marketable products considering the techno–economic analysis. Here, to illustrate this, we take the three most relevant examples of devices for fuel generation, devices to utilize solar radiation, and devices for detection and other related applications. In this perspective, we provide an in–depth case study of each of these critical parameters to comment on the direction of research avenues that can serve as step–stones for the commercialization of university–level lab research studies.
The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.