Search NASA⌕ Search

SEARCH · Search NASA

Results for “MARKOV PROCESS”

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 145 records · Page 8

An analytic technique for statistically modeling random atomic clock errors in estimation

Minimum variance estimation requires that the statistics of random observation errors be modeled properly. If measurements are derived through the use of atomic frequency standards, then one source of error affecting the observable is random fluctuation in frequency. This is the case, for example, with range and integrated Doppler measurements from satellites of the Global Positioning and baseline determination for geodynamic applications. An analytic method is presented which approximates the statistics of this random process. The procedure starts with a model of the Allan variance for a particular oscillator and develops the statistics of range and integrated Doppler measurements. A series of five first order Markov processes is used to approximate the power spectral density obtained from the Allan variance.

Fell, P. J.↗

Evaluation of computing systems using functionals of a Stochastic process

An intermediate model was used to represent the probabilistic nature of a total system at a level which is higher than the base model and thus closer to the performance variable. A class of intermediate models, which are generally referred to as functionals of a Markov process, were considered. A closed form solution of performability for the case where performance is identified with the minimum value of a functional was developed.

Meyer, J. F.↗

Orion Absolute Navigation System Progress and Challenges

The Orion spacecraft is being designed as NASA's next-generation exploration vehicle for crewed missions beyond Low-Earth Orbit. The navigation system for the Orion spacecraft is being designed in a Multi-Organizational Design Environment (MODE) team including contractor and NASA personnel. The system uses an Extended Kalman Filter to process measurements and determine the state. The design of the navigation system has undergone several iterations and modifications since its inception, and continues as a work-in-progress. This paper seeks to benchmark the current state of the design and some of the rationale and analysis behind it. There are specific challenges to address when preparing a timely and effective design for the Exploration Flight Test (EFT-1), while still looking ahead and providing software extensibility for future exploration missions. The primary measurements in a Near-Earth or Mid-Earth environment consist of GPS pseudorange and deltarange, but for future explorations missions the use of star-tracker and optical navigation sources need to be considered. Discussions are presented for state size and composition, processing techniques, and consider states. A presentation is given for the processing technique using the computationally stable and robust UDU formulation with an Agee-Turner Rank-One update. This allows for computational savings when dealing with many parameters which are modeled as slowly varying Gauss-Markov processes. Preliminary analysis shows up to a 50% reduction in computation versus a more traditional formulation. Several state elements are discussed and evaluated, including position, velocity, attitude, clock bias/drift, and GPS measurement biases in addition to bias, scale factor, misalignment, and non-orthogonalities of the accelerometers and gyroscopes. Another consideration is the initialization of the EKF in various scenarios. Scenarios such as single-event upset, ground command, pad alignment, cold start are discussed as are strategies for whole and partial state updates as well as covariance considerations. Strategies are given for dealing with latent measurements and high-rate propagation using multi-rate architecture. The details of the rate groups and the data ow between the elements is discussed and evaluated.

Holt, Greg N.↗

Orion Absolute Navigation System Progress and Challenge

The absolute navigation design of NASA's Orion vehicle is described. It has undergone several iterations and modifications since its inception, and continues as a work-in-progress. This paper seeks to benchmark the current state of the design and some of the rationale and analysis behind it. There are specific challenges to address when preparing a timely and effective design for the Exploration Flight Test (EFT-1), while still looking ahead and providing software extensibility for future exploration missions. The primary onboard measurements in a Near-Earth or Mid-Earth environment consist of GPS pseudo-range and delta-range, but for future explorations missions the use of star-tracker and optical navigation sources need to be considered. Discussions are presented for state size and composition, processing techniques, and consider states. A presentation is given for the processing technique using the computationally stable and robust UDU formulation with an Agee-Turner Rank-One update. This allows for computational savings when dealing with many parameters which are modeled as slowly varying Gauss-Markov processes. Preliminary analysis shows up to a 50% reduction in computation versus a more traditional formulation. Several state elements are discussed and evaluated, including position, velocity, attitude, clock bias/drift, and GPS measurement biases in addition to bias, scale factor, misalignment, and non-orthogonalities of the accelerometers and gyroscopes. Another consideration is the initialization of the EKF in various scenarios. Scenarios such as single-event upset, ground command, and cold start are discussed as are strategies for whole and partial state updates as well as covariance considerations. Strategies are given for dealing with latent measurements and high-rate propagation using multi-rate architecture. The details of the rate groups and the data ow between the elements is discussed and evaluated.

Holt, Greg N.↗

ALTKAL: An optimum linear filter for GEOS-3 altimeter data

ALTKAL is a computer program designed to smooth sea surface height data obtained from the GEOS 3 altimeter, and to produce minimum variance estimates of sea surface height and sea surface slopes, along with their standard derivations. The program operates by processing the data through a Kalman filter in both the forward and backward directions, and optimally combining the results. The sea surface height signal is considered to have a geoid signal, modeled by a third order Gauss-Markov process, corrupted by additive white noise. The governing parameters for the signal and noise processes are the signal correlation length and the signal-to-noise ratio. Mathematical derivations of the filtering and smoothing algorithms are presented. The smoother characteristics are illustrated by giving the frequency response, the data weighting sequence and the transfer function of a realistic steady-state smoother example. Based on nominal estimates for geoidal undulation amplitude and correlation length, standard deviations for the estimated sea surface height and slope are 12 cm and 3 arc seconds, respectively.

Fang, B. T.↗

A new adaptive control approach for aerospace vehicles with parameter uncertainties

A new stochastic adaptive control structure is developed for the problem of combined parameter estimation and control of aerospace vehicles with changing parameters. Parameter uncertainties are modeled as first-order Gauss-Markov processes, and are introduced to the system dynamics through a small parameter. It is assumed that an accurate inertial measurement unit gives perfect measurements of the state variables. Since the stochastic system is assumed to be Gauss-Markov, the density function of the parameters given these measurements is conditionally Gaussian. Based on this conditionally Gaussian density, the problem of minimizing a quadratic cost over an infinite time horizon can be set up within the framework of stochastic optimal control theory. The optimal feedback control law is derived from a straightforward expansion of the Hamilton-Jacobi-Bellman equation, based on the LQG solution. The resulting nonlinear controller is applied to the pitch axis control of a space platform with uncertain moments of inertia and is shown to produce marked improvement over a fixed controller.

Hahn, Yungsun↗

Leaf optical system modeled as a stochastic process

A stochastic leaf radiation model based upon physical and physiological properties of dicot leaves has been developed. The model accurately predicts the absorbed, reflected, and transmitted radiation of normal incidence as a function of wavelength resulting from the leaf-irradiance interaction over the spectral interval of 0.40-2.50 micron. The leaf optical system has been represented as Markov process with a unique transition matrix at each 0.01-micron increment between 0.40 micron and 2.50 micron. Probabilities are calculated at every wavelength interval from leaf thickness, structure, pigment composition, and water content. Simulation results indicate that this approach gives accurate estimations of actual measured values for dicot leaf absorption, reflection, and transmission as a function of wavelength.

Tucker, C. J.↗

Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces

Typical generative diffusion models rely on a Gaussian diffusion process for training the backward transformations, which can then be used to generate samples from Gaussian noise. However, real world data often takes place in discrete-state spaces, including many scientific applications. Here, we develop a theoretical formulation for arbitrary discrete-state Markov processes in the forward diffusion process using exact (as opposed to variational) analysis. We relate the theory to the existing continuous-state Gaussian diffusion as well as other approaches to discrete diffusion, and identify the corresponding reverse-time stochastic process and score function in the continuous-time setting, and the reverse-time mapping in the discrete-time setting. As an example of this framework, we introduce “Blackout Diffusion”, which learns to produce samples from an empty image instead of from noise. Numerical experiments on the CIFAR-10, Binarized MNIST, and CelebA datasets confirm the feasibility of our approach. Generalizing from specific (Gaussian) forward processes to discrete-state processes without a variational approximation sheds light on how to interpret diffusion models, which we discuss.

Santos, Javier E.↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique pattern of interaction with the visual environment. This is true even in a restricted domain, such as a piloting an aircraft, where activities with distinct visual signatures might be things like communicating, navigating, and monitoring. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these hypothetical activities. The method is in some respects similar to recurrence analysis, but here we compare not individual fixations, but groups of fixations aggregated over a fixed time interval. The duration of this interval is a parameter that we will refer to as delta. We assume that the environment has been divided into a set of N different areas-of-interest (AOIs). For a given interval of time of duration delta, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector. These proportions can be converted to integer counts by multiplying by delta divided by the average fixation duration (another parameter that we fix at 280 milliseconds). We compare different intervals by computing the chi-square statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. The method has been applied to approximately 100 hours of eye movement data collected from pilots in a high-fidelity B747 flight simulator, and the results have been compared to synthetic data in which the each activity is represented as first-order Markov process with random probabilities assigned to the AOIs. Randomly-generated synthetic activities can require thousands of fixations to be discriminated with statistical significance, while the human data can be clustered using averaging windows of some 10's of seconds, suggesting that the actual activities are much more narrowly focused than random Markov models.

activity analysis↗

Code for the manuscript titled "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces"

We would like to disclose two scripts, written in Jupyter notebook, in which we implement the "Blackout Diffusion Process" described in the manuscript "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces" (LA-UR-23-20509), to be submitted to the International Conference of Machine Learning (ICML). The abstract of the manuscript is append below. == Typical generative diffusion models rely on a Gaussian diffusion process for training the backward transformations, which can then be used generate samples from Gaussian noise. However, real world data often takes place in discrete-state spaces, which occur in many scientific applications. Here, we develop a theoretical formulation for arbitrary discrete-state Markov processes in the forward diffusion process. We relate the theory to the existing continuous-state Gaussian diffusion and identify the corresponding reverse-time stochastic process and score function in the continuous-time setting, and the reverse-time mapping in the discrete-time setting. As an example of this framework, we introduce "Blackout Diffusion", which learns to produce samples from an empty image instead of from noise. Numerical experiments on the CIFAR-10 dataset confirm the feasibility of generative diffusion modeling in a discrete space. Generalizing from specific (Gaussian) forward processes to a more general framework also sheds light on how to interpret generative diffusion models and their mathematical structure, which we comment on.

Lin, Yen Ting↗

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗

A Deep Generative Model for Non-Intrusive Identification of EV Charging Profiles

The proliferation of electric vehicles (EVs) brings environmental benefits and technical challenges to power grids. An identification algorithm which can accurately extract individual EV charging profiles out of widely available smart meter measurements has attracted great interests. This paper proposes a non-intrusive identification framework for EV charging profile extraction, which is driven by deep generative models (DGM). First, the proposed DGM is designed as a representation layer embedded into the Markov process and used to model the joint probability distribution of available time-series data. A novel contribution is to approximate posterior distributions by neural networks whose parameters are obtained by variational inference and supervised learning. Second, the EV charging status is inferred from the DGM via dynamic programming. Lastly, the desired EV charging profile can be reconstructed by the rated power of EV models and inferred status. Compared with the benchmark Hidden Markov Models, the proposed framework can better handle noise in data with less computational complexity and better overall accuracy performances with smaller recall. The proposed framework is validated by numerical experiments on the Pecan Street dataset.

33 ADVANCED PROPULSION SYSTEMS↗

Post-hoc reweighting of hadron production in the Lund string model

We present a method for reweighting flavor selection in the Lund string fragmentation model. This is the process of calculating and applying event weights enabling fast and exact variation of hadronization parameters on pre-generated event samples. The procedure is post hoc, requiring only a small amount of additional information stored per event, and allowing for efficient estimation of hadronization uncertainties without repeated simulation. Weight expressions are derived from the hadronization algorithm itself, and validated against direct simulation for a wide range of observables and parameter shifts. The hadronization algorithm can be viewed as a hierarchical Markov process with stochastic rejections, a structure common to many complex simulations outside of high-energy physics. This perspective makes the method modular, extensible, and potentially transferable to other domains. We demonstrate the approach in Pythia, including both coverage considerations and timing benefits. For the purpose of this paper, our goal is to develop and demonstrate the the formalism, and we therefore exclude several model variations for baryon production (popcorn model, junction production) needed for proton collisions. These will be the topic of a future paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian recursive image estimation.

A procedure for recursively estimating images that are characterized statistically by the mean and correlation functions associated with the random process representing the brightness level is proposed for the case where the images are corrupted by additive noise. First, a dynamic model is developed with a response characteristic which matches that of the scanner output (the input of the estimator is the output of a horizontal line scanner) in a statistical sense. Such models have the form of an ordinary differential or difference equation with white noise input. An insignificant approximation is introduced by using a constant-coefficient model. The appropriate model is a vector valued difference equation with the solution representing a vector Markov process. The next step is to obtain the minimum mean square estimate of the image by using a Kalman filter. Since the image estimation is an interpolation problem, two successive runs over the observation are performed in opposite directions and the resultant estimates are averaged. Examples are included for illustration.

Nahi, N. E.↗

Cellular Statistical Models of Broken Cloud Fields. Part IV: Effects of Pixel Size on Idealized Satellite Observations

In the fourth part of our “Cellular Statistical Models of Broken Cloud Fields” series we use the binary Markov processes framework for quantitative investigation of the effects of low resolution of idealized satellite observations on the statistics of the retrieved cloud masks. We assume that the cloud fields are Markovian and are characterized by the “actual” cloud fraction (CF) and scale length. We use two different models of observations: a simple discrete-point sampling and a more realistic “pixel” protocol. The latter is characterized by a state attribution function (SAF) which has the meaning of the probability that the pixel with a certain CF is declared cloudy in the observed cloud mask. The stochasticity of the SAF means that the cloud/clear attribution is not ideal and can be affected by external or unknown factors. We show that the observed cloud masks can be accurately described as Markov chains of pixels and use the master-matrix formalism (introduced in Part III of the series) for analytical computation of their parameters: the “observed” CF and scale length. This procedure allows us to establish a quantitative relationship (which is pixel-size dependent) between the actual and the observed cloud-field statistics. The feasibility of restoring the former from the latter is considered. The adequacy of our analytical approach to idealized observations is evaluated using numerical simulations. Comparison of the observed parameters of the simulated datasets with their theoretical expectations showed an agreement within 0.005 for the CF, while for the scale length it is within 1% in the sampling case and within 4% in the pixel case.

Mikhail D. Alexandrov↗

Thermodynamics, morphology, and kinetics of early-stage self-assembly of π-conjugated oligopeptides

Synthetic oligopeptides containing π-conjugated cores self-assemble novel materials with attractive electronic and photophysical properties. All-atom, explicit solvent molecular dynamics simulations of Asp-Phe-Ala-Gly-OPV3-Gly-Ala-Phe-Asp peptides were used to parameterize an implicit solvent model to simulate early-stage self-assembly. Under low-pH conditions, peptides assemble into β-sheet-like stacks with strongly favorable monomer association free energies of ΔF ≈ -25kBT. Aggregation at high-pH produces disordered aggregates destabilized by Coulombic repulsion between negatively charged Asp termini (ΔF ≈ -5kBT). In simulations of hundreds of monomers over 70 ns we observe the spontaneous formation of up to undecameric aggregates under low-pH conditions. Modeling assembly as a continuous-time Markov process, we infer transition rates between different aggregate sizes and microsecond relaxation times for early-stage assembly. Our data suggests a hierarchical model of assembly in which peptides coalesce into small clusters over tens of nanoseconds followed by structural ripening and diffusion limited aggregation on longer time scales. This work provides new molecular-level understanding of early-stage assembly, and a means to study the impact of peptide sequence and aromatic core chemistry upon the thermodynamics, assembly kinetics, and morphology of the supramolecular aggregates.

36 MATERIALS SCIENCE↗