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 379 records · Page 21

Forward Drift Chamber for the GlueX experiment

The GlueX experiment will search for exotic mesons produced by 9 GeV linearly polarized photon beams from the 12GeV CEBAF machine. Hermetic solenoid-based detector system that includes tracking and calorimetry is in the final construction phase. The Forward Drift Chamber consists of 24 circular planar drift chambers of $1~m$ diameter. Additional cathode strip information is required to achieve efficient pattern recognition in forward direction, resulting in 12,000 readout channels in total. Description and results from the tests of the completed detector will be presented. Challenges related to the specific features of the detector will be discussed.

Pentchev, Lubomir↗

Optimisation of the Search for CP-symmetry Violation at the Deep Underground Neutrino Experiment

The Deep Underground Neutrino Experiment (DUNE) is a next-generation long baseline experiment, which will be situated in South Dakota. Its detectors will utilise liquid-argon time projection chamber technology, which is able to capture neutrino interactions with an incredible spatial and calorimetric resolution. With what will become the world’s most intense neutrino beam, a highly capable near detector, and four (10kt fducial mass) far detector modules, DUNE will be able to achieve an ambitious physics programme. Most notably, DUNE will determine whether charge-parity symmetry is broken in neutrino oscillations - a finding that would have significant implications for the understanding of the matter-antimatter asymmetry in our Universe.This thesis presents the optimisation of a CP-violation analysis at DUNE using thePandora pattern-recognition software. The analysis assumes a 3.5 year exposure (1.36 × 1023 protons on target) to a neutrino and an antineutrino beam (7 year total). Only the predicted data of the far detector modules is used; near detector samples are not included. The initial sensitivity to CP-violation is found to be 3.8σ+0.9σ−1.1σ in an estimate that includes oscillation parameter uncertainties, systematic uncertainties and statistical fluctuations, and assumes a normal-ordering of the neutrino mass hierarchy. The performance of the Pandora event reconstruction is linked to that of the analysis, which is found to be limited by the reconstruction of the initial track-like region of electrons and photons. The ShowerRefinement algorithm is developed in response to this and its implementation into the analysis workflow results in an improved sensitivity to CP-violation of 4.6σ+0.9σ−1.0σ. With a perfected neutrino interaction vertex placement, this is further increased to 5.1σ+1.0σ−1.1σ.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integrated metabolomic analysis of the nano-sized copper particle-induced hepatotoxicity and nephrotoxicity in rats: A rapid invivo screening method for nanotoxicity

Despite an increasing application of copper nanoparticles, there is a serious lack of information concerning their impact on human health and the environment. In this study, the biochemical compositions of urine, serum, and extracts of liver and kidney tissues of rats treated with nano-copper at the different doses (50, 100, and 200 mg/kg/d for 5 d) were investigated using {sup 1}H NMR techniques with the pattern recognition methods. Serum biochemical analysis and histopathological examinations of the liver and kidney of all the rats were simultaneously performed. All the results indicated that the effects produced by nano-copper at a dose of 100 or 50 mg/kg/d were less than those induced at a higher dose of 200 mg/kg/d. Nano-copper induced overt hepatotoxicity and nephrotoxicity at 200 mg/kg/d for 5 d, which mainly involved scattered dot hepatocytic necrosis and widespread renal proximal tubule necrosis. Increased citrate, succinate, trimethylamine-N-oxide, glucose, and amino acids, accompanied by decreased creatinine levels were observed in the urine; furthermore, elevated levels of lactate, 3-hydroxybutyrate, acetate, creatine, triglycerides, and phosphatide and reduced glucose levels were observed in the serum. The predominant changes identified in the liver tissue aqueous extracts included increased lactate and creatine levels together with reduced glutamine and taurine levels, and the metabolic profile of the kidney tissue aqueous extracts showed an increase in lactate and a drop in glucose. In the chloroform/methanol extracts of the liver and kidney tissues, elevated triglyceride species were identified. These changes suggested that mitochondrial failure, enhanced ketogenesis, fatty acid {beta}-oxidation, and glycolysis contributed to the hepatotoxicity and nephrotoxicity induced by nano-copper at 200 mg/kg/d for 5 d. An increase in triglycerides in the serum, liver and kidney tissues could serve as a potential sensitive biomarker reflecting the lipidosis induced by nano-copper. The data generated from the current study completely supports the fact that an integrated metabolomic approach is promising for the development of a rapid invivo screening method for nanotoxicity.

60 APPLIED LIFE SCIENCES↗

Status of DUNE Offline Computing

We summarize the status of Deep Underground Neutrino Experiment (DUNE) Offline Software and Computing program. We describe plans for the computing infrastructure needed to acquire, catalog, reconstruct, simulate and analyze the data from the DUNE experiment and its prototypes in pursuit of the experiment's physics goals of precision measurements of neutrino oscillation parameters, detection of astrophysical neutrinos, measurement of neutrino interaction properties and searches for physics beyond the Standard Model. In contrast to traditional HEP computational problems, DUNE's Liquid Argon Time Projection Chamber data consist of simple but very large (many GB) data objects which share many characteristics with astrophysical images. We have successfully reconstructed and simulated data from 4% prototype detector runs at CERN. The data volume from the full DUNE detector, when it starts commissioning late in this decade will present memory management challenges in conventional processing but significant opportunities to use advances in machine learning and pattern recognition as a frontier user of High Performance Computing facilities capable of massively parallel processing. Our goal is to develop infrastructure resources that are flexible and accessible enough to support creative software solutions as HEP computing evolves.

43 PARTICLE ACCELERATORS↗

Generalizing mkFit and its Application to HL-LHC

mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both thread- and data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offline workflow of the CMS experiment. The CMS tracking performs a series of iterations, targeting reconstruction of tracks of increasing difficulty after removing hits associated to tracks found in previous iterations. mkFit has been adopted for several of the tracking iterations, which contribute to the majority of reconstructed tracks. When tested in the standard conditions for production jobs, speedups in track pattern recognition are on average of the order of 3.5x for the iterations where it is used (3-7x depending on the iteration). Multiple factors contribute to the observed speedups, including vectorization and a lightweight geometry description, as well as improved memory management and single precision. Efficient vectorization is achieved with both the icc and the gcc (default in CMSSW) compilers and relies on a dedicated library for small matrix operations, Matriplex, which has recently been released in a public repository. While the mkFit geometry description already featured levels of abstraction from the actual Phase-1 CMS tracker, several components of the implementations were still tied to that specific geometry. We have further generalized the geometry description and the configuration of the run-time parameters, in order to enable support for the Phase-2 upgraded tracker geometry for the HL-LHC and potentially other detector configurations. The implementation strategy and high-level code changes required for the HL-LHC geometry are presented. Speedups in track building from mkFit imply that track fitting becomes a comparably time consuming step of the tracking chain.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Artificial Neural Network Representation of Dynamic Criticality Excursion Experiment Data

This paper outlines time dependent considerations in applying the artificial neural network (ANN) paradigm to dynamic nuclear criticality excursion experiment data. The ANN amongst a variety of uses, can apply to function fitting of multiple input-multiple output data sets, pattern recognition, cluster analysis, and time series prediction. The ANN is a component of Machine Learning (ML) data analysis. The practical application of ML to criticality safety has been funded through the Y-12 Plant Directed Research and Demonstration (PDRD) program to support criticality safety and emergency planning efforts. The initial effort considered function fitting of criticality excursion data. Recent efforts successfully extended the ANN to criticality safety code validation. The initial ANN work applied to criticality excursions centered around multivariate function fitting of static (tabular) data taken from the French Consequences Radiologiques d'un Accident de Criticite (CRAC) and SILENE reactor campaigns. The former report (LeCorche) summarized important tabular data for the first 44 CRAC experiments. The initial ANN was trained to specific time-independent inputs, then applied to predict peak fission rate and total fissions for a wide variety of fissile solutions process conditions. This work extends that effort to apply the ANN paradigm to dynamic prediction of time-dependent criticality excursion experiment data. A dynamic criticality excursion in fissile solution represents a complex multiphysics phenomenon. Factors include among other things, coupled neutronic, multiphase fluid flow, temperature, pressure, acoustic shock, boiling heat transfer, reactivity feedback, and radiolytic gas considerations. There have been many efforts to model (over time) as coupled ordinary and (space) as partial differential equations (ODE, PDE). The ANN representation noted here does not rely on solving explicit ODE or PDEs. Rather the intent is to demonstrate that as a time series, the criticality excursion can be predicted by training specific ANN architectures to experimental input and output time series exclusively. The rationale for extending this work to the time-dependent regime is important in developing a 'criticality excursion emulator' solely on the basis of learning characteristics from experiment dynamic data. An emulator is different than a computer code simulator driven by the solution of ODEs and PDEs given select 'tuning parameters' that match outputs to experiments. A criticality excursion emulator, derived exclusively from an ANN or ML, could predict most likely excursion characteristics, trained from historic dynamic experiment data, presented with input values within the range of those experiments. The work noted shows that generic time-series ANN architectures can be satisfactorily applied to the prediction of dynamic, extremely chaotic criticality excursion power given an initial time dependent input series. In reality, an excursion emulator could be driven by user-supplied initial (t=0), time independent or constant values to generate time dependent outputs. Thus ongoing work includes developing a custom ANN such that initial dynamic conditions would be predicted. Those results then serve as inputs to a customized ANN architecture currently in development. (author)

42 ENGINEERING↗

A new track finding algorithm based on a multi-dimensional extension of the Hough Transform

We introduce a new pattern recognition algorithm for track finding in High Energy Physics Experiments based on an extension of the Hough Transform to multiple dimensions. A remarkable property of this algorithm is that the execution time is simply proportional to the total number of the hits to be processed, making it particularly attractive for high occupancy situations. The algorithm needs to be trained using a sufficiently large set of simulated tracks. The same track finding algorithm can be used for very different detector geometries and only the set of simulated tracks used for training needs to be changed. The particular structure of the algorithm also lends itself naturally to parallel hardware implementations which, combined with its intrinsic flexibility, should provide a most powerful tool for triggering at future colliders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Human-machine interactions

Digital technology utilizing a cognitive model based on human naturalistic decision-making processes, including pattern recognition and episodic memory, can reduce the dependency of human-machine interactions on the abilities of a human user and can enable a machine to more closely emulate human-like responses. Such a cognitive model can enable digital technology to use cognitive capacities fundamental to human-like communication and cooperation to interact with humans.

97 MATHEMATICS AND COMPUTING↗

Recognition of a Mononucleosomal Histone Modification Pattern by BPTF via Multivalent Interactions

Little is known about how combinations of histone marks are interpreted at the level of nucleosomes. The second PHD finger of human BPTF is known to specifically recognize histone H3 when methylated on lysine 4 (H3K4me2/3). Here, we examine how additional heterotypic modifications influence BPTF binding. Using peptide surrogates, three acetyllysine ligands are indentified for a PHD-adjacent bromodomain in BPTF via systematic screening and biophysical characterization. Although the bromodomain displays limited discrimination among the three possible acetyllysines at the peptide level, marked selectivity is observed for only one of these sites, H4K16ac, in combination with H3K4me3 at the mononucleosome level. In support, these two histone marks constitute a unique trans-histone modification pattern that unambiguously resides within a single nucleosomal unit in human cells, and this module colocalizes with these marks in the genome. Together, our data call attention to nucleosomal patterning of covalent marks in dictating critical chromatin associations.

59 BASIC BIOLOGICAL SCIENCES↗

Face recognition system and method using face pattern words and face pattern bytes

The present invention provides a novel system and method for identifying individuals and for face recognition utilizing facial features for face identification. The system and method of the invention comprise creating facial features or face patterns called face pattern words and face pattern bytes for face identification. The invention also provides for pattern recognitions for identification other than face recognition. The invention further provides a means for identifying individuals based on visible and/or thermal images of those individuals by utilizing computer software implemented by instructions on a computer or computer system and a computer readable medium containing instructions on a computer system for face recognition and identification.

97 MATHEMATICS AND COMPUTING↗

Spatiotemporal pattern detection, generation, and computation with circuits

Abstract Implementations of neurons, delays, and synapse circuits are presented with simulations. These neural elements are used to create two small spiking neural networks, the Rate-Window and Order-Biased clusters, which are capable of detecting simple two-spike spatiotemporal patterns. A simple pattern detecting network (SPDN) is created by combining the Rate-Window and Order-Biased clusters, where clusters are small spiking neural networks, and its simple pattern detection ability is demonstrated in simulation. The SPDN is used to implement a complex pattern detecting network (CPDN) and its complex pattern detection ability is demonstrated in simulation. Methods for generating arbitrary spatiotemporal patterns are presented. The CPDN and spatiotemporal pattern generation methods are then used to implement a novel spatiotemporal computing paradigm based on detecting and responding to spatiotemporal symbols. A simulation of a spatiotemporal half adder is presented to demonstrate the computing paradigm.

97 - MATHEMATICS AND COMPUTING↗

Performance of heavy-flavour jet identification in Lorentz-boosted topologies in proton-proton collisions at √(s) = 13 TeV

Measurements in the highly Lorentz-boosted regime provoke increased interest in probing the Higgs boson properties and in searching for particles beyond the standard model at the LHC. In the CMS Collaboration, various boosted-object tagging algorithms, designed to identify hadronic jets originating from a massive particle decaying to bb̅ or cc̅, have been developed and deployed across a range of physics analyses. This paper highlights their performance on simulated events, and summarizes novel calibration techniques using proton-proton collision data collected at √(s) = 13 TeV during the 2016–2018 LHC data-taking period. Three dedicated methods are used for the calibration in multijet events, leveraging either machine learning techniques, the presence of muons within energetic boosted jets, or the reconstruction of hadronically decaying high-energy Z bosons. The calibration results, obtained through a combination of these approaches, are presented and discussed.

Pattern recognition↗

Energy calibration of germanium detectors for the Majorana Demonstrator

The Majorana Demonstrator was a search for neutrinoless double-beta decay (0νββ) in the 76 Ge isotope. It was staged at the 4850-foot level of the Sanford Underground Research Facility (SURF) in Lead, SD. The experiment consisted of 58 germanium detectors housed in a low background shield and was calibrated once per week by deploying a 228 Th line source for 1 to 2 hours. The energy scale calibration determination for the detector array was automated using custom analysis tools. We describe the offline procedure for calibration of the Demonstrator germanium detectors, including the simultaneous fitting of multiple spectral peaks, estimation of energy scale uncertainties, and the automation of the calibration procedure.

47 OTHER INSTRUMENTATION↗

Insect taste receptors relevant to host identification by recognition of secondary metabolite patterns of non-host plants

Highlights: • Three putative bitter gustatory receptor of silkworm respond to several secondary metabolites in non-host plants. • Secondary metabolites responsive to the gustatory receptor are representative feeding-deterrents in non-host plants. • One feeding-deterrent gustatory receptor respond to multiple feeding deterrents. • Feeding deterrent receptors are expressed in silkworm mouthparts. • Representative secondary metabolite of a non-host plant, coumarin exactly had a suppressive effect on food intake of silkworm. The taste sensing system is crucial for food recognition in insects and other animals. It is commonly believed that insect gustatory receptors (Grs) expressed in gustatory organs are indispensable for host plant selection. Many behavioral studies have shown that mono- or oligo-phagous lepidopteran insects use the balance between feeding attractants and feeding deterrents in host plants and that these are sensed by taste organs for host plant recognition. However, the molecular mechanism underlying taste recognition, especially of feeding deterrents, remains to be elucidated. To better understand this mechanism, we studied orphan Grs, including Bombyx mori Gr (BmGr) 16, BmGr18, and BmGr53, from the mono-phagous insect, Bombyx mori. Using Calcium imaging in mammalian cells, we first confirmed in lepidoptera insects that three of the putative bitter Grs widely responded to structurally different feeding deterrents. Although the phylogenetic distance of these Grs was considerable, they responded to partially overlapping deterrents of plant secondary metabolites. These findings suggest that not only these three Grs but also most of the Grs that have been assigned to putative bitter Grs are feeding-deterrent receptors that play a role in host plant recognition.

60 APPLIED LIFE SCIENCES↗

An Organic Model for Detecting Cyber Events

Cyber entities in many ways mimic the behavior of organic systems. Individuals or groups compete for limited resources using a variety of strategies and effective strategies are re-used and refined in later ‘generations’. Traditionally this drift has made detection of malicious entities very difficult because 1) recognition systems are often built on exact matching to a pattern that can only be ‘learned’ after a malicious entity reveals itself and 2) the enormous volume and variation in benign entities is an overwhelming source of previously unseen entities that often confound detectors. To turn the tables of complexity on the would-be attackers, we have developed a method for mapping the sequence of behaviors in which cyber entities engage to strings of text and analyze these strings using modified bioinformatics algorithms. Bioinformatics algorithms optimize the alignment between text strings even in the presence of mismatches, insertions or deletions and do not require an a priori definition of the patterns one is seeking. Nor does it require any type of exact matching. This allows the data itself to suggest meaningful patterns that are conserved between cyber entities. We demonstrate this method on data generated from network traffic. The impact of this approach is that it can rapidly calculate similarity measures of previously unseen cyber entities in terms of well-characterized entities. These measures may also be used to organize large collections of data into families, making it possible to identify motifs indicative of each family.

97 MATHEMATICS AND COMPUTING↗

Assessing the Dynamics and Complexity of Disease Pathogenicity Using 4-Dimensional Immunological Data

Investigating disease pathogenesis and personalized prognostics are major biomedical needs. Because patients sharing the same diagnosis can experience different outcomes, such as survival or death, physicians need new personalized tools, including those that rapidly differentiate several inflammatory phases. To address these topics, a pattern recognition-based method (PRM) that follows an inverse problem approach was designed to assess, in <10 min, eight concepts: synergy , pleiotropy , complexity , dynamics , ambiguity , circularity , personalized outcomes , and explanatory prognostics (pathogenesis). By creating thousands of secondary combinations derived from blood leukocyte data, the PRM measures synergic, pleiotropic, complex and dynamic data interactions, which provide personalized prognostics while some undesirable features—such as false results and the ambiguity associated with data circularity-are prevented. Here, this method is compared to Principal Component Analysis (PCA) and evaluated with data collected from hantavirus-infected humans and birds that appeared to be healthy. When human data were examined, the PRM predicted 96.9 % of all surviving patients while PCA did not distinguish outcomes. Demonstrating applications in personalized prognosis, eight PRM data structures sufficed to identify all but one of the survivors. Dynamic data patterns also distinguished survivors from non-survivors, as well as one subset of non-survivors, which exhibited chronic inflammation. When the PRM explored avian data, it differentiated immune profiles consistent with no, early, or late inflammation. Yet, PCA did not recognize patterns in avian data. Findings support the notion that immune responses, while variable, are rather deterministic: a low number of complex and dynamic data combinations may be enough to, rapidly, unmask conditions that are neither directly observable nor reliably forecasted.

60 APPLIED LIFE SCIENCES↗

Patterns and plasticity in RNA-protein interactions enable recruitment of multiple proteins through a single site

mRNA control hinges on the specificity and affinity of proteins for their RNA binding sites. Regulatory proteins must bind their own sites and reject even closely related noncognate sites. In the PUF [Pumilio and fem-3 binding factor (FBF)] family of RNA binding proteins, individual proteins discriminate differences in the length and sequence of binding sites, allowing each PUF to bind a distinct battery of mRNAs. Here, we show that despite these differences, the pattern of RNA interactions is conserved among PUF proteins: the two ends of the PUF protein make critical contacts with the two ends of the RNA sites. Despite this conserved 'two-handed' pattern of recognition, the RNA sequence is flexible. Among the binding sites of yeast Puf4p, RNA sequence dictates the pattern in which RNA bases are flipped away from the binding surface of the protein. Small differences in RNA sequence allow new modes of control, recruiting Puf5p in addition to Puf4p to a single site. This embedded information adds a new layer of biological meaning to the connections between RNA targets and PUF proteins.

59 BASIC BIOLOGICAL SCIENCES↗

Improving image segmentation by learning region affinities

We utilize the context information of other regions in hierarchical image segmentation to learn new regions affinities. It is well known that a single choice of quantization of an image space is highly unlikely to be a common optimal quantization level for all categories. Each level of quantization has its own benefits. Therefore, we utilize the hierarchical information among different quantizations as well as spatial proximity of their regions. The proposed affinity learning takes into account higher order relations among image regions, both local and long range relations, making it robust to instabilities and errors of the original, pairwise region affinities. Once the learnt affinities are obtained, we use a standard image segmentation algorithm to get the final segmentation. Moreover, the learnt affinities can be naturally unutilized in interactive segmentation. Experimental results on Berkeley Segmentation Dataset and MSRC Object Recognition Dataset are comparable and in some aspects better than the state-of-art methods.

47 OTHER INSTRUMENTATION↗