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 271 records · Page 15

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.↗

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.↗

Hierarchy-Direction Selective Approach for Locally Adaptive Sparse Grids

We consider the problem of multidimensional adaptive hierarchical interpolation. We use sparse grids points and functions that are induced from a one dimensional hierarchical rule via tensor products. The classical locally adaptive sparse grid algorithm uses an isotropic refinement from the coarser to the denser levels of the hierarchy. However, the multidimensional hierarchy provides a more complex structure that allows for various anisotropic and hierarchy selective refinement techniques. We consider the more advanced refinement techniques and apply them to a number of simple test functions chosen to demonstrate the various advantages and disadvantages of each method. While there is no refinement scheme that is optimal for all functions, the fully adaptive family-direction-selective technique is usually more stable and requires fewer samples.

Stoyanov, Miroslav K↗

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↗

Transverse momentum broadening of a jet in quark-gluon plasma: an open quantum system EFT

We utilize the technology of open quantum systems in conjunction with the recently developed effective field theory for forward scattering to address the question of massless jet propagation through a weakly-coupled quark-gluon plasma in thermal equilibrium. We discuss various possible hierarchies of scales that may appear in this problem, by comparing thermal scales of the plasma with relevant scales in the effective field theory. Starting from the Lindblad equation, we derive and solve a master equation for the trans- verse momentum distribution of a massless quark jet, at leading orders both in the strong coupling and in the power counting of the effective field theory. Markovian approximation is justified in the weak coupling limit. Using the solution to the master equation, we study the transverse momentum broadening of a jet as a function of the plasma temperature and the time of propagation. We discuss the physical origin of infrared sensitivity that arises in the solution and a way to handle it in the effective field theory formulation. We suspect that the final measurement constraint can only cut-off leading infrared singularities and the solution to the Markovian master equation resums a logarithmic series. This work is a stepping stone towards understanding jet quenching and jet substructure observables on both light and heavy quark jets as probes of the quark-gluon plasma.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Anonymization of Network Traces Data through Condensation-based Differential Privacy

Network traces are considered a primary source of information to researchers, who use them to investigate research problems such as identifying user behavior, analyzing network hierarchy, maintaining network security, classifying packet flows, and much more. However, most organizations are reluctant to share their data with a third party or the public due to privacy concerns. Therefore, data anonymization prior to sharing becomes a convenient solution to both organizations and researchers. Although several anonymization algorithms are available, few of them allow sufficient privacy (organization need), acceptable data utility (researcher need), and efficient data analysis at the same time. This article introduces a condensation-based differential privacy anonymization approach that achieves an improved tradeoff between privacy and utility compared to existing techniques and produces anonymized network trace data that can be shared publicly without lowering its utility value. Our solution also does not incur extra computation overhead for the data analyzer. A prototype system has been implemented, and experiments have shown that the proposed approach preserves privacy and allows data analysis without revealing the original data even when injection attacks are launched against it. When anonymized datasets are given as input to graph-based intrusion detection techniques, they yield almost identical intrusion detection rates as the original datasets with only a negligible impact.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

Baryogenesis, dark matter, and flavor structure in non-thermal moduli cosmology

The appearance of scalar/moduli fields in the early universe, as motivated by string theory, naturally leads to non-thermal “moduli cosmology”. Such cosmology provides a consistent framework where the generation of radiation, baryons, and dark matter can occur while maintaining successful Big Bang Nucleosynthesis and avoiding the cosmological moduli problem. We present a relatively economical construction with moduli cosmology, building on a variety of string-inspired components (e.g. supersymmetry, discrete symmetries, Green-Schwarz anomaly cancellation). We address a range of outstanding problems of particle physics and cosmology simultaneously, including the fermion mass hierarchy and flavor puzzle, the smallness of neutrino masses, baryogenesis and dark matter. Our setup, based on discrete $\mathbb{Z}^R_{12}$ symmetry and anomalous U(1) A , is void of the usual issues plaguing the Minimal Supersymmetric Standard Model, i.e. the μ-problem and the overly-rapid proton decay due to dimension-4,-5 operators. The model is compatible with SU(5) Grand Unification. The smallness of Dirac neutrino masses is automatically established by requiring the cancellation of mixed gravitational-gauge anomalies. The decay of the moduli field provides a common origin for the baryon number and dark matter abundance, explaining the observed cosmic coincidences, Ω B ~ Ω DM .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CFDbuilder

Computational Fluid Dynamics is an important area in scientific computing where, despite the use of multi-threading, obtaining good performance at each core is still extremely challenging. The challenges are primarily due to memory bandwidth limitations and difficulties in using short SIMD engines effectively. One strategy to improve in-core performance involves using a hierarchical data layout made of small cubical structures of the problem states that can fit well in the cache hierarchy. Even for such a hierarchical data layout, finite-differencing equations can be easily expressed but at the expense of some inefficiency. The transformations to overcome the inefficiencies are highly tedious and error-prone. Therefore, we built a source-to-source translator called CFDbuilder to automate the transformations using directives. We see up to 6.92x performance improvement with one of our advection codes using such an approach. We believe such an approach could enable library and application writers to build efficient CFD libraries.

Lin, Pei-Hung↗

A reduced-order model for nonlinear radiative transfer problems based on moment equations and POD-Petrov-Galerkin projection of the normalized Boltzmann transport equation

A data-driven projection-based reduced-order model (ROM) for nonlinear thermal radiative transfer (TRT) problems is presented. The TRT ROM is formulated by (i) a hierarchy of low-order quasidiffusion (aka variable Eddington factor) equations for moments of the radiation intensity and (ii) the normalized Boltzmann transport equation (BTE). The multilevel system of moment equations is derived by projection of the BTE onto a sequence of subspaces which represent elements of the phase space of the problem. Exact closure for the moment equations is provided by the Eddington tensor. A Petrov-Galerkin (PG) projection of the normalized BTE is formulated using a proper orthogonal decomposition (POD) basis representing the normalized radiation intensity over the whole phase space and time. The Eddington tensor linearly depends on the solution of the normalized BTE. By linear superposition of the POD basis functions, a low-rank expansion of the Eddington tensor is constructed with coefficients defined by the PG projected normalized BTE. The material energy balance (MEB) equation is coupled with the effective gray low-order equations which exist on the same dimensional scale as the MEB equation. The resulting TRT ROM is structure and asymptotic preserving. A detailed analysis of the ROM is performed on the classical Fleck-Cummings (F-C) TRT multigroup test problem in 2D geometry. Numerical results are presented to demonstrate the ROM's effectiveness in the simulation of radiation wave phenomena. Importantly, the ROM is shown to produce solutions with sufficiently high accuracy while using low-rank approximation of the normalized BTE solution. Essential physical characteristics of supersonic radiation wave are preserved in the ROM solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Coarse Spaces by Algebraic Multigrid: Multigrid Convergence and Upscaled Error Estimates

We give an overview of a number of algebraic multigrid methods targeting finite element discretization problems. The focus is on the properties of the constructed hierarchy of coarse spaces that guarantee (two-grid) convergence. In particular, a necessary condition known as 'weak approximation property', and a sufficient one, referred to as 'strong approximation property' are discussed. Their role in proving convergence of the TG method (as iterative method) and also on the approximation properties of the AMG coarse spaces if used as discretization tool is pointed out. Some preliminary numerical results illustrating the latter aspect are also reported.

97 MATHEMATICS AND COMPUTING↗

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.↗

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↗

Kinetic Modeling of Biological Systems

The dynamics of how its constituent components interact define the spatio-temporal response of a natural system to stimuli. Modeling the kinetics of the processes that represent a biophysical system has long been pursued with the aim of improving our understanding of the studied system. Due to the unique properties of biological systems, in addition to the usual difficulties faced in modeling the dynamics of physical or chemical systems, biological simulations encounter difficulties that result from intrinsic multiscale and stochastic nature of the biological processes. This chapter discusses the implications for simulation of models involving interacting species with very low copy numbers, which often occur in biological systems and give rise to significant relative fluctuations. The conditions necessitating the use of stochastic kinetic simulation methods and the mathematical foundations of the stochastic simulation algorithms are presented. How the well-organized structural hierarchies often seen in biological systems can lead to multiscale problems, and possible ways to address the encountered computational difficulties are discussed. We present the details of the existing kinetic simulation methods, and discuss their strengths and shortcomings. A list of the publicly available kinetic simulation tools and our reflections for future prospects are also provided.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

Adoption of image-driven machine learning for microstructure characterization and materials design: A Perspective

Microstructure characterization enables the development of structure-processing-property relationships critical to several research areas within the broad field of materials science, from alloy design to the assessment of corrosion resistance, and failure analysis. Conventional approaches to material characterization have relied on either qualitative inference by the human ex-pert or software applications that can extract high-level features from images, such as boundary segmentation, average grain diameter, etc. Such approaches rely heavily on subject matter expert user intervention and knowledge of what phases or more generally, what microstructural features, are of interest. The recent surge in the adoption of machine learning techniques to address problems in materials engineering has brought with it an increased interest and application of Image Driven Machine Learning (IDML) approaches. In this work, we review the applications of IDML to the field of materials characterization. A canonical hierarchy of stages is defined, which when put sequentially together completes an IDML study: problem definition, dataset building, model selection and training, model evaluation, and integration with existing instrumentation or simulation workflow. The studies reviewed in this work are analyzed from the perspective of each of these stages. Such a review permits agranular assessment of the field, for example the impact of IDML on materials characterization at the nanoscale, the size of a typical dataset required to train a semantic segmentation model on electron microscopy images, ubiquitousness of transfer learning in the domain, etc. Finally, we discuss the importance of interpretability and explainability in the field of IDML for materials characterization, and provide an overview of two emerging techniques in the field: semantic segmentation and generative adversarial networks.

Baskaran, Arun↗