Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Electronics for a Picosecond Time-of-flight Measurement

TITLE: Electronics for a Picosecond Time-of-flight Measurement ABSTRACT: Time-of-flight (TOF) detectors have historically been used as part of the particle identification capability of multi-purpose particle physics detectors. An accurate time measurement, combined with a momentum measurement based on the curvature of the track in a magnetic field, is often sufficient to determine the particle's mass, and thus its identity. Such detectors typically have measured the particle flight time extremely precisely, with an uncertainty of one hundred trillionths of a second (also referred to as 100 picoseconds). To put this in perspective it would be like counting all the people on the Earth and getting it right within 1 person! Another use of TOFs is to measure the vertex of the event, which is the location along the beam line where the incoming particles (typically protons) collide. This vertex positon is a well measured quantity for events where the protons collide “head on” as the outgoing particles produced when you blast the proton apart can be used to trace back to a vertex point from which they originated. More frequently the protons just strike a glancing blow and remain intact—in this case they are nearly parallel to the beam and you cannot tell their vertex without this ability to precisely measure the time of flight of the protons. Occasionally both happen in the same event, that is, a central system and two protons are produced. But are they from the same collision, or just a boring background where more than one collision in the same bunch crossing conspire to fake the signal of interest? That’s where the timing of the protons comes into play. The main idea is to measure the time it takes for the two protons to reach TOF detectors positioned equidistant from the center of the main detector. If the vertex is displaced to one side than that detector will measure a shorter time while the other side detector will measure a correspondingly longer time. Taking into account the speed of the particles, which is very close to the speed of light, an accuracy of 100 ps gives a vertex measurement of a few cm or a little more than an inch. At the Large Hadron Collider, where there are up to a hundred billion protons per bunch, and the collision region is compressed to a few inches, that is just not good enough. A higher level of precision is needed to determine whether the vertex of the protons and that of the central system are the same. A factor 10 improvement in the timing measurement to the 10 trillionths of a second level, for example would give the requisite 10 times improvement in the vertex measurement. An accurate measurement of the flight time depends on three key elements: the radiator that produces light when the proton passes through it, the photo-sensor that converts the light to an electrical signal, and the electronics that convert this electrical signal into a time measurement with a compact recordable format. With recent improvements in detector design featuring a series of quartz radiators connected to a micro-channel plate photomultiplier tube, this superior measurement capability is within reach if the readout electronics are sufficiently performant. As a result of the funding of this proposal, we have achieved our primary goals. 1) We have developed from scratch or improved upon existing designs of the full chain of electronics that can maintain the performance of a TOF detector from the output of the photo-sensor to the recording of a compressed data packet containing the timing information. We have accomplished this with a cost effective modular approach such that some or all of the components in the chain could easily be adapted for use in diverse particle physics experiments or in other areas where precise timing is required, such as medical and homeland security devices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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 OSTI2015

Penguin-like diagrams from the standard model

The Standard Model is highly successful in describing the interactions of leptons and quarks. There are, however, rare processes that involve higher order effects in electroweak interactions. One specific class of processes is the penguin-like diagram. Such class of diagrams involves the neutral change of quark flavours accompanied by the emission of a gluon (gluon penguin), a photon (photon penguin), a gluon and a photon (gluon-photon penguin), a Z-boson (Z penguin), or a Higgs-boson (Higgs penguin). Such diagrams do not arise at the tree level in the Standard Model. They are, however, induced by one-loop effects. In this paper, we present an exact calculation of the penguin diagram vertices in the ‘tHooft-Feynman gauge. Renormalization of the vertex is effected by a prescription by Chia and Chong which gives an expression for the counter term identical to that obtained by employing Ward-Takahashi identity. The on-shell vertex functions for the penguin diagram vertices are obtained. The various penguin diagram vertex functions are related to one another via Ward-Takahashi identity. From these, a set of relations is obtained connecting the vertex form factors of various penguin diagrams. Explicit expressions for the gluon-photon penguin vertex form factors are obtained, and their contributions to the flavor changing processes estimated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2014

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

Simmhan, Yogesh↗
DOE OSTI2014

The accretion rate independence of horizontal branch oscillation in XTE J1701-462

We study the temporal and energy spectral properties of the unique neutron star low-mass X-ray binary XTE J1701-462. Assuming the horizontal branch/normal branch (HB/NB) vertex as a reference position of the accretion rate, the horizontal branch oscillation (HBO) of the HB/NB vertex is roughly 50 Hz. It indicates that the HBO is independent of the accretion rate or the source intensity. The spectral analysis shows R{sub in}∝ M-dot {sub Disk}{sup 2.9±0.09} in the HB/NB vertex and R{sub in}∝ M-dot {sub Disk}{sup 1.7±0.06} in the NB/flaring branch (FB) vertex, which implies that different accretion rates may be produced in the HB/NB and NB/FB vertex. The Comptonization component could be fitted by a constrained broken power law or nthComp. Unlike GX 17+2, the frequencies of HBO positively correlate with the inner disk radius, which contradict with the prediction of the Lense-Thirring precession model. XTE J1701-462, both in the Cyg-like phase and in the Sco-like phase, follows a positive correlation between the break frequency of broadband noise and the characteristic frequency of HBO, which is called the W-K relation. An anticorrelation between the frequency of HBO and photon energy is observed. Moreover, the rms of HBO increases with photon energy until ∼10 keV. We discuss the possible origin of HBO from the corona in XTE J1701-462.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Full self-consistency versus quasiparticle self-consistency in diagrammatic approaches: Exactly solvable two-site Hubbard model

Self-consistent solutions of Hedin's equations (HE) for the two-site Hubbard model (HM) have been studied. They have been found for three-point vertices of increasing complexity (Γ = 1 (GW approximation), Γ₁ from the first-order perturbation theory, and the exact vertex Γ E ). Comparison is made between the cases when an additional quasiparticle (QP) approximation for Green's functions is applied during the self-consistent iterative solving of HE and when QP approximation is not applied. Results obtained with the exact vertex are directly related to the present open question—which approximation is more advantageous for future implementations, GW + DMFT or QPGW + DMFT. It is shown that in a regime of strong correlations only the originally proposed GW + DMFT scheme is able to provide reliable results. Vertex corrections based on Perturbation Theory systematically improve the GW results when full self-consistency is applied. The application of QP self-consistency combined with PT vertex corrections shows similar problems to the case when the exact vertex is applied combined with QP sc. An analysis of Ward Identity violation is performed for all studied in this work's approximations and its relation to the general accuracy of the schemes used is provided.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 OSTI2017

Searching for Heavy Photons with Detached Verices in the Heavy Photon Search Experiment

The Jefferson Lab Heavy Photon Search (HPS) experiment is searching for a hypothetical massive particle called the heavy photon which could mediate a dark electromagnetic-type force. If heavy photons kinetically mix with Standard Model photons, they may be radiated by electrons scattering from a heavy nucleus and then decay to e+e- pairs. HPS uniquely searches for heavy photons that either decay at the target or a measurable distance after. The experiment utilizes a silicon vertex tracker (SVT) for momentum and vertex reconstruction, together with an electromagnetic calorimeter for measuring particle energies and triggering events. The HPS experiment took its first data during the spring 2015 engineering run using a 1 GeV electron beam incident on a tungsten target and its second data in the spring of 2016 at a beam energy of 2.3 GeV. The 2015 run obtained two days of production data that was used for the first physics results. The analysis of the data was conducted as a blinded analysis by tuning cuts on 10% of the data. This dissertation discusses the displaced vertex search for heavy photons in the 2015 engineering run. It describes the theoretical motivation for looking for heavy photons and provides an overview of the HPS experimental design and performance. The performance details of the experiment are primarily derived from the 2015 engineering run with some discussion from the higher energy running in 2016. This dissertation further discusses the cuts used to optimize the displaced vertex search and the results of the search. The displaced vertex search did not set a limit on the heavy photon but did validate the methodology for conducting the search. Finally, we used the full data set to make projections and guide future analyses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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↗