Search NASA⌕ Search

SEARCH · Search NASA

Results for “Finder”

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 19 records

Utility Finder (U-Finder) Tool

U-Finder allows users to search for and identify local utility partners and electric vehicle charger incentives by state or ZIP code. U-Finder pulls from the Homeland Infrastructure Foundation-Level Database of Electric Retail Service Territories to identify utility service territories. Utility incentive listings are provided by utility associations, and state government incentive listings are pulled from the Alternative Fuels Data Center Laws and Incentives website. ![U Finder landing page](ufinder-landing.png)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

COMPASO : A new halo finder for competitive assignment to spherical overdensities

We describe a new method (compaso) for identifying groups of particles in cosmological N-body simulations. compaso builds upon existing spherical overdensity (SO) algorithms by taking into consideration the tidal radius around a smaller halo before competitively assigning halo membership to the particles. In this way, the compaso finder allows for more effective deblending of haloes in close proximity as well as the formation of new haloes on the outskirts of larger ones. This halo-finding algorithm is used in the abacussummit suite of N-body simulations, designed to meet the cosmological simulation requirements of the Dark Energy Spectroscopic Instrument (DESI) survey. compaso is developed as a highly efficient on-the-fly group finder, which is crucial for enabling good load-balancing between the GPU and CPU and the creation of high-resolution merger trees. In this paper, we describe the halo-finding procedure and its particular implementation in abacus, accompanying it with a qualitative analysis of the finder. We test the robustness of the compaso catalogues before and after applying the cleaning method described in an accompanying paper and demonstrate its effectiveness by comparing it with other validation techniques. We then visualize the haloes and their density profiles, finding that they are well fit by the NFW formalism. Finally, we compare other properties such as radius–mass relationships and two-point correlation functions with that of another widely used halo finder, rockstar.

79 ASTRONOMY AND ASTROPHYSICS↗

P finder: genomic and metagenomic annotation of RNase P RNA gene (rnpB)

Abstract Background The rnpB gene encodes for an essential catalytic RNA (RNase P). Like other essential RNAs, RNase P’s sequence is highly variable. However, unlike other essential RNAs (i.e. tRNA, 16 S, 6 S,...) its structure is also variable with at least 5 distinct structure types observed in prokaryotes. This structural variability makes it labor intensive and challenging to create and maintain covariance models for the detection of RNase P RNA in genomic and metagenomic sequences. The lack of a facile and rapid annotation algorithm has led to the rnpB gene being the most grossly under annotated essential gene in completed prokaryotic genomes with only a 24% annotation rate. Here we describe the coupling of the largest RNase P RNA database with the local alignment scoring algorithm to create the most sensitive and rapid prokaryote rnpB gene identification and annotation algorithm to date. Results Of the 2772 completed microbial genomes downloaded from GenBank only 665 genomes had an annotated rnpB gene. We applied P Finder to these genomes and were able to identify 2733 or nearly 99% of the 2772 microbial genomes examined. From these results four new rnpB genes that encode the minimal T-type P RNase P RNAs were identified computationally for the first time. In addition, only the second C-type RNase P RNA was identified in Sphaerobacter thermophilus . Of special note, no RNase P RNAs were detected in several obligate endosymbionts of sap sucking insects suggesting a novel evolutionary adaptation. Conclusions The coupling of the largest RNase P RNA database and associated structure class identification with the P Finder algorithm is both sensitive and rapid, yielding high quality results to aid researchers annotating either genomic or metagenomic data. It is the only algorithm to date that can identify challenging RNAse P classes such as C-type and the minimal T-type RNase P RNAs. P Finder is written in C# and has a user-friendly GUI that can run on multiple 64-bit windows platforms (Windows Vista/7/8/10). P Finder is free available for download at https://github.com/JChristopherEllis/P-Finder as well as a small sample RNase P RNA file for testing.

59 BASIC BIOLOGICAL SCIENCES↗

An Extended Halo-based Group/Cluster Finder: Application to the DESI Legacy Imaging Surveys DR8

We extend the halo-based group finder developed by Yang et al. (2005c) to use data simultaneously with either photometric or spectroscopic redshifts. A mock galaxy redshift survey constructed from a high-resolution N-body simulation is used to evaluate the performance of this extended group finder. For galaxies with magnitude z ≤ 21 and redshift 0 < z ≤ 1.0 in the DESI legacy imaging surveys (the Legacy Surveys), our group finder successfully identifies more than 60% of the members in about 90% of halos with mass ≳10 12.5 h –1 M ⊙ . Detected groups with mass ≳10 12.0 h –1 M ⊙ have a purity (the fraction of true groups) greater than 90%. The halo mass assigned to each group has an uncertainty of about 0.2 dex at the high-mass end ≳10 13.5 h –1 M ⊙ and 0.45 dex at the low-mass end. Groups with more than 10 members have a redshift accuracy of ~0.008. We apply this group finder to the Legacy Surveys DR8 and find 6.4 million groups with at least three members. About 500,000 of these groups have at least 10 members. Furthermore, the resulting catalog containing 3D coordinates, richness, halo masses, and total group luminosities is made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

The Tiny Triplet Finder as a Versatile Track Segment Seeding Engine for Trigger Systems

In high energy physics experiment trigger systems, track segment seeding is a resource consuming function and the primary reason is the computing complexity of the segment finding process. As the Moore's Law is reaching its physical limit, reducing computing complexity should be carefully considered, rather than keep piling up silicon resources. The Tiny Triplet Finder is a scheme that reduces the computing complexity of the segment seeding. As a proof of concept, a 3D track segment seeding engine core based on the Tiny Triplet Finder has been implemented and tested in a low-cost FPGA device. The seeding engine is designed to preselect and group hits (stubs) from detector layers to feed subsequent track fitting stage. The seeding engine consists of a Hough transform space for r-z view and a Tiny Triplet Finder for r-phi view to implement 3D constraints. The seeding engine is organized as a pipeline so that each hit is processed in a single clock cycle. Taking advantage of the register-like storage block scheme which enables effectively resetting of a block RAM within a single clock cycle, clearing or refreshing the seeding engine takes only one clock cycles between two events. The Tiny Triplet Finder is also a generic coincidence finding scheme that can be used for many tasks. As a versatility demonstration, track segment finding performances for two distinctive detector geometries are tested in our seeding engine. In a collider barrel-layer geometry, the fake segment rates are studied for 3D (i.e., both r-phi and r-z views) and 2D (i.e., r-phi or r-z view only) configurations for high hit multiplicity events (>4000 hits/layer in the barrel region). Another detector geometry contains strip plane layers with timing information. The numbers of coincidences, both real or fake, with or without timing ("3D" or "2D") information at various hit multiplicities are studied.

43 PARTICLE ACCELERATORS↗

Calibration of a single-point laser range finder and a camera

Laser and visual imagery have been broadly utilized in computer vision and mobile robotics applications because these sensors provide complementary information. Since the single-point laser range finder can provide depth information of a single pixel in the observed image, its price and size is very suitable for handheld devices or very lightweight robotic platforms. So the combination of a single-point laser range finder and a camera has become increasingly useful in recent report and industrial applications. In this paper, we propose two accurate calibration methods for determining the position and direction of the laser range finder relative to the camera. Furthermore, we can accomplish calibration even without observing the laser spot in camera image. We evaluate the two methods through experiments which demonstrate their efficiency and high reliability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probability friends-of-friends (PFOF) group finder: Performance study and observational data applications on photometric surveys

In tandem with observational data sets, we utilize realistic mock catalogs, based on a semi-analytic galaxy formation model, constructed specifically for Pan-STARRS1 Medium Deep Surveys to assess the performance of the Probability Friends-of-Friends (PFOF) group finder, and aim to develop a grouping optimization method applicable to surveys like Pan-STARRS1. Producing mock PFOF group catalogs under a variety of photometric redshift accuracies (σ{sub Δz/(1+z{sub s)}}), we find that catalog purities and completenesses from 'good' (σ{sub Δz/(1+z{sub s)}}∼ 0.01) to 'poor' (σ{sub Δz/(1+z{sub s)}}∼ 0.07) photo-zs gradually degrade from 77% and 70% to 52% and 47%, respectively. A 'subset optimization' approach is developed by using spectroscopic-redshift group data from the target field to train the group finder for application to that field and demonstrated using zCOSMOS groups for PFOF searches within PS1 Medium Deep Field04 (PS1MD04) and DEEP2 EGS groups in PS1MD07. With four data sets spanning the photo-z accuracy range from 0.01 to 0.06, we find purities and completenesses agree with their mock analogs. Further tests are performed via matches to X-ray clusters. We find PFOF groups match ∼85% of X-ray clusters identified in COSMOS and PS1MD04, lending additional support to the reliability of the detection algorithm. In the end, we demonstrate, by separating red and blue group galaxies in the EGS and PS1MD07 group catalogs, that the algorithm is not biased with respect to specifically recovering galaxies by color. The analyses suggest the PFOF algorithm shows great promise as a reliable group finder for photometric galaxy surveys of varying depth and coverage.

79 ASTRONOMY AND ASTROPHYSICS↗

XRF-ROI Finder: Machine Learning to Guide Region-of-Interest Scanning for X-ray Fluorescence Microscopy

The ROI-finder software is being developed for use by several Microscopy Group beamlines at Argonne National Laboratory, including 2-ID microprobes and 9-ID-B Bionanoprobe which use multi-scale scanning fluorescence microscopy to acquire elemental maps (multi-modal image data). Microscopy experiments require scan of samples at a coarse resolution followed by ROI identification using feature detection based on domain expertise. Finer resolution scans are then conducted based on identified ROI. The decision-making process based on domain expertise will be difficult to perform for faster data rates and much larger sampling volumes anticipated after APS-U necessitating the need for the ROI-finder software. The ROI- finder detects regions of interest through a continuous learning process, starting with a unsupervised representation learning and improving its recommendations through supervised learning and an interactive tool for user annotation. The scope of ongoing development efforts includes the integration of image registration module to correlate optical and X-ray images, extraction of feature morphology as well as elemental signatures in the image space and incorporation of beamtime streaming data by the scanning probe via EPICS.

CHOWDHURY, M. ARSHAD ZAHANGIR↗

symfind : Addressing the Fragility of Subhalo Finders and Revealing the Durability of Subhalos

Abstract A major question in ΛCDM is what this theory actually predicts for the properties of subhalo populations. Subhalos are difficult to accurately simulate and to find within simulations, and this propagates into uncertainty in theoretical predictions for satellite galaxies. We present Symfind , a new particle-tracking-based subhalo finder, and demonstrate that it can track subhalos to orders-of-magnitude lower masses than commonly used halo-finding tools, with a focus on Rockstar and consistent-trees . These longer survival times mean that at a fixed peak subhalo mass, we find ≈ 15%–40% more subhalos within the virial radius, R vir , and ≈35%–120% more subhalos within R vir /4 in the Symphony dark-matter-only simulation suite. More subhalos are found as the resolution is increased, in contrast to the Rockstar halo finder, which appears to be converged at smaller subhalo counts. We perform extensive numerical testing. In agreement with idealized simulations, we show that the v max , the maximum circular velocity, is systematically biased low until high resolutions ( n peak ≳ 3 × 10 4 ) are achieved, but that mass loss itself can be resolved at much more modest resolutions ( n peak ≳ 4 × 10 3 ). We show that Rockstar converges to false solutions for the mass function, radial distribution, and disruption masses of subhalos. We argue that our new method can trace resolved subhalos until the point of typical galaxy disruption without invoking post hoc orphan modeling. We outline a concrete set of steps for determining whether other subhalo finders meet the same criteria. We publicly release Symfind catalogs and particle data for the Symphony simulation suite at http://web.stanford.edu/group/gfc/symphony .

79 ASTRONOMY AND ASTROPHYSICS↗

Path Finder

PathFinder is a graph search program, traversing a directed cyclic graph to find pathways between labeled nodes. Searches for paths through ordered sequences of labels are termed signatures. Determining the presence of signatures within one or more graphs is the primary function of Path Finder. Path Finder can work in either batch mode or interactively with an analyst. Results are limited to Path Finder whether or not a given signature is present in the graph(s).

Rigdon, J. Brian↗

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗

SCONCE : a cosmic web finder for spherical and conic geometries

The latticework structure known as the cosmic web provides a valuable insight into the assembly history of large-scale structures. Despite the variety of methods to identify the cosmic web structures, they mostly rely on the assumption that galaxies are embedded in a Euclidean geometric space. Here, we present a novel cosmic web identifier called SCONCE (Spherical and CONic Cosmic wEb finder) that inherently considers the 2D (RA, DEC) spherical or the 3D (RA, DEC, z) conic geometry. The proposed algorithms in sconce generalize the well-known subspace constrained mean shift (SCMS) method and primarily address the predominant filament detection problem. They are intrinsic to the spherical/conic geometry and invariant to data rotations. We further test the efficacy of our method with an artificial cross-shaped filament example and apply it to the SDSS galaxy catalogue, revealing that the 2D spherical version of our algorithms is robust even in regions of high declination. Finally, using N-body simulations from Illustris, we show that the 3D conic version of our algorithms is more robust in detecting filaments than the standard SCMS method under the redshift distortions caused by the peculiar velocities of haloes. Our cosmic web finder is packaged in python as SCONCE-SCMS and has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

P Finder

P Finder is written in C# and has been tested in multiple 64-bit Windows environments (Windows 7/8/Vista). It has a user-friendly graphical user interface (GUI) that allows for intuitive RNase P RNA identification and/or annotation. The user can select from four search criteria including the use multiple threads. In addition, the user can determine what display data they wish to incorporate in the output such as: bitscore, E-value, percent ID, start location, end location, the strand in which the sequence is located, and of course the sequence itself. P Finder is the only available algorithm that is capable of not only identifying the RNase P RNA for annotation but also differentiating among the five different RNase P RNA structural types (A, B, C, M, and T) with the option to select these data types for display in the final output.

Ellis, JosephC↗

A 3D FPGA Track Segment Seeding Engine Based on the Tiny Triplet Finder

A 3D track segment seeding engine core based on the Tiny Triplet Finder has been implemented and tested in a low-cost FPGA device. The seeding engine is designed to preselect and group hits (stubs) from cylindrical detector layers to feed subsequent track fitting stage. The seeding engine consists of a Hough transform space for r-z view and a Tiny Triplet Finder for r-phi view to implement 3D constraints. The seeding engine is organized as a pipeline so that each hit is processed in a single clock cycle. Test results show that the seeding engine operates as expected.

Wu, Jinyuan↗

Advancing Federal Infrastructure Through Innovation: Connecting to Utilities with EV U-Finder

Executive Order 14057 requires federal agencies to achieve 100 percent zero-emission vehicle (ZEV) acquisitions by 2035. In order to do so, agencies will need to work closely with their local utilities to successfully manage the electric vehicle supply equipment development to support the ZEV fleet. NREL, with the support of DOE FEMP, has developed the Electric Vehicle Utility Finder (EV U-Finder) tool to help local fleet managers find utility contacts and incentives.

ADVANCED PROPULSION SYSTEMS,POWER TRANSMISSION AND↗

Bragg Spot Finder (BSF): a new machine-learning-aided approach to deal with spot finding for rapidly filtering diffraction pattern images

Macromolecular crystallography contributes significantly to understanding diseases and, more importantly, how to treat them by providing atomic resolution 3D structures of proteins. This is achieved by collecting X-ray diffraction images of protein crystals from important biological pathways. Spotfinders are used to detect the presence of crystals with usable data, and the spots from such crystals are the primary data used to solve the relevant structures. Having fast and accurate spot finding is essential, but recent advances in synchrotron beamlines used to generate X-ray diffraction images have brought us to the limits of what the best existing spotfinders can do. This bottleneck must be removed so spotfinder software can keep pace with the X-ray beamline hardware improvements and be able to see the weak or diffuse spots required to solve the most challenging problems encountered when working with diffraction images. In this paper, we first present Bragg Spot Detection (BSD), a large benchmark Bragg spot image dataset that contains 304 images with more than 66 000 spots. We then discuss the open source extensible U-Net-based spotfinder Bragg Spot Finder (BSF), with image pre-processing, a U-Net segmentation backbone, and post-processing that includes artifact removal and watershed segmentation. Finally, we perform experiments on the BSD benchmark and obtain results that are (in terms of accuracy) comparable to or better than those obtained with two popular spotfinder software packages ( Dozor and DIALS ), demonstrating that this is an appropriate framework to support future extensions and improvements.

36 MATERIALS SCIENCE↗

Scanning Electrochemical and Photoelectrochemical Microscopy on Finder Grids: Toward Correlative Multitechnique Imaging of Surfaces

Scanning electrochemical microscopy (SECM) is a powerful technique for mapping surface reactivity and investigating heterogeneous processes on the nanoscale. Despite significant advances in high-resolution SECM and photo-SECM imaging, they cannot provide atomic scale structural information about surfaces. By correlating the SECM images with atomic scale structural and bonding information obtained by transmission electron microscopy (TEM) techniques with one-to-one correspondence, one can elucidate the nature of the active sites and understand the origins of heterogeneous surface reactivity. Here, to enable multitechnique imaging of the same nanoscale portion of the electrode surface, we develop a methodology for using a TEM finder grid as a conductive support in SECM and photo-SECM experiments. In this paper, we present the results of our first nanoscale SECM and photo-SECM experiments on carbon TEM grids, including imaging of semiconductor nanorods.

14 SOLAR ENERGY↗

A deep-learning based raw waveform region-of-interest finder for the liquid argon time projection chamber

The liquid argon time projection chamber (LArTPC) detector technology has an excellent capability to measure properties of low-energy neutrinos produced by the sun and supernovae and to look for exotic physics at very low energies. In order to achieve those physics goals, it is crucial to identify and reconstruct signals in the waveforms recorded on each TPC wire. In this work, we report on a novel algorithm based on a one-dimensional convolutional neural network (CNN) to look for the region-of-interest (ROI) in raw waveforms. We test this algorithm using data from the ArgoNeuT experiment in conjunction with an improved noise mitigation procedure and a more realistic data-driven noise model for simulated events. This deep-learning ROI finder shows promising performance in extracting small signals and gives an efficiency approximately twice that of the traditional algorithm in the low energy region of ~0.03–0.1 MeV. This method offers great potential to explore low-energy physics using LArTPCs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗