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 433 records · Page 24

Hierarchical Pattern Classifier

Hierarchical pattern classifier reduces number of comparisons between input and memory vectors without reducing detail of final classification by dividing classification process into coarse-to-fine hierarchy that comprises first "grouping" step and second classification step. Three-layer neural network reduces computation further by reducing number of vector dimensions in processing. Concept applicable to pattern-classification problems with need to reduce amount of computation necessary to classify, identify, or match patterns to desired degree of resolution.

Yates, Gigi L.↗

An investigation of constraint-based component-modeling for knowledge representation in computer-aided conceptual design

Originally, computer programs for engineering design focused on detailed geometric design. Later, computer programs for algorithmically performing the preliminary design of specific well-defined classes of objects became commonplace. However, due to the need for extreme flexibility, it appears unlikely that conventional programming techniques will prove fruitful in developing computer aids for engineering conceptual design. The use of symbolic processing techniques, such as object-oriented programming and constraint propagation, facilitate such flexibility. Object-oriented programming allows programs to be organized around the objects and behavior to be simulated, rather than around fixed sequences of function- and subroutine-calls. Constraint propagation allows declarative statements to be understood as designating multi-directional mathematical relationships among all the variables of an equation, rather than as unidirectional assignments to the variable on the left-hand side of the equation, as in conventional computer programs. The research has concentrated on applying these two techniques to the development of a general-purpose computer aid for engineering conceptual design. Object-oriented programming techniques are utilized to implement a user-extensible database of design components. The mathematical relationships which model both geometry and physics of these components are managed via constraint propagation. In addition, to this component-based hierarchy, special-purpose data structures are provided for describing component interactions and supporting state-dependent parameters. In order to investigate the utility of this approach, a number of sample design problems from the field of aerospace engineering were implemented using the prototype design tool, Rubber Airplane. The additional level of organizational structure obtained by representing design knowledge in terms of components is observed to provide greater convenience to the program user, and to result in a database of engineering information which is easier both to maintain and to extend.

Kolb, Mark A.↗

Efficient Operator-Coarsening Multigrid Schemes for Local Discontinuous Galerkin Methods

An efficient hp-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We show that traditional multigrid coarsening of the primal formulation leads to poor and suboptimal multigrid performance, whereas coarsening of the flux formulation leads to essentially optimal convergence and is equivalent to a purely geometric multigrid method. The resulting operator-coarsening schemes do not require the entire mesh hierarchy to be explicitly built, thereby obviating the need to compute quadrature rules, lifting operators, and other mesh-related quantities on coarse meshes. We show that good multigrid convergence rates are achieved in a variety of numerical tests on two-dimensional and three-dimensional uniform and adaptive Cartesian grids, as well as for curved domains using implicitly defined meshes and for multiphase elliptic interface problems with complex geometry. Extensions, e.g., to non-LDG discretizations and fully unstructured meshes, are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

THE TRANSPORT OF LOW-FREQUENCY TURBULENCE IN ASTROPHYSICAL FLOWS. I. GOVERNING EQUATIONS

Numerous problems in space physics and astrophysics require a detailed understanding of the transport and dissipation of low-frequency turbulence in an expanding magnetized flow. We employ a scale-separated decomposition of the incompressible MHD equations (based on an Elssaesser description) and develop a moment hierarchy to describe the transport of the total energy density in fluctuations, the cross-helicity, the energy difference, and correlation lengths corresponding to forward- and backward-propagating modes and to the energy difference. The dissipation terms for the various transport equations are derived. One-point closure schemes are utilized. The technical elements of this work that distinguish it from previous studies are (1) the inclusion of the large-scale background inhomogeneous Alfvenic velocity V{sub A} at a level of detail greater than before, (2) the introduction of a tractable slow timescale closure to eliminate high-frequency interference terms that is likely to prove a useful approximation for practical problems related to the transport of turbulence in an inhomogeneous flow such as the solar wind or solar corona, and finally, (3) we develop a simplified phenomenology for the energy difference or equivalently residual energy that may be useful for practical applications. This yields a coupled system of six equations that describes the transport of turbulence in inhomogeneous sub-Alfvenic and super-Alfvenic flows. The turbulence transport equations are quasi-linear in their spatial evolution operators and nonlinear in the dissipation terms, making the model equations relatively tractable to analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulating the Heterogeneity in Braided Channel Belt Deposits: 2. Examples of Results and Comparison to Natural Deposits

In Part 1 of this series we presented a methodology and a code for modeling the hierarchical sedimentary architecture in braided channel belt deposits. Here, in Part 2, the code was used to create a digital model of this architecture, and the corresponding spatial distribution of permeability. The simulated architecture was compared to the real stratal architecture observed in an abandoned channel belt of the Sagavanirktok River, Alaska by Lunt et al. (2004). The comparisons included assessments of similarity which were both qualitative and quantitative. From the qualitative comparisons we conclude that a synthetic deposit created by the code has unit types, at each level, with a geometry which is generally consistent with the geometry of unit types observed in the field. The digital unit types would generally be recognized as representing their counterparts in nature, including cross stratasets, lobate and scroll bar deposits, channel fills, etc. Furthermore, the synthetic deposit has a hierarchical spatial relationship among these units which represents how the unit types are observed in field exposures and in geophysical images. In quantitative comparisons the proportions and the length, width, and height of unit types at different scales, across all levels of the stratal hierarchy compare well between the digital and the natural deposits. A number of important attributes of the channel belt model were shown to be influenced by more than one level within the hierarchy of stratal architecture. First, the high-permeability open-framework gravels percolated at all levels and thus formed preferential flow pathways. Open framework gravels are indeed known to form preferential flow pathways in natural channel belt deposits. The nature of a percolating cluster changed across different levels of the hierarchy of stratal architecture. As a result of this geologic structure, the percolation occurs at proportions of open-framework gravels below the theoretical percolation threshold for random infinite media. Second, when the channel belt model was populated with permeability distributions by lowest-level unit type, the composite permeability semivariogram contained structures that were identifiable at more than one scale, and each of these structures could be directly linked to unit types of different scales existing at different levels within the hierarchy of strata. These collective results are encouraging with respect to our goal that this model be relevant as a base case in future studies for testing ideas in research addressing the upscaling problem in aquifers and reservoirs with multi-scale heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

Stochastic optimization of GeantV code by use of genetic algorithms

GeantV is a complex system based on the interaction of different modules needed for detector simulation, which include transport of particles in fields, physics models simulating their interactions with matter and a geometrical modeler library for describing the detector and locating the particles and computing the path length to the current volume boundary. The GeantV project is recasting the classical simulation approach to get maximum benefit from SIMD/MIMD computational architectures and highly massive parallel systems. This involves finding the appropriate balance between several aspects influencing computational performance (floating-point performance, usage of off-chip memory bandwidth, specification of cache hierarchy, etc.) and handling a large number of program parameters that have to be optimized to achieve the best simulation throughput. This optimization task can be treated as a black-box optimization problem, which requires searching the optimum set of parameters using only point-wise function evaluations. Here, the goal of this study is to provide a mechanism for optimizing complex systems (high energy physics particle transport simulations) with the help of genetic algorithms and evolution strategies as tuning procedures for massive parallel simulations. One of the described approaches is based on introducing a specific multivariate analysis operator that could be used in case of resource expensive or time consuming evaluations of fitness functions, in order to speed-up the convergence of the black-box optimization problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Composing preconditioners for multiphysics PDE systems with applications to Generalized MHD

New patch smoothers or relaxation techniques are developed for solving linear matrix equations coming from systems of discretized partial differential equations (PDEs). One key linear solver challenge for many PDE systems arises when the resulting discretization matrix has a near null space that has a large dimension, which can occur in generalized magnetohydrodynamic (GMHD) systems. Patch-based relaxation is highly effective for problems when the null space can be spanned by a basis of locally supported vectors. The patch-based relaxation methods that we develop can be used either within an algebraic multigrid (AMG) hierarchy or as stand-alone preconditioners. These patch-based relaxation techniques are a form of well-known overlapping Schwarz methods where the computational domain is covered with a series of overlapping sub-domains (or patches). Patch relaxation then corresponds to solving a set of independent linear systems associated with each patch. In the context of GMHD, we also reformulate the underlying discrete representation used to generate a suitable set of matrix equations. In general, deriving a discretization that accurately approximates the curl operator and the Hall term while also producing linear systems with physically meaningful near null space properties can be challenging. Unfortunately, many natural discretization choices lead to a near null space that includes non-physical oscillatory modes and where it is not possible to span the near null space with a minimal set of locally supported basis vectors. Further discretization research is needed to understand the resulting trade-offs between accuracy, stability, and ease in solving the associated linear systems.

97 MATHEMATICS AND COMPUTING↗

Regression Model Optimization for the Analysis of Experimental Data

A candidate math model search algorithm was developed at Ames Research Center that determines a recommended math model for the multivariate regression analysis of experimental data. The search algorithm is applicable to classical regression analysis problems as well as wind tunnel strain gage balance calibration analysis applications. The algorithm compares the predictive capability of different regression models using the standard deviation of the PRESS residuals of the responses as a search metric. This search metric is minimized during the search. Singular value decomposition is used during the search to reject math models that lead to a singular solution of the regression analysis problem. Two threshold dependent constraints are also applied. The first constraint rejects math models with insignificant terms. The second constraint rejects math models with near-linear dependencies between terms. The math term hierarchy rule may also be applied as an optional constraint during or after the candidate math model search. The final term selection of the recommended math model depends on the regressor and response values of the data set, the user s function class combination choice, the user s constraint selections, and the result of the search metric minimization. A frequently used regression analysis example from the literature is used to illustrate the application of the search algorithm to experimental data.

Ulbrich, N.↗

Graphical interfaces for cooperative planning systems

Based on a cognitive task analysis of 5 airline flight crews in a simulator study, researchers have designed a testbed for studying computer aids for en route flight path planning. This testbed runs on a Mac II controlling three color monitors, and is being used to study the design of aids for both dispatchers and flight crews. Specifically, the research focuses on design concepts for developing cooperative problem-solving systems. We use en route flight planning (selecting alternate routes or destinations due to unanticipated weather, traffic, malfunctions, etc.) as the context for studying the design of such systems. Researchers are currently exploring three questions in this test environment: (1) When interacting with a flight planning aid, how does the role of the pilot influence overall system performance; (2) Can the architecture for a cooperative planning system be built around Sacerdoti's (1983) concept of an abstraction hierarchy, where the pilot can interact with the system at many different levels of detail (but where the computer aid by default handles lower level details that the pilot has chosen not to deat with); and (3) Can graphical displays and direct manipulation of these displays provide perceptual enhancements (Larkin and Simon, 1987) of the pilot's problem-solving activities. Information is given in viewgraph form.

Smith, Philip J.↗

Multilevel Method for Modeling Large-Scale Networks

Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from researchers. We propose to develop multilevel methods to model complex networks. The key point of the proposed strategy is that it will help to preserve part of the unknown structural attributes by guaranteeing the similar behavior of the real and artificial model on different scales.

99 GENERAL AND MISCELLANEOUS↗

Hierarchial parallel computer architecture defined by computational multidisciplinary mechanics

The goal is to develop an architecture for parallel processors enabling optimal handling of multi-disciplinary computation of fluid-solid simulations employing finite element and difference schemes. The goals, philosphical and modeling directions, static and dynamic poly trees, example problems, interpolative reduction, the impact on solvers are shown in viewgraph form.

Padovan, Joe↗

An infinite branching hierarchy of time-periodic solutions of the Benjamin-Ono equation

We present a new representation of solutions of the Benjamin-Ono equation that are periodic in space and time. Up to an additive constant and a Galilean transformation, each of these solutions is a previously known, multi-periodic solution; however, the new representation unifies the subset of such solutions with a fixed spatial period and a continuously varying temporal period into a single network of smooth manifolds connected together by an infinite hierarchy of bifurcations. Our representation explicitly describes the evolution of the Fourier modes of the solution as well as the particle trajectories in a meromorphic representation of these solutions; therefore, we have also solved the problem of finding periodic solutions of the ordinary differential equation governing these particles, including a description of a bifurcation mechanism for adding or removing particles without destroying periodicity. We illustrate the types of bifurcation that occur with several examples, including degenerate bifurcations not predicted by linearization about traveling waves.

97 MATHEMATICS AND COMPUTING↗

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗

Data Integration Aggregated Model For Nuclear Deployment

The data of a nuclear utility or plant are stored in various isolated forms in different systems. These data have different structures and tools and are, therefore, used independently. The integration of data sources is often needed and is performed manually and on an as-needed basis. The integration of the data would enable creating a data warehouse for a single nuclear power plant (NPP) or multiple plants. A data model contains objects that make up a given domain along with their attributes and relationships and could be used as a standard for exchange between applications for simple integration and data aggregation. After a survey of existing models, it was determined that a new model was required to meet the scope of this problem. DIAMOND has been developed in the form of an ontology to meet these needs. An ontology is simply a data model that also acts as a taxonomy for the domain, organizing the objects in a hierarchy with the most general objects at the top.

Browning, JerenM↗

Evaluating space station applications of automation and robotics technologies from a human productivity point of view

The role that automation, robotics, and artificial intelligence will play in Space Station operations is now beginning to take shape. Although there is only limited data on the precise nature of the payoffs that these technologies are likely to afford there is a general consensus that, at a minimum, the following benefits will be realized: increased responsiveness to innovation, lower operating costs, and reduction of exposure to hazards. Nevertheless, the question arises as to how much automation can be justified with the technical and economic constraints of the program? The purpose of this paper is to present a methodology which can be used to evaluate and rank different approaches to automating the functions and tasks planned for the Space Station. Special attention is given to the impact of advanced automation on human productivity. The methodology employed is based on the Analytic Hierarchy Process. This permits the introduction of individual judgements to resolve the confict that normally arises when incomparable criteria underly the selection process. Because of the large number of factors involved in the model, the overall problem is decomposed into four subproblems individually focusing on human productivity, economics, design, and operations, respectively. The results from each are then combined to yield the final rankings. To demonstrate the methodology, an example is developed based on the selection of an on-orbit assembly system. Five alternatives for performing this task are identified, ranging from an astronaut working in space, to a dexterous manipulator with sensory feedback. Computational results are presented along with their implications. A final parametric analysis shows that the outcome is locally insensitive to all but complete reversals in preference.

Bard, J. F.↗

Data-Consistent Solutions to Stochastic Inverse Problems Using a Probabilistic Multi-Fidelity Method Based on Conditional Densities

In this work, we build upon a recently developed approach for solving stochastic inverse problems based on a combination of measure-theoretic principles and Bayes' rule. We propose a multi-fidelity method to reduce the computational burden of performing uncertainty quantification using high-fidelity models. This approach is based on a Monte Carlo framework for uncertainty quantification that combines information from solvers of various fidelities to obtain statistics on the quantities of interest of the problem. In particular, our goal is to generate samples from a high-fidelity push-forward density at a fraction of the costs of standard Monte Carlo methods, while maintaining flexibility in the number of random model input parameters. Key to this methodology is the construction of a regression model to represent the stochastic mapping between the low- and high-fidelity models, such that most of the computations can be leveraged to the low-fidelity model. To that end, we employ Gaussian process regression and present extensions to multi-level-type hierarchies as well as to the case of multiple quantities of interest. Finally, we demonstrate the feasibility of the framework in several numerical examples.

97 MATHEMATICS AND COMPUTING↗

Light sterile neutrinos, left-right symmetry, and 0νββ decay

We investigate neutrinoless double beta (0νββ) decay rates in minimal left-right symmetric models in presence of relatively light right-handed neutrinos. By use of an effective field theory approach, we systematically include all contributions in the model as well as the dependence of the decay amplitude on the masses of right-handed neutrinos. In type-I and type-II seesaw scenarios, we analyze the impact of right-handed neutrinos heavier than about 10 MeV, showing that this effect can lead to a detection of 0νββ decay in the next-generation experiments even for the normal hierarchy and a relatively large right-handed scale set by the mass of hypothetical right-handed gauge bosons. Finally, we comment on a possible connection between light right-handed neutrinos and the strong CP problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗