Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Likelihood Functions”

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 289 records · Page 16

Novel deep learning methods for track reconstruction

For the past year, the HEP.TrkX project has been investigating machine learning solutions to LHC particle track reconstruction problems. A variety of models were studied that drew inspiration from computer vision applications and operated on an image-like representation of tracking detector data. While these approaches have shown some promise, image-based methods face challenges in scaling up to realistic HL-LHC data due to high dimensionality and sparsity. In contrast, models that can operate on the spacepoint representation of track measurements ("hits") can exploit the structure of the data to solve tasks efficiently. In this paper we will show two sets of new deep learning models for reconstructing tracks using space-point data arranged as sequences or connected graphs. In the first set of models, Recurrent Neural Networks (RNNs) are used to extrapolate, build, and evaluate track candidates akin to Kalman Filter algorithms. Such models can express their own uncertainty when trained with an appropriate likelihood loss function. The second set of models use Graph Neural Networks (GNNs) for the tasks of hit classification and segment classification. These models read a graph of connected hits and compute features on the nodes and edges. They adaptively learn which hit connections are important and which are spurious. The models are scaleable with simple architecture and relatively few parameters. Results for all models will be presented on ACTS generic detector simulated data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The DESI DR1 Peculiar Velocity Survey: Growth Rate Measurements from the Galaxy Power Spectrum

The large-scale structure of the Universe and its evolution encapsulate a wealth of cosmological information. A powerful means of unlocking this knowledge lies in measuring the auto-power spectrum and/or the cross-power spectrum of the galaxy density and momentum fields, followed by the estimation of cosmological parameters based on these spectrum measurements. In this study, we generalize the cross-power spectrum model to accommodate scenarios where the density and momentum fields are derived from distinct galaxy surveys. The growth rate of the large-scale structures of the Universe, commonly represented as $fσ_8$, is extracted by jointly fitting the monopole and quadrupole moments of the auto-density power spectrum, the monopole of the auto-momentum power spectrum, and the dipole of the cross-power spectrum. Our estimators, theoretical models and parameter-fitting framework have been tested using mocks, confirming their robustness and accuracy in retrieving the fiducial growth rate from simulation. These techniques are then applied to analyze the power spectrum of the DESI Bright Galaxy Survey and Peculiar Velocity Survey, and the fit result of the growth rate is $fσ_8=0.440^{+0.080}_{-0.096}$ at effective redshift $z_{\rm eff}=0.07$. By synthesizing the fitting outcomes from correlation functions, maximum likelihood estimation and power spectrum, yields a consensus value of $fσ_8(z_{\rm eff}=0.07) = 0.450 ^{+0.055}_{-0.055}$, and correspondingly we obtain $γ=0.580^{+0.110}_{-0.110}$, $Ω_\mathrm{m}=0.301^{+0.011}_{-0.011}$ and $σ_8=0.834^{+0.032}_{-0.032}$. The measured $fσ_8$ and $γ$ are consistent with the prediction of the $Λ$ Cold Dark Matter Model and General Relativity.

Qin, F. [Marseille, CPPM] (ORCID:0000000179507864)↗

Analysis of complete quasar samples to obtain parameters of luminosity and evolution functions

A parametric likelihood analysis of the joint redshift-luminosity distribution is presented for a composite, complete sample of 32 quasars with B between 17.0 and 19.2 selected on the basis of ultraviolet excess. Best estimates and joint confidence regions are determined for the parameters of several models of the quasar optical luminosity and evolution function. These models are also tested explicitly for their acceptability. A steeper luminosity function is found than was found for previous samples. A model invoking pure density evolution is rejected on the basis of its extrapolation to fainter magnitudes through comparisons with the optical number counts and independently with the observed 2 keV X-ray background. Assuming an average value for L(x)/L(opt), the contribution of quasars to the X-ray background at 2 keV is discussed.

Marshall, H. L.↗

Technology Assessment in Support of the Presidential Vision for Space Exploration

This paper discusses the process and results of technology assessment in support of the United States Vision for Space Exploration of the Moon, Mars and Beyond. The paper begins by reviewing the Presidential Vision: a major endeavor in building systems of systems. It discusses why we wish to return to the Moon, and the exploration architecture for getting there safely, sustaining a presence, and safely returning. Next, a methodology for optimal technology investment is proposed with discussion of inputs including a capability hierarchy, mission importance weightings, available resource profiles as a function of time, likelihoods of development success, and an objective function. A temporal optimization formulation is offered, and the investment recommendations presented along with sensitivity analyses. Key questions addressed are sensitivity of budget allocations to cost uncertainties, reduction in available budget levels, and shifting funding within constraints imposed by mission timeline.

technology↗

Nonparametric maximum likelihood estimation of probability densities by penalty function methods

When it is known a priori exactly to which finite dimensional manifold the probability density function gives rise to a set of samples, the parametric maximum likelihood estimation procedure leads to poor estimates and is unstable; while the nonparametric maximum likelihood procedure is undefined. A very general theory of maximum penalized likelihood estimation which should avoid many of these difficulties is presented. It is demonstrated that each reproducing kernel Hilbert space leads, in a very natural way, to a maximum penalized likelihood estimator and that a well-known class of reproducing kernel Hilbert spaces gives polynomial splines as the nonparametric maximum penalized likelihood estimates.

Demontricher, G. F.↗

Uncertainty analysis of signal deconvolution using a measured instrument response function

A common analysis procedure minimizes the ln-likelihood that a set of experimental observables matches a parameterized model of the observation. The model includes a description of the underlying physical process as well as the instrument response function (IRF). Here, we investigate the National Ignition Facility (NIF) neutron time-of-flight (nTOF) spectrometers, the IRF is constructed from measurements and models. IRF measurements have a finite precision that can make significant contributions to the uncertainty estimate of the physical model’s parameters. Finally, we apply a Bayesian analysis to properly account for IRF uncertainties in calculating the ln-likelihood function used to find the optimum physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Top Quark Mass Measurement using mT2 in the Dilepton Channel at CDF

We report a measurement of the top quark mass, m{sub t}, obtained from p{bar p} collisions at {radical}s = 1.96 TeV at the Fermilab Tevatron using the CDF II detector. We analyze a sample corresponding to an integrated luminosity of 1.9 fb{sup -1}. We select events with an electron or muon, large missing transverse energy, and exactly four high-energy jets in the central region of the detector, at least one of which is tagged as coming from a b quark. We calculate a signal likelihood using a matrix element integration method, where the matrix element is modified by using effective propagators to take into account assumptions on event kinematics. Our event likelihood is a function of m{sub t} and a parameter JES (jet energy scale) that determines in situ the calibration of the jet energies. We use a neural network discriminant to distinguish signal from background events. We also apply a cut on the peak value of each event likelihood curve to reduce the contribution of background and badly reconstructed events. Using the 318 events that pass all selection criteria, we find m{sub t} = 172.7 {+-} 1.8(stat + JES) {+-} 1.2(syst) GeV/c{sup 2}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Maximum likelihood estimation for life distributions with competing failure modes

The general model for the competing failure modes assuming that location parameters for each mode are expressible as linear functions of the stress variables and the failure modes act independently is presented. The general form of the likelihood function and the likelihood equations are derived for the extreme value distributions, and solving these equations using nonlinear least squares techniques provides an estimate of the asymptotic covariance matrix of the estimators. Monte-Carlo results indicate that, under appropriate conditions, the location parameters are nearly unbiased, the scale parameter is slightly biased, and the asymptotic covariances are rapidly approached.

Sidik, S. M.↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

C2QA - Bosonic Qiskit

The practical benefits of hybrid quantum information processing hardware that contains continuous-variable objects (bosonic modes such as mechanical or electromagnetic oscillators) in addition to traditional (discrete-variable) qubits have recently been demonstrated by experiments with bosonic codes that reach the break-even point for quantum error correction [1]–[5] and by efficient Gaussian boson sampling simulation of the Franck-Condon spectra of triatomic molecules [6] that is well beyond the capabilities of current qubit-only hardware. The goal of this Co-design Center for Quantum Advantage (C2QA) project is to develop an instruction set architecture (ISA) for hybrid qubit/bosonic mode systems that contains an inventory of the fundamental operations and measurements that are possible in such hardware. The corresponding abstract machine model (AMM) would also contain a description of the appropriate error models associated with the gates, measurements and time evolution of the hardware. This information has been implemented as an extension of IBM Qiskit. IBM Qiskit is an open-source software development toolkit (SDK) for simulating the quantum state of a quantum circuit and for running the same circuits on prototype hardware within the IBM Quantum Experience. We introduce the Bosonic Qiskit software to enable the simulation of hybrid qubit/bosonic systems using the existing Qiskit software development kit [7]. This implementation can be used for simulating new hybrid systems, verifying proposed physical systems, and modeling systems larger than can currently be constructed. We also cover tutorials and example use cases included within the software to study JaynesCummings models, bosonic Hubbard models, plotting Wigner functions and animations, and calculating maximum likelihood estimations using Wigner functions.

quantum, boson, Qiskit↗

Receiver Operating Characteristic (ROC) Curves: An Analysis Tool for Detection Performance

Detection theory is a fundamental tool in decision analysis. However, many decision functions both formal (e.g. likelihood ratio) and informal (e.g. maximum of function) evolve in a wide variety of applications. The fundamental detection problem of interest is shown in Fig. 1. That is, given a set of data (e.g. noisy measurements) obtained from an instrument and a decision function, “decide” whether or not the signal is present or not.

42 ENGINEERING↗

A practical method to test the validity of the standard Gumbel distribution in logit-based multinomial choice models of travel behavior

Most multinomial choice models (e.g., the multinomial logit model) adopted in practice assume an extreme-value Gumbel distribution for the random components (error terms) of utility functions. This distributional assumption offers a closed-form likelihood expression when the utility maximization principle is applied to model choice behaviors. As a result, model coefficients can be easily estimated using the standard maximum likelihood estimation method. However, maximum likelihood estimators are consistent and efficient only if distributional assumptions on the random error terms are valid. It is therefore critical to test the validity of underlying distributional assumptions on the error terms that form the basis of parameter estimation and policy evaluation. In this paper, a practical yet statistically rigorous method is proposed to test the validity of the distributional assumption on the random components of utility functions in both the multinomial logit (MNL) model and multiple discrete-continuous extreme value (MDCEV) model. Based on a semi-nonparametric approach, a closed-form likelihood function that nests the MNL or MDCEV model being tested is derived. The proposed method allows traditional likelihood ratio tests to be used to test violations of the standard Gumbel distribution assumption. Simulation experiments are conducted to demonstrate that the proposed test yields acceptable Type-I and Type-II error probabilities at commonly available sample sizes. The test is then applied to three real-world discrete and discrete-continuous choice models. For all three models, the proposed test rejects the validity of the standard Gumbel distribution in most utility functions, calling for the development of robust choice models that overcome adverse effects of violations of distributional assumptions on the error terms in random utility functions.

30 DIRECT ENERGY CONVERSION↗

Top Quark Mass Measurement in the Lepton plus Jets Channel Using a Modified Matrix Element Method

The authors report a measurement of the top quark mass, m{sub t}, obtained from p{bar p} collisions at {radical}s = 1.96 TeV at the Fermilab Tevatron using the CDF II detector. They analyze a sample corresponding to an integrated luminosity of 1.9 rfb{sup -1}. They select events with an electron or muon, large missing transverse energy, and exactly four high-energy jets in the central region of the detector, at least one of which is tagged as coming from a b quark. They calculate a signal likelihood using a matrix element integration method, where the matrix element is modified by using effective propagators to take into account assumptions on event kinematics. The event likelihood is a function of m{sub t} and a parameter JES that determines in situ the calibration of the jet energies. They use a neural network discriminant to distinguish signal from background events. They also apply a cut on the peak value of each event likelihood curve to reduce the contribution of background and badly reconstructed events. Using the 318 events that pass all selection criteria, they find m{sub t} = 172.7 {+-} 1.8 (stat. + JES) {+-} 1.2(syst.) GeV/c{sup 2}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Likelihood-Based Particle Identification in the Short-Baseline Near Detector

Accurate particle identification is crucial in any high-energy physics experiment, allowing scientists to understand the unique interactions and mechanisms at play in a detector. In this project, I develop and study a new particle identification (PID) algorithm for the Short-Baseline Near Detector, a likelihood-based approach, different from out current $\chi^2$ method. A likelihood estimation offers a more physically motivated strategy for PID. The distribution random energy losses of charged particles traveling through a medium are described by the Vavilov probability density function. By using this model, we can account for random energy losses and construct likelihood functions specific to each particle type, potentially enabling a more accurate method for PID.

Vanderwaal, Sophia [U. Alabama, Huntsville] (ORCID↗

Maximum-likelihood soft-decision decoding of block codes using the A* algorithm

The A* algorithm finds the path in a finite depth binary tree that optimizes a function. Here, it is applied to maximum-likelihood soft-decision decoding of block codes where the function optimized over the codewords is the likelihood function of the received sequence given each codeword. The algorithm considers codewords one bit at a time, making use of the most reliable received symbols first and pursuing only the partially expanded codewords that might be maximally likely. A version of the A* algorithm for maximum-likelihood decoding of block codes has been implemented for block codes up to 64 bits in length. The efficiency of this algorithm makes simulations of codes up to length 64 feasible. This article details the implementation currently in use, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained with this implementation of the A* algorithm for several codes.

Ekroot, L.↗