Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Pattern Recognition”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64

Identification of tau leptons using a convolutional neural network with domain adaptation

A tau lepton identification algorithm,DeepTau, based on convolutional neural network techniques, has been developed in the CMS experiment to discriminate reconstructed hadronic decays of tau leptons (τ h ) from quark or gluon jets and electrons and muons that are misreconstructed as τ h candidates. The latest version of this algorithm, v2.5, includes domain adaptation by backpropagation, a technique that reduces discrepancies between collision data and simulation in the region with the highest purity of genuine τh candidates. Additionally, a refined training workflow improves classification performance with respect to the previous version of the algorithm, with a reduction of 30–50% in the probability for quark and gluon jets to be misidentified as τ h candidates for given reconstruction and identification efficiencies. This paper presents the novel improvements introduced in theDeepTau algorithm and evaluates its performance in LHC proton-proton collision data at √(s) = 13 and 13.6 TeV collected in 2018 and 2022 with integrated luminosities of 60 and 35 fb -1 , respectively. Techniques to calibrate the performance of the τ h identification algorithm in simulation with respect to its measured performance in real data are presented, together with a subset of results among those measured for use in CMS physics analyses.

Large detector-systems performance↗

Calibration plan for the SBC 10-kg liquid argon detector with 100 eV target threshold

The Scintillating Bubble Chamber (SBC) Collaboration is designing a new generation of low background, noble liquid bubble chamber experiments with sub-keV nuclear recoil threshold. These experiments combine the electronic recoil blindness of a bubble chamber with the energy resolution of noble liquid scintillation, and maintain electron recoil discrimination at higher degrees of superheat (lower nuclear recoil thresholds) than Freon-based bubble chambers. A 10-kg liquid argon bubble chamber has the potential to set world leading limits on the dark matter nucleon cross-section for 𝒪(GeV/c 2 ) masses, and to perform a high statistics coherent elastic neutrino nuclear scattering measurement with reactor neutrinos. This work presents a detailed calibration plan to measure the detector response of these experiments, combining photoneutron scattering with two new techniques to induce sub-keV nuclear recoils: nuclear Thomson scattering and thermal neutron capture.

Dark Matter detectors (WIMPs, axions, etc.)↗

Distilling particle knowledge for fast reconstruction at high-energy physics experiments

Knowledge distillation is a form of model compression that allows artificial neural networks of different sizes to learn from one another. Its main application is the compactification of large deep neural networks to free up computational resources, in particular on edge devices. In this article, we consider proton-proton collisions at the High-Luminosity Large Hadron Collider (HL-LHC) and demonstrate a successful knowledge transfer from an event-level graph neural network (GNN) to a particle-level small deep neural network (DNN). Our algorithm, DistillNet, is a DNN that is trained to learn about the provenance of particles, as provided by the soft labels that are the GNN outputs, to predict whether or not a particle originates from the primary interaction vertex. The results indicate that for this problem, which is one of the main challenges at the HL-LHC, there is minimal loss during the transfer of knowledge to the small student network, while improving significantly the computational resource needs compared to the teacher. This is demonstrated for the distilled student network on a CPU, as well as for a quantized and pruned student network deployed on a field programmable gate array. Our study proves that knowledge transfer between networks of different complexity can be used for fast artificial intelligence (AI) in high-energy physics that improves the expressiveness of observables over non-AI-based reconstruction algorithms. Such an approach can become essential at the HL-LHC experiments, e.g. to comply with the resource budget of their trigger stages.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Surface x-ray speckles : coherent surface diffraction from Au(0 01).

We present coherent speckled x-ray diffraction patterns obtained from a monolayer of surface atoms. We measured both the specular anti-Bragg reflection and the off-specular hexagonal reconstruction peak for the Au(001) surface reconstruction. We observed fluctuations of the speckle patterns even when the integrated intensity appears static. By autocorrelating the speckle patterns, we were able to identify two qualitatively different surface dynamic behaviors of the hex reconstruction depending on the sample temperature.

36 MATERIALS SCIENCE↗

Large-scale functional models of visual cortex for remote sensing

Neuroscience has revealed many properties of neurons and of the functional organization of visual cortex that are believed to be essential to human vision, but are missing in standard artificial neural networks. Equally important may be the sheer scale of visual cortex requiring {approx}1 petaflop of computation. In a year, the retina delivers {approx}1 petapixel to the brain, leading to massively large opportunities for learning at many levels of the cortical system. We describe work at Los Alamos National Laboratory (LANL) to develop large-scale functional models of visual cortex on LANL's Roadrunner petaflop supercomputer. An initial run of a simple region VI code achieved 1.144 petaflops during trials at the IBM facility in Poughkeepsie, NY (June 2008). Here, we present criteria for assessing when a set of learned local representations is 'complete' along with general criteria for assessing computer vision models based on their projected scaling behavior. Finally, we extend one class of biologically-inspired learning models to problems of remote sensing imagery.

97 MATHEMATICS AND COMPUTING↗

Triangulation Made Easy

We describe a simple and efficient algorithm for two-view triangulation of 3D points from approximate 2D matches based on minimizing the L2 reprojection error. Our iterative algorithm improves on the one by Kanatani et al. by ensuring that in each iteration the epipolar constraint is satisfied. In the case where the two cameras are pointed in the same direction, the method provably converges to an optimal solution in exactly two iterations. For more general camera poses, two iterations are sufficient to achieve convergence to machine precision, which we exploit to devise a fast, non-iterative method. The resulting algorithm amounts to little more than solving a quadratic equation, and involves a fixed, small number of simple matrixvector operations and no conditional branches. We demonstrate that the method computes solutions that agree to very high precision with those of Hartley and Sturm's original polynomial method, though achieves higher numerical stability and 1-4 orders of magnitude greater speed.

99 GENERAL AND MISCELLANEOUS↗

Problematic projection to the in-sample subspace for a kernelized anomaly detector

We examine the properties and performance of kernelized anomaly detectors, with an emphasis on the Mahalanobis-distance-based kernel RX (KRX) algorithm. Although the detector generally performs well for high-bandwidth Gaussian kernels, it exhibits problematic (in some cases, catastrophic) performance for distances that are large compared to the bandwidth. By comparing KRX to two other anomaly detectors, we can trace the problem to a projection in feature space, which arises when a pseudoinverse is used on the covariance matrix in that feature space. Here, we show that a regularized variant of KRX overcomes this difficulty and achieves superior performance over a wide range of bandwidths.

58 GEOSCIENCES↗

Improving the Accuracy of Clustering Electric Utility Net Load Data using Dynamic Time Warping

Identifying patterns in electric utility net load data in a time-series format is very useful in preparing the operation for next day. Machine learning algorithms have been used in other domains and those concepts are applied in this paper on real-world net load measurement data. Clustering is the practice of grouping data with similar characteristics as determined by the distance measure. The K-means clustering algorithm is utilized here with actual electric utility data. The paper uses the standard distance measure, Euclidean distance (ED), and compares its performance against the dynamic time warping (DTW) measure. An actual case study with real data is presented, and DTW distance measure-based method observed to result better accuracy compared to the ED based method for substation net load measurements predominantly with residential customers.

clustering↗

Rietveld Analysis of X-ray Powder Diffraction Patterns as a Potential Tool for the Identification of Impact-deformed Carbonate Rocks

Previous X-ray powder diffraction (XRD) studies revealed that shock deformed carbonates and quartz have broader XRD patterns than those of unshocked samples. Entire XRD patterns, single peak profiles and Rietveld refined parameters of carbonate samples from the Sierra Madera impact crater, west Texas, unshocked equivalent samples from 95 miles north of the crater and the Mission Canyon Formation of southwest Montana and western Wyoming were used to evaluate the use of X-ray powder diffraction as a potential tool for distinguishing impact deformed rocks from unshocked and tectonically deformed rocks. At Sierra Madera dolostone and limestone samples were collected from the crater rim (lower shock intensity) and the central uplift (higher shock intensity). Unshocked equivalent dolostone samples were collected from well cores drilled outside of the impact crater. Carbonate rocks of the Mission Canyon Formation were sampled along a transect across the tectonic front of the Sevier and Laramide orogenic belts. Whereas calcite subjected to significant shock intensities at the Sierra Madera impact crater can be differentiated from tectonically deformed calcite from the Mission Canyon Formation using Rietveld refined peak profiles, weakly shocked calcite from the crater rim appears to be indistinguishable from the tectonically deformed calcite. In contrast, Rietveld analysis readily distinguishes shocked Sierra Madera dolomite from unshocked equivalent dolostone samples from outside the crater and tectonically deformed Mission Canyon Formation dolomite.

58 GEOSCIENCES↗

Overexpression of a plasma membrane protein generated broad-spectrum immunity in soybean

Plants fight-off pathogens and pests by manifesting an array of defence responses using their innate immunity mechanisms. Here we report the identification of a novel soybean gene encoding a plasma membrane protein, transcription of which is suppressed following infection with the fungal pathogen, Fusarium virguliforme. Overexpression of the protein led to enhanced resistance against not only against F. virguliforme, but also against spider mites (Tetranychus urticae, Koch), soybean aphids (Aphis glycines, Matsumura) and soybean cyst nematode (Heterodera glycines). We, therefore, name this protein as Glycine max disease resistance 1 (GmDR1; Glyma.10g094800). The homologues of GmDR1 have been detected only in legumes, cocoa, jute and cotton. The deduced GmDR1 protein contains 73 amino acids. GmDR1 is predicted to contain an ecto- and two transmembrane domains. Transient expression of the green fluorescent protein fused GmDR1 protein in soybean leaves showed that it is a plasma membrane protein. We investigated if chitin, a pathogen-associated molecular pattern (PAMP), common to all pathogen and pests considered in this study, can significantly enhance defence pathways among the GmDR1-overexpressed transgenic soybean lines. Chitin induces marker genes of the salicylic- and jasmonic acid-mediated defence pathways, but suppresses the defence pathway regulated by ethylene. Chitin induced SA- and JA-regulated defence pathways may be one of the mechanisms involved in generating broad-spectrum resistance among the GmDR1-overexpressed transgenic soybean lines against two serious pathogens and two pests including spider mites, against which no known resistance genes have been identified in soybean and among the most other crop species.

plasma membrane↗

Evaluating the Potential for Remote In-Process Monitoring of Tool Wear in Friction Stir Welding of Stainless Steel

A wear characterization study was performed to determine the useful lifetime of Polycrystalline Cubic Boron Nitride tooling for the friction stir welding (FSW) of stainless steel samples in support of a nuclear repair welding research and development program. In-situ and ex-situ laser profilometry were utilized as primary methods of monitoring tool geometry degradation, and volumetric defects were detected through both non-destructive and destructive techniques, as repeated welds of a standard sample configuration were produced. The spectral content of weld forces were examined to search for indications of evolving material flow conditions, caused by significant tool wear, that would result in the formation of defects, and an artificial neural network was trained and evaluated as a means of automatically detecting these conditions. Here, the resulting performance constituted a successful demonstration of in-process monitoring of tool wear and weld quality in FSW of a high melting temperature, high hardness material.

36 MATERIALS SCIENCE↗

Analytics for Massive Heat Maps

High throughput instrumentation for genomics is producing data orders of magnitude greater than even a decade before. Biologists often visualize the data of these experiments through the use of heat maps. For large datasets, heat map visualizations do not scale. These visualizations are only capable of displaying a portion of the data, making it difficult for scientists to find and detect patterns that span more than a subsection of the data. We present a novel method that provides an interactive visual display for massive heat maps [O(108)]. Our process shows how a massive heat map can be decomposed into multiple levels of abstraction to represent the underlying macrostructures. We aggregate these abstractions into a framework that can allow real-time navigation of the space. To further assist pattern discovery, we ground our system on the principle of focus+context. Our framework also addresses the issue of balancing the memory and display resolution and heat map size. We will show that this technique for biologists provides a powerful new visual metaphor for analyzing massive datasets.

59 BASIC BIOLOGICAL SCIENCES↗

An Evaluation of Signal Processing Tools for Improving Phased Array Ultrasonic Weld Inspection

Cast austenitic stainless steel (CASS) commonly used in U.S. nuclear power plants is a coarse-grained, elastically anisotropic material. The coarse-grained nature of CASS makes ultrasonic inspection of in-service components difficult. Recently, low-frequency phased array ultrasound has emerged as a candidate for the CASS piping weld inspection. However, issues such as low signal-to-noise ratio and difficulty in discriminating between flaw and non-flaw signals remain. This paper discusses the evaluation of a number of signal processing algorithms for improving flaw detection in CASS materials. The full paper provides details of the algorithms being evaluated, along with preliminary results.

automated flaw detection↗

Efficient pattern matching on GPUs for intrusion detection systems

Pattern matching is at the core of many security applications, like Network Intrusion Detection Systems (NIDS), spam filters and virus scanner. The always growing traffic on networks requires the ability to recognize potentially malicious signatures effectively, fastly and possibly in real time, without afftecting the performance and the latencies of the connections. Unfortunately, pattern matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. Graphic Processing Units (GPU) have become an interesting target for such high-througput applications, but the algorithms and the data structures need to be redesigned to be parallelized and adapted to the underlining hardware, coping with the limitations imposed by these architectures. In this paper we present an efficient implementation of the Aho-Corasick pattern matching algorithm on GPU, showing how we progressively redesigned the algorithm and the data structures to fit on the architecture and comparing it with equivalent implementations on the CPU and with previous work. We show that with realistic TCP-IP workloads and signatures, our implementation obtains a speedup of 6.5 with respect to CPU implementations and of two times when compared to previous GPU solutions.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Continuous Subgraph Queries on Streams

Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

99 GENERAL AND MISCELLANEOUS↗

Demonstration of emulator-based Bayesian calibration of safety analysis codes: Theory and formulation

System codes for simulation of safety performance of nuclear plants may contain parameters whose values are not known very accurately. New information from tests or operating experience is incorporated into safety codes by a process known as calibration, which reduces uncertainty in the output of the code and thereby improves its support for decision-making. The work reported here implements several improvements on classic calibration techniques afforded by modern analysis techniques. The key innovation has come from development of code surrogate model (or code emulator) construction and prediction algorithms. Use of a fast emulator makes the calibration processes used here with Markov Chain Monte Carlo (MCMC) sampling feasible. This study uses Gaussian Process (GP) based emulators, which have been used previously to emulate computer codes in the nuclear field. The present work describes the formulation of an emulator that incorporates GPs into a factor analysis-type or pattern recognition-type model. This “function factorization” Gaussian Process (FFGP) model allows overcoming limitations present in standard GP emulators, thereby improving both accuracy and speed of the emulator-based calibration process. Calibration of a friction-factor example using a Method of Manufactured Solution is performed to illustrate key properties of the FFGP based process.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗