Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic”

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 541 records · Page 30

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

Chain trajectories, domain shapes, and terminal boundaries in block copolymers

The packing geometry of macromolecules in complex mesophases is of key importance to self-organization in synthetic and biological soft materials. While approximate or heuristic models rely on often-untested assumptions about how flexible molecules “fit in” to distinct locations of complex assemblies, physical assemblies derive from ensembles of fluctuating conformations, obscuring the connection between mesophase geometry and the underlying arrangements. Here, we present an approach to extract and analyze features of molecular packing in diblock block copolymer (BCP) melts, a prototypical soft matter system, based on the statistical description of chain conformations in self-consistent field (SCF) theory. We show how average BCP chain trajectories in ordered morphologies can be analyzed from the SCF-derived orientational order parameter of chain segments. We use these extracted trajectories to analyze the features of local packing geometry, including chain bending and tilt, as well as the terminal boundaries that delineate distinct domains in ordered BCP morphologies. In conclusion, we illustrate this analysis by focusing on measurable features of packing frustration in 2D (columnar) and 3D (spherical and bicontinuous) morphologies, notably establishing an explicit link between chain conformations in complex morphologies and their medial geometry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Diving into traversable wormholes: Diving into traversable wormholes

We study various aspects of wormholes that are made traversable by an interaction beween the two asymptotic boundaries. We concentrate on the case of nearly-math formula gravity and discuss a very simple mechanical picture for the gravitational dynamics. We derive a formula for the two sided correlators that includes the effect of gravitational backreaction, which limits the amount of information we can send through the wormhole. We emphasize that the process can be viewed as a teleportation protocol where the teleportee feels nothing special as he/she goes through the wormhole. We discuss some applications to the cloning paradox for old black holes. We point out that the same formula we derived for math formula gravity is also valid for the simple SYK quantum mechanical theory, around the thermofield double state. We present a heuristic picture for this phenomenon in terms of an operator growth model. Finally, we show that a similar effect is present in a completely classical chaotic system with a large number of degrees of freedom.

79 ASTRONOMY AND ASTROPHYSICS↗

Context-aided analysis of community evolution in networks

Here, we are interested in detecting and analyzing global changes in dynamic networks (networks that evolve with time). More precisely, we consider changes in the activity distribution within the network, in terms of density (ie, edge existence) and intensity (ie, edge weight). Detecting change in local properties, as well as individual measurements or metrics, has been well studied and often reduces to traditional statistical process control. In contrast, detecting change in larger scale structure of the network is more challenging and not as well understood. We address this problem by proposing a framework for detecting change in network structure based on separate pieces: a probabilistic model for partitioning nodes by their behavior, a label-unswitching heuristic, and an approach to change detection for sequences of complex objects. We examine the performance of one instantiation of such a framework using mostly previously available pieces. The dataset we use for these investigations is the publicly available New York City Taxi and Limousine Commission dataset covering all taxi trips in New York City since 2009. Using it, we investigate the evolution of an ensemble of networks under different spatiotemporal resolutions. We identify the community structure by fitting a weighted stochastic block model. In conclusion, we offer insights on different node ranking and clustering methods, their ability to capture the rhythm of life in the Big Apple, and their potential usefulness in highlighting changes in the underlying network structure.

97 MATHEMATICS AND COMPUTING↗

Graph-based optimization of epitope coverage for vaccine antigen design

Epigraph is a recently developed algorithm that enables the computationally efficient design of single or multi-antigen vaccines to maximize the potential epitope coverage for a diverse pathogen population. Potential epitopes are defined as short contiguous stretches of proteins, comparable in length to T-cell epitopes. This optimal coverage problem can be formulated in terms of a directed graph, with candidate antigens represented as paths that traverse this graph. Epigraph protein sequences can also be used as the basis for designing peptides for experimental evaluation of immune responses in natural infections to highly variable proteins. The epigraph tool suite also enables rapid characterization of populations of diverse sequences from an immunological perspective. Fundamental distance measures are based on immunologically relevant shared potential epitope frequencies, rather than simple Hamming or phylogenetic distances. Here, we provide a mathematical description of the epigraph algorithm, include a comparison of different heuristics that can be used when graphs are not acyclic, and we describe an additional tool we have added to the web-based epigraph tool suite that provides frequency summaries of all distinct potential epitopes in a population. Lastly, we also show examples of the graphical output and summary tables that can be generated using the epigraph tool suite and explain their content and applications.

60 APPLIED LIFE SCIENCES↗

Colloid Transport in Saturated Porous Media: Elimination of Attachment Efficiency in a New Colloid Transport Model

A new colloid transport model is introduced that is conceptually simple but captures the essential features of complicated attachment and detachment behavior of colloids when conditions of secondary minimum attachment exist. This model eliminates the empirical concept of collision efficiency; the attachment rate is computed directly from colloid filtration theory. Also, a new paradigm for colloid detachment based on colloid population heterogeneity is introduced. Assuming the dispersion coefficient can be estimated from tracer behavior, this model has only two fitting parameters: (1) the fraction of colloids that attach irreversibly and (2) the rate at which reversibly attached colloids leave the surface. These two parameters were correlated to physical parameters that control colloid transport such as the depth of the secondary minimum and pore water velocity. Given this correlation, the model serves as a heuristic tool for exploring the influence of physical parameters such as surface potential and fluid velocity on colloid transport. This model can be extended to heterogeneous systems characterized by both primary and secondary minimum deposition by simply increasing the fraction of colloids that attach irreversibly.

Landkamer, Lee L.↗

Improved Accuracy for Automated Communication Pattern Characterization Using Communication Graphs and Aggressive Search Space Pruning

An understanding of a parallel application’s communication behavior is useful for a range of activities including debugging and optimization, job scheduling, target system selection, and system design. Because it can be challenging to understand communication behavior, especially for those who lack expertise or who are not familiar with the application, I and two colleagues recently developed an automated, search-based approach for recognizing and parameterizing application communication behavior using a library of common communication patterns. This initial approach was effective for characterizing the behavior of many workloads, but I identified some combinations of communication patterns for which the method was inefficient or would fail. In this paper, I discuss one such troublesome pattern combination and propose modifications to the recognition method to handle it. Specifically, I propose an alternative approach that uses communication graphs instead of traditional communication matrices to improve recognition accuracy for collective communication operations, and that uses a non-greedy recognition technique to avoid search space dead-ends that trap the original greedy recognition approach. My modified approach uses aggressive search space pruning and heuristics to control the potential for state explosion caused by its non-greedy pattern recognition method. I demonstrate the improved recognition accuracy and pruning efficacy of the modified approach using several synthetic and real-world communication pattern combinations.

Roth, Philip↗

Trigger Detection for the sPHENIX Experiment via Bipartite Graph Networks with Set Transformer

Trigger (interesting events) detection is crucial to high-energy and nuclear physics experiments because it improves data acquisition efficiency. It also plays a vital role in facilitating the downstream offline data analysis process. The sPHENIX detector, located at the Relativistic Heavy Ion Collider in Brookhaven National Laboratory, is one of the largest nuclear physics experiments on a world scale and is optimized to detect physics processes involving charm and beauty quarks. Furthermore, these particles are produced in collisions involving two proton beams, two gold nuclei beams, or a combination of the two and give critical insights into the formation of the early universe. This paper presents a model architecture for trigger detection with geometric information from two fast silicon detectors. Transverse momentum is introduced as an intermediate feature from physics heuristics. We also prove its importance through our training experiments. Each event consists of tracks and can be viewed as a graph. A bipartite graph neural network is integrated with the attention mechanism to design a binary classification model. Compared with the state-of-the-art algorithm for trigger detection, our model is parsimonious and increases the accuracy and the AUC score by more than 15%.

97 MATHEMATICS AND COMPUTING↗

Profile Generation for GPU Targets

GPU accelerators are ubiquitous, but their ecosystem is far less evolved than the host one. Compiler heuristics are often tuned for CPUs and reused for GPU. Similarly, tooling and more evolved optimization techniques are historically not available on GPU targets. In this work, we address one of these shortcomings and enable profile generation and profile-guided optimizations (PGO) for GPU targets. While this is only a single step towards a CPU equivalent ecosystem for offload devices, it shows how old misconceptions on the limitations of GPUs are often not warranted anymore. Through our implementation in LLVM/Offload, we enable device-side PGO for full scientific applications and open up tooling opportunities, including code coverage analysis and compiler-built-in roofline analysis. Our evaluation highlights the performance implications of profile generation, the insights gained from these profiles, and the (missed) opportunities in utilizing the information for GPU compilation.

McDonough, Ethan Luis [Lawrence Livermore National↗

Flexible Bandwidth Scheduling for Streaming Data Movement Over Dedicated Networks

A wide range of scientific disciplines are generating large amounts of data at a high speed, which must be transferred to remote sites for real-time processing. Reserving bandwidths over dedicated channels in high-performance networks (HPNs) within a specified time interval has proved to be an effective solution to such high-demanding data transfer. Given a bandwidth reservation request, if the desired bandwidth within the specified time interval cannot be satisfied, most of the existing scheduling algorithms simply reject the request, which would immediately terminate the application. One reasonable approach to mitigate this issue is to provide an alternative bandwidth reservation option to schedule the desired bandwidth within the time interval closest to the specified one. We propose a flexible bandwidth reservation algorithm that considers both the best and alternative bandwidth reservation options for a given request. Extensive simulations are conducted to show the superior performance of the proposed scheduling algorithm compared with a heuristic approach adapted from existing scheduling algorithms.

Zuo, Liudong↗

Large U(1) charges from flux breaking in 4D F-theory models

We study the massless charged spectrum of U(1) gauge fields in F-theory that arise from flux breaking of a nonabelian group. The U(1) charges that arise in this way can be very large. In particular, using vertical flux breaking, we construct an explicit 4D F-theory model with a U(1) decoupled from other gauge sectors, in which the massless/light fields have charges as large as 657. This result greatly exceeds prior results in the literature. We argue heuristically that this result may provide an upper bound on charges for light fields under decoupled U(1) factors in the F-theory landscape. We also show that the charges can be even larger when the U(1) is coupled to other gauge groups.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bragg-Primakoff axion photoconversion in crystal detectors

Abstract Axions and axion-like pseudoscalar particles with dimension-5 couplings to photons exhibit coherent Primakoff scattering with ordered crystals at keV energy scales, making for a natural detection technique in searches for solar axions. We find that there are large suppressive corrections, potentially greater than a factor of$$ \mathcal{O} $$ O (10 3 ), to the coherent enhancement when taking into account absorption of the final state photon. This effect has already been accounted for in light-shining-through-wall experiments through the language of Darwin classical diffraction, but is missing from the literature in the context of solar axion searches that use a matrix element approach. We extend the treatment of the event rate with a heuristic description of absorption effects to bridge the gap between these two languages. Furthermore, we explore the Borrmann effect of anomalous absorption in lifting some of the event rate suppression by increasing the coherence length of the conversion. We study this phenomenon in Ge, NaI, and CsI crystal experiments and its impact on the projected sensitivities of SuperCDMS, LEGEND, and SABRE to the solar axion parameter space. Lastly, we comment on the reach of multi-tonne scale crystal detectors and strategies to maximize the discovery potential of experimental efforts in this vein.

Physics↗

Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity

We use the framework of fixed-point BCFT tensor networks to present a microscopic CFT derivation of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS 3 /CFT 2 , for both bipartite and multipartite settings. These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification via cutting-and-gluing CFT path integrals. Employing modular flow in the large-c limit, we demonstrate that these intrinsic CFT manipulations reproduce bulk geometric prescriptions, without assuming the AdS/CFT dictionary. The emergence of bulk geometry is traced to coarse-graining over heavy states in the large-c limit. Universal coarse-grained BCFT data for compact 2D CFTs, through the relation to Liouville theory with ZZ boundary conditions, yields hyperbolic geometry on the Cauchy slice. The corresponding averaged replica partition functions reproduce all candidate EWs, arising from different averaging patterns, with the dominant one providing the correct RE and EW. In this way, many heuristic tensor-network intuitions in toy models are made precise and established directly from intrinsic CFT data.

AdS-CFT correspondence↗

Nucleation is more than critical: A case study of the electroweak phase transition in the NMSSM

Electroweak baryogenesis is an attractive mechanism to generate the baryon asymmetry of the Universe via a strong first order electroweak phase transition. We compare the phase transition patterns suggested by the vacuum structure at the critical temperatures, at which local minima are degenerate, with those obtained from computing the probability for nucleation via tunneling through the barrier separating local minima. Heuristically, nucleation becomes difficult if the barrier between the local minima is too high, or if the distance (in field space) between the minima is too large. As an example of a model exhibiting such behavior, we study the Next-to-Minimal Supersymmetric Standard Model, whose scalar sector contains two SU(2) doublets and one gauge singlet. We find that the calculation of the nucleation probabilities prefers different regions of parameter space for a strong first order electroweak phase transition than the calculation based solely on the critical temperatures. Our results demonstrate that analyzing only the vacuum structure via the critical temperatures can provide a misleading picture of the phase transition patterns, and, in turn, of the parameter space suitable for electroweak baryogenesis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The graviton four-point function in de Sitter space

We compute the tree-level late-time graviton four-point correlation function, and the related quartic wavefunction coefficient, for Einstein gravity in de Sitter spacetime. We derive this result in several ways: by direct calculation, using the in-in formalism and the wavefunction of the universe; by a heuristic derivation leveraging the flat space wave-function coefficient; and by using the boostless cosmological bootstrap, in particular the combination of the cosmological optical theorem, the amplitude limit, and the manifestly local test. We find agreement among the different methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Weak Gravity Conjecture in three dimensions

We study weakly coupled U(1) theories in AdS 3 , their associated charged BTZ solutions, and their charged spectra. We find that modular invariance of the holographic dual two-dimensional CFT and compactness of the gauge group together imply the existence of charged operators with conformal dimension significantly below the black hole threshold. We regard this as a form of the Weak Gravity Conjecture (WGC) in three dimensions. We also explore the constraints posed by modular invariance on a particular discrete $\mathbb{Z}$ N symmetry which arises in our discussion. In this case, modular invariance does not guarantee the existence of light $\mathbb{Z}$ N -charged states. We also highlight the differences between our discussion and the usual heuristic arguments for the WGC based on black hole remnants.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗