tr0 TREES Hanan Samet
|
|
- Silas Barnett
- 6 years ago
- Views:
Transcription
1 t0 TREES Hanan Samet ompute Science epatment and ente fo utomation Reseach and Institute fo dvanced ompute Studies Univesity of Mayland ollege Pak, Mayland opyight 1997 Hanan Samet These notes may not e epoduced y any means (mechanical o electonic o any othe) without the expess witten pemission of Hanan Samet
2 TREE EFINITION t1 TREE a anching stuctue etween nodes finite set T of one o moe nodes such that: 1. one element of the set is distinguished, ROOT(T). the emaining nodes of T ae patitioned into m 0 disjoint sets T 1, T, T m and each of these sets is in tun a tee. tees T 1, T, T ae the sutees of the oot Recusive definition easy to pove theoems aout popeties of tees. Ex: pove tue fo 1 node assume tue fo n nodes pove tue fo n+1 nodes ORERE TREE if the elative ode of the sutees T 1, T, T is impotant ORIENTE TREE ode is not impotant m m odeed? = E E ompute epesentation odeed! opyight 1998 y Hanan Samet
3 TERMINOLOGY 1 t E F G ounteintuitive! EGREE nume of sutees of a node Teminal node leaf degee 0 RNH NOE non-teminal node Root is the fathe of the oots of its sutees Roots of sutees of a node ae othes Roots of sutees of a node ae sons of the node The oot of the tee has no fathe! is an ancesto of, E, G, G is a descendant of level(x) if fathe(x)=ω then 0 else 1+level(fathe(X)); Ex: level(g) = 1+level(F) 1+level() 1+level() 0 opyight 1998 y Hanan Samet
4 TERMINOLOGY 1 t level 0 ounteintuitive! E F G level 1 level level 3 EGREE nume of sutees of a node Teminal node leaf degee 0 RNH NOE non-teminal node Root is the fathe of the oots of its sutees Roots of sutees of a node ae othes Roots of sutees of a node ae sons of the node The oot of the tee has no fathe! is an ancesto of, E, G, G is a descendant of level(x) if fathe(x)=ω then 0 else 1+level(fathe(X)); Ex: level(g) = 1+level(F) 1+level() 1+level() 0 opyight 1998 y Hanan Samet
5 FORESTS N INRY TREES t3 FOREST a set (usually odeed) of 0 o moe disjoint tees, o equivalently: the nodes of a tee excluding the oot has the foest E F E F INRY TREE a finite set of nodes which eithe is empty o a oot and two disjoint inay tees called the left and ight sutees of the oot Is a inay tee a special case of a tee? opyight 1998 y Hanan Samet
6 FORESTS N INRY TREES t3 FOREST a set (usually odeed) of 0 o moe disjoint tees, o equivalently: the nodes of a tee excluding the oot has the foest E F E F INRY TREE a finite set of nodes which eithe is empty o a oot and two disjoint inay tees called the left and ight sutees of the oot Is a inay tee a special case of a tee? NO! n entiely diffeent concept 1 and ae diffeent inay tees opyight 1998 y Hanan Samet
7 FORESTS N INRY TREES 3 z t3 FOREST a set (usually odeed) of 0 o moe disjoint tees, o equivalently: the nodes of a tee excluding the oot has the foest E F E F INRY TREE a finite set of nodes which eithe is empty o a oot and two disjoint inay tees called the left and ight sutees of the oot Is a inay tee a special case of a tee? NO! n entiely diffeent concept 1 and 1 has an empty ight sutee has an empty left sutee ut as tees 1 and ae identical! ae diffeent inay tees opyight 1998 y Hanan Samet
8 OTHER REPRESENTTIONS OF TREES t4 Nested sets (also known as ule diagams ) G E F G E F Nested paentheses Tee (oot sutee 1 sutee... sutee n ) ( ( () ()) (G (E (F)))) inay tee Indentation G E F (oot left ight) ( ( ( () ()) ( () ())) (G (E (F () ()) ()) ())) ewey decimal notation: opyight 1998 y Hanan Samet
9 t5 PPLITIONS Segmentation of lage ectangula aays [n,m] each ow is a segment (uoughs computes) [1] [] [n] [1,1] [1,] [1,m] [n,1] [n,] [n,m] lgeaic fomulas opeato opeand opeand +(( ) ) + 1. no need fo paentheses ut + = ( )+ (+). code geneation LW 1, LW, W, MW, W,1 opyight 1998 y Hanan Samet
10 LISTs (with a capital L!) t6 LIST a finite sequence of 0 o moe atoms o LISTS L=(,(,,),(),,((()))) () empty list Index notation: L[]=(,,) L[,1]= L[5,] L[5,1,1] iffeences etween LISTS and tees: 1. no data appeas in the nodes epesenting LISTS - i.e.,. LISTS may e ecusive M=(M) [M] Lael [M] 3. LISTS may ovelap (i.e., need not e disjoint) equivalently, sutees may e shaed N=(M,M,,N) [N] [M] [M] [N] [M] opyight 1998 y Hanan Samet
11 TRVERSING INRY TREES t7 Repesentation LLINK INFO RLINK Ω Ω Ω Ω Ω Ω Ω pplications: 1. code geneation in compiles. game tees in atificial intelligence 3. detect if a stuctue is eally a tee TREE one path fom each node to anothe node (unlike gaph) no cycles and opyight 1998 y Hanan Samet
12 TRVERSL ORERS 1. Peode oot, left sutee, ight sutee depth-fist seach. Inode left sutee, oot, ight sutee inay seach tee 3. Postode left sutee, ight sutee, oot code geneation t8 inay seach tee: left < oot < ight inode yields Ex: peode = I K E G H F J inode = postode = Inode tavesal equies a stack to go ack up the tee: opyight 1998 y Hanan Samet
13 TRVERSL ORERS 1. Peode oot, left sutee, ight sutee depth-fist seach. Inode left sutee, oot, ight sutee inay seach tee 3. Postode left sutee, ight sutee, oot code geneation t8 inay seach tee: left < oot < ight inode yields Ex: peode = I K E G F H J I K E G H F J inode = postode = Inode tavesal equies a stack to go ack up the tee: opyight 1998 y Hanan Samet
14 TRVERSL ORERS 1. Peode oot, left sutee, ight sutee depth-fist seach. Inode left sutee, oot, ight sutee inay seach tee 3. Postode left sutee, ight sutee, oot code geneation 3 z t8 inay seach tee: left < oot < ight inode yields Ex: peode = I K E G F H J I K E G H F J inode = postode = I K E G H F J Inode tavesal equies a stack to go ack up the tee: opyight 1998 y Hanan Samet
15 TRVERSL ORERS 1. Peode oot, left sutee, ight sutee depth-fist seach. Inode left sutee, oot, ight sutee inay seach tee 3. Postode left sutee, ight sutee, oot code geneation 4 g 3 z t8 inay seach tee: left < oot < ight inode yields Ex: peode = I K E G F H J I K E G H F J inode = postode = I K E G H F J I K G E H J F Inode tavesal equies a stack to go ack up the tee: opyight 1998 y Hanan Samet
16 INORER TRVERSL LGORITHM t9 pocedue inode(tee pointe T); egin stack ; tee pointe P; Ω; P T; while not(p=ω and =Ω) do egin if P=Ω then egin P ; /* Pop the stack */ visit(root(p)); P RLINK(P); end else egin P; /* Push on the stack */ P LLINK(P); Using ecusion: pocedue inode(tee pointe T); egin if T=Ω then etun else egin inode(llink(t)); visit(root(t)); inode(rlink(t)); opyight 1998 y Hanan Samet
17 THREE INRY TREES inay tee epesentation has too many Ω links Use 1-it tag fields to indicate pesence of a link If Ω link, then use field to stoe links to othe pats of the stuctue to aid the tavesal of the tee t10 Untheaded: Theaded: LLINK(p) = Ω LTG(p) = 0, LLINK(p) = $p = inode pedecesso of p LLINK(p) = q Ω LTG(p) = 1, LLINK(p) = q RLINK(p) = Ω RTG(p) = 0, RLINK(p) = p$ = inode successo of p RLINK(p) = q Ω RTG(p) = 1, RLINK(p) = q LLINK LTG INFO RTG RLINK Ex: HE E F G H J If addess of ROOT(T) < addess of left and ight sons, then don't need the TG fields Theads will point to lowe addesses! opyight 1998 y Hanan Samet
18 THREE INRY TREES t10 inay tee epesentation has too many Ω links Use 1-it tag fields to indicate pesence of a link If Ω link, then use field to stoe links to othe pats of the stuctue to aid the tavesal of the tee Untheaded: Theaded: LLINK(p) = Ω LTG(p) = 0, LLINK(p) = $p = inode pedecesso of p LLINK(p) = q Ω LTG(p) = 1, LLINK(p) = q RLINK(p) = Ω RTG(p) = 0, RLINK(p) = p$ = inode successo of p RLINK(p) = q Ω RTG(p) = 1, RLINK(p) = q LLINK LTG INFO RTG RLINK Ex: HE E F G H J If addess of ROOT(T) < addess of left and ight sons, then don't need the TG fields Theads will point to lowe addesses! opyight 1998 y Hanan Samet
19 THREE INRY TREES 3 z t10 inay tee epesentation has too many Ω links Use 1-it tag fields to indicate pesence of a link If Ω link, then use field to stoe links to othe pats of the stuctue to aid the tavesal of the tee Untheaded: Theaded: LLINK(p) = Ω LTG(p) = 0, LLINK(p) = $p = inode pedecesso of p LLINK(p) = q Ω LTG(p) = 1, LLINK(p) = q RLINK(p) = Ω RTG(p) = 0, RLINK(p) = p$ = inode successo of p RLINK(p) = q Ω RTG(p) = 1, RLINK(p) = q LLINK LTG INFO RTG RLINK Ex: HE E F G H J If addess of ROOT(T) < addess of left and ight sons, then don't need the TG fields Theads will point to lowe addesses! opyight 1998 y Hanan Samet
20 OPERTIONS ON THREE INRY TREES Find the inode successo of node P (P$) t11 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
21 OPERTIONS ON THREE INRY TREES Find the inode successo of node P (P$) t11 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
22 OPERTIONS ON THREE INRY TREES 3 z t11 Find the inode successo of node P (P$) 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P Q Q 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
23 OPERTIONS ON THREE INRY TREES 4 g 3 z t11 Find the inode successo of node P (P$) 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P Q Q 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
24 OPERTIONS ON THREE INRY TREES 5 v 4 g 3 z t11 Find the inode successo of node P (P$) 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P Q Q 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
25 OPERTIONS ON THREE INRY TREES 6 5 v 4 g 3 z t11 Find the inode successo of node P (P$) 1. Q RLINK(P); /* ight thead points to P$ */. if RTG(P)=1 then egin /* not a thead */ while LTG(Q)=1 do Q LLINK(Q); Inset node Q as the ight sutee of node P P P Q Q 1. RLINK(Q) RLINK(P); RTG(Q) RTG(P); RLINK(P) Q; LLINK(Q) P; RTG(P) 1; LTG(Q) 0;. if RTG(Q)=1 then LLINK(Q$) Q; opyight 1998 y Hanan Samet
26 SUMMRY OF THREING t1 1. dvantages no need fo a stack fo tavesal will not un out of memoy duing inode tavesal can find inode successo of any node without having to tavese the entie tee. isadvantages insetion and deletion of nodes is slowe can t shae common sutees in the theaded epesentation Ex: two choices fo the inode successo of F G? G E F E F E F 3. Right-theaded tees inode algoithms make little use of left theads LTG(P)=1 test can e eplaced y LLINK(P)=Ω test opyight 1998 y Hanan Samet
27 PRINIPLES OF REURSION t13 Two inay tees T1 and T ae said to e simila if they have the same shape o stuctue Fomally: 1. they ae oth empty o?. they ae oth non-empty and thei left and ight sutees espectively ae simila simila(t 1,T ) = if empty(t 1 ) and empty(t ) then T else simila(left(t 1 ),left(t )) and simila(ight(t 1 ),ight(t )); Will simila wok? opyight 1998 y Hanan Samet
28 PRINIPLES OF REURSION t13 Two inay tees T1 and T ae said to e simila if they have the same shape o stuctue Fomally: 1. they ae oth empty o?. they ae oth non-empty and thei left and ight sutees espectively ae simila simila(t 1,T ) = if empty(t 1 ) and empty(t ) then T else if empty(t 1 ) o empty(t ) then F else simila(left(t 1 ),left(t )) and simila(ight(t 1 ),ight(t )); Will simila wok? No! ase case does not handle case when one of the tees is empty and the othe one is not opyight 1998 y Hanan Samet
29 PRINIPLES OF REURSION 3 z t13 Two inay tees T1 and T ae said to e simila if they have the same shape o stuctue Fomally: 1. they ae oth empty o?. they ae oth non-empty and thei left and ight sutees espectively ae simila simila(t 1,T ) = if empty(t 1 ) and empty(t ) then T else if empty(t 1 ) o empty(t ) then F else simila(left(t 1 ),left(t )) and simila(ight(t 1 ),ight(t )); Will simila wok? No! ase case does not handle case when one of the tees is empty and the othe one is not Simplifying: and = if then o = else F opyight 1998 y Hanan Samet
30 PRINIPLES OF REURSION 4 g 3 z t13 Two inay tees T1 and T ae said to e simila if they have the same shape o stuctue Fomally: 1. they ae oth empty o?. they ae oth non-empty and thei left and ight sutees espectively ae simila simila(t 1,T ) = if empty(t 1 ) and empty(t ) then T else if empty(t 1 ) o empty(t ) then F else simila(left(t 1 ),left(t )) and simila(ight(t 1 ),ight(t )); Will simila wok? No! ase case does not handle case when one of the tees is empty and the othe one is not Simplifying: and = if then o = else F if then T else simila(t 1,T ) = if empty(t 1 ) then if empty(t ) then T else F else if empty(t ) then F else if simila(left(t 1 ),left(t )) then simila(ight(t 1 ),ight(t )) else F ; opyight 1998 y Hanan Samet
31 PRINIPLES OF REURSION 5 v 4 g 3 z t13 Two inay tees T1 and T ae said to e simila if they have the same shape o stuctue Fomally: 1. they ae oth empty o?. they ae oth non-empty and thei left and ight sutees espectively ae simila simila(t 1,T ) = if empty(t 1 ) and empty(t ) then T else if empty(t 1 ) o empty(t ) then F else simila(left(t 1 ),left(t )) and simila(ight(t 1 ),ight(t )); Will simila wok? No! ase case does not handle case when one of the tees is empty and the othe one is not Simplifying: and = if then o = else F if then T else simila(t 1,T ) = if empty(t 1 ) then empty(t ) if empty(t ) then T else F else if empty(t ) then F and else if simila(left(t 1 ),left(t )) then simila(ight(t 1 ),ight(t )) else F ; opyight 1998 y Hanan Samet
32 EQUIVLENE OF INRY TREES t14 Two inay tees T1 and T ae said to e equivalent if they ae simila and coesponding nodes contain the same infomation? equivalent(t1,t) = if empty(t1) and empty(t) then T else if empty(t1) o empty(t) then F else oot(t1)=oot(t) and equivalent(left(t1),left(t)) and equivalent(ight(t1),ight(t)); opyight 1998 y Hanan Samet
33 EQUIVLENE OF INRY TREES t14 Two inay tees T1 and T ae said to e equivalent if they ae simila and coesponding nodes contain the same infomation? NO! we ae dealing with inay tees and the left sutee of is not the same in the two cases equivalent(t1,t) = if empty(t1) and empty(t) then T else if empty(t1) o empty(t) then F else oot(t1)=oot(t) and equivalent(left(t1),left(t)) and equivalent(ight(t1),ight(t)); opyight 1998 y Hanan Samet
34 REURSION SUMMRY t15 voids having to use an explicit stack in the algoithm Polem fomulation is analogous to induction ase case, inductive case Ex: Factoial n! = n (n 1)! fact(n) = if n=0 then 1 else n*fact(n-1); The esult is otained y peeling one s way ack along the stack fact(3) = 3*fact() *fact(1) 1*fact(0) 1 = 6 Using an accumulato vaiale and a call fact(n,1): fact(n,total) = if n=0 then total else fact(n-1,n*total); Solution is iteative Recusion implemented on compute using stack instuctions. ec-system 10: PUSH, POP, PUSHJ, POPJ Stack pointe fomat: (count, addess) an simulate stack if no stack instuctions opyight 1998 y Hanan Samet
35 OMPLETE INRY TREES t16 When a inay tee is easonaly complete (most Ω links ae at the highest level), use a sequential stoage allocation scheme so that links ecome unnecessay E F level 0 level 1 level Ω E F If n is the highest level at which a node is found, then at most n+1 1 wods ae needed Stoage allocation method: 1. oot has addess 1. left son of x has addess addess(x) 3. ight son of x has addess addess(x) + 1 When should a complete inay tee e used? n = highest level of the tee at which a node is found x = # of nodes in tee 3 wods pe node (left link, ight link, info) use a complete inay tee when x > ( n+1 1) / 3 opyight 1998 y Hanan Samet
36 FORESTS t17 foest is an odeed set of 0 o moe tees Thee exists a natual coespondence etween foests and inay tees E F G K H J Rigoous definition of (F) F = (T 1, T,, T n ) H T i,1, T i,,, T i,m ae sutees of T i 1. If n = 0, (F) is empty J. If n > 0, oot of (F) is oot(t 1 ) left sutee of (F) is (T 1,1, T 1,,, T 1,m ) ight sutee of (F) is (T, T 3,, T n ) K E F G Tavesal of foests peode: postode: 1. visit oot of fist tee 1. tavese sutees of. tavese sutees of fist tee in postode fist tee in peode. visit oot of fist tee 3. tavese emaining 3. tavese emaining sutees in peode sutees in postode opyight 1998 y Hanan Samet
37 FORESTS t17 foest is an odeed set of 0 o moe tees Thee exists a natual coespondence etween foests and inay tees E F G K H J Rigoous definition of (F) F = (T 1, T,, T n ) H T i,1, T i,,, T i,m ae sutees of T i 1. If n = 0, (F) is empty J. If n > 0, oot of (F) is oot(t 1 ) left sutee of (F) is (T 1,1, T 1,,, T 1,m ) ight sutee of (F) is (T, T 3,, T n ) K E F G Tavesal of foests peode: postode: 1. visit oot of fist tee 1. tavese sutees of. tavese sutees of fist tee in postode fist tee in peode. visit oot of fist tee 3. tavese emaining 3. tavese emaining sutees in peode sutees in postode peode = K E H F J G opyight 1998 y Hanan Samet
38 FORESTS 3 z t17 foest is an odeed set of 0 o moe tees Thee exists a natual coespondence etween foests and inay tees E F G K H J Rigoous definition of (F) F = (T 1, T,, T n ) H T i,1, T i,,, T i,m ae sutees of T i 1. If n = 0, (F) is empty J. If n > 0, oot of (F) is oot(t 1 ) left sutee of (F) is (T 1,1, T 1,,, T 1,m ) ight sutee of (F) is (T, T 3,, T n ) K E F G Tavesal of foests peode: postode: 1. visit oot of fist tee 1. tavese sutees of. tavese sutees of fist tee in postode fist tee in peode. visit oot of fist tee 3. tavese emaining 3. tavese emaining sutees in peode sutees in postode peode = K E H F J G postode = K H E J F G opyight 1998 y Hanan Samet
39 FORESTS 4 g 3 z t17 foest is an odeed set of 0 o moe tees Thee exists a natual coespondence etween foests and inay tees E F G K H J Rigoous definition of (F) F = (T 1, T,, T n ) H T i,1, T i,,, T i,m ae sutees of T i 1. If n = 0, (F) is empty J. If n > 0, oot of (F) is oot(t 1 ) left sutee of (F) is (T 1,1, T 1,,, T 1,m ) ight sutee of (F) is (T, T 3,, T n ) K E F G Tavesal of foests peode: postode: 1. visit oot of fist tee 1. tavese sutees of. tavese sutees of fist tee in postode fist tee in peode. visit oot of fist tee 3. tavese emaining 3. tavese emaining sutees in peode sutees in postode peode = K E H F J G postode = K H E J F G inode of inay tee opyight 1998 y Hanan Samet
40 EQUIVLENE RELTION t18 Given: elations as to what is equivalent to what (a ) Goal: is x y? Fomal definition of an equivalence elation 1. if x y and y z then x z (tansitivity). if x y then y x (symmety) 3. x x (eflexivity) Ex: S = {1.. 9} is 6? opyight 1998 y Hanan Samet
41 EQUIVLENE RELTION t18 Given: elations as to what is equivalent to what (a ) Goal: is x y? Fomal definition of an equivalence elation 1. if x y and y z then x z (tansitivity). if x y then y x (symmety) 3. x x (eflexivity) Ex: S = {1.. 9} is 6? Yes, since Patitions S into disjoint susets o equivalence classes Two elements equivalent iff they elong to same class What ae the equivalence classes in this example? opyight 1998 y Hanan Samet
42 EQUIVLENE RELTION 3 z t18 Given: elations as to what is equivalent to what (a ) Goal: is x y? Fomal definition of an equivalence elation 1. if x y and y z then x z (tansitivity). if x y then y x (symmety) 3. x x (eflexivity) Ex: S = {1.. 9} is 6? Yes, since Patitions S into disjoint susets o equivalence classes Two elements equivalent iff they elong to same class What ae the equivalence classes in this example? {1,5} and {,3,4,6,7,8,9} opyight 1998 y Hanan Samet
43 LGORITHM t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
44 LGORITHM t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): 5 k: opyight 1998 y Hanan Samet
45 LGORITHM 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
46 LGORITHM 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
47 LGORITHM 5 g 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
48 LGORITHM 6 5 g 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
49 LGORITHM 7 z 6 5 g 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
50 LGORITHM 8 g 7 z 6 5 g 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: opyight 1998 y Hanan Samet
51 LGORITHM 9 8 g 7 z 6 5 g 4 v 3 z t19 Repesent each element as a node in foest of tees Tees consist only of fathe links (nil at oots) Each (nonedundant) elation meges two tees into one asic stategy: fo each elation a do egin find oot node of tee containing a; /* Find step */ find oot node s of tee containing ; if they diffe, mege the two tees; /* Union step */ a s mege(a,) a s lgoithm (also known as union-find ): fo evey element i do fathe(i) Ω while input_not_exhausted do egin get_pai(a,); while fathe(a) Ω do a fathe(a); while fathe() Ω do fathe(); if (a ) then fathe(a) ; fathe(k): k: Moe efficient with path compession and weight alancing Execution time almost linea (invese of ckemann function) opyight 1998 y Hanan Samet
tr0 TREES Hanan Samet
t0 TRS Hanan Samet ompute Science epatment and ente fo utomation Reseach and Institute fo dvanced ompute Studies Univesity of Mayland ollege Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu opyight 1997 Hanan
More informationTree. Tree. Siblings Grand Parent Grand Child H I J I J K. Tree Definitions
Tee Tee Lectues : oontee Kuatachue Room no. Kitawan Siiboon Room no. Text : ata Stuctues & lgoithm nalysis in, ++, Mak llen Weiss, ddison Wesley. Tee efinitions. inay Tee Tavesals inay Seach Tee Repesentations
More informationDepth-first search and strong connectivity in Coq
1 Depth-fist seach and stong connectivity in Coq Januay 9, 2015 2 The poblem Finding the stongly connected components of a diected gaph. Pedagogical value: The fist nontivial gaph algoithm. Pactical value:
More informationNoncrossing Trees and Noncrossing Graphs
Noncossing Tees and Noncossing Gaphs William Y. C. Chen and Shey H. F. Yan Cente fo Combinatoics, LPMC, Nanai Univesity, 300071 Tianjin, P.R. China chen@nanai.edu.cn, huifangyan@eyou.com Submitted: Sep
More informationRed-Black Trees Goodrich, Tamassia Red-Black Trees 1
Red-Black Tees 8 00 Goodich, Tamassia Red-Black Tees 1 Fom (,) to Red-Black Tees A ed-black tee is a epesentation of a (,) tee by means of a binay tee whose nodes ae coloed ed o black In compaison with
More informationarxiv:cs/ v1 [cs.ds] 8 Dec 1998
Minimum Cuts in Nea-Linea Time David R. Kage Febuay 1, 2008 axiv:cs/9812007v1 [cs.ds] 8 Dec 1998 Abstact We significantly impove known time bounds fo solving the minimum cut poblem on undiected gaphs.
More information10 Torque. Lab. What You Need To Know: Physics 211 Lab
b Lab 10 Toque What You Need To Know: F (a) F F Angula Systems Evey lab up to this point has dealt with objects moving in the linea system. In othe wods, objects moving in a staight line. Now we ae going
More informationCS3350B Computer Architecture. Lecture 6.2: Instructional Level Parallelism: Hazards and Resolutions
CS3350B Compute Achitectue Winte 2015 Lectue 6.2: Instuctional Level Paallelism: Hazads and Resolutions Mac Moeno Maza www.csd.uwo.ca/couses/cs3350b [Adapted fom lectues on Compute Oganization and Design,
More informationLecture Topics. Overview ECE 486/586. Computer Architecture. Lecture # 9. Processor Organization. Basic Processor Hardware Pipelining
EE 486/586 ompute chitectue Lectue # 9 asic Pocesso Hadwae Pipelining Refeence: ppendix : Section.1 Lectue Topics Sping 2015 Potland State Univesity Oveview Pocesso Oganization typical computing task consists
More informationMulti-Robot Forest Coverage
Multi-Robot Foest Coveage Xiaoming Zheng Sonal Jain Sven Koenig David Kempe Depatment of Compute Science Univesity of Southen Califonia Los Angeles, CA 90089-0781, USA {xiaominz, sonaljai, skoenig, dkempe}@usc.edu
More informationComplexity of Data Tree Patterns over XML Documents
Complexity of Data Tee Pattens ove XML Documents Claie David LIAFA, Univesity Pais 7 and CNRS, Fance cdavid@liafa.jussieu.f Abstact. We conside Boolean combinations of data tee pattens as a specification
More informationABriefIntroductiontotheBasicsof Game Theory
ABiefIntoductiontotheBasicsof Game Theoy Roy Smead Notheasten Univesity Septembe 18, 2013 Game theoy is a set of mathematical tools that ae used to epesent and study social inteactions. This is a vey bief
More informationDesign Engineering Challenge: The Big Dig Contest Platter Strategies: Ball Liberation
Poblem Set 4: Unifom Cicula Motion Design Engineeing Challenge: The Big Dig.007 Contest Platte Stategies: Ball Libeation Oeall Notes: You ae not equied to pefom the actual analysis in this poblem set,
More informationThe Solution to the Bühlmann - Straub Model in the case of a Homogeneous Credibility Estimators
5 Economy Infomatics, -4/005 The Solution to the Bühlmann - Staub Model in the case of a Homogeneous Cedibility Estimatos Lect. Viginia ATANASIU Mathematics Depatment, Academy of Economic Studies Oiginal
More informationMulti-Robot Flooding Algorithm for the Exploration of Unknown Indoor Environments
2010 IEEE Intenational Confeence on Robotics and Automation Anchoage Convention Distict May 3-8, 2010, Anchoage, Alaska, USA Multi-Robot Flooding Algoithm fo the Exploation of Unknown Indoo Envionments
More informationTorque. Physics 2. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Toque Physics Toque Toque is what causes angula acceleation (just like a foce causes linea acceleation) Toque Toque is what causes angula acceleation (just like a foce causes linea acceleation) Fo a toque
More informationFaster Nearest Neighbors: Voronoi Diagrams and k-d Trees
154 25 Jonathan Richad Shewchuk Faste Neaest Neighbos: Voonoi Diagams and k-d Tees SPEEDING UP NEAREST NEIGHBOR CLASSIFIERS Can we pepocess taining pts to obtain sublinea quey time? 2 5 dimensions: Voonoi
More informationThe Properties of. Model Rocket Body Tube Transitions
The Popeties of Moel ocket Boy Tube Tansitions Date: Septembe 6, 000 Pepae By: J.. Bohm NA 7808 CA S680 ev: (June, 005) .0 Intouction When esigning moel ockets, esignes often choose to incopoate iffeent
More informationBritish Prime Minister Benjamin Disraeli once remarked that
GABREL COSTA, MCHAEL HUBER, & OHN SACCOMAN Cumulative Home Run Fequency and the Recent Home Run Explosion Bitish Pime Ministe Benjamin Disaeli once emaked that thee ae thee kinds of falsehoods: lies, damned
More informationCORESTA RECOMMENDED METHOD N 68
COESTA ECOMMENDED METHOD N 68 DETEMINATION OF CABON MONOXIDE IN THE MAINSTEAM SMOKE OF CIGAS BY NON-DISPESIVE INFAED ANALYSIS (Januay 2010) 1. FIELD OF APPLICATION The method is applicable to the gas phase
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundamental Algoithms fo System Modeling, Analysis, and Optimization Edwad A. Lee, Jaijeet Roychowdhuy, Sanjit A. Seshia UC Bekeley EECS 44/44 Fall With thanks to R. K. Bayton, K. Keutze, N. Shenoy, and
More informationRearranging trees for robust consensus
Poceedings of the IEEE Conf. on Decision and Contol, Olando, FL, 011 Reaanging tees fo obust consensus Geoge Foest Young, Luca Scadovi and Naomi Ehich Leonad Abstact In this pape, we use the H nom associated
More informationThe Study About Stopping Distance of Vehicles
Intenational Jounal of Infomation Engineeing and Applications 018; 1(1): 18- http://www.aascit.og/jounal/infomation The Study About Stopping Distance of Vehicles Zhao Chun-xue School of Mathematics and
More information55CM ROUND CHARCOAL KETTLE BBQ
IMPORTANT - Please ead the instuctions caefully befoe assembling 55CM ROUND CHARCOAL KETTLE BBQ Assembly A Instuctions PLEASE RETAIN THE INSTRUCTIONS FOR FUTURE USE. Safety and Cae Advice the Wait fo it
More informationEfficient Algorithms for finding a Trunk on a Tree Network and its Applications
Efficient Algoithms fo finding a Tunk on a Tee Netwok and its Applications Yamin Li, Shietung Peng Depatment of Compute Science Hosei Uniesity Tokyo 84-8584 Japan {yamin;speng}@k.hosei.ac.jp Wanming Chu
More informationMultiple Vehicle Driving Control for Traffic Flow Efficiency
Multiple Vehicle Diving Contol fo Taffic Flow Efficiency Seong-Woo Kim, Gi-Poong Gwon, Seung-Tak Choi, Seung-am Kang, Myoung-Ok Shin, In-Sub oo, Eun-Dong Lee, and Seung-Woo Seo Abstact The dynamics of
More informationf i r e - p a r t s. c o m
A M E R I C A N F L A M E A F AF-1000 Seies Manual Gas Contol Valve APPLICATION The AF-1000 Manual Gas Contol Valve is designed fo use in gas in heath poducts, wall mount funaces, and space heating appliances.
More informationData Sheet. Linear bearings
Data Pack G Issued Septembe 1999 1502325042 Data Sheet Linea beaings Instument ball beaings and shafts The RS ange of instument quality ball bushing beaings ae fo 1 8in, 3 16in and 1 4in shafts. Each beaing
More informationTrees & Routing (1) BFS
Tees & Routing (1) BFS Why (spanning) tees? Spanning Tee Given a gaph G=(V,E), a Spanning Tee of G is an acyclic subgaph, spanning all the nodes in V. Spanning Tee Given a gaph G=(V,E), a Spanning Tee
More informationPOSSIBLE AND REAL POWERFLOWS IN CONNECTED DIFFERENTIAL GEAR DRIVES WITH η 0 <i pq <1/η 0 INNER RATIO
5th INTERNATIONAL MEETING OF TE CARPATIAN REGION SPECIALISTS IN TE FIEL OF GEARS POSSIBLE AN REAL POWERFLOWS IN CONNECTE IFFERENTIAL GEAR RIVES WIT η 0
More informationLesson 33: Horizontal & Vertical Circular Problems
Lesson 33: Hoizontal & Vetical Cicula Poblems Thee ae a wide vaiety of questions that you do if you apply you knowledge of cicula motion coectly. The tough pat is figuing out how to set them up. You need
More informationA Force Platform Free Gait Analysis
Poceedings A Foce Platfom Fee Gait Analysis Tokio Maeda 1,2, *, Tatsuo Ishizuka 3, Sakua Yamaji 4 and Yuji Ohgi 3 1 Keio Reseach Institute at SFC, 5322 Endo, Fujisawa, Kanagawa 252-0882, Japan 2 Koseki
More informationCyclostrophic Balance in Surface Gravity Waves: Essay on Coriolis Effects
Jounal of Oceanogaphy, Vol. 53, pp. 311 to 315. 1997 Shot Contibution Cyclostophic Balance in Suface Gavity Waves: Essay on Coiolis Effects KERN E. KENYON 4632 Noth Lane Del Ma, CA 92014-4134, U.S.A. (Received
More informationEC-FRM: An Erasure Coding Framework to Speed up Reads for Erasure Coded Cloud Storage Systems
215 44th Intenational Confeence on Paallel Pocessing EC-FRM: An Easue Coding Famewok to Speed up Reads fo Easue Coded Cloud Stoage Systems Yingxun Fu, Jiwu Shu *, and Zhiong Shen Tsinghua National Laboatoy
More informationAn integrated supply chain design model with random disruptions consideration
Afican Jounal of Business Management Vol. 4(1), pp. 393-401, 18 Septembe, 010 Available online at http://www.academicounals.og/ajbm ISSN 1993-833 010 Academic Jounals Full Length Reseach Pape An integated
More informationOverlap-Based Genome Assembly from Variable-Length Reads
Ovelap-aed Genome embly fom Vaiable-Length Read Joeph Hui, Ilan Shomoony, Kannan Ramchandan and Thoma. Coutade Depatment of Electical Engineeing and Compute Science, Univeity of Califonia, ekeley Email:
More informationCluster trees and message propagation
luste tees and message popagaton 371 Advanced A Tomas ngla Outlne mple gaphs: tees and polytees luste gaphs and clque tees unnng ntesecton sepsetsmessage popagaton VE Message passng VE n detal achng out-of-clque
More informationI. FORMULATION. Here, p i is the pressure in the bubble, assumed spatially uniform,
The natual fequency of oscillation of gas bubbles in tubes H. N. Og uz and A. Pospeetti Depatment of Mechanical Engineeing, The Johns Hopkins Univesity, Baltimoe, Mayland 21218 Received 28 July 1997; accepted
More informationCS 173: Discrete Structures, Spring 2010 Homework 9 Solutions
CS 173: Discrete Structures, Spring 010 Homework 9 Solutions This homework contains 5 prolems worth a total of 5 regular points. 1. Off to the races! [10 points] You decide to take in a day of races at
More informationMotivation. Prize-Collecting Steiner Tree Problem (PCSTP) Kosten und Profite. Das Fraktionale Prize-Collecting Steiner Tree Problem auf Baumgraphen
Das Faktonale Pze-Collectng Stene Tee Poblem auf Baumgaphen Motvaton Gunna W. Klau (TU Wen Ivana Ljubć (TU Wen Peta Mutzel (Un Dotmund Ulch Pfeschy (Un Gaz René Weskche (TU Wen Motvaton Modell Kosten und
More informationSHRiMP: Accurate Mapping of Short Color-space Reads
SHRiMP: Accuate Mapping of Shot Colo-space Reads Stephen M. Rumble 1,2, Phil Lacoute 3,4, Adian V. Dalca 1, Mac Fiume 1, Aend Sidow 3,4, Michael Budno 1,5 * 1 Depatment of Compute Science, Univesity of
More informationWind and extremely long bridges a challenge for computer aided design
Wind and extemely long bidges a challenge fo compute aided design oian JANJIC anaging iecto TV / entley Systems Gaz, Austia oian Janjic, bon 960, civil engineeing degee fom the Faculty of Civil Engineeing,
More informationColor Encodings: srgb and Beyond
IS&T's 2002 PICS Confeence Colo Encodings: srgb and Beyond Kevin E. Spaulding Eastman Kodak Company, Rocheste, New Yok Jack Holm Hewlett-Packad Company, Palo Alto, Califonia Abstact Most digital imaging
More informationIncorporating Location, Routing and Inventory Decisions in Dual Sales Channel - A Hybrid Genetic Approach
Incopoating Location, Routing and Inventoy Decisions in Dual Sales Channel - A Hybid Genetic Appoach Chia-lin Hsieh 1, Shu-hsien Liao 2, Wei-chung Ho 2 1 Depatment of Statistics and Actuaial Science, Aletheia
More informationTrends in Cycling, Walking & Injury Rates in New Zealand
Tends in Cycling, Walking & Injuy Rates in New Zealand Walking and cycling, minutes/week SUMMAR Estimates of walking and cycling fom 9 Household Tavel suveys in New Zealand, conducted etween 1989 and 2012,
More informationInterior Rule of the Quebec Open 2017
Inteio Rule of the Quebec Open 2017 Aticle 1. The Oganize The Oganize is the club d'échecs de Sainte-Foy which will be epesented by M Chales Tenblay, chaiman of the oganizing committee Le tounoi se déoulea
More informationOperating Instructions Compressors
MAXIMATOR HIGH PRESSURE TECHNOLOGY HYDRAULICS PNEUMATICS TESTING EQUIPMENT Opeating Instuctions Compessos issue 08.2007 MAXIMATOR GmbH Walkeniede Staße 15 D-37449 Zoge Gemany Telefon 0 55 86 / 803-0 Telefax
More informationSession 6. Global Imbalances. Growth. Macroeconomics in the Global Economy. Saving and Investment: The World Economy
Session 6. Global Imbalances. Gowth. v, and the Real Inteest Rate v Global Imbalances v Gowth v Intoduction to exchange ates and : The Wold Economy The eal inteest ate is the pice that equilibates saving
More informationPlacesForBikes City Ratings Methodology. Overall City Rating
1 PlacesFoBikes City Ratings Methodology Oveall City Rating The PlacesFoBikes City Rating Scoe is based on five factos: Rideship, Safety, Netwok, Acceleation, and Reach. Each facto is scoed on a one to
More informationTHE performance disparity between processor speed and the
This aticle has been accepted fo publication in a futue issue of this jounal, but has not been fully edited. Content may change pio to final publication., VOL. X, NO. X, MONTH X Matix Stipe Cache-Based
More informationAn Auction Based Mechanism for On-Demand Transport Services
An Auction Based Mechanism fo On-Demand Tanspot Sevices Malcolm Egan, Ni Oen and Michal Jakob Abstact Recently, a new class of tanspot sevices, exemplified by Ube and Lyft has emeged. Such sevices use
More informationDETC A NEW MODEL FOR WIND FARM LAYOUT OPTIMIZATION WITH LANDOWNER DECISIONS
Poceedings of the ASME Intenational Design Engineeing Technical Confeences& Computes and Infomation in Engineeing Confeence IDETC/CIE August 8-3,, Washington, DC, USA DETC-4777 A NEW MODEL FOR WIND FARM
More informationMODEL 1000S DIGITAL TANK GAUGE
MODEL 1000S DIGITAL TANK GAUGE Installation Guide and Manual REVISION 5.0.0 2016 Resouce Poduction Co. Inc. 700 South Tucke Avenue Famington, NM 87401 1.800.382.1482 www.advancedtelemetics.net Advanced
More informationRESOLUTION No A RESOLUTION OF THE CITY OF SALISBURY, MARYLAND AUTHORIZING THE MAYOR TO ENTER INTO AN AGREEMENT BETWEEN THE CITY OF
li RESOLUTION No. 2749 A RESOLUTION OF THE CITY OF SALISBURY, MARYLAND AUTHORIZING THE MAYOR TO ENTER INTO AN AGREEMENT BETWEEN THE CITY OF SALISBURY, MARYLAND AND WICOMICO COUNTY, MARYLAND FOR THE DELIVERY
More informationAccel. (m/s 2 ) Time (sec) Newton s 3 rd Law and Circular Motion. Group Problem 04
1) A 200 kg tuck acceleates eastwads on a hoizontal oad in esponse to a gadually inceasing fictional foce fom the gound. Thee is an unsecued 50 kg block sitting on the tuck bed line. Thee is fiction between
More informationA CONCEPTUAL WHEELED ROBOT FOR IN-PIPE INSPECTION Ioan Doroftei, Mihaita Horodinca, Emmanuel Mignon
A CONCEPTUAL WHEELED ROBOT FOR IN-PIPE INSPECTION Ioan Dooftei, Mihaita Hoodinca, Emmanuel Mignon Univesité Libe de Buxelles Active Stuctues Laboatoy 50, Av. F.D.Roosevelt, B-1050, Bussels, Belgium. Email:
More informationAlternate stable states in coupled fishery-aquaculture systems. Melissa Orobko
Altenate stable states in coupled fishey-aquacultue systems by Melissa Oobko A thesis submitted in confomity with the equiements fo the degee of Maste of Science Depatment of Ecology & Evolutionay Biology
More information"A Home for Gracious Living" (real estate brochure for Batten House)
Byn Maw College Scholaship, Reseach, and Ceative Wok at Byn Maw College Achitectue, Gounds, and Histoy Facilities 1959 "A Home fo Gacious Living" (eal estate bochue fo Batten House) Let us know how access
More informationMODELLING THE INTERACTION EFFECTS OF THE HIGH-SPEED TRAIN TRACK BRIDGE SYSTEM USING ADINA
MODELLING THE INTERACTION EFFECTS OF THE HIGH-SPEED TRAIN TRACK BRIDGE SYSTEM USING ADINA ABSTRACT Constança Rigueio Depatment of Civil Engineeing, Polytechnic Institute of Castelo Banco Potugal Calos
More informationDesign and Simulation Model for Compensated and Optimized T-junctions in Microstrip Line
Intenational Jounal of Advanced Reseach in Compute Engineeing & Technology (IJARCET) Volume 3 Issue, Decembe 4 Design and Simulation Model fo Compensated and Optimized T-junctions in Micostip Line Alok
More informationOPTIMAL SCHEDULING MODELS FOR FERRY COMPANIES UNDER ALLIANCES
Jounal of Maine Science and Technology, Vol. 15, No. 1, pp. 53-66 (2007) 53 OPTIMAL SCHEDULING MODELS FOR FERRY COMPANIES UNDER ALLIANCES Shangyao Yan*, Chia-Hung Chen**, Hsin-Yen Chen*** and Tze-Chiang
More informationReal World Search Problems. CS 331: Artificial Intelligence Uninformed Search. Simpler Search Problems. Example: Oregon. Search Problem Formulation
Real World Search Problems S 331: rtificial Intelligence Uninformed Search 1 2 Simpler Search Problems ssumptions bout Our Environment Fully Observable Deterministic Sequential Static Discrete Single-agent
More informationDiana Krall Straighten Up And Fly Right SONG TITLE: STRAIGHTEN UP AND FLY RIGHT ALBUM: STEPPING OUT RELEASED: 1993 LABEL: JUSTIN TIME GENRE: JAZZ
Diaa Kall Staighte Up Ad Fly Right SONG ILE: SRAIGHEN UP AND FLY RIGH ALBUM: SEPPING OU RELEASED: 199 LABEL: USIN IME GENRE: AZZ VOCALS AND PIANO: DIANA KRALL ACOUSIC BASS: OHN CLAYON DRUMS: EFF HAMILON
More informationTLV493D-A1B6 3D Magnetic Sensor
Low Powe with I 2 C Inteface Use Manual Aout this document Scope and pupose This document povides poduct infomation and desciptions egading: Functional desciption Calculation of the magnetic flux and tempeatues
More informationNumerical study of super-critical carbon dioxide flow in steppedstaggered
The 6th Intenational Supecitical CO2 Powe Cycles Symposium Mach 27-29, 2018, Pittsbugh, Pennsylvania Numeical study of supe-citical cabon dioxide flow in steppedstaggeed labyinth seals Yuming Zhu a,b,
More informationExample. The information set is represented by the dashed line.
Ou ast equiibium concet The ast equiibium concet we study afte Nash eqm, Subgame Pefect Nash eqm, and Bayesian Nash eqm is Pefect Bayesian Equiibium. Pefect efes to the fact that the game wi be dynamic,
More informationEcoMobility World Festival 2013 Suwon: an analysis of changes in citizens awareness and satisfaction
IOSR Jounal Engineeing (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 07, Issue 03(Mach 2017), V1 PP 40-48 www.iosjen.og EcoMobility Wold Festival 2013 Suwon: an analysis changes in citizens awaeness
More informationExperiment #10 Bio-Physics Pre-lab Questions
Expeient #10 Bio-Physics Pe-lab Questions ** Disclaie: This pe-lab is not to be copied, in whole o in pat, unless a pope efeence is ade as to the souce. (It is stongly ecoended that you use this docuent
More informationMatlab Simulink Implementation of Switched Reluctance Motor with Direct Torque Control Technique
Matlab Simulink Implementation of Switched Reluctance Moto with Diect Toque Contol Technique Vikamaajan Jambulingam Electical and Electonics Engineeing, VIT Univesity, India. Abstact - The switched eluctance
More informationSTUDY OF IRREGULAR WAVE-CURRENT-MUD INTERACTION
STUDY OF IRREGULAR WAVE-CURRENT-MUD INTERACTION Mohsen Soltanpou, Fazin Samsami, Tomoya Shibayama 3 and Sho Yamao The dissipation of egula and iegula waves on a muddy bed with the existence of following
More informationCLASS: XI: MATHEMATICS
LASS: XI: MATHEMATIS ERMUTATIONS AND OMBINATIONS RATIE QUESTIONS ON FATORIAL AND FUNDAMENTAL RINILES OF OUNTING ove the followig fo N, 1. (2 )! 2.!.[1.3.5...(2 1)] FORMULA USED Factoial otatio:! o 1.!
More informationPhase Behavior Introduction to Phase Behavior F.E. Londono M.S. Thesis (2001)
Natual Gas Engineeing Phase Behavio Intoduction to Phase Behavio F.E. Londono M.S. hesis (001).. Blasingame, exas &M U. Depatment of Petoleum Engineeing exas &M Univesity College Station, X 77843-3116
More informationBubble clustering and trapping in large vortices. Part 1: Triggered bubbly jets investigated by phase-averaging
Intenational Jounal of Multiphase Flow 33 (2007) 1088 1110 www.elsevie.com/locate/ijmulflow Bubble clusteing and tapping in lage votices. Pat 1: Tiggeed bubbly jets investigated by phase-aveaging Rade
More informationProblem Solving Agents
Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest path from one city to another 8-puzzle Problem
More informationCarnegie Mellon University Forbes Ave., Pittsburgh, PA command as a point on the road and pans the camera in
Panacea: An Active Senso Contolle fo the ALVINN Autonomous Diving System Rahul Sukthanka, Dean Pomeleau and Chales Thope Robotics Institute Canegie Mellon Univesity 5 Fobes Ave., Pittsbugh, PA 15213-3891
More informationA Deceleration Control Method of Automobile for Collision Avoidance based on Driver's Perceptual Risk
A Deceleation Contol Method of Automobile fo Collision Avoidance based on Dive's Peceptual Risk Takahio Wada, Shun ichi Doi, and Shoji Hiaoka Abstact To educe ea-end cash of automobiles, it is impotant
More informationWatford Half Marathon. Watford Half Marathon. Sunday February 4th Starting at 10.30am. Enjoy Your Run!!! Notice to all Entrants.
atfod Half Maathon 2018 Sunday Febuay 4th Stating at 1030am REF No 527 HEld UNdERUka RUlEs ORGANISED BY atfod Half Maathon Notice to all Entants elcome to the atfod Half Maathon, oganised by atfod Haies
More informationUNIVERSITÀ DEGLI STUDI DI PADOVA. Dipartimento di Scienze Economiche Marco Fanno
UNIVERSITÀ DEGLI STUDI DI PADOVA Dipatimento di Scienze Economiche Maco Fanno DUAL LICENSING IN OPEN SOURCE SOFTWARE MARKETS STEFANO COMINO Univesity of Udine FABIO M. MANENTI Univesity of Padova Januay
More informationDAM SITE 2017 STAGE 1
ELDOADO CONVENTION: ALL STAGES STAT WITH SHOOTES CHOICE OF BODY OSTUE UNLESS SECIFICALLY STATED OTHEWISE STAGE 1 2 ISTOLS IFLE SHOTGUN HOLSTEED ON EITHE ON LEFT 10 OUNDS 10 OUNDS 4+ OUNDS FIEAMS SEQUENCE:
More informationComplexity of Data Tree Patterns over XML Documents
Complexity of Dt Tee Pttens ove XML Documents Clie Dvid LIAFA, Univesity Pis 7 nd CNRS, Fnce cdvid@lifjussieuf Abstct We conside Boolen combintions of dt tee pttens s specifiction nd quey lnguge fo XML
More informationLecture 24. Wind Lidar (6) Direct Motion Detection Lidar
Lectue 24. Wind Lida (6) Diect Motion Detection Lida Diect Motion Detection Wind Lida Lida tacking of aeosol motions Lase time-of-flight velocimety Lase Dopple velocimety Compaison of wind lida techniques
More informationCheat-Proof Playout for Centralized and Distributed Online Games
Cheat-Poof Playout fo Centalized and Distibuted Online Games Nathaniel E. Baughman Bian Neil Levine baughman@cs.umass.edu bian@cs.umass.edu Depatment of Compute Science Univesity of Massachusetts Amhest,
More informationUninformed Search Strategies
Uninformed Search Strategies Instructor: Dr. Wei Ding Fall 2010 1 Uninformed Search Strategies Also called blind search. Have no additional information about states beyond that provided in the problem
More informationANALYSIS AND TESTING OF AN INTEGRATED REFRIGERATION AND STORAGE SYSTEM FOR LIQUID HYDROGEN ZERO BOIL-OFF, LIQUEFACTION, AND DENSIFICATION
ANALYSIS AND TESTING OF AN INTEGRATED REFRIGERATION AND STORAGE SYSTEM FOR LIQUID HYDROGEN ZERO BOIL-OFF, LIQUEFACTION, AND DENSIFICATION By WILLIAM USILTON NOTARDONATO A DISSERTATION PRESENTED TO THE
More informationCENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)
CENG 466 Artificial Intelligence Lecture 4 Solving Problems by Searching (II) Topics Search Categories Breadth First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening
More informationWatford Half Marathon. Watford Half Marathon. Sunday February 5th Starting at 10.30am. Enjoy Your Run!!! Notice to all Entrants.
atfod Half Maathon 2017 Sunday Febuay 5th Stating at 1030am REF No 527 HELD UNDER UKA RULES ORGANISED BY atfod Half Maathon Notice to all Entants elcome to the atfod Half Maathon, oganised by atfod Haies
More informationELDORADO 2017 STAGE 1 - DRUNK & LOUD
ELDOADO 2017 STAGE 1 - DUNK & LOUD 2 ISTOLS IFLE SHOTGUN HOLSTEED ON IN HANDS 10 OUNDS 10 OUNDS 4+ OUNDS FIEAMS SEQUENCE: SHOTGUN IFLE ISTOLS A Sheriffs work didn t always include defying death. Sometimes
More informationFire-Safety Analysis Timber. FRILO Software GmbH As of 29/06/2016
Fie-Safety nalysis Timbe FRILO Softwae GmbH www.filo.com info@filo.com s of 29/06/2016 Fie-Safety nalysis Timbe Fie-Safety nalysis Timbe This documentation efes to the fie safety veifications used in
More informationElectrical Equipment of Machine Tools
Electical Equipment of achine Tools Electification in machine tools today is vey extensive because it helps to simplify thei constuction, educe thei weight, and develop automatic contol. any advanced tends
More informationTHE IMPACTS OF CONGESTION ON COMMERCIAL VEHICLE TOUR CHARACTERISTICS AND COSTS
Figliozzi 1 THE IMPACTS OF CONGESTION ON COMMERCIAL VEHICLE TOUR CHARACTERISTICS AND COSTS Miguel Andes Figliozzi Depatment of Civil and Envionmental Engineeing Maseeh College of Engineeing and Compute
More informationThe Dockline AUGUST Board of Directors. Greetings from the Commodore. Jim Manlick
The Dockline 2018 Boad of Diectos COMMODORE - Jim Manlick jmanlick@new..com 655-1460 VICE COMMODORE - Gay Kuschel gaene@hotmail.com 619-0906 REAR COMMODORE - Jim Thompson jimtsmu@icloud.com 621-2946 FLEET
More informationOUTDOOR FOOTBALL FIELD
www integalspo com USING AREAS: Mini football fields, pivate buildings, pivate schools and pivate entepeunes. SYSTEM DESCRIPTION: Composite steel constuction with synthetic tuf floo, oof and sides coveed
More informationProblem Solving as Search - I
Problem Solving as Search - I Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Problem-Solving
More informationProject Proposal: Characterization of Tree Crown Attributes with High Resolution Fixed-Base Aerial Photography. by Rich Grotefendt and Rob Harrison
Poject Poposal: Chaacteization of Tee Cown Attibutes with High Resolution Fixed-Base Aeial Photogaphy by Rich Gotefendt and Rob Haison Funding Acknowledgments of Past Wok Pesented Alaska Depatment of Natual
More informationTECHNIQUE. Parental generation (P) Stamens Carpel 3. RESULTS First filial. offspring (F 1 )
TECHNIQUE 2 aental geneation () Stamens Capel 3 4 ESULTS Fist filial geneation offsping (F ) 5 2 EXEIMENT Geneation (tue-beeding paents) uple flowes White flowes F Geneation (hybids) All plants had puple
More informationHigh Axial Load Capacity, High speed, Long life. Spherical Roller Bearings
High Axial Load Capacity, High speed, Long life Spheical Rolle eaings Spheical Rolle eaings High axial esistance load pefomance Intenal specifications have been optimized to geatly impove axial esistance
More informationAngle-restricted Steiner arborescences for flow map layout Buchin, K.A.; Speckmann, B.; Verbeek, K.A.B.
Angle-esticted Steine aboescences fo flow ma layout Buchin, K.A.; Seckmann, B.; Vebeek, K.A.B. Published in: Abst. 27th Euoean Woksho on Comutational Geomety (EuoCG) Published: 01/01/2011 Document Vesion
More informationPerformance Characteristics of Parabolic Trough Solar Collector System for Hot Water Generation
Intenational Enegy Jounal: Vol. 7, No. 2, June 2006 137 Pefomance Chaacteistics of Paabolic Tough Sola Collecto System fo Hot Wate Geneation www.sed.ait.ac.th/eic A. Valan Aasu and T. Sonakuma Faculty
More informationRange Extension Control System for Electric Vehicles Based on Front and Rear Driving Force Distribution Considering Load Transfer
Range Extension Contol System fo Electic Vehicles Based on and Diving Foce Distibution Consideing Load Tansfe Sho Egami and Hioshi Fujimoto The Univesity of Tokyo 5--5, Kashiwanoha, Kashiwa, Chiba, 227-856
More information0ur Ref:CL/Mech/ Cal /BID-01(11-12) Date: 29 July 2011
0u Ref:CL/Mech/ Cal /BID-01(11-12) Date: 29 July 2011 SUBJECT: PROCUREMENT OF CALIBRATION SERVICES FOR THE EQUIPMENTS IN Cental Laboatoy (Mechanical) Dea Sis, Technical & Commecial s ae invited fo the
More information