Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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,639 records · Page 91

Wang–Landau approach to the simulation of water clusters

The Wang–Landau Monte Carlo method [Wang FG, Landau DP. Efficient, multiple-range random walk algorithm to calculate the density of states. Phys Rev Lett. 2001;86:2050-2053; Determining the density of states for classical statistical models: a random walk algorithm to produce a flat histogram. Phys Rev E. 2001;64:056101] has been established as an effective computational approach for studying complex systems. In this study, we review the properties of 6 popular empirical water potentials, including a recently proposed explicit 3-body potential, obtained by applying the Wang–Landau method to the simulation of water clusters. Finally, comparing to numerous classical and first principle calculations, we show that several classical water models can provide a consistent description of the structural and thermodynamical properties of water clusters partially in agreement of ab initio results, although they were designed to reproduce macroscopic properties of water at ambient conditions.

74 ATOMIC AND MOLECULAR PHYSICS↗

STRONG LENS TIME DELAY CHALLENGE. I. EXPERIMENTAL DESIGN

The time delays between point-like images in gravitational lens systems can be used to measure cosmological parameters. The number of lenses with measured time delays is growing rapidly; the upcoming Large Synoptic Survey Telescope (LSST) will monitor ∼10{sup 3} strongly lensed quasars. In an effort to assess the present capabilities of the community, to accurately measure the time delays, and to provide input to dedicated monitoring campaigns and future LSST cosmology feasibility studies, we have invited the community to take part in a ''Time Delay Challenge'' (TDC). The challenge is organized as a set of ''ladders'', each containing a group of simulated data sets to be analyzed blindly by participating teams. Each rung on a ladder consists of a set of realistic mock observed lensed quasar light curves, with the rungs' data sets increasing in complexity and realism. The initial challenge described here has two ladders, TDC0 and TDC1. TDC0 has a small number of data sets, and is designed to be used as a practice set by the participating teams. The (non-mandatory) deadline for completion of TDC0 was the TDC1 launch date, 2013 December 1. The TDC1 deadline was 2014 July 1. Here we give an overview of the challenge, we introduce a set of metrics that will be used to quantify the goodness of fit, efficiency, precision, and accuracy of the algorithms, and we present the results of TDC0. Thirteen teams participated in TDC0 using 47 different methods. Seven of those teams qualified for TDC1, which is described in the companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

FAST VARIABILITY AND MILLIMETER/IR FLARES IN GRMHD MODELS OF Sgr A* FROM STRONG-FIELD GRAVITATIONAL LENSING

We explore the variability properties of long, high-cadence general relativistic magnetohydrodynamic (GRMHD) simulations across the electromagnetic spectrum using an efficient, GPU-based radiative transfer algorithm. We focus on both standard and normal evolution (SANE) and magnetically arrested disk (MAD) simulations with parameters that successfully reproduce the time-averaged spectral properties of Sgr A* and the size of its image at 1.3 mm. We find that the SANE models produce short-timescale variability with amplitudes and power spectra that closely resemble those inferred observationally. In contrast, MAD models generate only slow variability at lower flux levels. Neither set of models shows any X-ray flares, which most likely indicates that additional physics, such as particle acceleration mechanisms, need to be incorporated into the GRMHD simulations to account for them. The SANE models show strong, short-lived millimeter/infrared (IR) flares, with short (≲1 hr) time lags between the millimeter and IR wavelengths, that arise from the combination of short-lived magnetic flux tubes and strong-field gravitational lensing near the horizon. Such events provide a natural explanation for the observed IR flares with no X-ray counterparts.

79 ASTRONOMY AND ASTROPHYSICS↗

Intermediate Palomar Transient Factory: Realtime Image Subtraction Pipeline

A fast-turnaround pipeline for realtime data reduction plays an essential role in discovering and permitting followup observations to young supernovae and fast-evolving transients in modern time-domain surveys. In this paper, we present the realtime image subtraction pipeline in the intermediate Palomar Transient Factory. By using highperformance computing, efficient databases, and machine-learning algorithms, this pipeline manages to reliably deliver transient candidates within 10 minutes of images being taken. Our experience in using high-performance computing resources to process big data in astronomy serves as a trailblazer to dealing with data from large-scale time-domain facilities in the near future.

79 ASTRONOMY AND ASTROPHYSICS↗

ZMPY3D: accelerating protein structure volume analysis through vectorized 3D Zernike moments and Python-based GPU integration

Abstract Motivation Volumetric 3D object analyses are being applied in research fields such as structural bioinformatics, biophysics, and structural biology, with potential integration of artificial intelligence/machine learning (AI/ML) techniques. One such method, 3D Zernike moments, has proven valuable in analyzing protein structures (e.g., protein fold classification, protein–protein interaction analysis, and molecular dynamics simulations). Their compactness and efficiency make them amenable to large-scale analyses. Established methods for deriving 3D Zernike moments, however, can be inefficient, particularly when higher order terms are required, hindering broader applications. As the volume of experimental and computationally-predicted protein structure information continues to increase, structural biology has become a “big data” science requiring more efficient analysis tools. Results This application note presents a Python-based software package, ZMPY3D, to accelerate computation of 3D Zernike moments by vectorizing the mathematical formulae and using graphical processing units (GPUs). The package offers popular GPU-supported libraries such as CuPy and TensorFlow together with NumPy implementations, aiming to improve computational efficiency, adaptability, and flexibility in future algorithm development. The ZMPY3D package can be installed via PyPI, and the source code is available from GitHub. Volumetric-based protein 3D structural similarity scores and transform matrix of superposition functionalities have both been implemented, creating a powerful computational tool that will allow the research community to amalgamate 3D Zernike moments with existing AI/ML tools, to advance research and education in protein structure bioinformatics. Availability and implementation ZMPY3D, implemented in Python, is available on GitHub (https://github.com/tawssie/ZMPY3D) and PyPI, released under the GPL License.

Lai, Jhih-Siang (ORCID:0000000156775890)↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Optimizing searches for electromagnetic counterparts of gravitational wave triggers

With the detection of a binary neutron star system and its corresponding electromagnetic counterparts, a new window of transient astronomy has opened. Due to the size of the sky localization regions, which can span hundreds to thousands of square degrees, there are significant benefits to optimizing tilings for these large sky areas. The rich science promised by gravitational wave astronomy has led to the proposal for a variety of proposed tiling and time allocation schemes, and for the first time, we make a systematic comparison of some of these methods. We find that differences of a factor of 2 or more in efficiency are possible, depending on the algorithm employed. For this reason, with future surveys searching for electromagnetic counterparts, care should be taken when selecting tiling, time allocation, and scheduling algorithms to optimize counterpart detection.

79 ASTRONOMY AND ASTROPHYSICS↗

Supernova electron-neutrino interactions with xenon in the nEXO detector

Electron-neutrino charged-current interactions with xenon nuclei were modeled in the nEXO neutrinoless double-𝛽 decay detector (∼5 metric ton, 90% 136 Xe, 10% 134 Xe) to evaluate its sensitivity to supernova neutrinos. Predictions for event rates and detectable signatures were modeled using the Model of Argon Reaction Low Energy Yields (MARLEY) event generator. We find good agreement between MARLEY’s predictions and existing theoretical calculations of the inclusive cross sections at supernova neutrino energies. The interactions modeled by MARLEY were simulated within the nEXO simulation framework and were run through an example reconstruction algorithm to determine the detector’s efficiency for reconstructing these events. The simulated data, incorporating the detector response, were used to study the ability of nEXO to reconstruct the incident electron-neutrino spectrum and these results were extended to a larger xenon detector of the same isotope enrichment. We estimate that nEXO will be able to observe electron-neutrino interactions with xenon from supernovae as far as 5–8 kpc from Earth, while the ability to reconstruct incident electron-neutrino spectrum parameters from observed interactions in nEXO is limited to closer supernovae.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Phase diagram of the lattice G{sub 2} Higgs model

We study the phases and phase transition lines of the finite temperature G{sub 2} Higgs model. Our work is based on an efficient local hybrid Monte-Carlo algorithm which allows for accurate measurements of expectation values, histograms, and susceptibilities. On smaller lattices we calculate the phase diagram in terms of the inverse gauge coupling {beta} and the hopping parameter {kappa}. For {kappa}{yields}0 the model reduces to G{sub 2} gluodynamics and for {kappa}{yields}{infinity} to SU(3) gluodynamics. In both limits the system shows a first order confinement-deconfinement transition. We show that the first order transitions at asymptotic values of the hopping parameter are almost joined by a line of first order transitions. A careful analysis reveals that there exists a small gap in the line where the first order transitions turn into continuous transitions or a crossover region. For {beta}{yields}{infinity} the gauge degrees of freedom are frozen and one finds a nonlinear O(7) sigma model which exhibits a second order transition from a massive O(7) symmetric to a massless O(6) symmetric phase. The corresponding second order line for large {beta} remains second order for intermediate {beta} until it comes close to the gap between the two first order lines. Besides this second order line and the first order confinement-deconfinement transitions we find a line of monopole-driven bulk transitions which do not interfere with the confinement-deconfinment transitions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solving the nuclear pairing model with neural network quantum states

In this work, we present a variational Monte Carlo method that solves the nuclear many-body problem in the occupation number formalism exploiting an artificial neural network representation of the groundstate wave function. A memory-efficient version of the stochastic reconfiguration algorithm is developed to train the network by minimizing the expectation value of the Hamiltonian. We benchmark this approach against widely used nuclear many-body methods by solving a model used to describe pairing in nuclei for different types of interaction and different values of the interaction strength. Despite its polynomial computational cost, our method outperforms coupled-cluster and provides energies that are in excellent agreement with the numerically-exact full configuration interaction values.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗

Learning energy-based representations of quantum many-body states

Efficient representation of quantum many-body states on classical computers is a problem of practical importance. An ideal representation of a quantum state combines a succinct characterization informed by the structure and symmetries of the system along with the ability to predict the physical observables of interest. Several machine-learning approaches have been recently used to construct such classical representations, which enable predictions of observables and account for physical symmetries. However, the structure of a quantum state typically gets lost unless a specialized is employed based on prior knowledge of the system. Moreover, most such approaches give no information about what states are easier to learn in comparison with others. Here, we propose a generative energy-based representation of quantum many-body states derived from Gibbs distributions used for modeling the thermal states of classical spin systems. Based on the prior information on a family of quantum states, the energy function can be specified by a small number of parameters using an explicit low-degree polynomial or a generic parametric family such as neural nets and can naturally include the known symmetries of the system. Our results show that such a representation can be efficiently learned from data using exact algorithms in a form that enables the prediction of expectation values of physical observables. Importantly, the structure of the learned energy function provides a natural explanation for the difficulty of learning an energy-based representation of a given class of quantum states when measured in a certain basis. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Invited: Software defined accelerators from learning tools environment

Next generation systems, such as edge devices, will need to provide efficient processing of machine learning (ML) algorithms along several metrics, including energy, performance, area, and latency. However, the quickly evolving field of ML makes it extremely difficult to generate accelerators able to support a wide variety of algorithms. At the same time, designing accelerators in hardware description languages (HDLs) by hand is hard and time consuming, and does not allow quick exploration of the design space. In this paper we present the Software Defined Accelerators From Learning Tools Environment (SODALITE), an automated open source high-level ML framework-to-verilog compiler targeting ML Application-Specific Integrated Circuits (ASICs) chiplets. The SODALITE approach will implement optimal designs by seamlessly combining custom components generated through high-level synthesis (HLS) with templated and fully tunable Intellectural Properties (IPs) and macros, integrated in an extendable resource library. Through a closed loop design space exploration engine, developers will be able to quickly explore their hardware designs along different dimensions.

High-Level Synthesis, Accelerators, Hardware-Softw↗

FatMan vs. LittleBoy: Scaling Up Linear Algebraic Operations in Scale-Out Data Platforms

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are highly desirable to enable efficient processing over millions of data points. To this end, we present a matrix manipulation approach to effectively scale-up each node in a scale-out data parallel platform such as Apache Spark. Specifically, we enable hardware acceleration for matrix multiplications in a distributed Spark setup without user intervention. Our approach supports both dense and sparse distributed matrices, and provides flexible control of acceleration by matrix density. We demonstrate the benefit of our approach for generalized matrix multiplication operations over large matrices with up to four billion elements. To connect the effectiveness of our approach with machine learning applications, we performed Gramian matrix computation via generalized matrix multiplications. Our experiments show that our approach achieves more than 2× performance speed-up, and up to 96.1% computation improvement, compared to a state of the art Spark MLlib for dense matrices.

97 MATHEMATICS AND COMPUTING↗

Real-time Event Detection Using Rank Signatures of Real-world PMU Data

Timely detection of power system events is a crucial task, which can facilitate the implementation of remedial actions to improve reliability, resiliency, and security of the system. Meanwhile, the widespread deployment of phasor measurement units (PMUs) makes it possible to develop data-driven event detection techniques. However, relying purely on data without incorporating domain knowledge for the event detection task in power systems poses substantial security and stability risks due to issues associated with data misinterpretation and model accuracy. In this regard, we propose a real-time event detection method using real-world PMU data by incorporating domain knowledge to adequately capture the event signatures. Specifically, we track the change in rank signatures of PMU data to accurately localize the events. To optimize the detection process, we incorporate an offline Bayesian optimization algorithm to tune the parameters by efficiently searching for the best values. The experiments using the real-world PMU dataset from a U.S. interconnection show that the proposed event detection approach can efficiently detect the events from PMU data streams with high accuracy.

Ghasemkhani, Amir↗

Exaflops Biomedical Knowledge Graph Analytics

We are motivated by newly proposed methods for mining large-scale corpora of scholarly publications (e.g., full biomedical literature), which consists of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover relationships among concepts. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as an all-pairs shortest paths (APSP) and validate connective paths against curated biomedical knowledge graphs (e.g., Spoke). In this context, we present Coast (Exascale Communication-Optimized All-Pairs Shortest Path) and demonstrate 1.004 EF/s on 9,200 Frontier nodes (73,600 GCDs). We develop hyperbolic performance models (HYPERMOD), which guide optimizations and parametric tuning. The proposed Coast algorithm achieved the memory constant parallel efficiency of 99% in the single-precision tropical semiring. Looking forward, Coast will enable the integration of scholarly corpora like PubMed into the Spoke biomedical knowledge graph.

Kannan, Ramakrishnan {ramki}↗

Optimizing Lossy Compression Rate-Distortion from Automatic Online Selection between SZ and ZFP

With ever-increasing volumes of scientific data produced by high-performance computing applications, significantly reducing data size is critical because of limited capacity of storage space and potential bottlenecks on I/O or networks in writing/reading or transferring data. SZ and ZFP are two leading BSD licensed open source C/C++ libraries for compressed floating-point arrays that support high throughput read and write random access. However, their performance is not consistent across different data sets and across different fields of some data sets, which raises the need for an automatic online (during compression) selection between SZ and ZFP, with minimal overhead. In this paper, the automatic selection optimizes the rate-distortion, an important statistical quality metric based on the signal-to-noise ratio. To optimize for rate-distortion, we investigate the principles of SZ and ZFP. We then propose an efficient online, low-overhead selection algorithm that predicts the compression quality accurately for two compressors in early processing stages and selects the best-fit compressor for each data field. Here, we implement the selection algorithm into an open-source library, and we evaluate the effectiveness of our proposed solution against plain SZ and ZFP in a parallel environment with 1,024 cores. Evaluation results on three data sets representing about 100 fields show that our selection algorithm improves the compression ratio up to 70 percent with the same level of data distortion because of very accurate selection (around 99 percent) of the bestfit compressor, with little overhead (less than 7 percent in the experiments).

97 MATHEMATICS AND COMPUTING↗

Light-induced ultrafast spin transport in multilayer metallic films originates from sp-d spin exchange coupling

Ultrafast interaction between the femtosecond laser pulse and the magnetic metal provides an efficient way to manipulate the magnetic states of matter. Numerous experimental advancements have been made on multilayer metallic films in the last two decades. However, the underlying physics remains unclear. Here, relying on an efficient ab initio spin dynamics simulation algorithm, we revealed the physics that can unify the progress in different experiments. We found that light-induced ultrafast spin transport in multilayer metallic films originates from the sp - d spin-exchange interaction, which can induce an ultrafast, large, and pure spin current from ferromagnetic metal to nonmagnetic metal without charge carrier transport. The resulting trends of spin demagnetization and spin flow are consistent with most experiments. It can explain a variety of ultrafast light-spin manipulation experiments with different systems and different pump-probe technologies, covering a wide range of work in this field.

36 MATERIALS SCIENCE↗