Multi-Objective Verification on MDPs. Tim Quatmann, Joost-Pieter Katoen Lehrstuhl für Informatik 2
|
|
- Vivien Doyle
- 5 years ago
- Views:
Transcription
1 Multi-Objective Verification on MDP Lehrtuhl für Informatik 2
2 Motivation Planning Under Uncertainty Scenario: Travel to the airport T a x i Travel time i uncertain... Goal: Arrive before the flight depart!!2 Multi-objective Verification of MDP
3 Motivation Traveling with Computer Scientit Model trip to airport a a Markov deciion proce (MDP) Controlable nondeterminim 0.7 Probabilitic branching Maximie probability to arrive before the flight depart Pr( 3h) Other type of cot play a role a well: Maximize Pr( 50 ) fuel, pollution, tre, waiting time, !3 Multi-objective Verification of MDP
4 Multi-objective Model Checking Analye Tradeoff Between Objective.0 Arrive within 3 hour v. Invet le than 50 Pr( 3h) T a x i Pareto Curve Pr( 50 )!4 Multi-objective Verification of MDP
5 Overview α MDP with Multiple Objective Linear Programming Approach fin() = fout() for all S / S y,α,t 0 for all,t S, α Act() Σ S-i Σα Act() Σt S+i y,α,t pi for all i {,, m} Weighted Sum Approach!5 Multi-objective Verification of MDP
6 Markov Deciion Procee (MDP) Markov deciion proce M = (S, Act, P, init) Nondeterminim Probabilitic branching Randomied Policy S reolve nondeterminim: S(π)(α) = "Probability to chooe action α when oberving finite path π" init α β Probability meaure Pr S : Pr S ( G) = "Probability to reach G under S" !6 Multi-objective Verification of MDP
7 MDP with Multiple Objective Single-objective: maximal probability Prmax( G) max S Pr S ( G) Multi-objective: tradeoff Prmax( G) v. Prmax( G2) v.... There i not a ingle policy that maximie all probabilitie init α β !7 Multi-objective Verification of MDP
8 Geometry p = (p,, pm) R m i a point in m N dimenional Euclidean pace p[i] refer to pi R Let p,q R m and λ R p q hold iff p[i] q[i] for all i {,, m} p < q hold iff p q and p q λ p (λ p[],, λ p[m]) R m (calar multiplication) p q Σ i m p[i] q[i] R (dot product) Definition: A et B R m i convex iff p,q B implie λ p + (-λ) q B for all 0 λ.!8 Multi-objective Verification of MDP
9 Achievable Point Definition: For MDP M = (S, Act, P, init) let Π, Π2,, Πm Path(M) be m meaurable et of path, and ~, ~2,, ~m {<,,, >}. A point p [0,] m R m i called achievable iff there i a (randomied) policy S.t. Pr S (Πi) ~i p[i] for all i {,, m}. We alo ay that point p i achieved by policy S A( Πi,~i m) denote the et of achievable point Example: α 0.8 α Pr( G2) A( G,, G2, ) p Pr( G)!9 Multi-objective Verification of MDP
10 Achievable Point Lemma: The et of achievable point A( Πi, ~i m) i convex. Proof (ketch): Let p, q in A( Πi, ~i m), i.e., p and q are achieved by ome policie Sp and Sq. For any λ [0,], the point λ p + (-λ) q i achieved by the randomied policy S which initially flip a coin: With probability λ, it mimic policy Sp With probability -λ, it mimic policy Sq!0 Multi-objective Verification of MDP
11 Multi-Objective Reachability For implicity, we only conider maximiing reachability probabilitie, i.e., Πi = Gi for goal-tate Gi S ~i = We imply write A( Gi m) intead of A( Gi, m) A( Gi m) i downward cloed, i.e., p A( Gi m) and p q implie q A( Gi m)! Multi-objective Verification of MDP
12 Pareto Curve Definition: Let A( Gi m) be a et of achievable point. q R m dominate p R m, iff q > p. p A( Gi m) i Pareto optimal, iff no q A( Gi m) dominate p, i.e., q A( Gi m) implie q p. P( Gi m) { p p i Pareto optimal } i the Pareto curve.!2 Multi-objective Verification of MDP
13 Multi-Objective Verification Querie Achievability Query: Given: MDP M, goal tate et G,, Gm, p R m Output: True iff p A( Gi m) Quantitative Query: Given: MDP M, goal tate et G,, Gm, p2,, pm R Output: max { p R (p, p2,, pm) A( Gi m) } Pareto Query: Given: MDP M, goal tate et G,, Gm Output: Pareto Curve P( Gi m)!3 Multi-objective Verification of MDP
14 Policy Requirement In general, we need policie with randomiation and finite memory, e.g.: α β t u (0.5, 0.5) A( {t}, {u})? Only with randomied policy S()(α) = S()(β) = 0.5 t α β u (, ) A( {t}, {u})? γ Only with finite-memory policy S(π)(α) =, if π ha not viited {t}, yet {0, otherwie!4 Multi-objective Verification of MDP
15 Goal-unfolding A policy might need to memorie which et Gi ha been reached already Idea: Encode thi information into the tate-pace. Then, poitional (randomied) policie uffice t α β u t α β u γ γ t α β u t α β u γ γ!5 Multi-objective Verification of MDP
16 Goal-unfolding A policy might need to memorie which et Gi ha been reached already Idea: Encode thi information into the tate-pace. Then, poitional (randomied) policie uffice t β α u t α β u γ γ α t β u t α β u γ γ!6 Multi-objective Verification of MDP
17 Goal-unfolding A policy might need to memorie which et Gi ha been reached already Idea: Encode thi information into the tate-pace. Then, poitional (randomied) policie uffice t γ β α u t α γ β u α t β u t α β u γ γ!7 Multi-objective Verification of MDP
18 Goal-unfolding A policy might need to memorie which et Gi ha been reached already Idea: Encode thi information into the tate-pace. Then, poitional (randomied) policie uffice β α t α γ β u u!8 Multi-objective Verification of MDP
19 Goal-unfolding Definition: The goal-unfolding of MDP M = (S, Act, P, init) and G,, Gm S \ {init} i the MDP MU = (S {0,} m, Act, PU, init, (0,, 0) ), where and for i {,, m}: PU(,b, α, t,c ) = ucc(b,t)[i] = P(, α, t), if c = ucc(b,t) { 0, otherwie {, if t G i b[i], otherwie The ize of MU i polynomial in the ize of M and exponential in m!9 Multi-objective Verification of MDP
20 Goal-unfolding Lemma: p i achievable in M iff p i achievable in MU. To anwer a multi-objective query for M, we can analye MU intead Lemma: p i achievable in MU iff p i achieved by a poitional policy. For the analyi of MU we only need to conider poitional policie!20 Multi-objective Verification of MDP
21 Overview α MDP with Multiple Objective Linear Programming Approach fin() = fout() for all S / S y,α,t 0 for all,t S, α Act() Σ S-i Σα Act() Σt S+i y,α,t pi for all i {,, m} Weighted Sum Approach!2 Multi-objective Verification of MDP
22 { Linear Programming Approach Idea: Ue variable y,α to encode the expected number of time we leave tate via action α Act() Exp. time i entered fin() Σt S Σα Act(t) yt,α PU(t, α, ) + {, if i the initial tate 0, otherwie fout() Σα Act() y,α Exp. time i left fin() { fout() We aert fin() = fout()!22 Multi-objective Verification of MDP
23 Solving Quantitative Querie Quantitative Query: Given: MDP M, goal tate et G,, Gm, p2,, pm R Output: max { p R (p, p2,, pm) A( Gi m) } Conider the goal-unfolding MU For i {,, m} let S-i = {,b b[i] = 0 } and S+i = {,b b[i] = } Let S = {,b t,c Pot*(,b ) implie c = b } Return the optimum of the following LP: max Σ S- Σα Act() Σt S+ y,α PU(, α, t) Exp. time G i entered uch that: fin() = fout() for all S / S y,α 0 for all S, α Act() Σ S-i Σα Act() Σt S+i y,α PU(, α, t) pi for all i {2,, m} Exp. time Gi i entered!23 Multi-objective Verification of MDP
24 Solving Achievability Querie Achievability Query: Given: MDP M, goal tate et G,, Gm, p R m Output: True iff p A( Gi m) Conider the goal-unfolding MU For i {,, m} let S-i = {,b b[i] = 0 } and S+i = {,b b[i] = } Let S = {,b t,c Pot*(,b ) implie c = b } Return True iff the following LP ha a feaible olution max 0 uch that: fin() = fout() for all S / S y,α 0 for all S, α Act() Σ S-i Σα Act() Σt S+i y,α PU(, α, t) pi for all i {,, m}!24 Multi-objective Verification of MDP
25 Overview α MDP with Multiple Objective Linear Programming Approach fin() = fout() for all S / S y,α,t 0 for all,t S, α Act() Σ S-i Σα Act() Σt S+i y,α,t pi for all i {,, m} Weighted Sum Approach!25 Multi-objective Verification of MDP
26 Weighted Sum Approach Theorem: For w [0,] m let Sw arg max S ( Σ i m w[i] Pr S ( Gi) ) and pw = ( Pr Sw ( G),, Pr Sw ( Gm) ). Then, pw A( Gi m) and for all q R m : w q > w pw implie q A( Gi m) In particular, pw lie on the Pareto curve Approach: Compute pw for different w Stop when the Pareto curve i explored q Not achievable achievable pw w!26 Multi-objective Verification of MDP
27 Weighted Sum Approach Theorem: For w [0,] m let Sw arg max S ( Σ i m w[i] Pr S ( Gi) ) and pw = ( Pr Sw ( G),, Pr Sw ( Gm) ). Then, pw A( Gi m) and for all q R m : w q > w pw implie q A( Gi m) In particular, pw lie on the Pareto curve Approach: Compute pw for different w Stop when the Pareto curve i explored Not achievable Recall: A( Gi m) i convex achievable pw w!27 Multi-objective Verification of MDP
28 Weighted Sum Approach Theorem: For w [0,] m let Sw arg max S ( Σ i m w[i] Pr S ( Gi) ) and pw = ( Pr Sw ( G),, Pr Sw ( Gm) ). Then, pw A( Gi m) and for all q R m : w q > w pw implie q A( Gi m) In particular, pw lie on the Pareto curve Approach: Compute pw for different w Stop when the Pareto curve i explored Recall: A( Gi m) i convex achievable Not achievable w pw!28 Multi-objective Verification of MDP
29 Weighted Sum Approach Theorem: For w [0,] m let Sw arg max S ( Σ i m w[i] Pr S ( Gi) ) and pw = ( Pr Sw ( G),, Pr Sw ( Gm) ). Then, pw A( Gi m) and for all q R m : w q > w pw implie q A( Gi m) Proof (ketch): pw A( Gi m) follow by definition Aume there i q A( Gi m) with w q > w pw Let q be achieved by policy S, i.e., Pr S ( Gi) q[i] for all i {,, m} Σ i m w[i] Pr Sw ( Gi) = w pw < w q Σ i m w[i] Pr S ( Gi) Contradiction to definition of Sw!29 Multi-objective Verification of MDP
30 Computation of Point pw for given w Weighted Value Iteration: Given: MDP M, goal tate et G,, Gm, w [0,] m, preciion ε Output: Point pw Conider the goal-unfolding MU = (SU, Act, PU, init, (0,, 0) ), where SU = S {0,} m Let g(b,c) {0,} m with g(b,c)[i] = iff b[i] = 0 and c[i] = for i {,, m} For,b SU and i {,, m}: x 0 (,b ) 0, y 0,i (,b ) 0, and Sw(,b ) α for ome arbitrary α Act(,b ) For j {, 2, }: x j (,b ) maxα Act(,b ) ( Σ t,c SU w g(b,c) + PU(,b, α, t,c ) x j- ( t,c ) ) Aopt arg maxα Act(,b ) ( Σ t,c SU w g(b,c) + PU(,b, α, t,c ) x j- ( t,c ) ) if Sw(,b ) Aopt then Sw(,b ) α for ome α Aopt For i {,, m}: y j,i (,b ) Σ t,c SU g(b,c)[i] + PU(,b, Sw(,b ), t,c ) y j-,i ( t,c ) Stop when max,b SU ( x j (,b ) - x j- (,b ) ε Return point pw with pw[i] = y j,i ( init, (0,, 0) )!30 Multi-objective Verification of MDP
31 Concluion Multi-objective MDP Satify multiple propertie at once Need randomied, finite-memory policie Two Approache Linear programming approach Weighted um approach Active Field of Reearch Ak u for Bachelor / Mater thei topic Thank you for your attention!3 Multi-objective Verification of MDP
Problem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationReinforcement Learning
Reinforcement Learning Yihay Manour Google Inc. & Tel-Aviv Univerity Outline Goal of Reinforcement Learning Mathematical Model (MDP) Planning Learning Current Reearch iue 2 Goal of Reinforcement Learning
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationLecture 8: Period Finding: Simon s Problem over Z N
Quantum Computation (CMU 8-859BB, Fall 205) Lecture 8: Period Finding: Simon Problem over Z October 5, 205 Lecturer: John Wright Scribe: icola Rech Problem A mentioned previouly, period finding i a rephraing
More informationAssignment for Mathematics for Economists Fall 2016
Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex
More informationStochastic Perishable Inventory Control in a Service Facility System Maintaining Inventory for Service: Semi Markov Decision Problem
Stochatic Perihable Inventory Control in a Service Facility Sytem Maintaining Inventory for Service: Semi Markov Deciion Problem R.Mugeh 1,S.Krihnakumar 2, and C.Elango 3 1 mugehrengawamy@gmail.com 2 krihmathew@gmail.com
More informationRELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS
www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin
More informationMemoryle Strategie in Concurrent Game with Reachability Objective Λ Krihnendu Chatterjee y Luca de Alfaro x Thoma A. Henzinger y;z y EECS, Univerity o
Memoryle Strategie in Concurrent Game with Reachability Objective Krihnendu Chatterjee, Luca de Alfaro and Thoma A. Henzinger Report No. UCB/CSD-5-1406 Augut 2005 Computer Science Diviion (EECS) Univerity
More informationDeparture Time and Route Choices with Bottleneck Congestion: User Equilibrium under Risk and Ambiguity
Departure Time and Route Choice with Bottleneck Congetion: Uer Equilibrium under Rik and Ambiguity Yang Liu, Yuanyuan Li and Lu Hu Department of Indutrial Sytem Engineering and Management National Univerity
More informationarxiv: v1 [math.mg] 25 Aug 2011
ABSORBING ANGLES, STEINER MINIMAL TREES, AND ANTIPODALITY HORST MARTINI, KONRAD J. SWANEPOEL, AND P. OLOFF DE WET arxiv:08.5046v [math.mg] 25 Aug 20 Abtract. We give a new proof that a tar {op i : i =,...,
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationc n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k
1. Exitence Let x (0, 1). Define c k inductively. Suppoe c 1,..., c k 1 are already defined. We let c k be the leat integer uch that x k An eay proof by induction give that and for all k. Therefore c n
More informationList coloring hypergraphs
Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity
More informationTHE THERMOELASTIC SQUARE
HE HERMOELASIC SQUARE A mnemonic for remembering thermodynamic identitie he tate of a material i the collection of variable uch a tre, train, temperature, entropy. A variable i a tate variable if it integral
More informationarxiv: v2 [math.nt] 30 Apr 2015
A THEOREM FOR DISTINCT ZEROS OF L-FUNCTIONS École Normale Supérieure arxiv:54.6556v [math.nt] 3 Apr 5 943 Cachan November 9, 7 Abtract In thi paper, we etablih a imple criterion for two L-function L and
More informationSource slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis
Source lideplayer.com/fundamental of Analytical Chemitry, F.J. Holler, S.R.Crouch Chapter 6: Random Error in Chemical Analyi Random error are preent in every meaurement no matter how careful the experimenter.
More informationPerformance Evaluation
Performance Evaluation 95 (206) 40 Content lit available at ScienceDirect Performance Evaluation journal homepage: www.elevier.com/locate/peva Optimal cheduling in call center with a callback option Benjamin
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationWhat lies between Δx E, which represents the steam valve, and ΔP M, which is the mechanical power into the synchronous machine?
A 2.0 Introduction In the lat et of note, we developed a model of the peed governing mechanim, which i given below: xˆ K ( Pˆ ˆ) E () In thee note, we want to extend thi model o that it relate the actual
More informationChapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover
Coping With NP-Hardne Chapter 12 Local Search Q Suppoe I need to olve an NP-hard problem What hould I do? A Theory ay you're unlikely to find poly-time algorithm Mut acrifice one of three deired feature
More informationCS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division
1 1 April 000 Demmel / Shewchuk CS 170: Midterm Exam II Univerity of California at Berkeley Department of Electrical Engineering and Computer Science Computer Science Diviion hi i a cloed book, cloed calculator,
More informationCHAPTER 6. Estimation
CHAPTER 6 Etimation Definition. Statitical inference i the procedure by which we reach a concluion about a population on the bai of information contained in a ample drawn from that population. Definition.
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
More informationp. (The electron is a point particle with radius r = 0.)
- pin ½ Recall that in the H-atom olution, we howed that the fact that the wavefunction Ψ(r) i ingle-valued require that the angular momentum quantum nbr be integer: l = 0,,.. However, operator algebra
More informationHSC PHYSICS ONLINE KINEMATICS EXPERIMENT
HSC PHYSICS ONLINE KINEMATICS EXPERIMENT RECTILINEAR MOTION WITH UNIFORM ACCELERATION Ball rolling down a ramp Aim To perform an experiment and do a detailed analyi of the numerical reult for the rectilinear
More informationTechnical Appendix: Auxiliary Results and Proofs
A Technical Appendix: Auxiliary Reult and Proof Lemma A. The following propertie hold for q (j) = F r [c + ( ( )) ] de- ned in Lemma. (i) q (j) >, 8 (; ]; (ii) R q (j)d = ( ) q (j) + R q (j)d ; (iii) R
More informationProblem 1. Construct a filtered probability space on which a Brownian motion W and an adapted process X are defined and such that
Stochatic Calculu Example heet 4 - Lent 5 Michael Tehranchi Problem. Contruct a filtered probability pace on which a Brownian motion W and an adapted proce X are defined and uch that dx t = X t t dt +
More informationChapter 4. The Laplace Transform Method
Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination
More informationTo describe a queuing system, an input process and an output process has to be specified.
5. Queue (aiting Line) Queuing terminology Input Service Output To decribe a ueuing ytem, an input proce and an output proce ha to be pecified. For example ituation input proce output proce Bank Cutomer
More informationALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS
SIAM J. COMPUT. Vol. 30, No. 1, pp. 191 217 c 2000 Society for Indutrial and Applied Mathematic ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS JON KLEINBERG, YUVAL RABANI, AND ÉVA TARDOS Abtract. In thi paper,
More informationRobustness analysis for the boundary control of the string equation
Routne analyi for the oundary control of the tring equation Martin GUGAT Mario SIGALOTTI and Mariu TUCSNAK I INTRODUCTION AND MAIN RESULTS In thi paper we conider the infinite dimenional ytem determined
More informationComputers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order
Computer and Mathematic with Application 64 (2012) 2262 2274 Content lit available at SciVere ScienceDirect Computer and Mathematic with Application journal homepage: wwweleviercom/locate/camwa Sharp algebraic
More informationResearch Article Existence for Nonoscillatory Solutions of Higher-Order Nonlinear Differential Equations
International Scholarly Reearch Network ISRN Mathematical Analyi Volume 20, Article ID 85203, 9 page doi:0.502/20/85203 Reearch Article Exitence for Nonocillatory Solution of Higher-Order Nonlinear Differential
More information3.1 The Revised Simplex Algorithm. 3 Computational considerations. Thus, we work with the following tableau. Basic observations = CARRY. ... m.
3 Computational conideration In what follow, we analyze the complexity of the Simplex algorithm more in detail For thi purpoe, we focu on the update proce in each iteration of thi procedure Clearly, ince,
More informationRoot Locus Diagram. Root loci: The portion of root locus when k assume positive values: that is 0
Objective Root Locu Diagram Upon completion of thi chapter you will be able to: Plot the Root Locu for a given Tranfer Function by varying gain of the ytem, Analye the tability of the ytem from the root
More informationPulsed Magnet Crimping
Puled Magnet Crimping Fred Niell 4/5/00 1 Magnetic Crimping Magnetoforming i a metal fabrication technique that ha been in ue for everal decade. A large capacitor bank i ued to tore energy that i ued to
More informationThe continuous time random walk (CTRW) was introduced by Montroll and Weiss 1.
1 I. CONTINUOUS TIME RANDOM WALK The continuou time random walk (CTRW) wa introduced by Montroll and Wei 1. Unlike dicrete time random walk treated o far, in the CTRW the number of jump n made by the walker
More informationBayesian Learning, Randomness and Logic. Marc Snir
Bayeian Learning, Randomne and Logic Marc Snir Background! 25 year old work, far from my current reearch! why preent now?! Becaue it wa done when I wa Eli tudent! Becaue it i about the foundation of epitemology!
More informationGeometric Measure Theory
Geometric Meaure Theory Lin, Fall 010 Scribe: Evan Chou Reference: H. Federer, Geometric meaure theory L. Simon, Lecture on geometric meaure theory P. Mittila, Geometry of et and meaure in Euclidean pace
More informationSecretary problems with competing employers
Secretary problem with competing employer Nicole Immorlica 1, Robert Kleinberg 2, and Mohammad Mahdian 1 1 Microoft Reearch, One Microoft Way, Redmond, WA. {nickle,mahdian}@microoft.com 2 UC Berkeley Computer
More informationA Study on Simulating Convolutional Codes and Turbo Codes
A Study on Simulating Convolutional Code and Turbo Code Final Report By Daniel Chang July 27, 2001 Advior: Dr. P. Kinman Executive Summary Thi project include the deign of imulation of everal convolutional
More informationConvex Hulls of Curves Sam Burton
Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014
Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion
More informationAvoiding Forbidden Submatrices by Row Deletions
Avoiding Forbidden Submatrice by Row Deletion Sebatian Wernicke, Jochen Alber, Jen Gramm, Jiong Guo, and Rolf Niedermeier Wilhelm-Schickard-Intitut für Informatik, niverität Tübingen, Sand 13, D-72076
More informationCall Centers with a Postponed Callback Offer
Call Center with a Potponed Callback Offer Benjamin Legro, Sihan Ding, Rob Van Der Mei, Oualid Jouini To cite thi verion: Benjamin Legro, Sihan Ding, Rob Van Der Mei, Oualid Jouini. Call Center with a
More informationSuggestions - Problem Set (a) Show the discriminant condition (1) takes the form. ln ln, # # R R
Suggetion - Problem Set 3 4.2 (a) Show the dicriminant condition (1) take the form x D Ð.. Ñ. D.. D. ln ln, a deired. We then replace the quantitie. 3ß D3 by their etimate to get the proper form for thi
More informationProbabilistic Model Checking and Strategy Synthesis for Robot Navigation
Probabilistic Model Checking and Strategy Synthesis for Robot Navigation Dave Parker University of Birmingham (joint work with Bruno Lacerda, Nick Hawes) AIMS CDT, Oxford, May 2015 Overview Probabilistic
More informationCOHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE
COHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE LIVIU I. NICOLAESCU ABSTRACT. I dicu low dimenional incarnation of cohomology and illutrate how baic cohomological principle lead to a proof of Sperner lemma. CONTENTS.
More informationECE-320 Linear Control Systems. Spring 2014, Exam 1. No calculators or computers allowed, you may leave your answers as fractions.
ECE-0 Linear Control Sytem Spring 04, Exam No calculator or computer allowed, you may leave your anwer a fraction. All problem are worth point unle noted otherwie. Total /00 Problem - refer to the unit
More informationDetermination of the local contrast of interference fringe patterns using continuous wavelet transform
Determination of the local contrat of interference fringe pattern uing continuou wavelet tranform Jong Kwang Hyok, Kim Chol Su Intitute of Optic, Department of Phyic, Kim Il Sung Univerity, Pyongyang,
More informationMassachusetts Institute of Technology Dynamics and Control II
I E Maachuett Intitute of Technology Department of Mechanical Engineering 2.004 Dynamic and Control II Laboratory Seion 5: Elimination of Steady-State Error Uing Integral Control Action 1 Laboratory Objective:
More informationGNSS Solutions: What is the carrier phase measurement? How is it generated in GNSS receivers? Simply put, the carrier phase
GNSS Solution: Carrier phae and it meaurement for GNSS GNSS Solution i a regular column featuring quetion and anwer about technical apect of GNSS. Reader are invited to end their quetion to the columnit,
More informationLecture 9: Shor s Algorithm
Quantum Computation (CMU 8-859BB, Fall 05) Lecture 9: Shor Algorithm October 7, 05 Lecturer: Ryan O Donnell Scribe: Sidhanth Mohanty Overview Let u recall the period finding problem that wa et up a a function
More informationFILTERING OF NONLINEAR STOCHASTIC FEEDBACK SYSTEMS
FILTERING OF NONLINEAR STOCHASTIC FEEDBACK SYSTEMS F. CARRAVETTA 1, A. GERMANI 1,2, R. LIPTSER 3, AND C. MANES 1,2 Abtract. Thi paper concern the filtering problem for a cla of tochatic nonlinear ytem
More informationBayesian-Based Decision Making for Object Search and Characterization
9 American Control Conference Hyatt Regency Riverfront, St. Loui, MO, USA June -, 9 WeC9. Bayeian-Baed Deciion Making for Object Search and Characterization Y. Wang and I. I. Huein Abtract Thi paper focue
More informationCopyright 1967, by the author(s). All rights reserved.
Copyright 1967, by the author(). All right reerved. Permiion to make digital or hard copie of all or part of thi work for peronal or claroom ue i granted without fee provided that copie are not made or
More informationChapter 13. Root Locus Introduction
Chapter 13 Root Locu 13.1 Introduction In the previou chapter we had a glimpe of controller deign iue through ome imple example. Obviouly when we have higher order ytem, uch imple deign technique will
More informationNAME (pinyin/italian)... MATRICULATION NUMBER... SIGNATURE
POLITONG SHANGHAI BASIC AUTOMATIC CONTROL June Academic Year / Exam grade NAME (pinyin/italian)... MATRICULATION NUMBER... SIGNATURE Ue only thee page (including the bac) for anwer. Do not ue additional
More informationMinimal state space realization of MIMO systems in the max algebra
KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 94-54 Minimal tate pace realization of MIMO ytem in the max algebra B De Schutter and B De Moor If you want to cite thi report
More informationTHE SPLITTING SUBSPACE CONJECTURE
THE SPLITTING SUBSPAE ONJETURE ERI HEN AND DENNIS TSENG Abtract We anwer a uetion by Niederreiter concerning the enumeration of a cla of ubpace of finite dimenional vector pace over finite field by proving
More informationStresses near a plate vertex due to a shear force on one of the edges
Stree near a plate vertex due to a hear force on one of the edge P.C.J. Hoogenboom Delft Univerity of Technology, Faculty of Civil Engineering and Geocience, Delft, the Netherland A cloed form olution
More informationA Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. = 4 for QPSK) E b Q 2. 2E b.
Exercie: QPSK I Find the error rate for the ignal et n (t) = p 2E /T co(2pf c t + n p/2 + p/4), for n = 0,, 3 I Anwer: (Recall h P = d min 2 E b = 4 for QPSK) E Pr{e} = 2Q Q 2 = 2Q = 2Q 2E b h P E b 2
More informationIncremental Quantitative Verification for Markov Decision Processes
Incremental Quantitative Verification for Markov Deciion Procee Marta Kwiatkowka, David Parker and Hongyang Qu Department of Computer Science, Univerity of Oxford, Park Road, Oxford, OX1 3QD, UK Email:
More informationZ a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is
M09_BERE8380_12_OM_C09.QD 2/21/11 3:44 PM Page 1 9.6 The Power of a Tet 9.6 The Power of a Tet 1 Section 9.1 defined Type I and Type II error and their aociated rik. Recall that a repreent the probability
More informationEquivalent Strain in Simple Shear Deformations
Equivalent Strain in Simple Shear Deformation Yan Beygelzimer Donetk Intitute of Phyic and Engineering The National Academy of Science of Ukraine Abtract We how that imple hear and pure hear form two group
More informationOPTIMIZATION OF INTERDEPENDENT QUEUEING MODEL WITH BULK SERVICE HAVING VARIABLE CAPACITY
International Releae of Mathematic and Mathematical Science Available at http://irmm.org OPTIMIZATION OF INTERDEPENDENT QUEUEING MODEL WITH BULK SERVICE HAVING VARIABLE CAPACITY Shavej Ali Siddiqui Sagar
More informationTAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES
TAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES DOUGLAS R. ANDERSON Abtract. We are concerned with the repreentation of polynomial for nabla dynamic equation on time cale. Once etablihed,
More informationEE Control Systems LECTURE 6
Copyright FL Lewi 999 All right reerved EE - Control Sytem LECTURE 6 Updated: Sunday, February, 999 BLOCK DIAGRAM AND MASON'S FORMULA A linear time-invariant (LTI) ytem can be repreented in many way, including:
More informationSOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU. I will collect my solutions to some of the exercises in this book in this document.
SOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU CİHAN BAHRAN I will collect my olution to ome of the exercie in thi book in thi document. Section 2.1 1. Let A = k[[t ]] be the ring of
More informationOne Class of Splitting Iterative Schemes
One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi
More informationFRTN10 Exercise 3. Specifications and Disturbance Models
FRTN0 Exercie 3. Specification and Diturbance Model 3. A feedback ytem i hown in Figure 3., in which a firt-order proce if controlled by an I controller. d v r u 2 z C() P() y n Figure 3. Sytem in Problem
More informationarxiv: v1 [quant-ph] 22 Oct 2010
The extenion problem for partial Boolean tructure in Quantum Mechanic Cotantino Budroni 1 and Giovanni Morchio 1, 2 1) Dipartimento di Fiica, Univerità di Pia, Italy 2) INFN, Sezione di Pia, Italy Alternative
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More informationAP Physics Charge Wrap up
AP Phyic Charge Wrap up Quite a few complicated euation for you to play with in thi unit. Here them babie i: F 1 4 0 1 r Thi i good old Coulomb law. You ue it to calculate the force exerted 1 by two charge
More informationCompetitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation
Competitive Analyi of Tak Scheduling Algorithm on a Fault-Prone Machine and the Impact of Reource Augmentation Antonio Fernández Anta a, Chryi Georgiou b, Dariuz R. Kowalki c, Elli Zavou a,d,1 a Intitute
More informationEigenvalues and eigenvectors
Eigenvalue and eigenvector Defining and computing uggeted problem olution For each matri give below, find eigenvalue and eigenvector. Give a bai and the dimenion of the eigenpace for each eigenvalue. P:
More informationEvolutionary Algorithms Based Fixed Order Robust Controller Design and Robustness Performance Analysis
Proceeding of 01 4th International Conference on Machine Learning and Computing IPCSIT vol. 5 (01) (01) IACSIT Pre, Singapore Evolutionary Algorithm Baed Fixed Order Robut Controller Deign and Robutne
More informationA note on strong convergence for Pettis integrable functions (revision)
note on trong convergence for Petti integrable function (reviion) Erik J. Balder, Mathematical Intitute, Univerity of Utrecht, Utrecht, Netherland nna Rita Sambucini, Dipartimento di Matematica, Univerità
More informationA Partially Backlogging Inventory Model for Deteriorating Items with Ramp Type Demand Rate
American Journal of Operational Reearch 05, 5(): 39-46 DOI: 0.593/j.ajor.05050.03 A Partially Backlogging Inventory Model for Deteriorating Item with Ramp ype Demand Rate Suhil Kumar *, U. S. Rajput Department
More informationME 375 FINAL EXAM Wednesday, May 6, 2009
ME 375 FINAL EXAM Wedneday, May 6, 9 Diviion Meckl :3 / Adam :3 (circle one) Name_ Intruction () Thi i a cloed book examination, but you are allowed three ingle-ided 8.5 crib heet. A calculator i NOT allowed.
More informationTMA4125 Matematikk 4N Spring 2016
Norwegian Univerity of Science and Technology Department of Mathematical Science TMA45 Matematikk 4N Spring 6 Solution to problem et 6 In general, unle ele i noted, if f i a function, then F = L(f denote
More informationPHYS 110B - HW #6 Spring 2004, Solutions by David Pace Any referenced equations are from Griffiths Problem statements are paraphrased
PHYS B - HW #6 Spring 4, Solution by David Pace Any referenced equation are from Griffith Problem tatement are paraphraed. Problem. from Griffith Show that the following, A µo ɛ o A V + A ρ ɛ o Eq..4 A
More informationONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES
ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES CHRISTOPHER P. CHAMBERS, FEDERICO ECHENIQUE, AND KOTA SAITO In thi online
More informationP ( N m=na c m) (σ-additivity) exp{ P (A m )} (1 x e x for x 0) m=n P (A m ) 0
MA414 STOCHASTIC ANALYSIS: EXAMINATION SOLUTIONS, 211 Q1.(i) Firt Borel-Cantelli Lemma). A = lim up A n = n m=n A m, o A m=na m for each n. So P (A) P ( m=na m ) m=n P (A m ) (n ) (tail of a convergent
More informationMEM 355 Performance Enhancement of Dynamical Systems Root Locus Analysis
MEM 355 Performance Enhancement of Dynamical Sytem Root Locu Analyi Harry G. Kwatny Department of Mechanical Engineering & Mechanic Drexel Univerity Outline The root locu method wa introduced by Evan in
More informationNotes on Phase Space Fall 2007, Physics 233B, Hitoshi Murayama
Note on Phae Space Fall 007, Phyic 33B, Hitohi Murayama Two-Body Phae Space The two-body phae i the bai of computing higher body phae pace. We compute it in the ret frame of the two-body ytem, P p + p
More informationPOINCARE INEQUALITY AND CAMPANATO ESTIMATES FOR WEAK SOLUTIONS OF PARABOLIC EQUATIONS
Electronic Journal of Differential Equation, Vol. 206 (206), No. 204, pp. 8. ISSN: 072-669. URL: http://ejde.math.txtate.edu or http://ejde.math.unt.edu POINCARE INEQUALITY AND CAMPANATO ESTIMATES FOR
More informationPrimitive Digraphs with the Largest Scrambling Index
Primitive Digraph with the Larget Scrambling Index Mahmud Akelbek, Steve Kirkl 1 Department of Mathematic Statitic, Univerity of Regina, Regina, Sakatchewan, Canada S4S 0A Abtract The crambling index of
More informationConduction Heat transfer: Unsteady state
Conduction Heat tranfer: Unteady tate Chapter Objective For olving the ituation that Where temperature do not change with poition. In a imple lab geometry where temperature vary alo with poition. Near
More informationinto a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get
Lecture 25 Introduction to Some Matlab c2d Code in Relation to Sampled Sytem here are many way to convert a continuou time function, { h( t) ; t [0, )} into a dicrete time function { h ( k) ; k {0,,, }}
More informationExplicit formulae for J pectral factor for well-poed linear ytem Ruth F. Curtain Amol J. Saane Department of Mathematic Department of Mathematic Univerity of Groningen Univerity of Twente P.O. Box 800
More informationSTOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND
OPERATIONS RESEARCH AND DECISIONS No. 4 203 DOI: 0.5277/ord30402 Marcin ANHOLCER STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND The generalized tranportation problem
More informationMidterm Review - Part 1
Honor Phyic Fall, 2016 Midterm Review - Part 1 Name: Mr. Leonard Intruction: Complete the following workheet. SHOW ALL OF YOUR WORK. 1. Determine whether each tatement i True or Fale. If the tatement i
More informationINEQUALITIES FOR THE NUMERICAL RADIUS IN UNITAL NORMED ALGEBRAS
INEQUALITIES FOR THE NUMERICAL RADIUS IN UNITAL NORMED ALGEBRAS S.S. DRAGOMIR Abtract. In thi paper, ome ineualitie between the numerical radiu of an element from a unital normed algebra and certain emi-inner
More informationAn Approach for Solving Multi-Objective Linear Fractional Programming Problem and It s Comparison with Other Techniques
International Journal of Scientific and Innovative Mathematical Reearch (IJSIMR) Volume 5, Iue 11, 2017, PP 1-5 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dxdoiorg/1020431/2347-31420511001
More informationMulti-dimensional Fuzzy Euler Approximation
Mathematica Aeterna, Vol 7, 2017, no 2, 163-176 Multi-dimenional Fuzzy Euler Approximation Yangyang Hao College of Mathematic and Information Science Hebei Univerity, Baoding 071002, China hdhyywa@163com
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationOPTIMAL INVESTMENT AND CONSUMPTION PORTFOLIO CHOICE PROBLEM FOR ASSETS MODELED BY LEVY PROCESSES
OPTIMAL INVESTMENT AND CONSUMPTION PORTFOLIO CHOICE PROBLEM FOR ASSETS MODELED BY LEVY PROCESSES By RYAN G. SANKARPERSAD A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN
More informationThe simplex method is strongly polynomial for deterministic Markov decision processes
The implex method i trongly polynomial for determinitic Markov deciion procee Ian Pot Yinyu Ye May 31, 2013 Abtract We prove that the implex method with the highet gain/mot-negative-reduced cot pivoting
More informationMath 273 Solutions to Review Problems for Exam 1
Math 7 Solution to Review Problem for Exam True or Fale? Circle ONE anwer for each Hint: For effective tudy, explain why if true and give a counterexample if fale (a) T or F : If a b and b c, then a c
More information