Epistemic Foundations of Game Theory. Lecture 1

Size: px
Start display at page:

Download "Epistemic Foundations of Game Theory. Lecture 1"

Transcription

1 Royal Nthrlands cadmy of rts and Scncs (KNW) Mastr Class mstrdam, Fbruary 8th, 2007 Epstmc Foundatons of Gam Thory Lctur Gacomo onanno (

2 QUESTION: What stratgs can b chosn by ratonal playrs who know th structur of th gam and th prfrncs of thr opponnts and who rcognz ach othr s ratonalty and knowldg? Kywords: knowldg, ratonalty, rcognton of ach othr s knowldg and ratonalty 2

3 Modular approach Modul : rprsntaton of blf and knowldg of an ndvdual (Hntkka, 962; Krpk, 963). Modul 2: xtnson to many ndvduals. Common blf and common knowldg ( rcognton of ach othr s blf / knowldg ) Modul 3: dfnton of ratonalty n gams (rlatonshp btwn choc and blfs) QUESTION: what ar th mplcatons of ratonalty and common blf of ratonalty n gams? 3

4 Modul rprsntaton of blfs and knowldg of an ndvdual α β Fnt st of stats Ω and a bnary rlaton on Ω. mans at stat α th ndvdual consdrs stat β possbl Notaton: ( ω ) = { ω Ω : ω ω } st of stats consdrd possbl at ω PROPERTIES ω, ω Ω,. ( ω) sralty 2. f ω ( ω) thn ( ω ) ( ω) transtvty 3. f ω ( ω) thn ( ω) ( ω ) ucldanns 4

5 Ω lf oprator on vnts: : 2 2 For E Ω, ω E f and only f ( ω) E Ω EXMPLE: p p p p α β γ δ ( α) = ( β ) = { α, β} ( γ ) = ( δ ) = { δ} Lt E = { β, δ} : th vnt that rprsnts th proposton Thn E = { γ, δ} p 5

6 Proprts of th blf oprator: E Ω. E E (consstncy: follows from sralty of ) 2. E E (postv ntrospcton: follows from transtvty of ) 3. E E (ngatv ntrospcton: follows from ucldannss of ) Mstakn blfs ar possbl: at γ p s fals but th ndvdual blvs p p p p p α β γ δ If E = { β, δ}, thn γ E but γ E = { γ, δ} 6

7 KNOWLEDGE If - n addton to th prvous proprts - th "doxastc accssblty" rflxv quvalnc rlaton s ( ω Ω, ω ( ω)) thn t s an rlaton - gvng rs to a partton of th st of stats - and th assocatd blf oprator satsfs th addtonal proprty that E Ω, E E (blfs ar corrct). In ths cas w spak of and th assocatd oprator s dnotd by K rathr than knowldg α β γ 7

8 Modul 2 ntractv blf and common blf St of ndvduals Ν and a bnary rlaton for vry N 2 α β γ δ p p p p Lt E = { α, β, γ} : th vnt that rprsnts th proposton p Thn K E = { α, β, γ}, K E = { α, β} 2 K K E = { α}, K K K E =

9 n vnt E s commonly blvd f () vrybody blvs t, (2) vrybody blvs that vrybody blvs t, (3) vrybody blvs that vrybody blvs that vrybody blvs t, tc. Dfn th vrybody blvs oprator as follows: E = E 2 E... ne Th common blf oprator * s dfnd as follows: * E = E E E... 9

10 Lt b th transtv closur of... Thus ω * 2 * ( ω) f and only f thr xsts a squnc ω,..., ω n Ω such that () (2) n m ω = ω ω = ω (3) for vry j =,..., m thr xsts an ndvdual N such that ω ( ω ) j+ j n : ( α) = ( β ) = { α}, ( γ ) = { γ} α β γ 2 : ( α) = { α}, ( β ) = ( γ ) = { β, γ} α β γ * : ( α) = { α}, ( β ) = ( γ ) = { α, β, γ} * * * 0

11 PROPOSITION. ω E f and only f ( ω) E. * * p p p : α β γ 2 : α β γ * : Lt E = { β, γ} : th vnt that rprsnts th proposton Thn E = { γ}, E = { β, γ}, 2 E = In fact, whl γ E = { γ}, γ E = 2 2 * p

12 Modul 3 Modls of gams and Ratonalty Dfnton. fnt stratgc-form gam wth ordnal payoffs s a quntupl { } { } N, S, O,, z N N = {,..., n} s a st of playrs N S s a fnt st of stratgs or chocs of playr N O s a st of outcoms s playr 's ordrng of O ( o o mans that, for playr, outcom o s at last as good as outcom o ) z : S O (whr S = S... S ) assocats an outcom wth vry stratgy profl s S n 2

13 Dfnton. Gvn a stratgc-form gam wth ordnal payoffs { } { } N, S, O,, z N N a rducd form of t s a trpl { } { } N, S, u N N whr u : S R s such that u ( s) u ( s ) f and only f z( s) z( s ) playr s utlty functon Playr 2 f g Playr 2 f g P l a y r C 3, 2 2, 3, 2 3, 2, 2, 2 0, 3, 4, SME S P l a y r C 9, 6 4, 9 2, 5 6, 4 3, 3 2, 5 0, 4 2, 0 8, 2 D 0, 2 0, 3, 3 D, 0 0, 8, 8 3

14 Dfnton. n pstmc modl of a stratgc-form gam s an ntractv blf structur togthr wth n functons σ : Ω S ( N) Intrprtaton: σ (ω) s playr s chosn stratgy at stat ω Rstrcton: f ω ( ω) thn σ ( ω ) = σ ( ω) (no playr has mstakn blfs about hr own stratgy) 4

15 Playr 2 EXMPLE f g P l a y r C 3, 2 2, 3, 2 3, 2, 2, 2 0, 3, 4, D 0, 2 0, 3, 3 2 α β γ δ 's stratgy: 2's stratgy: C C D f f g g t vry stat ach playr knows hs own stratgy t stat β playr plays C (h knows ths) not knowng whthr playr 2 s playng f or g and playr 2 plays f (sh knows ths) not knowng whthr playr s playng or C 5

16 RTIONLITY Non-probablstc (no xpctd utlty) and vry wak noton of ratonalty Dfnton. Playr s IRRTIONL at stat ω f thr s a stratgy s (of playr ) whch sh blvs to b bttr than σ (ω) (that s, f sh blvs that sh can do bttr wth anothr stratgy) Playr s RTIONL at stat ω f and only f sh s not rratonal Playr 2 f g 2 's stratgy: α β γ δ C C D P l a y r C 3, 2 2, 3, 2 3, 2, 2, 2 0, 3, 4, 2's stratgy: f f g g D 0, 2 0, 3, 3 Playr s ratonal at stat β 6

17 s Lt s and t b two stratgs of playr : s, t S t s ntrprtd as stratgy s s bttr for playr than stratgy t s t s tru at stat ω f u ( s, σ ( ω)) u ( t, σ ( ω)) > that s, s s bttr than t aganst σ (ω ) Playr 2 E F G profl of stratgs chosn by th playrs othr than 's stratgy: 2's stratgy: α β γ C C E F G P l a y r C 3, 2 2, 3, 2, 2, 2 0, 2 0, 3, 4, C C C C C C E 2 F F 2 G F 2 G tc. 7

18 { ω σ ω σ ω } Lt s t = Ω : u ( s, ( )) > u ( t, ( )) vnt that s s bttr than t If s S, lt s { ω : σ ( ω) s} = Ω = vnt that playr chooss s Lt R b th vnt rprsntng th proposton playr s ratonal s t s R = R ( s ) t s s S t S R = R... R all playrs ar ratonal n 8

19 Playr 2 f g 2 's stratgy: 2's stratgy: α β γ δ C C D f f g g P l a y r C D 3, 2 2, 3, 2 0, 2 3, 2, 2, 2 0, 3 0, 3, 4,, 3 R R R R R2 KR2 R2 R2 R2 KR2 KR2 KR2 K2R K2R K2R K2R KK2R KK2R KK2R KK2R R K = { α, β, γ}, R = { α, β, γ, δ} 2 R = { α, β, γ, δ}, K R = { α, β} 2 2 K K R = { α}, K K K R = K2KK2R t stat α thr s mutual knowldg of ratonalty but not common knowldg of ratonalty 9

20 Lt S = S... S S... S st of stratgy profls of all playrs xcpt + n Dfnton. Lt s, t S. W say that t s strctly domnatd by s f u ( t, s ) < u ( s, s ) for all s S ITERTED DELETION OF STRICTLY DOMINTED STRTEGIES Playr 2 f g Playr 2 f g P l a y r C 3, 2 2, 3, 2 3, 2, 2, 2 0, 3, 4, C 3, 2 2, 3, 2 3, 2, 2, 2 0, 3, 4, D 0, 2 0, 3, 3 (by C) (by ) f 3, 2 2, 3 (by ) 3, 2 2, 3 f 3, 2, 2 (by ) 3, 2 2, 3 3, 2, 2 C, 2, 2 (by ) 20

21 Lt G b a stratgc-form gam wth ordnal payoffs and G b th gam obtand aftr applyng th procdur of Itratd Dlton of Strctly Domnatd Stratgs. Lt S dnot th stratgy profls of gam G Gvn a modl of G, lt S dnot th vnt { ω Ω : σ ( ω) S } P l a y r G C D Playr 2 f g 3, 2 3, 0, 2, 3 2, 2 3,, 2, 2 4, 0, 2 0, 3, 3 G 3, 2 2 's stratgy: S = {(, )} α β γ δ C C S = {δ} 2's stratgy: f f 2

22 PROPOSITION. R S * If at a stat t s commonly blvd that all playrs ar ratonal, thn th stratgy profl chosn at that stat blongs to th gam obtand aftr applyng th tratd dlton of strctly domnatd stratgs. Playr 2 f g 2 's stratgy: 2's stratgy: α β γ δ C C D f f g g P l a y r C D 3, 2 2, 3, 2 0, 2 3, 2, 2, 2 0, 3 0, 3, 4,, 3 R R R R R2 KR2 R2 R2 R2 KR2 KR2 K R K2R K2R K2R K2R KK2R KK2R KK2R KK2R t stat α thr cannot b 2 common knowldg of ratonalty snc σ ( α) (, ) K2KK2R 22

23 Evry normal oprator satsfs th proprty that f E F thn E F. s a normal oprator. Thus from * * t follows that R S. * * * * * * y transtvty of w hav that E Thus E * * * It follows that * for vry vnt E. R R. * R * S R S 2 's stratgy: 2's stratgy: Sam as: P l a y r C D 2, 3 α β γ δ 2 3, 2, 2 0, 2 Playr 2 f 3, 2, 2, 2 0, 3 g 0, 3, 4,, 3 's stratgy: 2's stratgy: 23

24 REMRK. In gnral t s not tru that S * R Playr 2 f g P l a y r C 3, 2 3, 0, 2, 3 2, 2 3,, 2, 2 4, 2 's stratgy: α β γ δ C C D 0, 2 0, 3, 3 2's stratgy: f f S = {δ} K * R = R K 2 = { α, δ}, R = { α, β, γ, δ} 2 R = 24

25 PROPOSITION 2. Fx a stratgc-form gam wth ordnal payoffs G and lt s S. Thn thr xsts an pstmc modl of G and a stat ω such that σ ( ω) = s and ω R. * EXMPLE P l Playr 2 f 3, 2 3, 3 2, 3 4, 2 2 α β γ δ In ths gam vry stratgy profl survvs tratv dlton * α β γ δ σ σ 2 f f In ths modl R = R = Ω and vry stratgy profl occurs at som stat * 25

26 REMRK. Gvn th abov noton of ratonalty, thr s no dffrnc btwn common blf of ratonalty and common knowldg of ratonalty. Th prvous two propostons can b rstatd n trms of knowldg and common knowldg. PROPOSITION. K * R S PROPOSITION 2. Fx a stratgc-form gam wth ordnal payoffs G and lt s S. Thn thr xsts an pstmc modl of G and a stat ω such that σ ( ω) = s and ω K R. * 26

27 STRONGER NOTION OF RTIONLITY Stll non-probablstc (no xpctd utlty) Dfnton. Playr s IRRTIONL at stat ω f thr s a stratgy s whch sh blvs to b at last as good as σ (ω) and sh consdrs t possbl that s s bttr than σ (ω) Playr s RTIONL at stat ω f and only f sh s not rratonal 2 's stratgy: α β γ C C P l a y r 3, 2 2, 3 Playr 2 C 4, 2, 2 2, f 3,, 2 g 0, 3, 2's stratgy: f f g Playr s rratonal at stat β: s at last as good as C at both β and γ and t s bttr than C at γ R = { α}, R = 2 27

28 Playr s IRRTIONL at stat ω f thr s a stratgy s whch sh blvs to b at last as good as σ (ω) and sh consdrs t possbl that s s bttr than σ (ω) s t s t s R ( s ) t s t s R = s S t S R = R... R all playrs ar ratonal n 28

29 Dfnton. { } { } Gvn a gam G = N, S, O,, z, a subst of stratgy profls X S and a stratgy profl x X, w say that x s nfror (thus s N N rlatv to X f thr xst a playr and a stratgy s S of playr nd not blong to th projcton of X onto S ) such that:. z( s, x ) z( x, x ) and 2. for all s S, f ( x, s ) X thn z( s, s ) z( x, s ). Itratd Dlton of Infror Profls : m that ar nfror rlatv to. for m N dfn m 0 T S rcursvly as follows: T = S and, for m, m m m m m T = T \ I, whr I T s th st of stratgy profls T m N m Lt T = T. 29

30 Playr Playr 2 Playr 2 d f d f 2, 0, 2, 2, 0, 2, Playr, 0, 0,, 0, C, 4, 3 0, 3 C, 4, 3 T 0 T Playr Playr 2 Playr 2 d f d f 2, 0, 2, 2, 0, 2, Playr C C, 4 T = T 3 T T = S = d f d f C d C C f I = C f {(, ),(, ),(, ),(, ),(, ),(, ),(, ),(, ),(, )}, {(, ),(, )} (th lmnaton of (, ) s don through playr 2 and stratgy f, whl th lmnaton of ( C, f ) s don through playr and stratgy ); T = d f d f C d C I = d f C d f {(, ),(, ),(, ),(, ),(, ),(, ),(, )}, ¹ {(, ),(, ),(, )} (th lmnaton of (, ) and (, ) s don through playr and stratgy, whl th lmnaton of ( C, ) s don through playr 2 and stratgy d); T ² = {(, d),(, ),(, f ),( C, d)}, I ² = {( C, d)} (th lmnaton of ( C, d) s don through playr and stratgy ); T ³ = {(, d),(, ),(, f )}, I ³ = ; thus T = T ³. 30

31 PROPOSITION 3. R T K* If at a stat t s commonly known that all playrs ar ratonal, thn th stratgy profl chosn at that stat blongs to th gam obtand aftr applyng th tratd dlton of Infror stratgy profls. PROPOSITION 4. Fx a stratgc-form gam wth ordnal payoffs G and lt s T. Thn thr xsts an pstmc modl of G and a stat ω such that σ ( ω) = s and ω K R. * 3

32 NOT TRUE f w rplac common knowldg wth common blf Playr Playr 2 c d,, 0, 0, : 2 : α α β β R = { α, β}, R = { α, β} 2 Thr s common blf of ratonalty at vry stat and yt at stat α th stratgy profl playd s (,d) whch s nfror * : σ : σ 2 : d c T S = = {(,c),(,c)} {(,c),(,d),(,c),(,d)} 32

33 PROILISTIC ELIEFS Dfnton. aysan fram s an ntractv blf fram togthr wth a collcton { p } of probablty, ω N, ω Ω dstrbutons on Ω such that () f ω ( ω) thn p =, ω, ω, ω (2) p ( ω ) > 0 f and only f ω ( ω) (th support of p concds wth ( ω)), ω p : /2 /2 α β γ : /3 2/3 2 33

34 Dfnton. stratgc-form gam wth von Numann-Morgnstrn payoffs s a quntupl N = {,..., n} s a st of playrs { } { } N, S, O, U, z N S s th st of stratgs of playr N O whr s a st of U : O R s playr 's von Numann-Morgnstrn utlty functon outcoms z : S O (whr S = S... S ) assocats an outcom wth vry stratgy profl n s S N { } { π } Its rducd form s a trpl N, S, whr π ( s ) U ( z ( s )). = N N 34

35 n pstmc modl of a stratgc-form gam s a aysan fram togthr wth n functons σ : Ω S ( N) such that f ω ( ω) thn σ ( ω ) = σ ( ω) Strongr dfnton of Ratonalty than th prvous ons Playr s RTIONL at stat α f hr choc at α maxmzs hr xpctd payoff, gvn hr blfs at α: for all t S ( ) p π ( t ) σ ( α), σ ( ω) ( ω), σ ( ω) ( ω), α, α ω ( α ) ω ( α ) π p 35

36 α β γ δ ε Playr 2 d : d d 2/3 /3 /2 /2 R = d { δ, ε} P l a y r C 3, 0, 0 0, 3 0, 2, 2 3, Playr s not ratonal at α bcaus hr xpctd payoff s + 2 = whl f sh had chosn stratgy hr payoff would hav bn 3+ 0 = On th othr hand, Playr s ratonal at δ bcaus hr xpctd payoff s 3+ 0 = and f sh had chosn stratgy hr payoff would hav bn + 2 = and f sh had chosn stratgy C hr payoff would hav bn =

37 What ar th mplcatons of Common lf of ths strongr noton of ratonalty? Dfnton. mxd stratgy of playr s a probablty dstrbuton ovr S Th st of mxd stratgs of playr s dnotd by (S ) Lt t S and ν ( S ). W say that t s strctly domnatd by ν f, for vry s S, π ( t, s ) < ν ( s ) π ( s, s ) d Playr 2 s S P l a y r C 3, 0 0, 0 0, 3 0, 2, 2 3, 2 In ths gam stratgy of playr s strctly domnatd by th mxd stratgy C 37

38 Playr 2 f g Playr 2 ITERTIVE DELETION OF PURE STRTEGIES THT RE STRICTLY P l a y r C D 3, 0, 0 0,, 0, 2, 0, 0 4, 2, 2 0, 3, 0 3, 2 (a) Th gam G s strctly domnatd by (/2, /2 D) P l a y r C D f g 3, 0, 0 0, 0, 0 4, 2, 2 0, 3, 0 3, 2 (b) Th gam G Now f s strctly domnatd by g DOMINTED Y (POSSILY Playr 2 g Playr 2 MIXED) STRTEGIES P l a y r C D 3, 0 0, 0 0, 3 0, 2, 2 3, 2 Playr g 3, 0 0, D 0, 3 3, 2 (c) 2 Th gam G Now C s strctly domnatd by (/6, 5/6 D) (d) 3 Th gam G = G No stratgy s strctly domnatd 38

39 Lt G b a stratgc-form gam wth von Numann-Morgnstrn payoffs and G b th gam obtand aftr applyng th procdur of Itratd Dlton of Pur Stratgs that ar Strctly Domnatd by Possbly Mxd Stratgs. Lt S dnot th pur-stratgy profls of gam G m { Ω Sm} Gvn a modl of G, lt S b th vnt ω : σ ( ω) m PROPOSITION 5. * R S m PROPOSITION 6. Fx a stratgc-form gam wth von Numann-Morgnstrn payoffs G and lt s S. Thn thr xsts a aysan modl of G and a stat ω such that σ ( ω) = s and ω R. m * 39

40 Gvn ths strongr noton of ratonalty, thr s a dffrnc btwn common blf of ratonalty and common knowldg of ratonalty. Th mplcatons of common knowldg of ratonalty ar strongr. Wth knowldg, a playr s blfs ar always corrct and ar blvd to b corrct by vry othr playr. Thus thr s corrctnss and common blf of corrctnss of vrybody s blfs. 40

41 Dfnton. Gvn a stratgc-form gam wth von Numann-Morgnstrn payoffs G, a pur-stratgy profl x X S s nfror rlatv to X f thr xsts a playr and a (possbly mxd) stratgy ν of playr (whos support can b any subst of S, not ncssarly th projcton of X onto S ) such that: π ( x ) < (), x π ( s, x ) ν ( s ) ( ν ylds a hghr xpctd payoff than x aganst x ) s S π ( x, s ) (2) for all s S such that ( x, s ) X, π ( s, s ) ν ( s ) s S Playr 2 D E F Playr 2, 0 2, 2 0, 2 2, 2, 2 5, C 2, 0, 0, 5 Hr (C,F) s nfror rlatv to S (for playr, wakly domnats C and s strctly bttr than C aganst F) and (,D) s nfror rlatv to S (for playr 2, E wakly domnats D and s strctly bttr than D aganst ) 4

42 ITERTED DELETION OF INFERIOR PURE STRTEGY PROFILES Playr 2 D E F Playr 2, 0 2, 2 0, 2 2, 2, 2 5, C 2, 0, 0, 5 (a) S 0 s = S, D 0 s = {(, D), (C, F)} Playr 2 D E F Playr 2, 2 0, 2 2, 2, 2 C 2, 0 (c) S 2 s = {(, E), (, F), (,D), (, E), (C, D) }, D 2 s = {(, E)}. Playr 2 D E F Playr 2, 2 0, 2 2, 2, 2 5, C 2, 0, 0 (b) S s = {(, E), (, F), (,D), (, E), (, F), (C, D), (C, E)} D s = {(C, E), (, F)} Playr 2 D E F Playr 2, 2 0, 2 2, 2 C 2, 0 (d) S 3 s = S s = {(, E), (, F), (,D), (C, D) }, D 3 s =. 42

43 Lt G b a stratgc-form gam wth von Numann-Morgnstrn payoffs and G b th gam obtand aftr applyng th procdur of Itratd Dlton of Infror Pur-Stratgy Profls. Lt S dnot th pur-stratgy profls of gam G s { Ω Ss } Gvn a modl of G, lt S b th vnt ω : σ ( ω) s PROPOSITION 7. K* R S s PROPOSITION 8. Fx a stratgc-form gam wth von Numann-Morgnstrn payoffs G and lt s S. Thn thr xsts a aysan modl of G and a stat ω such that σ ( ω) = s and ω K R. s * 43

44 Playr 2 D E F Playr 2, 0 2, 2 0, 2 2, 2, 2 5, C 2, 0, 0, 5 In ths gam m whl S = {(, E),(, F),(, D),( C, D)} s S = S = S Thus vry stratgy profl s compatbl wth common blf of ratonalty whl only (,E), (,F), (,D) and (C,D) ar compatbl wth common knowldg of ratonalty 44

45 CREDITS Th lnk btwn th tratd dlton of strctly domnatd stratgs and th nformal noton of common blf of ratonalty was frst shown by rnhm (984) and Parc (984) Th frst xplct pstmc charactrzaton was provdd by Tan and Wrlang (998) usng a unvrsal typ spac. Th stat spac formulaton usd n Propostons 5 and 6 s du to Stalnakr (994), but t was mplct n randnburgr and Dkl (987). Propostons 7 and 8 ar du to Stalnakr (994) (wth a corrcton gvn n onanno and Nhrng, 996b). To my knowldg, Propostons, 2, 3 and 4 hav not bn xplctly statd bfor. Rfrncs and furthr dtals can b found n attgall, Prpaolo and onanno Gacomo, Rcnt rsults on blf, knowldg and th pstmc foundatons of gam thory, Rsarch n Economcs, 53 (2), Jun 999, pp For a syntactc vrson of Propostons, 2, 3 and 4 s Gacomo onanno, syntactc approach to ratonalty n gams, Workng Papr, Unvrsty of Calforna, Davs ( 45

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn.

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn. Modul 10 Addtonal Topcs 10.1 Lctur 1 Prambl: Dtrmnng whthr a gvn ntgr s prm or compost s known as prmalty tstng. Thr ar prmalty tsts whch mrly tll us whthr a gvn ntgr s prm or not, wthout gvng us th factors

More information

Grand Canonical Ensemble

Grand Canonical Ensemble Th nsmbl of systms mmrsd n a partcl-hat rsrvor at constant tmpratur T, prssur P, and chmcal potntal. Consdr an nsmbl of M dntcal systms (M =,, 3,...M).. Thy ar mutually sharng th total numbr of partcls

More information

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav

More information

The Hyperelastic material is examined in this section.

The Hyperelastic material is examined in this section. 4. Hyprlastcty h Hyprlastc matral s xad n ths scton. 4..1 Consttutv Equatons h rat of chang of ntrnal nrgy W pr unt rfrnc volum s gvn by th strss powr, whch can b xprssd n a numbr of dffrnt ways (s 3.7.6):

More information

Outlier-tolerant parameter estimation

Outlier-tolerant parameter estimation Outlr-tolrant paramtr stmaton Baysan thods n physcs statstcs machn larnng and sgnal procssng (SS 003 Frdrch Fraundorfr fraunfr@cg.tu-graz.ac.at Computr Graphcs and Vson Graz Unvrsty of Tchnology Outln

More information

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization THE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND Economcs 600: August, 007 Dynamc Part: Problm St 5 Problms on Dffrntal Equatons and Contnuous Tm Optmzaton Quston Solv th followng two dffrntal quatons.

More information

Review - Probabilistic Classification

Review - Probabilistic Classification Mmoral Unvrsty of wfoundland Pattrn Rcognton Lctur 8 May 5, 6 http://www.ngr.mun.ca/~charlsr Offc Hours: Tusdays Thursdays 8:3-9:3 PM E- (untl furthr notc) Gvn lablld sampls { ɛc,,,..., } {. Estmat Rvw

More information

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D Comp 35 Machn Larnng Computr Scnc Tufts Unvrsty Fall 207 Ron Khardon Th EM Algorthm Mxtur Modls Sm-Suprvsd Larnng Soft k-mans Clustrng ck k clustr cntrs : Assocat xampls wth cntrs p,j ~~ smlarty b/w cntr

More information

Lecture 14. Relic neutrinos Temperature at neutrino decoupling and today Effective degeneracy factor Neutrino mass limits Saha equation

Lecture 14. Relic neutrinos Temperature at neutrino decoupling and today Effective degeneracy factor Neutrino mass limits Saha equation Lctur Rlc nutrnos mpratur at nutrno dcoupln and today Effctv dnracy factor Nutrno mass lmts Saha quaton Physcal Cosmoloy Lnt 005 Rlc Nutrnos Nutrnos ar wakly ntractn partcls (lptons),,,,,,, typcal ractons

More information

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari snbrg Modl Sad Mohammad Mahd Sadrnhaad Survsor: Prof. bdollah Langar bstract: n ths rsarch w tr to calculat analtcall gnvalus and gnvctors of fnt chan wth ½-sn artcls snbrg modl. W drov gnfuctons for closd

More information

Discrete Shells Simulation

Discrete Shells Simulation Dscrt Shlls Smulaton Xaofng M hs proct s an mplmntaton of Grnspun s dscrt shlls, th modl of whch s govrnd by nonlnar mmbran and flxural nrgs. hs nrgs masur dffrncs btwns th undformd confguraton and th

More information

Decision-making with Distance-based Operators in Fuzzy Logic Control

Decision-making with Distance-based Operators in Fuzzy Logic Control Dcson-makng wth Dstanc-basd Oprators n Fuzzy Logc Control Márta Takács Polytchncal Engnrng Collg, Subotca 24000 Subotca, Marka Orškovća 16., Yugoslava marta@vts.su.ac.yu Abstract: Th norms and conorms

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

Folding of Regular CW-Complexes

Folding of Regular CW-Complexes Ald Mathmatcal Scncs, Vol. 6,, no. 83, 437-446 Foldng of Rgular CW-Comlxs E. M. El-Kholy and S N. Daoud,3. Dartmnt of Mathmatcs, Faculty of Scnc Tanta Unvrsty,Tanta,Egyt. Dartmnt of Mathmatcs, Faculty

More information

Jones vector & matrices

Jones vector & matrices Jons vctor & matrcs PY3 Colást na hollscol Corcagh, Ér Unvrst Collg Cork, Irland Dpartmnt of Phscs Matr tratmnt of polarzaton Consdr a lght ra wth an nstantanous -vctor as shown k, t ˆ k, t ˆ k t, o o

More information

ST 524 NCSU - Fall 2008 One way Analysis of variance Variances not homogeneous

ST 524 NCSU - Fall 2008 One way Analysis of variance Variances not homogeneous ST 54 NCSU - Fall 008 On way Analyss of varanc Varancs not homognous On way Analyss of varanc Exampl (Yandll, 997) A plant scntst masurd th concntraton of a partcular vrus n plant sap usng ELISA (nzym-lnkd

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

More information

Network Congestion Games

Network Congestion Games Ntwork Congstion Gams Assistant Profssor Tas A&M Univrsity Collg Station, TX TX Dallas Collg Station Austin Houston Bst rout dpnds on othrs Ntwork Congstion Gams Travl tim incrass with congstion Highway

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

Basic Electrical Engineering for Welding [ ] --- Introduction ---

Basic Electrical Engineering for Welding [ ] --- Introduction --- Basc Elctrcal Engnrng for Wldng [] --- Introducton --- akayosh OHJI Profssor Ertus, Osaka Unrsty Dr. of Engnrng VIUAL WELD CO.,LD t-ohj@alc.co.jp OK 15 Ex. Basc A.C. crcut h fgurs n A-group show thr typcal

More information

Einstein Equations for Tetrad Fields

Einstein Equations for Tetrad Fields Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for

More information

te Finance (4th Edition), July 2017.

te Finance (4th Edition), July 2017. Appndx Chaptr. Tchncal Background Gnral Mathmatcal and Statstcal Background Fndng a bas: 3 2 = 9 3 = 9 1 /2 x a = b x = b 1/a A powr of 1 / 2 s also quvalnt to th squar root opraton. Fndng an xponnt: 3

More information

A Note on Estimability in Linear Models

A Note on Estimability in Linear Models Intrnatonal Journal of Statstcs and Applcatons 2014, 4(4): 212-216 DOI: 10.5923/j.statstcs.20140404.06 A Not on Estmablty n Lnar Modls S. O. Adymo 1,*, F. N. Nwob 2 1 Dpartmnt of Mathmatcs and Statstcs,

More information

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES CHOOL O ENGINEERING - TI IGNAL PROCEING INTITUTE Lornzo Potta and Prr Vandrghynst CH-1015 LAUANNE Tlphon: 4121 6932601 Tlfax: 4121 6937600 -mal: lornzo.potta@pfl.ch ÉCOLE POLYTECHNIQUE ÉDÉRALE DE LAUANNE

More information

A Probabilistic Characterization of Simulation Model Uncertainties

A Probabilistic Characterization of Simulation Model Uncertainties A Proalstc Charactrzaton of Sulaton Modl Uncrtants Vctor Ontvros Mohaad Modarrs Cntr for Rsk and Rlalty Unvrsty of Maryland 1 Introducton Thr s uncrtanty n odl prdctons as wll as uncrtanty n xprnts Th

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

First looking at the scalar potential term, suppose that the displacement is given by u = φ. If one can find a scalar φ such that u = φ. u x.

First looking at the scalar potential term, suppose that the displacement is given by u = φ. If one can find a scalar φ such that u = φ. u x. 7.4 Eastodynams 7.4. Propagaton of Wavs n East Sods Whn a strss wav travs throgh a matra, t ass matra parts to dspa by. It an b shown that any vtor an b wrttn n th form φ + ra (7.4. whr φ s a saar potnta

More information

Optimal Ordering Policy in a Two-Level Supply Chain with Budget Constraint

Optimal Ordering Policy in a Two-Level Supply Chain with Budget Constraint Optmal Ordrng Polcy n a Two-Lvl Supply Chan wth Budgt Constrant Rasoul aj Alrza aj Babak aj ABSTRACT Ths papr consdrs a two- lvl supply chan whch consst of a vndor and svral rtalrs. Unsatsfd dmands n rtalrs

More information

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:

More information

History. One breakthrough paper Cousot & Cousot 77 (?) Abstract Interpretation. Inspired by. Lecture 16. Enthusiastically embraced by the community

History. One breakthrough paper Cousot & Cousot 77 (?) Abstract Interpretation. Inspired by. Lecture 16. Enthusiastically embraced by the community Hstory Abstract Intrprtaton On brakthrough papr Cousot & Cousot 77 (?) Insprd by Dataflow analyss Dnotatonal smantcs 1 Enthusastcally mbracd by th communty At last th functonal communty... At last th frst

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP ISAHP 00, Bal, Indonsa, August -9, 00 COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP Chkako MIYAKE, Kkch OHSAWA, Masahro KITO, and Masaak SHINOHARA Dpartmnt of Mathmatcal Informaton Engnrng

More information

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2 FACTA UNIVERSITATIS Srs: Mchancs, Automatc Control Robotcs Vol.3, N o, 00, pp. 7-33 VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 54.7(045)54.75.6:59.688:59.673 Ebrhard Malkowsky, Vsna Vlčkovć Dpartmnt of

More information

Representation and Reasoning with Uncertain Temporal Relations

Representation and Reasoning with Uncertain Temporal Relations Rprsntaton and Rasonng wth Uncrtan Tmporal Rlatons Vladmr Ryaov (*) Sppo Puuronn (*) Vagan Trzyan (**) (*) Dpartmnt of Computr Scnc and Informaton Systms Unvrsty of Jyvaskyla P.O.Box 5 SF-4051 Jyvaskyla

More information

Naresuan University Journal: Science and Technology 2018; (26)1

Naresuan University Journal: Science and Technology 2018; (26)1 Narsuan Unvrsty Journal: Scnc and Tchnology 018; (6)1 Th Dvlopmnt o a Corrcton Mthod or Ensurng a Contnuty Valu o Th Ch-squar Tst wth a Small Expctd Cll Frquncy Kajta Matchma 1 *, Jumlong Vongprasrt and

More information

Analyzing Frequencies

Analyzing Frequencies Frquncy (# ndvduals) Frquncy (# ndvduals) /3/16 H o : No dffrnc n obsrvd sz frquncs and that prdctd by growth modl How would you analyz ths data? 15 Obsrvd Numbr 15 Expctd Numbr from growth modl 1 1 5

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

Lecture 3: Phasor notation, Transfer Functions. Context

Lecture 3: Phasor notation, Transfer Functions. Context EECS 5 Fall 4, ctur 3 ctur 3: Phasor notaton, Transfr Functons EECS 5 Fall 3, ctur 3 Contxt In th last lctur, w dscussd: how to convrt a lnar crcut nto a st of dffrntal quatons, How to convrt th st of

More information

Chapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional

Chapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional Chaptr 13 GMM for Linar Factor Modls in Discount Factor form GMM on th pricing rrors givs a crosssctional rgrssion h cas of xcss rturns Hors rac sting for charactristic sting for pricd factors: lambdas

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

Fakultät III Wirtschaftswissenschaften Univ.-Prof. Dr. Jan Franke-Viebach

Fakultät III Wirtschaftswissenschaften Univ.-Prof. Dr. Jan Franke-Viebach Unvrstät Sgn Fakultät III Wrtschaftswssnschaftn Unv.-rof. Dr. Jan Frank-Vbach Exam Intrnatonal Fnancal Markts Summr Smstr 206 (2 nd Exam rod) Avalabl tm: 45 mnuts Soluton For your attnton:. las do not

More information

Differentiation of Exponential Functions

Differentiation of Exponential Functions Calculus Modul C Diffrntiation of Eponntial Functions Copyright This publication Th Northrn Albrta Institut of Tchnology 007. All Rights Rsrvd. LAST REVISED March, 009 Introduction to Diffrntiation of

More information

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University xtrnal quvalnt 5 Analyss of Powr Systms Chn-Chng Lu, ong Dstngushd Profssor Washngton Stat Unvrsty XTRNAL UALNT ach powr systm (ara) s part of an ntrconnctd systm. Montorng dvcs ar nstalld and data ar

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline Introucton to Ornar Dffrntal Equatons Sptmbr 7, 7 Introucton to Ornar Dffrntal Equatons Larr artto Mchancal Engnrng AB Smnar n Engnrng Analss Sptmbr 7, 7 Outln Rvw numrcal solutons Bascs of ffrntal quatons

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

UNTYPED LAMBDA CALCULUS (II)

UNTYPED LAMBDA CALCULUS (II) 1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /

More information

Group Codes Define Over Dihedral Groups of Small Order

Group Codes Define Over Dihedral Groups of Small Order Malaysan Journal of Mathmatcal Scncs 7(S): 0- (0) Spcal Issu: Th rd Intrnatonal Confrnc on Cryptology & Computr Scurty 0 (CRYPTOLOGY0) MALAYSIA JOURAL OF MATHEMATICAL SCIECES Journal hompag: http://nspm.upm.du.my/ournal

More information

From Structural Analysis to FEM. Dhiman Basu

From Structural Analysis to FEM. Dhiman Basu From Structural Analyss to FEM Dhman Basu Acknowldgmnt Followng txt books wr consultd whl prparng ths lctur nots: Znkwcz, OC O.C. andtaylor Taylor, R.L. (000). Th FntElmnt Mthod, Vol. : Th Bass, Ffth dton,

More information

Objective Mathematics

Objective Mathematics x. Lt 'P' b a point on th curv y and tangnt x drawn at P to th curv has gratst slop in magnitud, thn point 'P' is,, (0, 0),. Th quation of common tangnt to th curvs y = 6 x x and xy = x + is : x y = 8

More information

Abstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1

Abstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1 Abstract Intrprtation 1 History On brakthrough papr Cousot & Cousot 77 (?) Inspird by Dataflow analysis Dnotational smantics Enthusiastically mbracd by th community At last th functional community... At

More information

The Fourier Transform

The Fourier Transform /9/ Th ourr Transform Jan Baptst Josph ourr 768-83 Effcnt Data Rprsntaton Data can b rprsntd n many ways. Advantag usng an approprat rprsntaton. Eampls: osy ponts along a ln Color spac rd/grn/blu v.s.

More information

Minimum Spanning Trees

Minimum Spanning Trees Mnmum Spnnng Trs Spnnng Tr A tr (.., connctd, cyclc grph) whch contns ll th vrtcs of th grph Mnmum Spnnng Tr Spnnng tr wth th mnmum sum of wghts 1 1 Spnnng forst If grph s not connctd, thn thr s spnnng

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

A Stackelberg Strategy for Routing Flow over Time

A Stackelberg Strategy for Routing Flow over Time A Stacklbrg Stratgy for Routng Flow ovr Tm Umang Bhaskar Lsa Flschr Ellot Anshlvch Abstract Routng gams ar usd to to undrstand th mpact of ndvdual usrs dcsons on ntwork ffcncy. Most pror work on routng

More information

8-node quadrilateral element. Numerical integration

8-node quadrilateral element. Numerical integration Fnt Elmnt Mthod lctur nots _nod quadrlatral lmnt Pag of 0 -nod quadrlatral lmnt. Numrcal ntgraton h tchnqu usd for th formulaton of th lnar trangl can b formall tndd to construct quadrlatral lmnts as wll

More information

Diploma Macro Paper 2

Diploma Macro Paper 2 Diploma Macro Papr 2 Montary Macroconomics Lctur 6 Aggrgat supply and putting AD and AS togthr Mark Hays 1 Exognous: M, G, T, i*, π Goods markt KX and IS (Y, C, I) Mony markt (LM) (i, Y) Labour markt (P,

More information

Physics 256: Lecture 2. Physics

Physics 256: Lecture 2. Physics Physcs 56: Lctur Intro to Quantum Physcs Agnda for Today Complx Numbrs Intrfrnc of lght Intrfrnc Two slt ntrfrnc Dffracton Sngl slt dffracton Physcs 01: Lctur 1, Pg 1 Constructv Intrfrnc Ths wll occur

More information

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex. Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

An Overview of Markov Random Field and Application to Texture Segmentation

An Overview of Markov Random Field and Application to Texture Segmentation An Ovrvw o Markov Random Fld and Applcaton to Txtur Sgmntaton Song-Wook Joo Octobr 003. What s MRF? MRF s an xtnson o Markov Procss MP (D squnc o r.v. s unlatral (causal: p(x t x,

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

Preview. Graph. Graph. Graph. Graph Representation. Graph Representation 12/3/2018. Graph Graph Representation Graph Search Algorithms

Preview. Graph. Graph. Graph. Graph Representation. Graph Representation 12/3/2018. Graph Graph Representation Graph Search Algorithms /3/0 Prvw Grph Grph Rprsntton Grph Srch Algorthms Brdth Frst Srch Corrctnss of BFS Dpth Frst Srch Mnmum Spnnng Tr Kruskl s lgorthm Grph Drctd grph (or dgrph) G = (V, E) V: St of vrt (nod) E: St of dgs

More information

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation. Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform

More information

Chapter 6 Student Lecture Notes 6-1

Chapter 6 Student Lecture Notes 6-1 Chaptr 6 Studnt Lctur Nots 6-1 Chaptr Goals QM353: Busnss Statstcs Chaptr 6 Goodnss-of-Ft Tsts and Contngncy Analyss Aftr compltng ths chaptr, you should b abl to: Us th ch-squar goodnss-of-ft tst to dtrmn

More information

Search sequence databases 3 10/25/2016

Search sequence databases 3 10/25/2016 Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an

More information

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches. Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M

More information

Shortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk

Shortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk S 445 Shortst Paths n Graphs lon frat Sls courtsy of rk man an arola Wnk Paths n raphs onsr a raph G = (V, ) wth -wht functon w : R. Th wht of path p = v v v k s fn to xampl: k = w ( p) = w( v, v + ).

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

From Elimination to Belief Propagation

From Elimination to Belief Propagation School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls (10-708 Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap

More information

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim. MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function

More information

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization

More information

Physics of Very High Frequency (VHF) Capacitively Coupled Plasma Discharges

Physics of Very High Frequency (VHF) Capacitively Coupled Plasma Discharges Physcs of Vry Hgh Frquncy (VHF) Capactvly Coupld Plasma Dschargs Shahd Rauf, Kallol Bra, Stv Shannon, and Kn Collns Appld Matrals, Inc., Sunnyval, CA AVS 54 th Intrnatonal Symposum Sattl, WA Octobr 15-19,

More information

On the Hamiltonian of a Multi-Electron Atom

On the Hamiltonian of a Multi-Electron Atom On th Hamiltonian of a Multi-Elctron Atom Austn Gronr Drxl Univrsity Philadlphia, PA Octobr 29, 2010 1 Introduction In this papr, w will xhibit th procss of achiving th Hamiltonian for an lctron gas. Making

More information

Superposition. Thinning

Superposition. Thinning Suprposition STAT253/317 Wintr 213 Lctur 11 Yibi Huang Fbruary 1, 213 5.3 Th Poisson Procsss 5.4 Gnralizations of th Poisson Procsss Th sum of two indpndnt Poisson procsss with rspctiv rats λ 1 and λ 2,

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

SØK/ECON 535 Imperfect Competition and Strategic Interaction. In the absence of entry barriers firms cannot make supernormal profits.

SØK/ECON 535 Imperfect Competition and Strategic Interaction. In the absence of entry barriers firms cannot make supernormal profits. SØK/ECON 535 Imprfct Comptton and Stratgc Intracton ENTRY AND EXIT Lctur nots 09.10.0 Introducton In th absnc of ntry barrrs frms cannot mak suprnormal profts. Barrrs to ntry govrnmnt rgulatons tchnologcal

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R. Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood

More information

A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION*

A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION* A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION* Dr. G.S. Davd Sam Jayakumar, Assstant Profssor, Jamal Insttut of Managmnt, Jamal Mohamd Collg, Truchraall 620 020, South Inda,

More information

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration

More information

Computation of Greeks Using Binomial Tree

Computation of Greeks Using Binomial Tree Journal of Mathmatcal Fnanc, 07, 7, 597-63 http://www.scrp.org/journal/jmf ISSN Onln: 6-44 ISSN Prnt: 6-434 Computaton of Grks Usng Bnomal Tr Yoshfum Muro, Shntaro Suda Graduat School of conomcs and Managmnt,

More information

Econ107 Applied Econometrics Topic 10: Dummy Dependent Variable (Studenmund, Chapter 13)

Econ107 Applied Econometrics Topic 10: Dummy Dependent Variable (Studenmund, Chapter 13) Pag- Econ7 Appld Economtrcs Topc : Dummy Dpndnt Varabl (Studnmund, Chaptr 3) I. Th Lnar Probablty Modl Suppos w hav a cross scton of 8-24 yar-olds. W spcfy a smpl 2-varabl rgrsson modl. Th probablty of

More information

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P Tsz Ho Chan Dartmnt of Mathmatics, Cas Wstrn Rsrv Univrsity, Clvland, OH 4406, USA txc50@cwru.du Rcivd: /9/03, Rvisd: /9/04,

More information

Approximately Maximizing Efficiency and Revenue in Polyhedral Environments

Approximately Maximizing Efficiency and Revenue in Polyhedral Environments Approxmatly Maxmzng Effcncy and Rvnu n olyhdral Envronmnts Thành Nguyn Cntr for Appld Mathmatcs Cornll Unvrsty Ithaca, NY, USA. thanh@cs.cornll.du Éva Tardos Computr Scnc Dpartmnt Cornll Unvrsty Ithaca,

More information

Elements of Statistical Thermodynamics

Elements of Statistical Thermodynamics 24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,

More information

ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS

ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS Anuj Bshno and Sudsh K. Khanduja Dpartmnt of Mathmatcs, Panjab Unvrsty, Chandgarh-160014, Inda. E-mal: anuj.bshn@gmal.com, skhand@pu.ac.n ABSTRACT.

More information

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS COMPUTTION FUID DYNMICS: FVM: pplcatons to Scalar Transport Prolms ctur 3 PPICTIONS OF FINITE EEMENT METHOD TO SCR TRNSPORT PROBEMS 3. PPICTION OF FEM TO -D DIFFUSION PROBEM Consdr th stady stat dffuson

More information

a 1and x is any real number.

a 1and x is any real number. Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars

More information

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l h 4D, 4th Rank, Antisytric nsor and th 4D Equivalnt to th Cross Product or Mor Fun with nsors!!! Richard R Shiffan Digital Graphics Assoc 8 Dunkirk Av LA, Ca 95 rrs@isidu his docunt dscribs th four dinsional

More information

u 3 = u 3 (x 1, x 2, x 3 )

u 3 = u 3 (x 1, x 2, x 3 ) Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.

More information

Correlation in tree The (ferromagnetic) Ising model

Correlation in tree The (ferromagnetic) Ising model 5/3/00 :\ jh\slf\nots.oc\7 Chaptr 7 Blf propagato corrlato tr Corrlato tr Th (frromagtc) Isg mol Th Isg mol s a graphcal mol or par ws raom Markov fl cosstg of a urct graph wth varabls assocat wth th vrtcs.

More information

??? Dynamic Causal Modelling for M/EEG. Electroencephalography (EEG) Dynamic Causal Modelling. M/EEG analysis at sensor level. time.

??? Dynamic Causal Modelling for M/EEG. Electroencephalography (EEG) Dynamic Causal Modelling. M/EEG analysis at sensor level. time. Elctroncphalography EEG Dynamc Causal Modllng for M/EEG ampltud μv tm ms tral typ 1 tm channls channls tral typ 2 C. Phllps, Cntr d Rchrchs du Cyclotron, ULg, Blgum Basd on slds from: S. Kbl M/EEG analyss

More information

Deift/Zhou Steepest descent, Part I

Deift/Zhou Steepest descent, Part I Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,

More information

Boostng: a st of approxmat prdctons ar to b combnd n a smpl way n ordr to obtan a mor accurat on. Show that, n th bnary classcaton cas, takng a wghtd

Boostng: a st of approxmat prdctons ar to b combnd n a smpl way n ordr to obtan a mor accurat on. Show that, n th bnary classcaton cas, takng a wghtd Boostng Rvstd Massmo Santn Dpartmnto d Scnz dll'informazon Unvrsta dgl Stud d Mlano Va Comlco, 39/41-20135 Mlano (Italy) Tchncal Rport 205-97 Abstract In ths papr som boostng and on-ln allocaton stratgs

More information

Logistic Regression I. HRP 261 2/10/ am

Logistic Regression I. HRP 261 2/10/ am Logstc Rgrsson I HRP 26 2/0/03 0- am Outln Introducton/rvw Th smplst logstc rgrsson from a 2x2 tabl llustrats how th math works Stp-by-stp xampls to b contnud nxt tm Dummy varabls Confoundng and ntracton

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then SYSTEM PERFORMANCE Lctur 0: Stady-tat Error Stady-tat Error Lctur 0: Stady-tat Error Dr.alyana Vluvolu Stady-tat rror can b found by applying th final valu thorm and i givn by lim ( t) lim E ( ) t 0 providd

More information