Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 56 for “"Discrete Time Markov Chain"”.

  1. Sequences Of Random Matrices Modulated By A Discrete-Time Markov Chain

    … random sequences that are modulated by a discrete-time Markov chain having a finite space.Assuming that the state space of the Markov chain is large, our main effort in this work is devoted to reducing the complexity. To achieve this goal, our formulation uses time-scale separation of the …

    wayne-thes Repository record for Sequences Of Random Matrices Modulated By A Discrete-Time Markov Chain (opens in a new tab)

  2. Modeling Student Enrollment at ETSU Using a Discrete-Time Markov Chain Model

    Discrete-time Markov chain models can be used to make future predictions in many important fields including education. Government and educational institutions today are concerned about college enrollment and what impacts the number of students enrolling. One challenge is how to make an accurate …

    etsu Repository record for Modeling Student Enrollment at ETSU Using a Discrete-Time Markov Chain Model (opens in a new tab) Download PDF for Modeling Student Enrollment at ETSU Using a Discrete-Time Markov Chain Model (opens in a new tab)

  3. An eigenvalue-based approach to the finite time behavior of simulated annealing

    … we present a framework under which the finite time behavior of the simulated annealing for combinatorial optimization can be studied. We will use linear algebraic methods for this purpose. The simulated annealing algorithm will be modeled as a finite space, discrete time Markov chain which can …

    uiuc Repository record for An eigenvalue-based approach to the finite time behavior of simulated annealing (opens in a new tab)

  4. Asymptotic Properties Of Markov Modulated Sequences With Fast And Slow Time Scales

    … we investigate asymptotic properties of Markov modulated random processes having two-time scales. The model contains a number of mixing sequences modulated by a switching process that is a discrete-time Markov chain. The motivation of our study stems from applications in manufacturing …

    wayne-thes Repository record for Asymptotic Properties Of Markov Modulated Sequences With Fast And Slow Time Scales (opens in a new tab)

  5. A Markov chain model for predicting Major League Baseball

    In this report, we present a Markov chain model for predicting the scores and the winning team of Major League Baseball (MLB) games. We discuss how a baseball game can be viewed as an infinite horizon discrete-time Markov chain with finite state space. We demonstrate how standard Markov chain …

    texas Repository record for A Markov chain model for predicting Major League Baseball (opens in a new tab)

  6. ENERGY RESILIENCE IMPACT OF SUPPLY CHAIN NETWORK DISRUPTION TO MILITARY MICROGRIDS

    … competitors can disrupt the associated supply chain network, thereby affecting mission-critical loads. Utilizing an integrated discrete-time Markov chain and dynamic Bayesian network approach, we investigate disruption propagation throughout a supply chain network and quantify its mission …

    nps Repository record for ENERGY RESILIENCE IMPACT OF SUPPLY CHAIN NETWORK DISRUPTION TO MILITARY MICROGRIDS (opens in a new tab)

  7. On some Markovian Salvo combat models

    In this thesis, we present Markov-based probability models for two important problems related to current combat situations: fire allocating of salvos against multiple targets, and Improvised Explosive Devices (IED) attacks on convoys transporting supply and troops. For the fire allocation problem, …

    nps Repository record for On some Markovian Salvo combat models (opens in a new tab)

  8. Analyzing and improving air cargo terminal operations

    … and stochastic customer requests and processing times, which make formulation of analytical model difficult, a Petri Net model is developed to describe the retrieval process, from which a corresponding discrete event simulation model is developed. Secondly, we propose a new storage policy for …

    nus Repository record for Analyzing and improving air cargo terminal operations (opens in a new tab) Download file for Analyzing and improving air cargo terminal operations (opens in a new tab)

  9. A model for Arctic Charr populations in Cambridge Bay considering fluctuating environment

    … First, we formulate an age- and stage-structured discrete-time matrix population model to describe the behaviour of an Arctic Charr population. Given the properties of the model, a weak ergodic behaviour is expected in the long run. Then, utilizing data collected in Cambridge Bay and using a …

    manitoba Repository record for A model for Arctic Charr populations in Cambridge Bay considering fluctuating environment (opens in a new tab)

  10. A study on air cargo revenue management

    … spot market. The booking process is modeled as a discrete-time Markov chain and the airline?s decision on accepting/rejecting booking request is based on a bid-price control policy. To avoid the complexity of high dimensionality, the bid prices are derived from maximizing a reward function of the …

    nus Repository record for A study on air cargo revenue management (opens in a new tab) Download file for A study on air cargo revenue management (opens in a new tab)

  11. Estimation of buffer overflow probabilities and economies of scale in ATM multiplexers by analysis of a model of packetized voice traffic

    … with each source modelled by a copy of a discrete time Markov Chain which we call the Cell Level Model. Throughout, appropriate parameters are scaled with L, to maintain a constant load over all superposition sizes. The probability that, the queue-length (q^) of the queue in a finite …

    dcu Download PDF for Estimation of buffer overflow probabilities and economies of scale in ATM multiplexers by analysis of a model of packetized voice traffic (opens in a new tab)

  12. Coordinated inland area Search and Rescue (SAR) planning and execution tool

    … COINSS models the movement of the target as a discrete time Markov chain. Bayes theorem is used to update the probability map when negative search information is provided. This thesis will improve inland SAR operations by providing the first model with an interactive graphical user interface …

    nps Repository record for Coordinated inland area Search and Rescue (SAR) planning and execution tool (opens in a new tab)

  13. Analysis of single-molecule kinesin assay data by hidden Markov model filtering

    … the position of the kinesin as a function of time, although this information remains obscured because of the fluctuations of the bead. The theory of hidden Markov models suggests a possible theoretical framework to analyze these data with an explicit stochastic model describing the kinesin …

    arizona-thes Repository record for Analysis of single-molecule kinesin assay data by hidden Markov model filtering (opens in a new tab)

  14. BAYESIAN SEARCH FOR UNDERSEA WARFARE WITH DYNAMIC SIDE INFORMATION

    … target submarine (Red). Red moves according to a discrete-time Markov chain, and Blue uses Bayesian updating to determine a belief distribution over Red's location. Two myopic search policies and both perfect and imperfect sensors are evaluated. The gradient search policy with one imperfect …

    nps Repository record for BAYESIAN SEARCH FOR UNDERSEA WARFARE WITH DYNAMIC SIDE INFORMATION (opens in a new tab)

  15. A multi-armed bandit approach to following a Markov Chain

    … quick but also well informed decisions regarding time-dependent entities of interest. For example, consider a law enforcement organization (searcher) with a sizable list of potential terrorists (targets) but far fewer observational assets (sensors). The searcher's goal being to follow the target, …

    nps Repository record for A multi-armed bandit approach to following a Markov Chain (opens in a new tab)

  16. Probabilistic Modeling and Verification of Large Scale Systems

    … model the dynamics of the state transitions as a Discrete Time Markov Chain (DTMC) and develop an on-line model estimation method as well as a goodness of fit test that statistically validates the model. We develop a probabilistic temporal logic called iLTL in order to specify aggregate behaviors …

    uiuc Repository record for Probabilistic Modeling and Verification of Large Scale Systems (opens in a new tab)

  17. Investment-Consumption with a Randomly Terminating Income

    … income stream. The distributions of the random time of default and the random terminal time are prescribed by deterministic hazard rates, and the investor makes investments in a standard financial market with a bond and a stock, modeled by geometric Brownian motion. In addition, the investor …

    byu Repository record for Investment-Consumption with a Randomly Terminating Income (opens in a new tab) Download PDF for Investment-Consumption with a Randomly Terminating Income (opens in a new tab)

  18. THE AGING GERMAN NAVY: SEA–STAFF–SCHOOL WORKFORCE DYNAMICS AND MARKOV PROJECTIONS TO 2040

    … transitions for four career tracks. Discrete-time Markov chain manpower models are calibrated and validated with backtesting and Monte Carlo uncertainty analysis to project inventory and age through 2040 under baseline and recruiting scenarios. From 2015 to 2025, total Navy strength …

    nps Repository record for THE AGING GERMAN NAVY: SEA–STAFF–SCHOOL WORKFORCE DYNAMICS AND MARKOV PROJECTIONS TO 2040 (opens in a new tab)

  19. ANALYTICAL MODELS FOR COUNTERFIRE WARFARE OF FIELD ARTILLERY

    … artillery using stochastic duels. We develop discrete-time Markov chain and continuous-time Markov chain models and apply them to study the effect of defensive and offensive scooting on the outcome of the exchange under various operational assumptions. The models, and the analyses they …

    nps Repository record for ANALYTICAL MODELS FOR COUNTERFIRE WARFARE OF FIELD ARTILLERY (opens in a new tab)

  20. Performance Prediction for Hub-Based Swarms

    … swarm behavior, primarily to predict the time-to-converge (TTC) and success probability. First, we use a bipartite model for the distributed best-of-N problem, and show how the model can be represented as a Discrete Time Markov Chain (DTMC). Second, we analyze useful theoretical properties …

    byu Repository record for Performance Prediction for Hub-Based Swarms (opens in a new tab) Download PDF for Performance Prediction for Hub-Based Swarms (opens in a new tab)

Page 1 of 3