Search NASA⌕ Search

SEARCH · Search NASA

Results for “counting”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

A Short-Lived Isotope Counting System (SLICS) to measure reaction cross sections producing light, beta-decaying nuclei on OMEGA

A new activation detector optimized for short-lived isotopes was designed, installed, and tested on OMEGA. The Short-Lived Isotope Counting System (SLICS) can be positioned as close as 35 cm from the OMEGA target chamber center in a ten-inch-manipulator. Stable target samples can be mounted on the front end of the detector assembly to undergo triton-, deuteron-, or neutron-induced reactions that produce short-lived reaction products that beta decay. The emitted betas are detected in a phoswich configuration to eliminate the gamma background. The detector is optimized for isotopes with half-lives from 150 ms to 20 s, filling a gap in OMEGA’s current activation detectors for isotopes with half-lives >5 min. In a pilot study, SLICS achieved an efficiency of 24.5% ± 2.0% for counting 8Li, with a total of 505.8 ± 4.4 qualifying events. Using the existing triton laser-ion acceleration platform on OMEGA, this detector can be used to measure rarely studied tritium-induced reactions on light nuclei with an estimated uncertainty of 12%. As a result, the design of the detector and its performance during a first experiment employing deuterium as a surrogate will be discussed.

Beta spectrometry↗
DOE OSTI2026

Collision Tracking in OpenMC: Methods and Applications in Neutron Noise, Neutron Imaging, Time-of-Flight, and Multiplicity Counting

We present the development and application of a collision tracking feature within the OpenMC Monte Carlo particle transport code, designed for diverse applications such as neutron spectroscopy, scatter camera system, neutron noise, and multiplicity counting simulations. This feature enables the tracking of individual particle collisions, with potential applications in nuclear nonproliferation, reactor physics, and nuclear security. Additionally, the feature holds potential for the calibration of neutron detectors, specifically in converting light output into energy deposited within the detectors. The implementation consists of a set of filters—such as reaction type, energy, cell, and material—that constrain the set of collisions that are tracked, extensions to the Python API to enable simple input specification, and support for writing either OpenMC’s native HDF5-based format or the Monte Carlo particle list format. This feature was added to the official OpenMC release in version 0.15.3. In this work, the feature will be applied to showcase scenarios such as time-of-flight simulations, scatter-camera imaging for neutron source localization, neutron-noise analysis to extract integral kinetic parameters such as the prompt decay constant α, and multiplicity counting to estimate the mass of special nuclear materials. Ultimately, this feature aims to expand the application scope of open-source Monte Carlo particle transport codes such as OpenMC.

Monte Carlo code↗
DOE OSTI2021

Scaling pair count to next galaxy surveys

ABSTRACT Counting pairs of galaxies or stars according to their distance is at the core of real-space correlation analyses performed in astrophysics and cosmology. Upcoming galaxy surveys (LSST, Euclid) will measure properties of billions of galaxies challenging our ability to perform such counting in a minute-scale time relevant for the usage of simulations. The problem is only limited by efficient access to the data, hence belongs to the big data category. We use the popular Apache Spark framework to address it and design an efficient high-throughput algorithm to deal with hundreds of millions to billions of input data. To optimize it, we revisit the question of non-hierarchical sphere pixelization based on cube symmetries and develop a new one dubbed the ‘Similar Radius Sphere Pixelization’ (SARSPix) with very close to square pixels. It provides the most adapted indexing over the sphere for all distance-related computations. Using LSST-like fast simulations, we compute autocorrelation functions on tomographic bins containing between a hundred million to one billion data points. In each case, we achieve the construction of a standard pair-distance histogram in about 2 min, using a simple algorithm that is shown to scale, over a moderate number of nodes (16–64). This illustrates the potential of this new techniques in the field of astronomy where data access is becoming the main bottleneck. They can be easily adapted to other use-cases as nearest-neighbours search, catalogue cross-match or cluster finding. The software is publicly available from https://github.com/astrolabsoftware/SparkCorr.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Evidence of galaxy assembly bias in SDSS DR7 galaxy samples from count statistics

We present observational constraints on the galaxy–halo connection, focusing particularly on galaxy assembly bias from a novel combination of counts-in-cylinders statistics, P(N CIC ), with the standard measurements of the projected two-point correlation function w p (r p ), and number density n gal of galaxies. We measure n gal , w p (r p ), and P(N CIC ) for volume-limited, luminosity-threshold samples of galaxies selected from SDSS DR7, and use them to constrain halo occupation distribution (HOD) models, including a model in which galaxy occupation depends upon a secondary halo property, namely halo concentration. We detect significant positive central assembly bias for the M r < -20.0 and M r <-19.5 samples. Central galaxies preferentially reside within haloes of high concentration at fixed mass. Positive central assembly bias is also favoured in the M r < -20.5 and M r < -19.0 samples. We find no evidence of central assembly bias in the M r < -21.0 sample. We observe only a marginal preference for negative satellite assembly bias in the M r < -20.0 and M r < -19.0 samples, and non-zero satellite assembly bias is not indicated in other samples. Our findings underscore the necessity of accounting for galaxy assembly bias when interpreting galaxy survey data, and demonstrate the potential of count statistics in extracting information from the spatial distribution of galaxies, which could be applied to both galaxy–halo connection studies and cosmological analyses.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Power counting to saturation

We present a description of saturation in small 𝑥 deep inelastic scattering from power counting in a top-down effective theory derived from quantum chromodynamics (QCD). A factorization formula isolates the universal physics of the nucleus at leading power in 𝑥. The onset of saturation is then understood as a breakdown in the expansion in an emergent power counting parameter, which is defined by the matrix element of a gauge invariant operator. We identify a new radiation mode, which enables us to extend previous literature by distinguishing the appearance of the saturation scale from the transition to nonlinear evolution.

Astronomy & Astrophysics↗
DOE OSTI2025

Photon-Counting Interferometry to Detect Geontropic Space-Time Fluctuations with GQuEST

The gravity from the quantum entanglement of space-time (GQuEST) experiment uses tabletop-scale Michelson laser interferometers to probe for fluctuations in space-time. We present a practicable interferometer design featuring a novel photon-counting readout method that provides unprecedented sensitivity, as it is not subject to the interferometric standard quantum limit. We evaluate the potential of this design to measure space-time fluctuations motivated by recent “geontropic” quantum gravity models. The accelerated accrual of Fisher information offered by the photon-counting readout enables GQuEST to detect the predicted quantum gravity phenomena within measurement times at least 100 times shorter than equivalent conventional interferometers. The GQuEST design, thus, enables a fast and sensitive search for signatures of quantum gravity in a laboratory-scale experiment.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Learning to Count Grave Sites for Cemetery Observation Models With Satellite Imagery

Understanding how people occupy open spaces is important for research in support of population modeling, policy, national security, emergency response, and sustainability. For the past decade, there has been an increase in research toward capturing and reporting population dynamics and patterns of life at the building level and in some open public spaces such as cemeteries and parks. This is done through observation models developed from local sociocultural information acquired at various spatiotemporal scales to inform night, day, and episodic population occupancy estimates (people/1000 sq ft). Sociocultural information for cemeteries and parks is scarcely available and often collected manually. The process is not only marred by inconsistencies but is laborious and time consuming. In this study, we leverage convolutional neural networks (CNNs) and satellite imagery to derive grave site counts as proxy variables to support scalable and accurate sociocultural data required in a population observation model. Through a hybrid workflow (weak localization plus regression model), we characterize a large scale automation process to counting of grave sites. We evaluate and demonstrate the efficacy of proposed workflow using out-of-data set large satellite imagery and establish its broader impact on cemetery observation models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Special Nuclear Material Mass Estimates from Neutron Singles Count Rate [Poster]

The objective of this research was to create an algorithm to provide an estimate of special nuclear material (SNM) mass using only neutron count rate data from a Radioisotope Identification Device (RIID), rather than using time-correlated data from a neutron multiplicity counter. To meet this objective neutron count rate measurements of a 252 Cf source were taken at varying distances with an ORTEC Detective X, FLIR Identifinder 2, and an ORTEC RADEAGLET-R. An algorithm was created to estimate mass of SNM utilizing the singles rate equation and the measured absolute efficiency curves.

FLIR↗
DOE OSTI2025

Galaxy Clustering with LSST: Effects of Number Count Bias from Blending

The Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST) will survey the southern sky to create the largest galaxy catalog to date, and its statistical power demands an improved understanding of systematic effects such as source overlaps, also known as blending. In this work we study how blending introduces a bias in the number counts of galaxies (instead of the flux and colors), and how it propagates into galaxy clustering statistics. We use the 300 deg 2 DC2 image simulation and its resulting galaxy catalog (LSST Dark Energy Science Collaboration et al. 2021) to carry out this study. We find that, for a LSST Year 1 (Y1)-like cosmological analyses, the number count bias due to blending leads to small but statistically significant differences in mean redshift measurements when comparing an observed sample to an unblended calibration sample. In the two-point correlation function, blending causes differences greater than 3σ on scales below approximately 10', but large scales are unaffected. We fit Ω m and linear galaxy bias in a Bayesian cosmological analysis and find that the recovered parameters from this limited area sample, with the LSST Y1 scale cuts, are largely unaffected by blending. Our main results hold when considering photometric redshift and a LSST Year 5 (Y5)-like sample.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Open-Source Data Analysis Tool for Spectral Small-Angle X-ray Scattering Using Spectroscopic Photon-Counting Detector

Spectral small-angle X-ray scattering (sSAXS) is a powerful technique for material characterization from thicker samples by capturing elastic X-ray scattering data in angle- and energy-dispersive modes at small angles. This approach is enabled by the use of a 2D spectroscopic photon-counting detector that provides energy and position information of scattered photons when a sample is irradiated by a polychromatic X-ray beam. Here, we describe an open-source tool with a graphical interface for analyzing sSAXS data obtained from a 2D spectroscopic photon-counting detector with a large number of energy bins. The tool takes system geometry parameters and raw detector data to output 1D scattering patterns and a 2D spatially-resolved scattering map in the energy range of interest. We validated these features using data from samples of caffeine powder with well-known scattering peaks. This open-source tool will facilitate sSAXS data analysis for various material characterization applications.

Chemistry↗
DOE OSTI2020

A Search for Neutrino Point-source Populations in 7 yr of IceCube Data with Neutrino-count Statistics

The presence of a population of point sources in a data set modifies the underlying neutrino-count statistics from the Poisson distribution. This deviation can be exactly quantified using the non-Poissonian template fitting technique, and in this work we present the first application of this approach to the IceCube high-energy neutrino data set. Using this method, we search in 7 yr of IceCube data for point-source populations correlated with the disk of the Milky Way, the Fermi bubbles, the Schlegel, Finkbeiner, and Davis dust map, or with the isotropic extragalactic sky. No evidence for such a population is found in the data using this technique, and in the absence of a signal, we establish constraints on population models with source-count distribution functions that can be described by a power law with a single break. Here, the derived limits can be interpreted in the context of many possible source classes. In order to enhance the flexibility of the results, we publish the full posterior from our analysis, which can be used to establish limits on specific population models that would contribute to the observed IceCube neutrino flux.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

ORNLERASE - EPA COUNTS PER MINUTE CALCULATOR CONVERSION FACTORS

This database is used in the EPA's Superfund Counts Per Minute (CPM) Calculator (https://epa-cpm.ornl.gov/index.html). This database contains conversion factors used in the calculator that help users estimate the expected radiation detector reading, in counts per minute (CPM), corresponding to a measured radioactivity level reported in either pCi/cm² or pCi/g. Because surface contamination and volumetric contamination behave differently, the tool uses separate conversion processes, each based on Monte Carlo N-Particle (MCNP)–derived conversion factors. The CPM Calculator supports conversions for a range of common environmental media—including soil, steel, glass, drywall, concrete, and wood—to generate detector-ready CPM values. The primary goal of this tool is to enable more efficient, real-time field measurements, reducing reliance on laboratory analyses and ultimately saving both time and money during Superfund assessments.

Dolislager, Fred [ORNL] (ORCID:0009000325477921)↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Photon counting from the vacuum ultraviolet to the short wavelength infrared using semiconductor and superconducting technologies

In the last decade, several photon counting technologies have been developed opening a new window for experiments in the low photon number regime. Several ongoing and future projects in HEP benefit from these developments, which will also have a large impact outside HEP. During the next decade there is a clear technological opportunity to fully develop these sensors and produce a large impact in HEP. In this white paper we discuss the need for photon counting technologies in future projects, and present some technological opportunities to address those needs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Apparatus and method for high dynamic range counting by pixelated detectors

The present disclosure relates to an apparatus and methods for generating a hybrid image by high-dynamic-range counting. In an embodiment, the apparatus includes a processing circuitry configured to acquire an image from a pixelated detector, obtain a sparsity map of the acquired image, the sparsity map indicating low-flux regions of the acquired image and high-flux regions of the acquired image, generate a low-flux image and a high-flux image based on the sparsity map, perform event analysis of the acquired image based on the low-flux image and the high-flux image, the event analysis including detecting, within the low-flux image, incident events by an event counting mode, multiply, by a normalization constant, resulting intensities of the high-flux image and the detected incident events of the low-flux image, and generate the hybrid image by merging the low-flux image and the high-flux image.

Bammes, Benjamin↗
DOE OSTI2023

Building an Efficient Cluster Cosmology Software Package for Modeling Cluster Counts and Lensing

We introduce a software suite developed for galaxy cluster cosmological analysis with the Dark Energy Survey Data. Cosmological analyses based on galaxy cluster number counts and weak-lensing measurements need efficient software infrastructure to explore an increasingly large parameter space, and account for various cosmological and astrophysical effects. Our software package is designed to model the cluster observables in a wide-field optical survey, including galaxy cluster counts, their averaged weak-lensing masses, or the cluster's averaged weak-lensing radial signals. To ensure maximum efficiency, this software package is developed in C++ in the CosmoSIS software framework, making use of the CUBA integration library. We also implement a testing and validation scheme to ensure the quality of the package. We demonstrate the effectiveness of this development by applying the software to the Dark Energy Survey Year 1 galaxy cluster cosmological data sets, and acquired cosmological constraints that are consistent with the fiducial Dark Energy Survey analysis.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗