Search NASA⌕ Search

SEARCH · Search NASA

Results for “maximum likelihood”

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 379 records · Page 21

Identification of M2/F3 stability and control derivatives from flight data containing gust effects

The application of the maximum likelihood identification technique to M2/F3 lifting body flight data containing wind gust effects is discussed. With the objective of this effort being the identification of the stability and control derivatives, it is shown first that the output error technique (or modified Newton-Raphson) fails to fit the recorded data accurately. The means of applying the maximum likelihood technique to this problem are then discussed and the results given which indicate an accurate fit to the data. The question of derivative signs opposite to the wind tunnel values is then addressed and the results of three techniques for dealing with this problem are presented. These techniques are a priori weighting, fixing parameter values, and rank deficient inverses.

Stepner, D. E.↗

A statistical technique for processing radio interferometer data

The output of a radio interferometer is the Fourier transform of the object under investigation. Due to the limited coverage of the Fourier plane, the reconstruction of the image of the source is blurred by the beam of the synthesized array. A maximum-likelihood processing technique is described which uses the statistical properties of the received noise-like signals. This technique has been used extensively in the processing of large-aperture seismic arrays. This inversion method results in a synthesized beam that is more uniform, has lower sidelobes, and higher resolution than the normal Fourier transform methods. The maximum-likelihood method algorithm was applied successfully to very long baseline and short baseline interferometric data.

Papadopoulos, G. D.↗

A Residuals Approach to Filtering, Smoothing and Identification for Static Distributed Systems

An approach for state estimation and identification of spatially distributed parameters embedded in static distributed (elliptic) system models is advanced. The method of maximum likelihood is used to find parameter values that maximize a likelihood functional for the system model, or equivalently, that minimize the negative logarithm of this functional. To find the minimum, a Newton-Raphson search is conducted that from an initial estimate generates a convergent sequence of parameter estimates. For simplicity, a Gauss-Markov approach is used to approximate the Hessian in terms of products of first derivatives. The gradient and approximate Hessian are computed by first arranging the negative log likelihood functional into a form based on the square root factorization of the predicted covariance of the measurement process. The resulting data processing approach, referred to here by the new term of predicted data covariance square root filtering, makes the gradient and approximate Hessian calculations very simple. A closely related set of state estimates is also produced by the maximum likelihood method: smoothed estimates that are optimal in a conditional mean sense and filtered estimates that emerge from the predicted data covariance square root filter.

Rodriguez, G.↗

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗

Angular analysis of the B o → K *o μ + μ – decay using 3 fb –1 of integrated luminosity

An angular analysis of the B o → K *o (→ K + π – )μ + μ – decay is presented. The dataset corresponds to an integrated luminosity of 3.0 fb –1 of pp collision data collected at the LHCb experiment. The complete angular information from the decay is used to determine CP-averaged observables and CP asymmetries, taking account of possible contamination from decays with the K + π – system in an S-wave configuration. The angular observables and their correlations are reported in bins of q 2 , the invariant mass squared of the dimuon system. The observables are determined both from an unbinned maximum likelihood fit and by using the principal moments of the angular distribution. In addition, by fitting for q 2 -dependent decay amplitudes in the region 1.1 < q 2 < 6.0 GeV 2 /c 4 , the zero-crossing points of several angular observables are computed. A global fit is performed to the complete set of CP-averaged observables obtained from the maximum likelihood fit. This fit indicates differences with predictions based on the Standard Model at the level of 3.4 standard deviations. These differences could be explained by contributions from physics beyond the Standard Model, or by an unexpectedly large hadronic effect that is not accounted for in the Standard Model predictions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Forecast for a growth-rate measurement using peculiar velocities from LSST supernovae

We investigate whether the cosmic growth-rate parameter fσ 8 can be measured using peculiar velocities (PVs) derived from type Ia supernovae (SNe Ia) in the Vera C. Rubin Observatory’s Legacy Survey of Space and Time (LSST). We produced simulations of different SN types using a realistic LSST observing strategy that incorporated noise, a photometric detection from the difference-image analysis (DIA) pipeline, and a PV field modeled from the Uchuu universe machine simulations. We tested three different observational scenarios that ranged from ideal conditions with spectroscopic host galaxy redshifts and spectroscopic SN typing to realistic photometric typing that resulted in a contamination with non-Ia SNe. Using a maximum likelihood technique, we showed that the LSST can measure fσ 8 with a precision of 10% in the redshift range 0.02 < z < 0.14 for our most realistic scenario. In three tomographic bins, the LSST will be able to constrain the growth-rate parameter with errors below 18% up to redshift z = 0.14. We also tested the contamination effect on the maximum likelihood method and found that for a contamination fraction below ∼2%, we recovered unbiased measurements. The results of this analysis highlight that the LSST SN sample is expected to complement traditional redshift-space distortion measurements at high redshift. This will provide a novel avenue for testing general relativity and different dark energy models.

Rosselli, D↗

Combining Ratio Estimation for Low Density Parity Check (LDPC) Coding

The Low Density Parity Check (LDPC) Code decoding algorithm make use of a scaled receive signal derived from maximizing the log-likelihood ratio of the received signal. The scaling factor (often called the combining ratio) in an AWGN channel is a ratio between signal amplitude and noise variance. Accurately estimating this ratio has shown as much as 0.6 dB decoding performance gain. This presentation briefly describes three methods for estimating the combining ratio: a Pilot-Guided estimation method, a Blind estimation method, and a Simulation-Based Look-Up table. The Pilot Guided Estimation method has shown that the maximum likelihood estimates of signal amplitude is the mean inner product of the received sequence and the known sequence, the attached synchronization marker (ASM) , and signal variance is the difference of the mean of the squared received sequence and the square of the signal amplitude. This method has the advantage of simplicity at the expense of latency since several frames worth of ASMs. The Blind estimation method s maximum likelihood estimator is the average of the product of the received signal with the hyperbolic tangent of the product combining ratio and the received signal. The root of this equation can be determined by an iterative binary search between 0 and 1 after normalizing the received sequence. This method has the benefit of requiring one frame of data to estimate the combining ratio which is good for faster changing channels compared to the previous method, however it is computationally expensive. The final method uses a look-up table based on prior simulated results to determine signal amplitude and noise variance. In this method the received mean signal strength is controlled to a constant soft decision value. The magnitude of the deviation is averaged over a predetermined number of samples. This value is referenced in a look up table to determine the combining ratio that prior simulation associated with the average magnitude of the deviation. This method is more complicated than the Pilot-Guided Method due to the gain control circuitry, but does not have the real-time computation complexity of the Blind Estimation method. Each of these methods can be used to provide an accurate estimation of the combining ratio, and the final selection of the estimation method depends on other design constraints.

Mahmoud, Saad↗

The average size and temperature profile of quasar accretion disks

We use multi-wavelength microlensing measurements of a sample of 10 image pairs from 8 lensed quasars to study the structure of their accretion disks. By using spectroscopy or narrowband photometry, we have been able to remove contamination from the weakly microlensed broad emission lines, extinction, and any uncertainties in the large-scale macro magnification of the lens model. We determine a maximum likelihood estimate for the exponent of the size versus wavelength scaling (r{sub s} ∝λ {sup p}, corresponding to a disk temperature profile of T∝r {sup –1/p}) of p=0.75{sub −0.2}{sup +0.2} and a Bayesian estimate of p = 0.8 ± 0.2, which are significantly smaller than the prediction of the thin disk theory (p = 4/3). We have also obtained a maximum likelihood estimate for the average quasar accretion disk size of r{sub s}=4.5{sub −1.2}{sup +1.5} lt-day at a rest frame wavelength of λ = 1026 Å for microlenses with a mean mass of M = 1 M {sub ☉}, in agreement with previous results, and larger than expected from thin disk theory.

79 ASTRONOMY AND ASTROPHYSICS↗

Generalized X-ray and neutron crystallographic analysis: more accurate and complete structures for biological macromolecules

X-ray and neutron crystallographic data have been combined in a joint structure-refinement procedure that has been developed using recent advances in modern computational methodologies, including cross-validated maximum-likelihood target functions with gradient-based optimization and simulated annealing. X-ray and neutron crystallographic techniques provide complementary information on the structure and function of biological macromolecules. X-ray and neutron (XN) crystallographic data have been combined in a joint structure-refinement procedure that has been developed using recent advances in modern computational methodologies, including cross-validated maximum-likelihood target functions with gradient-based optimization and simulated annealing. The XN approach for complete (including hydrogen) macromolecular structure analysis provides more accurate and complete structures, as demonstrated for diisopropyl fluorophosphatase, photoactive yellow protein and human aldose reductase. Furthermore, this method has several practical advantages, including the easier determination of the orientation of water molecules, hydroxyl groups and some amino-acid side chains.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Estimation of Time-Varying Pilot Model Parameters

Human control behavior is rarely completely stationary over time due to fatigue or loss of attention. In addition, there are many control tasks for which human operators need to adapt their control strategy to vehicle dynamics that vary in time. In previous studies on the identification of time-varying pilot control behavior wavelets were used to estimate the time-varying frequency response functions. However, the estimation of time-varying pilot model parameters was not considered. Estimating these parameters can be a valuable tool for the quantification of different aspects of human time-varying manual control. This paper presents two methods for the estimation of time-varying pilot model parameters, a two-step method using wavelets and a windowed maximum likelihood estimation method. The methods are evaluated using simulations of a closed-loop control task with time-varying pilot equalization and vehicle dynamics. Simulations are performed with and without remnant. Both methods give accurate results when no pilot remnant is present. The wavelet transform is very sensitive to measurement noise, resulting in inaccurate parameter estimates when considerable pilot remnant is present. Maximum likelihood estimation is less sensitive to pilot remnant, but cannot detect fast changes in pilot control behavior.

Zaal, Peter M. T.↗

Software models: A Bayesian approach to parameter estimation in the Jelenski-Moranda software reliability model

Maximum likelihood estimation procedures for the Jelinski-Moranda software reliability model often give misleading answers. A reparameterization and a Bayesian analysis eliminate some of the problems incurred by MLE methods and often give better predictions on sets of real and simulated data. Practical difficulties in estimating the initial number of errors N and the failure rate of each error phi by the method of maximum likelihood are: N, the MLE of N, is occasionally infinite (i.e., the routines for calculating N and phi do not converge). It is shown that N is finite sub i only if the regression line of the interevent times t sub i vs. i has positive slope. A serious problem is that often N approximates n, the sample size, and sometimes N = n. Thus the MLE predicts that the program is perfect even when it is far from being so. Only when almost all failures have been removed can N and phi be trusted near the end of debugging.

Littlewood, B.↗

On-line methods for rotorcraft aeroelastic mode identification

The requirements for the on-line identification of rotorcraft aeroelastic blade modes from random response test data are presented. A recursive maximum likelihood (RML) technique is used in conjunction with a bandpass filter to identify isolated blade mode damping and frequency. The RML technique is demonstrated to have excellent convergence characteristics in random measurement noise and random process noise excitation. The RML identification technique uses an ARMA representation for the aeroelastic stochastic system and requires virtually no user interaction while providing accurate confidence bands on the parameter estimates. Comparisons are made with an off-line Newton type maximum likelihood algorithm which uses a state variable model representation. Results are presented from simulation random response data which quantify the identifed parameter convergence behavior for various levels of random excitation which is typical of wind tunnel turbulence levels. The RML technique is applied to hingless rotor test data from the NASA Langley Research Center Helicopter Hover Facility.

Molusis, J. A.↗

A COMPARATIVE STUDY OF OPTICAL/ULTRAVIOLET VARIABILITY OF NARROW-LINE SEYFERT 1 AND BROAD-LINE SEYFERT 1 ACTIVE GALACTIC NUCLEI

The ensemble optical/ultraviolet (UV) variability of narrow-line Seyfert 1 (NLS1)-type active galactic nuclei (AGNs) is investigated, based on a sample selected from the Sloan Digital Sky Survey (SDSS) Stripe 82 region with multi-epoch photometric scanning data. As a comparison, a control sample of broad-line Seyfert 1 (BLS1)-type AGNs is also incorporated. To quantify properly the intrinsic variation amplitudes and their uncertainties, a novel method of parametric maximum likelihood is introduced that has, as we argued, certain virtues over previously used methods. The majority of NLS1-type AGNs exhibit significant variability on timescales from about 10 days to a few years with, however, smaller amplitudes on average compared to BLS1-type AGNs. About 20 NLS1-type AGNs that show relatively large variations are presented and may deserve future monitoring observations, for instance, reverberation mapping. The averaged structure functions of variability, constructed using the same maximum likelihood method, show remarkable similarity in shape for the two types of AGNs on timescales longer than about 10 days, which can be approximated by a power law or an exponential function. This, along with other similar properties, such as the wavelength-dependent variability, is indicative of a common dominant mechanism responsible for the long-term optical/UV variability of both NLS1- and BLS1-type AGNs. Toward the short timescales, however, there is tentative evidence that the structure function of NLS1-type AGNs continues to decline, whereas that of BLS1-type AGNs flattens with some residual variability on timescales of days. If this can be confirmed, it may suggest that an alternative mechanism, such as X-ray reprocessing, starts to dominate in BLS1-type AGNs, but not in NLS1-type AGNs, on such timescales.

79 ASTRONOMY AND ASTROPHYSICS↗

A Machine Learning Method for the Forensics Attribution of Separated Plutonium

Plutonium (Pu) source attribution would be a powerful tool to support nuclear nonproliferation efforts. This capability to find the source of a Pu sample would act as a deterrent to smuggling efforts, and also help regulatory agencies verify declared nuclear activities. Work at Texas A&M University yielded a nuclear forensics methodology, which is capable of determining separated Pu’s reactor of origin, fuel burnup, and the time since irradiation (TSI)—three parameters of interest. The methodology used a set of ten intra-element isotopic ratios found in separated Pu, which was compared to a library of isotopic ratio values produced using neutronics simulations for reactors of interest. By calculating the probability that unknown Pu sample’s isotopic ratio set matched a set in the library, the methodology could predict the three parameters of interest of the sample. One shortcoming of this methodology was an inability to correctly attribute spoofed Pu, where Pu sourced from two different reactors or two different fuel burnup levels are mixed. A new methodology to rectify this vulnerability using machine learning (ML) technique is developed, instead of the maximum likelihood calculation previously used and the results are satisfactory. The ML approach leverages the existing simulated data for training the algorithm, but use them efficiently by only using intra-element isotope ratios that contribute to the attribution one of the three parameters at a time. Previously, all isotope ratios were used to attribute all three parameters together. The new methodology attributes the Pu parameters in three steps, one for each parameter, rather than resolving all of the three parameters simultaneously like the previous maximum likelihood approach. First, a support vector machine classifier with a set of seven isotopic ratios finds the reactor of origin and a set of regression models trained using gaussian process predicts the burnup with a different set of seven isotopes. Finally, TSI is calculated analytically using decay equations. Thus far, the new methodology is capable of attributing pure Pu samples and has been validated using experimental data. The next step will to be augment the classifier training data set with spoofed Pu data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Graph Neural Networks for low-energy event classification & reconstruction in IceCube

IceCube, a cubic-kilometer array of optical sensors built to detect atmospheric and astrophysical neutrinos between 1 GeV and 1 PeV, is deployed 1.45 km to 2.45 km below the surface of the ice sheet at the South Pole. The classification and reconstruction of events from the in-ice detectors play a central role in the analysis of data from IceCube. Reconstructing and classifying events is a challenge due to the irregular detector geometry, inhomogeneous scattering and absorption of light in the ice and, below 100 GeV, the relatively low number of signal photons produced per event. To address this challenge, it is possible to represent IceCube events as point cloud graphs and use a Graph Neural Network (GNN) as the classification and reconstruction method. The GNN is capable of distinguishing neutrino events from cosmic-ray backgrounds, classifying different neutrino event types, and reconstructing the deposited energy, direction and interaction vertex. Based on simulation, we provide a comparison in the 1 GeV–100 GeV energy range to the current state-of-the-art maximum likelihood techniques used in current IceCube analyses, including the effects of known systematic uncertainties. For neutrino event classification, the GNN increases the signal efficiency by 18% at a fixed background rate, compared to current IceCube methods. Alternatively, the GNN offers a reduction of the background (i.e. false positive) rate by over a factor 8 (to below half a percent) at a fixed signal efficiency. For the reconstruction of energy, direction, and interaction vertex, the resolution improves by an average of 13%–20% compared to current maximum likelihood techniques in the energy range of 1 GeV–30 GeV. The GNN, when run on a GPU, is capable of processing IceCube events at a rate nearly double of the median IceCube trigger rate of 2.7 kHz, which opens the possibility of using low energy neutrinos in online searches for transient events.

47 OTHER INSTRUMENTATION↗

Multi-stage decoding for multi-level block modulation codes

Various types of multistage decoding for multilevel block modulation codes, in which the decoding of a component code at each stage can be either soft decision or hard decision, maximum likelihood or bounded distance are discussed. Error performance for codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. It was found that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. It was found that the difference in performance between the suboptimum multi-stage soft decision maximum likelihood decoding of a modulation code and the single stage optimum decoding of the overall code is very small, only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Lin, Shu↗

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗

Multi-stage decoding for multi-level block modulation codes

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Lin, Shu↗