Gabor window grid (900 samples) dual window (grid) dual window (quincunx) quincunx (800 samples)

Size: px
Start display at page:

Download "Gabor window grid (900 samples) dual window (grid) dual window (quincunx) quincunx (800 samples)"

Transcription

1 alclating th dal Gabor window for gnral sampling sts Ptr Prinz Univrsitat Win, Institt f Mathmatik, U H A G Strdlhofgass 4 tl: ++43 / / fax: ++43 / / mail: prinztychmatniviacat Abstract Mthods for th calclation of th so-calld dal Gabor window for gnral sampling sts ar dvlopd First w considr th standard sitation whr th Tim- Frqncy plan (TF-plan) is (ovr)sampld on a grid, i a rctanglar lattic is considrd with mor points than th dimnsion of th signal spac Scondly w show that th proposd mthoan b asily xtndd to gnral sbgrops of th TF-plan On typical xampl of sch a sampling st is th so calld qincnx-lattic Kywords Gabor transform, Psdo{invrs, dal Gabor fram I Th discrt Gabor rprsntation Lt x (x[n]) n dnot a discrt complx vald signal, i, x is an lmnt of th -dimnsional complx vctor spac Th signal x is considrd to b - priodic, i, if th indx xcds, th vctor is dnd as: x[n] x[n + ] for all n Z: Th tim shift oprator T k ; k Z and th frqncy shift oprator M l ; l Z ar dnd as T k (x) T k (x[]; : : : ; x[ ]) : (x[k]; x[k + ]; : : : ; x[k ]) () M l (x) : (x[]; il x[]; : : : ; i( )l x[ ]): () A st (g i ) of tim-and frqncy shiftopis of a discrt fnction g is calld a Gabor family, if it is of th following form: g i : (M li T ki g); for all (l i ; k i ) H Z Z : (3) If H < Z Z (i H is a sbgrop of Z Z ) thn th fnction g is calld th Gabor window, th family g i ; if;:::;s g is calld Gabor family and th (s)-matrix (s : jhj) G g (g i ) M l T k g M l T k g M ls T ks g A ; (l i; k i ) H; i f; :::; s g (4) is calld th Gabor asic Matrix In or convntion, th rows of G g ar in an incrasing ordr of rst tim shifts and thn frqncy shifts jhj dnots th nmbr of lmnts of H If th rank of G g qals, i, G g sn as a linar mapping from th signal spac into th cocint spac s has fll rank (i rang(g g ) ), thn th st (g i ) is calld a Gabor fram (or complt Gabor family) In this cas vry signal x can b xprssd as a linar combination of (g i ), i x sx i a i g i a i ;, x ag g (5) Formla (5) is calld th Gabor xpansion of x On possibility to obtain th cocint vctor a is []: a x(g g G g) G g xg + g ; (6) whr G + g is calld th psdo-invrs of G g Thorm : (S [], [3]) Lt G g b a Gabor fram d- nd on H < Z Z as in (3)and (4), thn thr is a so calld dal Gabor fram G ~g satisfying x xg ~gg g for all x ; (7) which is of th sam strctr as G g, i G ~g (M li T ki ~g) i,(l i ; k i ) H, whr ~g is calld a dal Gabor window Dal Gabor windows ar not niq []If ~g is obtaind by G ~g G+ g thn ~g has minimal L -norm [4], [5] and is th most orthogonal-lik window [6] II Th calclation of th dal Gabor window In th following sctions w discss dirnt mthods of dtrmining th dal Gabor window ~g W show that th comptational ort of sch algorithms mainly dpnd on th strctr and siz of th sampling st H W always assm that G g has fll rank A Ovrsampling on th grid In th cas of ovrsampling on th grid, th nmbr of sampling points s ab (a; b ar dnd blow) is gratr than th lngth of th Gabor-window Th sflnss of ovrsampling is a consqnc of th alian-low- thorm, which shows that in th cas of critical sampling \nic" Gabor-windows do not hav \nic" dals (g [7]) Lt a b th tim gap and b th frqncy gap of th sampling st H, i l f; b; b; :::; bg; (g i ) ii (M l T k g); (8) k f; a; a; :::; ag:

2 and F b th Forir-Matrix of siz b b (i F kl ilk b i ) Th (s s) matrix F is dnd as F F : : : F A : (9) : : : F Lt th matrix b dnd as F G g, and G b g dnots a b matrix containing th rst b rows of G g Sinc th matrix F is block-diagonal (with blocksiz b ), w xamin th rst b rows of sparatly: kl (FG b g ) kl b X j X b j b g[l] ikj b ilj b g[l] ij b (l k) g[l] for k f; :::; b g if (l k) is a divisor of b othrwis () (any nmbr is considrd to b a divisor of zro) Th nxt b rows of dir from th rst ons in th way, that only th nonvanishing vals ar dirnt Hr th l-th ntry of kl is not jst b g l, bt th indx l is dcrasd by a, th tim-shift gap This lads to th gnral rslt for th matrix : kl b g[l a kb ] if (l k) is a divisor of b othrwis () kb whr dnots th gratst intgr not gratr than kb Mor prcisly looks as in qation () (with b : b ) To mak s of th spars strctr of w nd two prmtation matrics: P r is a (s s) matrix which rarrangs th rows of a (s ) matrix in th following ordr: P r f; ; : : : ; s g! ; a ; a ; : : : ; b b a ; ; a +; ; ab ; (3) g [] : : : g [b ] : : : g [( b )] g [] g[(b +)] : : : g [(b )] g [( a)] : : : g [(b a)] g [(b a+)] Th maning of (3) is th following: row # bcoms row #, row # bcoms row #, row # bcoms row #, tc a a and P c is a ( ) matrix which rarrangs th colmns of a ( ) matrix in th following ordr: P c f; ; : : : ; g! ; b ; b ; ; (b ) b ; ; b +; ; b ; : (4) Mltiplying th matrix from th lft and th right sid by P r and P c, rarrangs th rows anolmns and rslts in a block-diagonal matrix W : W P r P c P r F G g P c W i g [a] g [(a b )] b W : : : W A ; : : : W (b ) (5) g [i] g [(i+b )] : : : g [(i+ b )] g [(i a)] g [(i+b a)] : : : g [(i+ b a)] g [(i ( a))] g [(i ( a)+b )] : : : g [i+a b ] (6) Lmma : If Q is an nitary matrix, thn th following formla holds tr for vry matrix A: A A : (AQ) + Q A + (7) Lmma : If W is a block-diagonal matrix, thn th psdo-invrs W + is also block diagonal in th following way: W + W : : : W : : : W n A + (W ) + : : : (W ) + A : (8) : : : (W n ) + For a proof of ths two lmmata s g [8] ()

3 3 Sinc th matrics P r ; P c and F ar nitary and W is block diagonal, th psdo-invrs of G g is asily calclatd: W P r F G g P c, G g F P r W P c, G g + P c W + F P r : (9) ths colmns (or rows) ar pointwis dirnt, i W i (n ; m ) 6 W i (n ; m ) for all n ; n f; ; :::; a g if jm m j a c ; W i (n ; m ) 6 W i (n ; m ) for all m ; m f; ; :::; bg if jn n j b c : Sbstitting th window fnction g in qation (9) by th dal window fnction ~g givs G ~g F P r f W P c ; () If th siz of W i is gratr or qal ( b c a c ) i a b c and b a c (3) whr W f is similar to W in (5) and (6) rplacing th gi by ~g i In Thorm it is shown that G + g G ~g, which implis that G ~g P c f W P r F P c W + P r F G + g ) f W W + : () Rmark: Th calclation of th dal Gabor window is ths rdcd to th calclation of th psdo-invrs of th blockdiagonal matrix W This is, according to Lmma th calclation of th psdo-invrss of ( b ) matrics of siz ( a b) Eqation (6) shows that vry lmnt of th matrix W i niqly dtrmins on lmnt of th vctor g Thorm and qation () lad to th fact that vry lmnt of ~g is niqly rprsntd by a matrix W + i (for som i) Thrfor th nmbr of matrics W i for which w hav to calclat th psdoinvrs dpnds on th nmbr of dirnt matrics W i, ncssary to rprsnt ach lmnt of th window fnction g at last onc Th following proposition shows that this nmbr is givn by th gratst common divisor of (a; b ) Proposition : Lt fw ; W ; :::; W (b ) g b th family of matrics as dnd in qation (6) Th minimal nmbr of W i rqird to rcovr th window g is givn by th gratst common divisor (gcd) of (a; b ) Proof: According to qation (6) ach lmnt of th matrix W i can b rprsntd in th following way: W i (n; m) g[(i + mb na)]; () whr (n; m) dnots th row-colmn position W show how many dirnt indics (i + mb na) of g[(i + mb na)] in th W i ar possibl for givn ; a; b Sinc g is -priodic (or nit), any indx i qals an indx j if j i + d for som d Z In or notation w will writ: j i Lt c b th gratst common divisor of (a; b ), thn g[i + m b n a] g[i + m b n a];, i + m b n a i + m b n a, (n n ) (m m ) b c a c : This lads to th fact that (m m ) is a mltipl of a c and (n n ) is a mltipl of b c Hnc thr ar m a c colmns (or n b c rows), whr ach two lmnts ot of a vry matrix W i contains a c b b c c mtal dirnt lmnts Hnc w n matrics to rprsnt an - dimnsional vctor Finally w show that inqality (3) always holds tr: b a b c b a c ) c b a ) c b a ) b a: (4) c Q If jj p j is th prim factorization of, than a and b c can b niqly rprsntd by a prodct of ths p j's Sinc a and b c ar rlativ prim, no prim-nmbr p j can b a part of th prim factorization of a and b c This provs inqality (4) Smming p, th calclation of th dal Gabor window can b obtaind by calclating th psdo-invrss of gcd(a; b ) matrics of siz ( a b) A ritical sampling and rdndancy of intgr vals Th cas of critical sampling, i ab, was vry wll dscribd in g [9] Th main ida is, that in th critical cas th matrics W i ar sqar anyclic Hnc th W i ar compltly rprsntd by th rst row and invrtd qickly sing fast Forir transform Th cas of intgr rdndancy, i abd for d I is vry similar to th critical cas In this cas th prodct of W W is a cyclic matrix, anan also asily invrtd by FFT-mthods Sampling on an arbitrary sbgrop of th TF-plan In this sction w calclat th dal Gabor window for mor gnral sampling sts H < Z Z than jst a grid Th ida is to rdc this problm to that of th prvios sction, i H is a grid Sinc a grid is niqly dtrmind by th tim/frqncy gap w nd th following lmma for gnral sbgrops: Lmma 3: If H is a sbgrop of Z Z thn vry row (colmn) of H ithr contains a constant nmbr of lmnts or it contains no lmnt Th narst nighbors x ; x - in th sam row (colmn) - of an lmnt x hav constant distanc d r ( ) to this lmnt Proof: Assm thr ar for lmnts (x; y ); (x; y ); (x; y ); (x; y ) satisfying

4 4 y y > y y d ) (; d) H This lads to th fact, that (x; y ); (x; y ) ar not narst nighbors, bcas (x; y + d) is closr to (x; y ) than (x; y ) Sinc th distanc btwn two narst nighbors is constant, th nmbr of ths lmnts mst also b constant Lmma 3 and Figr show that any H < Z Z may b rprsntd by th smallst row anolmn distanc (d r ; ) and by vry lmnt (y; x) 6 (; ) which satiss y < d r and x < (Th top lft dot of ach box in Figr rprsnts th lmnt (,) of H) In othr words, givn th top lft box of Figr th sampling st H < Z Z is niqly dtrmind Sinc th row-coordinats of H rprsnt th modlation of th signal, w jst "shift" spcic colmns of H in sch a way, that H bcoms a grid, which w call K (S Figr ) W now writ G H g and G K g for th Gabor asic Matrics according to th sampling sts H and K rsp G K g dirs from G H g jst in modlations of svral rows Ths modlations may b obtaind by pointwis mltiplication with a matrix M (dnotd by a dot): G H g M G K g ; (5) According to Figr th matrix M has th following form: Th calclation of th dal Gabor window may now b prformd as dscribd in th prvios sction Th additional ort is jst th modlation of svral vals of g corrsponding to th vals of Wi H bfor and aftr th calclation of th psdoinvrs of W i Figr 3 shows a typical Gabor window and its dals according to a grid and a qincnx lattic Thogh th qincnx lattic has lss lmnts than th grid, th corrsponding dal window is bttr locatd in th sns of scond ordr momnts III onclsion A gnral mthod for th calclation of th dal Gabor window has bn introdcd First w considrd th standard sitation whr th TF-plan is (ovr)sampld on a grid Scondly, w gnralizd this mthod to calclat th dal window for Gabor frams gnratd by mans of an arbitrary sbgrop of th Z Z This covrs th most gnral sampling strctr of th TF-plan, for which it is still tr that thr is jst on singl dal Gabor atom dtrmining th dal fram An algorithm has bn givn Th propsd aproach can b xtndd to highr dimnsions W ar crrntly working on dimnsional and 3 dimnsionsl imag transformations M T ; ; ; M (); M (); M (); M 4 (); M 4 (); M 4 (); ; ; ; M (); M (); M (); M 4 (); M 4 (); M 4 () (6) whr (; : : : ; ) T 8 and M ; M 4 ar as dnd in () Lt m b th nmbr of lmnts (y; x) H satisfying y < d r and x < Th tim gap of K is dc m and th frqncy gap is d r According to (5) thr is a blockdiagonal matrix W K with: W K P r F G K g P c : (7) Sinc th nmbr of blocks of W in (5) qals th nmbr of frqncy shifts pr tim shift, and sinc qation ()-() jst handl with b ( d r ) modlatd vrsions of a signal, thr is a blockdiagonal matrix W H as follows: W H P r F G H g P c: (8) Lt Wi K (Wi H ) b th block matrics of W K (W H ) Whil th matrics Wi K ar as in (6) th matrics Wi H ar dirnt: Th rows of ach W i do not contain vals of g, bt vals of modlatd vrsions of g According to Figr th Wi H hav th following form: W H i d r Acknowldgmnts Th athor wold lik to thank H G Fichtingr T Strohmr and W Kozk for instrctiv discssions and gnral hlp dring his work Th athor acknowldgs partial spport from th Astrian Scinc Fonds \FWF", projct nmbr \S7-MAT" Rfrncs [] J Wxlr and S Raz Discrt Gabor Expansions Signal Procssing, (3):7{, ovmbr 99 [] O hristnsn Atomic dcomposition via projctiv grop rprsntations Rocky Montain J Math, 996 to appar [3] HG Fichtingr, O hristnsn, and T Strohmr A gropthortical approach to Gabor analysis Optical Enginring, 34:697{74, 995 [4] I Dabchis, H Landa, and Z Landa Gabor tim-frqncy lattics and th Wxlr-Raz idntity J For Anal Appl, (4):437{478, 995 [5] AJEM Janssn On rationally ovrsampld Wyl-Hisnbrg frams sbmittd, 995 [6] S Qian and D hn Discrt Gabor Transform IEEE Trans SP, 4(7):49{438, 993 [7] JJ ndtto and DF Walnt Gabor frams for L and rlatd spacs In ndtto J and Frazir M, ditors, Wavlts: Mathmatics and Applications, pags 97{6 R Prss, 993 [8] SL ampbll and D Myr Jr Gnralizd Invrss of Linar Transforms Dovr, 99 [9] DF Stwart, L Pottr, and S Ahalt omptationally attractiv ral Gabor transforms IEEE Trans SSP, pags 77{84, Jan 995 g[i] g[i + d r ] : : : g[i + d r ] (M g)[i dc m ] (M g)[i + d r dc m ] : : : (M g)[(i + d r dc (M 4 g)[i dc m ] (M 4g)[i + d r dc m ] : : : (M 4g)[(i + d r dc g[i 3 dc m ] g[i + d r 3 dc m ] : : : g[(i + d r 3 dc (M g)[i 4 dc m ] (M g)[i + d r 4 dc m ] : : : (M g)[(i + d r 4 dc (M 4 g)[i 5 dc m ] (M 4g)[i + d r 5 dc m ] : : : (M 4g)[(i + d r 5 dc A (9)

5 5 6 d r? - - Fig Sbgrop of Z 8 Z 8 - Fig Gnral sbgrop and lattic H : ) K : Gabor window dal window (grid) grid (9 sampls) dal window (qincnx) qincnx (8 sampls) Fig 3 dal Gabor window according to grid and qincnx lattic (Signal lngth 6, Grionstants a b ) 9 sampls, Qincnx row/colmn distanc d r 3 ) 8 sampls)

6 6 Fig 4 Algorithm to calclat th dal Gabor window according to a qincnx lattic Gabor Dal for Qincnx Lattic Inpt: g; ; d r Otpt: ~g Df: lngth of g, dim(w ) ( )(d r ) h : M dr g, (M as dnd in () ) for k to gcd( dc ; d r ) for i to stp for j to d r stp d r W (i; j) g[k i dc d r ] W (i + ; j + ) h[k (i + ) dc + (j + ) d r ] fw dr (W + ) for i to stp for j to d r stp d r ~g [k i dc + j d r ] f W (i; j) ~g [k (i + ) dc + (j + ) d r ] f W (i + ; j + ) ~g ~g + M dr ~g (Rmark M dr M dr )

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

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

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

Derangements and Applications

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

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

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

Einstein Equations for Tetrad Fields

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

More information

Recounting the Rationals

Recounting the Rationals Rconting th Rationals Nil Calkin and Hrbrt S. Wilf pril, 000 It is wll known (indd, as Pal Erd}os might hav said, vry child knows) that th rationals ar contabl. Howvr, th standard prsntations of this fact

More information

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

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

More information

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

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

11/13/17. directed graphs. CS 220: Discrete Structures and their Applications. relations and directed graphs; transitive closure zybooks

11/13/17. directed graphs. CS 220: Discrete Structures and their Applications. relations and directed graphs; transitive closure zybooks dirctd graphs CS 220: Discrt Strctrs and thir Applications rlations and dirctd graphs; transiti closr zybooks 9.3-9.6 G=(V, E) rtics dgs dgs rtics/ nods Edg (, ) gos from rtx to rtx. in-dgr of a rtx: th

More information

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

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

More information

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

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

More information

Higher order derivatives

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

More information

Addition of angular momentum

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

More information

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

ECE602 Exam 1 April 5, You must show ALL of your work for full credit. ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

a 1and x is any real number.

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

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

2.3 Matrix Formulation

2.3 Matrix Formulation 23 Matrix Formulation 43 A mor complicatd xampl ariss for a nonlinar systm of diffrntial quations Considr th following xampl Exampl 23 x y + x( x 2 y 2 y x + y( x 2 y 2 (233 Transforming to polar coordinats,

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

Homotopy perturbation technique

Homotopy perturbation technique Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,

More information

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

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

More information

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

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

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

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

More information

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

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

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

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

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

More information

1 Isoparametric Concept

1 Isoparametric Concept UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric

More information

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

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

More information

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS Slid DIGITAL SIGAL PROCESSIG UIT I DISCRETE TIME SIGALS AD SYSTEM Slid Rviw of discrt-tim signals & systms Signal:- A signal is dfind as any physical quantity that varis with tim, spac or any othr indpndnt

More information

Where k is either given or determined from the data and c is an arbitrary constant.

Where k is either given or determined from the data and c is an arbitrary constant. Exponntial growth and dcay applications W wish to solv an quation that has a drivativ. dy ky k > dx This quation says that th rat of chang of th function is proportional to th function. Th solution is

More information

Abstract Interpretation: concrete and abstract semantics

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

More information

Multiple-Choice Test Introduction to Partial Differential Equations COMPLETE SOLUTION SET

Multiple-Choice Test Introduction to Partial Differential Equations COMPLETE SOLUTION SET Mltipl-Choic Tst Introdction to Partial Diffrntial Eqations COMPLETE SOLUTION SET 1. A partial diffrntial qation has (A on indpndnt variabl (B two or mor indpndnt variabls (C mor than on dpndnt variabl

More information

Addition of angular momentum

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

More information

Hydrogen Atom and One Electron Ions

Hydrogen Atom and One Electron Ions Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial

More information

Some remarks on Kurepa s left factorial

Some remarks on Kurepa s left factorial Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,

More information

Image Enhancement in the Spatial Domain

Image Enhancement in the Spatial Domain s=tr Eampl PR3.: Eponntials of th form -ar a a positi constant ar sfl for constrcting smooth gra-ll transformation fnctions. Constrct th transformation fnctions haing th gnral shaps shown in th following

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction

More information

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j) INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li

More information

CS 548: Computer Vision Image Transformation: 2D Fourier Transform and Sampling Theory. Spring 2016 Dr. Michael J. Reale

CS 548: Computer Vision Image Transformation: 2D Fourier Transform and Sampling Theory. Spring 2016 Dr. Michael J. Reale CS 548: Comptr Vision Imag Transformation: D Forir Transform and Sampling Thory Spring 016 Dr. Michal J. Ral FOURIER TRANSFORM OF SAMPLED FUNCTION EXAMPLE Sampling Exampl Say w hav th fnction blow, ft,

More information

Search sequence databases 3 10/25/2016

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

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

Outline. Thanks to Ian Blockland and Randy Sobie for these slides Lifetimes of Decaying Particles Scattering Cross Sections Fermi s Golden Rule

Outline. Thanks to Ian Blockland and Randy Sobie for these slides Lifetimes of Decaying Particles Scattering Cross Sections Fermi s Golden Rule Outlin Thanks to Ian Blockland and andy obi for ths slids Liftims of Dcaying Particls cattring Cross ctions Frmi s Goldn ul Physics 424 Lctur 12 Pag 1 Obsrvabls want to rlat xprimntal masurmnts to thortical

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

MA 262, Spring 2018, Final exam Version 01 (Green)

MA 262, Spring 2018, Final exam Version 01 (Green) MA 262, Spring 218, Final xam Vrsion 1 (Grn) INSTRUCTIONS 1. Switch off your phon upon ntring th xam room. 2. Do not opn th xam booklt until you ar instructd to do so. 3. Bfor you opn th booklt, fill in

More information

Section 11.6: Directional Derivatives and the Gradient Vector

Section 11.6: Directional Derivatives and the Gradient Vector Sction.6: Dirctional Drivativs and th Gradint Vctor Practic HW rom Stwart Ttbook not to hand in p. 778 # -4 p. 799 # 4-5 7 9 9 35 37 odd Th Dirctional Drivativ Rcall that a b Slop o th tangnt lin to th

More information

Pipe flow friction, small vs. big pipes

Pipe flow friction, small vs. big pipes Friction actor (t/0 t o pip) Friction small vs larg pips J. Chaurtt May 016 It is an intrsting act that riction is highr in small pips than largr pips or th sam vlocity o low and th sam lngth. Friction

More information

ECE 650 1/8. Homework Set 4 - Solutions

ECE 650 1/8. Homework Set 4 - Solutions ECE 65 /8 Homwork St - Solutions. (Stark & Woods #.) X: zro-man, C X Find G such that Y = GX will b lt. whit. (Will us: G = -/ E T ) Finding -valus for CX: dt = (-) (-) = Finding corrsponding -vctors for

More information

ANALYSIS IN THE FREQUENCY DOMAIN

ANALYSIS IN THE FREQUENCY DOMAIN ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind

More information

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

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

More information

Lecture 6.4: Galois groups

Lecture 6.4: Galois groups Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7

More information

Image Filtering: Noise Removal, Sharpening, Deblurring. Yao Wang Polytechnic University, Brooklyn, NY11201

Image Filtering: Noise Removal, Sharpening, Deblurring. Yao Wang Polytechnic University, Brooklyn, NY11201 Imag Filtring: Nois Rmoval, Sharpning, Dblurring Yao Wang Polytchnic Univrsity, Brooklyn, NY http://wb.poly.du/~yao Outlin Nois rmoval by avraging iltr Nois rmoval by mdian iltr Sharpning Edg nhancmnt

More information

On spanning trees and cycles of multicolored point sets with few intersections

On spanning trees and cycles of multicolored point sets with few intersections On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W

More information

CHAPTER 1. Introductory Concepts Elements of Vector Analysis Newton s Laws Units The basis of Newtonian Mechanics D Alembert s Principle

CHAPTER 1. Introductory Concepts Elements of Vector Analysis Newton s Laws Units The basis of Newtonian Mechanics D Alembert s Principle CHPTER 1 Introductory Concpts Elmnts of Vctor nalysis Nwton s Laws Units Th basis of Nwtonian Mchanics D lmbrt s Principl 1 Scinc of Mchanics: It is concrnd with th motion of matrial bodis. odis hav diffrnt

More information

CS 361 Meeting 12 10/3/18

CS 361 Meeting 12 10/3/18 CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm

More information

Direct Approach for Discrete Systems One-Dimensional Elements

Direct Approach for Discrete Systems One-Dimensional Elements CONTINUUM & FINITE ELEMENT METHOD Dirct Approach or Discrt Systms On-Dimnsional Elmnts Pro. Song Jin Par Mchanical Enginring, POSTECH Dirct Approach or Discrt Systms Dirct approach has th ollowing aturs:

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real.

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real. Midtrm #, Physics 37A, Spring 07. Writ your rsponss blow or on xtra pags. Show your work, and tak car to xplain what you ar doing; partial crdit will b givn for incomplt answrs that dmonstrat som concptual

More information

Title: Vibrational structure of electronic transition

Title: Vibrational structure of electronic transition Titl: Vibrational structur of lctronic transition Pag- Th band spctrum sn in th Ultra-Violt (UV) and visibl (VIS) rgions of th lctromagntic spctrum can not intrprtd as vibrational and rotational spctrum

More information

The minimal entropy martingale measures for exponential additive processes revisited Tsukasa Fujiwara

The minimal entropy martingale measures for exponential additive processes revisited Tsukasa Fujiwara Jornal of Math-for-Indstry, Vol22B-, pp5 25 Th minimal ntropy martingal masrs for xponntial additiv procsss rvisitd Tskasa Fjiwara Rcivd on Jn 2, 2 Abstract Th mimimal ntropy martingal masr for th stochastic

More information

1 Minimum Cut Problem

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

More information

ELECTRON-MUON SCATTERING

ELECTRON-MUON SCATTERING ELECTRON-MUON SCATTERING ABSTRACT Th lctron charg is considrd to b distributd or xtndd in spac. Th diffrntial of th lctron charg is st qual to a function of lctron charg coordinats multiplid by a four-dimnsional

More information

TMMI37, vt2, Lecture 8; Introductory 2-dimensional elastostatics; cont.

TMMI37, vt2, Lecture 8; Introductory 2-dimensional elastostatics; cont. Lctr 8; ntrodctor 2-dimnsional lastostatics; cont. (modifid 23--3) ntrodctor 2-dimnsional lastostatics; cont. W will now contin or std of 2-dim. lastostatics, and focs on a somwhat mor adancd lmnt thn

More information

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS JIAQI JIANG Abstract. This papr studis th rlationship btwn rprsntations of a Li group and rprsntations of its Li algbra. W will mak th corrspondnc in two

More information

Lie Groups HW7. Wang Shuai. November 2015

Lie Groups HW7. Wang Shuai. November 2015 Li roups HW7 Wang Shuai Novmbr 015 1 Lt (π, V b a complx rprsntation of a compact group, show that V has an invariant non-dgnratd Hrmitian form. For any givn Hrmitian form on V, (for xampl (u, v = i u

More information

Reminder: Affine Transformations. Viewing and Projection. Shear Transformations. Transformation Matrices in OpenGL. Specification via Ratios

Reminder: Affine Transformations. Viewing and Projection. Shear Transformations. Transformation Matrices in OpenGL. Specification via Ratios CSCI 420 Comptr Graphics Lctr 5 Viwing and Projction Jrnj Barbic Univrsity o Sothrn Caliornia Shar Transormation Camra Positioning Simpl Paralll Projctions Simpl Prspctiv Projctions [Angl, Ch. 5] Rmindr:

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)

More information

Strongly Connected Components

Strongly Connected Components Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts

More information

Coupled Pendulums. Two normal modes.

Coupled Pendulums. Two normal modes. Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

5.80 Small-Molecule Spectroscopy and Dynamics

5.80 Small-Molecule Spectroscopy and Dynamics MIT OpnCoursWar http://ocw.mit.du 5.80 Small-Molcul Spctroscopy and Dynamics Fall 008 For information about citing ths matrials or our Trms of Us, visit: http://ocw.mit.du/trms. Lctur # 3 Supplmnt Contnts

More information

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

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

More information

Multi-linear Systems and Invariant Theory. in the Context of Computer Vision and Graphics. Class 5: Self Calibration. CS329 Stanford University

Multi-linear Systems and Invariant Theory. in the Context of Computer Vision and Graphics. Class 5: Self Calibration. CS329 Stanford University Mlti-linar Systms and Invariant hory in th ontt of omtr Vision and Grahics lass 5: Slf alibration S39 Stanford Univrsity Amnon Shasha lass 5 Matrial W Will ovr oday h basic qations and conting argmnts

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

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued) Introduction to th Fourir transform Computr Vision & Digital Imag Procssing Fourir Transform Lt f(x) b a continuous function of a ral variabl x Th Fourir transform of f(x), dnotd by I {f(x)} is givn by:

More information

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002 3.4 Forc Analysis of Linkas An undrstandin of forc analysis of linkas is rquird to: Dtrmin th raction forcs on pins, tc. as a consqunc of a spcifid motion (don t undrstimat th sinificanc of dynamic or

More information

EE140 Introduction to Communication Systems Lecture 2

EE140 Introduction to Communication Systems Lecture 2 EE40 Introduction to Communication Systms Lctur 2 Instructor: Prof. Xiliang Luo ShanghaiTch Univrsity, Spring 208 Architctur of a Digital Communication Systm Transmittr Sourc A/D convrtr Sourc ncodr Channl

More information

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 10. The singular integral Introducing S(n) and J(n) Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don

More information

Data Assimilation 1. Alan O Neill National Centre for Earth Observation UK

Data Assimilation 1. Alan O Neill National Centre for Earth Observation UK Data Assimilation 1 Alan O Nill National Cntr for Earth Obsrvation UK Plan Motivation & basic idas Univariat (scalar) data assimilation Multivariat (vctor) data assimilation 3d-Variational Mthod (& optimal

More information

Problem Set #2 Due: Friday April 20, 2018 at 5 PM.

Problem Set #2 Due: Friday April 20, 2018 at 5 PM. 1 EE102B Spring 2018 Signal Procssing and Linar Systms II Goldsmith Problm St #2 Du: Friday April 20, 2018 at 5 PM. 1. Non-idal sampling and rcovry of idal sampls by discrt-tim filtring 30 pts) Considr

More information

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers: APPM 6 Final 5 pts) Spring 4. 6 pts total) Th following parts ar not rlatd, justify your answrs: a) Considr th curv rprsntd by th paramtric quations, t and y t + for t. i) 6 pts) Writ down th corrsponding

More information

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals.

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals. Chaptr 7 Th Hydrogn Atom Background: W hav discussd th PIB HO and th nrgy of th RR modl. In this chaptr th H-atom and atomic orbitals. * A singl particl moving undr a cntral forc adoptd from Scott Kirby

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

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

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

More information

Engineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12

Engineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12 Enginring Bautiful HW #1 Pag 1 of 6 5.1 Two componnts of a minicomputr hav th following joint pdf for thir usful liftims X and Y: = x(1+ x and y othrwis a. What is th probability that th liftim X of th

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

On the irreducibility of some polynomials in two variables

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

More information

Differential Equations

Differential Equations UNIT I Diffrntial Equations.0 INTRODUCTION W li in a world of intrrlatd changing ntitis. Th locit of a falling bod changs with distanc, th position of th arth changs with tim, th ara of a circl changs

More information

Types of Transfer Functions. Types of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters

Types of Transfer Functions. Types of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters Typs of Transfr Typs of Transfr x[n] X( LTI h[n] H( y[n] Y( y [ n] h[ k] x[ n k] k Y ( H ( X ( Th tim-domain classification of an LTI digital transfr function is basd on th lngth of its impuls rspons h[n]:

More information

Solution of Assignment #2

Solution of Assignment #2 olution of Assignmnt #2 Instructor: Alirza imchi Qustion #: For simplicity, assum that th distribution function of T is continuous. Th distribution function of R is: F R ( r = P( R r = P( log ( T r = P(log

More information

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH. C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH

More information