From Elimination to Belief Propagation
|
|
- Sophia Foster
- 5 years ago
- Views:
Transcription
1 School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls ( Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap 4 1 rom limination to lif Propagation Rcall that Inducd dpndncy during marginalization is capturd in limination cliqus Summation <-> limination Intrmdiat trm <-> limination cliqu an this lad to an gnric infrnc algorithm? G H ric Xing 2 1
2 Tr GMs Undirctd tr: a uniqu path btwn any pair of nods irctd tr: all nods xcpt th root hav xactly on parnt Poly tr: can hav multipl parnts W will com back to this latr ric Xing 3 quivalnc of dirctd and undirctd trs ny undirctd tr can b convrtd to a dirctd tr by choosing a root nod and dircting all dgs away from it dirctd tr and th corrsponding undirctd tr mak th sam conditional indpndnc assrtions Paramtrizations ar ssntially th sam. Undirctd tr: irctd tr: quivalnc: vidnc:? ric Xing 4 2
3 rom limination to mssag passing Rcall LIMINTION algorithm: hoos an ordring Z in which qury nod f is th final nod Plac all potntials on an activ list liminat nod i by rmoving all potntials containing i, tak sum/product ovr x i. Plac th rsultant factor back on th list or a TR graph: hoos qury nod f as th root of th tr Viw tr as a dirctd tr with dgs pointing towards from f limination ordring basd on dpth-first travrsal limination of ach nod can b considrd as mssag-passing (or lif Propagation dirctly along tr branchs, rathr than on som transformd graphs thus, w can us th tr itslf as a data-structur to do gnral infrnc!! ric Xing 5 Th limination algorithm Procdur Initializ (G, Z 1. Lt Z 1,...,Z k b an ordring of Z such that Z i Z j iff i < j 2. Initializ with th full th st of factors Procdur vidnc ( 1. for ach i Ι, = δ( i, i Procdur Sum-Product-Variabl- limination (, Z, 1. for i = 1,..., k Sum-Product-liminat-Var(, Z i 2. φ φ φ 3. rturn φ 4. Normalization (φ Procdur Normalization (φ 1. P(X =φ (X/ x φ (X Procdur Sum-Product-liminat-Var (, // St of factors Z // Variabl to b liminatd 1. {φ : Z Scop[φ]} ψ φ φ 4. τ Z ψ 5. rturn {τ} ric Xing 6 3
4 Mssag passing for trs f Lt m ij (x i dnot th factor rsulting from liminating variabls from bllow up to i, which is a function of x i : i This is rminiscnt of a mssag snt from j to i. j k l m ij (x i rprsnts a "blif" of x i from x j! ric Xing 7 limination on trs is quivalnt to mssag passing along tr branchs! f i j k l ric Xing 8 4
5 Th mssag passing protocol: nod can snd a mssag to its nighbors whn (and only whn it has rcivd mssags from all its othr nighbors. omputing nod marginals: Naïv approach: considr ach nod as th root and xcut th mssag passing algorithm m 21 (x 1 omputing P( m 32 (x 2 m 42 (x 2 ric Xing 9 Th mssag passing protocol: nod can snd a mssag to its nighbors whn (and only whn it has rcivd mssags from all its othr nighbors. omputing nod marginals: Naïv approach: considr ach nod as th root and xcut th mssag passing algorithm m 12 (x 2 omputing P( m 32 (x 2 m 42 (x 2 ric Xing 10 5
6 Th mssag passing protocol: nod can snd a mssag to its nighbors whn (and only whn it has rcivd mssags from all its othr nighbors. omputing nod marginals: Naïv approach: considr ach nod as th root and xcut th mssag passing algorithm m 12 (x 2 omputing P( m 23 (x 3 m 42 (x 2 ric Xing 11 omputing nod marginals Naïv approach: omplxity: N N is th numbr of nods is th complxity of a complt mssag passing ltrnativ dynamic programming approach 2-Pass algorithm (nxt slid omplxity: 2! ric Xing 12 6
7 Th mssag passing protocol: two-pass algorithm: m 21 ( m 12 ( m 32 ( m 42 ( m 24 ( m 23 ( ric Xing 13 lif Propagation (SP-algorithm: Squntial implmntation ric Xing 14 7
8 lif Propagation (SP-algorithm: Paralll synchronous implmntation or a nod of dgr d, whnvr mssags hav arrivd on any subst of d-1 nod, comput th mssag for th rmaining dg and snd! pair of mssags hav bn computd for ach dg, on for ach dirction ll incoming mssags ar vntually computd for ach nod ric Xing 15 orrctnss of P on tr ollollary: th synchronous implmntation is "non-blocking" Thm: Th Mssag Passag Guarants obtaining all marginals in th tr What about non-tr? ric Xing 16 8
9 nothr viw of SP: actor Graph xampl 1 X 5 f a f d X 5 f c f b f P( P( P(, P(X 5, P(, f a ( f b ( f c (,, f d (X 5,, f (,, ric Xing 17 actor Graphs xampl 2 f a f c ψ(x 1,x 2,x 3 = f a (x 1,x 2 f b (x 2,x 3 f c (x 3,x 1 f b xampl 3 f a ψ(x 1,x 2,x 3 = f a (x 1,x 2,x 3 ric Xing 18 9
10 actor Tr actor graph is a actor Tr if th undirctd graph obtaind by ignoring th distinction btwn variabl nods and factor nods is an undirctd tr f a ψ(x 1,x 2,x 3 = f a (x 1,x 2,x 3 ric Xing 19 Mssag Passing on a actor Tr Two kinds of mssags 1. ν: from variabls to factors 2. µ: from factors to variabls f s x i f 1 x j x i f s f 3 x k ric Xing 20 10
11 Mssag Passing on a actor Tr, con'd Mssag passing protocol: nod can snd a mssag to a nighboring nod only whn it has rcivd mssags from all its othr nighbors Marginal probability of nods: f s x i f 1 x j x i f s f 3 x k P(x i s 2 N(i µ si (x i ν is (x i µ si (x i ric Xing 21 P on a actor Tr ν 1d µ d2 µ 2 ν 3 f d µ d1 ν 2d ν 2 µ 3 µ µ a1 c3 µb2 ν 1a ν 2b f ν 3c f a f b f c ric Xing 22 11
12 X 5 X 6 Why factor graph? Tr-lik graphs to actor trs X 5 X 6 ric Xing 23 Poly-trs to actor trs X 5 X 5 ric Xing 24 12
13 X 5 X 6 Why factor graph? caus G turns tr-lik graphs to factor trs, and trs ar a data-structur that guarants corrctnss of P! X 5 X 6 X 5 X 5 ric Xing 25 Max-product algorithm: computing MP probabilitis f i j k l ric Xing 26 13
14 Max-product algorithm: computing MP configurations using a final bookkping backward pass f i j k l ric Xing 27 Summary Sum-Product algorithm computs singlton marginal probabilitis on: Trs Tr-lik graphs Poly-trs Maximum a postriori configurations can b computd by rplacing sum with max in th sum-product algorithm xtra bookkping rquird ric Xing 28 14
15 Infrnc on gnral GM Now, what if th GM is not a tr-lik graph? an w still dirctly run mssag mssag-passing protocol along its dgs? or non-trs, w do not hav th guarant that mssag-passing will b consistnt! Thn what? onstruct a graph data-structur from P that has a tr structur, and run mssag-passing on it! Junction tr algorithm ric Xing 29 limination liqu Rcall that Inducd dpndncy during marginalization is capturd in limination cliqus Summation <-> limination Intrmdiat trm <-> limination cliqu an this lad to an gnric infrnc algorithm? G H ric Xing 30 15
16 16 ric Xing 31 liqu Tr H G m h m g m m f m b m c m d = f g a m m d c p d c a m, ( (, (,, ( ric Xing 32 limination mssag passing on a cliqu tr Mssags can b rusd H G m h m g m m f m b m c m d G H G H G rom limination to Mssag Passing = f g a m m d c p d c a m, ( (, (,, (
17 rom limination to Mssag Passing limination mssag passing on a cliqu tr nothr qury... m d mc m m b m f G m g H m h Mssags m f and m h ar rusd, othrs nd to b rcomputd ric Xing 33 17
Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationStrongly 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 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 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 informationJunction Tree Algorithm 1. David Barber
Juntion Tr Algorithm 1 David Barbr Univrsity Collg London 1 Ths slids aompany th book Baysian Rasoning and Mahin Larning. Th book and dmos an b downloadd from www.s.ul.a.uk/staff/d.barbr/brml. Fdbak and
More information1 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 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 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 informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More informationcycle 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 informationOn the Hamiltonian of a Multi-Electron Atom
On th Hamiltonian of a Multi-Elctron Atom Austn Gronr Drxl Univrsity Philadlphia, PA Octobr 29, 2010 1 Introduction In this papr, w will xhibit th procss of achiving th Hamiltonian for an lctron gas. Making
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 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 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 informationAnswer Homework 5 PHA5127 Fall 1999 Jeff Stark
Answr omwork 5 PA527 Fall 999 Jff Stark A patint is bing tratd with Drug X in a clinical stting. Upon admiion, an IV bolus dos of 000mg was givn which yildd an initial concntration of 5.56 µg/ml. A fw
More informationCS 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 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 informationDirect 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 informationPhysical Organization
Lctur usbasd symmtric multiprocssors (SM s): combin both aspcts Compilr support? rchitctural support? Static and dynamic locality of rfrnc ar critical for high prformanc M I M ccss to local mmory is usually
More information1 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 informationSquare of Hamilton cycle in a random graph
Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs
More informationMCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems
MCE503: Modling and Simulation o Mchatronic Systms Discussion on Bond Graph Sign Convntions or Elctrical Systms Hanz ichtr, PhD Clvland Stat Univrsity, Dpt o Mchanical Enginring 1 Basic Assumption In a
More informationSearch 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 informationChapter 6 Folding. Folding
Chaptr 6 Folding Wintr 1 Mokhtar Abolaz Folding Th folding transformation is usd to systmatically dtrmin th control circuits in DSP architctur whr multipl algorithm oprations ar tim-multiplxd to a singl
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 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 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 informationpriority queue ADT heaps 1
COMP 250 Lctur 23 priority quu ADT haps 1 Nov. 1/2, 2017 1 Priority Quu Li a quu, but now w hav a mor gnral dinition o which lmnt to rmov nxt, namly th on with highst priority..g. hospital mrgncy room
More informationSupplementary 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 informationPHYSICS 489/1489 LECTURE 7: QUANTUM ELECTRODYNAMICS
PHYSICS 489/489 LECTURE 7: QUANTUM ELECTRODYNAMICS REMINDER Problm st du today 700 in Box F TODAY: W invstigatd th Dirac quation it dscribs a rlativistic spin /2 particl implis th xistnc of antiparticl
More informationECE 344 Microwave Fundamentals
ECE 44 Microwav Fundamntals Lctur 08: Powr Dividrs and Couplrs Part Prpard By Dr. hrif Hkal 4/0/08 Microwav Dvics 4/0/08 Microwav Dvics 4/0/08 Powr Dividrs and Couplrs Powr dividrs, combinrs and dirctional
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationQuasi-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 informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
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 informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr ot St #18 Introduction to DFT (via th DTFT) Rading Assignmnt: Sct. 7.1 of Proakis & Manolakis 1/24 Discrt Fourir Transform (DFT) W v sn that th DTFT is
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 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 informationEnumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition
Enumrating Unlabld and Root Labld Trs for Causal Modl Acquisition Yang Xiang, Zo Jingyu Zhu, and Yu Li Univrsity of Gulph, Canada Abstract. To spcify a Bays nt (BN), a conditional probability tabl (CPT),
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 informationME 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 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 informationOn 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 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 informationDealing with quantitative data and problem solving life is a story problem! Attacking Quantitative Problems
Daling with quantitati data and problm soling lif is a story problm! A larg portion of scinc inols quantitati data that has both alu and units. Units can sa your butt! Nd handl on mtric prfixs Dimnsional
More informationHigher-Order Discrete Calculus Methods
Highr-Ordr Discrt Calculus Mthods J. Blair Prot V. Subramanian Ralistic Practical, Cost-ctiv, Physically Accurat Paralll, Moving Msh, Complx Gomtry, Slid 1 Contxt Discrt Calculus Mthods Finit Dirnc Mimtic
More informationClassical Magnetic Dipole
Lctur 18 1 Classical Magntic Dipol In gnral, a particl of mass m and charg q (not ncssarily a point charg), w hav q g L m whr g is calld th gyromagntic ratio, which accounts for th ffcts of non-point charg
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 informationInference in Graphical Models Variable Elimination and Message Passing Algorithm
Inference in Graphical Models Variable Elimination and Message Passing lgorithm Le Song Machine Learning II: dvanced Topics SE 8803ML, Spring 2012 onditional Independence ssumptions Local Markov ssumption
More informationCPSC 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 informationMessage Passing Algorithms and Junction Tree Algorithms
Message Passing lgorithms and Junction Tree lgorithms Le Song Machine Learning II: dvanced Topics S 8803ML, Spring 2012 Inference in raphical Models eneral form of the inference problem P X 1,, X n Ψ(
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 informationCoupled 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 informationCS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:
CS 6353 Compilr Construction, Homwork #1 1. Writ rgular xprssions for th following informally dscribd languags: a. All strings of 0 s and 1 s with th substring 01*1. Answr: (0 1)*01*1(0 1)* b. All strings
More informationCOHORT 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 informationElements of Statistical Thermodynamics
24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,
More informationu 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 informationAS 5850 Finite Element Analysis
AS 5850 Finit Elmnt Analysis Two-Dimnsional Linar Elasticity Instructor Prof. IIT Madras Equations of Plan Elasticity - 1 displacmnt fild strain- displacmnt rlations (infinitsimal strain) in matrix form
More informationProbability Translation Guide
Quick Guid to Translation for th inbuilt SWARM Calculator If you s information looking lik this: Us this statmnt or any variant* (not th backticks) And this is what you ll s whn you prss Calculat Th chancs
More informationSec 2.3 Modeling with First Order Equations
Sc.3 Modling with First Ordr Equations Mathmatical modls charactriz physical systms, oftn using diffrntial quations. Modl Construction: Translating physical situation into mathmatical trms. Clarly stat
More informationSystems of Equations
CHAPTER 4 Sstms of Equations 4. Solving Sstms of Linar Equations in Two Variabls 4. Solving Sstms of Linar Equations in Thr Variabls 4. Sstms of Linar Equations and Problm Solving Intgratd Rviw Sstms of
More informationInternational Journal of Foundations of Computer Science c World Scientic Publishing Company Searching a Pseudo 3-Sided Solid Orthoconvex Grid ANTONIO
Intrnational Journal of Foundations of Computr Scinc c World Scintic Publishing Company Sarching a Psudo 3-Sidd Solid Orthoconvx Grid ANTONIOS SYMVONIS Bassr Dpartmnt of Computr Scinc, Univrsity of Sydny
More informationMIT Sloan School of Management
MIT Sloan School of Managmnt Working Papr 4465-03 Rvisd: Jun 2003 Original: April 2001 SENSITIVITY ANALYSIS FOR SHORTEST PATH PROBLEMS AND MAXIMUM CAPACITY PATH PROBLEMS IN UNDIRECTED GRAPHS Ramkumar Ramaswamy,
More information5.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 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 informationHydrogen 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 informationFinding low cost TSP and 2-matching solutions using certain half integer subtour vertices
Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,
More information2.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 information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
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 information[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then
SYSTEM PERFORMANCE Lctur 0: Stady-tat Error Stady-tat Error Lctur 0: Stady-tat Error Dr.alyana Vluvolu Stady-tat rror can b found by applying th final valu thorm and i givn by lim ( t) lim E ( ) t 0 providd
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 informationMAE4700/5700 Finite Element Analysis for Mechanical and Aerospace Design
MAE4700/5700 Finit Elmnt Analysis for Mchanical and Arospac Dsign Cornll Univrsity, Fall 2009 Nicholas Zabaras Matrials Procss Dsign and Control Laboratory Sibly School of Mchanical and Arospac Enginring
More informationFEM FOR HEAT TRANSFER PROBLEMS دانشگاه صنعتي اصفهان- دانشكده مكانيك
FEM FOR HE RNSFER PROBLEMS 1 Fild problms Gnral orm o systm quations o D linar stady stat ild problms: For 1D problms: D D g Q y y (Hlmholtz quation) d D g Q d Fild problms Hat transr in D in h h ( D D
More informationGeneral Notes About 2007 AP Physics Scoring Guidelines
AP PHYSICS C: ELECTRICITY AND MAGNETISM 2007 SCORING GUIDELINES Gnral Nots About 2007 AP Physics Scoring Guidlins 1. Th solutions contain th most common mthod of solving th fr-rspons qustions and th allocation
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 informationCh. 24 Molecular Reaction Dynamics 1. Collision Theory
Ch. 4 Molcular Raction Dynamics 1. Collision Thory Lctur 16. Diffusion-Controlld Raction 3. Th Matrial Balanc Equation 4. Transition Stat Thory: Th Eyring Equation 5. Transition Stat Thory: Thrmodynamic
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 informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 301 Signals & Systms Prof. Mark Fowlr ot St #21 D-T Signals: Rlation btwn DFT, DTFT, & CTFT 1/16 W can us th DFT to implmnt numrical FT procssing This nabls us to numrically analyz a signal to find
More informationMCB137: Physical Biology of the Cell Spring 2017 Homework 6: Ligand binding and the MWC model of allostery (Due 3/23/17)
MCB37: Physical Biology of th Cll Spring 207 Homwork 6: Ligand binding and th MWC modl of allostry (Du 3/23/7) Hrnan G. Garcia March 2, 207 Simpl rprssion In class, w drivd a mathmatical modl of how simpl
More informationGEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia
GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES Eduard N. Klnov* Rostov-on-Don, Russia Th articl considrs phnomnal gomtry figurs bing th carrirs of valu spctra for th pairs of th rmaining additiv
More informationForces. Quantum ElectroDynamics. α = = We have now:
W hav now: Forcs Considrd th gnral proprtis of forcs mdiatd by xchang (Yukawa potntial); Examind consrvation laws which ar obyd by (som) forcs. W will nxt look at thr forcs in mor dtail: Elctromagntic
More informationSymmetric centrosymmetric matrix vector multiplication
Linar Algbra and its Applications 320 (2000) 193 198 www.lsvir.com/locat/laa Symmtric cntrosymmtric matrix vctor multiplication A. Mlman 1 Dpartmnt of Mathmatics, Univrsity of San Francisco, San Francisco,
More informationApproximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model
20 3st Intrnational Confrnc on Distributd Computing Systms Workshops Approximation and Inapproximation for Th Influnc Maximization Problm in Social Ntworks undr Dtrministic Linar Thrshold Modl Zaixin Lu,
More informationThe 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 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 informationLecture 4: Parsing. Administrivia
Adminitrivia Lctur 4: Paring If you do not hav a group, pla pot a rqut on Piazzza ( th Form projct tam... itm. B ur to updat your pot if you find on. W will aign orphan to group randomly in a fw day. Programming
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 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 informationSimilarity Queries: Their Conceptual Evaluation, Transformations, and Processing
Nonam manuscript No. (will b insrtd by th ditor) imilarity Quris: Thir Concptual valuation, Transformations, and Procssing Yasin N. ilva Walid G. Arf Pr-Ak Larson pncr. Parson Mohamd H. Ali Rcivd: dat
More informationHigher 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 information4.5 Minimum Spanning Tree. Chapter 4. Greedy Algorithms. Minimum Spanning Tree. Motivating application
1 Chaptr. Minimum panning Tr lids by Kvin Wayn. Copyright 200 Parson-Addison Wsly. All rights rsrvd. *Adjustd by Gang Tan for C33: Algorithms at Boston Collg, Fall 0 Motivating application Minimum panning
More information10. 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 informationIntroduction 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 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 informationChapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional
Chaptr 13 GMM for Linar Factor Modls in Discount Factor form GMM on th pricing rrors givs a crosssctional rgrssion h cas of xcss rturns Hors rac sting for charactristic sting for pricd factors: lambdas
More informationMiddle East Technical University Department of Mechanical Engineering ME 413 Introduction to Finite Element Analysis
Middl East Tchnical Univrsity Dpartmnt of Mchanical Enginring ME 43 Introduction to Finit Elmnt Analysis Chaptr 3 Computr Implmntation of D FEM Ths nots ar prpard by Dr. Cünyt Srt http://www.m.mtu.du.tr/popl/cunyt
More informationMutually Independent Hamiltonian Cycles of Pancake Networks
Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics
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 information