Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit”

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 1,603 records · Page 89

AHF: Array-Based Half-Facet Data Structure for Mixed-Dimensional and Non-Manifold Meshes

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixed-dimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

Dyedov, Volodymyr↗

Interface Metaphors for Interactive Machine Learning

To promote more interactive and dynamic machine learn- ing, we revisit the notion of user-interface metaphors. User-interface metaphors provide intuitive constructs for supporting user needs through interface design elements. A user-interface metaphor provides a visual or action pattern that leverages a user’s knowledge of another domain. Metaphors suggest both the visual representations that should be used in a display as well as the interactions that should be afforded to the user. We argue that user-interface metaphors can also offer a method of extracting interaction-based user feedback for use in machine learning. Metaphors offer indirect, context-based information that can be used in addition to explicit user inputs, such as user-provided labels. Implicit information from user interactions with metaphors can augment explicit user input for active learning paradigms. Or it might be leveraged in systems where explicit user inputs are more challenging to obtain. Each interaction with the metaphor provides an opportunity to gather data and learn. We argue this approach is especially important in streaming applications, where we desire machine learning systems that can adapt to dynamic, changing data.

Interactive machine learning↗

Four Perspectives on Human Bias in Visual Analytics

Mixed-initiative visual analytic systems steer analytical models and adapt views by making inferences from users' behavioral patterns with the system. Because such systems rely on incorporating implicit and explicit user feedback, they are particularly susceptible to the injection and propagation of human biases. To ultimately guard against the potentially negative effects of systems biased by human users, we must first qualify what we mean by the term bias. Thus, in this paper we describe four different perspectives on human bias that are particularly relevant to visual analytics. We discuss the interplay of human and computer system biases, particularly their roles in mixed-initiative systems. Given that the term bias is used to describe several different concepts, our goal is to encourage mindful consideration of which perspective on bias researchers take in their work to facilitate a common language in research and development efforts going forward.

visual analytics, mixed-initiative systems, cognit↗

SharP Unified Memory Allocator: An Intent-Based Memory Allocator for Extreme-Scale Systems

The pre-exascale systems will soon be deployed with a deep, complex memory hierarchy composed of many heterogeneous memories. This presents multiple challenges for users including: how to allocate data objects with locality between memories and devices for the various memories in these systems, which includes DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM), and how to perform these allocations while providing portability for their application. Currently, the user can make use of multiple, disjoint libraries to allocate data objects on these memories. However, it is difficult to obtain locality between memories and devices when using libraries that are unaware of each other. This paper presents the Unified Memory Allocator (UMA) of the SHARed data-structure centric Programming abstraction (SharP) library, which provides a unified interface for memory allocations across DRAM, HBM, and NVRAM and is extensible to support future memory types. In addition, the SharP UMA allows for portability between systems by supporting both explicit and implicit, intent-based memory allocations. To demonstrate the ease of use of the SharP UMA, we have extended both Open MPIand OpenSHMEM-Xto support SharP. We validate this work by evaluating the performance implications and intent-based approach with synthetic benchmarks as well as adaptations of the Graph500 benchmark.

Aderholdt, William↗

Manage OpenMP GPU Data Environment Under Unified Address Space

OpenMP has supported the offload of computations to accelerators such as GPUs since version 4.0. A crucial aspect in OpenMP offloading is to manage the accelerator data environment. Currently, this has to be explicitly programmed by users, which is non-trival and often results in suboptimal performance. The unified memory feature available in recent GPU architectures introduces another option, implicit management. However, our experiments show that it incurs several performance issues, especially under GPU memory oversubscription. In this paper, we propose a compiler and runtime collaborative approach to manage OpenMP GPU data under unified memory. In our framework, the compiler performs data reuse analysis to assist runtime data management. The runtime combines static and dynamic information to make optimized data management decisions.We have implement the proposed technology in the LLVM framework. The evaluation shows our method can achieve significant performance improvement for OpenMP GPU offloading.

97 MATHEMATICS AND COMPUTING↗

Replica wormholes and the black hole interior

Recent work has shown how to obtain the Page curve of an evaporating black hole from holographic computations of entanglement entropy. We show how these computations can be justified using the replica trick, from geometries with a spacetime wormhole connecting the different replicas. In a simple model, we study the Page transition in detail by summing replica geometries with different topologies. We compute related quantities in less detail in more complicated models, including JT gravity coupled to conformal matter and the SYK model. Separately, we give a direct gravitational argument for entanglement wedge reconstruction using an explicit formula known as the Petz map; again, a spacetime wormhole plays an important role. We discuss an interpretation of the wormhole geometries as part of some ensemble average implicit in the gravity description.

2D gravity↗

BPS equations and non-trivial compactifications

We consider the problem of finding exact, eleven-dimensional, BPS supergravity solutions in which the compactification involves a non-trivial Calabi-Yau manifold, Y, as opposed to simply a T 6 . Since there are no explicitly-known metrics on non-trivial, compact Calabi-Yau manifolds, we use a non-compact “local model” and take the compactification manifold to be Y = M GH × T 2 , where MGH is a hyper-Kähler, Gibbons-Hawking ALE space. We focus on backgrounds with three electric charges in five dimensions and find exact families of solutions to the BPS equations that have the same four supersymmetries as the three-charge black hole. Our exact solution to the BPS system requires that the Calabi-Yau manifold be fibered over the space-time using compensators on Y. The role of the compensators is to ensure smoothness of the eleven-dimensional metric when the moduli of Y depend on the space-time. The Maxwell field Ansatz also implicitly involves the compensators through the frames of the fibration. In conclusion, we examine the equations of motion and discuss the brane distributions on generic internal manifolds that do not have enough symmetry to allow smearing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On systems of maximal quantum chaos

A remarkable feature of chaos in many-body quantum systems is the existence of a bound on the quantum Lyapunov exponent. An important question is to understand what is special about maximally chaotic systems which saturate this bound. Here we provide further evidence for the ‘hydrodynamic’ origin of chaos in such systems, and discuss hallmarks of maximally chaotic systems. We first provide evidence that a hydrodynamic effective field theory of chaos we previously proposed should be understood as a theory of maximally chaotic systems. We then emphasize and make explicit a signature of maximal chaos which was only implicit in prior literature, namely the suppression of exponential growth in commutator squares of generic few-body operators. We provide a general argument for this suppression within our chaos effective field theory, and illustrate it using SYK models and holographic systems. We speculate that this suppression indicates that the nature of operator scrambling in maximally chaotic systems is fundamentally different to scrambling in non-maximally chaotic systems. We also discuss a simplest scenario for the existence of a maximally chaotic regime at sufficiently large distances even for non-maximally chaotic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Duality web on a 3D Euclidean lattice and manifestation of hidden symmetries

We generalize our previous lattice construction of the abelian bosonization duality in 2 + 1 dimensions to the entire web of dualities as well as the N f = 2 self-duality, via the lattice implementation of a set of modular transformations in the theory space. The microscopic construction provides explicit operator mappings, and allows the manifestation of some hidden symmetries. It also exposes certain caveats and implicit assumptions beneath the usual application of the modular transformations to generate the web of dualities. Lastly, we make brief comments on the non-relativistic limit of the dualities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Unitarity and the Holographic S-Matrix

The bulk S-Matrix can be given a non-perturbative definition in terms of the flat space limit of AdS/CFT. We show that the unitarity of the S-Matrix, ie the optical theorem, can be derived by studying the behavior of the OPE and the conformal block decomposition in the flat space limit. When applied to perturbation theory in AdS, this gives a holographic derivation of the cutting rules for Feynman diagrams. To demonstrate these facts we introduce some new techniques for the analysis of conformal field theories. Chief among these is a method for conglomerating local primary operators O{sub 1} and O{sub 2} to extract the contribution of an individual primary O{sub {Delta},{ell}} in their OPE. This provides a method for isolating the contribution of specific conformal blocks which we use to prove an important relation between certain conformal block coefficients and anomalous dimensions. These techniques make essential use of the simplifications that occur when CFT correlators are expressed in terms of a Mellin amplitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covariant phase space with boundaries

The covariant phase space method of Iyer, Lee, Wald, and Zoupas gives an elegant way to understand the Hamiltonian dynamics of Lagrangian field theories without breaking covariance. The original literature however does not systematically treat total derivatives and boundary terms, which has led to some confusion about how exactly to apply the formalism in the presence of boundaries. In particular the original construction of the canonical Hamiltonian relies on the assumed existence of a certain boundary quantity “B”, whose physical interpretation has not been clear. We here give an algorithmic procedure for applying the covariant phase space formalism to field theories with spatial boundaries, from which the term in the Hamiltonian involving B emerges naturally. Our procedure also produces an additional boundary term, which was not present in the original literature and which so far has only appeared implicitly in specific examples, and which is already nonvanishing even in general relativity with sufficiently permissive boundary conditions. The only requirement we impose is that at solutions of the equations of motion the action is stationary modulo future/past boundary terms under arbitrary variations obeying the spatial boundary conditions; from this the symplectic structure and the Hamiltonian for any diffeomorphism that preserves the theory are unambiguously constructed. We show in examples that the Hamiltonian so constructed agrees with previous results. We also show that the Poisson bracket on covariant phase space directly coincides with the Peierls bracket, without any need for non-covariant intermediate steps, and we discuss possible implications for the entropy of dynamical black hole horizons.

36 MATERIALS SCIENCE↗

Electroweak corrections to the Charm-Top-Quark Contribution to ϵ K

We calculate the leading-logarithmic and next-to-leading-logarithmic electroweak corrections to the charm-top-quark contribution to the effective |ΔS| = 2 Lagrangian, relevant for the parameter ϵ K . We find that these corrections lead to a –0.5% shift in the corresponding Wilson coefficient. Moreover, our calculation removes an implicit ambiguity in the standard-model prediction of ϵ K , by fixing the renormalization scheme of the electroweak input parameters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗

An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

97 MATHEMATICS AND COMPUTING↗

Regulation of Viable and Optimal Cohorts

This study deals with the evolution of (scalar) attributes (resources or income in evolutionary demography or economics, position in traffic management, etc.) of a population of “mobiles” (economic agents, vehicles, etc.). The set of mobiles sharing the same attributes is regarded as an instantaneous cohort described by the number of its elements. The union of instantaneous cohorts during a mobile window between two attributes is a cohort. Given a measure defining the number of instantaneous cohorts, the accumulation of the mobile attributes on a evolving mobile window is the measure of the cohort on this temporal mobile window. Imposing accumulation constraints and departure conditions, this study is devoted to the regulation of the evolutions of the attributes which are1.viable in the sense that the accumulations constraints are satisfied at each instant;2.and, among them, optimal, in the sense that both the duration of the temporal mobile window is maximum and that the accumulation on this temporal mobile window is the largest viable one. This value is the “accumulation valuation” function. Viable and optimal evolutions under accumulation constraints are regulated by an “implicit Volterra integro-differential inclusion” built from the accumulation valuation function, solution to an Hamilton–Jacobi–Bellman partial differential equation under constraints which is constructed for this purpose.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiple-point statistical prediction on fracture networks at Yucca Mountain

In many underground nuclear waste repository systems, such as at Yucca Mountain, water flow rate and amount of water seepage into the waste emplacement drifts are mainly determined by hydrological properties of fracture network in the surrounding rock mass. Natural fracture network system is not easy to describe, especially with respect to its connectivity which is critically important for simulating the water flow field. In this paper, we introduced a new method for fracture network description and prediction, termed multi-point-statistics (MPS). The process of the MPS method is to record multiple-point statistics concerning the connectivity patterns of a fracture network from a known fracture map, and to reproduce multiple-scale training fracture patterns in a stochastic manner, implicitly and directly. It is applied to fracture data to study flow field behavior at the Yucca Mountain waste repository system. First, the MPS method is used to create a fracture network with an original fracture training image from Yucca Mountain dataset. After we adopt a harmonic and arithmetic average method to upscale the permeability to a coarse grid, THM simulation is carried out to study near-field water flow in the surrounding waste emplacement drifts. Our study shows that connectivity or patterns of fracture networks can be grasped and reconstructed by MPS methods. In theory, it will lead to better prediction of fracture system characteristics and flow behavior. Meanwhile, we can obtain variance from flow field, which gives us a way to quantify model uncertainty even in complicated coupled THM simulations. It indicates that MPS can potentially characterize and reconstruct natural fracture networks in a fractured rock mass with advantages of quantifying connectivity of fracture system and its simulation uncertainty simultaneously.

54 ENVIRONMENTAL SCIENCES↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Concepts of association between cancer and ionising radiation: accounting for specific biological mechanisms

The probability that an observed cancer was caused by radiation exposure is usually estimated using cancer rates and risk models from radioepidemiological cohorts and is called assigned share (AS). This definition implicitly assumes that an ongoing carcinogenic process is unaffected by the studied radiation exposure. However, there is strong evidence that radiation can also accelerate an existing clonal development towards cancer. In this work, we define different association measures that an observed cancer was newly induced, accelerated, or retarded. The measures were quantified exemplarily by Monte Carlo simulations that track the development of individual cells. Three biologically based two-stage clonal expansion (TSCE) models were applied. In the first model, radiation initiates cancer development, while in the other two, radiation has a promoting effect, i.e. radiation accelerates the clonal expansion of pre-cancerous cells. The parameters of the TSCE models were derived from breast cancer data from the atomic bomb survivors of Hiroshima and Nagasaki. For exposure at age 30, all three models resulted in similar estimates of AS at age 60. For the initiation model, estimates of association were nearly identical to AS. However, for the promotion models, the cancerous clonal development was frequently accelerated towards younger ages, resulting in associations substantially higher than AS. This work shows that the association between a given cancer and exposure in an affected person depends on the underlying biological mechanism and can be substantially larger than the AS derived from classic radioepidemiology.

63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗