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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

A nonlocal theory of an electrostatic sinusoidal density drift instability

The stability of space plasmas in which the macroscopic variables vary in the direction x perpendicular to the magnetic field is usually studied by means of the local approximation, in which the fluctuating potential is assumed to be independent of x. To remove this approximation, a nonlocal problem is studied in which the background density, and hence the fluctuating potentials, are periodic in x. From the linear Vlasov/Poisson equations, a set of coupled, linear, homogeneous, algebraic equations relating the Fourier amplitudes of the eigensolution is derived. The equations are solved numerically and a hierarchy of exact eigenmodes characterized by different growth rates and spatial structures is found. At points where the density gradient is locally zero, the mode amplitude is generally several orders of magnitude lower than the peak amplitude. The dependence of these solutions on the parameters which define the background density perturbation is studied and a correspondence between these nonlocal results and those obtained with the local approximation is demonstrated.

Thomsen, M. F.↗
DOE OSTI2025

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Climatological relationships of severe duststorms in the Great Plains to synoptic weather patterns: A potential for predictability

A data base provided by 35 severe duststorms that occurred between 1968 and 1977 in the central and southern Great Plains allowed construction of a classification scheme of meteorological causes of duststorms, and a telescopic forecast technique for medium range (6 to 48 hour) prediction of severe cyclogenic duststorms. In addition, areal coverage definitions for duststorms based on characteristics of the storms, and a hierarchy of weather causes of severe duststorms were developed. The man machine mix forecast correctly predicted six of seven duststorms observed during the 1976-77 winter, with one overforecast; the machine-only forecast correctly predicted four of the seven duststorms, with one overforecast. Both techniques had problems correctly predicting the duration of severe duststorms.

Woiceshyn, P. M.↗
NASA NTRS1991

Hierarchical simulation of large system

The main problem facing current CAD tools for VLSIs is the large amount of memory required when dealing with large systems, primarily due to the circuit representation used by most current tools. This paper discusses an approach for hierarchical switch-level simulation of digital circuits. The approach exploits the hierarchy to reduce the memory requirements of the simulation, allowing the simulation of circuits that are too large to simulate at one flat level. The approach has been implemented in a hierarchical switch-level simulator, CHAMP, which runs on a SUN workstation. The program performs mixed mode simulation: parts of the circuit can be simulated faster at a behavioral level by supplying a high level software description. CHAMP allows assignable delays, and bidirectional signal flow inside circuit blocks that are represented as transistor networks as well as across the boundaries of higher level blocks. CHAMP is also unique in that it simulates directly from the hierarchical circuit description without flattening to a single level.

Saab, Daniel G.↗
DOE OSTI2021

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗
DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗
DOE OSTI2022

Early-time measure in eternal inflation

In a situation like eternal inflation, where our data is replicated at infinitely-many other space-time events, it is necessary to make a prior assumption about our location to extract predictions. The principle of mediocrity entails that we live at asymptotic late times, when the occupational probabilities of vacua has settled to a near-equilibrium distribution. In this paper we further develop the idea that we instead exist during the approach to equilibrium, much earlier than the exponentially-long mixing time. In this case we are most likely to reside in vacua that are easily accessed dynamically. Using first-passage statistics, we prove that vacua that maximize their space-time volume at early times have: 1. maximal ever-hitting probability; 2. minimal mean first-passage time; and 3. minimal decay rate. These requirements are succinctly captured by an early-time measure. The idea that we live at early times is a predictive guiding principle, with many phenomenological implications. First, our vacuum should lie deep in a funneled region, akin to folding energy landscapes of proteins. Second, optimal landscape regions are characterized by relatively short-lived vacua, with lifetime of order the de Sitter Page time. For our vacuum, this lifetime is ~ 10 130 years, which is consistent with the Standard Model estimate due to Higgs metastability. Third, the measure favors vacua with small, positive vacuum energy. This can address the cosmological constant problem, provided there are sufficiently many vacua in the entire ensemble of funnels. As a concrete example, we study the Bousso-Polchinski lattice of flux vacua, and find that the early-time measure favors lattices with the fewest number of flux dimensions. This favors compactifications with a large hierarchy between the lightest modulus and all other Kähler and complex structure moduli.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Circuit complexity and functionality: A statistical thermodynamics perspective

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge (“wormhole”) connecting the two sides of an anti-de Sitter “eternal” black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length—an important problem in cryptography—as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with “gases of gates.” This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level.

Science & Technology - Other Topics↗
NASA NTRS1991

Excursion set mass functions for hierarchical Gaussian fluctuations

It is pointed out that most schemes for determining the mass function of virialized objects from the statistics of the initial density perturbation field suffer from the cloud-in-cloud problem of miscounting the number of low-mass clumps, many of which would have been subsumed into larger objects. The paper proposes a solution based on the theory of the excursion sets of F(r, R sub f), the four-dimensional initial density perturbation field smoothed with a continuous hierarchy of filters of radii R sub f.

Bond, J. R.↗
NASA NTRS1986

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear.

Harten, A.↗
DOE OSTI2022

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Performance analysis of a robotic system for space-based assembly

A dual arm system for space-based assembly has been under development and experimentation at the Center of Intelligent Robotic Systems for Space Exploration. This paper will describe the components of this system and will then focus on the specific problem of predicting response time of the integrated system. This hierarchical system consists of a task representation and planning level, a coordination level, and an execution level to carry out the desired assembly task. A common modeling methodology based on Petri nets was used to model the various subtasks throughout the levels of the hierarchy. The Petri net model can then be analyzed for liveness and boundedness that, in turn, are used to detect the existence of deadlock or conflict in the system. The model can also be used to calculate the time it will take to complete an assembly task once an operator issues a command. These modeling results are compared with the actual experimental results obtained from carrying out the assembly task.

Desrochers, Alan↗
DOE OSTI2020

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation

This paper combines model-based and data-driven methods to develop a hierarchical, decentralized, robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level consists of robust, model-based, decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data-driven DSE after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level and hence significantly speed up the computational time. The proposed hybrid framework does not depend on the centralized infrastructure of the control centers; thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator locations. Also, the network model is not necessary; thus, a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on the 2,000-bus synthetic Texas system, and shown to be capable of reconstructing the dynamic states of the generators with high accuracy, and of forecasting in the advent of missing data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1990

Navigation in large information spaces represented as hypertext: A review of the literature

The problem addressed is the failure of information-space navigation tools when the space grows to large. The basic goal is to provide the power of the hypertext interface in such a way as to be most easily comprehensible to the user. It was determined that the optimal structure for information is an overlapping, simplified hierarchy. The hierarchical structure should be made obvious to the user, and many of the non-hierarchical links in the information space should either by eliminated, or should be de-emphasized so that the novice user is not confused by them. Only one of the hierarchies should be very simple.

Brown, Marcus↗
NASA NTRS2003

Automated Finite Element Analysis of Elastically-Tailored Plates

A procedure for analyzing and designing elastically tailored composite laminates using the STAGS finite element solver has been presented. The methodology used to produce the elastic tailoring, namely computer-controlled steering of unidirectionally reinforced composite material tows, has been reduced to a handful of design parameters along with a selection of construction methods. The generality of the tow-steered ply definition provides the user a wide variety of options for laminate design, which can be automatically incorporated with any finite element model that is composed of STAGS shell elements. Furthermore, the variable stiffness parameterization is formulated so that manufacturability can be assessed during the design process, plus new ideas using tow steering concepts can be easily integrated within the general framework of the elastic tailoring definitions. Details for the necessary implementation of the tow-steering definitions within the STAGS hierarchy is provided, and the format of the ply definitions is discussed in detail to provide easy access to the elastic tailoring choices. Integration of the automated STAGS solver with laminate design software has been demonstrated, so that the large design space generated by the tow-steering options can be traversed effectively. Several design problems are presented which confirm the usefulness of the design tool as well as further establish the potential of tow-steered plies for laminate design.

Jegley, Dawn C.↗
NASA NTRS1997

High Performance Databases For Scientific Applications

The goal for this task is to develop an Extensible File System (ELFS). ELFS attacks the problem of the following: 1. Providing high bandwidth performance architectures; 2. Reducing the cognitive burden faced by applications programmers when they attempt to optimize; and 3. Seamlessly managing the proliferation of data formats and architectural differences. The approach for ELFS solution consists of language and run-time system support that permits the specification on a hierarchy of file classes.

French, James C.↗
NASA NTRS1989

Reuse at the Software Productivity Consortium

The Software Productivity Consortium is sponsored by 14 aerospace companies as a developer of software engineering methods and tools. Software reuse and prototyping are currently the major emphasis areas. The Methodology and Measurement Project in the Software Technology Exploration Division has developed some concepts for reuse which they intend to develop into a synthesis process. They have identified two approaches to software reuse: opportunistic and systematic. The assumptions underlying the systematic approach, phrased as hypotheses, are the following: the redevelopment hypothesis, i.e., software developers solve the same problems repeatedly; the oracle hypothesis, i.e., developers are able to predict variations from one redevelopment to others; and the organizational hypothesis, i.e., software must be organized according to behavior and structure to take advantage of the predictions that the developers make. The conceptual basis for reuse includes: program families, information hiding, abstract interfaces, uses and information hiding hierarchies, and process structure. The primary reusable software characteristics are black-box descriptions, structural descriptions, and composition and decomposition based on program families. Automated support can be provided for systematic reuse, and the Consortium is developing a prototype reuse library and guidebook. The software synthesis process that the Consortium is aiming toward includes modeling, refinement, prototyping, reuse, assessment, and new construction.

Weiss, David M.↗
DOE OSTI2024

A Generalized approach to the operationalization of Software Quality Models

Comprehensive measures of quality are a research imperative, yet the development of software quality models is a wicked problem. Definitive solutions do not exist and quality is subjective at its most abstract. Definitional measures of quality are contingent on a domain, and even within a domain, the choice of representative characteristics to decompose quality is subjective. Thus, the operationalization of quality models brings even more challenges. A promising approach to quality modeling is the use of hierarchies to represent characteristics, where lower levels of the hierarchy represent concepts closer to real-world observations. Building upon prior hierarchical modeling approaches, we developed the Platform for Investigative software Quality Understanding and Evaluation (PIQUE). PIQUE surmounts several quality modeling challenges because it allows modelers to instantiate abstract hierarchical models in any domain by leveraging organizational tools tailored to their specific contexts. Here, we introduce PIQUE; exemplify its utility with two practical use cases; address challenges associated with parameterizing a PIQUE model; and describe algorithmic techniques that tackle normalization, aggregation, and interpolation of measurements.

Data aggregation↗