Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems
Not Available
Zheng, Weixiong↗
SEARCH · Search NASA
Results for “Problem solving”
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.
Knowledge-based design of generate-and-patch problem solvers that solve global resource assignment problems
We present MENDER, a knowledge based system that implements software design techniques that are specialized to automatically compile generate-and-patch problem solvers that satisfy global resource assignments problems. We provide empirical evidence of the superior performance of generate-and-patch over generate-and-test: even with constrained generation, for a global constraint in the domain of '2D-floorplanning'. For a second constraint in '2D-floorplanning' we show that even when it is possible to incorporate the constraint into a constrained generator, a generate-and-patch problem solver may satisfy the constraint more rapidly. We also briefly summarize how an extended version of our system applies to a constraint in the domain of 'multiprocessor scheduling'.
Voigt, Kerstin↗
Generic task problem solvers in Soar
Two trends can be discerned in research in problem solving architectures in the last few years. On one hand, interest in task-specific architectures has grown, wherein types of problems of general utility are identified, and special architectures that support the development of problem solving systems for those types of problems are proposed. These architectures help in the acquisition and specification of knowledge by providing inference methods that are appropriate for the type of problem. However, knowledge based systems which use only one type of problem solving method are very brittle, and adding more types of methods requires a principled approach to integrating them in a flexible way. Contrasting with this trend is the proposal for a flexible, general architecture contained in the work on Soar. Soar has features which make it attractive for flexible use of all potentially relevant knowledge or methods. But as the theory Soar does not make commitments to specific types of problem solvers or provide guidance for their construction. It was investigated how task-specific architectures can be constructed in Soar to retain as many of the advantages as possible of both approaches. Examples were used from the Generic Task approach for building knowledge based systems. Though this approach was developed and applied for a number of problems, the ideas are applicable to other task-specific approaches as well.
Johnson, Todd R.↗
Research and applications: Artificial intelligence
The program is reported for developing techniques in artificial intelligence and their application to the control of mobile automatons for carrying out tasks autonomously. Visual scene analysis, short-term problem solving, and long-term problem solving are discussed along with the PDP-15 simulator, LISP-FORTRAN-MACRO interface, resolution strategies, and cost effectiveness.
Chaitin, L. J.↗
Case-based reasoning in design: An apologia
Three positions are presented and defended: the process of generating solutions in problem solving is viewable as a design task; case-based reasoning is a strong method of problem solving; and a synergism exists between case-based reasoning and design problem solving.
Pulaski, Kirt↗
Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering
We use the term "Grid" to refer to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. This infrastructure includes: (1) Tools for constructing collaborative, application oriented Problem Solving Environments / Frameworks (the primary user interfaces for Grids); (2) Programming environments, tools, and services providing various approaches for building applications that use aggregated computing and storage resources, and federated data sources; (3) Comprehensive and consistent set of location independent tools and services for accessing and managing dynamic collections of widely distributed resources: heterogeneous computing systems, storage systems, real-time data sources and instruments, human collaborators, and communications systems; (4) Operational infrastructure including management tools for distributed systems and distributed resources, user services, accounting and auditing, strong and location independent user authentication and authorization, and overall system security services The vision for NASA's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks. Such Grids will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. Examples of these problems include: (1) Coupled, multidisciplinary simulations too large for single systems (e.g., multi-component NPSS turbomachine simulation); (2) Use of widely distributed, federated data archives (e.g., simultaneous access to metrological, topological, aircraft performance, and flight path scheduling databases supporting a National Air Space Simulation systems}; (3) Coupling large-scale computing and data systems to scientific and engineering instruments (e.g., realtime interaction with experiments through real-time data analysis and interpretation presented to the experimentalist in ways that allow direct interaction with the experiment (instead of just with instrument control); (5) Highly interactive, augmented reality and virtual reality remote collaborations (e.g., Ames / Boeing Remote Help Desk providing field maintenance use of coupled video and NDI to a remote, on-line airframe structures expert who uses this data to index into detailed design databases, and returns 3D internal aircraft geometry to the field); (5) Single computational problems too large for any single system (e.g. the rotocraft reference calculation). Grids also have the potential to provide pools of resources that could be called on in extraordinary / rapid response situations (such as disaster response) because they can provide common interfaces and access mechanisms, standardized management, and uniform user authentication and authorization, for large collections of distributed resources (whether or not they normally function in concert). IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: the scientist / design engineer whose primary interest is problem solving (e.g. determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user is the tool designer: the computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. The results of the analysis of the needs of these two types of users provides a broad set of requirements that gives rise to a general set of required capabilities. The IPG project is intended to address all of these requirements. In some cases the required computing technology exists, and in some cases it must be researched and developed. The project is using available technology to provide a prototype set of capabilities in a persistent distributed computing testbed. Beyond this, there are required capabilities that are not immediately available, and whose development spans the range from near-term engineering development (one to two years) to much longer term R&D (three to six years). Additional information is contained in the original.
Johnston, William E.↗
Autonomous Noether Boundary-Value Problems not Solved with Respect to the Derivative
In monographs of N. V. Azbelev, A. M. Samoilenko, and A. A. Boichuk, constructive methods of study of Noether boundary-value problems have been developed. These methods continue the investigation of periodic problems stated by H. Poincaré, A. M. Lyapunov, N. M. Krylov, N. N. Bogolyubov, I. G. Malkin, and O. Veivoda by the methods of small parameter. We propose an improved scheme of study of autonomous Noether boundary-value problems for nonlinear systems in critical cases. In the case of multiple roots of the equation for generating constants, we obtain sufficient conditions of existence of solutions to an autonomous boundary-value problem not solved with respect to the derivative. The effectiveness of the scheme proposed is illustrated by an example of the periodic problem for the Liénard equation.
97 MATHEMATICS AND COMPUTING↗
Removal of spurious modes encountered in solving stability problems by spectral methods
A technique based on the Galerkin approximation is developed to remove spurious roots arising when Chebyshev spectral methods are used to solve eigenvalue problems in hydrodynamic stability. The derivation of Galerkin-Chebyshev approximations is explained, and numerical results for the Orr-Sommerfeld equations of plane Poiseuille flow and a Blasius profile are presented in tables and compared with those obtained by the method of Zebib (1984). It is pointed out that the present method does not increase the size of the algebraic system to be solved.
Zebib, Abdelfattah↗
Solving Large Problems Quickly: Progress in 2001-2003
This document describes the progress we have made and the lessons we have learned in 2001 through 2003 under the NASA grant entitled "Solving Important Problems Faster". The long-term goal of this research is to accelerate large, irregular scientific applications which have enormous data sets and which are difficult to parallelize. To accomplish this goal, we are exploring two complementary techniques: (i) using compiler-inserted prefetching to automatically hide the I/O latency of accessing these large data sets from disk; and (ii) using thread-level data speculation to enable the optimistic parallelization of applications despite uncertainty as to whether data dependences exist between the resulting threads which would normally make them unsafe to execute in parallel. Overall, we made significant progress in 2001 through 2003, and the project has gone well.
Mowry, Todd C.↗
The large area crop inventory experiment: An experiment to demonstrate how space-age technology can contribute to solving critical problems here on earth
The large area crop inventory experiment is being developed to predict crop production through satellite photographs. This experiment demonstrates how space age technology can contribute to solving practical problems of agriculture management.
Source record↗
Timely Reporting of Heavy Hitters Using External Memory
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.
97 MATHEMATICS AND COMPUTING↗
Trimodal interpretation of constraints for planning
Constraints are used in the CAMPS knowledge based planning system to represent those propositions that must be true for a plan to be acceptable. CAMPS introduces the make-mode for interpreting a constraint. Given an unsatisfied constraint, make evaluation mode suggests planning actions which, if taken, would result in a modified plan in which the constraint in question may be satisfied. These suggested planning actions, termed delta-tuples, are the raw material of intelligent plan repair. They are used both in debugging an almost-right plan and in replanning due to changing situations. Given a defective plan in which some set of constraints are violated, a problem solving strategy selects one or more constraints as a focus of attention. These selected constraints are evaluated in the make-mode to produce delta-tuples. The problem solving strategy then reviews the delta-tuples according to its application and problem-specific criteria to find the most acceptable change in terms of success likelihood and plan disruption. Finally, the problem solving strategy makes the suggested alteration to the plan and then rechecks constraints to find any unexpected consequences.
Krieger, David↗
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
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.
97 MATHEMATICS AND COMPUTING↗
A Novel Approach to Solve Forward/Inverse Problems in Remote Sensing Applications
Inversion of electromagnetic (EM) signals reflected from or transmitted through a medium, or emitted by it due to internal sources can be used to investigate the optical and physical properties of a variety of scattering/absorbing/emitting materials. Such media encompass planetary atmospheres and surfaces (including water/snow/ice), and plant canopies. In many situations the signals emerging from such media can be described by a linear transport equation which in the case of EM radiation is the radiative transfer equation (RTE). Solutions of the RTE can be used as a forward model to solve the inverse problem to determine the medium state parameters giving rise to the emergent (reflected/transmitted/emitted) EM signals. A novel method is developed to determine layer-by-layer contributions to the emergent signals from such stratified, multilayered media based on the solution of the pertinent RTE. As a specific example of how this approach may be applied, the radiation reflected from a multilayered atmosphere is used to solve the problem relevant for EM probing by a space-based lidar system. The solutions agree with those obtained using the standard lidar approach for situations in which single scattering prevails, but this novel approach also yields reliable results for optically thick, multiple scattering aerosol and cloud layers that cannot be provided by the traditional lidar approach.
forward modeling↗
Artificial intelligence, expert systems, computer vision, and natural language processing
An overview of artificial intelligence (AI), its core ingredients, and its applications is presented. The knowledge representation, logic, problem solving approaches, languages, and computers pertaining to AI are examined, and the state of the art in AI is reviewed. The use of AI in expert systems, computer vision, natural language processing, speech recognition and understanding, speech synthesis, problem solving, and planning is examined. Basic AI topics, including automation, search-oriented problem solving, knowledge representation, and computational logic, are discussed.
Gevarter, W. B.↗
Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering
The term "Grid" refers to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. The vision for NASN's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks that will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: The scientist / design engineer whose primary interest is problem solving (e.g., determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user if the tool designer: The computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. This paper describes the current state of IPG (the operational testbed), the set of capabilities being put into place for the operational prototype IPG, as well as some of the longer term R&D tasks.
Johnston, William E.↗
Marine geodesy a multipurpose approach to solve oceanic problems
Various current and future problem areas of marine geodesy are identified. These oceanic problem areas are highly diversified and include submersible navigation under ice seas, demarcation and determination of boundaries in deep ocean, tsunamis, ecology, etc., etc. Their achieved as well as desired positional accuracy estimates, based upon publications and discussions, are also given. A multipurpose approach to solve these problems is described. An optimum configuration of an ocean-bottom control-net unit is provided.
Saxena, N.↗
Dynamic control of robotic welding - On-going research
Two major challenges exist for the development of dynamic control systems: first, the control system must be resourceful enough to provide problem-solving capabilities in unforeseen circumstances; second, it must be rapid enough to respond to dynamic environments. Most conventional control systems do not have the ability to 'step back' and problem-solve, especially in environments with incomplete and uncertain models and data. Orthogonally, commercially available AI systems usually do not respond at the rates required to support 'real-time' control. Hence, control systems are not available that respond to complex dynamic environments within appropriate time constraints. This paper describes work on an AI-based control system designed to address these challenges. A prototype system has been used, in a simulated environment, to control the robotic welding of aerospace components. This AI-based control system has demonstrated the ability to flexibly control a complex process within required time constraints by incorporating higher level reasoning and the ability to deal with uncertainty. Further work is in progress to expand the system's problem-solving capabilities.
Ruokangas, Corinne C.↗