Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “triangle counting”

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 55 records · Page 3

Query Optimization for Graph Analytics on Linked Data Using SPARQL

Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Graph Mining Meets the Semantic Web

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

Lee, Sangkeun↗

EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graph mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'

Source record↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

Illustrations of integrand-basis building at two loops

We outline the concrete steps involved in building prescriptive master integrand bases for scattering amplitudes beyond the planar limit. We highlight the role of contour choices in such bases, and illustrate the full process by constructing a complete, triangle power-counting basis at two loops for six particles. We show how collinear contour choices can be used to divide integrand bases into separately finite and divergent subspaces, and how double-poles can be used to further subdivide these spaces according to (transcendental) weight. Complete details of the basis constructed for six particles is provided in the supplementary material.

1/N expansion↗

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗

Perturbative expansion of N<8 Supergravity

We characterize the one-loop amplitudes for N=6 and N=4 supergravity in four dimensions. For N=6 we find that the one-loop n-point amplitudes can be expanded in terms of scalar box and triangle functions only. This simplification is consistent with a loop momentum power count of n-3, which we would interpret as being n+4 for gravity with a further -7 from the N=6 superalgebra. For N=4 we find that the amplitude is consistent with a loop momentum power count of n, which we would interpret as being n+4 for gravity with a further -4 from the N=4 superalgebra. In contrast to previous studies we find that the N=4 amplitudes contain noncut-constructible rational terms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

OPTIMAL CAPTURE OF NON-GAUSSIANITY IN WEAK-LENSING SURVEYS: POWER SPECTRUM, BISPECTRUM, AND HALO COUNTS

We compare the efficiency of weak-lensing-selected galaxy cluster counts and of the weak-lensing bispectrum at capturing non-Gaussian features in the dark matter distribution. We use the halo model to compute the weak-lensing power spectrum, the bispectrum, and the expected number of detected clusters, and derive constraints on cosmological parameters for a large, low systematic weak-lensing survey, by focusing on the OMEGA{sub m}-sigma{sub 8} plane and on the dark energy equation of state. We separate the power spectrum into the resolved and the unresolved parts of the data, the resolved part being defined as detected clusters, and the unresolved part as the rest of the field. We consider four kinds of clusters counts, taking into account different amount of information: signal-to-noise ratio peak counts, counts as a function of clusters' mass, counts as a function of clusters' redshift, and counts as a function of clusters' mass and redshift. We show that when combined with the power spectrum, those four kinds of counts provide similar constraints, thus allowing one to perform the most direct counts, signal-to-noise peak counts, and get percent level constraints on cosmological parameters. We show that the weak-lensing bispectrum gives constraints comparable to those given by the power spectrum and captures non-Gaussian features as well as cluster counts, its combination with the power spectrum giving errors on cosmological parameters that are similar to, if not marginally smaller than, those obtained when combining the power spectrum with cluster counts. We finally note that in order to reach its potential, the weak-lensing bispectrum must be computed using all triangle configurations, as equilateral triangles alone do not provide useful information. The appendices summarize the halo model, and the way the power spectrum and bispectrum are computed in this framework.

79 ASTRONOMY AND ASTROPHYSICS↗

Next-to-simplest quantum field theories

We describe new on-shell recursion relations for tree amplitudes in N=1 and N=2 gauge theories and use these to show that the structure of the one-loop S-matrix in pure (i.e. without any matter) N=1 and N=2 gauge theories resembles that of pure Yang-Mills theory. We proceed to study gluon scattering in gauge theories coupled to matter in arbitrary representations. The contribution of matter to individual bubble and triangle coefficients can depend on the fourth- and sixth-order indices of the matter representation, respectively. So, the condition that one-loop amplitudes be free of bubbles and triangles can be written as a set of linear Diophantine equations involving these higher-order indices. These equations simplify for supersymmetric theories. We present new examples of supersymmetric theories that have only boxes (and no triangles or bubbles at one-loop) and nonsupersymmetric theories that are free of bubbles. These theories see simplifications in their S-matrices that cannot be deduced just from naive power-counting. In particular, our results indicate that one-loop scattering amplitudes in the N=2, SU(N) theory with a symmetric tensor hypermultiplet and an antisymmetric tensor hypermultiplet are simple like those in the N=4 theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Measurements of short-lived fission product yields from photofission of 238 U using 13.0 MeV monoenergetic photons

Photon-induced fission product yield (FPY) measurements were conducted on the isotope 238U. Fission was induced using Eγ = 13.0 MeV monoenergetic photons produced by the Triangle Universities Nuclear Laboratory’s (TUNL’s) High Intensity γ-ray Source (HIγS) facility. Short-lived FPYs were measured by performing cyclic activation of the sample using a rapid target transfer system. Following activation, the 238U target was rapidly (0.4 s) transferred to a counting station consisting of two well-shielded high-purity germanium (HPGe) detectors. The irradiation-counting cycle was repeated until the summed data had sufficient statistical accuracy. Twenty-eight unique fission products with half-lives ranging from 1 s to 450 s were identified, and their cumulative FPYs determined. Furthermore, the results are compared with previous independent FPY measurements using inverse kinematics. Good agreement between the data sets is found despite the different excitation energy distributions of the fissioning nucleus in the experiments.

Physics - Nuclear physics and radiation physics↗

Effective field theory of Stückelberg vector bosons

We explore the effective field theory of a vector field $X^μ$ that has a Stückelberg mass. The absence of a gauge symmetry for $X^μ$ implies Lorentz-invariant operators are constructed directly from Xμ. Beyond the kinetic and mass terms, allowed interactions at the renormalizable level include $X_μX^μH^†H, (X_μX^μ)^2$, and $X_μj^μ$, where $j^μ$ is a global current of the SM or of a hidden sector. We show that all of these interactions lead to scattering amplitudes that grow with powers of $\sqrt{s}/m_X$, except for the case of $X_μj^μ$ where $j^μ$ is a nonanomalous global current. The latter is well-known when $\textit{X}$ is identified as a dark photon coupled to the electromagnetic current, often written equivalently as kinetic mixing between $\textit{X}$ and the photon. The power counting for the energy growth of the scattering amplitudes is facilitated by isolating the longitudinal enhancement. We examine in detail the interaction with an anomalous global vector current $X_μj^μ_{\text{anom}}$, carefully isolating the finite contribution to the fermion triangle diagram. We calculate the longitudinally-enhanced observables $Z → X_γ$ (when $m_X < m_Z), f\bar{f} → X_γ$, and $Z_γ → Z_γ$ when $\textit{X}$ couples to the baryon number current. Introducing a "fake" gauge-invariance by writing $X^μ = A^μ – ∂^μπ/m_X$, the would-be gauge anomaly associated with $A_μj^μ_{\text{anom}}$ is canceled by $j^μ_{\text{anom}}∂_μπ/m_X$; this is the four-dimensional Green-Schwarz anomaly-cancellation mechanism at work. Our analysis demonstrates there is a much larger set of possible interactions that an EFT with a Stückelberg vector field can have, revealing scattering amplitudes that grow with energy. The growth of these amplitudes can be tamed by a dark Higgs sector, but this requires dark Higgs boson interactions (and reintroduces fine-tuning in the dark Higgs sector) that can be separated from X interactions only in the limit $g \ll 1$ .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy Dependence of Fission Product Yields from {sup 235}U, {sup 238}U and {sup 239}Pu for Incident Neutron Energies Between 0.5 and 14.8 MeV

Fission Product Yields (FPY) have historically been one of the most observable features of the fission process. They are known to have strong variations that are dependent on the fissioning species, the excitation energy, and the angular momentum of the compound system. However, consistent and systematic studies of the variation of these FPY with energy have proved challenging. This is caused primarily by the nature of the experiments that have traditionally relied on radiochemical procedures to isolate specific fission products. Although radiochemical procedures exist that can isolate all products, each element presents specific challenges and introduces varying degrees of systematic errors that can make inter-comparison of FPY uncertain. Although of high importance in fields such as nuclear forensics and Stockpile Stewardship, accurate information about the energy dependence of neutron induced FPY are sparse, due primarily to the lack of suitable monoenergetic neutron sources. There is a clear need for improved data, and to address this issue, a collaboration was formed between Los Alamos National Laboratory (LANL), Lawrence Livermore National Laboratory (LLNL) and the Triangle Universities Nuclear Laboratory (TUNL) to measure the energy dependence of FPY for {sup 235}U, {sup 238}U and {sup 239}Pu. The measurements have been performed at TUNL, using a 10 MV Tandem Van de Graaff accelerator to produce monoenergetic neutrons at energies between 0.6 MeV to 14.8 MeV through a variety of reactions. The measurements have utilized a dual-fission chamber, with thin (10-100 μg/cm2) reference foils of similar material to a thick (100-400 mg) activation target held in the center between the chambers. This method allows for the accurate determination of the number of fissions that occurred in the thick target without requiring knowledge of the fission cross section or neutron fluence on target. Following activation, the thick target was removed from the dual-fission chamber and gamma-ray counted using shielded HPGe detectors for a period of 1-2 months to determine the yield of various fission products. To the extent possible all irradiation and counting procedures were kept the same to minimize sources of systematic errors. FPY have been determined at incident neutron energies of 0.6, 1.4, 2.4, 3.5, 4.6, 5.5, 8.9 and 14.8 MeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spherical time-encoded radiation imaging simulations

Radiation source localization is important for nuclear nonproliferation and can be obtained using time-encoded imaging systems with unsegmented detectors. A scintillation crystal can be used with a moving coded-aperture mask to vary the detected count rate produced from radiation sources in the far field. The modulation of observed counts over time can be used to reconstruct an image with the known coded-aperture mask pattern. Current time-encoded imaging systems incorporate cylindrical coded-aperture masks and have limits to their fully coded imaging field-of-view. This work focuses on expanding the field-of-view to 4π by using a novel spherical coded-aperture mask. A regular icosahedron is used to approximate a spherical mask. This icosahedron consists of 20 equilateral triangles; the faces of which are each subdivided into four equilateral triangle-shaped voxels which are then projected onto a spherical surface, creating an 80-voxel coded-aperture mask. Furthermore, these polygonal voxels can be made from high-Z materials for gamma-ray modulation and/or low-Z materials for neutron modulation. In this work, we present Monte Carlo N-Particle (MCNP) simulations and simple models programmed in Mathematica to explore image reconstruction capabilities of this 80-voxel coded-aperture mask.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Evidence of Coherent Elastic Neutrino-Nucleus Scattering with COHERENT’s Germanium Array

We report the first detection of coherent elastic neutrino-nucleus scattering (CEvNS) on natural germanium, measured at the Spallation Neutron Source at Oak Ridge National Laboratory. The Ge-Mini detector of the COHERENT collaboration employs large-mass, low-noise, high-purity germanium spectrometers, enabling excellent energy resolution, and an analysis threshold of 1.5 keV electron-equivalent ionization energy. We observe an on-beam excess of 20.6$^{+7.1}_{−6.3}$ counts with a total exposure of 10.22 GWhkg, and we reject the no-CEvNS hypothesis with 3.9⁢𝜎 significance. The result agrees with the predicted standard model of particle physics signal rate within 2⁢𝜎.

Electroweak interaction↗

High-precision characterization of the neutron light output of stilbene along the directions of maximum and minimum response

The scintillation light output response of stilbene crystals has been calculated for protons recoiling along the a, b, and c' crystalline axes with energies between 1.3 and 10 MeV using neutrons produced with the tandem Van de Graaff accelerator at Triangle Universities Nuclear Laboratory. The proton recoil energy and direction were measured using the coincident detection of neutrons between a stilbene scintillator and an array of EJ-309 liquid scintillators spanning arranged neutron recoil angles. The maximum light output was discovered to coincide with proton recoils along the a-axis, in disagreement with other published measurements, which reported the b-axis as the direction of the maximum light output. Additional measurements were conducted using two different stilbene crystals to confirm these results: a second measurement using the coincident detection of neutrons; measurements of neutron full energy deposition events along the a and b axes; and measurements of the count rate for 252 Cf neutrons traveling along the a and b axes directions. All measurements found that recoils along the a-axis produce the maximum light output.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Enhanced sensitivity to trace 238 U impurity of sapphire via coincidence neutron activation analysis

Sapphire has mechanical and electrical properties that are advantageous for the construction of internal components of radiation detectors such as time projection chambers and bolometers. However, it has proved difficult to assess its 232 Th and 238 U content down to the picogram per gram level. Here, this work reports an experimental verification of a computational study that demonstrates 𝛾⁢𝛾 coincidence counting, coupled with neutron activation analysis (NAA), can reach ppt sensitivities. Combining results from 𝛾⁢𝛾 coincidence counting with those of earlier single-𝛾 counting based NAA shows that a sample of Saint Gobain sapphire has 232 Th and 238 U concentrations of <0.26 ppt and <2.3 ppt, respectively; the best constraints on the radiopurity of sapphire.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗