STA 414/2104 Mar 11, Notes
|
|
- Evelyn Thompson
- 5 years ago
- Views:
Transcription
1 STA 414/2104 Mr 11, / 12 Notes Tke-home Midterm: Mrh 16 Mrh 25 One qestion from Kernels nd Ensemles y M. Zh Clssifition nd regression trees 9.2 Ensemle methods nd rndom forests Zh k-mens nd k-nerest neighor methods nspervised lerning
2 STA 414/2104 Mr 11, / 12 VR ode for nerl networks Size = 2 Size = 2, lmd = Pregnnetriol Pregnnetriol Tetrhydroortisone Tetrhydroortisone Size = 2, lmd = 0.01 Size = 5,20, lmd = 0.01 Pregnnetriol Pregnnetriol Tetrhydroortisone Tetrhydroortisone
3 STA 414/2104 Mr 11, / 12...ode for nn plt.ndry <- fntion(size=0, dey=0,...) { sh.nn <- nnet(sh, tpi, skip=t, softmx=t, size=size, dey=dey, mxit=1000) invisile(1(predit(sh.nn, sht),...)) } 1 <- fntion(z,...) { zp <- Z[,3] - pmx(z[,2], Z[,1]) ontor(exp(xp), exp(yp), mtrix(zp, np), dd=t, levels=0, lex=0,...) zp <- Z[,1] - pmx(z[,3], Z[,2]) ontor(exp(xp), exp(yp), mtrix(zp, np), dd=t, levels=0, lex=0,...) }
4 STA 414/2104 Mr 11, / 12...ode for nn Z = predit(sh.nn, sht) ses fitted nerl network to predit on grid of (x 1, x 2 ) lled sht the grid points re lled xp nd yp this gives 10, mtrix of proilities zp = Z[,3] - pmx(z[,2], Z[,1] ) Pr(3) mx{pr(2), Pr(1)} positive if lss 3 is the highest proility, else negtive mtrix(zp, np): np= 100, the nmer of olmns in the mtrix zp ontor(exp(xp), exp(yp), mtrix(zp, np), dd=t, levels = 0) the ondry where Pr(3) is lrgest nd similrly zp = Z[,1] - pmx(z[,3], Z[,2] ) Pr(1) mx{pr(3), Pr(2)} positive if lss 1 is the highest proility, else negtive ontor(exp(xp), exp(yp), mtrix(zp, np), dd=t, levels = 0: the ondry where Pr(1) is lrgest
5 STA 414/2104 Mr 11, / 12 Spport Vetor Mhines nder onstrints 1 min β 0,β 2 β 2 + γ ξ i 0, i=1 N ξ i s.t. ξ i 0 i=1 y i (x T i β + β 0 ) 1 ξ i Lgrnge mltipliers: L P = 1 N N 2 β 2 +γ ξ i α i {y i (xi T β+β 0 ) (1 ξ i )} minimize over β, β 0, ξ i i=1 ˆβ = {x i : ˆα i 0} spport vetors N ˆα i x i y i i=1 N µ i ξ i i=1
6 STA 414/2104 Mr 11, 2010 lirry(e1071) lirry(rgl) Code for Spport Vetor Mhines Jen-Frnçois Plnte, U de M ## similr ondry drwing fntions for ## nerl networks et re in Chpter 12 sripts for MASS ondries=fntion(y,,n=100){ # y is the dt, Ê the svm ojet grid=expnd.grid(seq(min(y[,1]),mx(y[,1]),length=n),seq(min(y[,2]),mx(y[,2]),length=n)) points(grid,ph=4,ex=.15,ol=pste(s.hrter(predit(,grid)))) } spports=fntion(y,){ # y is the dt, Ê is the svm ojet points(y[$index,],ex=2) } # Exmples of SVM # y=mtrix(rnorm(200),nol=2)+rep((0,5),eh=50) l=rep(("red","ble"),eh=50) plot(y,ol=l,ph=20) =svm(y,s.ftor(l),kernel="liner") smmry() spports(y,) ondries(y,) 6 / 12
7 STA 414/2104 Mr 11, / 12 Exmple with mislssifition y=mtrix(rnorm(200),nol=2)+rep((0,2),eh=50) l=rep(("red","ble"),eh=50) plot(y,ol=l,ph=20) =svm(y,s.ftor(l),kernel="liner") spports(y,) smmry() fit=s.hrter($fitted) plot(y,ol=l,ph=20) points(y[fit!=l,],ol=fit[fit!=l],ph=5,ex=1.5) ondries(y,)
8 STA 414/2104 Mr 11, 2010 Exmple with irles norm=fntion(x){sqrt(sm(xˆ2))} y=mtrix(rnorm(200),nol=2) y[51:100,]=y[51:100,]+4*y[51:100,]/pply(y[51:100,],1,norm) l=rep(("red","ble"),eh=50) plot(y,ol=l,ph=20) =svm(y,s.ftor(l),kernel="liner") smmry() fit=s.hrter($fitted) points(y[fit!=l,],ol=fit[fit!=l],ph=5,ex=1.5) ondries(y,) =svm(y,s.ftor(l),kernel="rdil") smmry() fit=s.hrter($fitted) plot(y,ol=l,ph=20) points(y[fit!=l,],ol=fit[fit!=l],ph=5,ex=1.5) ondries(y,) plot(y,ol=l,ph=20) points(y[fit!=l,],ol=fit[fit!=l],ph=5,ex=1.5) spports(y,) # Chek new dt y2=mtrix(rnorm(200),nol=2) y2[51:100,]=y2[51:100,]+4*y2[51:100,]/pply(y2[51:100,],1,norm) l=rep(("red","ble"),eh=50) fit=s.hrter(predit(,y2)) plot(y2,ol=fit,ph=20) points(mtrix(y2[fit!=l,],nol=2),ex=1.2) 8 / 12
9 STA 414/2104 Mr 11, / 12 Exmple with mny lsters norm=fntion(x){sqrt(sm(xˆ2))} y=mtrix(rnorm(400),nol=2) y[51:100,]=y[51:100,]+3*y[51:100,]/pply(y[51:100,],1,norm) y[101:150,]=y[101:150,]+(4,4) y[151:200,]=y[151:200,]+6*y[151:200,]/pply(y[151:200,],1,norm) l=rep(("red","ble","green","blk"),eh=50) plot(y,ol=l,ph=20) hk=smple(1:200,20) =svm(y[-hk,],s.ftor(l[-hk]),kernel="rdil") smmry() ondries(y,) spports(y,) fit=s.hrter(predit(,y[hk,])) plot(y[-hk,],ol=l[-hk],ph=20) points(y[hk,],ol=fit,ph=3) # Points with wrong tegory points(mtrix(y[hk[fit!=l[hk]],],nol=2),ol=l[hk[fit!=l[hk]]],ph=7)
10 STA 414/2104 Mr 11, 2010 Exmple with msi files # Rel dt. List of songs. Vriles re sed on the nlysis # of the signl of 30 seonds of msi. # Use tht dt to predit the type of songs. =red.tle("msi_dt_17_10_05.ex",sep=" ")[,-52] x=rry(s.nmeri(s.mtrix([,2:50])),dim()) rem=pply(is.n(x),1,sm) tit=[!rem,1] genre=[!rem,51] x=x[!rem,] x=x[,pply(x,2,sd)!=0] # Visliztion pirs(x[,smple(1:46,5)],ol=l,ph=20) keep=smple(1:46,3); kp=pste("vr",keep); plot3d(x[,keep],size=3,ol=l,xl=kp[1],yl=kp[2 # Remove dt for vlidtion hk=smple(1:1559,200) # Different SVM =svm(x[-hk,],genre[-hk]) sm(predit(,x[hk,])==genre[hk]) 1=svm(x[-hk,],genre[-hk],kernel="liner") sm(predit(1,x[hk,])==genre[hk]) 10 / 12
11 STA 414/2104 Mr 11, / 12 Vry the vle of C /γ 1=svm(x[-hk,],genre[-hk],kernel="liner") sm(predit(1,x[hk,])==genre[hk]) 1=svm(x[-hk,],genre[-hk],kernel="liner",ost=10) sm(predit(1,x[hk,])==genre[hk]) 1=svm(x[-hk,],genre[-hk],kernel="liner",ost=.1) sm(predit(1,x[hk,])==genre[hk]) 1=svm(x[-hk,],genre[-hk],kernel="liner",ost=100) sm(predit(1,x[hk,])==genre[hk]) # Dt from the ook x=mtrix(sn("x.dt"),nol=2) y=sn("y.dt") y=("ornge","le")[2-y] plot(x,ol=y,ph=20) =svm(x,s.ftor(y)) ondries(x,) spports(x,) =svm(x,s.ftor(y),kernel="polynomil",degree=4) ondries(x,) spports(x,)
12 STA 414/2104 Mr 11, 2010 Msi files The Grgend Fetre Set The dt files ontin fetres for most of the dio trks in Grgend dtset. These hve een extrted sing the pproh desried in [Miersw/Morik/2005]. More informtion ot the Grgend dtset nd the dio trks n e fond in [Homrg/etl/2005]. Formt The dtset is represented in the Yle formt nd n e red nd proessed with the Yle pkge ( History We hve revised the former exmpleset, whih n e fond nder " We repled ".mp3" with "_mp3" in the sffixes of the exmple ids, to mke them omptile with the ser txonomies. Also 30 exmples were removed to provide onsisteny with nother exmpleset ontining more fetres whih will e ville soon. Referenes [Homrg/etl/2005] Homrg, Helge nd Miersw,Ingo nd Möller, Bülent nd Morik, Kthrin A Benhmrk Dtset for Adio Clssifition nd Clstering. In Pro. of the Interntionl Symposim on Msi Informtion Retrievl 2005, [Miersw/Morik/2005] Miersw, Ingo nd Morik, Kthrin. Atomti Fetre Extrtion12 for / 12 Cl
Pattern Recognition 2015 Neural Networks (2)
Pttern Reognition 2015 Nerl Networks (2) Ad Feelders Universiteit Utreht Ad Feelders ( Universiteit Utreht ) Pttern Reognition 1 / 37 Error k-propgtion How to ompte the weights in nerl network? Evlte derivtives
More informationLecture 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 informationEngr354: 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 informationHow 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 informationPolynomials. 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 informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationLecture 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 informationChapter 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 informationProbability. 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 informationLinear 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 informationTrigonometry 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 informationSystem 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 informationPre-Lie algebras, rooted trees and related algebraic structures
Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationProject 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 informationA 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 information1 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 informationNON-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 informationVIBRATION ANALYSIS OF AN ISOLATED MASS WITH SIX DEGREES OF FREEDOM Revision G
B Tom Irvine Emil: tom@virtiondt.om Jnur 8, 3 VIBRATION ANALYSIS OF AN ISOLATED MASS WITH SIX DEGREES OF FREEDOM Revision G Introdution An vionis omponent m e mounted with isoltor grommets, whih t s soft
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationActivities. 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 informationTutorial 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 information2. There are an infinite number of possible triangles, all similar, with three given angles whose sum is 180.
SECTION 8-1 11 CHAPTER 8 Setion 8 1. There re n infinite numer of possile tringles, ll similr, with three given ngles whose sum is 180. 4. If two ngles α nd β of tringle re known, the third ngle n e found
More informationTHE 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 informationANALYSIS 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 information9.1 Day 1 Warm Up. Solve the equation = x x 2 = March 1, 2017 Geometry 9.1 The Pythagorean Theorem 1
9.1 Dy 1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 1, 2017 Geometry 9.1 The Pythgoren Theorem 1 9.1 Dy 2 Wrm Up Use the Pythgoren
More information= x x 2 = 25 2
9.1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 7, 2016 Geometry 9.1 The Pythgoren Theorem 1 Geometry 9.1 The Pythgoren Theorem 9.1
More informationCh. 2.3 Counting Sample Points. Cardinality of a Set
Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of
More informationReview 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 informationwhere 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 informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More information4. UNBALANCED 3 FAULTS
4. UNBALANCED AULTS So fr: we hve tudied lned fult ut unlned fult re more ommon. Need: to nlye unlned ytem. Could: nlye three-wire ytem V n V n V n Mot ommon fult type = ingle-phe to ground i.e. write
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
More informationLing 3701H / Psych 3371H: Lecture Notes 9 Hierarchic Sequential Prediction
Ling 3701H / Psyh 3371H: Leture Notes 9 Hierrhi Sequentil Predition Contents 9.1 Complex events.................................... 1 9.2 Reognition of omplex events using event frgments................
More informationCHENG 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 informationSection 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 informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationTest Generation from Timed Input Output Automata
Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted
More informationCS 188: Artificial Intelligence Fall Announcements
CS 188: Artificil Intelligence Fll 2009 Lecture 20: Prticle Filtering 11/5/2009 Dn Klein UC Berkeley Announcements Written 3 out: due 10/12 Project 4 out: due 10/19 Written 4 proly xed, Project 5 moving
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationSpacetime 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 informationHow 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 bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationGM1 Consolidation Worksheet
Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up
More informationp-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 informationPYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:
PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles
More information5.2 Exponent Properties Involving Quotients
5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use
More informationApril 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 informationPolarimetric Target Detector by the use of the Polarisation Fork
Polrimetri rget Detetor y the use of the Polristion For Armndo Mrino¹ hne R Cloude² Iin H Woodhouse¹ ¹he University of Edinurgh, Edinurgh Erth Oservtory (EEO), UK ²AEL Consultnts, Edinurgh, UK POLinAR009
More informationm A 1 1 A ! and AC 6
REVIEW SET A Using sle of m represents units, sketh vetor to represent: NON-CALCULATOR n eroplne tking off t n ngle of 8 ± to runw with speed of 6 ms displement of m in north-esterl diretion. Simplif:
More informationLecture 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 information1B40 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 informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationIntroduction 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 informationAVL Trees. D Oisín Kidney. August 2, 2018
AVL Trees D Oisín Kidne August 2, 2018 Astrt This is verified implementtion of AVL trees in Agd, tking ides primril from Conor MBride s pper How to Keep Your Neighours in Order [2] nd the Agd stndrd lirr
More informationSymmetrical 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 information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationExploring parametric representation with the TI-84 Plus CE graphing calculator
Exploring prmetric representtion with the TI-84 Plus CE grphing clcultor Richrd Prr Executive Director Rice University School Mthemtics Project rprr@rice.edu Alice Fisher Director of Director of Technology
More informationH SERIES. Algebra Basics. Algebra Basics. Solutions. Curriculum Ready.
Alger Bsis H SERIES Alger Bsis Curriulum Rey www.mthletis.om Copyright 009 P Lerning. All rights reserve. First eition printe 009 in Austrli. A tlogue reor for this ook is ville from P Lerning Lt. ISBN
More informationCS 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 informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationChance. Chance. Curriculum Ready.
Curriulum Redy www.mthletis.om This ooklet is ll out the possiility (or hne) of prtiulr events ourring. Mny different gmes involve hne. ere re just few nd the resons why: Crd gmes Bord gmes Guessing gmes
More informationChapter 6 Continuous Random Variables and Distributions
Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete
More informationTable 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 informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationPYTHAGORAS THEOREM,TRIGONOMETRY,BEARINGS AND THREE DIMENSIONAL PROBLEMS
PYTHGORS THEOREM,TRIGONOMETRY,ERINGS ND THREE DIMENSIONL PROLEMS 1.1 PYTHGORS THEOREM: 1. The Pythgors Theorem sttes tht the squre of the hypotenuse is equl to the sum of the squres of the other two sides
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationf (x)dx = f(b) f(a). a b f (x)dx is the limit of sums
Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx
More informationECE223. R eouven Elbaz Office room: DC3576
ECE223 R eouven Elz reouven@uwterloo.c Office room: DC3576 Outline Decoders Decoders with Enle VHDL Exmple Multiplexers Multiplexers with Enle VHDL Exmple From Decoder to Multiplexer 3-stte Gtes Multiplexers
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.
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 informationGeneralization 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 informationCHAPTER 2 FUZZY NUMBER AND FUZZY ARITHMETIC
CHPTER FUZZY NUMBER ND FUZZY RITHMETIC 1 Introdction Fzzy rithmetic or rithmetic of fzzy nmbers is generlistion of intervl rithmetic, where rther thn considering intervls t one constnt level only, severl
More informationCS 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 informationOutline. 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 informationFor the percentage of full time students at RCC the symbols would be:
Mth 17/171 Chpter 7- ypothesis Testing with One Smple This chpter is s simple s the previous one, except it is more interesting In this chpter we will test clims concerning the sme prmeters tht we worked
More informationDiscrete 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 informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion
More informationPythagoras Theorem. The area of the square on the hypotenuse is equal to the sum of the squares on the other two sides
Pythgors theorem nd trigonometry Pythgors Theorem The hypotenuse of right-ngled tringle is the longest side The hypotenuse is lwys opposite the right-ngle 2 = 2 + 2 or 2 = 2-2 or 2 = 2-2 The re of the
More informationQubit and Quantum Gates
Quit nd Quntum Gtes Shool on Quntum omputing @Ygmi Dy, Lesson 9:-:, Mrh, 5 Eisuke Ae Deprtment of Applied Physis nd Physio-Informtis, nd REST-JST, Keio University From lssil to quntum Informtion is physil
More informationTitle of file for HTML: Supplementary Information Description: Supplementary Figures. Title of file for HTML: Peer Review File Description:
Title of file for HTML: Supplementry Informtion Description: Supplementry Figures Title of file for HTML: Peer Review File Description: WTP SST IPO PDO WTP leds IPO PDO Supplementry Figure 1 IPO (or PDO)
More information2. VECTORS AND MATRICES IN 3 DIMENSIONS
2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the
More information2.1 ANGLES AND THEIR MEASURE. y I
.1 ANGLES AND THEIR MEASURE Given two interseting lines or line segments, the mount of rottion out the point of intersetion (the vertex) required to ring one into orrespondene with the other is lled the
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationComparing 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 informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
More information1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationTOPIC: 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 informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1. 1 [(y ) 2 + yy + y 2 ] dx,
MATH3403: Green s Funtions, Integrl Equtions nd the Clulus of Vritions 1 Exmples 5 Qu.1 Show tht the extreml funtion of the funtionl I[y] = 1 0 [(y ) + yy + y ] dx, where y(0) = 0 nd y(1) = 1, is y(x)
More informationContinuous Random Variables
CPSC 53 Systems Modeling nd Simultion Continuous Rndom Vriles Dr. Anirn Mhnti Deprtment of Computer Science University of Clgry mhnti@cpsc.uclgry.c Definitions A rndom vrile is sid to e continuous if there
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationChapter 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 information10 Vector Integral Calculus
Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More information