Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hierarchy”

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 235 records · Page 13

EC-Bench: A Benchmark for Enzyme Commission Number Prediction

Enzymes are proteins that catalyze specific biochemical reactions in cells. Enzyme Commission (EC) numbers are used to annotate enzymes in a four-level hierarchy that classifies enzymes based on the specific chemical reactions they catalyze. Accurate EC number prediction is essential for understanding enzyme functions. Despite the availability of numerous methods for predicting EC numbers from protein sequences, there is no unified framework for evaluating and studying such methods systematically. This gap limits the ability of the community to identify the most effective approaches for enzyme annotation. We introduce EC-Bench, a benchmark for EC number prediction, consisting of 1) an initial representative set of existing methods (including homology-based, deep learning, contrastive learning, and language model methods), 2) existing and novel accuracy and efficiency performance metrics, and 3) selected datasets to allow for comprehensive comparative study. EC-Bench is open-source and provides a framework for researchers to not only compare among existing methods objectively under uniform conditions, but also to introduce and effectively evaluate performance of new methods in a comparative framework. To demonstrate the utility of EC-Bench, we perform extensive experimentation to compare the existing EC number prediction methods and establish their advantages and disadvantages in a variety of prediction tasks, namely “exact EC number prediction”, “EC number completion” and (partial or additional) “EC number recommendation”. We find wide variation in the performance of different methods, but also subtle but potentially useful differences in the performance of different methods across tasks and for different parts of the EC hierarchy.

59 BASIC BIOLOGICAL SCIENCES↗

Patient-Reported Outcomes in Pediatric Cancer Registration Trials: A US Food and Drug Administration Perspective

Pediatric patient-reported outcome (PRO) data can help inform the US Food and Drug Administration’s (FDA’s) benefit-risk assessment of cancer therapeutics by quantifying symptom and functional outcomes from the patient’s perspective. This study assessed use of PROs in commercial pediatric oncology trials submitted to the FDA for regulatory review. FDA databases were searched to identify pediatric oncology product applications approved between 1997 and 2020. Sponsor-submitted documents were reviewed to determine whether PRO data were collected, which instruments were used, and the quality of collected data (ie, sample size, completion rates, and use of fit-for-purpose instruments). The role of PROs in each trial (endpoint hierarchy) was also recorded in addition to whether any PRO endpoints were included in product labeling. We reviewed 17 pediatric oncology applications, 4 of which included PRO data: denosumab, tisagenlecleucel, larotrectinib, and selumetinib. In these 4 instances, PROs served as exploratory endpoints and were not incorporated in product labeling. Trials that collected PRO data were phase II or phase I/II single-arm studies with sample sizes of 28 to 88 patients. Symptomatic adverse events (AEs) were characterized using clinician-reported Common Terminology Criteria for Adverse Events (CTCAE) without additional patient self-report. PROs were infrequently used in pediatric cancer registration trials. When PROs were used, PRO data were limited by lack of a clear research objective and corresponding prospective statistical analysis plan. Contemporary PRO symptom libraries, such as the National Cancer Institute’s Pediatric PRO-CTCAE, may provide an opportunity to better evaluate the occurrence and impact of symptomatic AEs, from the patient’s perspective, in pediatric oncology trials.

Oncology↗

Emergence of vorticity and viscous stress in finite-scale quantum hydrodynamics

The Madelung equations offer a hydrodynamic description of quantum systems, from single particles to quantum fluids. In this formulation, the probability density is mapped onto the fluid density and the phase is treated as a scalar potential generating the velocity field. As examples of potential flows, quantum fluids described in this way are inherently irrotational, but quantum vortices may arise at discrete points where the phase is undefined. In this paper, starting from this irrotational description of a quantum fluid, a coarse-graining procedure is applied to arrive at a macroscopic description of the quantum fluid in terms of a hierarchy of moments in which the role of velocity is played by a Favre average of the microscopic velocity field. This hierarchy is truncated using an explicit closure derived from an expansion in a finite length scale. The resulting coarse-grained fields are shown to allow for finite vorticity at any point in the fluid. Additionally, it is shown that this vorticity obeys a similar equation to the vorticity equation in classical hydrodynamics and includes a vortex-stretching term. The particular closure employed here also gives rise to a novel stress term in the fluid equations, which in the appropriate limit appears analogous to an artificial viscous stress from computational fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement structures in quantum field theories: Negativity cores and bound entanglement in the vacuum

Here, the many-body entanglement between two finite (size-d) disjoint vacuum regions of noninteracting lattice scalar field theory in one spatial dimension, i.e., a (d A × d B ) mixed Gaussian continuous variable system, is locally transformed into a tensor-product core of (1 A × 1 B ) mixed entangled pairs. Accessible entanglement within these core pairs exhibits an exponential hierarchy and as such identifies the structure of dominant region modes from which vacuum entanglement could be extracted into a spatially separated pair of quantum detectors. Beyond the core, the remaining modes of the halo are determined to be AB separable in isolation, as well as separable from the core. However, state preparation protocols that distribute entanglement in the form of (1 A × 1 B ) mixed core pairs are found to require additional entanglement in the halo that is obscured by classical correlations. This inaccessible (bound) halo entanglement is found to mirror the accessible entanglement, but with a step behavior as the continuum is approached. It remains possible that alternate initialization protocols that do not utilize the exponential hierarchy of core-pair entanglement may require less inaccessible entanglement. Entanglement consolidation is expected to persist in higher dimensions and may aid classical and quantum simulations of asymptotically free gauge field theories, such as quantum chromodynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Detectability of collective neutrino oscillation signatures in the supernova explosion of a 8.8 M ⊙ star

In order to investigate the impact of collective neutrino oscillations (CNOs) on the neutrino signal from a nearby supernova, we perform three-flavor neutrino oscillation simulations employing the multiangle effect. The background hydrodynamic model is based on the neutrino hydrodynamic simulation of a 8.8 M ⊙ progenitor star. In this work, we find that CNO commences after some 100 ms post bounce. Before this, CNO is suppressed by matter-induced decoherence. In the inverted mass hierarchy, the spectrum of $\bar{ν}_e$ becomes softer after the onset of CNO. To evaluate the detectability of this modification, we define a hardness ratio between the number of high energy neutrino events and low energy neutrino events adopting a fixed critical energy. We show that Hyper-Kamiokande (HK) can distinguish the effect of CNO for supernova distances out to ~ 10 kpc. On the other hand, for the normal mass hierarchy, the spectrum of ν e becomes softer after the onset of CNO, and we show that DUNE can distinguish this feature for supernova distances out to ~ 10 kpc . More work is necessary to optimize the best value of critical energy for maximum sensitivity. We also show that if the spectrum of $\bar{ν}_e$ in HK becomes softer due to CNO, the spectrum of $ν_e$ in DUNE becomes harder, and vice versa. These synergistic observations in $\bar{ν}_e$ and $ν_e$, by HK and DUNE, respectively, will be an intriguing opportunity to test the occurrence of CNO.

79 ASTRONOMY AND ASTROPHYSICS↗

Time dependent signatures of core-collapse supernova neutrinos at HALO

In this work, we calculate the response of a lead-based detector, such as the Helium and Lead Observatory (HALO) or its planned upgrade HALO-1kt to a Galactic core-collapse supernova. We pay particular attention to the time dependence of the reaction rates. All reaction rates decrease as the neutrino luminosity exponentially drops during the cooling period, but the ratio of one-neutron (1n) to two-neutron (2n) event rates in HALO is independent of this overall decrease. Nevertheless, we find that this ratio still changes with time due to the changing character of neutrino flavor transformations with the evolving conditions in the supernova. In the case of inverted hierarchy, this is caused by the fact that the spectral splits become less and less sharp with the decreasing luminosity. In the case of normal hierarchy, it is caused by the passage of the shock wave through the Mikheyev-Smirnov-Wolfenstein resonance region. However, in both cases, we find that the change in the ratio of 1n to 2n event rates is limited to a few percent.

79 ASTRONOMY AND ASTROPHYSICS↗

Impact of recent updates to neutrino oscillation parameters on the effective Majorana neutrino mass in 0 ν β β decay

We investigate how recent updates to neutrino oscillation parameters and the sum of neutrino masses influence the sensitivity of neutrinoless double-beta ( 0 ν β β ) decay experiments. Incorporating the latest cosmological constraints on the sum of neutrino masses and laboratory measurements on oscillations, we determine the sum of neutrino masses for both the normal hierarchy (NH) and the inverted hierarchy (IH). Our analysis reveals a narrow range for the sum of neutrino masses, approximately 0.06 eV / c 2 for NH and 0.102 eV / c 2 for IH. Utilizing these constraints, we calculate the effective Majorana masses for both NH and IH scenarios, establishing the corresponding allowed regions. Importantly, we find that the minimum neutrino mass is nonzero, as constrained by the current oscillation parameters. Additionally, we estimate the half-life of 0 ν β β decay using these effective Majorana masses for both NH and IH. Our results suggest that upcoming ton-scale experiments will comprehensively explore the IH scenario, while 100-ton-scale experiments will effectively probe the parameter space for the NH scenario, provided the background index can achieve 1 event/kton-year in the region of interest. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Mapping and probing Froggatt-Nielsen solutions to the quark flavor puzzle

The Froggatt-Nielsen (FN) mechanism is an elegant solution to the flavor problem. In its minimal application to the quark sector, the different quark types and generations have different charges under a 𝑈⁢(1)𝑋 flavor symmetry. The SM Yukawa couplings are generated below the flavor breaking scale with hierarchies dictated by the quark charge assignments. Only a handful of charge assignments are generally considered in the literature. We analyze the complete space of possible charge assignments with |𝑋 𝑞𝑖 | ≤ 4 and perform both a set of Bayesian-inspired numerical scans and an analytical spurion analysis to identify those charge assignments that reliably generate SM-like quark mass and mixing hierarchies. The resulting set of top-20 flavor charge assignments significantly enlarges the viable space of FN models but is still compact enough to enable focused phenomenological study. We then apply our numerical methodology to demonstrate that these distinct charge assignments result in the generation of correlated flavor-violating four-quark operators characterized by significantly varied strengths, potentially differing substantially from the possibilities previously explored in the literature. Future precision measurement of Δ⁢𝐹 = 2 observables, along with increasingly accurate SM predictions, may therefore enable us to distinguish among otherwise equally plausible FN charges, thus shedding light on the UV structure of the flavor sector.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Physics-constrained, low-dimensional models for magnetohydrodynamics: First-principles and data-driven approaches

Plasmas are highly nonlinear and multiscale, motivating a hierarchy of models to understand and describe their behavior. However, there is a scarcity of plasma models of lower fidelity than magnetohydrodynamics (MHD), although these reduced models hold promise for understanding key physical mechanisms, efficient computation, and real-time optimization and control. Galerkin models, obtained by projection of the MHD equations onto a truncated modal basis, and data-driven models, obtained by modern machine learning and system identification, can furnish this gap in the lower levels of the model hierarchy. This work develops a reduced-order modeling framework for compressible plasmas, leveraging decades of progress in projection-based and data-driven modeling of fluids. We begin by formalizing projection-based model reduction for nonlinear MHD systems. To avoid separate modal decompositions for the magnetic, velocity, and pressure fields, we introduce an energy inner product to synthesize all of the fields into a dimensionally consistent, reduced-order basis. Next, we obtain an analytic model by Galerkin projection of the Hall-MHD equations onto these modes. We illustrate how global conservation laws constrain the model parameters, revealing symmetries that can be enforced in data-driven models, directly connecting these models to the underlying physics. We demonstrate the effectiveness of this approach on data from high-fidelity numerical simulations of a three-dimensional spheromak experiment. Finally, this manuscript builds a bridge to the extensive Galerkin literature in fluid mechanics and facilitates future principled development of projection-based and data-driven models for plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗

Case Study of Using Kokkos and SYCLs Performance-Portable Frameworks for Milc-Dslash Benchmark on NVIDIA, AMD and Intel GPUs

Six of the top ten supercomputers in the TOP500 list from June 2021 rely on NVIDIA GPUs to achieve their peak compute bandwidth. With the announcement of Aurora, Frontier, and El Capitan, Intel and AMD have also entered the domain of providing GPUs for scientific computing. A consequence of the increased diversity in the GPU landscape is the emergence of portable programming models such as Kokkos, SYCL, OpenCL, and OpenMP, which allow application developers to maintain a single-source code across a diverse range of hardware architectures. While the portable frameworks try to optimize the compute resource usage on a given architecture, it is the programmers responsibility to expose parallelism in an application that can take advantage of thousands of processing elements available on GPUs. In this paper, we introduce a GPU-friendly parallel implementation of Milc-Dslash that exposes multiple hierarchies of parallelism in the algorithm. Milc-Dslash was designed to serve as a benchmark with highly optimized matrix-vector multiplications to measure the resource utilization on the GPU systems. The parallel hierarchies in the Milc-Dslash algorithm are mapped onto a target hardware using Kokkos and SYCL programming models. We present the performance achieved by Kokkos and SYCL implementations of Milc-Dslash on NVIDIA A100 GPU, AMD MI100 GPU, and Intel Gen9 GPU. Additionally, we compare the Kokkos and SYCL performances with those obtained from the versions written in CUDA and HIP programming models on NVIDIA A100 GPU and AMD MI100 GPU, respectively.

Dufek, Amanda S↗

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗

AMM: Adaptive Multilinear Meshes

Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data. Usual solutions are designed broadly along two themes: reducing data precision, e.g., through compression, or adapting data resolution, e.g., using spatial hierarchies. Additionally, recent research suggests that combining the two approaches, i.e., adapting both resolution and precision simultaneously, can offer significant gains over using them individually. However, there currently exist no practical solutions to creating and evaluating such representations at scale. In this work, we present a new resolution-precision-adaptive representation to support hybrid data reduction schemes and offer an interface to existing tools and algorithms. Through novelties in spatial hierarchy, our representation, Adaptive Multilinear Meshes (AMM), provides considerable reduction in the mesh size. AMM creates a piecewise multilinear representation of uniformly sampled scalar data and can selectively relax or enforce constraints on conformity, continuity, and coverage, delivering a flexible adaptive representation. AMM also supports representing the function using mixed-precision values to further the achievable gains in data reduction. We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams. By interfacing with state-of-the-art rendering tools through VTK, we demonstrate the practical and computational advantages of our representation for visualization techniques. With an open-source release of our tool to create AMM, we make such evaluation of data reduction accessible to the community, which we hope will foster new opportunities and future data reduction schemes.

97 MATHEMATICS AND COMPUTING↗

Progressive Tree-Based Compression of Large-Scale Particle Data

Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions. Our proposed methods thus target all three phases of a tree-based particle compression pipeline, namely tree construction, tree traversal, and node encoding. In conclusion, the improved efficacy and flexibility of these methods over existing compressors are demonstrated through extensive experimentation, using a wide range of scientific particle datasets.

97 MATHEMATICS AND COMPUTING↗

Advanced Multilevel Monte Carlo Methods

This article reviews the application of some advanced Monte Carlo techniques in the context of multilevel Monte Carlo (MLMC). MLMC is a strategy employed to compute expectations, which can be biassed in some sense, for instance, by using the discretization of an associated probability law. The MLMC approach works with a hierarchy of biassed approximations, which become progressively more accurate and more expensive. Additionally, using a telescoping representation of the most accurate approximation, the method is able to reduce the computational cost for a given level of error versus i.i.d. sampling from this latter approximation. All of these ideas originated for cases where exact sampling from couples in the hierarchy is possible. This article considers the case where such exact sampling is not currently possible. We consider some Markov chain Monte Carlo and sequential Monte Carlo methods, which have been introduced in the literature, and we describe different strategies that facilitate the application of MLMC within these methods.

97 MATHEMATICS AND COMPUTING↗

Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application to finite volume discretizations), and (iii) for providing a sequence of nonlinear operators in a full approximation scheme for solving nonlinear pressure equations discretized by the conservative two-point flux approximation. Finally, we illustrate the potential of the proposed multilevel technique in all three applications on a number of popular benchmark problems used in reservoir simulation.

multilevel Monte Carlo↗

Parallel Element-based Algebraic Multigrid for H (c url ) and H (div) Problems Using the ParELAG Library

This paper presents the use of element-based algebraic multigrid (AMGe) hierarchies, implemented in the ParELAG (Parallel Element Agglomeration Algebraic Multigrid Upscaling and Solvers) library, to produce multilevel preconditioners and solvers for H (c url ) and H (div) formulations. ParELAG constructs hierarchies of compatible nested spaces, forming an exact de Rham sequence on each level. This allows the application of hybrid smoothers on all levels and AMS (Auxiliary-space Maxwell Solver) or ADS (Auxiliary-space Divergence Solver) on the coarsest levels, obtaining complete multigrid cycles. Numerical results are presented, showing the parallel performance of the proposed methods. As a part of the exposition, this paper demonstrates some of the capabilities of ParELAG and outlines some of the components and procedures within the library.

97 MATHEMATICS AND COMPUTING↗

Open quantum systems for quarkonia

I review recent applications of the open quantum system framework in the understanding of quarkonium suppression in heavy-ion collisions, which has been used as a probe of the quark–gluon plasma for decades. The derivation of the Lindblad equations for quarkonium in both the quantum Brownian motion and the quantum optical limits and their semiclassical counterparts is explained. The hierarchy of time scales assumed in the derivation is justified from the separation of energy scales in nonrelativistic effective field theories of QCD. Physical implications of the open quantum system approach are also discussed. Finally, I list some open questions for future studies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗