Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 163 records · Page 9

Imagine Moving Off the Planet

Moving off the planet will be a defining moment of this century as landing on the Moon was in the last. For that to happen for humans to go where humans cannot go-- simulation is the sole solution. NASA supports simulation for life-cycle activities: design, analysis, test, checkout, operations, review and training. We contemplate time spans of a century and more, teams dispersed to different planets and the need for systems that endure or adapt as missions, teams and technology change. Without imagination such goals are impossible. But with imagination we can go outside our present perception of reality to think about and take action on what has been, is and, especially, what might be. Consciously maturing an imagined, possibly workable, idea through framing it to optimization to design, and building the product provides us with a new approach to innovation and simulation fidelity. We address options, analyze, test and make improvements in how we think and work. Each step includes increasingly exact information about costs, schedule, who will be needed, where, when and how. NASA i integrating such thinking into its Exploration Product Realization Hierarchy for simulation and analysis, test and verification, and stimulus response goals. Technically NASA follows a timeline of studies, analysis, definition, design, development and operations with concurrent documentation. We have matched this Product Realization Hierarchy with a continuum from image to realization that incorporates commitment, current and needed research and communication to ensure superior and creative problem solving as well as advances in simulation. One result is a new approach to collaborative systems. Another is a distributed observer network prototyped using game engine technology bringing advanced 3-D simulation of a simulation to the desktop enabling people to develop shared consensus of its meaning. Much of the value of simulation comes from developing in people their ability to make good decisions and reflexes supporting impressive achievement. Synthesizing imagination systematically into our work - and thus our success - is a challenge. NASA engineers have inventive minds, and the task is determining how best to enable them to devise the simulation and other innovations that will make a story so clear and so intellectually sound that people can carry out the mission for 50-100 years. This demands skills and knowledge traditionally under-respected and under-represented in technology organizations. But we are beginning to see that the process encourages efficiency and enables us to attain more effective results. We have to elicit imaginative, intelligent and effective ways to make better use than ever of the minds we have and will have available. We have to accept the challenge to accomplish tasks among dispersed interdisciplinary teams who must overcome changing priorities and technology, time and distance in order to maximize interactivity and innovation as never before. Attention to the process of innovation is a practical means to increase the efficiency of our intelligence. We have an obligation to reexamine and improve the process by which we approach and exercise innovation as we accept the charge to move off the planet.

Elfrey, Priscilla R.↗

A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks

Hyperbolic neural networks have recently gained significant attention due to their promising results on several graph problems including node classification and link prediction. The primary reason for this success is the effectiveness of hyperbolic space in capturing the inherent hierarchy of graph datasets. However, they are limited in terms of generalization, scalability, and have inferior performance when applied to non-hierarchical datasets. In this paper, we take a completely different perspective for modeling hyperbolic networks and answer the following question: is an Euclidean model able to approximate a function or behavior in the hyperbolic space? Extending the universal approximation theory developed for Euclidean models, We draw an analogy from the hyperbolic components to the Euclidean counterparts and conclude that, in order to capture hierarchical features, it is possible to generalize hyperbolic models to be a special case of Euclidean models with the proposed Pseudo-Poincaré technique. We applied our non-linear hyperbolic normalization to the current state-of-the-art homogeneous and multi-relational graph networks and demonstrate significant improvements in performance compared to both Euclidean and hyperbolic counterparts. The primary impact of this work lies in its ability to capture hierarchical features in the Euclidean space, and thus, can replace hyperbolic networks without any loss in performance metrics while simultaneously leveraging the power of Euclidean networks such as interpretability and efficient execution of various model components.

Khatir, Mehrdad↗

Viscous-fluid reaction to a torsionally oscillating spheroid Linearized steady-state weak-separation solution

For both the linearized prolate and oblate problems, perturbation series for all orders of eccentricity are obtained. The 'weak separation' method of solving partial-differential-equation boundary-value problems assumes that each linearly independent solution is a sum of products of single-variable functions. The method is applied to a hierarchy of partial differential equations. The weak-separation solutions are constructed by generalizing only the Bessel functions of the homogeneous solution.

Tompkins, D. R., Jr.↗

Reliable vision-guided grasping

Automated assembly of truss structures in space requires vision-guided servoing for grasping a strut when its position and orientation are uncertain. This paper presents a methodology for efficient and robust vision-guided robot grasping alignment. The vision-guided grasping problem is related to vision-guided 'docking' problems. It differs from other hand-in-eye visual servoing problems, such as tracking, in that the distance from the target is a relevant servo parameter. The methodology described in this paper is hierarchy of levels in which the vision/robot interface is decreasingly 'intelligent,' and increasingly fast. Speed is achieved primarily by information reduction. This reduction exploits the use of region-of-interest windows in the image plane and feature motion prediction. These reductions invariably require stringent assumptions about the image. Therefore, at a higher level, these assumptions are verified using slower, more reliable methods. This hierarchy provides for robust error recovery in that when a lower-level routine fails, the next-higher routine will be called and so on. A working system is described which visually aligns a robot to grasp a cylindrical strut. The system uses a single camera mounted on the end effector of a robot and requires only crude calibration parameters. The grasping procedure is fast and reliable, with a multi-level error recovery system.

Nicewarner, Keith E.↗

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

REYNO: A Reactive Hydrodynamics Modeling Suite

REYNO is a Python library that is primarily designed as a platform for the agile development and testing of novel reactive flow models. Equations of state and multi-step rate laws can be implemented using the provided class hierarchy with different thermodynamic closure conditions. The library includes a one-dimensional Lagrangian hydrodynamic solver to simulate multi-material reactive or inert problems in planar, cylindrical, or spherical coordinates. Custom time-dependent boundary conditions are also available for problems such as ramp compression. This document describes the different numerical methods and algorithms that are included in REYNO.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Control automation in undersea manipulation systems

The requirements for the successful use of automated manipulation in an undersea environment are discussed, and initial specifications for systems which share control between a human operator and an autonomous control element are established. Areas of concern include: (1) objectives of automation; (2) characteristics of the underwater task; (3) hierarchy of control algorithms; (4) man/machine interface; (5) sensory feedback; and (6) general system organization. Special emphasis is placed on the solutions to the problem of controlling an undersea manipulator which is capable of performing certain automatic functions and implementing these solutions using current technology. Current capabilities for control automation are summarized.

Freedy, A.↗

Reliable vision-guided grasping

Automated assembly of truss structures in space requires vision-guided servoing for grasping a strut when its position and orientation are uncertain. This paper presents a methodology for efficient and robust vision-guided robot grasping alignment. The vision-guided grasping problem is related to vision-guided 'docking' problems. It differs from other hand-in-eye visual servoing problems such as tracking in that the distance from the target is a relevant servo parameter. The methodology described in this paper is a hierarchy of levels in which the vision/robot interface is decreasingly 'intelligent', and increasingly fast. Speed is achieved primarily by information reduction. This reduction exploits the use of region-of-interest windows in the image plane and feature motion prediction. These reductions invariably require stringent assumptions about the image. Therefore, at a higher level, these assumptions are verified using slower, more reliable methods. This hierarchy provides for robust error recovery in that when a lower-level routine fails, the next-higher routine will be called and so on. A working system is described which visually aligns a robot to grasp a cylindrical strut. The system uses a single camera mounted on the end effector of a robot and requires only crude calibration parameters. The grasping procedure is fast and reliable, with a multi-level error recovery system.

Nicewarner, Keith E.↗

Enhancing Early Systems R&D Capabilities with Systems —Theoretic Process Analysis

Systems engineering today faces a wide array of challenges, ranging from new operational environments to disruptive technological — necessitating approaches to improve research and development (R&D) efforts. Yet, emphasizing the Aristotelian argument that the “whole is greater than the sum of its parts” seems to offer a conceptual foundation creating new R&D solutions. Invoking systems theoretic concepts of emergence and hierarchy and analytic characteristics of traceability, rigor, and comprehensiveness is potentially beneficial for guiding R&D strategy and development to bridge the gap between theoretical problem spaces and engineering-based solutions. In response, this article describes systems–theoretic process analysis (STPA) as an example of one such approach to aid in early-systems R&D discussions. STPA—a ‘top-down’ process that abstracts real complex system operations into hierarchical control structures, functional control loops, and control actions—uses control loop logic to analyze how control actions (designed for desired system behaviors) may become violated and drive the complex system toward states of higher risk. By analyzing how needed controls are not provided (or out of sequence or stopped too soon) and unneeded controls are provided (or engaged too long), STPA can help early-system R&D discussions by exploring how requirements and desired actions interact to either mitigate or potentially increase states of risk that can lead to unacceptable losses. This article will demonstrate STPA's benefit for early-system R&D strategy and development discussion by describing such diverse use cases as cyber security, nuclear fuel transportation, and US electric grid performance. Together, the traceability, rigor, and comprehensiveness of STPA serve as useful tools for improving R&D strategy and development discussions. In conclusion, leveraging STPA as well as related systems engineering techniques can be helpful in early R&D planning and strategy development to better triangulate deeper theoretical meaning or evaluate empirical results to better inform systems engineering solutions.

42 ENGINEERING↗

Two new SciDAC institutes promote mathematical tools and software technology for high-performance computing

Bigger is often said to be better, and the newest extreme-scale computers certainly are bigger, with millions of processing units. Moreover, the breadth of science performed on the U.S. Department of Energy (DOE) computing facilities is expanding, with new technology such as artificial intelligence emerging. These advances are exciting, creating new opportunities for scientific discovery; however, they also raise new questions for scientists who want to exploit these advances for tackling more complex problems. Will my simulation code be able to utilize the accelerators in extreme-scale computing systems? Can I take advantage of the deepening memory hierarchy in heterogeneous processors? Is there a way around bottlenecks caused by the widening ratio of peak floating-point operations per second to I/0 bandwidth? How can I manage my huge amounts of data effectively? Can I analyze data in situ, or must I transfer it to offline storage for later analysis? To address such questions, DOE announced that it is providing $57.5 million over the next five years for two multidisciplinary teams — FASTMath and RAPIDS2 — to develop new tools and techniques to harness supercomputers for scientific discovery. The teams, called SciDAC Institutes, are part of the Scientific Discovery through Advanced Computing program.

97 MATHEMATICS AND COMPUTING↗

Space-Time Error Representation and Estimation in Navier-Stokes Calculations

The mathematical framework for a-posteriori error estimation of functionals elucidated by Eriksson et al. [7] and Becker and Rannacher [3] is revisited in a space-time context. Using these theories, a hierarchy of exact and approximate error representation formulas are presented for use in error estimation and mesh adaptivity. Numerical space-time results for simple model problems as well as compressible Navier-Stokes flow at Re = 300 over a 2D circular cylinder are then presented to demonstrate elements of the error representation theory for time-dependent problems.

Barth, Timothy J.↗

Mark 4A antenna control system data handling architecture study

A high-level review was conducted to provide an analysis of the existing architecture used to handle data and implement control algorithms for NASA's Deep Space Network (DSN) antennas and to make system-level recommendations for improving this architecture so that the DSN antennas can support the ever-tightening requirements of the next decade and beyond. It was found that the existing system is seriously overloaded, with processor utilization approaching 100 percent. A number of factors contribute to this overloading, including dated hardware, inefficient software, and a message-passing strategy that depends on serial connections between machines. At the same time, the system has shortcomings and idiosyncrasies that require extensive human intervention. A custom operating system kernel and an obscure programming language exacerbate the problems and should be modernized. A new architecture is presented that addresses these and other issues. Key features of the new architecture include a simplified message passing hierarchy that utilizes a high-speed local area network, redesign of particular processing function algorithms, consolidation of functions, and implementation of the architecture in modern hardware and software using mainstream computer languages and operating systems. The system would also allow incremental hardware improvements as better and faster hardware for such systems becomes available, and costs could potentially be low enough that redundancy would be provided economically. Such a system could support DSN requirements for the foreseeable future, though thorough consideration must be given to hard computational requirements, porting existing software functionality to the new system, and issues of fault tolerance and recovery.

Briggs, H. C.↗

Planning in subsumption architectures

A subsumption planner using a parallel distributed computational paradigm based on the subsumption architecture for control of real-world capable robots is described. Virtual sensor state space is used as a planning tool to visualize the robot's anticipated effect on its environment. Decision sequences are generated based on the environmental situation expected at the time the robot must commit to a decision. Between decision points, the robot performs in a preprogrammed manner. A rudimentary, domain-specific partial world model contains enough information to extrapolate the end results of the rote behavior between decision points. A collective network of predictors operates in parallel with the reactive network forming a recurrrent network which generates plans as a hierarchy. Details of a plan segment are generated only when its execution is imminent. The use of the subsumption planner is demonstrated by a simple maze navigation problem.

Chalfant, Eugene C.↗

The Functional Breakdown Structure (FBS) and Its Relationship to Life Cycle Cost

The Functional Breakdown Structure (FBS) is a structured, modular breakdown of every function that must be addressed to perform a generic mission. It is also usable for any subset of the mission. Unlike a Work Breakdown Structure (WBS), the FBS is a function-oriented tree, not a product-oriented tree. The FBS details not products, but operations or activities that should be performed. The FBS is not tied to any particular architectural implementation because it is a listing of the needed functions, not the elements, of the architecture. The FBS for Space Transportation Systems provides a universal hierarchy of required functions, which include ground and space operations as well as infrastructure - it provides total visibility of the entire mission. By approaching the systems engineering problem from the functional view, instead of the element or hardware view, the SPST has created an exhaustive list of potential requirements which the architecture designers can use to evaluate the completeness of their designs. This is a new approach that will provide full accountability of all functions required to perform the planned mission. It serves as a giant check list to be sure that no functions are omitted, especially in the early architectural design phase. A significant characteristic of a FBS is that if architecture options are compared using this approach, then any missing or redundant elements of each option will be ' identified. Consequently, valid Life Cycle Costs (LCC) comparisons can be made. For example, one architecture option might not need a particular function while another option does. One option may have individual elements to perform each of three functions while another option needs only one element to perform the three functions. Once an architecture has been selected, the FBS will serve as a guide in development of the work breakdown structure, provide visibility of those technologies that need to be further developed to perform required functions, and help identify the personnel skills required to develop and operate the architecture. It also wifi allow the systems engineering activities to totally integrate each discipline to the maximum extent possible and optimize at the total system level, thus avoiding optimizing at the element level (stove-piping). In addition, it furnishes a framework that wifi help prevent over or under specifying requirements because all functions are identified and all elements are aligned to functions.

DeHoff, Bryan↗

Flavor as an Incomplete Structure: Conceptual Questions and the Role of DUNE

Flavor remains one of the most successful yet least understood structures of the Standard Model. The discovery of the Higgs boson completed the electroweak account of mass generation, but did not explain the origin of fermion families, mass hierarchies, or mixing patterns. In this sense, flavor can be regarded as an empirically successful but conceptually incomplete structure. Neutrinos occupy a particularly sensitive place within this problem: their masses are tiny, their mixing is large, and their mass-generation mechanism may differ from that of charged fermions. In this article, we discuss flavor as an open conceptual problem and argue that DUNE, as a phased program spanning precision oscillation measurements and sensitivity to BSM and dark-sector phenomena, provides a powerful framework for testing the self-consistency and possible limits of the present three-flavor description. In particular, the complementarity between the long-baseline program and the Phase I near-detector complex, together with the DUNE-PRISM strategy for controlling interaction-model systematics and enabling data-driven near-to-far predictions, makes DUNE especially well-suited to search for small, correlated departures from the minimal flavor framework.

Montanari, Claudio S. [Fermilab; INFN, Pavia] (ORC↗

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗

Pareto solutions in multicriteria optimization under uncertainty

We present and analyze several definitions of Pareto optimality for multicriteria optimization or decision problems with uncertainty primarily in their objective function values. In comparison to related notions of Pareto robustness, we first provide a full characterization of an alternative efficient set hierarchy that is based on six different ordering relations both with respect to the multiple objectives and a possibly finite, countably infinite or uncountable number of scenarios. We then establish several scalarization results for the generation of the corresponding efficient points using generalized weighted-sum and epsilon-constraint techniques. Finally, we leverage these scalarization results to also derive more general conditions for the existence of efficient points in each of the corresponding optimality classes, under suitable assumptions.

97 MATHEMATICS AND COMPUTING↗

Bridging Current Indirect and Future Direct Estimates of Convective Mass Flux Toward Quantifying the Role of Convective Cores on Anvil Area Time Tendencies

Anvil cloud spatial extent is strongly driven by convective mass flux. However, the lack of convective mass flux observations precludes global analyses of the functional relationship between anvil cloud area growth tendencies and convective areal coverage and vertical mass flux. Partly informed by analyses of a hierarchy of WRF mesoscale convective system (MCS) simulations, in this presentation, we discuss new work on estimating convective mass flux by way of an approach that casts the problem of quantifying convective mass flux into terms related to diabatic heating vertical structure, convective area and tropospheric stability. We demonstrate the usefulness of this approach at the MCS spatial scale via development of a simple, robust model that analytically connects system-scale convective mass flux and anvil cloud area growth rates. We show that the model predicts anvil area size changes in agreement with those observed in a global convective system tracking database (TOOCAN). An additional advantage of this approach for estimating convective mass flux is that it bridges future satellite mission plans for directly observing convective mass flux (e.g., AOS) with longer-record observations made by TRMM, GPM and satellite sounder mission data (the latter used for estimating stability) that, when combined, can be used for inferring convective mass fluxes at the MCS spatial scale spanning slowly changing, diverse environments. An evaluation and bridging of both direct and indirect approaches supports convective process analyses varying over longer time periods in this “era of convection.”

convective mass flux↗