Kernels. ffl A kernel K is a function of two objects, for example, two sentence/tree pairs (x1; y1) and (x2; y2)
|
|
- Francis McDaniel
- 5 years ago
- Views:
Transcription
1 Krnls krnl K is a function of two ojcts, for xampl, two sntnc/tr pairs (x1; y1) an (x2; y2) K((x1; y1); (x2; y2)) Intuition: K((x1; y1); (x2; y2)) is a masur of th similarity (x1; y1) twn (x2; y2) an ormally: K((x1; y1); (x2; y2)) is a krnl if it can shown that thr is som fatur vctor Φ(x; y) mapping such that for all x1; y1; x2; y2 K((x1; y1); (x2; y2)) = Φ(x1; y1) Φ(x2; y2)
2 (Trivial) xampl of a Krnl ivn an xisting fatur vctor rprsntation Φ,fin K((x1; y1); (x2; y2)) = Φ(x1; y1) Φ(x2; y2)
3 K((x 1 ;y 1 ); (x 2 ;y 2 )) = (1 + Φ(x 1 ;y 1 ) Φ(x 2 ;y 2 )) 2 Mor Intrsting Krnl ivn an xisting fatur vctor rprsntation Φ, fin This can shown to an innr prouct in a nw spac Φ 0,whrΦ 0 contains all quaratic trms of Φ Mor gnrally, K((x 1 ;y 1 ); (x 2 ;y 2 )) = (1 + Φ(x 1 ;y 1 ) Φ(x 2 ;y 2 )) p can shown to an innr prouct in a nw spac Φ 0,whrΦ 0 contains all polynomial trms of Φ up to gr p Qustion: can w com up with spcializ krnls for NLP structurs?
4 Trs NLP Structurs S NP VP John saw NP Mary Tagg squncs,.g., nam ntity tagging S N N N S j j j j j j Napolon onapart was xil to la S = Start ntity = ontinu ntity N = Not an ntity
5 Φ maps a structur to a fatur vctor 2 R atur Vctors: Φ Φ fins th rprsntation of a structur S NP VP Sh announc NP NP VP a program to VP promot NP safty PP in NP NP trucks an NP vans Φ + 0; 2; 0; 0; 15; 5i h1;
6 aturs fatur is a function on a structur,.g., h(x) = Numr of tims is sn in x T 1 f g T 2 h c h(t 1 ) = 1 h(t 2 ) = 2
7 T 1 T 2 atur Vctors st of functions h1 : : : h fin a fatur vctor Φ(x) = hh1(x); h2(x) : : : h (x)i f g h c Φ(T 2 ) = h2; 0; 1; 1i Φ(T 1 ) = h1; 0; 0; 3i
8 ll Sutrs Rprsntation [o, 1998] ivn: Non-Trminal symols f; ; : : :g Trminal fa; ; c : : :g symols n infinit st of sutrs ::: n infinit st of faturs,.g., h3(x; y) = Numr of tims is sn in (x; y)
9 ll Su-fragmnts for Tagg Squncs Trminal symols fa; ; c; : : :g ivn: Stat symols fs; ; N g S S n infinit st of su-fragmnts j a S S j : : : n infinit st of faturs,.g., h3(x) = Numr of tims S j is sn in x
10 X Innr Proucts Φ(x) = hh1(x); h2(x) : : : h (x)i Innr prouct ( Krnl ) twn two structurs T1 an T2: Φ(T1) Φ(T2) = h i (T1)h i (T2) i=1 T2 T1 f g h c Φ(T1) = h1; 0; 0; 3i Φ(T2) = h2; 0; 1; 1i Φ(T1) Φ(T2) = = 5
11 ll Sutrs Rprsntation ivn: Non-Trminal symols f; ; : : :g Trminal fa; ; c : : :g symols n infinit st of sutrs ::: Stp 1: hoos an (aritrary) mapping from sutrs to intgrs h i (x) = Numr of tims sutr i is sn in x Φ(x) = hh1(x); h2(x); h3(x) : : :i
12 Φ is now hug ll Sutrs Rprsntation ut innr prouct Φ(T 1 ) Φ(T 2 ) can comput fficintly using ynamic programming.
13 omputing th Innr Prouct fin N1 an N2 ar sts of nos in T1 an T2 rspctivly. I i (x) = ( if i th sutr is root at x. 1 othrwis: 0 ollows that: h i (T1) = P n 1 2N 1 I i (n1) an h i (T2) = P n 2 2N 2 I i (n2) Φ(T1) Φ(T2) = P i h i (T1)h i (T2) = P i (P n 1 2N 1 I i (n1)) ( P n 2 2N 2 I i (n2)) P P = 2N 1 n 2 2N 2 Pi I i (n1)i i (n2) n 1 = P n 1 2N 1 Pn 2 2N 2 (n1; n2) whr (n1; n2) = P i I i (n1)i i (n2) is th numr of common sutrs at n1; n2
14 n xampl T 1 f g T 2 h i Φ(T 1 ) Φ(T 2 ) = (; )+ (; ) :::+ (; )+ (; ) :::+ (; ) Most of ths trms ar 0 (.g. (; )). Som ar non-zro,.g. (; ) = 4
15 Rcursiv finition of (n1; n2) If th prouctions at n1 an n2 ar iffrnt (n1; n2) = 0 ls if n1; n2 ar pr-trminals, (n1; n2) = 1 ls 1 ) Y nc(n (n1; n2) = (1 + (ch(n1; j); ch(n2; j))) j=1 is numr of chilrn of no n1; nc(n1) j) is th j th chil of n1. ch(n1;
16 Illustration of th Rcursion f g h i How many sutrs o nos an hav in common? i.., What is (; )? (; ) = 4 (; ) = 1 (; ) = ( (; ) + 1) ( (; ) + 1) = 10
17
18 Th Innr Prouct for Tagg Squncs fin N1 an N2 to sts of stats in T1 an T2 rspctivly. y a similar argumnt, whr (n1; n2) is numr of common su-fragmnts at n1; n2 Φ(T1) Φ(T2) = P n 1 2N 1 Pn 2 2N 2 (n1; n2).g., T1 = j j 2 j = j a c T j j j j a 1 ) Φ(T 2 ) = (; )+ (; ) :::+ (; )+ (; ) :::+ (; ) Φ(T (; ) =.g., 4, j j
19 Th Rcursiv finition for Tagg Squncs fin N (n) = stat following n, W (n) = wor at stat n fin ß[W (n1); W (n2)] = 1 iff W (n1) = W (n2) Thn if lals at n1 an n2 ar th sam, (n1; n2) = (1+ß[W (n1); W (n2)]) (1+ (N (n1); N (n2)).g., T1 = j j 2 j = j a c T j j j j a (; ) = (1 + ß[a; a]) (1 + (; )) = (1 + 1) (1 + 4) = 10
20 Rfinmnts of th Krnls Inclu log proaility from th aslin mol: Φ(T1) is rprsntation unr all su-fragmnts krnl L(T1) is log proaility unr aslin mol Nw rprsntation Φ 0 whr Φ 0 (T1) Φ 0 (T2) = fil(t1)l(t2) + Φ(T1) Φ(T2) (inclus L(T1) as an aitional componnt with wight p fi) llows th prcptron to us original ranking as fault
21 X Rfinmnts of th Krnls ownwighting largr su-fragmnts SIZ i h i (T1)h i (T2) whr 0 <» 1, i=1 SIZ i is numr of stats/ruls in i th fragmnt Simpl moification to rcursiv finitions,.g., (n1; n2) = (1+ß[W (n1); W (n2)]) (1+ (N (n1); N (n2))
22 (n1; n2) = (1+ß[W (n1); W (n2)]) (1+ (N (n1); N (n2)) Rfinmnt of th Tagging Krnl Su-fragmnts snsitiv to splling faturs (.g., apitalization) fin ß[x; y] = 1 if x an y ar intical, y] = 0:5 if x an y shar sam capitalization faturs ß[x; N N S j j j xil to la N N S j j j xil to ap Su-fragmnts now inclu capitalization faturs N N S j j j No cap to ap N N S j j j No cap No cap ap
23 Parsing Wall Strt Journal xprimntal Rsults» 0 2 MOL 100 Wors (2416 sntncs) LR LP s s s O % 88.3% % 85.1% VP 88.6% 88.9% % 86.3% VP givs 5.1% rlativ ruction in rror (O99 = my thsis parsr) Nam ntity Tagging on W ata P R Max-nt 84.4% 86.3% 85.3% Prc. 86.1% 89.1% 87.6% Improvmnt 10.9% 20.4% 15.6% VP givs 15.6% rlativ ruction in rror
24 Summary or any rprsntation Φ(x), fficint computation Φ(x) Φ(y) ) of fficint larning through krnl form of th prcptron ynamic programming can us to calculat Φ(x) Φ(y) unr all su-fragmnts rprsntations Svral rfinmnts of th innr proucts: Incluing proailitis from aslin mol ownwighting largr su-fragmnts Snsitivity to splling faturs
6.891: Lecture 24 (December 8th, 2003) Kernel Methods
6.891: Lecture 24 (December 8th, 2003) Kernel Methods Overview ffl Recap: global linear models ffl New representations from old representations ffl computational trick ffl Kernels for NLP structures ffl
More informationLR(0) Analysis. LR(0) Analysis
LR() Analysis LR() Conlicts: Introuction Whn constructing th LR() analysis tal scri in th prvious stps, it has not n possil to gt a trministic analysr, caus thr ar svral possil actions in th sam cll. I
More informationThe second condition says that a node α of the tree has exactly n children if the arity of its label is n.
CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is
More information10. EXTENDING TRACTABILITY
Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What
More informationLie 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 informationIntroduction 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 informationAddition 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 informationAddition 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 informationChapter 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 informationThe pn junction: 2 Current vs Voltage (IV) characteristics
Th pn junction: Currnt vs Voltag (V) charactristics Considr a pn junction in quilibrium with no applid xtrnal voltag: o th V E F E F V p-typ Dpltion rgion n-typ Elctron movmnt across th junction: 1. n
More informationMultiple Short Term Infusion Homework # 5 PHA 5127
Multipl Short rm Infusion Homwork # 5 PHA 527 A rug is aministr as a short trm infusion. h avrag pharmacokintic paramtrs for this rug ar: k 0.40 hr - V 28 L his rug follows a on-compartmnt boy mol. A 300
More informationFinal Exam Solutions
CS 2 Advancd Data Structurs and Algorithms Final Exam Solutions Jonathan Turnr /8/20. (0 points) Suppos that r is a root of som tr in a Fionacci hap. Assum that just for a dltmin opration, r has no childrn
More informationFirst order differential equation Linear equation; Method of integrating factors
First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial
More informationSCHUR 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 informationPipe 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 informationEinstein 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 informationPropositional 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 informationChemical Physics II. More Stat. Thermo Kinetics Protein Folding...
Chmical Physics II Mor Stat. Thrmo Kintics Protin Folding... http://www.nmc.ctc.com/imags/projct/proj15thumb.jpg http://nuclarwaponarchiv.org/usa/tsts/ukgrabl2.jpg http://www.photolib.noaa.gov/corps/imags/big/corp1417.jpg
More information2008 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 informationThe 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 informationSection 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 informationRoadmap. 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 informationMath 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 informationEEO 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 informationThe 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 informationAdditional Math (4047) Paper 2 (100 marks) y x. 2 d. d d
Aitional Math (07) Prpar b Mr Ang, Nov 07 Fin th valu of th constant k for which is a solution of th quation k. [7] Givn that, Givn that k, Thrfor, k Topic : Papr (00 marks) Tim : hours 0 mins Nam : Aitional
More informationECE602 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 informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
More informationAs the matrix of operator B is Hermitian so its eigenvalues must be real. It only remains to diagonalize the minor M 11 of matrix B.
7636S ADVANCED QUANTUM MECHANICS Solutions Spring. Considr a thr dimnsional kt spac. If a crtain st of orthonormal kts, say, and 3 ar usd as th bas kts, thn th oprators A and B ar rprsntd by a b A a and
More informationu 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 informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
More informationA Uniform Approach to Three-Valued Semantics for µ-calculus on Abstractions of Hybrid Automata
A Uniform Approach to Thr-Valud Smantics for µ-calculus on Abstractions of Hybrid Automata (Haifa Vrification Confrnc 2008) Univrsity of Kaisrslautrn Octobr 28, 2008 Ovrviw 1. Prliminaris and 2. Gnric
More informationSPH4U Electric Charges and Electric Fields Mr. LoRusso
SPH4U lctric Chargs an lctric Fils Mr. LoRusso lctricity is th flow of lctric charg. Th Grks first obsrv lctrical forcs whn arly scintists rubb ambr with fur. Th notic thy coul attract small bits of straw
More information4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16.
. 7 7 7... 7 7 (n )0 7 (M) 0(n ) 00 n (A) S ((7) 0(0)) (M) (7 00) 8897 (A). (5a b) 7 7... (5a)... (M) 7 5 5 (a b ) 5 5 a b (M)(A) So th cofficint is 75 (A) (C) [] S (7 7) (M) () 8897 (A) (C) [] 5. x.55
More informationData 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 informationENGR 323 BHW 15 Van Bonn 1/7
ENGR 33 BHW 5 Van Bonn /7 4.4 In Eriss and 3 as wll as man othr situations on has th PDF o X and wishs th PDF o Yh. Assum that h is an invrtibl untion so that h an b solvd or to ild. Thn it an b shown
More informationConstruction 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 informationSupplementary Material for. Robust Reconstruction of Complex Networks from Sparse Data
Supplmntary Matrial for Roust Rconstruction of Complx Ntworks from Spars Contnts 1 Prformanc assssmnt 2 2 Dtail rsults in aition to Tal I an II in th main txt 2 3 of mpirical ntworks 3 4 Infrring intrinsic
More informationRecall 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 information2F1120 Spektrala transformer för Media Solutions to Steiglitz, Chapter 1
F110 Spktrala transformr för Mdia Solutions to Stiglitz, Chaptr 1 Prfac This documnt contains solutions to slctd problms from Kn Stiglitz s book: A Digital Signal Procssing Primr publishd by Addison-Wsly.
More informationChapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover
Coping With NP-Compltnss Chaptr 0 Extning th Limits o Tractability Q. Suppos I n to solv an NP-complt problm. What shoul I o? A. Thory says you'r unlikly to in poly-tim algorithm. Must sacriic on o thr
More informationLearning Spherical Convolution for Fast Features from 360 Imagery
Larning Sphrical Convolution for Fast Faturs from 36 Imagry Anonymous Author(s) 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 In this fil w provid additional dtails to supplmnt th main papr
More informationSection 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 informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationBINOMIAL 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 informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More information2. Finite Impulse Response Filters (FIR)
.. Mthos for FIR filtrs implmntation. Finit Impuls Rspons Filtrs (FIR. Th winow mtho.. Frquncy charactristic uniform sampling. 3. Maximum rror minimizing. 4. Last-squars rror minimizing.. Mthos for FIR
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationInference Methods for Stochastic Volatility Models
Intrnational Mathmatical Forum, Vol 8, 03, no 8, 369-375 Infrnc Mthods for Stochastic Volatility Modls Maddalna Cavicchioli Cá Foscari Univrsity of Vnic Advancd School of Economics Cannargio 3, Vnic, Italy
More informationThe 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 information6. The Interaction of Light and Matter
6. Th Intraction of Light and Mattr - Th intraction of light and mattr is what maks lif intrsting. - Light causs mattr to vibrat. Mattr in turn mits light, which intrfrs with th original light. - Excitd
More informationAbstract 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 informationThere 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 informationExamples and applications on SSSP and MST
Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs
More informationINTEGRATION BY PARTS
Mathmatics Rvision Guids Intgration by Parts Pag of 7 MK HOME TUITION Mathmatics Rvision Guids Lvl: AS / A Lvl AQA : C Edcl: C OCR: C OCR MEI: C INTEGRATION BY PARTS Vrsion : Dat: --5 Eampls - 6 ar copyrightd
More informationThat 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 informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More informationCase Study Vancomycin Answers Provided by Jeffrey Stark, Graduate Student
Cas Stuy Vancomycin Answrs Provi by Jffry Stark, Grauat Stunt h antibiotic Vancomycin is liminat almost ntirly by glomrular filtration. For a patint with normal rnal function, th half-lif is about 6 hours.
More informationINC 693, 481 Dynamics System and Modelling: Linear Graph Modeling II Dr.-Ing. Sudchai Boonto Assistant Professor
INC 69, 48 Dynamics Systm and Modlling: Linar Graph Modling II Dr.-Ing. Sudchai Boonto Assistant Profssor Dpartmnt of Control Systm and Instrumntation Enginring King Mongkut s Unnivrsity of Tchnology Thonuri
More informationLecture 19: Free Energies in Modern Computational Statistical Thermodynamics: WHAM and Related Methods
Statistical Thrmodynamics Lctur 19: Fr Enrgis in Modrn Computational Statistical Thrmodynamics: WHAM and Rlatd Mthods Dr. Ronald M. Lvy ronlvy@tmpl.du Dfinitions Canonical nsmbl: A N, V,T = k B T ln Q
More informationPROBLEM SET Problem 1.
PROLEM SET 1 PROFESSOR PETER JOHNSTONE 1. Problm 1. 1.1. Th catgory Mat L. OK, I m not amiliar with th trminology o partially orr sts, so lt s go ovr that irst. Dinition 1.1. partial orr is a binary rlation
More informationThe failure of the classical mechanics
h failur of th classical mchanics W rviw som xprimntal vidncs showing that svral concpts of classical mchanics cannot b applid. - h blac-body radiation. - Atomic and molcular spctra. - h particl-li charactr
More informationCS553 Lecture Register Allocation I 3
Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun
More informationOn 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 informationCSE 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 informationFourier 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 information64. A Conic Section from Five Elements.
. onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an
More informationAbstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1
Abstract Intrprtation 1 History On brakthrough papr Cousot & Cousot 77 (?) Inspird by Dataflow analysis Dnotational smantics Enthusiastically mbracd by th community At last th functional community... At
More informationIntroduction to Condensed Matter Physics
Introduction to Condnsd Mattr Physics pcific hat M.P. Vaughan Ovrviw Ovrviw of spcific hat Hat capacity Dulong-Ptit Law Einstin modl Dby modl h Hat Capacity Hat capacity h hat capacity of a systm hld at
More information3) Use the average steady-state equation to determine the dose. Note that only 100 mg tablets of aminophylline are available here.
PHA 5127 Dsigning A Dosing Rgimn Answrs provi by Jry Stark Mr. JM is to b start on aminophyllin or th tratmnt o asthma. H is a non-smokr an wighs 60 kg. Dsign an oral osing rgimn or this patint such that
More informationA Propagating Wave Packet Group Velocity Dispersion
Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to
More informationY 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall
Staning Wav Intrfrnc btwn th incint & rflct wavs Staning wav A string with on n fix on a wall Incint: y, t) Y cos( t ) 1( Y 1 ( ) Y (St th incint wav s phas to b, i.., Y + ral & positiv.) Rflct: y, t)
More informationG. Gambosi (*), J. Ne~etgil (**), M. Talamo (*)
EFFICIENT REPRESENTATION OF TAXONOMIES G. Gamosi (*), J. N~tgil (**), M. Talamo (*) (*) Istituto i Analisi i Sistmi Inormatica l C.N.R.~ Vial Manzoni 30, 00185, Roma,Italy (**) Charls Univrsity Malostransk~
More informationMinimum Spanning Trees
Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst
More informationCSE 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 informationGraphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
More informationBasic 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 informationModern Physics. Unit 5: Schrödinger s Equation and the Hydrogen Atom Lecture 5.6: Energy Eigenvalues of Schrödinger s Equation for the Hydrogen Atom
Mdrn Physics Unit 5: Schrödingr s Equatin and th Hydrgn Atm Lctur 5.6: Enrgy Eignvalus f Schrödingr s Equatin fr th Hydrgn Atm Rn Rifnbrgr Prfssr f Physics Purdu Univrsity 1 Th allwd nrgis E cm frm th
More informationLaboratory work # 8 (14) EXPERIMENTAL ESTIMATION OF CRITICAL STRESSES IN STRINGER UNDER COMPRESSION
Laboratory wor # 8 (14) XPRIMNTAL STIMATION OF CRITICAL STRSSS IN STRINGR UNDR COMPRSSION At action of comprssing ffort on a bar (column, rod, and stringr) two inds of loss of stability ar possibl: 1)
More informationMA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.
MA56 utorial Solutions Qustion a Intgrating fator is ln p p in gnral, multipl b p So b ln p p sin his kin is all a Brnoulli quation -- st Sin w fin Y, Y Y, Y Y p Qustion Dfin v / hn our quation is v μ
More informationCombinatorial 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 informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationBackground: 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 informationsurface of a dielectric-metal interface. It is commonly used today for discovering the ways in
Surfac plasmon rsonanc is snsitiv mchanism for obsrving slight changs nar th surfac of a dilctric-mtal intrfac. It is commonl usd toda for discovring th was in which protins intract with thir nvironmnt,
More informationNEW 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 informationCSC 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 informationy cos x = cos xdx = sin x + c y = tan x + c sec x But, y = 1 when x = 0 giving c = 1. y = tan x + sec x (A1) (C4) OR y cos x = sin x + 1 [8]
DIFF EQ - OPTION. Sol th iffrntial quation tan +, 0
More informationDerangements 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 informationSome 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(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 informationExiting from QE. Fumio Hayashi and Junko Koeda. for presentation at SF Fed Conference. March 28, 2014
Fumio Hayashi an Junko Koa Exiting from QE March 28, 214, 1 / 29 Exiting from QE Fumio Hayashi an Junko Koa for prsntation at SF F Confrnc March 28, 214 To gt start... h^ : Fumio Hayashi an Junko Koa Exiting
More informationPaths. 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 informationLecture 2: Discrete-Time Signals & Systems. Reza Mohammadkhani, Digital Signal Processing, 2015 University of Kurdistan eng.uok.ac.
Lctur 2: Discrt-Tim Signals & Systms Rza Mohammadkhani, Digital Signal Procssing, 2015 Univrsity of Kurdistan ng.uok.ac.ir/mohammadkhani 1 Signal Dfinition and Exampls 2 Signal: any physical quantity that
More informationELECTRON-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 informationProblem Statement. Definitions, Equations and Helpful Hints BEAUTIFUL HOMEWORK 6 ENGR 323 PROBLEM 3-79 WOOLSEY
Problm Statmnt Suppos small arriv at a crtain airport according to Poisson procss with rat α pr hour, so that th numbr of arrivals during a tim priod of t hours is a Poisson rv with paramtr t (a) What
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationLast 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 informationThe Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function
A gnraliation of th frquncy rsons function Th convolution sum scrition of an LTI iscrt-tim systm with an imuls rsons h[n] is givn by h y [ n] [ ] x[ n ] Taing th -transforms of both sis w gt n n h n n
More informationABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS
Novi Sad J. Math. Vol. 45, No. 1, 2015, 201-206 ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS Mirjana Vuković 1 and Ivana Zubac 2 Ddicatd to Acadmician Bogoljub Stanković
More information