TIME AND STATE IN DISTRIBUTED SYSTEMS

Size: px
Start display at page:

Download "TIME AND STATE IN DISTRIBUTED SYSTEMS"

Transcription

1 Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is no notion of glol physil time. The n rystls on the n omputers will run t slightly different rtes, using the loks grdully to get out of synhroniztion nd give different vlues. 2. Lmport s Logil Cloks Prolems: 3. Vetor Cloks 4. Cusl Ordering of Messges 5. Glol Sttes nd their Consisteny Time triggered systems: these re systems in whih ertin tivities re sheduled to our t predefined moments in time. If suh tivities re to e oordinted over distriuted system we need oherent notion of time. Exmple: time-triggered rel-time systems 6. Cuts of Distriuted Computtion 7. Reording of Glol Stte Mintining the onsisteny of distriuted dt is often sed on the time when ertin modifition hs een performed. Exmple: mke progrm. Distriuted Systems Fö 5-3 Distriuted Systems Fö 5-4 Time in Distriuted Systems (ont d) The mke-progrm exmple When the progrmmer hs finished hnging some soure files he strts mke; mke exmines the times t whih ll ojet nd soure files were lst modified nd deides whih soure files hve to e (re)ompiled. Computer 1 (ompiler) Computer 2 (editor) P.o reted P. reted lthough P. is modified fter P.o hs een generted, euse of the lok drift the time ssigned to P. is smller. P. will not e reompiled for the new version! lol physil lok lol physil lok Solutions: Time in Distriuted Systems (ont d) Synhroniztion of physil loks Computer loks re synhronized with one nother to n hievle, known, degree of ury within the ounds of this ury we n oordinte tivities on different omputers using eh omputer s lol lok. Physil lok synhroniztion is needed for distriuted rel-time systems. Logil loks In mny pplitions we re not interested in the physil time t whih events our; wht is importnt is the reltive order of events! The mke-progrm is suh n exmple (slide 3). In suh situtions we don t need synhronized physil loks. Reltive ordering is sed on virtul notion of time - logil time. Logil time is implemented using logil loks.

2 Distriuted Systems Fö 5-5 Distriuted Systems Fö 5-6 Lmport s Logil Cloks Lmport s Logil Cloks (ont d) The order of events ourring t different proesses is ritil for mny distriuted pplitions. Exmple: P.o_reted nd P._reted in slide 3. Ordering n e sed on two simple situtions: 1. If two events ourred in the sme proess then they ourred in the order oserved following the respetive proess; 2. Whenever messge is sent etween proesses, the event of sending the messge ourred efore the event of reeiving it. If, we sy tht event uslly ffets event. The two events re uslly relted. There re events whih re not relted y the hppened-efore reltion. If oth e nd e re flse, then nd e re onurrent events; we write e. m 1 Ordering y Lmport is sed on the hppenedefore reltion (denoted y ):, if nd re events in the sme proess nd ourred efore ;,if is the event of sending messge m in proess, nd is the event of the sme messge m eing reeived y nother proess; If nd, then (the reltion is trnsitive). e P1, P2, P3: proesses;,,, d, e, f: events; d m2 f, d, e f,, d f, d, f, d, f,... e, e,... Distriuted Systems Fö 5-7 Distriuted Systems Fö 5-8 Lmport s Logil Cloks (ont d) Lmport s Logil Cloks (ont d) Using physil loks, the hppened efore reltion n not e ptured. It is possile tht nd t the sme time T > T (T is the physil time of ). Logil loks n e used in order to pture the hppened-efore reltion. logil lok is monotonilly inresing softwre ounter. There is logil lok C Pi t eh proess P i in the system. The vlue of the logil lok is used to ssign timestmps to events. C Pi () is the timestmp of event in proess P i. There is no reltionship etween logil lok nd ny physil lok. To pture the hppened-efore reltion, logil loks hve to e implemented so tht if, then C() < C() Implementtion of logil loks is performed using the following rules for updting the loks nd trnsmitting their vlues in messges: [R1]: C Pi is inremented efore eh event is issued t proess P i : C Pi := C Pi + 1. [R2]: ) When is the event of sending messge m from proess P i, then the timestmp t m = C Pi () is inluded in m (C Pi () is the logil lok vlue otined fter pplying rule R1). ) On reeiving messge m y proess P j, its logil lok C Pj is updted s follows: C Pj := mx(c Pj, t m ). ) The new vlue of C Pj is used to timestmp the event of reeiving messge m y P j (pplying rule R1). If nd re events in the sme proess nd ourred efore, then, nd (y R1) C() < C(). If is the event of sending messge m in proess, nd is the event of the sme messge m eing reeived y nother proess, then, nd (y R2) C() < C(). If nd, then, nd (y indution) C() < C().

3 Distriuted Systems Fö 5-9 Distriuted Systems Fö 5-10 Lmport s Logil Cloks (ont d) Prolems with Lmport s Logil Cloks 1 2 m 1 Lmport s logil loks impose only prtil order on the set of events; pirs of distint events generted y different proesses n hve identil timestmp. Computer 1 (ompiler) Computer 2 (editor) e For the mke-progrm exmple we suppose tht proess running ompiltion notifies, through messge, the proess holding the soure file out the event P.o reted logil lok n e used to orretly timestmp the files P.o reted d 3 4 m2 f P. reted lol physil lok lol physil lok For ertin pplitions totl ordering is needed; they onsider tht no two events n our t the sme time. In order to enfore totl ordering glol logil timestmp is introdued: - the glol logil timestmp of n event ourring t proess P i, with logil timestmp C Pi (), is pir (C Pi (), i), where i is n identifier of proess P i ; - we define (C Pi (), i) < (C Pj (), j) if nd only if C Pi () < C Pj (), or C Pi () = C Pj () nd i < j. (1,1) (2,1) e m 1 (3,2) (4,2) (1,3) (5,3) d m2 f Distriuted Systems Fö 5-11 Distriuted Systems Fö 5-12 Prolems with Lmport s Logil Cloks (ont d) Prolems with Lmport s Logil Cloks (ont d) Lmport s logil loks re not powerful enough to perform usl ordering of events. if, then C() < C(). However, the reverse is not lwys true (if the events ourred in different proesses): if C() < C(), then is not neessrily true. (it is only gurnteed tht is not true). (1,1) (2,1) e m 1 C(e) < C(), however there is no usl reltion from event e to event. (3,2) (4,2) (1,3) (5,3) y just looking t the timestmps of the events, we nnot sy whether two events re uslly relted or not. d m2 f send(m 1 ) send(m 3 ) M 2 M send(m 2 ) M 3 3 We would like messges to e proessed ording to their usl order. We would like to use the ssoited timestmp for this purpose. Proess reeives messges M 1, M 2, nd M 3. send(m 1 ) send(m 2 ), send(m 1 ) send(m 3 ), send(m 3 ) send(m 2 ) M 1 hs to e proessed efore M 2 nd M 3. However hs not to wit for M 3 in order to proess it efore M 2 (lthough M 3 s logil lok timestmp is smller thn M 2 s).

4 Distriuted Systems Fö 5-13 Distriuted Systems Fö 5-14 Vetor Cloks Vetor Cloks (ont d) Vetor loks give the ility to deide whether two events re uslly relted or not y simply looking t their timestmp. Implementtion of vetor loks is performed using the following rules for updting the loks nd trnsmitting their vlues in messges: Eh proess P i hs lok CPi v, whih is n integer vetor of length n (n is the numer of proesses). The vlue of CPi v is used to ssign timestmps to events in proess P i. CPi() v is the timestmp of event in proess P i. C v Pi[i], the ith entry of C v Pi,orresponds to P i s own logil time. CPi[j], v j i,isp i s "est guess" of the logil time t P j. CPi v [j] indites the (logil) time of ourrene of the lst event t P j whih is in hppenedefore reltion to the urrent event t P i. [R1]: C v Pi is inremented efore eh event is issued t proess P i : C v Pi[i] := C v Pi[i] + 1. [R2]: ) When is the event of sending messge m from proess P i, then the timestmp t m = CPi() v is inluded in m (CPi v () is the vetor lok vlue otined fter pplying rule R1). ) On reeiving messge m y proess P j, its vetor lok CPj v is updted s follows: k {1,2,..,n}, CPj v [k] := mx(cv Pj [k], t m [k]). ) The new vlue of CPj v is used to timestmp the event of reeiving messge m y P j (pplying rule R1). Distriuted Systems Fö 5-15 Distriuted Systems Fö 5-16 (1,0,0) Vetor Cloks (ont d) (2,0,0) (3,0,0) Cusl Ordering of Messges Using Vetor Cloks (0,1,0) (2,2,0) (2,3,1) (2,4,1) d e f (0,0,1) (2,4,2) g For ny two vetor timestmps u nd v, we hve: u = v if nd only if i, u[i] = v[i] u v if nd only if i, u[i] v[i] u < v if nd only if (u v u v) u v if nd only if (u < v) (v < u) h The prolem hs een formulted on slide 12: We would like messges to e proessed ording to their usl order. If Send(M 1 ) Send(M 2 ), then every reipient of oth messges M 1 nd M 2 must reeive M 1 efore M 2. Two events nd re uslly relted if nd only if C v () < C v () or C v () < C v (). Otherwise the events re onurrent. With vetor loks we get the property whih we missed for Lmport s logil loks: if nd only if C v () < C v (). Thus, y just looking t the timestmps of the events, we n sy whether two events re uslly relted or not.

5 Distriuted Systems Fö 5-17 Distriuted Systems Fö 5-18 Cusl Ordering of Messges Using Vetor Cloks (ont d) Cusl Ordering of Messges Using Vetor Cloks (ont d) (0,0,0) (0,1,0) (0,1,1) (0,2,1) The events whih re of interest here re the sending of messges vetor loks will e inremented only for messge sending. (0,0,0) (0,0,0) (0,1,0) (0,1,0) (0,1,1) (0,1,1) (0,2,1) (0,2,1) messge delivery protool whih preforms usl ordering sed on vetor loks. si Ide: - messge is delivered to proess only if the messge immeditely preeding it (onsidering the usl ordering) hs een lredy delivered to the proess. Otherwise, the messge is uffered. We ssume tht proesses ommunite using rodst messges. (There exist similr protools for non-rodst ommunition too.) Implementtion of the protool is sed on the following rules: [R1]: ) efore rodsting messge m, proess P i inrements the vetor lok: C v Pi[i]:=C v Pi[i]+1. ) The timestmp t m = CPi v is inluded in m. [R2]: The reeiving side, t proess P j, delys the delivery of messge m oming from P i until oth the following onditions re stisfied: 1. CPj v [i] = t m [i] k {1,2,..,n} - {i}, CPj v [k] t m [k] Delyed messges re queued t eh proess in queue tht is sorted y their vetor timestmp; onurrent messges re ordered y the time of their rrivl. [R3]: When messge is delivered t proess P j, its vetor lok CPj v is updted ording to rule R2 for vetor lok implementtion (see slide 14). t m [i] - 1 indites how mny messges originting from P i preede m. Step R2.1 ensures tht proess P j hs reeived ll the messges originting from P i tht preede m. Step R2.2 ensures tht P j hs reeived ll those messges reeived y P i efore sending m. Distriuted Systems Fö 5-19 Distriuted Systems Fö 5-20 Glol Sttes The prolem is how to ollet nd reord onsistent glol stte in distriuted system. Why prolem? euse there is no glol lok (no oherent notion of time) nd no shred memory! Glol Sttes (ont d) Consider nk system with two ounts nd t two different sites; we trnsfer $50 etween nd. Ch1: empty $500 $200 Ch1: $50 $450 $200 $450 $250 Ch1: empty Ch1 C : onsistent NC: not onsistent 500 empty 200 C NC C 450 empty 200 NC NC NC 450 empty 250 C 500 empty 250 NC

6 Distriuted Systems Fö 5-21 Distriuted Systems Fö 5-22 Glol Sttes (ont d) Forml Definition In generl, glol stte onsists of set of lol sttes nd set of sttes of the ommunition hnnels. The stte of the ommunition hnnel in onsistent glol stte should e the sequene of messges sent long the hnnel efore the sender s stte ws reorded, exluding the sequene of messges reeived long the hnnel efore the reeiver s stte ws reorded. It is diffiult to reord hnnel sttes to ensure the ove rule glol sttes re very often reorded without using hnnel sttes. This is the se in the definition elow. LS i is the lol stte of proess P i. eside other informtion, the lol stte lso inludes reord of ll messges sent nd reeived y the proess. We onsider the glol stte GS of system, s the olletion of the lol sttes of its proesses: GS = {LS 1, LS 2,..., LS n }. ertin glol stte n e onsistent or not! send(m k ij ) denotes the event of sending messge mk ij from P i to P j ; re(m k ij) denotes the event of reeiving messge m k ij y P j. send(m k ij) LS i if nd only if the sending event ourred efore the lol stte ws reorded; re(m k ij) LS j if nd only if the reeiving event ourred efore the lol stte ws reorded. trnsit(ls i,ls j ) = {m k ij send(mk ij ) LS i re(mk ij ) LS j } inonsistent(ls i,ls j )={m k ij send(mk ij ) LS i re(mk ij ) LS j } Distriuted Systems Fö 5-23 Distriuted Systems Fö 5-24 Forml Definition (ont d) Forml Definition (ont d) glol stte GS ={LS 1, LS 2,..., LS n }isonsistent if nd only if: i, j: 1 i, j n :: inonsistent(ls i,ls j ) = In onsistent glol stte for every reeived messge orresponding send event is reorded in the glol stte. In n inonsistent glol stte, there is t lest one messge whose reeive event is reorded ut its send event is not reorded. LS 11 LS12 LS 21 LS 22 LS 23 glol stte GS ={LS 1, LS 2,..., LS n }istrnsitless if nd only if: i, j: 1 i, j n :: trnsit(ls i,ls j ) = ll messges reorded to e sent re lso reorded to e reeived. glol stte is strongly onsistent if it is onsistent nd trnsitless. strongly onsistent stte orresponds to onsistent stte in whih ll messges reorded s sent re lso reorded s reeived. LS 31 LS 32 LS 33 {LS 11, LS 22, LS 32 } is inonsistent; {LS 12, LS 23, LS 33 } is onsistent; {LS 11, LS 21, LS 31 } is strongly onsistent. Note: the glol stte, s defined here, is seen s olletion of the lol sttes, without expliitely pturing the stte of the hnnel.

7 Distriuted Systems Fö 5-25 Distriuted Systems Fö 5-26 Forml Definition (ont d) Ch1: empty $500 $200 Ch1: $50 $450 $200 Ch1: empty $450 $250 Cuts of Distriuted Computtion ut is grphil representtion of glol stte. onsistent ut is grphil representtion of onsistent glol stte. ut of distriuted omputtion is set Ct = { 1, 2,..., n }, where i is the ut event t proess Pi. ut event is the event of reording lol stte of the respetive proess. C : onsistent NC: not onsistent {,}: strongly C {,}: C (mess 1 sent) (mess 1 reeived) {,}: NC 450 (mess 1 sent) 250 (mess 1 reeived) {,}: strongly C LS 11 LS LS 21 LS 22 LS LS 31 LS 32 LS 33 fter registering of the reeive event(s) onsistent stte eomes strongly onsistent. It is onsidered to e norml (trnsient) sitution. Distriuted Systems Fö 5-27 Distriuted Systems Fö 5-28 Cuts of Distriuted Computtion (ont d) Cuts of Distriuted Computtion (ont d) Let e k denote n event t proess P k. utct ={ 1, 2,..., n } is onsistent ut if nd only if P i, P j, e i, e j suh tht (e i e j ) (e j j ) (e i i ) ut is onsistent if every messge tht ws reeived efore ut event ws sent efore the ut event t the sender proess. LS 11 1 e 1 6 LS12 Theorem ut Ct = { 1, 2,..., n } is onsistent ut if nd only if no two ut events re uslly relted, tht is: i, j :: ( i j ) ( j i ) set of onurrent ut events form onsistent ut. LS 11 1 e 1 6 LS12 LS 21 LS 22 LS 23 2 e LS 21 LS 22 LS 23 2 e LS 31 LS 32 LS LS 31 LS 32 LS 33 { 1, 4, 5 } is not onsistent: (e 1 e 2 ) (e 2 4 ) (e 1 1 ) { 1, 2, 3 }: strongly onsistent (no ommunition line is rossed) { 6, 7, 8 }: onsistent (ommunition line is rossed ut no usl reltion). { 1, 4, 5 }: not onsistent; 1 4

8 Distriuted Systems Fö 5-29 Distriuted Systems Fö 5-30 Glol Stte Reording (Chndy-Lmport lgorithm) Glol Stte Reording (ont d) Some disussion on how to ollet glol stte: The lgorithm reords olletion of lol sttes whih give onsistent glol stte of the system. In ddition it reords the stte of the hnnels whih is onsistent with the olleted glol stte. Suh reorded "view" of the system is lled snpshot. We ssume tht proesses re onneted through one diretionl hnnels nd messge delivery is FIFO. We ssume tht the grph of proesses nd hnnels is strongly onneted (there exists pth etween ny two proesses). The lgorithm is sed on the use of speil messge, snpshot token, in order to ontrol the stte olletion proess. proess P i reords its lol stte LS i nd lter sends messge m to P j ; LS j t P j hs to e reorded efore P j hs reeived m. The stte SCh ij of the hnnel Ch ij onsists of ll messges tht proess P i sent efore reording LS i nd whih hve not een reeived y P j when reording LS j. snpshot is strted t the request of prtiulr proess P i, for exmple, when it suspets dedlok euse of long dely in essing resoure; P i then reords its stte LS i nd, efore sending ny other messge, it sends token to every P j tht P i ommunites with. When P j reeives token from P i, nd this is the first time it reeived token, it must reord its stte efore it reeives the next messge from P i. fter reording its stte P j sends token to every proess it ommunites with, efore sending them ny other messge. Distriuted Systems Fö 5-31 Distriuted Systems Fö 5-32 Glol Stte Reording (ont d) Glol Stte Reording (ont d) Wht out the hnnel sttes? Mye, you prefer this view: P i sends token to P j nd this is the first time P j reeived token P j immeditely reords its stte. ll the messges sent y P i efore sending the token hve een reeived t P j SCh ij :=. P j reeives token from P k,utp j lredy reorded its stte. M is the set of messges tht Pj reeived from P k fter P j reorded its stte nd efore P j reeived the token from P k SCh kj := M. i P i P k k token sending P k messges sent fter LS k reorded messges sent efore LS k reorded stte of hnnel Ch kj P j LS k token from P k messges reeived fter LS j reorded messges reeived efore LS j reorded LS j P j j stte of Ch kj Don t forget when you look to the piture: we ssumed tht messge pssing on hnnel onneting two proesses is FIFO. The lgorithm termintes when ll proesses hve reeived tokens on ll their input hnnels. The proess tht initited the snpshot should e informed; it n ollet the glol snpshot.

9 Distriuted Systems Fö 5-33 Distriuted Systems Fö 5-34 Glol Stte Reording (ont d) Summry The lgorithm Rule for sender P i : /* performed y the inititing proess nd y ny other proess t the reeption of the first token */ [SR1]: P i reords its stte. [SR2]: P i sends token on eh of its outgoing hnnels. Rule for reeiver P j : /* exeuted whenever P j reeives token from nother proess P i on hnnel Ch ij */ [RR1]: if P j hs not yet reorded its stte then Reord the stte of the hnnel: SCh ij :=. Follow the "Rule for sender". else Reord the stte of the hnnel: SCh ij := M, where M is the set of messges tht Pj reeived from P i fter P j reorded its stte nd efore P j reeived the token on Ch ij. end if. In distriuted system there is no ext notion of glol physil time. Physil loks n e synhronized to ertin ury. In mny pplitions not physil time is importnt ut only the reltive ordering of ertin events. Suh n ordering n e hieved using logil loks. Lmport s logil loks re implemented using monotoni integer ounter t eh site. They n e used in order to pture the hppened-efore reltion. The min prolem with Lmport s loks is tht they re not powerful enough to perform usl ordering of events. Vetor loks give the ility to deide whether two events re uslly relted or not, y simply looking t their timestmps. Distriuted Systems Fö 5-35 Summry (ont d) s there doesn t exist glol notion of physil time, it is very diffiult to reson out glol stte in distriuted system. We n onsider glol stte s olletion of lol sttes nd, possily, set of sttes of the ommunition hnnels. glol stte n e onsistent or not. ut is grphil representtion of glol stte. Using uts it is esy to elegntly reson out onsisteny of glol sttes. It is possile to reord lol sttes nd sttes of the hnnels, so tht together they provide onsistent view of the system. Suh view is lled snpshot.

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

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

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

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

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

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

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

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

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

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

Test Generation from Timed Input Output Automata

Test Generation from Timed Input Output Automata Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

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

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

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

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

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

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

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

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Alpha Algorithm: Limitations

Alpha Algorithm: Limitations Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t

More information

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Automatic Synthesis of New Behaviors from a Library of Available Behaviors Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

CS 347 Parallel and Distributed Data Processing

CS 347 Parallel and Distributed Data Processing CS 347 Prllel nd Distriuted Dt Proessing Spring 06 Network Prtitions Susets of nodes m e isolted or nodes m e slow in responding Notes 8: Network Prtitions CS 347 Notes 8 Network Prtitions Cuses ired network

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

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

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

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

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

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomials. Polynomials. Curriculum Ready ACMNA: Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

More information

Alpha Algorithm: A Process Discovery Algorithm

Alpha Algorithm: A Process Discovery Algorithm Proess Mining: Dt Siene in Ation Alph Algorithm: A Proess Disovery Algorithm prof.dr.ir. Wil vn der Alst www.proessmining.org Proess disovery = Ply-In Ply-In event log proess model Ply-Out Reply proess

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

Abstraction of Nondeterministic Automata Rong Su

Abstraction of Nondeterministic Automata Rong Su Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Transition systems (motivation)

Transition systems (motivation) Trnsition systems (motivtion) Course Modelling of Conurrent Systems ( Modellierung neenläufiger Systeme ) Winter Semester 2009/0 University of Duisurg-Essen Brr König Tehing ssistnt: Christoph Blume In

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Exercise 3 Logic Control

Exercise 3 Logic Control Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled

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

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

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

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

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

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

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

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

LIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon

LIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon LIP Lortoire de l Informtique du Prllélisme Eole Normle Supérieure de Lyon Institut IMAG Unité de reherhe ssoiée u CNRS n 1398 One-wy Cellulr Automt on Cyley Grphs Zsuzsnn Rok Mrs 1993 Reserh Report N

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

Functions. mjarrar Watch this lecture and download the slides

Functions. mjarrar Watch this lecture and download the slides 9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides

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

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

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

Regular expressions, Finite Automata, transition graphs are all the same!!

Regular expressions, Finite Automata, transition graphs are all the same!! CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management

Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. XX, NO. X, XXX 2009 1 Deentrlized Dignosis or Nonilures o Disrete Event Systems Using Inerene-Bsed Amiguity Mngement

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

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

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

Learning Partially Observable Markov Models from First Passage Times

Learning Partially Observable Markov Models from First Passage Times Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).

More information

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000 orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

5. Every rational number have either terminating or repeating (recurring) decimal representation.

5. Every rational number have either terminating or repeating (recurring) decimal representation. CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd

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

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Spring 2018 Homework 7 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now

More information

Lecture Summaries for Multivariable Integral Calculus M52B

Lecture Summaries for Multivariable Integral Calculus M52B These leture summries my lso be viewed online by liking the L ion t the top right of ny leture sreen. Leture Summries for Multivrible Integrl Clulus M52B Chpter nd setion numbers refer to the 6th edition.

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

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

More information

More on automata. Michael George. March 24 April 7, 2014

More on automata. Michael George. March 24 April 7, 2014 More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose

More information

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1 Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more

More information

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

More information