Search NASA⌕ Search

SEARCH · Search NASA

Results for “vertex”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1963

Lunar Flight Study Series: Volume 7. Earth-Moon Transit Studies Based on Ephemeris Data and Using Best Available Computer Program: Principles for Reducing Earth-Moon Trajectory Analysis to Fundamentals - 2

This report presents an empirical investigation of earth-to-moon trajectories. The primary objective is to uncover relationships that result in the reduction of mission analysis or trajectory analysis problems to fundamentals. It is considered imperative that the results be accurate to the extent that any relationships that are uncovered are not brought about by simplifying or unrealistic assumptions. Consequently, the model used is as accurate as is presently available for use and the computations are performed under strict error controls. Procedures are reasonable from the engineering viewpoint. Some very helpful principles are uncovered. These may be briefly stated as follows: 1) Trajectories of constant flight time to the moon (in the 66 hour to 90 hour range), and arriving within a few minutes of the same time pass over a common point on the moon regardless of the arrival altitude and inclination, This common point of passage for such a family of trajectories is arbitrarily referred to as a VERTEX point; 2) These VERTEX points lie within a bounded region on the lunar surface as arrival time varies throughout the years, for a given flight time or flight time spread; 3) Increasing flight time results primarily in a longitude shift of the VERTEX point for a given arrival time; 4) Launch azimuth should be treated as a strong parameter regarding its influence on the vertex. Launch azimuth variations up to +/- 20 degrees about 90 degrees can shift the vertex as much as 3 degrees in latitude even when one is free to pick launch time, coast time, and S-IVB burn time appropriately with launch azimuth; and 5) The locus of periselenum, as arrival inclination takes on all possible values, is nearly circular about the vertex point for a given arrival altitude. A publication is now in preparation that applies these principles to much advantage in the solution of various trajectory analysis problems.

LUNAR FLIGHT↗
DOE OSTI2021

Experimental realization of classical Z 2 spin liquids in a programmable quantum device

We build and probe a Z 2 spin liquid in a programmable quantum device, the D-Wave DW-2000Q. Specifically, we observe the classical eight-vertex and six-vertex (spin ice) states and transitions between them. To realize this state of matter, we design a Hamiltonian with combinatorial gauge symmetry using only pairwise-qubit interactions and a transverse field, i.e., interactions which are accessible in this quantum device. The combinatorial gauge symmetry remains exact along the full quantum annealing path, landing the system onto the classical eight-vertex model at the endpoint of the path. The output configurations from the device allow us to directly observe the loop structure of the classical model. Moreover, we deform the Hamiltonian so as to vary the weights of the eight vertices and show that we can selectively attain the classical six-vertex (ice) model, or drive the system into a ferromagnetic state. Additionally, we present studies of the classical phase diagram of the system as a function of the eight-vertex deformations and effective temperature, which we control by varying the relative strengths of the programmable couplings, and we show that the experimental results are consistent with theoretical analysis. Finally, we identify additional capabilities that, if added to these devices, would allow us to realize Z 2 quantum spin liquids on which to build topological qubits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Crystalline-symmetry-protected Majorana modes in coupled quantum dots

We propose a minimalist architecture for achieving various crystalline-symmetry-protected Majorana modes in an array of coupled quantum dots. Our framework is motivated by the recent experimental demonstrations of two-site and three-site artificial Kitaev chains in a similar setup. We find that introducing a π-phase domain wall in the Kitaev chain leads to a pair of mirror-protected Majorana zero modes located at or near the junction. Joining two π junctions into a closed loop, we can simulate two distinct classes of two-dimensional higher-order topological superconducting phases, both carrying symmetry-protected Majorana modes around the sample corners. As an extension of the π junction, we further consider a general vertex structure where n Kitaev chains meet, i.e., a Kitaev n vertex. We prove that such an n vertex, if respecting a dihedral symmetry group D n , necessarily carries n vertex-bound Majorana modes protected by the D n symmetry. Resilience of the junction and vertex Majorana bound states against disorder and correlation effects is also discussed. Our architecture paves the way for designing, constructing, and exploring a wide variety of artificial topological crystalline phases in quantum-dot experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Topological Analysis of The SPOKE Graph

The SPOKE graph [2, 6] is a sparse decorated semantic graph representing a collection of knowledge collected in many scientific databases from the fields of healthcare, biochemistry, chemistry, biology, et cetera. This knowledge graph is stored as a relational dataset decorated with metadata on each constituent vertex and edge. Formally, the graph is G(V, E, D), where V is a set of n vertices V := {1, ..., n} and edges of the form (i, j) ϵ E for i, j ϵ V, and table D that for any item in V υ E stores unstructured data such as vertex/edge type, nature of a relationship, et cetera. D(i) = {data involving vertex i ϵ V}, and D(i, j) = {data involving edge (i, j) ϵ E}. Here, we treat the graph as undirected in the sense that a direct relationship for (i, j) causes a (possibly opposite) reverse direct relationship for (j, i). The SPOKE graph G(V, E, D) is formed by processing a collection of relational datasets from medicine, chemistry, and biology, connecting many entities. Here, we analyze an instance from 2019, Spoke-20190707, where a graph file contains 6.16M edges and associated metadata and a vertex file contains 2.15M vertices and the associated metadata. There are 12 different types of vertex entities; all edge types used are implicit (see §2). There is other metadata in D on edges and vertices, but we just use the topology and the vertex labels in this report. SPOKE is growing as more knowledge is gained and more datasets are added. SPOKE is likely to grow 10x during the next phase of this project, and we therefore would like to consider topoligical analysis techniques that are scalable to several orders of magnitude larger than the current dataset (say >1B edges).

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1980

Clipping polygon faces through a polyhedron of vision

A flight simulator combines flight data and polygon face terrain data to provide a CRT display at each window of the simulated aircraft. The data base specifies the relative position of each vertex of each polygon face therein. Only those terrain faces currently appearing within the pyramid of vision defined by the pilots eye and the edges of the pilots window need be displayed at any given time. As the orientation of the pyramid of vision changes in response to flight data, the displayed faces are correspondingly displaced, eventually moving out of the pyramid of vision. Faces which are currently not visible (outside the pyramid of vision) are clipped from the data flow. In addition, faces which are only partially outside of pyramid of vision are reconstructed to eliminate the outside portion. Window coordinates are generated defining the distance between each vertex and each of the boundary planes forming the pyramid of vision. The sign bit of each window coordinate indicates whether the vertex is on the pyramid of vision side of the associated boundary panel (positive), or on the other side thereof (negative). The set of sign bits accompanying each vertex constitute the outcode of that vertex. The outcodes (O.C.) are systematically processed and examined to determine which faces are completely inside the pyramid of vision (Case A--all signs positive), which faces are completely outside (Case C--All signs negative) and which faces must be reconstructed (Case B--both positive and negative signs).

Rohner, Michel A.↗
DOE OSTI2022

Wire-cell 3D pattern recognition techniques for neutrino event reconstruction in large LArTPCs: algorithm description and quantitative evaluation with MicroBooNE simulation

Wire-Cell is a 3D event reconstruction package for liquid argon time projection chambers. Through geometry, time, and drifted charge from multiple readout wire planes, 3D space points with associated charge are reconstructed prior to the pattern recognition stage. Pattern recognition techniques, including track trajectory and dQ/dx (ionization charge per unit length) fitting, 3D neutrino vertex fitting, track and shower separation, particle-level clustering, and particle identification are then applied on these 3D space points as well as the original 2D projection measurements. A deep neural network is developed to enhance the reconstruction of the neutrino interaction vertex. Compared to traditional algorithms, the deep neural network boosts the vertex efficiency by a relative 30% for charged-current ν e interactions. Therefore, this pattern recognition achieves 80–90% reconstruction efficiencies for primary leptons, after a 65.8% (72.9%) vertex efficiency for charged-current ν e (ν μ ) interactions. Based on the resulting reconstructed particles and their kinematics, we also achieve 15-20% energy reconstruction resolutions for charged-current neutrino interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multipartite entanglement in two-dimensional chiral topological liquids

The multipartite entanglement structure for the ground states of two-dimensional (2D) topological phases is an interesting albeit not well-understood question. Utilizing the bulk-boundary correspondence, the calculation of tripartite entanglement in 2D topological phases can be reduced to that of the vertex state, defined by the boundary conditions at the interfaces between spatial regions. In this paper, we use the conformal interface technique to calculate entanglement measures in the vertex state, which include area-law terms, corner contributions, and topological pieces, and a possible additional order-one contribution. Furthermore, this explains our previous observation of the Markov gap ℎ = $\frac{c}{3}$ ⁢ln⁡2 in the three-vertex state, and generalizes this result to the p-vertex state, general rational conformal field theories, and more choices of subsystems. Finally, we support our prediction by numerical evidence, finding precise agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Universal features of 2 → N scattering in QCD and gravity from shockwave collisions

A remarkable double-copy relation of Einstein gravity to QCD in Regge asymptotics is Γ μ ν = 1 2 C μ C ν − 1 2 N μ N ν , where Γ μ ν is the gravitational Lipatov vertex in the 2 → 3 graviton scattering amplitude, C μ its Yang-Mills counterpart, and N μ the QED bremsstrahlung vertex. In QCD, the Lipatov vertex is a fundamental building block of the BFKL equation describing the 2 → N scattering of gluons at high energies. Likewise, the gravitational Lipatov vertex is a key ingredient in a 2D effective field theory framework describing trans-Planckian 2 → N graviton scattering. We construct a quantitative correspondence between a semiclassical Yang-Mills framework for radiation in gluon shockwave collisions and its counterpart in general relativity. In particular, we demonstrate the Lipatov double copy in a dilute-dilute approximation corresponding to R S , L , R S , H ≪ b , where R S , L , R S , H are the respective emergent Schwarzchild radii generated in shockwave collisions and b is the impact parameter. We outline extensions of the correspondence developed here to the dilute-dense computation of gravitational wave radiation in the close vicinity of one of the black holes, the construction of graviton propagators in the shockwave background, and a renormalization group approach to compute 2 → N amplitudes that incorporates graviton Reggeization and coherent graviton multiple scattering. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Trust: Triangle Counting Reloaded on GPUs

Triangle counting is a building block for a wide range of graph applications. Here, traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle counting beats vertex-centric design, and iii) communication-free and workload balanced graph partitioning is a grand challenge for triangle counting. On the contrary, we advocate that i) hashing can help the key operations for scalable triangle counting on Graphics Processing Units (GPUs), i.e., list intersection and graph partitioning, ii) vertex-centric option reduces both hash table construction cost and memory consumption, which is limited on GPUs. In addition, iii) we exploit graph and workload collaborative, and hash-based 2D partitioning to scale vertex-centric triangle counting over 1,000 GPUs with sustained scalability. In this work, we present TRUST, which performs triangle counting with the hash operation and vertex-centric paradigm. To the best of our knowledge, TRUST is the first work that achieves over one trillion Traversed Edges Per Second (TEPS) rate for triangle counting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Hyperbolic string tadpole

Hyperbolic geometry on the one-bordered torus is numerically uniformized using Liouville theory. This geometry is relevant for the hyperbolic string tadpole vertex describing the one-loop quantum corrections of closed string field theory. We argue that the Lamé equation, upon fixing its accessory parameter via Polyakov conjecture, provides the input for the characterization. The explicit expressions for the Weil-Petersson metric as well as the local coordinates and the associated vertex region for the tadpole vertex are given in terms of classical torus conformal blocks. The relevance of this vertex for vacuum shift computations in string theory is highlighted.

Firat, Atakan Hilmi↗
NASA NTRS1971

Eigenvalues of the Laplacian of a graph

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

Anderson, W. N., Jr.↗
NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗