Centre de Referència en Economia Analítica

Size: px
Start display at page:

Download "Centre de Referència en Economia Analítica"

Transcription

1 Centre de Referèni en Eonomi Anlíti Brelon Eonomis Working Pper Series Working Pper nº 69 Regions of Rtionlity: Mps for ounded gents Roin M. Hogrth nd Ntli Kreli Otoer, 005

2 Regions of rtionlity: Mps for ounded gents Roin M. Hogrth & Ntli Kreli ICREA & Universitt Pompeu Fr, Brelon H. E. C., Lusnne, Switzerlnd Otoer 005 The uthors re grteful for feedk reeived t workshops t the Center for Deision Reserh t the University of Chigo, Universitt Pompeu Fr, Crnegie-Mellon University, the Hs Shool of Business t the University of Cliforni, Berkeley, nd Toulouse University. This reserh ws finned prtilly y grnt from the Spnish Ministerio de Eduión y Cieni. For orrespondene, plese ontt Roin M. Hogrth t Universitt Pompeu Fr, Deprtment of Eonomis nd Business, Rmon Tris Frgs 5-7, 08005, Brelon, Spin. (Tel: , Fx ). Emil: roin.hogrth@upf.edu, ntli.kreli@unil.h

3 Astrt An importnt prolem in desriptive nd presriptive reserh in deision mking is to identify regions of rtionlity, i.e., the res for whih simple, heuristi models re nd re not effetive. To mp the ontours of suh regions, we derive proilities tht models identify the est of m lterntives (m > ) hrterized y k ttriutes (k > ). The models inlude single vrile (lexiogrphi), vritions of elimintion-y-spets, equl weighting, hyrids of the preeding, nd models exploiting dominne. We ompre ll with multiple regression. We illustrte the theory with twenty simulted nd four empiril dtsets. Fits etween preditions nd reliztions re exellent. However, the terrin mpped y our work is omplex nd no single model is est. We further provide n overview y regressing the performne of the different models on ftors hrterizing environments. We onlude y outlining how our work n e extended to exploring the effets of different loss funtions s well s suggesting further topis for future reserh. Keywords: Deision mking, Bounded rtionlity, Lexiogrphi rules, Choie theory. JEL lssifition: D8, M0.

4 In his utoiogrphy, Herert Simon (99) used the metphor of mze to hrterize person s life. In this metphor, people re ontinully fed y hoies involving two or more lterntives, the outomes of whih nnot e perfetly predited from the informtion ville prior to hoosing. Extending this metphor, the mze of hoies person fes n e thought of s journey tht rosses different regions vrying in the types of questions posed. If endowed with unounded rtionlity, one ould simply lulte the optiml responses for ll deisions. However, following Simon s insights, the ounded nture of humn ognitive pities neessrily leds to following stisfiing mehnisms. Fortuntely, stisfiing does not imply unstisftory outomes if the type of response used is pproprite to the region in whih hoie is exerised. But it lso rises the issue of fing the onsequenes of inpproprite hoies. In this pper, we hrterize the mze of hoies tht people fe s involving different regions of rtionlity where suess depends on identifying deision rules tht re pproprite to eh region. In some regions, for exmple, the simplest rndom hoie rule might e suffiient (e.g., when hoosing lottery tiket). In other regions, returns to omputtionlly demnding lgorithms re potentilly importnt (e.g., plnning prodution in n oil refinery). Wht people need therefore is knowledge or mps tht indite the demnd for rtionlity in different regions. In prtiulr, sine ttention is the sre resoure (Simon, 978), it is ritil to know wht nd how muh informtion should e sought to mke deisions in different regions. The purpose of this pper is to ontriute to defining mps tht hrterize regions of rtionlity for ommon deisions prolems. This topi is importnt for oth desriptive nd presriptive resons. For the former, there is gret need to As Simon (99) points out, this metphor lso underlies his lssi (956) pper on wht n orgnism needs to e le to hoose effetively in given environments. 3

5 understnd the onditions under whih simple, oundedly rtionl deision rules re nd re not effetive (see elow). At the sme time, this knowledge is ritil for presriing when people should use suh rules, i.e., s deision ids. Speifilly, we onsider deisions etween two or more lterntives sed on informtion tht is proilistilly relted to the riterion of hoie. The struture of these tsks n e oneptulized s involving either multiple-ue predition or multi-ttriute hoie nd, s suh, is ommon. In ll ses, we onstrut theoretil models tht predit the effetiveness in different regions of severl, simple hoie rules or heuristis (see elow) therey mpping the ontours in whih the vrious models re more or less suessful. Following Simon s initil insights, the interest in desriing the implitions of simple models of deision mking hs grown exponentilly over the lst five dedes (see, e.g., Conlisk, 996; Goldstein & Hogrth, 997; Khnemn, 003; Koehler & Hrvey, 004). An importnt soure of ontroversy in this reserh hs entered on the extent to whih the simple rules or heuristis tht people use for mking deisions re effetive. In prtiulr, gret interest ws stimulted y reserh on so-lled heuristis nd ises (Khnemn, Slovi, & Tversky, 98) tht demonstrted how simple (or less thn fully rtionl) proesses produe outomes tht devite from normtive presriptions. Similrly, muh work demonstrted tht simple, sttistil deision rules hve superior preditive performne reltive to unided humn judgment in wide rnge of tsks (see, e.g., Dwes, Fust, & Meehl, 989; Kleinmuntz, 990). An lterntive view is tht people possess repertoire of oundedly rtionl deision rules tht they pply in speifi irumstnes (Gigerenzer & Selten, 00). Thus, heuristis n lso produe pproprite responses. Speifilly, Gigerenzer nd 4

6 his ollegues hve demonstrted how wht they ll fst nd frugl rules n rivl the preditive ility of omplex lgorithms (Gigerenzer, Todd, & the ABC Reserh Group, 999). In their terms, ounded rtionlity n produe eologilly rtionl ehvior, i.e., ehvior tht is pproprite in its nihe ut does not ssume n underlying optimiztion model. Wht is unler from this work, however, is where these nihes re loted in the regions of rtionlity. Reviewing the empiril evidene, it is ler tht there re osions when heuristi rules violte normtive presriptions s well s osions when simple rules led to surprisingly suessful outomes. The role of theory, therefore, is to speify the irumstnes in whih oth kinds of results our or, to use the metphor of this pper, to mp the regions of rtionlity. Our gol is to illuminte this issue nd our pproh is theoretil. It involves speifying nlytil models for simple proesses tht n e used for either multittriute hoie or multiple-ue predition. Speifilly, we derive proilities tht these models will orretly selet the est of m lterntives (m > ) sed on k ttriutes or ues (k > ). We lso ompre their effetiveness with optimizing nd nïve enhmrks. The theoretil development enles the ssessment of importnt environmentl ftors suh s differentil ue vlidities, inter-orreltions of ttriutes, whether ttriutes/ues re mesured y ontinuous or inry vriles, levels of error in dt, nd the intertions etween these ftors. This pper is orgnized s follows. In setion I, we riefly review relevnt literture. Next, in setion II we speify the models we exmine. In setion III, we onsider models sed on ontinuous vriles nd derive onditions for hoosing the est of three lterntives using single vrile prior to generlizing the numer of lterntives nd the use of different models. In setion IV, we derive nlogous 5

7 onditions for models sed on inry ttriutes or ues. In setion V, we test our theories on twenty simulted nd four empiril dtsets nd find exellent fits etween preditions nd reliztions. We lso provide n overview y regressing the performne of the different models on ftors hrterizing environments. Our results emphsize tht reltive model performne is omplex funtion of severl ftors nd tht theoretil models re needed to understnd this omplexity, i.e., to mp the regions of rtionlity. For exmple, we identify regions where different models do nd do not exhiit similr performne. At the sme time, our results re onsistent with some generl trends tht hve een demonstrted previously in simultions (e.g., effets of inter-orreltion mong preditor vriles). We lso identify new regions where less is more (i.e., preditions re improved if less informtion is used). Finlly, in setion VI we provide onluding omments s well s suggestions for further reserh. I. Evidene on the preditive effetiveness of simple models Interest in the effiy of simple models for deision mking hs existed for some time with, in prtiulr, numerous empiril demonstrtions of how models sed on simple equl (or unit) weighting shemes predit s well s or more urtely thn more omplex lgorithms suh s multiple regression (see, e.g., Dwes & Corrign, 974; Dwes, 979). Gigerenzer nd Goldstein (996) hve further shown how simple, non-ompenstory lexiogrphi model tht uses inry ues ( tke the est or TTB) is surprisingly urte in prediting the etter of two lterntives ross severl empiril dtsets nd outperforms the ompenstory, equl weighting (EW) model (Gigerenzer et l., 999). 6

8 Other studies hve used simultion. Pyne, Bettmn nd Johnson (993), for exmple, explored trdeoffs etween effort nd ury. Using ontinuous vriles nd weighted dditive model s the riterion, they demonstrted the effets on simple model performne of two importnt environmentl vriles, dispersion in the weighting of vriles nd the extent to whih hoies involved dominne. (See lso Thorngte, 980). Bsed on oneptul onsidertions, Shnteu nd Thoms (000) defined environments s friendly or unfriendly to different models nd lso demonstrted these effets through simultions. More reently, Fsolo, MClellnd, nd Todd (in press) exmined multittriute hoie in simultion using ontinuous vriles (involving options hrterized y six ttriutes). Their gol ws to ssess how well hoies y models with differing numers of ttriutes ould mth totl utility nd, in doing so, they vried levels of verge inter-orreltions mong the ttriutes nd types of weighting funtions. Results showed importnt effets for oth. With differentil weighting, one ttriute ws suffiient to pture t lest 90% of totl utility. With positive interorreltion mong ttriutes, there ws little differene etween equl nd differentil weighting. With negtive inter-orreltion, however, equl weighting ws sensitive to the numer of ttriutes used (the more, the etter). Despite these empiril demonstrtions involving simulted nd rel dt, reserh to dte hs generlly lked theoretil models for understnding how hrteristis of models intert with those of environments. Some work hs, however, onsidered speifi ses. Einhorn nd Hogrth (975), for exmple, provided theoretil rtionle for the effetiveness of equl weighting reltive to multiple regression. Mrtignon nd Hoffrge (999; 00) nd Ktsikopoulos nd Mrtignon (003) explored the onditions under whih TTB or equl weighting 7

9 should e preferred in inry hoie. Hogrth nd Kreli (004; in press) nd Buells, Crrso, nd Hogrth (005) hve exmined why TTB nd other simple models perform well with inry ttriutes in error-free environments. And, Hogrth nd Kreli (005) provided theoretil nlysis for the speil se of inry hoie with ontinuous ttriutes. II. Models onsidered Wheres the essene of fully rtionl models involves hoosing or prediting y optimlly omining ll relevnt evidene, heuristi models re hrterized y the use of limited susets of the sme informtion nd/or simplifying omintion rules (e.g., equl weighting of vriles). The heuristi models we exmine (see Tle ) reflet these onsidertions nd n e lssified into three tegories: (A) models sed on single vriles or susets of the ville informtion; (B) equl weighting models; nd (C) hyrid models tht omine hrteristis of the two preeding tegories. In ddition, we onsider lower nd upper enhmrk models: (D) simple models tht exploit dominne (see omments elow); nd (E) multiple regression (see lso omments elow). We further exmine how the type of dt ffets model performne y inluding, where possile, versions of the models sed on oth ontinuous nd inry ttriutes/ues. Generlly speking, we would expet models sed on ontinuous vriles to outperform their inry ounterprts. However, wht is not ler priori is the size of suh differenes nd how these might vry under different In our simultions nd empiril work, we generte inry vriles y medin splits of the ontinuous vriles nd in this mnner mke diret omprisons etween results sed on inry nd ontinuous vriles. 8

10 onditions. We indite the use of the two kinds of dt for the sme models y suffixes: for ontinuous, nd for inry. Sine most of the models we onsider hve een onsidered in the literture (see previous setion), we limit disussion here to mking few links. First, the DEBA model (numer 3) is deterministi version of Tversky s (97) elimintiony-spets (EBA) model. For inry hoie, this model is identil to the TTB model of Gigerenzer nd Goldstein (996). Vriles used s ttriutes/ues for this model re inry in nture nd, lthough the mount of informtion onsulted y this model for eh hoie vries ording to the hrteristis of the lterntives, mny deisions re sed on single ttriute. In the ontinuous se, this is est mthed y the single vrile model (SV, numer ) whih is equivlent to the lexiogrphi model investigted y Pyne et l. (993). Seond, with inry vriles s ues/ttriutes, the EW model predits frequent ties etween lterntives. However, rther then resolving suh hoies t rndom, we use hyrid models tht exploit prtil knowledge. Speifilly, EW/DEBA nd EW/SV re models tht, first, ttempt to hoose ording to EW. If this results in tie, DEBA or SV is used s tie-reker (see lso Hogrth & Kreli, in press). Third, it is illuminting to ompre the performne of simple heuristis with enhmrks. For lower or nïve enhmrks, we inlude two models tht simply exploit dominne, Domrn (DR), numers 8 nd 9. (Simply stted, hoose n lterntive if it domintes the other(s). If not, hoose t rndom.) As n upper or normtive/sophistited enhmrk, we use multiple regression (models 0 nd ). 3 3 We re fully wre tht multiple regression is not neessrily the optiml model for ll tsks. 9

11 It is importnt to emphsize tht the models differ in the demnds they mke on ognitive resoures, speifilly on prior knowledge nd the mount of informtion to e proessed. We therefore indite, on the right of Tle, differentil requirements in terms of prior informtion, informtion to onsult, lultions, nd numers of omprisons to e mde (minimum to mximum). For exmple, Tle shows tht the EW nd DR models require no prior informtion other thn the signs of the zero-order orreltions etween the ues nd the riterion (this is minimum requirement). On the other hnd, the lexiogrphi, DEBA, nd hyrid models need to know whih ue(s) is(re) most importnt. Aginst this, the lexiogrphi nd DEBA models do not neessrily use ll ues nd require no lultions. The ost of DR models lies minly in the numer of omprisons tht hve to e mde Insert Tle out here In this pper, we onentrte on ury or the proilities tht models mke pproprite hoies/preditions. However, nd s demonstrted y Pyne et l. (993), it is importnt to er in mind tht heuristi models differ in their informtion proessing osts. Our gol is to develop theoretil models tht predit model performne ross different environments. However, sed on the hrteristis of the models, two hypotheses n e suggested. First (s noted ove), we would expet models sed on ontinuous vriles to outperform their inry ounterprts. Seond, models tht resolve ties of other models would e expeted to e more urte thn the ltter. Hene DEBA should e more urte thn SV, nd EW/DEBA nd 0

12 EW/SV more urte thn EW. However, whether DEBA is more urte thn SV will depend on environmentl hrteristis. A priori, three types of environmentl vriles n e expeted to ffet solute nd reltive model performne. These re, first, the distriution of true ue vlidities 4 (i.e., how the environment weights different vriles, f., Pyne et l., 993); seond, the level of redundny or inter-orreltion mong the ues; nd third, the level of noise in the environment (i.e., its inherent preditility). Of these ftors, inresing noise will undoutedly derese performne of ll models nd, y extension, differenes etween the models. However, prt from this min effet, it is diffiult to intuit how ll other ftors will omine to determine solute nd reltive model performnes. To hieve this, we need to develop pproprite theory for eh of our models. III. Models with ontinuous vriles Choosing the est using single vrile (SV). For expository resons, we onsider first the se of seleting the est of three lterntives using single vrile (SV). Speifilly, imgine hoosing from distriution hrterized y two orrelted rndom vriles, one of whih is riterion, Y, nd the other n ttriute, X. Furthermore, ssume tht lterntive A is preferred over lterntives B nd C if y > y nd y > y. 5 Now, imgine tht the only informtion out A, B, nd C re the vlues tht they exhiit on the ttriute, X. Denote these speifi vlues y x, x, nd x, respetively. Without loss of generlity, ssume tht x > x nd x > x nd tht the deision rule is to hoose the lterntive with the lrgest vlue of X, i.e., in 4 The ue vlidity for prtiulr ue/ttriute is defined y its orreltion with the riterion. 5 We denote rndom vriles y upper se letters, e.g., Y nd X, nd speifi vlues or reliztions y lower se letters, e.g., y nd x. As n exeption, we use lower se Greek letters to denote rndom error vriles, e.g., ε.

13 this se A. The proility tht A is in ft the orret hoie n therefore e hrterized y the joint proility tht Y > Y given tht x > x nd Y > Y onditioned on x > x, in other words, {( Y Y X = x > X = x ) ( Y > Y X = x > X x )} P > =. To determine this proility, ssume tht Y nd X re oth stndrdized norml vriles, i.e., oth re N(0,). Moreover, the two vriles re positively orrelted (if they re negtively orrelted, simply multiply one y -). Denote the orreltion y the prmeter, ( >0). Given these fts, it is possile to represent Y, Y, nd Y y the equtions: Y = X + ε () Y = X + ε () nd Y = X + ε (3) where ε, ε nd, ε re normlly distriuted error terms, eh with men of 0 nd vrine of ( ), independent of eh other nd of X, X, nd X. Using equtions (), (), nd (3) the differenes etween Y nd Y, on the one hnd, nd Y nd Y, on the other, n e written s nd Thus, Y >Y nd Y > Y if nd Y Y ( X X ) + ( ε ε ) Y = (4) ( X X ) + ( ε ε ) Y = (5) ( X X ) > ε ε (6) ( X X ) > ε ε (7)

14 {( Y Y X = x > X = x ) ( Y > Y X = x > X x )} P > = n now e refrmed s the proility tht oth the right hnd side of (6) is smller thn (X - X ) nd the right hnd side of (7) is smller thn (X X ). As n e seen, these ltter terms re the produts of, the orreltion etween Y nd X, nd the differenes etween X nd X, nd X nd X. In other words, the lrger the orreltion etween Y nd X, nd the lrger the differenes etween X nd X, nd X nd X, the greter P {( Y Y X = x > X = x ) ( Y > Y X = x > X = x )} P > = {( ε < ( x x )) ( ε ε < ( x x ))} ε (8) To determine this proility, we mke use of the fts tht the differenes etween the error terms, (ε - ε ) nd (ε - ε ), re oth normlly distriuted with mens of 0 nd vrines of ( ). Stndrdizing (ε - ε ) nd (ε - ε ), we n reexpress eqution (8) s P {( ε < ( x x )) ( ε ε < ( x x ))} ε = P z < ( x x ) z < ( x x ) ( ) ( ) (9) where z nd z re stndrdized norml vriles with mens of 0 nd vrines of. Moreover, z nd z jointly follow ivrite norml distriution. Therefore, the trget proility (9) n e written s l l z ( ) e dz dz πσ z σ z (0) z zz z where z = + ; σ σ σ σ z z z z l ( x x ) = ; ( ) l ( x x ) = ; ( ) σ σ z = = z ; nd = σ. z,z 3

15 In Appendix A, we show tht = ½. Thus, we n write {( Y Y X = x > X = x ) ( Y > Y X = x > X x )} P > = = l l π 3 ( z z z + z ) dz dz 3 e () Figure illustrtes the proilities of SV orretly hoosing the est of three lterntives for different vlues of (X - X ) nd (X - X ). In the pnel on the left, (), (x - x ) is held onstnt t low vlue of 0.3; on the right, (), it is held onstnt t high vlue,.0. The lines in the figures reflet the effets of omining these fixed levels with different vlues of (x - x ), from 0. to 3.0. As n e oserved, if one of the two differenes, (x - x ) or (x - x ), is smll, the proility of orret hoie vries etween 0.4 nd 0.5. However, s oth grow lrger, so do the orresponding proilities Insert Figure out here To generlize the ove, ssume tht there re m (m > 3) lterntives from whih to hoose nd tht eh hs speifi X vlue, x l, l =,., m. Without loss of generlity, ssume tht x hs the lrgest vlue nd we wish to know the proility tht the orresponding lterntive hs the lrgest vlue on the riterion. Generlizing from the ove, this proility n e lulted using properties of the multivrite norml distriution nd, in this se, n e written, * d... * dm ϕ ( z µ, V z z ) dz... dz m = * d... d * m V z ( π ) / z ( m ) / e z V z dz... dz m () 4

16 where d * i di = for i =, m, the elements of z = z, z,..., z ) re jointly ( ) ( m distriuted norml vriles, with mens of zero nd vrines of one, nd V z is the inverse of the (m-) x (m-) vrine-ovrine mtrix where eh digonl element is equl to nd ll off-digonl elements equl ½ (see Appendix A). In Appendix B we derive the nlytil expression for the proility of seleting the optiml hoie mong four lterntives y using just one vrile. For inry hoie, tht is, when m =, nlogous derivtions led to similr expressions to those shown ove (see Hogrth & Kreli, 005). Overll proilities. The proilities given ove re those ssoited with prtiulr oservtions, i.e., tht A is lrger thn B nd C given tht speifi vlue, x, exeeds speifi vlues x nd x. However, it is lso instrutive to onsider the overll expeted ury of SV, i.e., the overll proility tht SV mkes the orret hoie when smpling t rndom from the popultion of lterntives. Overll, SV n mke suessful hoies in three wys: seleting A when x is igger thn x nd x ; seleting B when x is igger thn x nd x ; nd seleting C when x is igger thn x nd x. The proilities of these events re, {( ( X X ) ( X > X )) (( Y > Y ) ( Y Y ))} P > >, {( ( X X ) ( X > X )) (( Y > Y ) ( Y Y ))} P > >, nd {( ( X > X ) ( X > X )) (( Y > Y ) ( Y Y ))} P > respetively, nd the overll proility is the sum of the three terms. However, sine eh of the terms is equl to the others, the sum n e re-expressed s {( ( X > X ) ( X > X )) (( Y > Y ) ( Y Y ))} 3 P >. 5

17 To derive nlytilly the overll proility of orret hoie y SV when smpling t rndom from the underlying popultion of lterntives, the ltter expression should e integrted ross ll possile vlues tht n e tken y D = X X > 0, nd D = X X > 0. Tht is * * d d 3 ( d d, Vd ) ( z z, Vz ) dzdz dddd 0 ϕ µ 0 ϕ µ (3) where z = ( z, z ), / V z =, (, ) / d = d d, V d =, d * d =, ( ) nd d * d =. (In Tle 3, disussed elow, we generlize these formuls for ( ) hoosing one of m lterntives.) Equl weighting (EW) nd multiple regression (MR). Wht re the preditive uries of models tht mke use of severl, k, ues or vriles, k >? We onsider two models tht hve often een used in the literture. One is equl weighting (EW see Dwes & Corrign, 974; Einhorn & Hogrth, 975). The other is multiple regression (MR). To nlyze these models, ssume tht the riterion vrile, Y, n e expressed s funtion Y = f(x, X,..,X k ) (4) where the k preditor vriles re multivrite norml, eh with men of 0 nd stndrd devition of. For EW, the predited Y vlue ssoited with ny vetor of oserved x s is equl to k x j k j= or x. Similrly, the nlogous predition in MR is k given y j x j or ŷ where the j s re estimted regression oeffiients. In using j= these models, therefore, the deision rules re to hoose ording to the lrgest x for EW nd the lrgest ŷ vlue for MR. 6

18 How likely re EW nd MR to mke the orret hoie? Following the sme rtionle s the single vrile (SV) se, we show in Tle the formuls used in deriving the nlogous proilities for EW nd MR (s well s SV) when hoosing the est of three lterntives using the properties of the ivrite norml distriution. These re the initil equtions (orresponding to equtions,, nd 3), the ury onditions (orresponding to equtions 6 nd 7), the relevnt error vrines, nd finlly the upper limits of integrtion, i.e. l nd l, used to lulte proilities when pplying eqution () Insert Tles & 3 out here Similrly, when lulting the proilities of hoosing orretly etween four or more lterntives for EW nd MR, we n pply the multivrite norml distriution in nlogous fshion to tht of SV (f. eqution ove nd Appendix B). In Tle 3, we present the formuls for the overll expeted ury of EW nd MR in given environment or popultion, nlogous to those for SV, i.e. to eqution (3), for hoosing one of m lterntives. In prtiulr, we present the elements tht re speifi for different models, suh s the vrine-ovrine mtrix, V d, nd the upper integrtion limits of integrtion, d. * i IV. Models with inry vriles To disuss expeted preditive performne of models sed on inry vriles, we first ssume tht the dependent vrile, Y, n e thought of s eing generted y liner model of the form 7

19 Y = + k j= γ jw j + ς (5) where W j = 0, re the inry vriles (j =,,k), the γ j re weighting prmeters nd ς is normlly distriuted error term (see lso elow). To derive theoretil preditions for models using inry vriles, we dopt similr pproh to tht used with ontinuous vriles. We therefore fous on issues tht differ etween the ontinuous nd inry ses. Choosing the est using single inry vrile (SV). Assuming tht w > w nd w > w, the proility tht SV hooses orretly etween three lterntives, A, B, nd C is P {( Y Y W = w > W = w ) ( Y > Y W = w > W = w )} >. To determine this proility, rell tht Y is stndrdized norml vrile N(0,). The inry vrile, W, however, only tkes vlues of 0 nd nd thus hs men of 0.5 nd stndrd devition, σ, of Denoting the orreltion etween Y nd W y yw, ( yw > 0), we n express Y y w or, simply, Y Y yw = SV + W + ς σ w = SV + yww + ς (6) whereς is normlly distriuted error term N( 0, ). 7 yw Proeeding in similr fshion to the ontinuous se, we otin the expression for the proility of SV prediting orretly: h h π 3 ( z z z + z ) dz dz 3 e (7) 6 Rell tht inry vriles re reted y medin splits of ontinuous vriles. 7 Sine E(Y) = 0, it follows tht the interept SV = yw. 8

20 where h ( w w ) yw = ; ( ) yw h ( w w ) yw =. ( ) yw Sine oth ( w w ) nd ( w ) w re equl to one, the two upper integrtion limits re the sme: yw h = h =. ( ) yw As n e seen, the only differene etween the theoretil expressions for the ontinuous nd inry ses lies in the formuls for the upper limits of integrtion. Therefore, generlizing the ove for hoies mong m (m > 3) lterntives is nlogous to tht for the ontinuous se. Following the sme rtionle, we n derive the formuls for the proilities for EW nd MR when hoosing the est of three lterntives using inry vriles. In Tle 4, we present the initil equtions for these models (orresponding to eqution 6), nd the upper limits of integrtion, i.e. h nd h, used to lulte proilities when pplying eqution (7) Insert Tle 4 out here Choosing the est using DEBA with inry ues. Rell tht this multi-stge model works in the following wy. At the first stge, lterntives with vlues of 0 for the most importnt ue re eliminted unless ll lterntives exhiit 0. If only one lterntive hs vlue of, it is seleted nd the proess termintes. If, however, more thn one lterntive remins, the sme proedure tkes ple with the remining lterntives exept tht the seond most importnt ue is used. The proess ontinues in the sme mnner through susequent stges, if neessry. It stops when either only one lterntive remins (i.e., the hosen lterntive) or, if there is more thn one 9

21 lterntive ut no more ues, hoie is determined t rndom mong the remining lterntives. The proility tht given lterntive ws hosen orretly y DEBA is the proility tht the sequene of deisions (or elimintions) mde y the model t eh stge is orret. Thus, sine t eh stge of the model deisions re mde onditionl on the preeding stges, the key prmeters in estimting these proilities re the prtil orreltions etween Y nd W j, j =,,k (i.e., ontrolling for previous stges). For the first stge, this is yw, for the seond yw.w, for the third, yw w on w, nd so For exmple, ssume tht there re three lterntives A, B, nd C nd tht A hs een hosen y proess wherey C ws eliminted t the first stge nd B t the third stge. Strting kwrds, onsider the deisions the model mkes t eh stge. Tht is, the proility tht DEBA orretly seleted A over B t the third stge, ontrolling for the elimintion of C t the first stge, is {( Y Y W = w > W = w ) ( Y > Y W = w > W w )} P > =. This proility n e lulted y mking use of the pproprite prtil orreltions in this se, yw w nd yw 3. w nd dpting the single vrile equtions (e.g., the generl eqution 0 9 ). At the seond stge, the model mkes no deision. At the first stge, it elimintes C so we need to lulte dditionlly the proility tht A ould hve een orretly seleted only with informtion ville t this stge: {( Y Y W = w > W = w ) ( Y > Y W = w > W w )} P > =. This n e lso found through n dpted expression (0), using yw 8 For exmple, yw. w = yw ( )( ). yw yw w w ww. Importntly, the events 9 The terms tht need to e dpted in the expression (0) re the upper limits or integrtion nd σ z,z. 0

22 represented y the proility expressions for the first nd third stges re disjuntive. Therefore, the proility tht DEBA mkes the orret deision in this se is equl to the sum of the two expressions. Consider nother exmple involving three lterntives A, B, nd C. Assume tht DEBA elimintes C t the first stge nd t the third stge piks either A or B t rndom (this will hppen if A nd B re identil). Thus, the 0.5 proility tht DEBA mkes the orret deision t the third stge should e disounted y the proility tht C, eliminted t the first stge, is not etter thn A nd B. Tht is ( P {( Y > Y W = w > W = w ) ( Y > Y W = w > W = w )} ) 0.5 More generlly, the proility of DEBA mking the orret hoie hs to e lulted on se-y-se sis tking into ount, t eh stge, the proility tht the seleted lterntive should e hosen over the lterntive(s) eliminted t tht stge using the prtil orreltion of the ue pproprite to the stge. Moreover, the proility for eh se inludes the proilities of suessful deisions t eh stge. If t the finl stge, there re two or more lterntives, the pproprite rndom proility is djusted y the proility tht orret deisions were tken t previous stges (see, e.g., the exmple ove). 0 Choosing the est using the EW-SV model with inry ues (EW-SV). The first stge of this model uses EW. If single lterntive is hosen, the proility of it eing orret is found y pplying the formul for EW. If two or more lterntives re tied, seond stge onsists of seleting the lterntive fvored y the first ue. To lulte the proility tht this is orret, one needs to lulte the joint proility tht the seleted lterntive () is lrger thn the lterntives eliminted t. 0 In this setion, we hve only indited the generl strtegy for lulting relevnt proilities for DEBA. The detils involve repeted pplitions of the sme proility theory priniples pplied in mny different situtions (Kreli & Hogrth, in preprtion).

23 the first stge, nd () lrger thn the other lterntives onsidered t the seond stge. (To lulte these proilities, use is mde of the pproprite nlogs to eqution 7). Any ties remining fter stge two re resolved t rndom with orresponding djustment eing mde to the proility lultions. Choosing the est using the EW-DEBA model with inry ues (EW-DEBA). This model strts s EW. If EW hooses one lterntive, the proility of orret hoie of the model oinides with tht for EW. If two or more lterntives re tied, the DEBA model is used to hoose etween the remining lterntives nd proilities re lulted ordingly (see ove). V. Empiril evidene Our equtions provide ext theoretil proilities for ssessing performne of the different models in speified onditions, i.e., to mp the ontours of the regions of rtionlity. However, severl ftors ffet solute nd reltive performne levels of the models (e.g., ue vlidities, inter-orreltion mong vriles, ontinuous vs. inry vriles, error), nd it is diffiult to ssess their importne simply y inspeting the formuls. We therefore use oth simulted nd empiril dt to illuminte model performne under different onditions. Rel dt hve the dvntge of testing the theory in speifi, leit limited environments. Simulted dt, on the other hnd, filitte testing model preditions over wide rnge of environments. We first onsider the simulted dt. Simultion design nd method. The simultion design used for hoosing the est from two, three nd four lterntives is presented in Tle 5. Overll, we speified 0 different popultions tht re sudivided into four sets or ses A, B, C,

24 nd D eh of whih ontins five su-ses (leled,, 3, 4, nd 5). Sine, priori, severl ftors might e thought importnt, we would hve liked to vry these orthogonlly. However, orreltions etween ftors restrit implementing fully systemti design. We therefore vried some ftors t the level of the ses (A, B, C, nd D) nd others ross su-ses (i.e., within A, B, C, nd D). At the level of ses, A nd B involved three ues or ttriutes wheres ses C nd D involved five. Cses A nd C hd little or no inter-ue orreltion; ses B nd D hd moderte to high interorreltion Insert Tle 5 out here Aross su-ses (i.e., from through 5 within eh of A, B, C, nd D), we vried: () the vriility of ue vlidities (mximum less minimum); () the vlidity of the first (i.e., most importnt) ue; (3) verge vlidity; nd (4) the orreltion etween y nd x. For ll, vlues inrese from the su-ses through 5. As onsequene, the R on initil fit for MR lso inreses ross su-ses. This implies tht the su-ses involve high levels of error wheres the su-ses 5 re, in priniple, quite preditle environments. Su-ses, 3, nd 4 fll etween these extremes. To ondut the simultion, we defined 0 sets of stndrdized multivrite norml distriutions with the prmeters speified in Tle 5 nd generted smples of size 40 from eh of these popultions. The oservtions in eh smple were split t rndom on 50/50 sis into fitting nd predition su-smples nd model prmeters were estimted on the fitting su-smple. Two, three or four lterntives (s pproprite) were then drwn t rndom from this su-smple nd, using the estimted model prmeters, proilities of orretly seleting the est of these 3

25 speifi lterntives were lulted. This ws then ompred to wht tully hppened, tht is, on fitting sis. Next, lterntives were drwn t rndom from the predition su-smple, relevnt proilities lulted using the prmeters from the fitting su-smple, nd preditions ompred to reliztions. This exerise ws repeted 5,000 times (for eh of the hoies involving two, three, nd four lterntives). The ove desries the proedure used for ontinuous dt. For models using inry dt, we followed extly the sme proedures exept tht preditor vriles only took vlues of 0 or. Speifilly, sine we were smpling ontinuous normlized vriles, we reted inry vriles y medin splits (i.e., inry vriles were set to 0 for negtive vlues of ontinuous vriles nd for nonnegtive vlues). Thus, if one estimtes the prmeters of the 0 popultions for the inry dt, the estimtes differ systemtilly from their ontinuous ounterprts shown in Tle 5 (they re smller). However, we do not disply the inry prmeter estimtes sine the prmeters in Tle 5 represent the proess tht generted the dt. Simultion results. Tles 6, 7, nd 8 present the results of the simultions for the hoie of est of two, three, nd four lterntives, respetively. Figure presents some seleted outomes from the se involving est of three (Tle 7). Results reported here re limited to preditions nd reliztions for the holdout smples (i.e., tests of ross-vlidtion). A possile ritiism of our preditive tests of the single vrile models (SV, SV, nd DEBA) is tht we did not use the smpling proess to determine the most importnt vrile (for SV nd SV) nor the rnk orders of the ue vlidities (for DEBA). Insted, we endowed the models with the pproprite knowledge. However, in susequent simultions we hve found tht with smple sizes of 0 (s here) the net effet of filing to identify the most importnt vrile is quite smll. Similrly, s long s DEBA orretly identifies the most importnt vrile, net differenes re lso smll (Hogrth & Kreli, in press). As might e expeted y exmining the suess of the models on ross-vlidtion, the fitting exerise produed lmost perfet mthes etween smples nd models. 4

26 To simplify reding the tles, note tht reliztions re underlined (e.g., 6), nd tht the lrgest reliztion for eh popultion (i.e., per olumn) is presented in old (e.g., 65). In ddition, when MR is the lrgest, we lso denote the seond lrgest in old. We further show men reliztions for eh olumn nd row in the tles. The olumn mens thus represent the verge reliztions of ll models within speifi popultions wheres the row mens hrterize verge model performne ross popultions. We first note tht, with the exeption of multiple regression (MR), the mth etween model preditions nd reliztions is quite lose in ll ses. MR mkes lrge errors for ses C nd D nd prtiulrly when the differenes etween mximum nd minimum ue vlidities re smllest (su-ses nd ). Although we used djusted R in mking preditions, the djustment ws insuffiient in these situtions Insert Tles 6, 7, 8 nd Figure out here Qulittively, the reltive effetiveness of the models is quite similr whether one looks t the results for est of two, three, or four. Wht hnges, of ourse, is the generl level of performne whih diminishes s the numer of lterntives inreses. This n e seen y ompring the olumns of men reliztions of Tles 6, 7, nd 8, i.e., t the extreme right hnd sides of the tles. Within eh tle, n initil, overll impression is the lk of lrge differenes etween the performnes of the different models. However, there re systemti effets. 3 One n lso rgue with some justifition tht the rtio of oservtions to preditor vriles is too smll to use multiple regression (prtiulrly for ses C nd D). However, we re prtiulrly interested in oserving how well the different models work in environments where there re not mny oservtions. 5

27 First, onsider whether preditor vriles re inry or ontinuous. The use of inry s opposed to ontinuous vriles implies loss of informtion. As suh, we expeted tht models sed on ontinuous vriles would predit etter thn their inry ounterprts. Indeed, this is lwys the se in three diret omprisons: SV vs. SV, EW vs. EW, nd MR vs. MR. Speifilly, note tht SV nd EW re oth hndipped reltive to SV nd EW in tht they neessrily predit mny ties tht re resolved t rndom. Thus, so long s the knowledge in SV nd EW implies etter thn rndom preditions, models sed on ontinuous vriles re fvored. On the other hnd, the performne of DR domintes DR for ses A, C, nd D with performne eing quite similr for se B (for est of two, three, nd four). It would pper tht DR exploits more ses of pprent dominne thn DR whih (s onsequene) deides more hoies t rndom. Thus, to the extent tht the dditionl dominne ses deteted y DR reltive to DR hve more thn rndom hne of eing orret, DR outpredits DR. Wheres the DR models represent nïve seline strtegies, we elieve this finding is importnt euse it demonstrtes how simple strtegy n exploit the struture of the environment suh tht more informtion (in the form of ontinuous s opposed to inry vriles) does not improve performne ( so-lled less is more effet, Goldstein & Gigerenzer, 00; Hertwig & Todd, 003). Seond, models tht resolve ties perform etter thn their ounterprts tht re unle to do so (e.g., DEBA vs. SV, nd EW/DEBA nd EW/SV vs. EW). However, in the presene of redundny, these differenes re quite smll (i.e., for ses B nd D). More interesting is the omprison etween SV nd DEBA. The former uses single, ontinuous vrile. The ltter relies hevily on one inry vrile ut n lso use others depending on irumstnes. It is thus not ler 6

28 whih strtegy tully uses more informtion. However, one gin, hrteristis of the environment determine whih strtegy is more suessful. SV domintes DEBA in se B s well s for muh of ses A nd D. On the other hnd, DEBA domintes SV in se C. In Figure, we hve hosen to illustrte the performne of five models ross ll the environments for the hoie of est of three (i.e., dt from Tle 7). Two of these models, DR nd MR re depited euse they represent, respetively, nïve nd sophistited enhmrks. The other models, SV, DEBA, nd EW re quite different types of heuristis (see Tle ). Both SV nd DEBA require prior knowledge of wht is importnt (DEBA more so thn SV). However, they use little informtion nd neither involves ny omputtion. (DEBA, it should e relled, lso opertes on inry dt.) EW, on the other hnd, does not require knowledge of differentil importne of vriles ut does use ll informtion ville nd needs some omputtionl ility. In interpreting Figure, it is instrutive to rell tht ses A nd C (on the left) represent environments with low redundny wheres ses B nd D (on the right) hve higher levels of redundny. Also within eh se, the mount of noise in the environment dereses s one moves from su-se (on the left) to su-se 5 (on the right). As expeted, in the noisier environments (su-ses ), the performnes of ll models re degrded suh tht differenes re smll. However, s error dereses (i.e., moving right towrd su-ses 5), model performnes vry y environmentl onditions. With low redundny (ses A nd C), there pper to e lrge differenes in model performne. However, in the presene of redundny (ses B nd D), there re two distint lsses of models: SV nd MR hve similr 7

29 performne levels nd re superior to the others. We further note tht SV is most effetive in se B nd lso does well s environmentl preditility inreses in ses A nd D. DEBA is never the est model ut performs quite dequtely in se C where EW hs the est performne. Of the enhmrk models, DR generlly lgs ehind the other models (s would e expeted). Finlly, lthough MR is typilly one of the etter models, it does not dominte in ll environments. To highlight regions of rtionlity, Tle 9 represents the dt from Figure in nother mnner (think of Tle 9 s mp!). Speifilly, the performnes of SV, DEBA, EW, nd DR re ompred to the normtive enhmrk of MR (y deduting the performne of eh of the former from the ltter). Thus positive (negtive) entries in Tle 9 indite the mount y whih the performne of MR exeeds (flls short of) those of other models. Three ses re indited: in the shded res, MR exeeds other models y t lest 5; in the unshded res, the stndrd font (e.g., 4) indites tht the MR dvntge is smll (< 5) ut positive; nd old, underlined font (e.g., -) denotes tht MR hs no dvntge over the other model. The tle depits reltive model performne y hrteristis of regions, e.g., redundny nd noise (tht is, inter-ue orreltion nd error, respetively) Insert Tle 9 out here For exmple, rell tht ses A nd C involve low redundny wheres this is not true of ses B nd D. Also, for ll ses, s one moves from su-ses through 5, environments involve less noise. With this in mind, one n ttriute the smller differenes etween models in su-ses nd s eing minly due to noise. Interestingly, the reltive suess of SV in ses B nd D (ompred to A nd C) seems to e the effet of inter-orreltion etween the other ttriutes, i.e., 8

30 redundny. Tle 9 is only presented s n illustrtion. The dt from Tles 6, 7, nd 8 n lerly e used to rete mps tht highlight different spets of the deision mking terrin. A further wy of summrizing ftors tht ffet the performne of the different models is to onsider the regression of model performne on sttistis tht desrie the hrteristis of the 0 simulted environments (Tle 5). In other words, onsider regressions for eh of our eleven models of the form P i = Zδ + τ (8) i i where P i is the performne reliztion of model i (i =,, ); Z is the (0 x 3) x s mtrix of independent vriles (sttistis hrterizing the dtsets where there re three hoie situtions, i.e., est of two, three, or four lterntives); δ i is the s x vetor of regression oeffiients; nd τ i is normlly distriuted error term with onstnt vrine, independent of Z. To hrterize the environments or dtsets (the Z mtries), we hose the following vriles: vriility of ue vlidities (mx less min), the vlidity of the most importnt ue ( r ), the vlidity of the verge of the ues ( r ), verge interorreltion of the ues, verge vlidity of the ues, numer of ues, nd R for MR nd MR. 4 We lso used dummy vriles to model the effets of hoosing etween different numers of lterntives. Dummy ptures the effet of hoosing from three s opposed to two lterntives, nd Dummy the dditionl effet of hoosing from four lterntives. Results of the regression nlyses re summrized in Tle 0. 4 We only used R s n independent vrile for MR nd MR euse we thought it would e pproprite for these models. For the other models, however, it ws deemed more illuminting to hrterize performne y the other mesures (R nd these other mesures re orrelted in different wys). It should lso e noted tht we used the sme sttistis (sed on ontinuous vriles) to hrterize the environments for models using oth ontinuous nd inry vriles on the grounds tht the underlying environments were sed on ontinuous vriles. 9

31 Insert Tle 0 out here We used step-wise proedure with entry (exit) thresholds for the vriles of <.05 (>.0) for the proility of the F sttisti. All oeffiients for the models shown in Tle 0 re sttistilly signifint (p <.00) nd ll regressions fit the dt well (see R nd estimted stndrd errors t the foot of Tle 0). The onstnt term is firly high ross ll models nd mesures the level of performne tht would e expeted of the models in inry hoie sent informtion out the environment (pproximtely 50, i.e., from 4 to 65). Dummy indites how muh suh performne would fll when hoosing etween three lterntives (etween nd 4), nd Dummy shows the dditionl drop experiened when hoosing mong four lterntives (etween 6 nd 9). For SV nd SV, only one other vrile is signifint, the orreltion etween the single vrile nd the riterion. This mkes intuitive sense s does the ft tht the regression oeffiient is lrger with ontinuous s opposed to inry vriles (50 vs. 9). The DEBA nd EW models re ll hevily influened y the orreltion etween the riterion nd x. Rell, however, tht this orreltion is itself n inresing funtion of verge ue vlidity nd the numer of ues ut deresing in the inter-orreltion etween ues (see the formul in footnote to Tle ). Thus, eteris prius, inresing inter-orreltion etween the ues redues the solute performne levels of these models. DEBA differs from the EW models in tht the orreltion of the most vlid ue is signifint preditor. This mthes expettions in tht DEBA relies hevily on the vlidity of the most importnt ue wheres EW weights ll ues eqully. (We lso note tht the SV models weight the most vlid ue more hevily thn DEBA.) As to the Domrn models, the interprettion of the signs of 30

32 ll oeffiients is not ovious. Finlly, for MR it omes s little surprise tht R should e so importnt lthough this vrile is less slient for MR. A possile surprise is tht vriility in ue vlidities (mximum less minimum) ws not signifint ftor for most models. One might hve thought, priori, tht suh dispersion would hve een importnt for DEBA (f., Pyne et l., 993). However, this is not the se nd is onsistent with theoretil nlyses of DEBA tht show tht its ury is reltively roust to different weighting funtions (Hogrth & Kreli, in press; Buells, Crrso, & Hogrth, 005). Finlly, wheres the regression sttistis pint n interesting piture of model performne in the prtiulr environments oserved, we ution ginst overgenerliztion. We only oserved restrited rnges of the environmentl sttistis (i.e., hrteristis) nd thus nnot omment on wht might hppen eyond these rnges. Our pproh, however, does suggest wy to illuminte model x environment intertions. To summrize, ross ll 0 environments tht, inter li, re sujet to different levels of error, the reltive performnes of the different models were not seen to vry gretly when fed with the sme tsks (e.g., hoose est of three lterntives). However, there were systemti differenes due to intertions etween hrteristis of models nd environments. Thus, wheres the dditionl informtion ontined in ontinuous s opposed to inry vriles enefits some models, e.g., SV nd EW, it n e detrimentl to others, e.g., DR. Seond, models vried in the extent to whih they were ffeted y speifi environmentl hrteristis. SV models, for exmple, depend hevily on the vlidity of the most vlid ue wheres this only ffets EW models through its impt on verge ue vlidity. Interestingly, the vlidity of the verge of the ues ws seen to hve more impt on the performne 3

33 of DEBA thn the vlidity of the most vlid ue. Averge inter-orreltion of preditors or redundny tends to redue performne of ll models (exept SV). Overll, results do mth some generl trends noted in previous simultions (Pyne et l., 993; Fsolo et l., in press); however, ptterns re not simple to desrie. The vlue of our work, therefore, is tht we now possess the mens to mke preise preditions for vrious simple, heuristi models in different environments. Tht is, given speified environments, we n predit priori oth levels of model performne nd whih models will e more or less effetive. An importnt environmentl ftor we did not vry ws the impt of different distriutions of speifi kinds of lterntives. Insted, we simulted rndom drwings of lterntives given the popultion hrteristis defined in Tle 5. We did not, for exmple, skew the smpling proess to inlude or exlude disproportionte numers of, sy, dominting or dominted lterntives (f., Pyne et l., 993). As we hve rgued elsewhere (Hogrth & Kreli, 004), the distriution of lterntives n hve importnt effets on oth the generl level of performne hieved y models s well s reltive performne (some distriutions, for exmple, re reltively friendly or unfriendly to speifi models, Shnteu & Thoms, 000). On the other hnd, sine our methodology n mke speifi preditions for eh se enountered, it n esily hndle the effets of smpling from different distriutions of lterntives. Empiril dt. We used dtsets from three different res of tivity. The first involved performne dt of the 60 leding golfers in 003 lssified y the Professionl Golf Assoition (PGA) in the USA. 5 From these dt (N = 60), we exmined two dependent vriles: ll-round rnking nd totl ernings. The first 5 These dt were otined from the wepge They re performne sttistis of golfers in the min PGA Tour for

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Review Topic 14: Relationships between two numerical variables

Review Topic 14: Relationships between two numerical variables Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

ANALYSIS AND MODELLING OF RAINFALL EVENTS

ANALYSIS AND MODELLING OF RAINFALL EVENTS Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Iowa Training Systems Trial Snus Hill Winery Madrid, IA

Iowa Training Systems Trial Snus Hill Winery Madrid, IA Iow Trining Systems Tril Snus Hill Winery Mdrid, IA Din R. Cohrn nd Gil R. Nonneke Deprtment of Hortiulture, Iow Stte University Bkground nd Rtionle: Over the lst severl yers, five sttes hve een evluting

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

A Non-parametric Approach in Testing Higher Order Interactions

A Non-parametric Approach in Testing Higher Order Interactions A Non-prmetri Approh in Testing igher Order Intertions G. Bkeerthn Deprtment of Mthemtis, Fulty of Siene Estern University, Chenkldy, Sri Lnk nd S. Smit Deprtment of Crop Siene, Fulty of Agriulture University

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Learning Partially Observable Markov Models from First Passage Times

Learning Partially Observable Markov Models from First Passage Times Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).

More information

Line Integrals and Entire Functions

Line Integrals and Entire Functions Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information

Table of Content. c 1 / 5

Table of Content. c 1 / 5 Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................

More information

AP CALCULUS Test #6: Unit #6 Basic Integration and Applications

AP CALCULUS Test #6: Unit #6 Basic Integration and Applications AP CALCULUS Test #6: Unit #6 Bsi Integrtion nd Applitions A GRAPHING CALCULATOR IS REQUIRED FOR SOME PROBLEMS OR PARTS OF PROBLEMS IN THIS PART OF THE EXAMINATION. () The ext numeril vlue of the orret

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

Outline. Theory-based Bayesian framework for property induction Causal structure induction

Outline. Theory-based Bayesian framework for property induction Causal structure induction Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning The origins of usl knowledge Question: how do people relily ome

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

MAT 403 NOTES 4. f + f =

MAT 403 NOTES 4. f + f = MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL P3.1 Kot Iwmur*, Hiroto Kitgw Jpn Meteorologil Ageny 1. INTRODUCTION Jpn Meteorologil Ageny

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Section 3.6. Definite Integrals

Section 3.6. Definite Integrals The Clulus of Funtions of Severl Vribles Setion.6 efinite Integrls We will first define the definite integrl for funtion f : R R nd lter indite how the definition my be extended to funtions of three or

More information

Solutions to Assignment 1

Solutions to Assignment 1 MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove

More information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem HS Pre-Alger Notes Unit 9: Roots, Rel Numers nd The Pythgoren Theorem Roots nd Cue Roots Syllus Ojetive 5.4: The student will find or pproximte squre roots of numers to 4. CCSS 8.EE.-: Evlute squre roots

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE V.S. Gordeev, G.A. Myskov Russin Federl Nuler Center All-Russi Sientifi Reserh Institute of Experimentl Physis (RFNC-VNIIEF)

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

a) Read over steps (1)- (4) below and sketch the path of the cycle on a P V plot on the graph below. Label all appropriate points.

a) Read over steps (1)- (4) below and sketch the path of the cycle on a P V plot on the graph below. Label all appropriate points. Prole 3: Crnot Cyle of n Idel Gs In this prole, the strting pressure P nd volue of n idel gs in stte, re given he rtio R = / > of the volues of the sttes nd is given Finlly onstnt γ = 5/3 is given You

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

A Mathematical Model for Unemployment-Taking an Action without Delay

A Mathematical Model for Unemployment-Taking an Action without Delay Advnes in Dynmil Systems nd Applitions. ISSN 973-53 Volume Number (7) pp. -8 Reserh Indi Publitions http://www.ripublition.om A Mthemtil Model for Unemployment-Tking n Ation without Dely Gulbnu Pthn Diretorte

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

DETERMINING SIGNIFICANT FACTORS AND THEIR EFFECTS ON SOFTWARE ENGINEERING PROCESS QUALITY

DETERMINING SIGNIFICANT FACTORS AND THEIR EFFECTS ON SOFTWARE ENGINEERING PROCESS QUALITY DETERMINING SIGNIFINT FTORS ND THEIR EFFETS ON SOFTWRE ENGINEERING PROESS QULITY R. Rdhrmnn Jeng-Nn Jung Mil to: rdhrmn_r@merer.edu jung_jn@merer.edu Shool of Engineering, Merer Universit, Mon, G 37 US

More information

Trigonometry Revision Sheet Q5 of Paper 2

Trigonometry Revision Sheet Q5 of Paper 2 Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

More information

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18 Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re

More information

TIME AND STATE IN DISTRIBUTED SYSTEMS

TIME AND STATE IN DISTRIBUTED SYSTEMS Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is

More information

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities Appendi Prtil dishrges. Reltionship Between Mesured nd Atul Dishrge Quntities A dishrging smple my e simply represented y the euilent iruit in Figure. The pplied lternting oltge V is inresed until the

More information

Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomials. Polynomials. Curriculum Ready ACMNA: Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

More information