Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Poisson”

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

Poisson vs. Gaussian statistics for sparse X-ray data: Application to the soft X-ray spectrometer

Abstract Reliable results when fitting X-ray data require proper consideration of the statistics involved. We probe the impact of Gaussian versus Poisson statistics at low count levels using both the standard χ2 method and maximum likelihood based on Poisson (C) statistics. The difference is studied and quantified through simulated spectra with known properties. We then test the results through analysis of Mn Kα calibration data taken with the flight spare microcalorimeter for the Hitomi soft X-ray spectrometer. Through comparison with simulations, our results show that the χ2 method tends to give overly optimistic estimates of the detector energy resolution, in particular when there are few counts. Given an energy resolution of ∼5 eV and a line with about 100 photons, the line width becomes ∼10% lower in the χ2 method than in Poisson statistics. This is a consequence of the uncertainties being dominated by counting statistics, and therefore highlights the need to choose the appropriate fit statistic.

79 ASTRONOMY AND ASTROPHYSICS↗

Multiple Facets of the Poisson Distribution Applicable to Health Physics Measurements

This paper discusses several ways to view the standard Poisson distribution as applied to health physics scaler counts. The intent is not so much to present calculational details but rather to present some underlying concepts. Examples are provided that illustrate the various concepts for several types of specific measurements. The concepts presented involve purely Poisson-based contributions to variance; extra-Poisson variance is presently ignored, and any counting system would be presumed to function properly and without counting loss.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Reply to “Comment on ‘Accurate and fast numerical solution of Poisson's equation for arbitrary, space-filling Voronoi polyhedra: Near-field corrections revisited’ ”

This is a Reply to the Comment by Gonis and Zhang1 on our recent paper.2 They discuss supposed issues with our “accurate and fast numerical solution of Poisson’s equation for arbitrary Voronoi polyhedra” (VP). The method of Gonis et al.3 and Vitos and Koll´ar4 correctly addresses the mathematical issues related to the solution of Poisson’s equation [and near-field corrections (NFCs)] using a spherical harmonic basis (L’s). However, as discussed in Ref. 2, their method is not numerically efficient and suffers from severe convergence issues from the multiply nested (conditionally convergent) multipole expansions to address r</r> problems. Hence, the abstract in Ref. 2 clearly states that we provide a method to address a “fast but accurate numerical solution of the Poisson equation” for site-centered methods.

36 MATERIALS SCIENCE↗

Poisson Brackets Symmetry from the Pentagon-Wheel Cocycle in the Graph Complex

Kontsevich designed a scheme to generate infinitesimal symmetries P-dot =Q(P) of Poisson brackets P on all affine manifolds M{sup r}; every such deformation is encoded by oriented graphs on n+2 vertices and 2n edges. In particular, these symmetries can be obtained by orienting sums of non-oriented graphs γ on n vertices and 2n−2 edges. The bi-vector flow P-dot =O r-vector (γ)(P) preserves the space of Poisson structures if γ is a cocycle with respect to the vertex-expanding differential d in the graph complex. A class of such cocycles γ{sub 2ℓ+1} is known to exist: marked by ℓ∈N, each of them contains a (2ℓ+1) -gon wheel with a nonzero coefficient. At ℓ=1 the tetrahedron γ{sub 3} itself is a cocycle; at ℓ=2 the Kontsevich–Willwacher pentagon-wheel cocycle γ{sub 5} consists of two graphs. We reconstruct the symmetry Q{sub 5}(P)=O r-vector (γ{sub 5})(P) and verify that Q{sub 5} is a Poisson cocycle indeed: [ [P,Q{sub 5}(P)] ]≐0 via [ [P,P] ]=0.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Denoising Poisson phaseless measurements via orthogonal dictionary learning

Phaseless diffraction measurements recorded by CCD detectors are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements. The model consists of three terms: (i) A representation term by an orthogonal dictionary, (ii) an L 0 pseudo norm of the coefficient matrix, and (iii) a Kullback-Leibler divergence term to fit phaseless Poisson data. Fast alternating minimization method (AMM) and proximal alternating linearized minimization (PALM) are adopted to solve the proposed model, and especially the theoretical guarantee of the convergence of PALM is provided. The subproblems for these two algorithms both have fast solvers, and indeed, the solutions for the sparse coding and dictionary updating both have closed forms due to the orthogonality of learned dictionaries. Numerical experiments for phase retrieval using coded diffraction and ptychographic patterns are conducted to show the efficiency and robustness of proposed methods, which, by preserving texture features, produce visually and quantitatively improved restored images compared with other phase retrieval algorithms without regularization and local sparsity promoting algorithms.

97 MATHEMATICS AND COMPUTING↗

Real-time image denoising of mixed Poisson–Gaussian noise in fluorescence microscopy images using ImageJ

Fluorescence microscopy imaging speed is fundamentally limited by the measurement signal-to-noise ratio (SNR). To improve image SNR for a given image acquisition rate, computational denoising techniques can be used to suppress noise. However, common techniques to estimate a denoised image from a single frame either are computationally expensive or rely on simple noise statistical models. These models assume Poisson or Gaussian noise statistics, which are not appropriate for many fluorescence microscopy applications that contain quantum shot noise and electronic Johnson–Nyquist noise, therefore a mixture of Poisson and Gaussian noise. In this paper, we show convolutional neural networks (CNNs) trained on mixed Poisson and Gaussian noise images to overcome the limitations of existing image denoising methods. The trained CNN is presented as an open-source ImageJ plugin that performs real-time image denoising (within tens of milliseconds) with superior performance (SNR improvement) compared to conventional fluorescence microscopy denoising methods. The method is validated on external datasets with out-of-distribution noise, contrast, structure, and imaging modalities from the training data and consistently achieves high-performance ( > <#comment/> 8 d B ) denoising in less time than other fluorescence microscopy denoising methods.

47 OTHER INSTRUMENTATION↗

Network Traffic Monitoring Using Poisson Dynamic Linear Models

In this article, we discuss an approach for network forensics using a class of nonstationary Poisson processes with embedded dynamic linear models. As a modeling strategy, the Poisson DLM (PoDLM) provides a very flexible framework for specifying structured effects that may influence the evolution of the underlying Poisson rate parameter, including diurnal and weekly usage patterns. We develop a novel particle learning algorithm for online smoothing and prediction for the PoDLM, and demonstrate the suitability of the approach to real-time deployment settings via a new application to computer network traffic monitoring.

97 MATHEMATICS AND COMPUTING↗

Response to Comment on "On Higher-Order Corrections to Gyrokinetic Vlasov-Poisson Equations in the Long Wavelength Limit [Phys. Plasmas 16, 044506 (2009)]"

We show in this Response that the nonlinear Poisson's equation in our original paper derived from the drift kinetic approach can be verified by using the nonlinear gyrokinetic Poisson's equation of Dubin et al. [Phys. Fluids 26, 3524 (1983)]. This nonlinear contribution in φ2 is indeed of the order of k4⊥ in the long wavelength limit and remains finite for zero ion temperature, in contrast to the nonlinear term by Parra and Catto [Plasma Phys. Control. Fusion 50, 065014 (2008)], which is of the order of k2⊥ and diverges for Ti → 0. For comparison, the leading term for the gyrokinetic Poisson's equation in this limit is of the order of k2⊥φ,

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Poisson Log-Normal Process for Count Data Prediction

Modeling count data is important in physics and other scientific disciplines, where measurements often involve discrete, non-negative quantities such as photon or neutrino detection events. Traditional parametric approaches can be trained to generate integer-count predictions but may struggle with capturing complex, non-linear dependencies often observed in the data. Gaussian process (GP) regression provides a robust non-parametric alternative to modeling continuous data; however, it cannot generate integer outputs. We propose the Poisson Log-Normal (PoLoN) process, a framework that employs GP to model Poisson log-rates. As in GP regression, our approach relies on the correlations between data points captured via GP kernel structure rather than explicit functional parameterizations. We demonstrate that the PoLoN predictive distribution is Poisson-LogNormal and provide an algorithm for optimizing kernel hyperparameters. Furthermore, we adapt the PoLoN approach to the problem of detecting weak localized signals superimposed on a smoothly varying background - a task of considerable interest in many areas of science and engineering. Our framework allows us to predict the strength, location and width of the detected signals. We evaluate PoLoN's performance using both synthetic and real-world datasets, including the open dataset from CERN which was used to detect the Higgs boson at the Large Hadron Collider. Our results indicate that the PoLoN process can be used as a non-parametric alternative for analyzing, predicting, and extracting signals from integer-valued data.

Saha, Anushka [Rutgers U., Piscataway]↗

Filtering with Marked Point Process Observations via Poisson Chaos Expansion

We study a general filtering problem with marked point process observations. The motivation comes from modeling financial ultra-high frequency data. First, we rigorously derive the unnormalized filtering equation with marked point process observations under mild assumptions, especially relaxing the bounded condition of stochastic intensity. Then, we derive the Poisson chaos expansion for the unnormalized filter. Based on the chaos expansion, we establish the uniqueness of solutions of the unnormalized filtering equation. Moreover, we derive the Poisson chaos expansion for the unnormalized filter density under additional conditions. To explore the computational advantage, we further construct a new consistent recursive numerical scheme based on the truncation of the chaos density expansion for a simple case. The new algorithm divides the computations into those containing solely system coefficients and those including the observations, and assign the former off-line.

97 MATHEMATICS AND COMPUTING↗

Compound Poisson Law for Hitting Times to Periodic Orbits in Two-Dimensional Hyperbolic Systems

We show that a compound Poisson distribution holds for scaled exceedances of observables ϕ uniquely maximized at a periodic point ζ in a variety of two-dimensional hyperbolic dynamical systems with singularities (M,T,μ), including the billiard maps of Sinai dispersing billiards in both the finite and infinite horizon case. The observable we consider is of form ϕ(z)=−ln d(z,ζ) where d is a metric defined in terms of the stable and unstable foliation. The compound Poisson process we obtain is a Pólya-Aeppli distibution of index θ. We calculate θ in terms of the derivative of the map T. Furthermore if we define M{sub n}=max{ϕ,…,ϕ∘T"n} and u{sub n}(τ) by lim{sub n→∞}nμ(ϕ>u{sub n}(τ))=τ the maximal process satisfies an extreme value law of form μ(M{sub n}≤u{sub n})=e{sup −θτ}. These results generalize to a broader class of functions maximized at ζ, though the formulas regarding the parameters in the distribution need to be modified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalization of the Cauchy–Poisson Method and the Construction of Timoshenko-Type Equations

We consider a generalization of the Cauchy–Poisson method to the n-dimensional Euclidean space and its application to the construction of hyperbolic approximations. The presented investigation generalizes and supplements the results obtained earlier. In the Euclidean space, we introduce certain restrictions for the derivatives. The principle of hyperbolic degeneracy in terms of parameters is formulated and its realization in the form of necessary and sufficient conditions is presented. In a special case of fourdimensional space (in which the operators are preserved up to the sixth order), we obtain a generalized hyperbolic equation for the bending vibrations of plates with coefficients that depend only on the Poisson ratio. This equation includes, as special cases, the well-known Bernoulli–Euler, Kirchhoff, Rayleigh, and Timoshenko equations. As the development of Maxwell's and Einstein's investigations of the propagation of perturbations with finite velocity in continuous media, we can mention the nontrivial construction of Timoshenko’s equation for the bending vibrations of a beam.

97 MATHEMATICS AND COMPUTING↗

Differential Poisson’s ratio of a crystalline two-dimensional membrane

We compute the differential Poisson’s ratio of a suspended two-dimensional crystalline membrane embedded into a space of large dimensionality d&NestedGreaterGreater;1. We demonstrate that, in the regime of anomalous Hooke’s law, the differential Poisson’s ratio approaches a universal value determined solely by the spatial dimensionality d c , with a power-law expansion ν=-1/3+0.016/d c +O(1/d c 2 ), where d c =d-2. Thus, the value -1/3 predicted in previous literature holds only in the limit d c →∞.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗

ColDICE: A parallel Vlasov–Poisson solver using moving adaptive simplicial tessellation

Resolving numerically Vlasov–Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincaré invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli [65–67] generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a “warm” dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive fast multipole accelerated Poisson solver for complex geometries

Here, we present a fast, direct and adaptive Poisson solver for complex two-dimensional geometries based on potential theory and fast multipole acceleration. More precisely, the solver relies on the standard decomposition of the solution as the sum of a volume integral to account for the source distribution and a layer potential to enforce the desired boundary condition. The volume integral is computed by applying the FMM on a square box that encloses the domain of interest. For the sake of efficiency and convergence acceleration, we first extend the source distribution (the right-hand side in the Poisson equation) to the enclosing box as a $C$ 0 function using a fast, boundary integral-based method. We demonstrate on multiply connected domains with irregular boundaries that this continuous extension leads to high accuracy without excessive adaptive refinement near the boundary and, as a result, to an extremely efficient “black box” fast solver.

97 MATHEMATICS AND COMPUTING↗

Physics-based adaptivity of a spectral method for the Vlasov–Poisson equations based on the asymmetrically-weighted Hermite expansion in velocity space

We propose a spectral method for the 1D-1V Vlasov–Poisson system where the discretization in velocity space is based on asymmetrically-weighted Hermite functions, dynamically adapted via a scaling α and shifting u of the velocity variable. Specifically, at each time instant an adaptivity criterion selects new values of α and u based on the numerical solution of the discrete Vlasov–Poisson system obtained at that time step. Once the new values of the Hermite parameters α and u are fixed, the Hermite expansion is updated and the discrete system is further evolved for the next time step. The procedure is applied iteratively over the desired temporal interval. The key aspects of the adaptive algorithm are: the map between approximation spaces associated with different values of the Hermite parameters that preserves total mass, momentum and energy; and the adaptivity criterion to update α and u based on physics considerations relating the Hermite parameters to the average velocity and temperature of each plasma species. For the discretization of the spatial coordinate, we rely on Fourier functions and use the implicit midpoint rule for time stepping. The resulting numerical method possesses intrinsically the property of fluid-kinetic coupling, where the low-order terms of the expansion are akin to the fluid moments of a macroscopic description of the plasma, while kinetic physics is retained by adding more spectral terms. Moreover, the scheme features conservation of total mass, momentum and energy associated in the discrete, for periodic boundary conditions. A set of numerical experiments confirms that the adaptive method outperforms the non-adaptive one in terms of accuracy and stability of the numerical solution.

97 MATHEMATICS AND COMPUTING↗

Anti-symmetric and positivity preserving formulation of a spectral method for Vlasov-Poisson equations

We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions, central finite differencing in space, and an implicit Runge Kutta integrator in time. The proposed discretization preserves the anti-symmetric structure of the advection operator in the Vlasov equation, resulting in a stable numerical method. We apply such discretization to two formulations: the canonical Vlasov-Poisson equations and their continuously transformed square-root representation. The latter preserves the positivity of the particle distribution function. We derive analytically the conservation properties of both formulations, including particle number, momentum, and energy, which are verified numerically on the following benchmark problems: manufactured solution, linear and nonlinear Landau damping, two-stream instability, bump-on-tail instability, and ion-acoustic wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗