Simulation of Markovian models using Bootstrap method
|
|
- Magnus Ross
- 5 years ago
- Views:
Transcription
1 Simulation of Markovian models using Bootstrap method Ricardo M Czekster, Paulo Fernandes, Afonso Sales, Dione Taschetto and Thais Webber Faculdade de Informática Pontifícia Universidade Católica do Rio Grande do Sul AvIpiranga,6681,Prédio PortoAlegre RS Brasil {ricardoczekster, paulofernandes, afonsosales, dionetaschetto, thaiswebber}@pucrsbr Keywords: Markovian models, Discrete event simulation, Bootstrap method Abstract Simulation is an interesting alternative to solve Markovian models However, when compared to analytical and numerical solutions it suffers from a lack of precision in the results due to the very nature of simulation, which is the choice of samples through pseudorandom generation This paper proposes a different way to simulate Markovian models by using a Bootstrap-based statistical method to minimize the effect of sample choices The effectiveness of the proposed method, called Bootstrap simulation, is compared to the numerical solution results for a set of examples described using Stochastic Automata Networks modeling formalism 1 INTRODUCTION Modeling formalisms are usually employed to describe real systems, capturing their behavior An example of a wellknown modeling formalism used for such purpose is Markov Chains(MC) [20] MC models use simple primitives such as states and labeled transitions to exemplify system s evolution and operational semantics Besides Computer Science abundant applications, Markov modeling examples are present in bioinformatics, economics, engineering and chemistry, to nameafewdomains[20] However,themajorlimitationofMCisthestate spaceexplosion problem, observed when the amount of possible configurations is massively huge, rendering solution intractable and easily depleting computational resources [20] In order to mitigate this problem, structured formalisms are proposed such as Stochastic Automata Networks (SAN) [9], Generalized Stochastic Petri Nets [6] or Stochastic Process Algebras (for example, Extended Markovian Process Algebra [3] or Performance Evaluation Process Algebra [12]), among several other approaches Every structured formalism has a correspondent underlying MC and, in a particular way, SAN presents an inner representation based on tensor operations, producing a highly memory efficient fashion to map its underlying transition system SAN also enables complex modeling due to sophisticated primitives (such as events) to define the firing of transitions, locally or synchronously, through constant or functional rates(rates dependent on the other component states) Beyond model mapping, its numerical solution plays an equally important role when examining complex systems There are distinct ways to solve any given model, eg, using numerical methods or simulation Numerical methods often rely on iterative mathematical techniques such as the Power Method [20], Arnoldi [1] or GMRES [16] to calculate measures of interest On the other hand, simulation techniques consider the model events, firing transitions according to pseudorandom numbers generation Simulation precision is strongly related to the number of samples that are produced Normally, a simulation study comprehends large amounts of time in order to obtain significant performance indices, usuallyin functionofthemodelstatespace size Although numerical solution produces reliable results, it is bounded by the number of states of the model Current numerical methods are directed to research on the acceleration of iterative methods[9] However, methods based on Perfect Samplings for SAN have been used with satisfactory results, generating unbiased samples [10] Another alternative is to use pure traditional simulation methods for Markovian models[11] Such methods are based on simulating sets of trajectories and counting the amount of visits for each state, where every step produces a sample(saved for further analysis) When using traditional simulation methods one must be concerned about result quality, ie, precision Since every simulation trajectory only approximates the numerical solution, a thoroughly data inspection must be conducted, verifying results and searching for imprecise results Succinctly, traditional simulation starts from an arbitrarily chosen initial state and randomly walks on a predefined state space during a fixed quantity of steps(trajectory length) Ideal length for a trajectory can be estimated using confidence intervals, among other approaches Since every visited state generates a sample, dividing the number of times a state has been visited by the trajectory length gives an approximation of the mean permanence probability for each state Bootstrap methods were firstly proposed by Efron [8] to perform estimations applied to different areas (for instance, machine learning algorithms[2]) The main idea is to reduce the noise that were observedfrom the samples In the context of simulation, this noise corresponds to the noticed error in relation to the numerical solution The method consists on resamplings, where each sample maps not only one state (the common approach in the traditional simulation) but a set of
2 states In comparison, these sets of results, in average, are betterthantheaverageofasinglesampling Our aim in this work is to employ Bootstrap methods as a valid alternative to the solution of Markovian models by controlling the precision when producing large sets of samples We focus our attention on proposing a method, called Bootstrap simulation, compared against a traditional simulation in order to measure the corresponding error of both methods The remainder of this paper is presented as follows We show basic modeling concepts based on Markov Chains and SAN, followed by principles of simulation in Section 2 We discuss Bootstrap method and how it can be applied in the context of Markovian simulation in Section 3 We present the main results and comparisons with traditional simulation in Section 4 Finally, the conclusion draws some final considerations and future works 2 MARKOVIAN MODEL SIMULATION Markovian modeling are commonly used to describe complex system interactions using mathematical methods for solving the linear system of equations The results produce quantitative performance indices used to subject models for analysis and interpretation These performance indices normally signalize bottlenecks and configurations where the system will degradeor malfunction [7, 4, 18] A common modeling formalism is Markov Chains[20], used for system modeling through simple primitives such as a set of states S and transitions among states The transitions can be modeled by stochastic processes that vary according to a Continuous Time Markov Chains(CTMC) or Discrete Time Markov Chains (DTMC) mapping, respectively, exponential or geometric probability distributions A DTMC is represented by a probability matrix P, where every row i and column j indicate the probability to change from state i to j, where the matrix dimension corresponds to the total number of model states S, ie, the cardinality of S given by S The matrix is mapped to a linear system of equations for solution purposes, ie, the determination of the permanence probability of every state, solving πp = π For CTMC, instead of a probability matrix, a transition matrix, called infinitesimal generator Q [20], represents the MC In an infinitesimal generator all non-diagonal elements i, j represent the occurrence rate of a transition from state i to state j,andthediagonalelementsaresetwithnegativevaluestolet thesumofeveryrowequaltozeroinordertosolveactmc it is common to discretize (or uniformize) the infinitesimal generator Q to its analogous DTMC version[20], obtaining a probability matrix P When a MC model has a huge set of states S, usually, a larger amount of memory is needed to store the transition system Q and, consequently, P as well This problem, known as state space explosion, is always on evidence in Markovian models and more compositional approaches have been defined throughout the years to mitigate the hazardous effects present on massively sized models Among other structured formalisms, Stochastic Automata Networks(SAN)[15] are based on MC and use a high-level description language to build modular systems in a memory efficient manner due mainly to a tensor representation of Q instead of the full transition matrix storage [9] The main idea behind SAN is to model any reality with several subsystems, or automata, acting independently and, occasionally, synchronizing activities Each automaton has a set of states with local transitions and/or synchronizing events having constant or functional rates associated To compose the model state space, one must combine all local states from all automata, forming the model global states, ie, the Product State Space (PSS) However, when performing this combination, depending on initial states and the model transitions, only a possible set of states can be valid (reached), defining thus the Reachable State Space(RSS) of the model In order to inspect the performance indices for the models, Vector-Descriptor Product methods are usually used to multiply the probability vector π by the tensor representation of Q, named the Markovian Descriptor The operation is currently bounded by the available memory needed to entirely store the probability vector For example, in a 4GB machine, the maximumnumberforthepssisset to 65millionofstates Recent efforts are based on solution approximations, particularly based on simulation of the underlying MC as a valid option to handle massive state spaces [13, 19] Simulation methods, among many other advantages, are extremely useful to easily manipulate the components of Markovian models and use the probability vector to estimate reliable performance indices for huge state spaces Obviously, the number of collected samples should be large enough for a comprehensive statistical analysis, eg, the chosen amount should estimate according to the RSS size and the overall variance of the model in order to deliver the desired confidence interval Due to the fact that simulation only produces samples belonging to the reachable set RSS, simulation approaches can potentially produce interesting results within memory bounds In SAN, a probability vector of size RSS stores the number of occurrences of each reachable state within S = {,,,s r } and a stochastic matrix P maps transition probabilities P ij for any given row i and column j The simulation method needs a pseudorandom generation function U uniformly distributed in (01)[11] Every transition between two states occurs according to a transition function given by φ(s i,u),dictatinghowtherandomwalkingtakesplaceforthe set of valid states defined by the SAN model We are interested in defining an initial state and randomly visit the model states, generating a valid trajectory The transition function φ is generically described by the following expression:
3 φ(s i,u) = s j foru [0, P i0 ) foru [P i0, P i0 +P i1 ) s r foru [ j 1 P il, l=0 j l=0 [ ] r 1 foru P ir, 1 l=0 P il ) 3 BOOTSTRAP SIMULATION Bootstrap method is relevant in statistics to derive estimations about standard deviations for complex distributions In essence, this method works with previously unknown data pertaining an infinite sized population Λ and discovers the distribution in random samplings Λ of size n (extracted from this population, ie, Λ Λ) [14] Intuitively, the n samples obtained from the observations of the infinite population Λ, each one with probability 1 n, are used to model the unknown population as real as possible ThesetofvaluesofanewsampleK,alsohavingsizeequal to n ( K = Λ ) is exclusively obtained from the first sample Λ without generating new values for the population Λ, as showed by Figure 1 The main feature of the Bootstrap method is to sample with replacement, ie, the values that constitutes the sample could be repeated during the process To exemplify this method, lets consider the problem of finding the average height of the whole world population Since it is impractical to measure every individual within the available population(set Λ), only a subset of this population should be taken (subset Λ) Using Λ, a quantity of z resamplings must be performed, corresponding to the number of bootstraps as demonstrated by Figure 1, where K i = {x K i x Λ} and i [1z] Each bootstrap K i has a set of n values obtained from Λ through pseudorandom samplings that could repeat or not the values (ie, x 1 K i,x 2 K i x 1 = x 2 ) The mean x K, or the average population height, is calculated using the averages x K1, x K2,, x Kz ofeverybootstrap Λ K 1 K 2 K z x Λ x K Figure 1 Bootstrap method illustration Λ x K1 x K2 x Kz (1) The objective of Bootstrap method is to generate more precisevaluesfortheaverage x K thantheaverage x Λ Moreover, as the number of bootstraps is increased, it reduces the effects of bias samples(noise), generally associated with pseudorandom generators The adaptation of the method to be used in Markovian simulation concerns the transition function φ As mentioned before, a uniformly distributed sample is generated between 0 and 1 and the transition function φ(s i,u) is applied to determine the next state to be visited, forming a simulation trajectory that maps the Λ sample Figure 2 illustrates the Bootstrap simulation schema, where each visited state produces pseudorandom samplings that definethestatesaccountedineverybootstrapkthenumberof trials is equal to the amount of present values in Λ, which is equivalenttothetrajectorylength(n)inthisfigure,t b (where b [1z]) represents n samplings for each bootstrap K Thus, n z samplings take place for every trajectory step, comparing each pseudorandom value against an arbitrarily chosen constant value α between 0 and n 1 If the pseudorandom generated value is equal to α, the state is accounted in the correspondent bootstrap K This procedure is repeated for all bootstraps until a predefined trajectory length n is reached Figure 2 also shows that represents this execution When the trajectory is finished, the probability vector π contains the permanence probabilities of model states However, it is computationally too expensive to randomly generate n samples for every trajectory step Since the number of times each step will actually be randomly sampled is verylikelyto bemuchsmallerthann,wepropose,insteadof generating n samples for each bootstrap, only execute n trials, where n ntoevaluatetheimpactofreducingthisnumber of trials, fromn to n, we calculated the probabilityof a same value to be sampled more than n times duringn trials If this probability is negligible, it means that the number of samples nissufficienttocomputesuchavalue,weobservethat: Probability of a given number to appear at themost n times = n i=0 [ (1 ) i ( ) ] n 1 n i (2) n n Hence, simplifying (2) and considering its complement, ie, the probability of having more than n becomes: Probability of a given number appear more than n times [ n =1 i=0 (n 1) n i ] Forexample,assuming n =15andn=10 4,theprobability to obtain a same value more than 15 times with n samples is inferiorto10 16 Algorithm 1 presents the application of the Bootstrap in the context of Markovian simulation In this algorithm, variables and vectors used in the method are initialized between lines n n (3)
4 Initial state States U =008 K 1 x 1 x 2 x z π 0 π 1 π 2 π x 1[0] + x 2[0] + + x z[0] z x 1[1] + x 2[1] + + x z[1] z x 1[2] + x 2[2] + + x z[2] z U =087 where: Figure 2 Bootstrap simulation schema K 2 and U =032 U =006 U =056 K z P = = T U 1(0 n 1) U n(0 n 1) T z U 1(0 n 1) U n(0 n 1) Time Transition Matrix 1 and 4 The samples countedin the bootstrapsfor all trajectories of length n are shown from line 6 to line 16 Between line7 and 25, it is calculated the permanence probabilities ofstates foreach bootstrapforthe rest part ofthe algorithm (line6-31), the average probabilities of every state in vector π are adjusted according the information contained in the bootstraps n 4 NUMERICAL ANALYSIS The numerical analysis of Bootstrap simulation method is conducted using three SAN models with different characteristics [17, 7, 4], such as: Alternate Service Patterns (ASP), First Available Server (FAS) and Resource Sharing(RS) ASP model describes an Open Queueing Network [20] with servers that map different service patterns It has four queues represented by four automata, where its PSS is equal to (K +1) 4 P, K is the queues capacity and P the number of service patterns All states of this model are reachable FAS model indicates the availability of N servers, where every server is composed of a two state automaton, representing the two possible server conditions: available or busy In the model,tasks are firstly assigned to the first server, case it is available If the server is busy, the task must be sent to the second server and so on The first available server processes the task All states in this model are reachable and its PSS is equalto2 N Theclassical RS modelmapsrsharedresourcesto P processes Each process is represented by an automaton with two states: idle or busy The number of available resources is represented by an automaton that counts the number of resources being used The PSS for this model is equal to 2 P (R+1) and, due to the nature of the model transitions, not all states are reachable The parameters for these models adopted in this paper experiments are the following: ASP model - every queue with capacity two (K = 2) and two service patterns (P = 2); FAS model - with nine servers (N = 9); and RS model - with 10 processes(p =10)andfiveresources(R =5) Algorithm 1 Bootstrap simulation method 1: α U(0 n 1) { constant value α initialization with a pseudorandom value chosen between 0 and n 1 } 2: π 0 { initialization ofthe probability vector π } 3: K 0 { initialization ofall zbootstraps K } 4: s c { sets c as initial state } 5: { walk on a trajectory of length n } 6: fort =1tondo 7: s d φ(s c,u(01)) { finds destination state s d from s c according tou(01) } 8: for b =1tozdo 9: for c =1to ndo 10: if (U(0 n 1) == α) then 11: K b [s d ] K b [s d ]+1 {countsink b [s d ]everytimethesample equals to α } 12: end if 13: end for 14: end for 15: s c s d { currentstate s c is updated to s d } 16: endfor 17: for b =1tozdo 18: ω 0 19: for i =1to RSS do 20: ω ω+k b [i] { calculates in ω the total sum of accumulated values in K b } 21: end for 22: for i =1to RSS do 23: x b [i] K b[i] ω { calculates the probability ofi-th state in K b } 24: end for 25: endfor 26: for i =1to RSS do 27: for b =1tozdo 28: π[i] π[i]+ x b [i] 29: end for 30: π[i] π[i] z {calculates the average probability from the bootstraps} 31: endfor
5 Relative error Relative error Relative error (a) ASP model Trajectory length(n) Mean(Trad) Mean(Boot) Maximum(Trad) Maximum(Boot) (b) FAS model Trajectory length(n) Mean(Trad) Mean(Boot) Maximum(Trad) Maximum(Boot) (c)rs model Trajectory length(n) Mean(Trad) Mean(Boot) Maximum(Trad) Maximum(Boot) Figure 3 Traditional and Bootstrap simulation results The results obtained from traditional simulation are compared to the Bootstrap simulation, where the mean relative error is used to compare the approximate solution to the numerical solution produced by the SAN models solver[5] The main simulation results are presented in Figure 3 showing 95% confidence intervals for 50 executions, where the x-axis corresponds to the trajectory length and the y-axis indicates the relative error The dotted lines represent the maximum relative error and the bars indicate the mean relative error ASP model - Figure 3 (a) - presents the best precision results for the Bootstrap simulation, since the mean relative error is reduced for the set of tested trajectory lengths For the last tested trajectory (10 9 ), the mean relative error i0061 in traditional simulation and plummets to when the Bootstrap simulation is employed Comparing the results for FAS model- Figure3(b)-we also observedasignificant reduction in the mean relative error for Bootstrap when the trajectorylengthexceeds10 6 RSmodel-Figure3(c)-presents similar results for Bootstrap and traditional simulation (for instance,whenthetrajectorylengthisequalto10 9,themean relative error in traditional simulation i0010, whereas in Bootstrap the error i0011) However, even not presenting significant precision gains, the mean relative error is very low In simulation, the quantity of samples is a direct indication of the solution approximation quality, ie, the precision In the context of this paper, the measure of quality used is the simulation mean relative error that decreases, sometimes dramatically, as the trajectory length is increased Figure 3 shows that using the Bootstrap simulation is possible to generate samples that greatly approximate the numerical solution, when compared to the traditional simulation approaches, consideringtrajectorylengthsgreaterthan10 7 Fortheworst case(rsmodel)presentedinthiswork,weobtainedthesame precision of traditional simulation, which is a clear indication that our proposed method could be applied to greater models without significantly impairing precision 5 CONCLUSION The main contribution of this paper is the proposition of the Bootstrap method usage adapted for a Markovian simulation context Research on such algorithmic adaptation is extremely important when analytical modeling fails to produce relevant performance indices Simulation, for these cases, emerges as a valid alternative to deliver analysis of huge models, allowing result interpretations and helping decision making process as a whole Our aim is to present the Bootstrap simulation and inspect the mean relative error when compared to traditional simulation Our results produce evidence that Bootstrap simulation method has the potential to reduce the observed noise related to sampling from large state spaces This fact was detectedfortrajectorylengthsgreaterthan10 6 fortheavailable models However, more experiments must be done to validate such findings and report the classes of models that are more suitable for Bootstrap utilization In regards of the traditional simulation, trajectory length plays a relevant role in terms of the associated error We observed that small trajectory lengths induce high error levels, which is interesting only for executions requiring few precision Future works are directed to the following studies:(i) models classification - determination of classes of models more suitable for Bootstrap simulation; (ii) method parallelization and distribution - we shall take advantage from the fact that every sample is independent, so the computation can be con-
6 ducted separately for each model, improving the overall quality of samples for further analysis; and (iii) rare events - we plan to study the impact of Bootstrap in concealing (or not) rare events and its influence on precision of results The work in progress herein described clearly indicates that further research efforts must be done to increase the understanding in regard to state-based systems simulation applied with different statistical methods However, the preliminary results reveal that Bootstrap simulation is a worthy subject of research ACKNOWLEDGMENTS This work is funded by Petrobras ( ) Afonso Sales receives grants from CAPES-Brazil(02388/09-0) Paulo Fernandes is also funded by CNPq-Brazil (307272/2007-9) The authors thank Prof João Batista de Oliveira for the helpful discussion on this paper subject REFERENCES [1] W E Arnoldi The principle of minimized iterations in the solution of the matrix eigenvalue problem Quarterly of Applied Mathematics, 9:17 29, 1951 [2] E Bauer and R Kohavi An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants Machine Learning, 36(1-2): , 1999 [3] MBernardoandRGorrieriAtutorialonEMPA:atheory of concurrent processes with nondeterminism, priorities, probabilities and time Theoretical Computer Science, 202(1-2):1 54, 1998 [4] C Bertolini, L Brenner, P Fernandes, A Sales, and A F Zorzo Structured Stochastic Modeling of Fault-Tolerant Systems In International Symposium on Modelling, Analysis and Simulation on Computer and Telecommunication Systems(MASCOTS 04), pages , Volendam, The Netherlands, October 2004 [5] L Brenner, P Fernandes, B Plateau, and I Sbeity PEPS Stochastic Automata Networks Software Tool In International Conference on the Quantitative Evaluation of Systems (QEST 07), page63 164, Edinburgh, UK, 2007 IEEE Press [6] S Donatelli Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space Performance Evaluation (PEVA), 18(1):21 36, 1993 [7] F L Dotti, P Fernandes, A Sales, and O M Santos Modular Analytical Performance Models for Ad Hoc Wireless Networks In International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 05), page64 173, Trentino, Italy, April 2005 [8] B Efron Bootstrap Methods: Another Look at the Jackknife The Annals of Statistics, 7(1):1 26, 1979 [9] P Fernandes, B Plateau, and W J Stewart Efficient descriptor-vector multiplication in Stochastic Automata Networks Journal of the ACM(JACM), 45(3): , 1998 [10] P Fernandes, J M Vincent, and T Webber Perfect Simulation of Stochastic Automata Networks In International Conference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA 08), volume 5055 of LNCS, page49 263, 2008 [11] O Häggström Finite Markov Chains and Algorithmic Applications Cambridge University Press, 2002 [12] J Hillston A compositional approach to performance modelling Cambridge University Press, USA, 1996 [13] A M Law and D W Kelton Simulation Modeling and Analysis McGraw-Hill Higher Education, 2000 [14] B F J Manly Randomization, Bootstrap and Monte Carlo Methods in Biology Chapman& Hall/CRC, second edition, 1997 [15] B Plateau On the stochastic structure of parallelism and synchronization models for distributed algorithms In Proceedings of the 1985 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems, page47 154, Austin, Texas, 1985 ACM Press [16] Y Saad and M H Schultz GMRES: A Generalized Minimal RESidual Algorithm for Solving Nonsymmetric Linear Systems SIAM Journal on Scientific and Statistical Computing, 7(3): , 1986 [17] A Sales and B Plateau Reachable state space generation for structured models which use functional transitions In International Conference on the Quantitative Evaluation of Systems (QEST 09), page69 278, Budapest, Hungary, September 2009 [18] K Sayre Improved techniques for software testing based on Markov chain usage models PhD thesis, University of Tennessee, Knoxville, USA, 1999 [19] R E Shannon Introduction to the art and science of simulation In Conference on Winter Simulation (WSC 98), pages 7 14, Los Alamitos, USA, 1998 [20] W J Stewart Probability, Markov Chains, Queues, and Simulation Princeton University Press, USA, 2009
The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations
The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations Leonardo Brenner, Paulo Fernandes, and Afonso Sales PUCRS, Av Ipiranga, 6681-90619-900 - Porto Alegre,
More informationMQNA - Markovian Queueing Networks Analyser
MQNA - Markovian Queueing Networks Analyser Leonardo Brenner Paulo Fernandes Afonso Sales PUCRS, Brazil PUCRS, Brazil PUCRS, Brazil lbrenner@inf.pucrs.br paulof@inf.pucrs.br asales@inf.pucrs.br Abstract
More informationMQNA - Markovian Queueing Networks Analyser
FACULDADE DE INFORMÁTICA PUCRS - Brazil http://www.pucrs.br/inf/pos/ MQNA - Markovian Queueing Networks Analyser L. Brenner, P. Fernandes, A. Sales Technical Report Series Number 030 September, 2003 Contact:
More informationComposition of product-form Generalized Stochastic Petri Nets: a modular approach
Composition of product-form Generalized Stochastic Petri Nets: a modular approach Università Ca Foscari di Venezia Dipartimento di Informatica Italy October 2009 Markov process: steady state analysis Problems
More informationPhase-Type Distributions in Stochastic Automata Networks
Phase-Type Distributions in Stochastic Automata Networks I. Sbeity (), L. Brenner (), B. Plateau () and W.J. Stewart (2) April 2, 2007 () Informatique et Distribution - 5, Av. Jean Kuntzman, 38330 Montbonnot,
More informationFrom Stochastic Processes to Stochastic Petri Nets
From Stochastic Processes to Stochastic Petri Nets Serge Haddad LSV CNRS & ENS Cachan & INRIA Saclay Advanced Course on Petri Nets, the 16th September 2010, Rostock 1 Stochastic Processes and Markov Chains
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationIntroduction Probabilistic Programming ProPPA Inference Results Conclusions. Embedding Machine Learning in Stochastic Process Algebra.
Embedding Machine Learning in Stochastic Process Algebra Jane Hillston Joint work with Anastasis Georgoulas and Guido Sanguinetti, School of Informatics, University of Edinburgh 16th August 2017 quan col....
More informationOn the benefits of using functional transitions and Kronecker algebra
Performance Evaluation 58 (2004) 367 390 On the benefits of using functional transitions and Kronecker algebra Anne Benoit a,, Paulo Fernandes b, Brigitte Plateau a, William J. Stewart c a IMAG-ID, 51
More informationECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains
ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 4: Discrete-Time Markov Chains September 1, 215 Dr. Itamar Arel College of Engineering Department of Electrical Engineering & Computer
More informationProxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
Electronic Notes in Theoretical Computer Science Vol. 85 No. 4 (2003) URL: http://www.elsevier.nl/locate/entsc/volume85.html Proxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationVarieties of Stochastic Calculi
Research is what I'm doing when I don't know what I'm doing. Wernher Von Braun. Artificial Biochemistry Varieties of Stochastic Calculi Microsoft Research Trento, 26-5-22..26 www.luca.demon.co.uk/artificialbiochemistry.htm
More informationStochastic Petri Net
Stochastic Petri Net Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2013, June 24th 2013 1 Stochastic Petri Net 2 Markov Chain 3 Markovian Stochastic Petri Net 4 Generalized
More informationPopulation models from PEPA descriptions
Population models from PEPA descriptions Jane Hillston LFCS, The University of Edinburgh, Edinburgh EH9 3JZ, Scotland. Email: jeh@inf.ed.ac.uk 1 Introduction Stochastic process algebras (e.g. PEPA [10],
More informationBias-Variance Error Bounds for Temporal Difference Updates
Bias-Variance Bounds for Temporal Difference Updates Michael Kearns AT&T Labs mkearns@research.att.com Satinder Singh AT&T Labs baveja@research.att.com Abstract We give the first rigorous upper bounds
More informationIEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2011, Professor Whitt Class Lecture Notes: Tuesday, March 1.
IEOR 46: Introduction to Operations Research: Stochastic Models Spring, Professor Whitt Class Lecture Notes: Tuesday, March. Continuous-Time Markov Chains, Ross Chapter 6 Problems for Discussion and Solutions.
More informationAN INTRODUCTION TO DISCRETE-EVENT SIMULATION
AN INTRODUCTION TO DISCRETE-EVENT SIMULATION Peter W. Glynn 1 Peter J. Haas 2 1 Dept. of Management Science and Engineering Stanford University 2 IBM Almaden Research Center San Jose, CA CAVEAT: WE ARE
More informationRandomized Algorithms
Randomized Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours
More informationAgreement algorithms for synchronization of clocks in nodes of stochastic networks
UDC 519.248: 62 192 Agreement algorithms for synchronization of clocks in nodes of stochastic networks L. Manita, A. Manita National Research University Higher School of Economics, Moscow Institute of
More information14 Random Variables and Simulation
14 Random Variables and Simulation In this lecture note we consider the relationship between random variables and simulation models. Random variables play two important roles in simulation models. We assume
More informationStochastic Petri Nets. Jonatan Lindén. Modelling SPN GSPN. Performance measures. Almost none of the theory. December 8, 2010
Stochastic Almost none of the theory December 8, 2010 Outline 1 2 Introduction A Petri net (PN) is something like a generalized automata. A Stochastic Petri Net () a stochastic extension to Petri nets,
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationA general algorithm to compute the steady-state solution of product-form cooperating Markov chains
A general algorithm to compute the steady-state solution of product-form cooperating Markov chains Università Ca Foscari di Venezia Dipartimento di Informatica Italy 2009 Presentation outline 1 Product-form
More informationADVANCED ROBOTICS. PLAN REPRESENTATION Generalized Stochastic Petri nets and Markov Decision Processes
ADVANCED ROBOTICS PLAN REPRESENTATION Generalized Stochastic Petri nets and Markov Decision Processes Pedro U. Lima Instituto Superior Técnico/Instituto de Sistemas e Robótica September 2009 Reviewed April
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More informationA REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS
A REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS Francesco Basile, Ciro Carbone, Pasquale Chiacchio Dipartimento di Ingegneria Elettrica e dell Informazione, Università
More informationA comment on Boucherie product-form results
A comment on Boucherie product-form results Andrea Marin Dipartimento di Informatica Università Ca Foscari di Venezia Via Torino 155, 30172 Venezia Mestre, Italy {balsamo,marin}@dsi.unive.it Abstract.
More informationCSE 417T: Introduction to Machine Learning. Final Review. Henry Chai 12/4/18
CSE 417T: Introduction to Machine Learning Final Review Henry Chai 12/4/18 Overfitting Overfitting is fitting the training data more than is warranted Fitting noise rather than signal 2 Estimating! "#$
More informationSpecification models and their analysis Petri Nets
Specification models and their analysis Petri Nets Kai Lampka December 10, 2010 1 30 Part I Petri Nets Basics Petri Nets Introduction A Petri Net (PN) is a weighted(?), bipartite(?) digraph(?) invented
More informationData Mining und Maschinelles Lernen
Data Mining und Maschinelles Lernen Ensemble Methods Bias-Variance Trade-off Basic Idea of Ensembles Bagging Basic Algorithm Bagging with Costs Randomization Random Forests Boosting Stacking Error-Correcting
More informationStochastic Simulation.
Stochastic Simulation. (and Gillespie s algorithm) Alberto Policriti Dipartimento di Matematica e Informatica Istituto di Genomica Applicata A. Policriti Stochastic Simulation 1/20 Quote of the day D.T.
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
More informationStochastic Petri Net. Ben, Yue (Cindy) 2013/05/08
Stochastic Petri Net 2013/05/08 2 To study a formal model (personal view) Definition (and maybe history) Brief family tree: the branches and extensions Advantages and disadvantages for each Applications
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationHeuristic Search Algorithms
CHAPTER 4 Heuristic Search Algorithms 59 4.1 HEURISTIC SEARCH AND SSP MDPS The methods we explored in the previous chapter have a serious practical drawback the amount of memory they require is proportional
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationLecture 3: Policy Evaluation Without Knowing How the World Works / Model Free Policy Evaluation
Lecture 3: Policy Evaluation Without Knowing How the World Works / Model Free Policy Evaluation CS234: RL Emma Brunskill Winter 2018 Material builds on structure from David SIlver s Lecture 4: Model-Free
More informationConfidence Estimation Methods for Neural Networks: A Practical Comparison
, 6-8 000, Confidence Estimation Methods for : A Practical Comparison G. Papadopoulos, P.J. Edwards, A.F. Murray Department of Electronics and Electrical Engineering, University of Edinburgh Abstract.
More informationMulti-State Availability Modeling in Practice
Multi-State Availability Modeling in Practice Kishor S. Trivedi, Dong Seong Kim, Xiaoyan Yin Depart ment of Electrical and Computer Engineering, Duke University, Durham, NC 27708 USA kst@ee.duke.edu, {dk76,
More informationBrief introduction to Markov Chain Monte Carlo
Brief introduction to Department of Probability and Mathematical Statistics seminar Stochastic modeling in economics and finance November 7, 2011 Brief introduction to Content 1 and motivation Classical
More informationA Structured Stochastic Model for Prediction of Geological Stratal Stacking Patterns
Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 296 (2013) 27 42 www.elsevier.com/locate/entcs A Structured Stochastic Model for Prediction of Geological Stratal
More informationLearning Methods for Linear Detectors
Intelligent Systems: Reasoning and Recognition James L. Crowley ENSIMAG 2 / MoSIG M1 Second Semester 2011/2012 Lesson 20 27 April 2012 Contents Learning Methods for Linear Detectors Learning Linear Detectors...2
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationring structure Abstract Optical Grid networks allow many computing sites to share their resources by connecting
Markovian approximations for a grid computing network with a ring structure J. F. Pérez and B. Van Houdt Performance Analysis of Telecommunication Systems Research Group, Department of Mathematics and
More informationA tool for the numerical solution of cooperating Markov chains in product-form
HET-NETs 2010 ISBN XXX XXX pp. xx xx A tool for the numerical solution of cooperating Markov chains in product-form SIMONETTA BALSAMO GIAN-LUCA DEI ROSSI ANDREA MARIN a a Università Ca Foscari di Venezia
More informationBagging. Ryan Tibshirani Data Mining: / April Optional reading: ISL 8.2, ESL 8.7
Bagging Ryan Tibshirani Data Mining: 36-462/36-662 April 23 2013 Optional reading: ISL 8.2, ESL 8.7 1 Reminder: classification trees Our task is to predict the class label y {1,... K} given a feature vector
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationSafety and Reliability of Embedded Systems. (Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues
(Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues Content What are Events? Examples for Problematic Event Semantics Inhibit, Enabler / Conditioning
More informationFinal Overview. Introduction to ML. Marek Petrik 4/25/2017
Final Overview Introduction to ML Marek Petrik 4/25/2017 This Course: Introduction to Machine Learning Build a foundation for practice and research in ML Basic machine learning concepts: max likelihood,
More informationA Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy Nir Halman Hebrew University of Jerusalem halman@huji.ac.il July 3, 2016 Abstract Given n elements
More informationUsing Gaussian Processes for Variance Reduction in Policy Gradient Algorithms *
Proceedings of the 8 th International Conference on Applied Informatics Eger, Hungary, January 27 30, 2010. Vol. 1. pp. 87 94. Using Gaussian Processes for Variance Reduction in Policy Gradient Algorithms
More informationApplications of Randomized Methods for Decomposing and Simulating from Large Covariance Matrices
Applications of Randomized Methods for Decomposing and Simulating from Large Covariance Matrices Vahid Dehdari and Clayton V. Deutsch Geostatistical modeling involves many variables and many locations.
More informationThe Discrete EVent System specification (DEVS) formalism
The Discrete EVent System specification (DEVS) formalism Hans Vangheluwe The DEVS formalism was conceived by Zeigler [Zei84a, Zei84b] to provide a rigourous common basis for discrete-event modelling and
More informationBalancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm
Balancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 2778 mgl@cs.duke.edu
More informationComputer Simulation and Applications in Life Sciences. Dr. Michael Emmerich & Dr. Andre Deutz LIACS
Computer Simulation and Applications in Life Sciences Dr. Michael Emmerich & Dr. Andre Deutz LIACS Part 0: Course Preliminaries Course Preliminaries The course consists of 13 lectures + exercises Exercises
More informationThis is a repository copy of Improving the associative rule chaining architecture.
This is a repository copy of Improving the associative rule chaining architecture. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/75674/ Version: Accepted Version Book Section:
More informationApproximate Counting and Markov Chain Monte Carlo
Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi March 18, 2011 April 8, 2011 Arindam
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationExtending the Associative Rule Chaining Architecture for Multiple Arity Rules
Extending the Associative Rule Chaining Architecture for Multiple Arity Rules Nathan Burles, James Austin, and Simon O Keefe Advanced Computer Architectures Group Department of Computer Science University
More informationIndustrial Automation (Automação de Processos Industriais)
Industrial Automation (Automação de Processos Industriais) Discrete Event Systems http://users.isr.ist.utl.pt/~jag/courses/api1516/api1516.html Slides 2010/2011 Prof. Paulo Jorge Oliveira Rev. 2011-2015
More informationIn biological terms, memory refers to the ability of neural systems to store activity patterns and later recall them when required.
In biological terms, memory refers to the ability of neural systems to store activity patterns and later recall them when required. In humans, association is known to be a prominent feature of memory.
More informationAn Adaptive Clustering Method for Model-free Reinforcement Learning
An Adaptive Clustering Method for Model-free Reinforcement Learning Andreas Matt and Georg Regensburger Institute of Mathematics University of Innsbruck, Austria {andreas.matt, georg.regensburger}@uibk.ac.at
More informationOn the Sample Complexity of Noise-Tolerant Learning
On the Sample Complexity of Noise-Tolerant Learning Javed A. Aslam Department of Computer Science Dartmouth College Hanover, NH 03755 Scott E. Decatur Laboratory for Computer Science Massachusetts Institute
More informationHidden Markov Models Part 1: Introduction
Hidden Markov Models Part 1: Introduction CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 Modeling Sequential Data Suppose that
More informationMarkov Chains Handout for Stat 110
Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of
More informationAlgorithm-Independent Learning Issues
Algorithm-Independent Learning Issues Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2007 c 2007, Selim Aksoy Introduction We have seen many learning
More informationAutomatic Differentiation Equipped Variable Elimination for Sensitivity Analysis on Probabilistic Inference Queries
Automatic Differentiation Equipped Variable Elimination for Sensitivity Analysis on Probabilistic Inference Queries Anonymous Author(s) Affiliation Address email Abstract 1 2 3 4 5 6 7 8 9 10 11 12 Probabilistic
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationA Compositional Approach to Bisimulation of Arenas of Finite State Machines
A Compositional Approach to Bisimulation of Arenas of Finite State Machines Giordano Pola, Maria D. Di Benedetto and Elena De Santis Department of Electrical and Information Engineering, Center of Excellence
More informationMonte Carlo Simulation for Reliability Analysis of Emergency and Standby Power Systems
Monte Carlo Simulation for Reliability Analysis of Emergency and Standby Power Systems Chanan Singh, Fellow, IEEE Joydeep Mitra, Student Member, IEEE Department of Electrical Engineering Texas A & M University
More informationLearning in Zero-Sum Team Markov Games using Factored Value Functions
Learning in Zero-Sum Team Markov Games using Factored Value Functions Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 27708 mgl@cs.duke.edu Ronald Parr Department of Computer
More informationNumerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD
Mathematical Question we are interested in answering numerically How to solve the following linear system for x Ax = b? where A is an n n invertible matrix and b is vector of length n. Notation: x denote
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationDefinition and Examples of DTMCs
Definition and Examples of DTMCs Natarajan Gautam Department of Industrial and Systems Engineering Texas A&M University 235A Zachry, College Station, TX 77843-3131 Email: gautam@tamuedu Phone: 979-845-5458
More informationFailure Prognostics with Missing Data Using Extended Kalman Filter
Failure Prognostics with Missing Data Using Extended Kalman Filter Wlamir Olivares Loesch Vianna 1, and Takashi Yoneyama 2 1 EMBRAER S.A., São José dos Campos, São Paulo, 12227 901, Brazil wlamir.vianna@embraer.com.br
More informationA PATH-BASED FRAMEWORK FOR ANALYZING LARGE MARKOV MODELS VINH V. LAM DISSERTATION
2011 Vinh V. Lam A PATH-BASED FRAMEWORK FOR ANALYZING LARGE MARKOV MODELS BY VINH V. LAM DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
More informationConstructing Prediction Intervals for Random Forests
Senior Thesis in Mathematics Constructing Prediction Intervals for Random Forests Author: Benjamin Lu Advisor: Dr. Jo Hardin Submitted to Pomona College in Partial Fulfillment of the Degree of Bachelor
More informationilstd: Eligibility Traces and Convergence Analysis
ilstd: Eligibility Traces and Convergence Analysis Alborz Geramifard Michael Bowling Martin Zinkevich Richard S. Sutton Department of Computing Science University of Alberta Edmonton, Alberta {alborz,bowling,maz,sutton}@cs.ualberta.ca
More informationSummary Report: MAA Program Study Group on Computing and Computational Science
Summary Report: MAA Program Study Group on Computing and Computational Science Introduction and Themes Henry M. Walker, Grinnell College (Chair) Daniel Kaplan, Macalester College Douglas Baldwin, SUNY
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationMulti-Attribute Bayesian Optimization under Utility Uncertainty
Multi-Attribute Bayesian Optimization under Utility Uncertainty Raul Astudillo Cornell University Ithaca, NY 14853 ra598@cornell.edu Peter I. Frazier Cornell University Ithaca, NY 14853 pf98@cornell.edu
More informationStochastic models in product form: the (E)RCAT methodology
Stochastic models in product form: the (E)RCAT methodology 1 Maria Grazia Vigliotti 2 1 Dipartimento di Informatica Università Ca Foscari di Venezia 2 Department of Computing Imperial College London Second
More informationLecture 4 The stochastic ingredient
Lecture 4 The stochastic ingredient Luca Bortolussi 1 Alberto Policriti 2 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste Via Valerio 12/a, 34100 Trieste. luca@dmi.units.it
More informationAn Application of Graph Theory in Markov Chains Reliability Analysis
An Application of Graph Theory in Markov Chains Reliability Analysis Pavel SKALNY Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VSB Technical University of
More informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
More informationLearning Tetris. 1 Tetris. February 3, 2009
Learning Tetris Matt Zucker Andrew Maas February 3, 2009 1 Tetris The Tetris game has been used as a benchmark for Machine Learning tasks because its large state space (over 2 200 cell configurations are
More informationDistributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 55, NO. 9, SEPTEMBER 2010 1987 Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE Abstract
More informationData Mining: Concepts and Techniques. (3 rd ed.) Chapter 8. Chapter 8. Classification: Basic Concepts
Data Mining: Concepts and Techniques (3 rd ed.) Chapter 8 1 Chapter 8. Classification: Basic Concepts Classification: Basic Concepts Decision Tree Induction Bayes Classification Methods Rule-Based Classification
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationEE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing
EE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely 1 Abstract This collection of notes provides a
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationMARKOV PROCESSES. Valerio Di Valerio
MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some
More informationWhat You Must Remember When Processing Data Words
What You Must Remember When Processing Data Words Michael Benedikt, Clemens Ley, and Gabriele Puppis Oxford University Computing Laboratory, Park Rd, Oxford OX13QD UK Abstract. We provide a Myhill-Nerode-like
More informationBoosting & Deep Learning
Boosting & Deep Learning Ensemble Learning n So far learning methods that learn a single hypothesis, chosen form a hypothesis space that is used to make predictions n Ensemble learning à select a collection
More informationBagging During Markov Chain Monte Carlo for Smoother Predictions
Bagging During Markov Chain Monte Carlo for Smoother Predictions Herbert K. H. Lee University of California, Santa Cruz Abstract: Making good predictions from noisy data is a challenging problem. Methods
More informationSupplementary Note on Bayesian analysis
Supplementary Note on Bayesian analysis Structured variability of muscle activations supports the minimal intervention principle of motor control Francisco J. Valero-Cuevas 1,2,3, Madhusudhan Venkadesan
More informationApproximating the Partition Function by Deleting and then Correcting for Model Edges (Extended Abstract)
Approximating the Partition Function by Deleting and then Correcting for Model Edges (Extended Abstract) Arthur Choi and Adnan Darwiche Computer Science Department University of California, Los Angeles
More information