Controlling a population of identical MDP

Size: px
Start display at page:

Download "Controlling a population of identical MDP"

Transcription

1 Controlling popultion of identicl MDP Nthlie Bertrnd Inri Rennes ongoing work with Miheer Dewskr (CMI), Blise Genest (IRISA) nd Hugo Gimert (LBRI) Trends nd Chllenges in Quntittive Verifiction Mysore, Ferury 2nd 2016

2 Motivtion Control of gene expression for popultion of cells credits: G. Btt Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

3 Motivtion Control of gene expression for popultion of cells cell popultion gene expression monitored through fluorescence level drug injections ffect ll cells response vries from cell to cell credits: G. Btt otin lrge proportion of cells with desired gene expression level Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

4 Motivtion Control of gene expression for popultion of cells cell popultion gene expression monitored through fluorescence level drug injections ffect ll cells response vries from cell to cell credits: G. Btt otin lrge proportion of cells with desired gene expression level ritrry n of components full oservtion uniform control MDP model for single cell glol quntittive rechility ojective Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

5 Mrkov decision processes,1/2, non-deterministic ctions: {, } pro. distriution over successors,1/2 F Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

6 Mrkov decision processes,1/2, non-deterministic ctions: {, } pro. distriution over successors,1/2 F Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

7 Mrkov decision processes,1/2, non-deterministic ctions: {, } pro. distriution over successors,1/2 F Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

8 Mrkov decision processes,1/2, non-deterministic ctions: {, } pro. distriution over successors,1/2 F Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

9 Mrkov decision processes,1/2,1/2, non-deterministic ctions: {, } pro. distriution over successors Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

10 Mrkov decision processes,1/2,1/2, non-deterministic ctions: {, } pro. distriution over successors Scheduler σ : S + Σ resolves non-determinism induces Mrkov chin with proility mesure P σ Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

11 Mrkov decision processes,1/2,1/2, non-deterministic ctions: {, } pro. distriution over successors Scheduler σ : S + Σ resolves non-determinism induces Mrkov chin with proility mesure P σ Theorem: rechility checking for MDP The following prolems re in PTIME σ, P σ ( F ) = 1? σ, P σ ( F ) >.7? compute mx σ P σ ( F ). Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

12 Bck to our motivting ppliction Control of gene expression for popultion of cells credits: G. Btt ritrry n of components full oservtion uniform control MDP model for single cell glol quntittive rechility ojective Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

13 Modelling popultion of N identicl MDP M uniform control policy under full oservtion Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

14 Modelling popultion of N identicl MDP M uniform control policy under full oservtion,1/2, F,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

15 Modelling popultion of N identicl MDP M uniform control policy under full oservtion,1/2,,1/2, F,1/2,1/4,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

16 Modelling popultion of N identicl MDP M uniform control policy under full oservtion,1/2,,1/2, F,1/2,1/4,1/2 Verifiction question does the mximum proility tht given proportion of MDPs rech trget set of sttes meet threshold? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

17 Modelling popultion of N identicl MDP M uniform control policy under full oservtion,1/2,,1/2, F,1/2,1/4,1/2 Verifiction question does the mximum proility tht given proportion of MDPs rech trget set of sttes meet threshold? Fixed N: uild the product MDP M N, identify glol trget sttes, compute optiml scheduler Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

18 Prmeterized verifiction Verifiction question does the mximum proility tht given proportion of MDPs rech trget set of sttes meet threshold? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

19 Prmeterized verifiction Verifiction question does the mximum proility tht given proportion of MDPs rech trget set of sttes meet threshold? Prmeter N: check the glol ojective for ll popultion sizes N N mx σ P σ(m N = t lest 80% of MDPs in F ).7? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

20 Prmeterized verifiction Verifiction question does the mximum proility tht given proportion of MDPs rech trget set of sttes meet threshold? Prmeter N: check the glol ojective for ll popultion sizes N N mx σ P σ(m N = t lest 80% of MDPs in F ).7? Restricted cses qulittive: lmost-sure convergence Boolen: sure convergence N mx σ P σ(m N = F N )= 1? N σ, M N = σ F N? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

21 This tlk Prolem setting Boolen prmeterized verifiction questions uniform control for popultion of NFA 2-plyer turn-sed gme controller chooses the ction (e.g. ) opponent chooses how to move ech individul copy (-trnsition) convergence ojective: ll copies in trget set F Q N σ, M N = σ F N? N σ, τ, (M N, σ, τ) = F N? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

22 This tlk Prolem setting Boolen prmeterized verifiction questions uniform control for popultion of NFA 2-plyer turn-sed gme controller chooses the ction (e.g. ) opponent chooses how to move ech individul copy (-trnsition) convergence ojective: ll copies in trget set F Q N σ, M N = σ F N? N σ, τ, (M N, σ, τ) = F N? Questions ddressed decidility memory requirements for controller σ dmissile vlues for N Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

23 Monotonicity property, N σ, M N = σ F N? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

24 Monotonicity property, N σ, M N = σ F N? Monotonicity: hrder when N grows σ, M N = σ F N = M N, σ, M M = σ F M Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

25 Monotonicity property, N σ, M N = σ F N? Monotonicity: hrder when N grows σ, M N = σ F N = M N, σ, M M = σ F M Cutoff: smllest N for which there is no dmissile controller σ Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

26 A first exmple nd first question, F N, σ, M N = σ F N σ(k, 0, 0, ) = σ(0, k u, k d, ) = σ(0, 0, k d, ) = memoryless support-sed controllers suffice on this exmple Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

27 A first exmple nd first question, F N, σ, M N = σ F N σ(k, 0, 0, ) = σ(0, k u, k d, ) = σ(0, 0, k d, ) = memoryless support-sed controllers suffice on this exmple Question 1 Are memoryless support-sed controllers enough in generl? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

28 A second exmple nd second question A = { 1,, M } unspecified edges led to sink stte q 1 A\ 1. F A {} q M A\ M N < M, σ, M N = σ F N Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

29 A second exmple nd second question A = { 1,, M } unspecified edges led to sink stte q 1 A\ 1. F A {} q M A\ M N < M, σ, M N = σ F N Cutoff min{n σ, M N = σ F N } here O( M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

30 A second exmple nd second question A = { 1,, M } unspecified edges led to sink stte q 1 A\ 1. F A {} q M A\ M N < M, σ, M N = σ F N Cutoff min{n σ, M N = σ F N } here O( M ) Question 2 Are cutoffs lwys polynomil in M? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

31 A first nswer Assumption: if t lest one stte is empty, the controller ensures convergence gdget similr to previous exmple with ctions { 1,, 4} Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

32 A first nswer Assumption: if t lest one stte is empty, the controller ensures convergence gdget similr to previous exmple with ctions { 1,, 4} Possile controllers lwys : deterministic ehviour, full support is mintined lwys : splitting the copies in third stte llows opponent to win Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

33 A first nswer Assumption: if t lest one stte is empty, the controller ensures convergence gdget similr to previous exmple with ctions { 1,, 4} Possile controllers lwys : deterministic ehviour, full support is mintined lwys : splitting the copies in third stte llows opponent to win nd in lterntion: lek from first/second sttes to third Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

34 A first nswer Assumption: if t lest one stte is empty, the controller ensures convergence gdget similr to previous exmple with ctions { 1,, 4} Possile controllers lwys : deterministic ehviour, full support is mintined lwys : splitting the copies in third stte llows opponent to win nd in lterntion: lek from first/second sttes to third Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

35 A first nswer Assumption: if t lest one stte is empty, the controller ensures convergence gdget similr to previous exmple with ctions { 1,, 4} Possile controllers lwys : deterministic ehviour, full support is mintined lwys : splitting the copies in third stte llows opponent to win nd in lterntion: lek from first/second sttes to third Memoryless support-sed controllers re not enough! Exponentil memory on top of support my even e needed. Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

36 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

37 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

38 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

39 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

40 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

41 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

42 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

43 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

44 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

45 A second nswer d u c c u d F,,c u,d u,d u,d,,c 2M ottom sttes (here 6) N 2 M, σ, M N = σ F N ccumulte copies in ottom sttes, then u/d to converge for N > 2 M controller cnnot void reching the sink stte Cutoff cn even e douly exponentil! Cutoff O(2 M ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

46 Lessons lernt so fr Boolen prolem is hrder thn expected Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

47 Lessons lernt so fr Boolen prolem is hrder thn expected supports re not enough douly exponentil lower ound on cutoffs somehow prevents from uilding the product MDP Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

48 Lessons lernt so fr Boolen prolem is hrder thn expected supports re not enough douly exponentil lower ound on cutoffs somehow prevents from uilding the product MDP the more copies the hrder, the lrger support the hrder looking t whether supports cn e mintined seems promising Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

49 Support gme Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

50 Support gme plyer gme on possile supports Eve chooses ction Adm chooses trnsfer reltion 1,2,3 1,2,3,4 1,3,4 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

51 Support gme plyer gme on possile supports Eve chooses ction Adm chooses trnsfer reltion 1,2,3 1,2,3,4 simple winning condition for Eve: rech {F } sufficient condition, not sound in generl 1,3,4 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

52 Refined winning condition Intuition: llow Eve to monitor some copies nd pinpoint leks long ply only finitely mny leks re possile Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

53 Refined winning condition Intuition: llow Eve to monitor some copies nd pinpoint leks long ply only finitely mny leks re possile Ply ρ = S 1 R 0 1 S1 winning for Eve if there exists (T i ) i N s.t. (1) i, T i S i (2) i, Pre[R i+1 ](T i+1 ) T i (3) j, T j+1 Post[R j+1 ](T j ) w S i 1,2,3,4 w S i+1 w S i+2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

54 Refined winning condition Intuition: llow Eve to monitor some copies nd pinpoint leks long ply only finitely mny leks re possile Ply ρ = S 1 R 0 1 S1 winning for Eve if there exists (T i ) i N s.t. (1) i, T i S i (2) i, Pre[R i+1 ](T i+1 ) T i (3) j, T j+1 Post[R j+1 ](T j ) w S i 1,2,3,4 w S i+1 w S i+2 Eve wins support gme with refined winning condition iff N controller hs strtegy to rech winning supports Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

55 Solving support gme w. refined winning condition Trnsformtion into 2-plyer prtil oservtion gme with Büchi winning condition exponentil lowup of gme ren sttes (S, T ) for ll possile T S Adm shll not oserve the susets monitored y Eve he only oserves S-component of stte (S, T ) Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

56 Solving support gme w. refined winning condition Trnsformtion into 2-plyer prtil oservtion gme with Büchi winning condition exponentil lowup of gme ren sttes (S, T ) for ll possile T S Adm shll not oserve the susets monitored y Eve he only oserves S-component of stte (S, T ) Theorem: Decidility nd complexity (still to e checked) Boolen prmeterized convergence is decidle in 3EXPTIME. Cutoff is t most triply exponentil in M. Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

57 Solving support gme w. refined winning condition Trnsformtion into 2-plyer prtil oservtion gme with Büchi winning condition exponentil lowup of gme ren sttes (S, T ) for ll possile T S Adm shll not oserve the susets monitored y Eve he only oserves S-component of stte (S, T ) Theorem: Decidility nd complexity (still to e checked) Boolen prmeterized convergence is decidle in 3EXPTIME. Cutoff is t most triply exponentil in M. Theorem: (fr from mtching) Lower-ounds PSPACE-hrdness for Boolen prmeterized convergence. Douly exponentil lower-ound on the cutoff. Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

58 Contriutions Uniform control of popultion of identicl MDP prmeterized verifiction prolem Boolen convergence: ring ll MDP t the sme time in F surprisingly quite involved! eyond support-sed optiml controllers 3EXPTIME-decision procedure cutoff etween douly exponentil nd triply exponentil Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

59 Bck to motivtions Motivtion 1: prcticl motivtion Control of gene expression for popultion of cells credits: G. Btt Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

60 Bck to motivtions Motivtion 1: prcticl motivtion Control of gene expression for popultion of cells credits: G. Btt need for truely proilistic model MDP insted of NFA need for truely quntittive questions proportions nd proilities insted of convergence nd (lmost)-sure N mx σ P σ(m N = t lest 80% of MDPs in F ).7? Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

61 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

62 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

63 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

64 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2,1/2,1/2 Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

65 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2,1/2,1/2 Argule: optiml rechility proility not continuous when N,,1/2 d u F,1/2 d u Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

66 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2,1/2,1/2 Argule: optiml rechility proility not continuous when N,,1/2,1/2 u d d F N, σ, P σ ( F N ) = 1. In the PA, the mximum proility to rech F is.5. u Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

67 Bck to motivtions Motivtion 2: theoreticl motivtion Discrete pproximtion of proilistic utomt,1/2,1/2,1/2,1/2 Argule: optiml rechility proility not continuous when N,,1/2,1/2 u d d F N, σ, P σ ( F N ) = 1. In the PA, the mximum proility to rech F is.5. u Good news? hope for lterntive more decidle semntics for PA Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

68 Thnks for your ttention! Controlling popultion of MDP Nthlie Bertrnd Mysore, Ferury 2nd / 20

Chapter 3: The Reinforcement Learning Problem. The Agent'Environment Interface. Getting the Degree of Abstraction Right. The Agent Learns a Policy

Chapter 3: The Reinforcement Learning Problem. The Agent'Environment Interface. Getting the Degree of Abstraction Right. The Agent Learns a Policy Chpter 3: The Reinforcement Lerning Problem The Agent'Environment Interfce Objectives of this chpter: describe the RL problem we will be studying for the reminder of the course present idelized form of

More information

INF 4130 Exercise set 4

INF 4130 Exercise set 4 INF 4130 Exercise set 4 Exercise 1 List the order in which we extrct the nodes from the Live Set queue when we do redth first serch of the following grph (tree) with the Live Set implemented s LIFO queue.

More information

9.3. Regular Languages

9.3. Regular Languages 9.3. REGULAR LANGUAGES 139 9.3. Regulr Lnguges 9.3.1. Properties of Regulr Lnguges. Recll tht regulr lnguge is the lnguge ssocited to regulr grmmr, i.e., grmmr G = (N, T, P, σ) in which every production

More information

ASYMMETRIC SWITCHING COSTS CAN IMPROVE THE PREDICTIVE POWER OF SHY S MODEL

ASYMMETRIC SWITCHING COSTS CAN IMPROVE THE PREDICTIVE POWER OF SHY S MODEL Document de trvil 2012-14 / April 2012 ASYMMETRIC SWITCHIG COSTS CA IMPROVE THE PREDICTIVE POWER OF SHY S MODEL Evens Slies OFCE-Sciences-Po Asymmetric switching costs cn improve the predictive power of

More information

Cache CPI and DFAs and NFAs. CS230 Tutorial 10

Cache CPI and DFAs and NFAs. CS230 Tutorial 10 Cche CPI nd DFAs nd NFAs CS230 Tutoril 10 Multi-Level Cche: Clculting CPI When memory ccess is ttempted, wht re the possible results? ccess miss miss CPU L1 Cche L2 Cche Memory L1 cche hit L2 cche hit

More information

Effects of Entry Restriction on Free Entry General Competitive Equilibrium. Mitsuo Takase

Effects of Entry Restriction on Free Entry General Competitive Equilibrium. Mitsuo Takase CAES Working Pper Series Effects of Entry Restriction on Free Entry Generl Competitive Euilirium Mitsuo Tkse Fculty of Economics Fukuok University WP-2018-006 Center for Advnced Economic Study Fukuok University

More information

Continuous Optimal Timing

Continuous Optimal Timing Srlnd University Computer Science, Srbrücken, Germny My 6, 205 Outline Motivtion Preliminries Existing Algorithms Our Algorithm Empiricl Evlution Conclusion Motivtion Probbilistic models unrelible/unpredictble

More information

What is Monte Carlo Simulation? Monte Carlo Simulation

What is Monte Carlo Simulation? Monte Carlo Simulation Wht is Monte Crlo Simultion? Monte Crlo methods re widely used clss of computtionl lgorithms for simulting the ehvior of vrious physicl nd mthemticl systems, nd for other computtions. Monte Crlo lgorithm

More information

A ppendix to. I soquants. Producing at Least Cost. Chapter

A ppendix to. I soquants. Producing at Least Cost. Chapter A ppendix to Chpter 0 Producing t est Cost This ppendix descries set of useful tools for studying firm s long-run production nd costs. The tools re isoqunts nd isocost lines. I soqunts FIGURE A0. SHOWS

More information

Reinforcement Learning. CS 188: Artificial Intelligence Fall Grid World. Markov Decision Processes. What is Markov about MDPs?

Reinforcement Learning. CS 188: Artificial Intelligence Fall Grid World. Markov Decision Processes. What is Markov about MDPs? CS 188: Artificil Intelligence Fll 2010 Lecture 9: MDP 9/2/2010 Reinforcement Lerning [DEMOS] Bic ide: Receive feedbck in the form of rewrd Agent utility i defined by the rewrd function Mut (lern to) ct

More information

Pushdown Automata. Courtesy: Costas Busch RPI

Pushdown Automata. Courtesy: Costas Busch RPI Pushdown Automt Courtesy: Costs Busch RPI Pushdown Automt Pushdown Automt Pushdown Automt Pushdown Automt Pushdown Automt Pushdown Automt Non-Determinism:NPDA PDAs re non-deterministic: non-deterministic

More information

Buckling of Stiffened Panels 1 overall buckling vs plate buckling PCCB Panel Collapse Combined Buckling

Buckling of Stiffened Panels 1 overall buckling vs plate buckling PCCB Panel Collapse Combined Buckling Buckling of Stiffened Pnels overll uckling vs plte uckling PCCB Pnel Collpse Comined Buckling Vrious estimtes hve een developed to determine the minimum size stiffener to insure the plte uckles while the

More information

A Closer Look at Bond Risk: Duration

A Closer Look at Bond Risk: Duration W E B E X T E S I O 4C A Closer Look t Bond Risk: Durtion This Extension explins how to mnge the risk of bond portfolio using the concept of durtion. BOD RISK In our discussion of bond vlution in Chpter

More information

DYNAMIC PROGRAMMING REINFORCEMENT LEARNING. COGS 202 : Week 7 Presentation

DYNAMIC PROGRAMMING REINFORCEMENT LEARNING. COGS 202 : Week 7 Presentation DYNAMIC PROGRAMMING REINFORCEMENT LEARNING COGS 202 : Week 7 Preenttion OUTLINE Recp (Stte Vlue nd Action Vlue function) Computtion in MDP Dynmic Progrmming (DP) Policy Evlution Policy Improvement Policy

More information

3: Inventory management

3: Inventory management INSE6300 Ji Yun Yu 3: Inventory mngement Concordi Februry 9, 2016 Supply chin mngement is bout mking sequence of decisions over sequence of time steps, fter mking observtions t ech of these time steps.

More information

Gridworld Values V* Gridworld: Q*

Gridworld Values V* Gridworld: Q* CS 188: Artificil Intelligence Mrkov Deciion Procee II Intructor: Dn Klein nd Pieter Abbeel --- Univerity of Cliforni, Berkeley [Thee lide were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI

More information

Choice of strategic variables under relative profit maximization in asymmetric oligopoly

Choice of strategic variables under relative profit maximization in asymmetric oligopoly Economics nd Business Letters () 5-6 04 Choice of strtegic vriles under reltive profit mximiztion in symmetric oligopoly Atsuhiro Stoh Ysuhito Tnk * Fculty of Economics Doshish University Kyoto Jpn Received:

More information

1 Manipulation for binary voters

1 Manipulation for binary voters STAT 206A: Soil Choie nd Networks Fll 2010 Mnipultion nd GS Theorem Otoer 21 Leturer: Elhnn Mossel Srie: Kristen Woyh In this leture we over mnipultion y single voter: whether single voter n lie out his

More information

Optimal Revenue-Sharing Double Auctions with Applications to Ad Exchanges

Optimal Revenue-Sharing Double Auctions with Applications to Ad Exchanges Optiml Revenue-Shring Doule Auctions with Applictions to Ad Exchnges Rento Gomes Toulouse School of Economics rento.gomes@tse-fr.eu Vh Mirrokni Google Reserch, ew York mirrokni@google.com ABSTRACT E-commerce

More information

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics BERTRAND VS. COURNOT COMPETITION IN ASYMMETRIC DUOPOLY: THE ROLE OF LICENSING

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics BERTRAND VS. COURNOT COMPETITION IN ASYMMETRIC DUOPOLY: THE ROLE OF LICENSING UNIVERSITY OF NOTTINGHAM Discussion Ppers in Economics Discussion Pper No. 0/0 BERTRAND VS. COURNOT COMPETITION IN ASYMMETRIC DUOPOLY: THE ROLE OF LICENSING by Arijit Mukherjee April 00 DP 0/0 ISSN 160-48

More information

Addition and Subtraction

Addition and Subtraction Addition nd Subtrction Nme: Dte: Definition: rtionl expression A rtionl expression is n lgebric expression in frction form, with polynomils in the numertor nd denomintor such tht t lest one vrible ppers

More information

THE FINAL PROOF SUPPORTING THE TURNOVER FORMULA.

THE FINAL PROOF SUPPORTING THE TURNOVER FORMULA. THE FINAL PROOF SUPPORTING THE TURNOVER FORMULA. I would like to thnk Aris for his mthemticl contriutions nd his swet which hs enled deeper understnding of the turnover formul to emerge. His contriution

More information

A portfolio approach to the optimal funding of pensions

A portfolio approach to the optimal funding of pensions Economics Letters 69 (000) 01 06 www.elsevier.com/ locte/ econbse A portfolio pproch to the optiml funding of pensions Jysri Dutt, Sndeep Kpur *, J. Michel Orszg b, b Fculty of Economics University of

More information

Outline. CS 188: Artificial Intelligence Spring Speeding Up Game Tree Search. Minimax Example. Alpha-Beta Pruning. Pruning

Outline. CS 188: Artificial Intelligence Spring Speeding Up Game Tree Search. Minimax Example. Alpha-Beta Pruning. Pruning CS 188: Artificil Intelligence Spring 2011 Lecture 8: Gme, MDP 2/14/2010 Pieter Abbeel UC Berkeley Mny lide dpted from Dn Klein Outline Zero-um determinitic two plyer gme Minimx Evlution function for non-terminl

More information

Autarky more likely than complete specialization

Autarky more likely than complete specialization Autrky more likely thn complete specilition Antonio Quesd Deprtment d Economi, Universitt Rovir i Virgili, Avingud de l Universitt, 4304 Reus, Spin 3th Jnury 00 38.9 Astrct This pper mesures the strength

More information

Suffix Trees. Outline. Introduction Suffix Trees (ST) Building STs in linear time: Ukkonen s algorithm Applications of ST.

Suffix Trees. Outline. Introduction Suffix Trees (ST) Building STs in linear time: Ukkonen s algorithm Applications of ST. Suffi Trees Outline Introduction Suffi Trees (ST) Building STs in liner time: Ukkonen s lgorithm Applictions of ST 2 Introduction 3 Sustrings String is ny sequence of chrcters. Sustring of string S is

More information

The IndoDairy Smallholder Household Survey From Farm-to-Fact

The IndoDairy Smallholder Household Survey From Farm-to-Fact The Centre for Glol Food nd Resources The IndoDiry Smllholder Household Survey From Frm-to-Fct Fctsheet 7: Diry Frming Costs, Revenue nd Profitility Bckground This fctsheet uilds on the informtion summrised

More information

Research Article Existence of Positive Solution to Second-Order Three-Point BVPs on Time Scales

Research Article Existence of Positive Solution to Second-Order Three-Point BVPs on Time Scales Hindwi Publishing Corportion Boundry Vlue Problems Volume 2009, Article ID 685040, 6 pges doi:10.1155/2009/685040 Reserch Article Existence of Positive Solution to Second-Order hree-point BVPs on ime Scles

More information

Pricing Resources on Demand

Pricing Resources on Demand Pricing Resources on Demnd Costs Courcouetis, Sergios Soursos nd Richrd Weer Athens University of Economics nd Business Emil: courcou, sns@ue.gr University of Cmridge Emil: rrw@sttsl.cm.c.uk Astrct Trditionl

More information

Lecture 9: The E/R Model II. 2. E/R Design Considerations 2/7/2018. Multiplicity of E/R Relationships. What you will learn about in this section

Lecture 9: The E/R Model II. 2. E/R Design Considerations 2/7/2018. Multiplicity of E/R Relationships. What you will learn about in this section Leture 9: The E/R Moel II Leture n tivity ontents re se on wht Prof Chris Ré use in his CS 45 in the fll 06 term with permission.. E/R Design Consiertions Wht you will lern out in this setion Multipliity

More information

Roma December 2008 Cadastre and agriculture subsidies : the Spanish experience

Roma December 2008 Cadastre and agriculture subsidies : the Spanish experience Cdstre nd griculture susidies : the Spnish experience Evolution of the Common Agriculturl Policy (CAP), The role of Cdstre The LPIS nd the SIGPAC Towrds Interoperility Evolution of Common Agriculturl Policy

More information

Edgeworth box. apples. F-f. A-a. trade. f f F. fig leaves

Edgeworth box. apples. F-f. A-a. trade. f f F. fig leaves Chpters 9 nd 1 pples Edgeworth box 9.4.1 F-f trde A- A f f F fig leves pples Edgeworth box 9.4.1 F-f trde A- A Adm gets (f,) Eve gets (F-f, A-) f f F fig leves pples Edgeworth box 9.4.1 F-f endowment A-

More information

164 CHAPTER 2. VECTOR FUNCTIONS

164 CHAPTER 2. VECTOR FUNCTIONS 164 CHAPTER. VECTOR FUNCTIONS.4 Curvture.4.1 Definitions nd Exmples The notion of curvture mesures how shrply curve bends. We would expect the curvture to be 0 for stright line, to be very smll for curves

More information

CH 71 COMPLETING THE SQUARE INTRODUCTION FACTORING PERFECT SQUARE TRINOMIALS

CH 71 COMPLETING THE SQUARE INTRODUCTION FACTORING PERFECT SQUARE TRINOMIALS CH 7 COMPLETING THE SQUARE INTRODUCTION I t s now time to py our dues regrding the Qudrtic Formul. Wht, you my sk, does this men? It mens tht the formul ws merely given to you once or twice in this course,

More information

Long-term Memory Review PROFICIENCY PRACTICE: MONDAY REVIEW

Long-term Memory Review PROFICIENCY PRACTICE: MONDAY REVIEW PROFICINCY PRACTIC: MONDAY RVIW : A D 14 cm B 21 cm C 2) Use : The tringles in the figure ove re similr. ) nd re mesures of corresponding sides. ) nd re mesures of nother pir of corresponding sides. 3)

More information

Decision Making Under Uncertainty

Decision Making Under Uncertainty CSC384: Intro to Artificil Intelligence Preferences Decision Mking Under Uncertinty Decision Trees DBN: 15.1 nd 15.5 Decision Network: 16.1,16.2,16.5,16.6 I give root plnning prolem: I wnt coffee ut coffee

More information

Today s Outline. One More Operation. Priority Queues. New Operation: Merge. Leftist Heaps. Priority Queues. Admin: Priority Queues

Today s Outline. One More Operation. Priority Queues. New Operation: Merge. Leftist Heaps. Priority Queues. Admin: Priority Queues Tody s Outline Priority Queues CSE Dt Structures & Algorithms Ruth Anderson Spring 4// Admin: HW # due this Thursdy / t :9pm Printouts due Fridy in lecture. Priority Queues Leftist Heps Skew Heps 4// One

More information

Non-Deterministic Search. CS 188: Artificial Intelligence Markov Decision Processes. Grid World Actions. Example: Grid World

Non-Deterministic Search. CS 188: Artificial Intelligence Markov Decision Processes. Grid World Actions. Example: Grid World CS 188: Artificil Intelligence Mrkov Deciion Procee Non-Determinitic Serch Dn Klein, Pieter Abbeel Univerity of Cliforni, Berkeley Exmple: Grid World Grid World Action A mze-like problem The gent live

More information

Outline. CSE 326: Data Structures. Priority Queues Leftist Heaps & Skew Heaps. Announcements. New Heap Operation: Merge

Outline. CSE 326: Data Structures. Priority Queues Leftist Heaps & Skew Heaps. Announcements. New Heap Operation: Merge CSE 26: Dt Structures Priority Queues Leftist Heps & Skew Heps Outline Announcements Leftist Heps & Skew Heps Reding: Weiss, Ch. 6 Hl Perkins Spring 2 Lectures 6 & 4//2 4//2 2 Announcements Written HW

More information

3/1/2016. Intermediate Microeconomics W3211. Lecture 7: The Endowment Economy. Today s Aims. The Story So Far. An Endowment Economy.

3/1/2016. Intermediate Microeconomics W3211. Lecture 7: The Endowment Economy. Today s Aims. The Story So Far. An Endowment Economy. 1 Intermedite Microeconomics W3211 Lecture 7: The Endowment Economy Introduction Columbi University, Spring 2016 Mrk Den: mrk.den@columbi.edu 2 The Story So Fr. 3 Tody s Aims 4 Remember: the course hd

More information

International Monopoly under Uncertainty

International Monopoly under Uncertainty Interntionl Monopoly under Uncertinty Henry Ary University of Grnd Astrct A domestic monopolistic firm hs the option to service foreign mrket through export or y setting up plnt in the host country under

More information

Fishburn s Maximal Lotteries

Fishburn s Maximal Lotteries Csting the lot puts n end to disputes nd deides etween powerful ontenders. Solomon, Provers 18:18 Fishurn s Mximl Lotteries Felix Brndt Workshop on Deision Mking nd Contest Theory Ein Gedi, Jnury 2017

More information

Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Arithmetic nd Geometric Sequences A sequence is list of numbers or objects, clled terms, in certin order. In n rithmetic sequence, the difference between one term nd the next is lwys the sme. This difference

More information

"Multilateralism, Regionalism, and the Sustainability of 'Natural' Trading Blocs"

Multilateralism, Regionalism, and the Sustainability of 'Natural' Trading Blocs "Multilterlism, Regionlism, nd the Sustinility of 'Nturl' Trding Blocs" y Eric Bond Deprtment of Economics Penn Stte June, 1999 Astrct: This pper compres the mximum level of world welfre ttinle in n incentive

More information

Is the Armington Elasticity Really Constant across Importers?

Is the Armington Elasticity Really Constant across Importers? MPRA Munich Personl RePEc Archive Is the Armington Elsticity Relly Constnt cross Importers? Hn Yilmzudy June 2009 Online t http://mpr.u.uni-muenchen.de/15954/ MPRA Pper No. 15954, posted 30. June 2009

More information

arxiv: v2 [math.nt] 23 Sep 2008

arxiv: v2 [math.nt] 23 Sep 2008 STATISTICAL PROPERTIES OF THE CALKIN WILF TREE: REAL AN p ADIC DISTRIBUTION rxiv:8.54v [mth.nt] 3 Sep 8 GIEDRIUS ALKAUSKAS, JÖRN STEUDING Astrct. We exmine sttisticl properties of the Clkin Wilf tree nd

More information

Announcements. CS 188: Artificial Intelligence Fall Reinforcement Learning. Markov Decision Processes. Example Optimal Policies.

Announcements. CS 188: Artificial Intelligence Fall Reinforcement Learning. Markov Decision Processes. Example Optimal Policies. CS 188: Artificil Intelligence Fll 2008 Lecture 9: MDP 9/25/2008 Announcement Homework olution / review eion: Mondy 9/29, 7-9pm in 2050 Vlley LSB Tuedy 9/0, 6-8pm in 10 Evn Check web for detil Cover W1-2,

More information

Synchronizing Asynchronous IOCO

Synchronizing Asynchronous IOCO Synchronizing Asynchronous IOCO Ned Noroozi 1,2, Rmtin Khosrvi 3, MohmmdRez Mousvi 1, nd Tim Willemse 1 1 Eindhoven University of Technology, Eindhoven, The Netherlnds 2 Fnp Corportion (IT Subsidiry of

More information

Static Fully Observable Stochastic What action next? Instantaneous Perfect

Static Fully Observable Stochastic What action next?  Instantaneous Perfect CS 188: Ar)ficil Intelligence Mrkov Deciion Procee K+1 Intructor: Dn Klein nd Pieter Abbeel - - - Univerity of Cliforni, Berkeley [Thee lide were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to

More information

MARKET POWER AND MISREPRESENTATION

MARKET POWER AND MISREPRESENTATION MARKET POWER AND MISREPRESENTATION MICROECONOMICS Principles nd Anlysis Frnk Cowell Note: the detil in slides mrked * cn only e seen if you run the slideshow July 2017 1 Introduction Presenttion concerns

More information

Recap: MDPs. CS 188: Artificial Intelligence Fall Optimal Utilities. The Bellman Equations. Value Estimates. Practice: Computing Actions

Recap: MDPs. CS 188: Artificial Intelligence Fall Optimal Utilities. The Bellman Equations. Value Estimates. Practice: Computing Actions CS 188: Artificil Intelligence Fll 2008 Lecture 10: MDP 9/30/2008 Dn Klein UC Berkeley Recp: MDP Mrkov deciion procee: Stte S Action A Trnition P(,) (or T(,, )) Rewrd R(,, ) (nd dicount γ) Strt tte 0 Quntitie:

More information

3. Argumentation Frameworks

3. Argumentation Frameworks 3. Argumenttion Frmeworks Argumenttion current hot topic in AI. Historiclly more recent thn other pproches discussed here. Bsic ide: to construct cceptble set(s) of beliefs from given KB: 1 construct rguments

More information

UNIT 7 SINGLE SAMPLING PLANS

UNIT 7 SINGLE SAMPLING PLANS UNIT 7 SINGLE SAMPLING PLANS Structure 7. Introduction Objectives 7. Single Smpling Pln 7.3 Operting Chrcteristics (OC) Curve 7.4 Producer s Risk nd Consumer s Risk 7.5 Averge Outgoing Qulity (AOQ) 7.6

More information

Patents, R&D investments, and Competition

Patents, R&D investments, and Competition Ptents, R&D investments, nd Competition Tois Mrkepnd June 8, 2008 Astrct We nlyze the incentives of firm to crete sleeping ptents, i.e., to tke out ptents which re not exploited. We show tht sleeping ptents

More information

A Fuzzy Inventory Model With Lot Size Dependent Carrying / Holding Cost

A Fuzzy Inventory Model With Lot Size Dependent Carrying / Holding Cost IOSR Journl of Mthemtics (IOSR-JM e-issn: 78-578,p-ISSN: 9-765X, Volume 7, Issue 6 (Sep. - Oct. 0, PP 06-0 www.iosrournls.org A Fuzzy Inventory Model With Lot Size Dependent Crrying / olding Cost P. Prvthi,

More information

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 4

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 4 CS 188 Introduction to Artificil Intelligence Fll 2018 Note 4 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Non-Deterministic Serch Picture runner, coming to the end of

More information

The Brazilian Education Quality Index (Ideb): Measurement and Incentives Upgrades

The Brazilian Education Quality Index (Ideb): Measurement and Incentives Upgrades The Brzilin duction Qulity Index (Ide): esurement nd Incentives Upgrdes rcelo Côrtes Neri nd Griel Buchmnn Astrct The incresing vilility of socil sttistics in Ltin Americ opens new possiilities in terms

More information

The Combinatorial Seller s Bid Double Auction: An Asymptotically Efficient Market Mechanism*

The Combinatorial Seller s Bid Double Auction: An Asymptotically Efficient Market Mechanism* The Combintoril Seller s Bid Double Auction: An Asymptoticlly Efficient Mret Mechnism* Rhul Jin IBM Wtson Reserch Hwthorne, NY rhul.jin@us.ibm.com Prvin Vriy EECS Deprtment University of Cliforni, Bereley

More information

Overreaction in the Australian equity market:

Overreaction in the Australian equity market: Pcific-Bsin Finnce Journl 8 2000 375 398 www.elsevier.comrloctereconse Overrection in the Austrlin equity mrket: 1974 1997 Clive Gunt ) Fculty of Business, Queenslnd UniÕersity of Technology, 2 George

More information

Divide-and-Conquer. 1. Find the maximum and minimum. The problem: Given a list of unordered n elements, find max and min

Divide-and-Conquer. 1. Find the maximum and minimum. The problem: Given a list of unordered n elements, find max and min Geerl ide: Divide-d-oquer Divide prolem ito suprogrms of the sme id; solve suprogrms usig the sme pproh, d omie prtil solutio if eessry. Youg S 5 dv. lgo. opi: Divide d oquer. Fid the mximum d miimum he

More information

Trigonometry - Activity 21 General Triangle Solution: Given three sides.

Trigonometry - Activity 21 General Triangle Solution: Given three sides. Nme: lss: p 43 Mths Helper Plus Resoure Set. opyright 003 rue. Vughn, Tehers hoie Softwre Trigonometry - tivity 1 Generl Tringle Solution: Given three sides. When the three side lengths '', '' nd '' of

More information

Option exercise with temptation

Option exercise with temptation Economic Theory 2008) 34: 473 501 DOI 10.1007/s00199-006-0194-3 RESEARCH ARTICLE Jinjun Mio Option exercise with tempttion Received: 25 Jnury 2006 / Revised: 5 December 2006 / Published online: 10 Jnury

More information

Interacting with mathematics in Key Stage 3. Year 9 proportional reasoning: mini-pack

Interacting with mathematics in Key Stage 3. Year 9 proportional reasoning: mini-pack Intercting with mthemtics in Key Stge Yer 9 proportionl resoning: mini-pck Intercting with mthemtics Yer 9 proportionl resoning: mini-pck Crown copyright 00 Contents Yer 9 proportionl resoning: smple unit

More information

Technical Appendix. The Behavior of Growth Mixture Models Under Nonnormality: A Monte Carlo Analysis

Technical Appendix. The Behavior of Growth Mixture Models Under Nonnormality: A Monte Carlo Analysis Monte Crlo Technicl Appendix 1 Technicl Appendix The Behvior of Growth Mixture Models Under Nonnormlity: A Monte Crlo Anlysis Dniel J. Buer & Ptrick J. Currn 10/11/2002 These results re presented s compnion

More information

A Static Model for Voting on Social Security

A Static Model for Voting on Social Security A Sttic Model for Voting on Socil Security Henning Bohn Deprtment of Economics University of Cliforni t Snt Brbr Snt Brbr, CA 93106, USA; nd CESifo Phone: 1-805-893-4532; Fx: 1-805-893-8830. E-mil: bohn@econ.ucsb.edu

More information

Chapter 2: Relational Model. Chapter 2: Relational Model

Chapter 2: Relational Model. Chapter 2: Relational Model Chpter : Reltionl Model Dtbse System Concepts, 5 th Ed. See www.db-book.com for conditions on re-use Chpter : Reltionl Model Structure of Reltionl Dtbses Fundmentl Reltionl-Algebr-Opertions Additionl Reltionl-Algebr-Opertions

More information

Drawing Finite State Machines in L A TEX and TikZ A Tutorial

Drawing Finite State Machines in L A TEX and TikZ A Tutorial Drwing Finite Stte Mchines in L A TEX nd TikZ A Tutoril Styki Sikdr nd Dvid Ching ssikdr@nd.edu Version 3 Jnury 7, 208 Introduction L A TEX (pronounced ly-tek) is n open-source, multipltform document preprtion

More information

Time Inconsistent Resource Conservation Contracts

Time Inconsistent Resource Conservation Contracts ime Inconsistent Resource Conservtion Contrcts Sumeet Gulti nd Jmes Vercmmen July 21, 2005 Working Pper Numer: 2005-02 Food nd Resource Economics, University of British Columi Vncouver, Cnd, V6 1Z4 http://www.gsci.uc.c/fre

More information

Lower Tax For Minimum Wage Earners

Lower Tax For Minimum Wage Earners Lower Tx For Minimum Wge Erners Jim Jin nd Felix FitzRoy School of Economics nd Finnce Online Discussion Pper Series issn 2055-303X http://ides.repec.org/s/sn/wpecon.html info: econ@st-ndrews.c.uk School

More information

Lecture 6 Phylogenetic Analysis. Algorithm. Types of Data. UPGMA Neighbor Joining. Minimum Evolution

Lecture 6 Phylogenetic Analysis. Algorithm. Types of Data. UPGMA Neighbor Joining. Minimum Evolution Leture 6 Phylogeneti Anlysis Algorithms Types of Dt Distnes Nuleotie sites Tree-uiling Metho Clustering Algorithm Optimlity Criterion UPGMA Neighor Joining Minimum Evolution Mximum Prsimony Mximum Likelihoo

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: MDPs. Recap: Optimal Utilities. Practice: Computing Actions. Recap: Bellman Equations

Announcements. CS 188: Artificial Intelligence Fall Recap: MDPs. Recap: Optimal Utilities. Practice: Computing Actions. Recap: Bellman Equations CS 188: Artificil Intelligence Fll 2009 Lecture 10: MDP 9/29/2009 Announcement P2: Due Wednedy P3: MDP nd Reinforcement Lerning i up! W2: Out lte thi week Dn Klein UC Berkeley Mny lide over the coure dpted

More information

The Combinatorial Seller s Bid Double Auction: An Asymptotically Efficient Market Mechanism*

The Combinatorial Seller s Bid Double Auction: An Asymptotically Efficient Market Mechanism* The Combintoril Seller s Bid Double Auction: An Asymptoticlly Efficient Mret Mechnism* Rhul Jin nd Prvin Vriy EECS Deprtment University of Cliforni, Bereley (rjin,vriy)@eecs.bereley.edu We consider the

More information

On the Complexity of Computing the Justification Status of an Argument

On the Complexity of Computing the Justification Status of an Argument On the Complexity of Computing the Justifiction Sttus of n Argument dbi Reserch Seminr, Vienn Wolfgng Dvořák Institute of Informtion Systems, Vienn University of Technology Oct 13, 2011 Supported by the

More information

Ratio and Proportion Long-Term Memory Review Day 1 - Review

Ratio and Proportion Long-Term Memory Review Day 1 - Review Rtio nd Proportion Dy 1 - Review 1. Provide omplete response to eh of the following: ) A rtio ompres two. ) A proportion sets two rtios to eh other. ) Wht re similr figures? 2. Drw two similr figures.

More information

A Theoretical and FEM. Curved Beams. Investigation. Christian Wylonis. Nathan Thielen ES240

A Theoretical and FEM. Curved Beams. Investigation. Christian Wylonis. Nathan Thielen ES240 Curved Bems A Theoreticl nd FEM Investigtion Nthn Thielen Christin Wylonis ES240 Wht re Curved Bems? A bem is curved if the line formed by the centroids of ll the cross sections is not stright. http://www.timyoung.net/contrst/imges/chin02.jpg

More information

JFE Online Appendix: The QUAD Method

JFE Online Appendix: The QUAD Method JFE Online Appendix: The QUAD Method Prt of the QUAD technique is the use of qudrture for numericl solution of option pricing problems. Andricopoulos et l. (00, 007 use qudrture s the only computtionl

More information

UNinhabited aerial vehicles (UAVs) are becoming increasingly

UNinhabited aerial vehicles (UAVs) are becoming increasingly A Process Algebr Genetic Algorithm Sertc Krmn Tl Shim Emilio Frzzoli Abstrct A genetic lgorithm tht utilizes process lgebr for coding of solution chromosomes nd for defining evolutionry bsed opertors is

More information

Problem Set for Chapter 3: Simple Regression Analysis ECO382 Econometrics Queens College K.Matsuda

Problem Set for Chapter 3: Simple Regression Analysis ECO382 Econometrics Queens College K.Matsuda Problem Set for Chpter 3 Simple Regression Anlysis ECO382 Econometrics Queens College K.Mtsud Excel Assignments You re required to hnd in these Excel Assignments by the due Mtsud specifies. Legibility

More information

INF 4130 Exercise set 5, 2017 w/ solutions

INF 4130 Exercise set 5, 2017 w/ solutions INF 4130 Execise set 5, 2017 w/ solutions Execise 1 List the oe in which we extct the noes fom the Live Set queue when we o eth fist sech of the following gph (tee) with the Live Set implemente s LIFO

More information

Smart Investment Strategies

Smart Investment Strategies Smrt Investment Strtegies Risk-Rewrd Rewrd Strtegy Quntifying Greed How to mke good Portfolio? Entrnce-Exit Exit Strtegy: When to buy? When to sell? 2 Risk vs.. Rewrd Strtegy here is certin mount of risk

More information

Roadmap of This Lecture

Roadmap of This Lecture Reltionl Model Rodmp of This Lecture Structure of Reltionl Dtbses Fundmentl Reltionl-Algebr-Opertions Additionl Reltionl-Algebr-Opertions Extended Reltionl-Algebr-Opertions Null Vlues Modifiction of the

More information

Chapter 4. Profit and Bayesian Optimality

Chapter 4. Profit and Bayesian Optimality Chpter 4 Profit nd Byesin Optimlity In this chpter we consider the objective of profit. The objective of profit mximiztion dds significnt new chllenge over the previously considered objective of socil

More information

Maximum Expected Utility. CS 188: Artificial Intelligence Fall Preferences. MEU Principle. Rational Preferences. Utilities: Uncertain Outcomes

Maximum Expected Utility. CS 188: Artificial Intelligence Fall Preferences. MEU Principle. Rational Preferences. Utilities: Uncertain Outcomes CS 188: Artificil Intelligence Fll 2011 Mximum Expected Utility Why hould we verge utilitie? Why not minimx? Lecture 8: Utilitie / MDP 9/20/2011 Dn Klein UC Berkeley Principle of mximum expected utility:

More information

Package ph2bye. August 21, 2016

Package ph2bye. August 21, 2016 Type Pckge Pckge ph2ye August 21, 2016 Title Phse II Clinicl Tril Design Using Byesin Methods Version 0.1.4 Author Ylin Zhu, Rui Qin Mintiner Ylin Zhu Clculte the Byesin posterior/predictive

More information

Multi-Step Reinforcement Learning: A Unifying Algorithm

Multi-Step Reinforcement Learning: A Unifying Algorithm Multi-Step Reinforcement Lerning: A Unifying Algorithm Kristopher De Asis, 1 J. Fernndo Hernndez-Grci, 1 G. Zchris Hollnd, 1 Richrd S. Sutton Reinforcement Lerning nd Artificil Intelligence Lbortory, University

More information

(a) by substituting u = x + 10 and applying the result on page 869 on the text, (b) integrating by parts with u = ln(x + 10), dv = dx, v = x, and

(a) by substituting u = x + 10 and applying the result on page 869 on the text, (b) integrating by parts with u = ln(x + 10), dv = dx, v = x, and Supplementry Questions for HP Chpter 5. Derive the formul ln( + 0) d = ( + 0) ln( + 0) + C in three wys: () by substituting u = + 0 nd pplying the result on pge 869 on the tet, (b) integrting by prts with

More information

International Budget Partnership OPEN BUDGET QUESTIONNAIRE POLAND

International Budget Partnership OPEN BUDGET QUESTIONNAIRE POLAND Interntionl Budget Prtnership OPEN BUDGET QUESTIONNAIRE POLAND September 28, 2007 Interntionl Budget Prtnership Center on Budget nd Policy Priorities 820 First Street, NE Suite 510 Wshington, DC 20002

More information

Input suppliers, differential pricing and information sharing agreements

Input suppliers, differential pricing and information sharing agreements nput suppliers, differentil pricing nd informtion shring greements Anthony rene Deprtment of Economics Michign tte University Est Lnsing, Michign 48824 rene@msu.edu t is common for firms to systemticlly

More information

A comparison of quadratic discriminant function with discriminant function based on absolute deviation from the mean

A comparison of quadratic discriminant function with discriminant function based on absolute deviation from the mean A comprison of qudrtic discriminnt function with discriminnt function bsed on bsolute devition from the men S. Gneslingm 1, A. Nnthkumr Siv Gnesh 1, 1 Institute of Informtion Sciences nd Technology College

More information

E-Merge Process Table (Version 1)

E-Merge Process Table (Version 1) E-Merge Proess Tle (Version 1) I 1 Indiies Trgets Stte Energy Environmentl ESTABLISHING GOALS & BASELINES Identify gols from stte energy offie perspetive Identify stte puli helth nd welfre gols ffeted

More information

Chapter55. Algebraic expansion and simplification

Chapter55. Algebraic expansion and simplification Chpter55 Algebric expnsion nd simplifiction Contents: A The distributive lw B The product ( + b)(c + d) C Difference of two squres D Perfect squres expnsion E Further expnsion F The binomil expnsion 88

More information

8.1 External solid plastering

8.1 External solid plastering 8.1 Externl solid plstering Aims nd ojectives At the end of these ctivity sheets, lerners should e le to: understnd the preprtion of ckgrounds identify the mterils used for externl plstering identify the

More information

A Short Introduction to Abstract Argumentation Frameworks

A Short Introduction to Abstract Argumentation Frameworks A Short Introduction to Abstrct Argumenttion Frmeworks Stefn Woltrn Technische Universität Wien Gerhrd Brewk Universität Leipzig November 2009 () Abstrct Argumenttion Frmeworks November 2009 1 / 20 Argumenttion

More information

BEFORE THE ENVIRONMENT COURT

BEFORE THE ENVIRONMENT COURT BEFORE THE ENVIRONMENT COURT I MUA I TE KOOTI TAIAO O AOTEAROA ENV-2018-AKL-000078 Under the Resource Mngement Act 1991 (the Act) In the mtter of direct referrl of n ppliction for resource consent for

More information

Fully Observable. Perfect

Fully Observable. Perfect CS 188: Ar)ficil Intelligence Mrkov Deciion Procee II Stoch)c Plnning: MDP Sttic Environment Fully Obervble Perfect Wht ction next? Stochtic Intntneou Intructor: Dn Klein nd Pieter Abbeel - - - Univerity

More information

Does Population Aging Represent a Crisis for Rich Societies?

Does Population Aging Represent a Crisis for Rich Societies? First drft Does Popultion Aging Represent Crisis for Rich Societies? by Gry Burtless THE BROOKINGS INSTITUTION Jnury 2002 This pper ws prepred for session of the nnul meetings of the Americn Economic Assocition

More information

arxiv: v1 [cs.lg] 23 Jan 2019

arxiv: v1 [cs.lg] 23 Jan 2019 Robust temporl difference lerning for criticl domins rxiv:1901.08021v1 [cs.lg] 23 Jn 2019 Richrd Klim University of Liverpool, UK richrd.klim@liverpool.c.uk Michel Kisers Centrum Wiskunde & Informtic,

More information

Grain Marketing: Using Balance Sheets

Grain Marketing: Using Balance Sheets 1 Fct Sheet 485 Grin Mrketing: Using Blnce Sheets Introduction Grin lnce sheets re estimtes of supply nd demnd. They re the key to understnding the grin mrkets. A grin frmer who understnds how to interpret

More information

AS and A Level Economics A

AS and A Level Economics A AS nd A Level Economics A Getting Strted Guide Person Edexcel Level 3 Advnced GCE in Economics A (9EC0) Person Edexcel Level 3 Advnced Susidiry GCE in Economics A (8EC0) Getting Strted: AS nd A level Economics

More information

CHAPTER-IV PRE-TEST ESTIMATOR OF REGRESSION COEFFICIENTS: PERFORMANCE UNDER LINEX LOSS FUNCTION

CHAPTER-IV PRE-TEST ESTIMATOR OF REGRESSION COEFFICIENTS: PERFORMANCE UNDER LINEX LOSS FUNCTION CHAPTER-IV PRE-TEST ESTIMATOR OF REGRESSION COEFFICIENTS: PERFORMANCE UNDER LINEX LOSS FUNCTION 4.1 INTRODUCTION It hs lredy been demonstrted tht the restricted lest squres estimtor is more efficient thn

More information