( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

Size: px
Start display at page:

Download "( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1"

Transcription

1 Img Procssing - Lsson 4 Gomtric Oprtions nd Morphing Gomtric Trnsformtion Oprtions dpnd on Pil s Coordints. Contt fr. Indpndnt of pil vlus. f f (, ) (, ) ( f (, ), f ( ) ) I(, ) I', (,) (, ) I(,) I (, ) 2 Empl: Trnsltion f f (, ) 3 (, ) ( 3, ) I (, ) I ' Forwrd v.s. Invrs Mpping Forwrd mpping: Sourc f f (, ) (, ) Trgt Forwrd Mpping Two prolms with forwrd mpping: Hols nd ovrlps. (,) I(,) I (, ) (, ) Solution: Invrs mpping: f, Sourc f ( ) (, ) Trgt Invrs Mpping 3 4 IDC-CG

2 Empl: scling long Forwrd mpping: 2 Sourc Trgt Intrpoltions Wht hppns whn mpping function clcults frctionl pil ddrss? (,) (,) Invrs mpping: / 2 Intrpoltion: gnrts nw pil nlzing th surrounding pils. Sourc Trgt 5 6 Nrst Nighor Intrpoltion Th ssign vlu is tkn from th pil closst to th gnrtd ddrss. Advntg: Fst. Disdvntg: Jggd rsults. Discontinus rsults. Originl Img I (, ) I( round{ f (, )}, round{ f (, )}) Nrst N. Intrpoltion 7 8 IDC-CG 2

3 Originl Img Bilinr Intrpoltion Nrst N. Intrpoltion Th ssignd vlu is n intrmdit vlu twn th four nrst pils. 9 v v w Linr Intrpoltion v Bilinr Intrpoltion Th ssign vlu is wightd sum of th four nrst pils. Ech wight is proportionl to th distnc from ch isting pil. w w w v v v v Isolting v in th ov qution: w w NW V N NE whr w dfin ( α ) w v αv v α w w S SW SE S SW N NW V S 2 SE ( ) NE ( ) N IDC-CG 3

4 Nrst N. Intrpoltion Nrst N. Intrpoltion Bilinr Intrpoltion 3 4 ilinr Intrpoltion Tp of 2DTrnsformtions Trnsltion Scling Rottion Shr Affin Projctiv 5 6 IDC-CG 4

5 Trnsltion Scl Scl (,): (,) (,) Trnslt (,): (,) (,) Scl (2,3) Trnslt(2,4) Scl (2,3) 7 8 How cn w scl n ojct without moving its origin (lowr lft cornr)? Rflction Trnslt(-,-) Scl(-,) Trnslt(,) Scl(2,3) Scl(,-) 9 2 IDC-CG 5

6 Rottion Rott(): cos() sin() - sin() cos() How cn w rott n ojct without moving its origin (lowr lft cornr)? Trnslt(-,-) Rott(9) Trnslt(,) Rott(9) Rott(9) 2 22 Shr Shr (,): (,) (,) Shr(,) Shr(,2) Composition of Trnsformtions Rigid trnsformtion: Trnsltion Rottion (distnc prsrving). Similrit trnsformtion: Trnsltion Rottion uniform Scl (ngl prsrving). Affin trnsformtion: Trnsltion Rottion Scl Shr (prlllism prsrving). Projctiv trnsformtion Will lortd ltr (cross-rtio prsrving) All ov trnsformtions r groups whr Rigid Similrit Affin Projctiv IDC-CG 6

7 IDC-CG 7 25 Rigid Affin Similrit 26 Mtri Nottion Lt s trt th loction (,) s 3 vctor in homognous spc: t t t W Y W X W Y W X W Y X 27 Scl Scl(,): (,) (,) If or r ngtiv, w gt rflction. Invrs: S - (,)S(/,/) 28 Shr, Rottion Shr(,): (,) (,) Rott(): (,) (cossin, -sin cos) Invrs: R - ()R T ()R(-) cos sin sin cos cos sin sin cos

8 IDC-CG 8 29 Trnsltion Trnsltion(,): Invrs: 3 Affin Rprsnts gnrl linr trnsformtion in 2D Euclidn spc. Invrs ffin: Altrntivl: f d c f d c ' ' f d c 3 Projctiv Rprsnts gnrl linr trnsformtion in 2D homognous spc. Prsrvs lins. Prsrvs cross-rtio d 3 d 24 /d 4 d 23 Dos not prsrv prlllism. Cn simult prspctiv projction of plnr scn. h g f d c ; h g f d c h g 32 Trnsformtion Estimtion Lt: f (,,, 2, 3 ) ; f (,,, 2, 3 ) If th mppings r linr in { i } { i } th prmtrs cn stimtd using linr rgrssion.

9 Empl: Affin Trnsformtion c d f Altrntiv rprsnttion c d f Givn k points (P,P 2,..P k ) in 2D tht hv n trnsformd to (P',P' 2,..,P' k ) th ffin trnsformtion: How mn points uniqul dfin th trnsformtion? How cn w find th trnsformtion? Wht cn don if points coordints r in inccurt? H ˆ ˆ min T T ( H H ) H H Img Trnsformtion using Mtl T [ ; c d]; % trnsformtion mtri [r,c] siz(img) Img Wrping nd Morphing Img rctifiction. % crt rr of dstintion, coordints [X,Y]mshgrid(:c,:r); % clcult sourc coordints sourccoor inv(t) * [X(:) Y(:) ] ; % clcult nrst nighor intrpoltion Xs round(sourccoor(,:)); Ys round(sourccoor(2,:)); indfind(xs< Xs>r); Xs(ind); Ys(ind); indfind(ys< Ys>c); Xs(ind); Ys(ind); % clcult nw img nwimg img((xs-).*rys); nwimg(ind); nwimg(ind); nwimg rshp(nwimg,r,c); K frm nimtion. Img Snthsis Fcil prssion. Viwing positions Img Mtmorphosis. Dmo IDC-CG 9

10 Cross-Dissolv (Pil Oprtion) Sourc Img Dstintion Img From: Dmo Ftur Bsd Morphing Morph on shp into nothr shp. Comins pil oprtions nd gomtricl oprtions. Ftur Slction Morph 39 4 IDC-CG

11 Ftur morphing Algorithm: Dfin st of corrsponding fturs in ch img. Dfin n intrmdit configurtion for ch tim stp linrl intrpolting fturs. Wrp sourc img towrds intrmdit img. Wrp dstintion img towrds intrmdit img. Cross-disssolv th two imgs tking th wightd vrg t ch pil. Originl Sourc Img Wrpd Sourc Img sourc tim Cross-dissolv Cross-dissolv of th Originl imgs Cross-dissolv of th Wrpd Imgs dstintion Intrmdit imgs 4 Originl Dst. Img 42 Wrpd Dst Img wrp Ftur sd Wrping Q Cross-dissolv P Cross-dissolv wrp P IDC-CG

12 Q Q P P P P Q Q P P P P IDC-CG 2

13 Q On Lin wrping P Q β R α u v P Sourc Img β R α u v P Dst Img α is th rltiv position long th lin. P 49 α gos from to s R movs from P to. β is th ctul prpndiculr distnc to th lin. Th position of R is mppd into (α,β): R ( α β ) whr R' P' α Q' P' uˆ' βvˆ ' Invrs mpping: R( α, β ) P α Q P uˆ βvˆ u is unit vctor prlll to Q-P v is th unit vctor in th dirction prpndiculr to Q-P 5 Clculting u, v : Multipl Lin Wrping With Multipl lin wrping th point is influncd ch lin. Clcult unit vctors u, v : ( Q P ) û û Q P vˆ û û Clcult α, β : u v α β β ( R P ) û Q P ( P ) vˆ R 5 R α P Q R β R 2 P Q 2 β 2 P 2 Th influnc of ch lin is: p Qi P i W i β i Th vlu p [,] dictts th influnc of th lin lngth. Th vlu is smll numr voiding division zro. Th vlu dtrmins how th rltiv wight diminish s th β incrss WkRk Th finl mpping is: k R Wk 52 Q R β β 2 u 2 P P 2 k Q 2 IDC-CG 3

14 Msh Wrping Empl imgs from: For mor dtils s: Thddus Bir / Ftur-Bsd Img Mtmorphosis Siggrph ' From: Dmo 54 IDC-CG 4

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7 CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr

More information

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example This Wk Computr Grphics Vctors nd Oprtions Vctor Arithmtic Gomtric Concpts Points, Lins nd Plns Eploiting Dot Products CSC 470 Computr Grphics 1 CSC 470 Computr Grphics 2 Introduction Introduction Wh do

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to

More information

Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) I (x,y )

Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) I (x,y ) Geometric Transformation Operations depend on piel s Coordinates. Contet free. Independent of piel values. f f (, ) = ' (, ) = ' I(, ) = I' ( f (, ), f ( ) ), (,) (, ) I(,) I (, ) Eample: Translation =

More information

Lecture 4. Conic section

Lecture 4. Conic section Lctur 4 Conic sction Conic sctions r locus of points whr distncs from fixd point nd fixd lin r in constnt rtio. Conic sctions in D r curvs which r locus of points whor position vctor r stisfis r r. whr

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

CBSE 2015 FOREIGN EXAMINATION

CBSE 2015 FOREIGN EXAMINATION CBSE 05 FOREIGN EXAMINATION (Sris SSO Cod No 65//F, 65//F, 65//F : Forign Rgion) Not tht ll th sts hv sm qustions Onl thir squnc of pprnc is diffrnt M Mrks : 00 Tim Allowd : Hours SECTION A Q0 Find th

More information

Elliptical motion, gravity, etc

Elliptical motion, gravity, etc FW Physics 130 G:\130 lctur\ch 13 Elliticl motion.docx g 1 of 7 11/3/010; 6:40 PM; Lst rintd 11/3/010 6:40:00 PM Fig. 1 Elliticl motion, grvity, tc minor xis mjor xis F 1 =A F =B C - D, mjor nd minor xs

More information

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS MASTER CLASS PROGRAM UNIT SPECIALIST MATHEMATICS SEMESTER TWO WEEK WRITTEN EXAMINATION SOLUTIONS FOR ERRORS AND UPDATES, PLEASE VISIT WWW.TSFX.COM.AU/MC-UPDATES QUESTION () Lt p ( z) z z z If z i z ( is

More information

Polygons POLYGONS.

Polygons POLYGONS. Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon

More information

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

More information

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations. Dy : Mondy 5 inuts. Ovrviw of th PH47 wsit (syllus, ssignnts tc.). Coupld oscilltions W gin with sss coupld y Hook's Lw springs nd find th possil longitudinl) otion of such syst. W ll xtnd this to finit

More information

Chem 104A, Fall 2016, Midterm 1 Key

Chem 104A, Fall 2016, Midterm 1 Key hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn

More information

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Fundamental Algorithms for System Modeling, Analysis, and Optimization Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd

More information

MATHEMATICS FOR MANAGEMENT BBMP1103

MATHEMATICS FOR MANAGEMENT BBMP1103 Objctivs: TOPIC : EXPONENTIAL AND LOGARITHM FUNCTIONS. Idntif pnntils nd lgrithmic functins. Idntif th grph f n pnntil nd lgrithmic functins. Clcult qutins using prprtis f pnntils. Clcult qutins using

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Construction 11: Book I, Proposition 42

Construction 11: Book I, Proposition 42 Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th

More information

UNIT # 08 (PART - I)

UNIT # 08 (PART - I) . r. d[h d[h.5 7.5 mol L S d[o d[so UNIT # 8 (PRT - I CHEMICL INETICS EXERCISE # 6. d[ x [ x [ x. r [X[C ' [X [[B r '[ [B [C. r [NO [Cl. d[so d[h.5 5 mol L S d[nh d[nh. 5. 6. r [ [B r [x [y r' [x [y r'

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Miscellaneous open problems in the Regular Boundary Collocation approach

Miscellaneous open problems in the Regular Boundary Collocation approach Miscllnous opn problms in th Rgulr Boundry Colloction pproch A. P. Zilińsi Crcow Univrsity of chnology Institut of Mchin Dsign pz@mch.p.du.pl rfftz / MFS Confrnc ohsiung iwn 5-8 Mrch 0 Bsic formultions

More information

WORKSHOP 6 BRIDGE TRUSS

WORKSHOP 6 BRIDGE TRUSS WORKSHOP 6 BRIDGE TRUSS WS6-2 Workshop Ojtivs Lrn to msh lin gomtry to gnrt CBAR lmnts Bom fmilir with stting up th CBAR orinttion vtor n stion proprtis Lrn to st up multipl lo ss Lrn to viw th iffrnt

More information

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

temperature T speed v time t density ρ scalars may be constant or may be variable yes distributive a(b+c) = ab+ac

temperature T speed v time t density ρ scalars may be constant or may be variable yes distributive a(b+c) = ab+ac Mthmtics Riw. Sclr mthmticl ntity tht hs mgnitud only.g.: tmprtur T spd tim t dnsity ρ sclrs my constnt or my ril Lws of Algr for Sclrs: ys commutti ys ssociti (c) ()c ys distriuti (c) c Fith A. Morrison,

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

I. The Connection between Spectroscopy and Quantum Mechanics

I. The Connection between Spectroscopy and Quantum Mechanics I. Th Connction twn Spctroscopy nd Quntum Mchnics On of th postults of quntum mchnics: Th stt of systm is fully dscrid y its wvfunction, Ψ( r1, r,..., t) whr r 1, r, tc. r th coordints of th constitunt

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000 Highr Mthmtics UNIT Mthmtics HSN000 This documnt ws producd spcilly for th HSN.uk.nt wbsit, nd w rquir tht ny copis or drivtiv works ttribut th work to Highr Still Nots. For mor dtils bout th copyright

More information

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

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

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

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

Continuous Random Variables: Basics

Continuous Random Variables: Basics Continuous Rndom Vrils: Bsics Brlin Chn Dprtmnt o Computr Scinc & Inormtion Enginring Ntionl Tiwn Norml Univrsit Rrnc: - D.. Brtss, J. N. Tsitsilis, Introduction to roilit, Sctions 3.-3.3 Continuous Rndom

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

Introduction to Multicopter Design and Control

Introduction to Multicopter Design and Control Introduction to Multicoptr Dsign and Control Lsson 05 Coordinat Systm and Attitud Rprsntation Quan Quan, Associat Profssor _uaa@uaa.du.cn BUAA Rlial Flight Control Group, http://rfly.uaa.du.cn/ Bihang

More information

The Theory of Small Reflections

The Theory of Small Reflections Jim Stils Th Univ. of Knss Dt. of EECS 4//9 Th Thory of Smll Rflctions /9 Th Thory of Smll Rflctions Rcll tht w nlyzd qurtr-wv trnsformr usg th multil rflction viw ot. V ( z) = + β ( z + ) V ( z) = = R

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS VSRT MEMO #05 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 01886 Fbrury 3, 009 Tlphon: 781-981-507 Fx: 781-981-0590 To: VSRT Group From: Aln E.E. Rogrs Subjct: Simplifid

More information

2008 AP Calculus BC Multiple Choice Exam

2008 AP Calculus BC Multiple Choice Exam 008 AP Multipl Choic Eam Nam 008 AP Calculus BC Multipl Choic Eam Sction No Calculator Activ AP Calculus 008 BC Multipl Choic. At tim t 0, a particl moving in th -plan is th acclration vctor of th particl

More information

= x. I (x,y ) Example: Translation. Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) Forward mapping:

= x. I (x,y ) Example: Translation. Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) Forward mapping: Gomric Transormaion Oraions dnd on il s Coordinas. Con r. Indndn o il valus. (, ) ' (, ) ' I (, ) I ' ( (, ), ( ) ), (,) (, ) I(,) I (, ) Eaml: Translaion (, ) (, ) (, ) I(, ) I ' Forward Maing Forward

More information

The Z transform techniques

The Z transform techniques h Z trnfor tchniqu h Z trnfor h th rol in dicrt yt tht th Lplc trnfor h in nlyi of continuou yt. h Z trnfor i th principl nlyticl tool for ingl-loop dicrt-ti yt. h Z trnfor h Z trnfor i to dicrt-ti yt

More information

However, many atoms can combine to form particular molecules, e.g. Chlorine (Cl) and Sodium (Na) atoms form NaCl molecules.

However, many atoms can combine to form particular molecules, e.g. Chlorine (Cl) and Sodium (Na) atoms form NaCl molecules. Lctur 6 Titl: Fundmntls of th Quntum Thory of molcul formtion Pg- In th lst modul, w hv discussd out th tomic structur nd tomic physics to undrstnd th spctrum of toms. Howvr, mny toms cn comin to form

More information

HIGHER ORDER DIFFERENTIAL EQUATIONS

HIGHER ORDER DIFFERENTIAL EQUATIONS Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

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

More information

INF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep

INF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep INF5820/INF9820 LANGUAGE TECHNOLOGICAL ALICATIONS Jn Tor Lønning Lctur 4 4 Sp. 206 tl@ii.uio.no Tody 2 Sttisticl chin trnsltion: Th noisy chnnl odl Word-bsd Trining IBM odl 3 SMT xpl 4 En kokk lgd n rtt

More information

Limits Indeterminate Forms and L Hospital s Rule

Limits Indeterminate Forms and L Hospital s Rule Limits Indtrmint Forms nd L Hospitl s Rul I Indtrmint Form o th Tp W hv prviousl studid its with th indtrmint orm s shown in th ollowin mpls: Empl : Empl : tn [Not: W us th ivn it ] Empl : 8 h 8 [Not:

More information

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S. ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both

More information

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

Weighted Matching and Linear Programming

Weighted Matching and Linear Programming Wightd Mtching nd Linr Progrmming Jonthn Turnr Mrch 19, 01 W v sn tht mximum siz mtchings cn b found in gnrl grphs using ugmnting pths. In principl, this sm pproch cn b pplid to mximum wight mtchings.

More information

KOHN LUTTINGER SUPERCONDUCTIVITY IN GRAPHENE

KOHN LUTTINGER SUPERCONDUCTIVITY IN GRAPHENE KOHN LUTTINGER SUPERCONDUCTIITY IN GRAPHENE J. Gonzálz Instituto d Estructur d l Mtri, CSIC, Spin Is it possibl to hv suprconducting instbility in grphn (by suitbl doping)? Thr hv bn lrdy svrl proposls

More information

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH -D AMA MODEL PAAMETE ESTIMATION BASED ON THE EQUIVALENT -D A MODEL APPOAH Ayın Kıılky Ahmt Hmi Kyrn -mil: yin@hituutr -mil: kyrn@hituutr Istnul Tchnicl Univrsity, Fculty of Elctricl n Elctronics Enginring,

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2 CS 540 Spring 2013 Th Cours covrs: Lxicl Anlysis Syntx Anlysis Smntic Anlysis Runtim nvironmnts Cod Gnrtion Cod Optimiztion CS 540 Spring 2013 GMU 2 Pr-rquisit courss Strong progrmming ckground in C, C++

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

Chapter 6 Polarization and Crystal Optics

Chapter 6 Polarization and Crystal Optics EE 485, Winter 4, Lih Y. Lin Chpter 6 Polriztion nd Crstl Optics - Polriztion Time course of the direction of E ( r, t - Polriztion ffects: mount of light reflected t mteril interfces. bsorption in some

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Uses of transformations. 3D transformations. Review of vectors. Vectors in 3D. Points vs. vectors. Homogeneous coordinates S S [ H [ S \ H \ S ] H ]

Uses of transformations. 3D transformations. Review of vectors. Vectors in 3D. Points vs. vectors. Homogeneous coordinates S S [ H [ S \ H \ S ] H ] Uses of trnsformtions 3D trnsformtions Modeling: position nd resize prts of complex model; Viewing: define nd position the virtul cmer Animtion: define how objects move/chnge with time y y Sclr (dot) product

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k. Finit Automt Bsic id: FA is mchin tht chngs stts whil procssing symols, on t tim. Finit st of stts: Q = {q 0, q 1, q 3,..., q k } Trnsition function: Initil stt: Finl stts: d: Q S Q q 0 Q F Q Finit utomton

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

More information

Sliding mode control of photoelectric tracking platform based on the inverse system method

Sliding mode control of photoelectric tracking platform based on the inverse system method AEC Wb of Confrncs, 6 DOI:.5/ mtcconf/ 6 C Ownd b th uthors, publishd b EDP Scincs, 6 Sliding mod control of photolctric trcking pltform bsd on th invrs sstm mthod Zong Chn Yo,, H Zhng,b School of chnicl

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing VLSI Dsin Vriiction n Tstin Fult Simultion Mohmm Thrnipoor Elctricl n Computr Eninrin Univrsity o Conncticut Ovrviw Prolm n motivtion Fult simultion lorithms Sril Prlll Ductiv Concurrnt Othr lorithms Rnom

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

CMSC 828D: Fundamentals of Computer Vision Homework 4

CMSC 828D: Fundamentals of Computer Vision Homework 4 CMSC 828D: Fundmentls of Computer Vision Homework 4 nstructors: Lrry Dvis, Rmni Duriswmi, Dniel DeMenthon, nd Yinnis loimonos Solution sed on homework sumitted y Hiying Liu. Show y direct clcultion for

More information

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016 Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac

More information

Oppgavesett kap. 6 (1 av..)

Oppgavesett kap. 6 (1 av..) Oppgvstt kp. 6 (1 v..) hns.brnn@go.uio.no Problm 1 () Wht is homognous nucltion? Why dos Figur 6.2 in th book show tht w won't gt homognous nucltion in th tmosphr? ˆ Homognous nucltion crts cloud droplts

More information

ROTATION IN 3D WORLD RIGID BODY MOTION

ROTATION IN 3D WORLD RIGID BODY MOTION OTATION IN 3D WOLD IGID BODY MOTION igid Bod Motion Simultion igid bod motion Eqution of motion ff mmvv NN ddiiωω/dddd Angulr velocit Integrtion of rottion nd it s eression is necessr. Simultion nd Eression

More information

DIFFERENTIAL EQUATION

DIFFERENTIAL EQUATION MD DIFFERENTIAL EQUATION Sllabus : Ordinar diffrntial quations, thir ordr and dgr. Formation of diffrntial quations. Solution of diffrntial quations b th mthod of sparation of variabls, solution of homognous

More information

Basic Polyhedral theory

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

More information

Lecture: Experimental Solid State Physics Today s Outline

Lecture: Experimental Solid State Physics Today s Outline Lctur: Exprimntl Solid Stt Physics Tody s Outlin Structur of Singl Crystls : Crystl systms nd Brvis lttics Th primitiv unit cll Crystl structurs with multi-tomic bsis Ttrhdrl nd octhdrl voids in lttics

More information