Introduction to Graphical Models

Size: px
Start display at page:

Download "Introduction to Graphical Models"

Transcription

1 Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II

2 Introution n Review 2

3 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set of noes E: the set of eges In grhil moels the rnom vriles re reresente y the noes. sttistil reltionshis etween the vriles re reresente y the eges. A A A B C B C B C D Direte grh D Unirete grh D Ftor grh

4 Purose of using Grhil Moels Intuitive n visul reresenttion A grh is n intuitive wy of reresenting n visulizing the reltionshis mong vriles. Ineenene / onitionl ineenene A grh reresents onitionl ineenene reltionshis mong vriles. Cusl reltionshis eision mking ignosis system et. Effiient omuttion With grhs effiient rogtion lgorithms n e efine. Belief-rogtion juntion tree lgorithm Whih rts of the moeling lok effiient omuttion? 4

5 Ineenene For simliity it is ssume tht the istriution of rnom vrile hs the roility ensity funtion x. Ineenene n Y re ineenent Y x y x y Y Y Y Dwi s nottion 5

6 Conitionl Ineenene Conitionl roility Conitionl roility ensity of Y given Conitionl ineenene Def. Y y x n Y re onitionlly ineenent given Z ef. Y x y x y Y x y x y Y Z x y z Z x z Y Z y z Y Y Z for ll z with Z z > 0. Y Z x y z x for ll yz with YZ yz > 0. YZ Z z If we lrey know Z itionl informtion on Y oes not inrese the knowlege on. 6

7 Conitionl Ineenene - Exmles Seeing Fine Tye of Cr erhs Seeing Fine Tye of Cr See Aility of Tem A Aility of Tem B Aility of Tem A Aility of Tem B Outome of Tem A n B 7

8 Conitionl Ineenene Another hrteriztion of on. ineenene Proosition Y Z there exist funtions fxz n gyz suh tht YZ x y z f x z g y z for ll x y n z with Z z > 0. Corollry 2 Y there exist funtions fx n gy suh tht Y x y f x g y for ll x y. 8

9 Conitionl Ineenene Proof of Pro.. Cler from the efinition. For ny x y n z with Z z > 0 We hve Thus 9

10 Unirete Grh n Mrkov Proerty 0

11 Unirete Grh Unirete Grh G V E : unirete grh V: finite set E V V the orer is neglete. Exmle: Grh terminology V { } E { } Comlete: A sugrh S of V is omlete if ny n in S re onnete y n ege. Clique: A lique is mximl omlete suset w.r.t. inlusion. : omlete ut not lique

12 Proility n Unirete Grh Proility ssoite with n unirete grh G V E : unirete grh. V { n} K n : rnom vriles inexe y the noe set V. The roility istriution of is ssoite with G if there is nonnegtive funtion ψ C C for eh lique C in G suh tht ψ C C C:lique Nottion: for suset S of V S S An unirete grh oes not seify single roility ut efines fmily of roilities. In other wors it uts restritions y the onitionl ineenene reltions reresente y the grh. 2

13 Proility n Unirete Grh is ssoite with n unirete grh G if n only if it mits Exmle e 2 e Z ψ ψ ψ :lique C C C Z ψ ftorizes w.r.t. G. ψ C : ftor or otentil Z: normliztion onstnt

14 Mrkov Proerty Unirete grh n Mrkov roerty Sertion: G V E : unirete grh. A B S: isjoint susets of V. S sertes A from B if every th etween ny in A n in B intersets with S. B 5 A 2 4 S Theorem G V E : unirete grh. : rnom vetor with the istriution ssoite with G. If S sertes A from B then A B S Proof: next leture. 4

15 5 Mrkov Proerty Exmle { } sertes {} n {e} {} sertes {} n {} e 2 e Z ψ ψ ψ e {} 2 e e Z ψ ψ ψ ~ 2 e Z ψ ψ ψ e g f Z { } e e Z 2 ψ ψ ψ g Z ψ Use ro.. Use ro..

16 Mrkov Proerty Glol Mrkov Proerty G V E : unirete grh : rnom vetor inexe y V. stisfies glol Mrkov roerty reltive to G if A B S hols for ny trilet ABS of isjoint susets of V suh tht S sertes A from B. The revious theorem tells if the istriution of ftorizes w.r.t. G then stisfies glol Mrkov roerty reltive to G. Remrk: Both of ftorize n glol Mrkov roerty re the roerties regring reltion etween the roility n the unirete grh G. 6

17 Mrkov Proerty Hmmersley-Cliffor theorem see e.g. Luritzen. Th..9 Theorem 4 G V E : unirete grh : rnom vetor inexe y V. Assume tht the roility ensity funtion of the istriution of is stritly ositive. If stisfies glol Mrkov roerty w.r.t. G then ftorizes w.r.t. G i.e. mits the ftoriztion: ψ C C C:lique. Ftoriztion Th. Th. 4 with ositivity Glol Mrkov 7

18 Direte Ayli Grh n Mrkov Proerty 8

19 Direte Ayli Grh Direte Grh G V E : irete grh V: finite set -- noes E V V : set of eges Exmle: V { } E { } Orient the ege y Direte Ayli grh DAG Direte grh with no yles. Cyle: irete th strting n ening t the sme noe. 9

20 20 DAG n Proility Proility ssoite with DAG A DAG efines fmily of roility istriutions e e e n i i i n K : rents of noe i. { } E j i V j i Exmle: is si to e ssoite with DAG G or ftorizes w.r.t. G.

21 2 Conitionl Ineenene with DAG Three si ses 2 Note Note: re the sme for n 2.

22 Conitionl Ineenene with DAG he-to-he or v-struture Note: in re ifferent from n 2. Allergy Col Sneeze If you often sneeze ut you o not hve ol then it is more likely you hve llergy hy fever. 22

23 D-Sertion Bloke: An unirete th π is si to e loke y suset S in V if there exists noe on the th suh tht either S i n is not he-to-he in π or ii n { } e S φ. he-to-he Desenent: e i { j V irete th from i to j} Exmles S π π π S S π is loke y S π is loke y S π is NOT loke y S 2

24 D-Sertion -serte: A B S: isjoint susets of V. S -sertes A from B if every unirete th etween in A n in B is loke y S. -sertion n onitionl ineenene Theorem 5 : rnom vetor with the istriution ssoite with DAG G. A B S: isjoint susets of V. If S -sertes A from B then A B S Proof not shown in this ourse. See Luritzen 996.2&.25 24

25 D-Sertion Exmle S φ. is loke with. is loke with e is loke with e e {} is loke with. is loke with e is loke with e or e 25

26 Comrison: UDG n DAG Limittion of unirete grh DAG If ny UDG is not le to exress. 26

27 27 Comrison: UDG n DAG Limittion of DAG Unirete grh No DAG exresses these onitionl ineenene reltionshis. {} {} If every noe h the form the grh woul e yle. Thus there must e v-struture. Conitionl ineenene of the rents of the v-struture given the other two noes nnot e exresse y DAG. [Sketh of the roof.]

28 Mini Summry on UDG n DAG Unirete grh Direte yli grh DAG e e Proility ssoite with G ftorizes w.r.t. G Z ψ C C C:lique Proility ssoite with G ftorizes w.r.t. G n n i i i K ftorizes w.r.t. G ftorizes w.r.t. G is glol Mrkov reltive to G. is -glol Mrkov reltive to G. i.e. if S sertes A from B i.e. if S -sertes A from B then. then. A B S A B S 28

29 Aenix: Terminology on Grhs Unirete grh G V E Ajent: n in V re jent if Neighor: E. ne { V E}. ne DAG G V E Prents: Chilren: Anestors: Desenents: { V E}. h { V E}. n { V irete th from to }. e { V irete th from to }. n e 29

30 Ftor Grh n Mrkov Proerty 0

31 Ftor Grh i Ftor grh G V E V I F: two tyes of noes j l I: vrile noes vrile noe F: ftor noes ftor noe E: unirete eges k E I F V V. An ege exists only etween ftor noe n vriles noe. A ftor grh is in generl lle irtite grh. A irtite grh is n unirete grh G V E suh tht V V V V V φ E V. 2 2 V2

32 Proility n Ftor grh Ftor grh to reresent ftoriztion i i I : rnom vetor inexe y finite set I. The ensity of the istriution of ftorizes s f F: finite set. Z F Z: normliztion onstnt f : non-negtive funtion of suset of { n } i i I where I : { i I i E} The ftor grh G V E reresenting the ftoriztion is given y V I F E { i I F i I} 2

33 Proility n Ftor grh Exmle I {245} F {} A roility is often given y ftorize form i.e. rout of ftors with smll numer of vriles f f f Z

34 Mrkov Proerty of Ftor Grh nei: neighor of vrile noe i ne i { j I F{ i j} I }. 2 A th in ftor grh is sequene of vriles noes suh tht ny onseutive 5 4 two noes re neighors. e.g ne4 Ftoriztion glol Mrkov roerty Theorem 6 Assume the roility of ftorizes w.r.t. ftor grh G. S A B: isjoint susets of the vrile noes I. If every th etween ny in A n in B intersets with S then A B S 4

35 5 Mrkov Proerty of Ftor Grh Exmle Exmle 2 2 g f Z g f f f f Z 5 {4} Diret onfirmtion f f f Z f g f Z Z ψ ϕ Pro.

36 Comrison of Ftor Grh n other grhs Ftor grh n UDG 2 2 f 2 Z 2 f f Ftor grhs Unirete grh i ii iii UDG nnot istinguish the ftoriztion in i n ii All the vrile noes in i ii n iii hve the sme neighors n thus the sme onitionl ineenene reltionshis no onitionl ineenene. The ftor grh reresenttions of i n ii re ifferent. 6

37 Comrison of Ftor Grh n other grhs Ftor grh n DAG DAG 2 Ftor grh 2 Ineenene of n 2 nnot e reresente. 7

38 More on Mrkov Proerty 8

39 Mrkov Proerties Revisite Mrkov roerties for n unirete grh G V E : unirete grh. : rnom vetor inexe y V. V \ { } ne Lol Mrkov stisfies lol Mrkov roerty reltive to G if for ny noe V \{ } ne ne ne Pirwise Mrkov stisfies irwise Mrkov roerty reltive to G if ny non-jent ir of noes stisfies V \{ } V \{ } 9

40 Mrkov Proerties Revisite Theorem 7 Ftoriztion glol Mrkov lol Mrkov irwise Mrkov roof ftoriztion glol Mrkov : Theorem. glol Mrkov lol Mrkov : esy. lol Mrkov irwise Mrkov : nees some mth Exerise. Hmmersley-Cliffor sserts tht the irwise Mrkov roerty mens ftoriztion w.r.t. the grh uner ositivity of the ensity. Theorem 4 ssumes glol Mrkov ut the ssertion hols uner irwise Mrkov ssumtoin. Similr notions re efine for irete n ftor grhs. 40

41 Proof for Unirete Cse We show slight generliztion of Theorem. Theorem 8 Let G V E e n unirete grh. If the istriution of ftorizes s ψ C C Z C:omlete then stisfies glol Mrkov roerty reltive to G i.e. for trilet S A B suh tht S sertes A from B the onitionl ineenene A B S hols. A S B Proof A ~ Let ~ B ~ A { V \ S A π th from to π S φ} ~ ~ B V \ A S. 4

42 Proof for Unirete Cse ~ A A Oviously n sine S sertes A from B ~ B B. We n show for ny omlete sugrh C ~ ~ or hols. C S C S A C S B If there is nothing to rove. Assume C S. Suose tht the ove ssertion oes not hol then ~ ~ Let A ~ ~ C A φ n C B φ. C n B C. Beuse n re in the omlete sugrh C there is n ~ ege e onneting n. Sine A there is th π from to A without interseting S. Conneting π n e mkes th from to A without interseting S whih ontrits with the efinition of n. A ~ B ~ A S A ~ B ~ e B 42

43 Proof for Unirete Cse From this ft ψ C C ψ C C ψ Z Z C:omlete C:omlete ~ C S A D D:omlete ~ D S B D f ~ g ~ A S B S whih mens n thus ~ A ~ B S A B S. Proosition Q.E.D. 4

44 44 Converting Ftor Grh to UDG Neighorhoo struture y ftor grh mke n unirete grh. Eh ftor in A oes not orreson to lique in U ut to omlete sugrh in U. In generl ftorizes s for the onverte unirete grh U. LA f f f f Z Ftor grh G Unirete grh U :omlete C C C Z ψ

45 Proof for Ftor Grh Proof of Theorem 6 Ftoriztion Glol Mrkov for ftor grh From the ove oservtion the roof is one y Theorem 8. 45

46 Prtil Exmles Mrkov rnom fiel for imge nlysis Z i j E ex U ij i j i j Mixture moel n hien Mrkov moel Conitionl rnom fiel for sequentil t Lfferty et l. 200 Hien lel sequene Oservtion 46

47 Summry A grh reresents the onitionl ineenene reltionshis mong rnom vriles. There re mny tyes of grh to reresent roilities. Unirete grh Direte grh Ftor grh Ftoriztion of the roility istriution w.r.t. grh mens Mrkov Proerty of the istriution reltive to the grh. 47

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Analysis of Temporal Interactions with Link Streams and Stream Graphs

Analysis of Temporal Interactions with Link Streams and Stream Graphs Anlysis of Temporl Intertions with n Strem Grphs, Tiphine Vir, Clémene Mgnien http:// ltpy@ LIP6 CNRS n Soronne Université Pris, Frne 1/23 intertions over time 0 2 4 6 8,,, n for 10 time units time 2/23

More information

A Graphical Characterization of Lattice Conditional Independence Models

A Graphical Characterization of Lattice Conditional Independence Models A Grphil Chrteriztion of Lttie Conitionl Inepenene Moels Steen A. Anersson, Dvi Mign, Mihel D. Perlmn *, n Christopher M. Triggs Inin University, University of Wshington, n University of Aukln Astrt Lttie

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

Implication Graphs and Logic Testing

Implication Graphs and Logic Testing Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Outline. Theory-based Bayesian framework for property induction Causal structure induction

Outline. Theory-based Bayesian framework for property induction Causal structure induction Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning The origins of usl knowledge Question: how do people relily ome

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Individual Group. Individual Events I1 If 4 a = 25 b 1 1. = 10, find the value of.

Individual Group. Individual Events I1 If 4 a = 25 b 1 1. = 10, find the value of. Answers: (000-0 HKMO Het Events) Creted y: Mr. Frnis Hung Lst udted: July 0 00-0 33 3 7 7 5 Individul 6 7 7 3.5 75 9 9 0 36 00-0 Grou 60 36 3 0 5 6 7 7 0 9 3 0 Individul Events I If = 5 = 0, find the vlue

More information

PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1. Sahika Genc, Stéphane Lafortune

PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1. Sahika Genc, Stéphane Lafortune PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1 Shik Gen, Stéhne Lfortune Dertment of Eletril Engineering n Comuter Siene, University of Mihign, 1301 Bel Avenue, Ann Aror, MI 48109-2122,

More information

Solutions to Assignment 1

Solutions to Assignment 1 MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Obstructions to chordal circular-arc graphs of small independence number

Obstructions to chordal circular-arc graphs of small independence number Ostrutions to horl irulr-r grphs of smll inepenene numer Mthew Frnis,1 Pvol Hell,2 Jurj Stho,3 Institute of Mth. Sienes, IV Cross Ro, Trmni, Chenni 600 113, Ini Shool of Comp. Siene, Simon Frser University,

More information

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris

More information

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression 5-2 Dt Strutures n Algorithms Dt Compression n Huffmn s Algorithm th Fe 2003 Rjshekr Rey Outline Dt ompression Lossy n lossless Exmples Forml view Coes Definition Fixe length vs. vrile length Huffmn s

More information

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Chapter Five - Eigenvalues, Eigenfunctions, and All That

Chapter Five - Eigenvalues, Eigenfunctions, and All That Chpter Five - Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

Inequalities of Olympiad Caliber. RSME Olympiad Committee BARCELONA TECH

Inequalities of Olympiad Caliber. RSME Olympiad Committee BARCELONA TECH Ineulities of Olymid Clier José Luis Díz-Brrero RSME Olymid Committee BARCELONA TECH José Luis Díz-Brrero RSME Olymi Committee UPC BARCELONA TECH jose.luis.diz@u.edu Bsi fts to rove ineulities Herefter,

More information

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

More information

Aperiodic tilings and substitutions

Aperiodic tilings and substitutions Aperioi tilings n sustitutions Niols Ollinger LIFO, Université Orléns Journées SDA2, Amiens June 12th, 2013 The Domino Prolem (DP) Assume we re given finite set of squre pltes of the sme size with eges

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Quadratic Residues. Chapter Quadratic residues

Quadratic Residues. Chapter Quadratic residues Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

Can one hear the shape of a drum?

Can one hear the shape of a drum? Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

More information

If we have a function f(x) which is well-defined for some a x b, its integral over those two values is defined as

If we have a function f(x) which is well-defined for some a x b, its integral over those two values is defined as Y. D. Chong (26) MH28: Complex Methos for the Sciences 2. Integrls If we hve function f(x) which is well-efine for some x, its integrl over those two vlues is efine s N ( ) f(x) = lim x f(x n ) where x

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

More information

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of

More information

Duke Math Meet

Duke Math Meet Duke Mth Meet 01-14 Power Round Qudrtic Residues nd Prime Numers For integers nd, we write to indicte tht evenly divides, nd to indicte tht does not divide For exmle, 4 nd 4 Let e rime numer An integer

More information

Electrical Circuits II (ECE233b)

Electrical Circuits II (ECE233b) Eletril Ciruits (ECE2) Polyhse Ciruits Anestis Dounis The Uniersity of Western Ontrio Fulty of Engineering Siene ThreePhse Ciruits Blned three hse iruit: ontins three oltge soures tht re equl in mgnitude

More information

Separable discrete functions: recognition and sufficient conditions

Separable discrete functions: recognition and sufficient conditions Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

Sections 5.3: Antiderivatives and the Fundamental Theorem of Calculus Theory:

Sections 5.3: Antiderivatives and the Fundamental Theorem of Calculus Theory: Setions 5.3: Antierivtives n the Funmentl Theorem of Clulus Theory: Definition. Assume tht y = f(x) is ontinuous funtion on n intervl I. We ll funtion F (x), x I, to be n ntierivtive of f(x) if F (x) =

More information

5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship

5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship 5.4, 6.1, 6.2 Hnout As we ve iscusse, the integrl is in some wy the opposite of tking erivtive. The exct reltionship is given by the Funmentl Theorem of Clculus: The Funmentl Theorem of Clculus: If f is

More information

Antiderivatives Introduction

Antiderivatives Introduction Antierivtives 0. Introuction So fr much of the term hs been sent fining erivtives or rtes of chnge. But in some circumstnces we lrey know the rte of chnge n we wish to etermine the originl function. For

More information

On the Spectra of Bipartite Directed Subgraphs of K 4

On the Spectra of Bipartite Directed Subgraphs of K 4 On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,

More information

k and v = v 1 j + u 3 i + v 2

k and v = v 1 j + u 3 i + v 2 ORTHOGONAL FUNCTIONS AND FOURIER SERIES Orthogonl functions A function cn e considered to e generliztion of vector. Thus the vector concets like the inner roduct nd orthogonlity of vectors cn e extended

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

Finite state automata

Finite state automata Finite stte utomt Lecture 2 Model-Checking Finite-Stte Systems (untimed systems) Finite grhs with lels on edges/nodes set of nodes (sttes) set of edges (trnsitions) set of lels (lhet) Finite Automt, CTL,

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

More information

Type 2: Improper Integrals with Infinite Discontinuities

Type 2: Improper Integrals with Infinite Discontinuities mth imroer integrls: tye 6 Tye : Imroer Integrls with Infinite Disontinuities A seond wy tht funtion n fil to be integrble in the ordinry sense is tht it my hve n infinite disontinuity (vertil symtote)

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Lesson 55 - Inverse of Matrices & Determinants

Lesson 55 - Inverse of Matrices & Determinants // () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n

More information

Completeness of an Euler Diagrammatic System with Constant and Existential Points

Completeness of an Euler Diagrammatic System with Constant and Existential Points omleteness of n uler igrmmtic System with onstnt nd xistentil Points Ryo Tkemur Nihon University, Jn. tkemur.ryo@nihon-u.c.j strct We extend uler digrmmtic system of Minshim, Okd, & Tkemur (2012) y distinguishing

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Technology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework

Technology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework R-17 SASIMI 015 Proeeings Tehnology Mpping Metho for Low Power Consumption n High Performne in Generl-Synhronous Frmework Junki Kwguhi Yukihie Kohir Shool of Computer Siene, the University of Aizu Aizu-Wkmtsu

More information

ANALYSIS AND MODELLING OF RAINFALL EVENTS

ANALYSIS AND MODELLING OF RAINFALL EVENTS Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.

More information

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity Sulement 4 Permuttions, Legendre symbol nd qudrtic recirocity 1. Permuttions. If S is nite set contining n elements then ermuttion of S is one to one ming of S onto S. Usully S is the set f1; ; :::; ng

More information

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures

On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures On te Constrution of te Inlusion Bounry Neigouroo for Mrkov Equivlene Clsses of Byesin Network Strutures Vinent Auvry Eletril Engineering n Computer Siene Dept. University of Liège uvry@montefiore.ulg..e

More information

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The

More information

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected Exercises. g(x) 2 dx 1 2 a

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected Exercises. g(x) 2 dx 1 2 a McGill University Mth 354: Honors Anlysis 3 Fll 2012 Assignment 1 Solutions to selected Exercises Exercise 1. (i) Verify the identity for ny two sets of comlex numers { 1,..., n } nd { 1,..., n } ( n )

More information

arxiv: v1 [cs.dm] 24 Jul 2017

arxiv: v1 [cs.dm] 24 Jul 2017 Some lsses of grphs tht re not PCGs 1 rxiv:1707.07436v1 [s.dm] 24 Jul 2017 Pierluigi Biohi Angelo Monti Tizin Clmoneri Rossell Petreshi Computer Siene Deprtment, Spienz University of Rome, Itly pierluigi.iohi@gmil.om,

More information

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows: Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions

More information

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr

More information

50 AMC Lectures Problem Book 2 (36) Substitution Method

50 AMC Lectures Problem Book 2 (36) Substitution Method 0 AMC Letures Prolem Book Sustitution Metho PROBLEMS Prolem : Solve for rel : 9 + 99 + 9 = Prolem : Solve for rel : 0 9 8 8 Prolem : Show tht if 8 Prolem : Show tht + + if rel numers,, n stisf + + = Prolem

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

A Primer on Continuous-time Economic Dynamics

A Primer on Continuous-time Economic Dynamics Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution

More information

DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS

DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

More information

arxiv: v1 [cs.cg] 28 Apr 2009

arxiv: v1 [cs.cg] 28 Apr 2009 Orienttion-Constrine Retngulr Lyouts Dvi Eppstein 1 n Elen Mumfor 2 1 Deprtment of Computer Siene, University of Cliforni, Irvine, USA 2 Deprtment of Mthemtis n Computer Siene, TU Einhoven, The Netherlns

More information

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year 1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the

More information

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18 Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re

More information

Graph width-parameters and algorithms

Graph width-parameters and algorithms Grph width-prmeters nd lgorithms Jisu Jeong (KAIST) joint work with Sigve Hortemo Sæther nd Jn Arne Telle (University of Bergen) 2015 KMS Annul Meeting 2015.10.24. YONSEI UNIVERSITY Grph width-prmeters

More information