Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchy problem”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

The California corridor transportation system: A design summary

A design group was assembled to find and research criteria relevent to the design of a California Corridor Transportation System. The efforts of this group included defining the problem, conducting a market analysis, formulation of a demand model, identification and evaluation of design drivers, and the systematic development of a solution. The problems of the current system were analyzed and used to determine design drivers, which were divided into the broad categories of cost, convenience, feasibility, environment, safety, and social impact. The relative importance of individual problems was addressed, resulting in a hierarchy of design drivers. Where possible, methods of evaluating the relative merit of proposed systems with respect to each driver were developed. Short takeoff vertical landing aircraft concepts are also discussed for supersonic fighters.

Source record↗
NASA NTRS1991

Hybrid solution for high-speed target acquisition and identification systems

A typical hierarchy for a general object recognition problem consists of object detection, classification and identification. This paper establishes necessary building blocks required for high-speed object recognition applications. An architecture that combines digital and optical processing, exploiting current image processing techniques for detection and classification, and optical processing hardware is described. An optical processing scheme is suggested for the identification aspect. Numerical results of each proposed concept are presented.

Udomkesmalee, Suraphol↗
NASA NTRS1982

A linear decomposition method for large optimization problems. Blueprint for development

A method is proposed for decomposing large optimization problems encountered in the design of engineering systems such as an aircraft into a number of smaller subproblems. The decomposition is achieved by organizing the problem and the subordinated subproblems in a tree hierarchy and optimizing each subsystem separately. Coupling of the subproblems is accounted for by subsequent optimization of the entire system based on sensitivities of the suboptimization problem solutions at each level of the tree to variables of the next higher level. A formalization of the procedure suitable for computer implementation is developed and the state of readiness of the implementation building blocks is reviewed showing that the ingredients for the development are on the shelf. The decomposition method is also shown to be compatible with the natural human organization of the design process of engineering systems. The method is also examined with respect to the trends in computer hardware and software progress to point out that its efficiency can be amplified by network computing using parallel processors.

Sobieszczanski-Sobieski, J.↗
NASA NTRS1992

Irrelevance in Problem Solving

The notion of irrelevance underlies many different works in AI, such as detecting redundant facts, creating abstraction hierarchies and reformulation and modeling physical devices. However, in order to design problem solvers that exploit the notion of irrelevance, either by automatically detecting irrelevance or by being given knowledge about irrelevance, a formal treatment of the notion is required. In this paper we present a general framework for analyzing irrelevance. We discuss several properties of irrelevance and show how they vary in a space of definitions outlined by the framework. We show how irrelevance claims can be used to justify the creation of abstractions thereby suggesting a new view on the work on abstraction.

Levy, Alon Y.↗
NASA NTRS1973

Repeated cascade theory of homogeneous turbulence.

The problem of turbulent spectrum engenders two coupled hierarchies: one originates from the development of stress, leading to a transfer function, and the other from the development of an eddy viscosity. In order to incorporate physical roles among scales, the turbulent velocity fluctuation is decomposed into a series of ranks in the increasing order of randomness, contributing successively to energy or stress, eddy viscosity, relaxation frequency, and higher-rank frequencies in the memory chain. As a result, the first hierarchy mentioned above becomes closed at the quadrupole correlation. The second hierarchy governs the eddy viscosities of different ranks, related to relaxation frequencies of such ranks, in the form of a memory chain. It is cut off by an implicit viscous mechanism. For zero wind gradient, the spectrum in the inertial subrange recovers the Kolmogoroff k to the minus 5/3 law with a numerical constant 1.58, in good agreement with experiments. For a strong wind gradient, the spectrum in the production subrange has a k to the minus 1 law.

Tchen, C. M.↗
NASA NTRS1990

The application of NASREM to remote robot control

The implementation of a remote robot controller, wherein the distance to the remote robot causes significant communication time delays is described. The NASREM telrobot control architecture is used as a basis for the implementation of the system. Levels 1 through 4 of the hierarchy were implemented. The solution to the problems encounterd during the implementation and those which are unique to remote robot control are described.

Walker, Michael W.↗
DOE OSTI2026

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Furthermore, our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Kobayashi, Ryohei [Institute for Advanced Study, P↗
NASA NTRS1989

A decision-based perspective for the design of methods for systems design

Organization of material, a definition of decision based design, a hierarchy of decision based design, the decision support problem technique, a conceptual model design that can be manufactured and maintained, meta-design, computer-based design, action learning, and the characteristics of decisions are among the topics covered.

Mistree, Farrokh↗
NASA NTRS1993

On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes

It was shown earlier that for a punctured Reed-Muller (RM) code or a primitive BCH code, which contains a punctured RM code of the same minimum distance as a large subcode, the state complexity of the minimal trellis diagram is much greater than that for an equivalent code obtained by a proper permutation on the bit positions. To find a permutation on the bit positions for a given code that minimizes the state complexity of its minimal trellis diagram is an interesting and challenging problem. This permutation problem is related to the generalized Hamming weight hierarchy of a code, and is shown that for RM codes, the standard binary order of bit positions is optimum at every bit position with respect to the state complexity of a minimal trellis diagram by using a theorem due to Wei. The state complexity of trellis diagram for the extended and permuted (64, 24) BCH code is discussed.

Kasami, Tadao↗
NASA NTRS1992

An Integrated Planning Representation Using Macros, Abstractions, and Cases

Planning will be an essential part of future autonomous robots and integrated intelligent systems. This paper focuses on learning problem solving knowledge in planning systems. The system is based on a common representation for macros, abstractions, and cases. Therefore, it is able to exploit both classical and case based techniques. The general operators in a successful plan derivation would be assessed for their potential usefulness, and some stored. The feasibility of this approach was studied through the implementation of a learning system for abstraction. New macros are motivated by trying to improve the operatorset. One heuristic used to improve the operator set is generating operators with more general preconditions than existing ones. This heuristic leads naturally to abstraction hierarchies. This investigation showed promising results on the towers of Hanoi problem. The paper concludes by describing methods for learning other problem solving knowledge. This knowledge can be represented by allowing operators at different levels of abstraction in a refinement.

Baltes, Jacky↗
NASA NTRS1993

Cognitive engineering models in space systems

NASA space systems, including mission operations on the ground and in space, are complex, dynamic, predominantly automated systems in which the human operator is a supervisory controller. Models of cognitive functions in complex systems are needed to describe human performance and form the theoretical basis of operator workstation design, including displays, controls, and decision aids. Currently, there several candidate modeling methodologies. They include the Rasmussen abstraction/aggregation hierarchy and decision ladder, the goal-means network, the problem behavior graph, and the operator function model. The research conducted under the sponsorship of this grant focuses on the extension of the theoretical structure of the operator function model and its application to NASA Johnson mission operations and space station applications. The initial portion of this research consists of two parts. The first is a series of technical exchanges between NASA Johnson and Georgia Tech researchers. The purpose is to identify candidate applications for the current operator function model; prospects include mission operations and the Data Management System Testbed. The second portion will address extensions of the operator function model to tailor it to the specific needs of Johnson applications. At this point, we have accomplished two things. During a series of conversations with JSC researchers, we have defined the technical goal of the research supported by this grant to be the structural definition of the operator function model and its computer implementation, OFMspert. Both the OFM and OFMspert have matured to the point that they require infrastructure to facilitate use by researchers not involved in the evolution of the tools. The second accomplishment this year was the identification of the Payload Deployment and Retrieval System (PDRS) as a candidate system for the case study. In conjunction with government and contractor personnel in the Human-Computer Interaction Lab, the PDRS was identified as the most accessible system for the demonstration. Pursuant to this a PDRS simulation was obtained from the HCIL and an initial knowledge engineering effort was conducted to understand the operator's tasks in the PDRS application. The preliminary results of the knowledge engineering effort and an initial formulation of an operator function model (OFM) are contained in the appendices.

Mitchell, Christine M.↗
NASA NTRS1994

Higher order moments of the matter distribution in scale-free cosmological simulations with large dynamic range

We calculate reduced moments (xi bar)(sub q) of the matter density fluctuations, up to order q = 5, from counts in cells produced by particle-mesh numerical simulations with scale-free Gaussian initial conditions. We use power-law spectra P(k) proportional to k(exp n) with indices n = -3, -2, -1, 0, 1. Due to the supposed absence of characteristic times or scales in our models, all quantities are expected to depend on a single scaling variable. For each model, the moments at all times can be expressed in terms of the variance (xi bar)(sub 2), alone. We look for agreement with the hierarchical scaling ansatz, according to which ((xi bar)(sub q)) proportional to ((xi bar)(sub 2))(exp (q - 1)). For n less than or equal to -2 models, we find strong deviations from the hierarchy, which are mostly due to the presence of boundary problems in the simulations. A small, residual signal of deviation from the hierarchical scaling is however also found in n greater than or equal to -1 models. The wide range of spectra considered and the large dynamic range, with careful checks of scaling and shot-noise effects, allows us to reliably detect evolution away from the perturbation theory result.

Lucchin, Francesco↗
NASA NTRS1992

Becoming Reactive by Concretization

One way to build a reactive system is to construct an action table indexed by the current situation or stimulus. The action table describes what course of action to pursue for each situation or stimulus. This paper describes an incremental approach to constructing the action table through achieving goals with a hierarchical search system. These hierarchies are generated with transformations called concretizations, which add constraints to a problem and which can reduce the search space. The basic idea is that an action for a state is looked up in the action table and executed whenever the action table has an entry for that state; otherwise, a path is found to the nearest (cost-wise in a graph with costweighted arcs) state that has a mappring from a state in the next highest hierarchy. For each state along the solution path, the successor state in the path is cached in the action table entry for that state. Without caching, the hierarchical search system can logarithmically reduce search. When the table is complete the system no longer searches: it simply reacts by proceeding to the state listed in the table for each state. Since the cached information is specific only to the nearest state in the next highest hierarchy and not the goal, inter-goal transfer of reactivity is possible. To illustrate our approach, we show how an implemented hierarchical search system can completely reactive.

Prieditis, Armand↗
NASA NTRS2005

Measuring, Enabling and Comparing Modularity, Regularity and Hierarchy in Evolutionary Design

For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy - characteristics that are found both in man-made and natural designs. Here we claim that these characteristics are enabled by implementing the attributes of combination, control-flow and abstraction in the representation. To support this claim we use an evolutionary algorithm to evolve solutions to different sizes of a table design problem using five different representations, each with different combinations of modularity, regularity and hierarchy enabled and show that the best performance happens when all three of these attributes are enabled. We also define metrics for modularity, regularity and hierarchy in design encodings and demonstrate that high fitness values are achieved with high values of modularity, regularity and hierarchy and that there is a positive correlation between increases in fitness and increases in modularity. regularity and hierarchy.

Hornby, Gregory S.↗
NASA NTRS1980

Numerical solution techniques for unsteady transonic aerodynamics problems

Basic concepts of finite difference solution techniques for unsteady transonic flows are presented. The hierarchy of mathematical forumulations that approximate the Navier-Stokes equations are reviewed. The basic concepts involved in constructing numerical algorthms to solve these formulations are given. Semi-implicit and implicit schemes are constructed and analyzed. The discussion focuses primarily on techniques for solving the low frequency transonic small disturbance equation. This is the simplest formulation that contains the essence of inviscid unsteady transonic flow physics. The low frequency formulation is emphasized here because codes based on this theory can be run in minutes of processor time on currently available computers. Furthermore, numerical techniques involved in solving this simple formulation also apply to the more complicated formulations. Extensions to these formulations are briefly described. An indication of the present capability for solving unsteady transonic flows is provided. Important areas of future research for the advancement of computational unsteady transonic aerodynamics are described.

Ballhaus, W. F.↗
NASA NTRS1991

Hierarchic Extensions in the Static and Dynamic Analysis of Elastic Beams

Approximate solutions of static and dynamic beam problems by the p-version of the finite element method are investigated. Within a hierarchy of engineering beam idealizations, rigorous formulations of the strain and kinetic energies for straight and circular beam elements are presented. These formulations include rotating coordinate system effects and geometric nonlinearities to allow for the evaluation of vertical axis wind turbines, the motivating problem for this research. Hierarchic finite element spaces, based on extensions of the polynomial orders used to approximate the displacement variables, are constructed. The developed models are implemented into a general purpose computer program for evaluation. Quality control procedures are examined for a diverse set of sample problems. These procedures include estimating discretization errors in energy norm and natural frequencies, performing static and dynamic equilibrium checks, observing convergence for qualities of interest, and comparison with more exacting theories and experimental data. It is demonstrated that p-extensions produce exponential rates of convergence in the approximation of strain energy and natural frequencies for the class of problems investigated.

Watson, Robert A.↗
NASA NTRS2012

OpenMDAO: Framework for Flexible Multidisciplinary Design, Analysis and Optimization Methods

The OpenMDAO project is underway at NASA to develop a framework which simplifies the implementation of state-of-the-art tools and methods for multidisciplinary design, analysis and optimization. Foremost, OpenMDAO has been designed to handle variable problem formulations, encourage reconfigurability, and promote model reuse. This work demonstrates the concept of iteration hierarchies in OpenMDAO to achieve a flexible environment for supporting advanced optimization methods which include adaptive sampling and surrogate modeling techniques. In this effort, two efficient global optimization methods were applied to solve a constrained, single-objective and constrained, multiobjective version of a joint aircraft/engine sizing problem. The aircraft model, NASA's nextgeneration advanced single-aisle civil transport, is being studied as part of the Subsonic Fixed Wing project to help meet simultaneous program goals for reduced fuel burn, emissions, and noise. This analysis serves as a realistic test problem to demonstrate the flexibility and reconfigurability offered by OpenMDAO.

Kriging↗
NASA NTRS1976

A BBGKY framework for fluid turbulence

A framework is presented for a systematic kinetic theory of turbulence originating from the Liouville equation for the Fourier coefficients of fluid variables. The real and imaginary parts of these Fourier coefficients play the role that particle coordinates (positions and momenta) play in the BBGKY theory. The basic relations of the problem are the incompressible Navier-Stokes equations in two dimensions with zero viscosity, with the probability distributions of Fourier coefficients rather than moments being the basic variables of the theory. A kinetic equation is derived and shown to possess a number of requirements that any reasonable kinetic equation must have: conservation laws, positive-definite spectral densities, and an H-theorem. The major lack in the theory is any reliable information on the relaxation predicted by the complicated linear operator H. Closure of the hierarchy is achieved by the hypothesis that the five-coefficient correlation function is negligible. Problems associated with inclusion of viscosity and external driving forces are discussed.

Montgomery, D.↗