A critical statistic for channels with memory
Markov chain model for characterizing error sequences in digital channels with memory
Adoul, J-P. A.↗
SEARCH · Search NASA
Results for “Markov Chain Model”
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.
Accelerated procedures for the solution of discret e Markov control problems
Accelerated procedures for Markov chain model optimal control problems solution with computation time advantage over usual dynamic programming
Kleinman, A. J.↗
On the control, stability, and waiting time in a slotted ALOHA random-access system
This paper explores some of the boundaries in performance of slotted ALOHA systems by analyzing a simple and almost optimal centrally supervised control. The control results in a very simple Markov chain model and allows an examination of stability, conditional waiting time distribution of transmitting terminals, and many other system measures. The key to the simplicity is to have a probability of successful packet transmission that is independent of the number of transmitting terminals. In considering waiting time, we calculate the mean and other moments of the waiting time of a terminal when it enters the system to find (n - 1) other terminals already there competing for the channel. Under this control, the average time is proportional to n. The control requires exact knowledge of the number of terminals contending for the channel, and hence is not implementable, except as an approximation.
Ferguson, M. J.↗
Analysis of a first order phase locked loop in the presence of Gaussian noise
A first-order digital phase locked loop is analyzed by application of a Markov chain model. Steady state loop error probabilities, phase standard deviation, and mean loop transient times are determined for various input signal to noise ratios. Results for direct loop simulation are presented for comparison.
Blasche, P. R.↗
Investigation of air transportation technology at Ohio University, 1980
Specific configurations of first and second order all digital phase locked loops were analyzed for both ideal and additive gaussian noise inputs. In addition, a design for a hardware digital phase locked loop capable of either first or second order operation was evaluated along with appropriate experimental data obtained from testing of the hardware loop. All parameters chosen for the analysis and the design of the digital phase locked loop were consistent with an application to an Omega navigation receiver although neither the analysis nor the design are limited to this application. For all cases tested, the experimental data showed close agreement with the analytical results indicating that the Markov chain model for first and second order digital phase locked loops are valid.
Mcfarland, R. H.↗
On the delay analysis of a TDMA channel with finite buffer capacity
The throughput performance of a TDMA channel with finite buffer capacity for transmitting data messages is considered. Each station has limited message buffer capacity and has Poisson message arrivals. Message arrivals will be blocked if the buffers are congested. Using the embedded Markov chain model, the solution procedure for the limiting system-size probabilities is presented in a recursive fashion. Numerical examples are given to demonstrate the tradeoffs between the blocking probabilities and the buffer sizing strategy.
Yan, T.-Y.↗
Vector computer memory bank contention
A number of vector supercomputers feature very large memories. Unfortunately the large capacity memory chips that are used in these computers are much slower than the fast central processing unit (CPU) circuitry. As a result, memory bank reservation times (in CPU ticks) are much longer than on previous generations of computers. A consequence of these long reservation times is that memory bank contention is sharply increased, resulting in significantly lowered performance rates. The phenomenon of memory bank contention in vector computers is analyzed using both a Markov chain model and a Monte Carlo simulation program. The results of this analysis indicate that future generations of supercomputers must either employ much faster memory chips or else feature very large numbers of independent memory banks.
Bailey, D. H.↗
Vector computer memory bank contention
A number of vector supercomputers feature very large memories. Unfortunately the large capacity memory chips that are used in these computers are much slower than the fast central processing unit (CPU) circuitry. As a result, memory bank reservation times (in CPU ticks) are much longer than on previous generations of computers. A consequence of these long reservation times is that memory bank contention is sharply increased, resulting in significantly lowered performance rates. The phenomenon of memory bank contention in vector computers is analyzed using both a Markov chain model and a Monte Carlo simulation program. The results of this analysis indicate that future generations of supercomputers must either employ much faster memory chips or else feature very large numbers of independent memory banks.
Bailey, David H.↗
Efficient parametric analysis of performance measures for communication networks
Efficient techniques for estimating performance measures in communication networks in a steady-state or transient setting are developed. These techniques may be used in a simulation environment or in connection with real-time observations. For Markov chain models, the recently proposed standard clock approach is extended, and a class of real-time algorithms for simultaneously generating multiple sample paths under different parameter sets is presented. Attention is focused on the link crash time estimation problem, where a 'crash' is defined as the first time a buffer overflows, given some initial conditions. An algorithm for estimating crash times under various traffic shocks is derived, where all estimates are obtained in parallel to an actual network's normal operation. An algorithm for crash time estimation of a G/D/1 link model is also derived using a different (perturbation-analysis-based) approach. Finally, extensive simulation results are provided to validate the proposed algorithms and compare them to brute-force simulation.
Cassandras, Christos G.↗
End-to-End QoS for Differentiated Services and ATM Internetworking
The Internet was initially design for non real-time data communications and hence does not provide any Quality of Service (QoS). The next generation Internet will be characterized by high speed and QoS guarantee. The aim of this paper is to develop a prioritized early packet discard (PEPD) scheme for ATM switches to provide service differentiation and QoS guarantee to end applications running over next generation Internet. The proposed PEPD scheme differs from previous schemes by taking into account the priority of packets generated from different application. We develop a Markov chain model for the proposed scheme and verify the model with simulation. Numerical results show that the results from the model and computer simulation are in close agreement. Our PEPD scheme provides service differentiation to the end-to-end applications.
Su, Hongjun↗
Predicting Vertical Concentration Profiles in the Marine Atmospheric Boundary Layer With a Markov Chain Random Walk Model
Explore the source record for details and available documents.
Hyungwon John Park↗
Markov chains for testing redundant software
A preliminary design for a validation experiment has been developed that addresses several problems unique to assuring the extremely high quality of multiple-version programs in process-control software. The procedure uses Markov chains to model the error states of the multiple version programs. The programs are observed during simulated process-control testing, and estimates are obtained for the transition probabilities between the states of the Markov chain. The experimental Markov chain model is then expanded into a reliability model that takes into account the inertia of the system being controlled. The reliability of the multiple version software is computed from this reliability model at a given confidence level using confidence intervals obtained for the transition probabilities during the experiment. An example demonstrating the method is provided.
White, Allan L.↗
The Communication Link and Error ANalysis (CLEAN) simulator
During the period July 1, 1993 through December 30, 1993, significant developments to the Communication Link and Error ANalysis (CLEAN) simulator were completed and include: (1) Soft decision Viterbi decoding; (2) node synchronization for the Soft decision Viterbi decoder; (3) insertion/deletion error programs; (4) convolutional encoder; (5) programs to investigate new convolutional codes; (6) pseudo-noise sequence generator; (7) soft decision data generator; (8) RICE compression/decompression (integration of RICE code generated by Pen-Shu Yeh at Goddard Space Flight Center); (9) Markov Chain channel modeling; (10) percent complete indicator when a program is executed; (11) header documentation; and (12) help utility. The CLEAN simulation tool is now capable of simulating a very wide variety of satellite communication links including the TDRSS downlink with RFI. The RICE compression/decompression schemes allow studies to be performed on error effects on RICE decompressed data. The Markov Chain modeling programs allow channels with memory to be simulated. Memory results from filtering, forward error correction encoding/decoding, differential encoding/decoding, channel RFI, nonlinear transponders and from many other satellite system processes. Besides the development of the simulation, a study was performed to determine whether the PCI provides a performance improvement for the TDRSS downlink. There exist RFI with several duty cycles for the TDRSS downlink. We conclude that the PCI does not improve performance for any of these interferers except possibly one which occurs for the TDRS East. Therefore, the usefulness of the PCI is a function of the time spent transmitting data to the WSGT through the TDRS East transponder.
Ebel, William J.↗
Probabilistic Power Consumption Modeling for Commercial Buildings Using Logistic Regression Markov Chain
The total energy consumed by buildings takes up to 40% of U.S. energy use, in which a large portion is contributed by commercial buildings. Building performance optimization is desirable but requires accurate building models with uncertainties taken into account. This paper proposes a novel probabilistic modeling method using Logistic Regression Markov Chain (LRMC). The LRMC model enhances the performance of traditional Markov Chain (MC) models by adopting time-variant transition matrices calibrated using logistic regression with exogenous inputs. Compared with existing building models, the proposed model produces accurate multi-step modeling results with full probability distribution. The proposed probabilistic building model is tested using actual commercial building measurements and modeling performance is evaluated with two probabilisitc metrics. The results show that the LRMC model has higher accuracy than traditional MC model and Logistic Regression (LR) model in that it yields lower error scores under both evaluation metrics.
Building modeling↗
Integrated Risk-Informed Condition Based Maintenance Capability and Automated Platform: Technical Report 3
This project is a collaborative research effort between PKMJ Technical Services LLC, Idaho National Laboratory, and Public Service Enterprise Group (PSEG) Nuclear, LLC. The collaboration, led by PKMJ Technical Services LLC, is part of the industry Funding Opportunity Announcement (FOA) award under Advanced Nuclear Technology Development FOA #DE-FOA-0001817. The pilot demonstration focuses on the Circulating Water System (CWS), an important non-safety-related system that impacts the power generation capability of the plant site. Achieving riskinformed condition-based Predictive Maintenance (PdM) on the CWS will result in significant economic benefits, and the developed methodologies can also be applied to other plant systems. This approach supports an industry goal of ensuring that nuclear power generation remains a viable, economically competitive option in the energy market. Operation and Maintenance (O&M) costs include labor-intensive Preventive Maintenance (PM) programs that involve manually performed inspection, calibration, testing, and maintenance of plant assets at periodic frequencies as well as time-based replacement of assets, irrespective of condition. This project offers an alternative by focusing on riskinformed condition-based maintenance to reduce O&M costs while still maintaining plant health and safety. This report summarizes the progress made toward achieving a risk-informed condition-based maintenance approach. The research and development (R&D) activities presented in this report are associated with development of a nuclear digital platform application, integration of fault signature models, and automated work management processes. The fault signatures and Machine Learning (ML) models are key components in predictive analytics and are heavily leveraged to improve the insights received by existing plant process data sources. Availability of the analysis results within a centralized digital platform enhances efficiency by enabling automation of activities otherwise performed manually. Personnel are presented with enhanced information that can be used to evaluate plant status and risks. Utilizing the enhancements to data analytics supports automated responses, (i.e. issuance of work orders) to address developing equipment faults and thus preventing forced, unplanned shutdowns of components or systems. The R&D activities described within this report lay the foundation for developing and demonstrating a digital automated platform to centralize the implementation of condition monitoring and response to equipment faults. The digital automated platform is cloud-based and designed to enable improved efficiency of plant processes. The digital platform includes content related to maintenance optimization, fault signature analysis, and plant records, which can all be used to support efficiencies when located within a centralized digital platform. These efficiencies could be further enhanced when deployed through industry-wide deployment of the technology to improve insights and processes based upon economies of scale.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Markov Process to Evaluate the Value Proposition of a Risk-Informed Predictive Maintenance Strategy
To achieve high-capacity factors, the nuclear fleet has relied on labor-intensive and time-consuming operation and preventive maintenance programs for plant systems. Manually performed inspection, calibration, testing, and maintenance of plant assets at periodic frequencies, along with time-based replacement of assets irrespective of condition, have resulted in a costly, labor-centric business model. Fortunately, there are technologies that can eliminate unnecessary preventive maintenance activities by deploying risk-informed predictive maintenance, enabling the transition to a technology-centric business model. The technology-centric business model will enable plants to optimize and automate maintenance activities, leading to cost reductions since labor is a rising cost and technology is a declining cost. The implementation of scalable technologies and methodologies across plant systems and across the nuclear fleet is critical for successful deployment of a risk-informed predictive maintenance strategy at commercial nuclear power plants. The work presented in the report is being developed as part of a collaborative research effort between Idaho National Laboratory and Public Service Enterprise Group Nuclear, LLC. This report describes the technical basis using the Markov Process to evaluate the value proposition for the risk-informed predictive maintenance strategy for the circulating water system. The plant process data from the Salem nuclear plant’s circulating water system is utilized to develop a Markov chain risk models and formulation to estimate the loss and gain in revenue based on plant availability. The outcomes presented in this report provides the technical basis for extensive quantitative evaluation of a scalable risk-informed predictive maintenance strategy as part of future research.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Accelerating multilevel Markov Chain Monte Carlo using machine learning models
Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.
97 MATHEMATICS AND COMPUTING↗
Accelerating Markov Chain Monte Carlo sampling with diffusion models
Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global fit of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalising flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗