Search NASA⌕ Search

SEARCH · Search NASA

Results for “kernel method”

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 271 records · Page 15

Flux and Reaction Rate Kernel Density Estimators in OpenMC

Current methods for obtaining flux and reaction rate profiles in a Monte Carlo simulation rely on histogram tallies that can suffer from large uncertainties when fine detail is required. Recently, another density estimation technique has been applied to Monte Carlo radiation transport sim ulations: the Kernel Density Estimator (KDE) [Banerjee, K.]. KDEs are capable of calculating the flux at a point without the necessity of tracking particles on a spatial mesh, making KDEs ideal tools for multi-physics problems. Furthermore, KDEs allow for one collision or track length to contribute to the estimate of the flux at multiple points, circumventing the large statistical uncertainties associated with fine-mesh histogram tallies. However, KDEs have only been proven to be capable of estimating flux values at a series of points; no work has been done to estimate reaction rates or other quantities of interest. Furthermore, little work has been done in optimizing the KDE bandwidth for the energy-dependence of neutron transport simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optical properties of alkali halide crystals from all-electron hybrid TD-DFT calculations

We present a study of the electronic and optical properties of a series of alkali halide crystals AX, with A = Li, Na, K, Rb and X = F, Cl, Br based on a recent implementation of hybrid-exchange time-dependent density functional theory (TD-DFT) (TD-B3LYP) in the all-electron Gaussian basis set code CRYSTAL. We examine, in particular, the impact of basis set size and quality on the prediction of the optical gap and exciton binding energy. The formation of bound excitons by photoexcitation is observed in all the studied systems and this is shown to be correlated to specific features of the Hartree-Fock exchange component of the TD-DFT response kernel. All computed optical gaps and exciton binding energies are however markedly below estimated experimental and, where available, 2-particle Green’s function (GW-Bethe-Salpeter equation, GW-BSE) values. We attribute this reduced exciton binding to the incorrect asymptotics of the B3LYP exchange correlation ground state functional and of the TD-B3LYP response kernel, which lead to a large underestimation of the Coulomb interaction between the excited electron and hole wavefunctions. Considering LiF as an example, we correlate the asymptotic behaviour of the TD-B3LYP kernel to the fraction of Fock exchange admixed in the ground state functional c{sub HF} and show that there exists one value of c{sub HF} (∼0.32) that reproduces at least semi-quantitatively the optical gap of this material.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shading correction for on-board cone-beam CT in radiation therapy using planning MDCT images

Purpose: Applications of cone-beam CT (CBCT) to image-guided radiation therapy (IGRT) are hampered by shading artifacts in the reconstructed images. These artifacts are mainly due to scatter contamination in the projections but also can result from uncorrected beam hardening effects as well as nonlinearities in responses of the amorphous silicon flat panel detectors. While currently, CBCT is mainly used to provide patient geometry information for treatment setup, more demanding applications requiring high-quality CBCT images are under investigation. To tackle these challenges, many CBCT correction algorithms have been proposed; yet, a standard approach still remains unclear. In this work, we propose a shading correction method for CBCT that addresses artifacts from low-frequency projection errors. The method is consistent with the current workflow of radiation therapy. Methods: With much smaller inherent scatter signals and more accurate detectors, diagnostic multidetector CT (MDCT) provides high quality CT images that are routinely used for radiation treatment planning. Using the MDCT image as ''free'' prior information, we first estimate the primary projections in the CBCT scan via forward projection of the spatially registered MDCT data. Since most of the CBCT shading artifacts stem from low-frequency errors in the projections such as scatter, these errors can be accurately estimated by low-pass filtering the difference between the estimated and raw CBCT projections. The error estimates are then subtracted from the raw CBCT projections. Our method is distinct from other published correction methods that use the MDCT image as a prior because it is projection-based and uses limited patient anatomical information from the MDCT image. The merit of CBCT-based treatment monitoring is therefore retained. Results: The proposed method is evaluated using two phantom studies on tabletop systems. On the Catphan(c)600 phantom, our approach reduces the reconstruction error from 348 Hounsfield unit (HU) without correction to 4 HU around the object center after correction, and from 375 HU to 17 HU in the high-contrast regions. In the selected regions of interest (ROIs), the average image contrast is increased by a factor of 3.3. When noise suppression is implemented, the proposed correction substantially improves the contrast-to-noise ratio (CNR) and therefore the visibility of low-contrast objects, as seen in a more challenging pelvis phantom study. Besides a significant improvement in image uniformity, a low-contrast object of {approx}25 HU, which is otherwise buried in the shading artifacts, can be clearly identified after the proposed correction due to a CNR increase of 3.1. Compared to a kernel-based scatter correction method coupled with an analytical beam hardening correction, our approach also shows an overall improved performance with some residual artifacts. Conclusions: By providing effective shading correction, our approach has the potential to improve the accuracy of more advanced CBCT-based clinical applications for IGRT, such as tumor delineation and dose calculation.

60 APPLIED LIFE SCIENCES↗

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

Nonparametric, data-based kernel interpolation for particle-tracking simulations and kernel density estimation

Traditional interpolation techniques for particle tracking include binning and convolutional formulas that use pre-determined (i.e., closed-form, parameteric) kernels. In many instances, the particles are introduced as point sources in time and space, so the cloud of particles (either in space or time) is a discrete representation of the Green’s function of an underlying PDE. As such, each particle is a sample from the Green’s function; therefore, each particle should be distributed according to the Green’s function. In short, the kernel of a convolutional interpolation of the particle sample “cloud” should be a replica of the cloud itself. This idea gives rise to an iterative method by which the form of the kernel may be discerned in the process of interpolating the Green’s function. When the Green’s function is a density, this method is broadly applicable to interpolating a kernel density estimate based on random data drawn from a single distribution. We formulate and construct the algorithm and demonstrate its ability to perform kernel density estimation of skewed and/or heavy-tailed data including breakthrough curves.

42 ENGINEERING↗

Development and testing of improved statistical wind power forecasting methods.

Wind power forecasting (WPF) provides important inputs to power system operators and electricity market participants. It is therefore not surprising that WPF has attracted increasing interest within the electric power industry. In this report, we document our research on improving statistical WPF algorithms for point, uncertainty, and ramp forecasting. Below, we provide a brief introduction to the research presented in the following chapters. For a detailed overview of the state-of-the-art in wind power forecasting, we refer to [1]. Our related work on the application of WPF in operational decisions is documented in [2]. Point forecasts of wind power are highly dependent on the training criteria used in the statistical algorithms that are used to convert weather forecasts and observational data to a power forecast. In Chapter 2, we explore the application of information theoretic learning (ITL) as opposed to the classical minimum square error (MSE) criterion for point forecasting. In contrast to the MSE criterion, ITL criteria do not assume a Gaussian distribution of the forecasting errors. We investigate to what extent ITL criteria yield better results. In addition, we analyze time-adaptive training algorithms and how they enable WPF algorithms to cope with non-stationary data and, thus, to adapt to new situations without requiring additional offline training of the model. We test the new point forecasting algorithms on two wind farms located in the U.S. Midwest. Although there have been advancements in deterministic WPF, a single-valued forecast cannot provide information on the dispersion of observations around the predicted value. We argue that it is essential to generate, together with (or as an alternative to) point forecasts, a representation of the wind power uncertainty. Wind power uncertainty representation can take the form of probabilistic forecasts (e.g., probability density function, quantiles), risk indices (e.g., prediction risk index) or scenarios (with spatial and/or temporal dependence). Statistical approaches to uncertainty forecasting basically consist of estimating the uncertainty based on observed forecasting errors. Quantile regression (QR) is currently a commonly used approach in uncertainty forecasting. In Chapter 3, we propose new statistical approaches to the uncertainty estimation problem by employing kernel density forecast (KDF) methods. We use two estimators in both offline and time-adaptive modes, namely, the Nadaraya-Watson (NW) and Quantilecopula (QC) estimators. We conduct detailed tests of the new approaches using QR as a benchmark. One of the major issues in wind power generation are sudden and large changes of wind power output over a short period of time, namely ramping events. In Chapter 4, we perform a comparative study of existing definitions and methodologies for ramp forecasting. We also introduce a new probabilistic method for ramp event detection. The method starts with a stochastic algorithm that generates wind power scenarios, which are passed through a high-pass filter for ramp detection and estimation of the likelihood of ramp events to happen. The report is organized as follows: Chapter 2 presents the results of the application of ITL training criteria to deterministic WPF; Chapter 3 reports the study on probabilistic WPF, including new contributions to wind power uncertainty forecasting; Chapter 4 presents a new method to predict and visualize ramp events, comparing it with state-of-the-art methodologies; Chapter 5 briefly summarizes the main findings and contributions of this report.

17 WIND ENERGY↗

Active learning of reactive Bayesian force fields applied to heterogeneous catalysis dynamics of H/Pt

Abstract Atomistic modeling of chemically reactive systems has so far relied on either expensive ab initio methods or bond-order force fields requiring arduous parametrization. Here, we describe a Bayesian active learning framework for autonomous “on-the-fly” training of fast and accurate reactive many-body force fields during molecular dynamics simulations. At each time-step, predictive uncertainties of a sparse Gaussian process are evaluated to automatically determine whether additional ab initio training data are needed. We introduce a general method for mapping trained kernel models onto equivalent polynomial models whose prediction cost is much lower and independent of the training set size. As a demonstration, we perform direct two-phase simulations of heterogeneous H 2 turnover on the Pt(111) catalyst surface at chemical accuracy. The model trains itself in three days and performs at twice the speed of a ReaxFF model, while maintaining much higher fidelity to DFT and excellent agreement with experiment.

42 ENGINEERING↗

Field-gradient partitioning for fracture and frictional contact in the material point method: Field-gradient partitioning for fracture and frictional contact in the material point method [Fracture and frictional contact in material point method using damage-field gradients for velocity-field partitioning]

Contact and fracture in the material point method require grid-scale enrichment or partitioning of material into distinct velocity fields to allow for displacement or velocity discontinuities at a material interface. We present a new method which a kernel-based damage field is constructed from the particle data. The gradient of this field is used to dynamically repartition the material into contact pairs at each node. Our approach avoids the need to construct and evolve explicit cracks or contact surfaces and is therefore well suited to problems involving complex 3-D fracture with crack branching and coalescence. A straightforward extension of this approach permits frictional ‘self-contact’ between surfaces that are initially part of a single velocity field, enabling more accurate simulation of granular flow, porous compaction, fragmentation, and comminution of brittle materials. Finally, numerical simulations of self contact and dynamic crack propagation are presented to demonstrate the accuracy of the approach.

97 MATHEMATICS AND COMPUTING↗

Correction for patient table-induced scattered radiation in cone-beam computed tomography (CBCT)

Purpose: In image-guided radiotherapy, an artifact typically seen in axial slices of x-ray cone-beam computed tomography (CBCT) reconstructions is a dark region or ''black hole'' situated below the scan isocenter. The authors trace the cause of the artifact to scattered radiation produced by radiotherapy patient tabletops and show it is linked to the use of the offset-detector acquisition mode to enlarge the imaging field-of-view. The authors present a hybrid scatter kernel superposition (SKS) algorithm to correct for scatter from both the object-of-interest and the tabletop. Methods: Monte Carlo simulations and phantom experiments were first performed to identify the source of the black hole artifact. For correction, a SKS algorithm was developed that uses separate kernels to estimate scatter from the patient tabletop and the object-of-interest. Each projection is divided into two regions, one defined by the shadow cast by the tabletop on the imager and one defined by the unshadowed region. The region not shadowed by the tabletop is processed using the recently developed fast adaptive scatter kernel superposition (fASKS) method which employs asymmetric kernels that best model scatter transport through bodylike objects. The shadowed region is convolved with a combination of slab-derived symmetric SKS kernels and asymmetric fASKS kernels. The composition of the hybrid kernels is projection-angle-dependent. To test the algorithm, pelvis phantom and in vivo data were acquired using a CBCT test stand, a Varian Acuity simulator, and a Varian On-Board Imager, all of which have similar geometries and components. Artifact intensities and Hounsfield unit (HU) accuracies in the reconstructions were assessed before and after the correction. Results: The hybrid kernel algorithm provided effective correction and produced substantially better scatter estimates than the symmetric SKS or asymmetric fASKS methods alone. HU nonuniformities in the reconstructed pelvis phantom were reduced from 220 to 50 HU (i.e., 22%-5%). In the in vivo scans, the black hole artifact was reduced by up to 147 HU, a 73% improvement, and anatomical details in the prostate and rectum areas were made considerably more visible. Conclusions: Radiotherapy tabletops, which are generally flatter and larger than those used for diagnostic CT, can produce significant scatter-related artifacts. The proposed hybrid SKS algorithm accurately estimates scatter from both the object-of-interest and the patient tabletop, and resulting image uniformities and HU accuracies are greatly improved.

60 APPLIED LIFE SCIENCES↗

Localness of energy cascade in hydrodynamic turbulence, II. Sharp spectral filter

We investigate the scale-locality of subgrid-scale (SGS) energy flux and interband energy transfers defined by the sharp spectral filter. We show by rigorous bounds, physical arguments, and numerical simulations that the spectral SGS flux is dominated by local triadic interactions in an extended turbulent inertial range. Interband energy transfers are also shown to be dominated by local triads if the spectral bands have constant width on a logarithmic scale. We disprove in particular an alternative picture of 'local transfer by nonlocal triads,' with the advecting wavenumber mode at the energy peak. Although such triads have the largest transfer rates of all individual wavenumber triads, we show rigorously that, due to their restricted number, they make an asymptotically negligible contribution to energy flux and log-banded energy transfers at high wavenumbers in the inertial range. We show that it is only the aggregate effect of a geometrically increasing number of local wavenumber triads which can sustain an energy cascade to small scales. Furthermore, nonlocal triads are argued to contribute even less to the space-average energy flux than is implied by our rigorous bounds, because of additional cancellations from scale-decorrelation effects. We can thus recover the -4/3 scaling of nonlocal contributions to spectral energy flux predicted by Kraichnan's abridged Lagrangian-history direct-interaction approximation and test-field model closures. We support our results with numerical data from a 512{sup 3} pseudospectral simulation of isotropic turbulence with phase-shift dealiasing. We also discuss a rigorous counterexample of Eyink [Physica D 78, 222 (1994)], which showed that nonlocal wavenumber triads may dominate in the sharp spectral flux (but not in the SGS energy flux for graded filters). We show that this mathematical counter example fails to satisfy reasonable physical requirements for a turbulent velocity field, which are employed in our proof of scale locality. We conclude that the sharp spectral filter has a firm theoretical basis for use in large-eddy simulation modeling of turbulent flows.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

BTZ one-loop determinants via the Selberg zeta function for general spin

We relate the heat kernel and quasinormal mode methods of computing the 1-loop partition function of arbitrary spin fields on a rotating (Euclidean) BTZ background using the Selberg zeta function associated with H 3 /Z, extending (arXiv:1811.08433) [1]. Previously, Perry and Williams [2] showed for a scalar field that the zeros of the Selberg zeta function coincide with the poles of the associated scattering operator upon a relabeling of integers. We extend the integer relabeling to the case of general spin, and discuss its relationship to the removal of non-square-integrable Euclidean zero modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Crack propagation in silica from reactive classical molecular dynamics simulations

Mechanistic insight into the process of crack growth can be obtained through molecular dynamics (MD) simulations. In this investigation of fracture propagation, a slit crack was introduced into an atomistic amorphous silica model and mode I stress was applied through far–field loading until the crack propagates. Atomic displacements and forces and an Irving–Kirkwood method with a Lagrangian kernel estimator were used to calculate the J –integral of classical fracture mechanics around the crack tip. The resulting fracture toughness (K IC ), 0.76 ± 0.16 MPa√m, agrees with experimental values. In addition, the stress fields and dissipation energies around the slit crack indicate the development of an inelastic region ~30Å in diameter. This is one of the first reports of KIC values obtained from up–scaled atomic–level energies and stresses through the J –integral. In conclusion, the application of the ReaxFF classical MD force field in this study provides the basis for future research into crack growth in multicomponent oxides in a variety of environmental conditions.

36 MATERIALS SCIENCE↗

SU-E-T-31: A Fast Finite Size Pencil Beam (FSPB) Convolution Algorithm for a New Co-60 Arc Therapy Machine

Purpose: Present a fast Finite Size Pencil Beam (FSPB) convolution algorithm for a new Co-60 arc therapy machine. The FSPB algorithm accounts for (i) strong angular divergence (short SAD), (ii) heterogeneity effect for primary attenuation, and (iii) source energy spectrum. Methods: The FSPB algorithm is based on a 0.5×0.5-cm2 dose kernel calculated using the GEPTS (Gamma Electron and Positron Transport System) Monte Carlo code. The dose kernel is tabulated using a thin XYZ mesh (0.1 mm steps in lateral directions) for radius less than 1 cm and using an RZ mesh (with varying steps) for larger radial distance. To account for SSD effect, 11 dose kernels with SSDs varying between 30 cm to 80 cm are calculated. Maynord factor and “lateral stretching” are applied to account for differences between closest and actual SSD. Appropriate rotations and second order interpolation are used to calculate the dose from a given beamlet to a point. Results: Accuracy: Dose distributions in water with 80 cm SSD are calculated using the new FSPB convolution algorithm and full Monte Carlo simulation (gold standard). Figs 1–4 show excellent agreements between FSPB and Monte Carlo calculations for different field sizes and at different depths. The dose distribution for a prostate case is calculated using FSPB (Fig.5). Sixty conformal beams with rectum blocking are assumed. Figs 6–8 show the comparison with Monte Carlo simulation based on the same beam apertures. The excellent agreement demonstrates the accuracy of the new algorithm in handling SSD variation, oblique incidence, and scatter contribution.Speed: The FSPB convolution algorithm calculates 28 million dose points per second using a single 2.2-GHz CPU. The present algorithm is seven times faster than a similar algorithm from Gu et al. (Phys. Med. Biol. 54, 2009, 6287–6297). Conclusion: A fast and accurate FSPB convolution algorithm was developed and benchmarked.

60 APPLIED LIFE SCIENCES↗

Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM

The Parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used, the most powerful of which is the Concurrent Read Concurrent Write (CRCW) model. A PRAM algorithm describes a series of rounds, each of which consists of a collection of operations that can be executed concurrently within the same time step. However, the lack of support for concurrent memory accesses and the prevalence of asynchronous programming models led to the belief that implementing CRCW PRAM algorithms is unattainable and prompted many to avoid this model except for theoretical studies of optimal performance.In this work, we study the arbitrary and common concurrent writes in the CRCW PRAM model and explore implementation challenges on general-purpose systems. Moreover, we examine current practices for implementing common/arbitrary concurrent writes and propose a new efficient lightweight and thread-safe method to implement concurrent writes through leveraging atomic instructions. To demonstrate the efficacy of our method, we developed OpenMP kernels for classical CRCW PRAM algorithms and provide experimental results and comparisons based on run time performance measured over the x86 multicore architecture. Our results show a performance speedup compared to current practices up to 4.5x across all our benchmarks.

Ghanim, Fady↗

SlimIO: Lightweight I/O Path Design for Write Isolation in FDP-backed In-Memory Databases

In-Memory Databases (IMDBs) are widely used with HPC applications to manage transient data, often using snapshot-based persistence for backups. Redis, a representative IMDB, employs both snapshot and Write-Ahead Log (WAL) mechanisms, storing data on persistent devices via the traditional kernel I/O path. This method incurs syscall overhead, I/O contention between processes, and SSD garbage collection (GC) delays. To address these issues, we propose SlimIO, which adopts I/O passthru to minimize syscall overhead and inter-process I/O interference. Additionally, it leverages Flexible Data Placement (FDP) SSDs as backup storage to avoid performance degradation from SSD GC. Experimental results show that SlimIO reduces snapshot time by up to 25%, increases query throughput by up to 30% during non-snapshot periods, and lowers 99.9%-ile latency by up to 50%. Furthermore, it achieves a write amplification factor (WAF) of 1.00, indicating no redundant internal writes, thus extending SSD lifespan.

Lee, Sangyun [Sogang University]↗

Using Likwid and Byfl to Benchmark Hardware Performance

This paper outlines a benchmarking study conducted during my internship at LANL, focusing on CPU (Computer Processing Unit) and program performance assessment. The primary goal was to gather memory access data using three methods across five polybench kernels The data gathered would then be used to compare and contrast to one another and calculate operational intensity for performance comparisons. Benchmarking tools like Byfl and Likwid were employed, with Byfl offering hardware-independent data through LLVM compiler communication and Likwid directly interacting with computer hardware. The study considered various benchmarking factors, including optimization levels, Big O notation ((n)), CPU diversity and specific kernel equations. Big O notation was utilized to simplify code complexity, with detailed breakdwons of operations and memory components for each polybench application. Specific O(n) equations enabled nuanced kernel compariosns, facilitating the identification of performance variations. CPU efficiency assessments were conducted using Likwid tests on two CPUs. The central focus on code optimization aimed at achieving higher speeds and reduced memory usage through streamlined code. Future work propsoes creating a roofline model, synthesizing benchmarking data into a comprehensive data graph to assist in optimizing code and improving hardware performance. The potential impact on the laboratory or national mission was underscored, emphasizing the importance of optimizing applications and hardware to conserve resources and accelerate program execution. The specific relevance to LANL’s operations in math-intensive fields such as Nuclear Fission, Space Exploration, and Nanotechnology highlights the necessity of efficient benchmarking for resource conservation and proram speed. Overall, this study contributes to the understanding of CPU and program performance, providing insights for future optimization efforts in a laboratory setting

97 MATHEMATICS AND COMPUTING↗

sKokkos: Enabling Kokkos with Transparent Device Selection on Heterogeneous Systems using OpenACC

This paper presents a new feature to enable Kokkos with transparent device selection. For application developers, it is not easy toidentify which device is the most appropriate to use in a heterogeneous system, since this depends on the characteristics of both the application and the hardware. In Kokkos, a backend is associated with one specific programming model/hardware. Programmers decide which backend to use at compilation time. This new feature implemented on the OpenACC backend eliminates the burden of deciding which device to use, providing a highly productive programming solution for Kokkos applications. This work includes implementation details and a performance study conducted with a set of mini-benchmarks (i.e., AXPY and dot product), kernels (Lattice-Bolzmann method), and two mini-apps (LULESH and miniFE) on two heterogeneous systems with different hardware capabilities. This new Kokkos feature provides high accelerations of up to 35× thanks to automatic and transparent device selection.

Lee, Seyong↗

Solving the homogeneous Boltzmann equation with arbitrary scattering kernel

With applications in astroparticle physics in mind, we generalize a method for the solution of the nonlinear, space-homogeneous Boltzmann equation with an isotropic distribution function to arbitrary matrix elements. The method is based on the expansion of the scattering kernel in terms of two cosines of the 'scattering angles'. The scattering functions used by previous authors in particle physics for matrix elements in the Fermi approximation are retrieved as lowest order results in this expansion. The method is designed for the unified treatment of reactive mixtures of particles obeying different scattering laws, including the quantum statistical terms for blocking or stimulated emission, in possibly large networks of Boltzmann equations. Although our notation is the relativistic one, as it is used in astroparticle physics, the results can also be applied in the classical case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗