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 361 records · Page 20

The implementation of Global Feature EXtractor (gFEX) - the ATLAS Calorimeter Level 1 Trigger system for LHC Run-3 upgrade

As part of the ATLAS Phase-I Upgrade, the global Feature EXtractor (gFEX) is one of several hardware modules designed to help maintain the ATLAS Level-1 trigger acceptance rate with the increasing Large Hadron Collider (LHC) luminosity and the increasing Pile-Up conditions. The gFEX is used to identify patterns of energy associated with the hadronic decays of high momentum Higgs, W & Z bosons, top quarks, and exotic particles in real time at the 40 MHz LHC bunch crossing rate. The board is required to receive coarse-granularity (Δη×Δphiv = 0.2×0.2 gTower) information from the entire ATLAS calorimeters on 276 optical fibers. A prototype v1 with one Xilinx ZYNQ FPGA, and one Vertex-7 FPGA for technology validation has been designed and tested in 2015. With the lessons learned from the prototype v1, a prototype v2 with three Vertex UltraScale FPGAs and one ZYNQ FPGA has been implemented to verify full functionalities of gFEX in 2016. Based on the prototype v2 design, a prototype v3, the final gFEX prototype, is implemented, which is an ATCA module consisting of three Vertex UltraScale+ FPGAs, one ZYNQ UltraScale+ SoC, and 35 MiniPODs. This board receives up to 300 fiber optical links from calorimeters and transmits trigger data on 96 links to the to the ATLAS Level-1 Topological trigger (L1Topo [1]) at the speed up to 12.8 Gb/s. There are also 24 electrical links on board for communication between two FPGAs with the speed up to 25.6 Gb/s. The performance of three prototype boards have been tested and evaluated. For the prototype v3 board, the high-speed optical links are stable at 12.8 Gb/s with Bit Error Ratio (BER) < 1 × 10 -15 . The low-latency parallel GPIO (General Purpose I/O) buses between FPGAs are stable at 1.12 Gb/s. The peripheral components of ZYNQ UltraScale+ SoC, such as 16 GB DDR4 DIMM, UART, SPI flashes, and Ethernet, have also been verified. Here, the test results of the prototype v3 board validate the gFEX technologies, architecture and full functionalities. Now the final production board is being produced.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fluctuations analysis of spin susceptibility: Néel ordering revisited in dynamical mean field theory

Here in this paper, we revisit the antiferromagnetic (AF) phase diagram of the single-band three-dimensional half-filled Hubbard model on a simple cubic lattice studied within the dynamical mean field theory (DMFT). Although this problem has been investigated extensively in the literature, a comprehensive understanding of the impact of the different one- and, in particular, two-particle local correlation functions of DMFT on the AF transition temperature is still missing. We have, hence, performed a fluctuation analysis of T N with respect to different local bosonic fluctuations (charge, spin, particle-particle) contained in the two-particle vertex of DMFT. Our results indicate that, beyond weak coupling, the screening of the DMFT vertex by local fluctuations leads to an enhancement of T N with respect to a random phase approximation (RPA) like calculation where this vertex is replaced by the bare interaction. The overall suppression of T N in DMFT with respect to RPA is then solely due to the incoherence introduced by the DMFT self-energy in the one-particle Green's functions. This illustrates the Janus-faced role of the local moment formation in the DMFT solution of the Hubbard model, which leads to completely opposite effects in the one- and two-particle correlation functions.

36 MATERIALS SCIENCE↗

Gravitational form factors of light mesons

Here, we calculate the gravitational form factors of the pion, $\sigma$ meson, and $\rho$ meson in the Nambu-Jona-Lasinio model of quantum chromodynamics. The canonical energy-momentum tensor (EMT) is used in their derivation, allowing the possibility of an antisymmetric contribution when the hadron has intrinsic spin. We show that the asymmetric graviton vertex arising from the canonical EMT satisfies a simpler Ward-Takahashi identity (WTI) than the symmetric graviton vertex of the Belinfante EMT. The necessity of fully dressing the graviton vertex through the relevant Bethe-Salpeter equation is demonstrated for observing both the WTI and a low-energy pion theorem. Lastly, we calculate static moments of the meson EMT decompositions, obtaining predictions for the meson mass radii. We find light cone mass radii of 0.27 fm for the pion, 0.32 fm for the $\sigma$, and 0.32 fm for the $\rho$. For the pion and rho, these are smaller than the light cone charge radii, respectively 0.51 fm and 0.45 fm, while we have a $\sigma$ charge radius of zero. Our light cone pion mass radius agrees with a phenomenological extraction from KEKB data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interactions of massless higher spin fields from string theory

We construct vertex operators for massless higher spin fields in Ramond-Neveu-Schwarz superstring theory and compute some of their three-point correlators, describing gauge-invariant cubic interactions of the massless higher spins. The Fierz-Pauli on-shell conditions for the higher spins (including tracelessness and vanishing divergence) follow from the Becchi-Rouet-Stora-Tyutin-invariance conditions for the vertex operators constructed in this paper. The gauge symmetries of the massless higher spins emerge as a result of the Becchi-Rouet-Stora-Tyutin-nontriviality conditions for these operators, being equivalent to transformations with the traceless gauge parameter in the Fronsdal's approach. The gauge invariance of the interaction terms of the higher spins is therefore ensured automatically by that of the vertex operators in string theory. We develop a general algorithm to compute the cubic interactions of the massless higher spins and use it to explicitly describe the gauge-invariant interaction of two s=3 and one s=4 massless particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards spinfoam cosmology

We compute the transition amplitude between coherent quantum states of geometry peaked on homogeneous-isotropic metrics. We work in the context of pure gravity without matter, we use the holomorphic representations of loop quantum gravity and the Kaminski-Kisielowski-Lewandowski generalization of the new vertex, and work at first order in the vertex expansion, second order in the graph (multipole) expansion, and first order in volume{sup -1}. We show that the resulting amplitude is in the kernel of a differential operator whose classical limit is the canonical Hamiltonian of a Friedmann-Robertson-Walker cosmology. This result is an indication that the dynamics of loop quantum gravity defined by the new vertex reproduces the gravity part of the Friedmann equation in the appropriate limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

MO-FG-CAMPUS-IeP1-04: Kerma Area Product Calculation for Non-Uniform X-Ray Fields Using a Skin Dose Tracking System

Purpose: The functionality of the Dose-Tracking System (DTS) has been expanded to include the calculation of the Kerma-Area Product (KAP) for non-uniform x-ray fields such as result from the use of compensation filters during fluoroscopic procedures Methods: The DTS calculates skin dose during fluoroscopic interventions and provides a color-coded dose map on a patient-graphic model. The KAP is the integral of air kerma over the x-ray field and is usually measured with a transmission-ionization chamber that intercepts the entire x-ray beam. The DTS has been modified to determine KAP when there are beam non-uniformities that can be modeled. For example, the DTS includes models of the three compensation filters with tapered edges located in the collimator assembly of the Toshiba Infinix fluoroscopic C-Arm and can track their movement. To determine the air kerma after the filters, DTS includes transmission factors for the compensation filters as a function of kVp and beam filtration. A virtual KAP dosimeter is simulated in the DTS by an array of graphic vertices; the air kerma at each vertex is corrected by the field non-uniformity, which in this case is the attenuation factor for those rays which pass through the filter. The products of individual vertex air-kerma values for all vertices within the beam times the effective-area-per-vertex are summed for each x-ray pulse to yield the KAP per pulse and the cumulative KAP for the procedure is then calculated. Results: The KAP values estimated by DTS with the compensation filter inserted into the x-ray field agree within ± 6% with the values displayed on the fluoroscopy unit monitor, which are measured with a transmission chamber. Conclusion: The DTS can account for field non-uniformities such as result from the use of compensation filters in calculating KAP and can obviate the need for a KAP transmission ionization chamber. Partial support from NIH Grant R01-EB002873 and Toshiba Medical Systems Corp.

60 APPLIED LIFE SCIENCES↗

Microscopic study of the string breaking in QCD

Theory of strong decays defines in addition to decay widths also the channel coupling and the mass shifts of the levels above the decay thresholds. In the standard decay models of the {sup 3}P{sub 0} type the decay vertex is taken to be a phenomenological constant {gamma} and such a choice leads to large mass shifts of all meson levels due to real and virtual decays, the latter giving a divergent contribution. Here we show that taking the microscopic details of decay vertex into account, one obtains new string width effect coefficient, which strongly suppresses virtual decay contribution. In addition for a realistic space structure of the decay vertex of highly excited states, the decay matrix elements appear to be strongly different from those, where the constant {gamma} is used. From our analysis also follows that so-called flattening potential can imitate the effects of intermediate decay channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on the interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.

58 GEOSCIENCES↗

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

Highly Asynchronous Visitor Queue Graph Toolkit

HavoqGT (Highly Asynchronous Visitor Queue Graph Toolkit) is a framework for expressing asynchronous vertex-centric graph algorithms, and executing them on High Performance Computing (HPC) systems. It provides a vertex 'visitor' interface, where actions are defined at an individual vertex level, and contains a suite of classic graph algorithms. HavoqGT is capable of processing large graphs stored in NVRAM (SSDs) using a memory mapped interface.

Reza, TahsinA.↗

Hierarchical graphs for rule-based modeling of biochemical systems

Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal) of an edge represents a class of association (dissociation) reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results: For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR) complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions: Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for specifying rule-based models, such as the BioNetGen language (BNGL). Thus, the proposed use of hierarchical graphs should promote clarity and better understanding of rule-based models.

59 BASIC BIOLOGICAL SCIENCES↗

A new Wilson line-based classical action for gluodynamics

We develop a new classical action that in addition to \mathrm{MHV} M H V vertices contains also \mathrm{N^kMHV} N k M H V vertices, where 1\leq k \leq n-4 1 ≤ k ≤ n − 4 with n n the number of external legs. The lowest order vertex is the four-point MHV vertex – there is no three point vertex and thus the amplitude calculation involves fewer vertices than in the CSW method. The action is obtained by a canonical transformation of the Yang-Mills action in the light-cone gauge, where the field transformations are based on Wilson line functionals.

KAKKAD, HIREN↗

GRiP - A flexible approach for calculating risk as a function of consequence, vulnerability, and threat.

Get a GRiP (Gravitational Risk Procedure) on risk by using an approach inspired by the physics of gravitational forces between body masses! In April 2010, U.S. Department of Homeland Security Special Events staff (Protective Security Advisors [PSAs]) expressed concern about how to calculate risk given measures of consequence, vulnerability, and threat. The PSAs believed that it is not 'right' to assign zero risk, as a multiplicative formula would imply, to cases in which the threat is reported to be extremely small, and perhaps could even be assigned a value of zero, but for which consequences and vulnerability are potentially high. They needed a different way to aggregate the components into an overall measure of risk. To address these concerns, GRiP was proposed and developed. The inspiration for GRiP is Sir Isaac Newton's Universal Law of Gravitation: the attractive force between two bodies is directly proportional to the product of their masses and inversely proportional to the squares of the distance between them. The total force on one body is the sum of the forces from 'other bodies' that influence that body. In the case of risk, the 'other bodies' are the components of risk (R): consequence, vulnerability, and threat (which we denote as C, V, and T, respectively). GRiP treats risk as if it were a body within a cube. Each vertex (corner) of the cube represents one of the eight combinations of minimum and maximum 'values' for consequence, vulnerability, and threat. The risk at each of the vertices is a variable that can be set. Naturally, maximum risk occurs when consequence, vulnerability, and threat are at their maximum values; minimum risk occurs when they are at their minimum values. Analogous to gravitational forces among body masses, the GRiP formula for risk states that the risk at any interior point of the box depends on the squares of the distances from that point to each of the eight vertices. The risk value at an interior (movable) point will be dominated by the value of one vertex as that point moves closer and closer to that one vertex. GRiP is a visualization tool that helps analysts better understand risk and its relationship to consequence, vulnerability, and threat. Estimates of consequence, vulnerability, and threat are external to GRiP; however, the GRiP approach can be linked to models or data that provide estimates of consequence, vulnerability, and threat. For example, the Enhanced Critical Infrastructure Program/Infrastructure Survey Tool produces a vulnerability index (scaled from 0 to 100) that can be used for the vulnerability component of GRiP. We recognize that the values used for risk components can be point estimates and that, in fact, there is uncertainty regarding the exact values of C, V, and T. When we use T = t{sub o} (where t{sub o} is a value of threat in its range), we mean that threat is believed to be in an interval around t{sub o}. Hence, a value of t{sub o} = 0 indicates a 'best estimate' that the threat level is equal to zero, but still allows that it is not impossible for the threat to occur. When t{sub o} = 0 but is potentially small and not exactly zero, there will be little impact on the overall risk value as long as the C and V components are not large. However, when C and/or V have large values, there can be large differences in risk given t{sub o} = 0, and t{sub o} = epsilon (where epsilon is small but greater than a value of zero). We believe this scenario explains the PSA's intuition that risk is not equal to zero when t{sub o} = 0 and C and/or V have large values. (They may also be thinking that if C has an extremely large value, it is unlikely that T is equal to 0; in the terrorist context, T would likely be dependent on C when C is extremely large.) The PSAs are implicitly recognizing the potential that t{sub o} = epsilon. One way to take this possible scenario into account is to replace point estimates for risk with interval values that reflect the uncertainty in the risk components. In fact, one could argue that T never equals zero for a man-made hazard. This paper describes the thought process that led to the GRiP approach and the mathematical formula for GRiP and presents a few examples that will provide insights about how to use GRiP and interpret its results.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Study of Single Top Quark Production Using Bayesian Neural Networks With D0 Detector at the Tevatron

Top quark, the heaviest and most intriguing among the six known quarks, can be created via two independent production mechanisms in {\pp} collisions. The primary mode, strong {\ttbar} pair production from a $gtt$ vertex, was used by the {\d0} and CDF collaborations to establish the existence of the top quark in March 1995. The second mode is the electroweak production of a single top quark or antiquark, which has been observed recently in March 2009. Since single top quarks are produced at hadron colliders through a $Wtb$ vertex, thereby provide a direct probe of the nature of $Wtb$ coupling and of the Cabibbo-Kobayashi-Maskawa matrix element, $V_{tb}$. So this mechanism provides a sensitive probe for several, standard model and beyond standard model, parameters such as anomalous $Wtb$ couplings. In this thesis, we measure the cross section of the electroweak produced top quark in three different production modes, $s+t$, $s$ and $t$-channels using a technique based on the Bayesian neural networks. This technique is applied for analysis of the 5.4 $fb^{-1}$ of data collected by the {\d0} detector. From a comparison of the Bayesian neural networks discriminants between data and the signal-background model using Bayesian statistics, the cross sections of the top quark produced through the electroweak mechanism have been measured as: \[\sigma(p\bar{p}→tb+X,tqb+X) = 3.11^{+0.77}_{-0.71}\;\rm pb\] \[\sigma(p\bar{p}→tb+X) = 0.72^{+0.44}_{-0.43}\;\rm pb\] \[\sigma(p\bar{p}→tqb+X) = 2.92^{+0.87}_{-0.73}\;\rm pb\] % The $s+t$-channel has a gaussian significance of $4.7\sigma$, the $s$-channel $0.9\sigma$ and the $t$-channel~$4.7\sigma$. The results are consistent with the standard model predictions within one standard deviation. By combining these results with the results for two other analyses (using different MVA techniques) improved results \[\sigma(p\bar{p}→tb+X,tqb+X) = 3.43^{+0.73}_{-0.74}\;\rm pb\] \[\sigma(p\bar{p}→tb+X) = 0.68^{+0.38}_{-0.35}\;\rm pb\] \[\sigma(p\bar{p}→tqb+X) = 2.86^{+0.69}_{-0.63}\;\rm pb\] % were obtained with a significance of $5.4\sigma$, $1.8\sigma$ and $5.0\sigma$ respectively for $s+t$, $s$ and $t$-channels. Using this measured cross section and constraining $0 \leq |V_{tb}|^2 \leq 1$, the lower limit has been calculated to be $|V_{tb}| > 0.79$ with 95\% confidence level (C.L.). Another measurement of $tqb$ production cross section is done using the same dataset and discriminant but without any assumption on the $tb$ production rate. From this measurement, we obtain a cross section of $2.90^{+0.59}_{-0.59}$~pb for $t$-channel and corresponding significance of $5.5\sigma$. In addition to the above mentioned work, a search is made for the anomalous $Wtb$ couplings in single top quark production. Within the Standard Model, the $Wtb$ vertex is purely left-handed, and its amplitude is given by the $V_{tb}$, related to weak interaction between a top and a $b$-quark. In a more general way, additional anomalous couplings such as right-handed vectorial couplings and left and right-handed tensorial couplings can also be considered. An analysis based on the Bayesian neural networks method is used to separate the signal from expected backgrounds. We find no evidence for anomalous couplings and set 95\% C.L. limits on these couplings as $|V_{tb} \cdot f_{L_T}|^2<0.06$, $|V_{tb} \cdot f_{R_V}|^2<0.93$ and $|V_{tb} \cdot f_{R_T}|^2<0.13$. This result represents the most stringent direct constraints on anomalous $Wtb$ interactions. This work has been done in collaboration with \d0 experiment but the analyses and results presented in this thesis are my contribution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Measurement of a Neutrino-Induced Charged Current Single Neutral Pion Cross Section at MicroBooNE

Micro Booster Neutrino Experiment (MicroBooNE) is a Liquid Argon Time Projection Chamber (LArTPC) operating in the Booster Neutrino Beamline at Fermi National Accelerator Laboratory. MicroBooNE's physics goals include studying short basline $\nu$ oscillation and performing a suite of low energy $\nu$ cross section measurements. Of particular interest to MicroBooNE, and the broader LArTPC community, are electromagnetic showers; these showers are at the heart of searches for charged current $\nu_e$ interactions, including MicroBooNE's flagship search for a MiniBooNE-like low energy excess (LEE). Neutral current $\pi^0$'s, which decay into 2 electromagnetic showers ($\gamma$'s), are the dominant source of non-$\nu_e$ backgrounds in searches for $\nu_{\mu}\rightarrow\nu_e$ oscillations in LArTPCs, such as the LEE. While precise measurements of this neutral current channel will provide a tight constraint on our modeling uncertainties, such events are particularly difficult to iden tify in data with our current tools, as there is often little or no activity at the neutrino interaction point. Charged current interactions, on the other hand, have simpler topologies with a long $\mu$ track that anchors to the interaction vertex. With a vertex in hand, we can develop automated reconstruction tools for neutrino-induced shower topologies (like the $\gamma$'s from $\pi^0$ decay). Thus, in studying charged current $\pi^0$ interactions, we are developing tools that can potentially be used to reconstruct an important LEE background, while also studying the physics of neutrino interactions, of which data is sparse for argon. This thesis reports the world's first measurement of the absolute, flux-averaged cross section of $\nu_{\mu}$-charged current single $\pi^0$ production on argon. The analysis chain begins with the selection of inclusive $\nu_\mu$ charged current events, where a candidate $\mu$ and neutrino interaction vertex are identified. These events are t hen passed to a reconstruction framework where electromagnet! ic shower candidates are reconstructed using computer visualization tools. Finally, the cross section is calculated on two reconstructed topologies: those with at least two reconstructed showers and those with at least one. Additionally, this work describes the first fully-automated electromagnetic shower reconstruction process employed by a LArTPC to perform a cross section analysis. We measure the flux averaged cross section on argon at 824 MeV via the two and one shower selections respectively to be \par \noindent $\sigma_{\geq2 Shower}$ = (2.56 $\pm$ $0.50_{stat}$ $\pm$ $0.31_{genie}$ $\pm$ $0.37_{flux}$ $\pm$ $0.31_{det}$) $\times$ $10^{-38}$ $\frac{cm^2}{Ar}$, \par \noindent $\sigma_{\geq 1 Shower}$ = (2.64 $\pm$ $0.33_{stat}$ $\pm$ $0.36_{genie}$ $\pm$ $0.38_{flux}$ $\pm$ $0.35_{det}$) $\times$ $10^{-38}$ $\frac{cm^2}{Ar}$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Searching for heavy photons in the HPS Experiment

The Heavy Photon Search (HPS) is a new experiment at Jefferson Lab that searches for a massive U(1) vector boson (known as a heavy photon or A') in the MeV-GeV mass range and coupling weakly to ordinary matter through a kinetic mixing interaction. The HPS experiment seeks to produce heavy photons by electron bremsstrahlung on a fixed target, is sensitive to heavy photon decays to e + e - , and targets the range in heavy photon mass m A' ~ 20 - 600 MeV, and kinetic mixing strength epsilon 2 ~ 10 -5 - 10 -10 . HPS searches for heavy photons using two signatures: a narrow mass resonance and displaced vertices. This dissertation presents the theoretical and experimental motivations for a heavy photon, the design and operation of the HPS experiment, and the displaced vertex search. The data used in this dissertation is the unblinded fraction of the 2015 HPS run, for the period of operation where the HPS silicon vertex tracker (SVT) was operated at its nominal position. This data was recorded from May 13 to May 18, 2015, at a beam energy of 1.056 GeV and a nominal beam current of 50 nA. The integrated luminosity is 119 nb -1 , which is equivalent to 0.172 days of ideal running at the nominal beam current. This dissertation presents results (signal significance and upper limits) from the displaced vertex search in the mass range m A' ~ 20 - 60 MeV, and kinetic mixing strength epsilon 2 ~ 2 × 10 -8 - 10 -10 . This search does not have sufficient sensitivity to exclude a canonical heavy photon at any combination of m A' and epsilon 2 . The strictest limit achieved in this analysis on the production of a particle that decays like a heavy photon is 115 times the expected production cross-section for a heavy photon. Factors limiting the sensitivity of this analysis are discussed. Projections of HPS performance with the full 2015 data set, and with planned improvements to the analysis, are presented. Comparisons are also made to earlier reach estimates.

Uemura, Sho↗

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a “Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named “Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.

graphs, cybersecurity↗