A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN

Size: px
Start display at page:

Download "A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN"

Transcription

1 Ornl rtl rons o IDMME - Vrtl Conpt 2008 jn Cn Otor RNKING ROCEDURE FOR FUZZY DECISION-MKING IN RODUCT DESIGN Mro rjs r r 2 ): Déprtmnt Mtémtqs t Gén Instrl Éol olytnq Montrél C S. Cntr-vll Montrél QC) H3C37 CND E-ml: mro.rjs@polymtl. 2): CIRRELT Déprtmnt Mtémtqs t Gén Instrl Éol olytnq Montrél C S. Cntr-vll Montrél QC) H3C37 CND E-ml: r.r@polymtl. strt: T son-mkn pross s ky ss or most mntrn n srvs ornztons n orms n ssntl prt o t prot sn pross. In snrs r lwys onront wt t lmm o oosn twn rnt ltrntvs wt rnt prmtrs otn xprss n rly v trms. For ts rson mny tools v n propos orn mor n ttr wys to mprov ompny son-mkn n ts r. T rnkn o zzy nmrs s on o t most mportnt o ts tools s zzy lo s powrl pty to mn t v prmtrs slly ssot wt t xprsson o prot rqrmnts y t mn prsonlty. Improvn t ry o s tools s wy to mprov prot sn. In ts vn n xtnson o prvos lortms s propos or t rnkn pror n zzy son-mkn pross. Ts xtnson s s on rml trpzol zzy nmrs n spports rtnlr n trnlr rml zzy nmrs s wll) nst o trtonl trnlr zzy nmrs. T rnkn pror s s on t zzy prrn rlton. prot sn xmpl s prov. Ky wors: prot slton zzy rnkn zzy son-mkn zzy prrn rlton mmn stn - Introton T slton o prot or sp stomr s possl tro son-mkn pross n w t stomr vlts t vnts n svnts o prot rltv to otrs. In t s wr stomrs v sp rqrmnts t stomrs vlt t prots wt t m o ntyn t prot wt t potntl to prov t st lvl o stston. It my tt prot orrspons xtly to ts rqrmnts t my orrspon t som lvl o stston. Fzzy nmrs v t pty to rprsnt s rs o stston. O two rnt prots provn rnt r o stston t stomr slts t prot tt omnts. orn to Tsn n Kln ) mny rnkn mtos or zzy nmrs v n vlop. Howvr tos mtos t onsr mny mportnt tors s s t sp rnkn orr n rltv prrn or omnn o zzy nmrs s wll s t s o omptton o t rnkn lortm. It s tror nssry to vlop nw rt tv n nt lortm l to rnk vros sps o zzy nmrs. L 2000) onsr tt t mtos or rnkn zzy nmrs n lss nto two tors. T rst s s on zzton n t son on t zzy prrn rlton. H mntns tt oo rnkn mto sol stsy t ollown or rtr: ) zzy prrn prsntton; 2) t rtonlty o prrn orrn; 3) rostnss; n 4) ny. T lortm or t rnkn pror n t zzy son-mkn pross prsnt n ts work xtns t lortm propos y Tsn n Kln 989) w onsrs omntons o trnlr zzy nmrs. T propos xtnson ss rml trpzol zzy nmrs s nrl mol mon w rtnlr n trnlr zzy nmrs r prtlr ss. ny prws omnton o tm s spport. prot sn xmpl provs ts prormn pty n t prot sn son-mkn pross. T ppr s ornz s ollows. Ston 2 prsnts ltrtr rvw. Ston 3 srs t propos rnkn pror. Ston 4 vs n xmpl ppl to prot sn. Ston 5 onls t ppr. 2- Ltrtr rvw 2.- Fzzy lo n prot sn rot sn nvolvs vros pss lk vlton omprson n son-mkn. T pplton o zzy pr Nmr -- Copyrt o IDMME - Vrtl Conpt

2 IDMME - Vrtl Conpt 2008 Sort rtl Ttl lo troot ll ts pss mks t possl to nl mor rt rmton rlt to stomr srs. Svrl ppros mtos n mols v n propos or t prot sn pross w mr rnt zzy mols s s t zzy ol prormmn mol to trmn t lvl o llmnt o t sn rqrmnts Cn n Wn 2006) Grn Fzzy Dsn nlyss w ss zzy lo to vlt prot sn ltrntvs s on nvronmntl onsrtons n Fzzy Mlt-ttrt Dson-Mkn to slt t most srl sn ltrntv Ko t l. 2006). Sow 2006) propos mo zzy mol to oornt n l wt t tnl zzy n n-zzy sss nvolv n prot sn. Morovr t Intrnt s w n s n ts l som xmpls o w nl Sq n Nnn 2005) wo prsnt n Intrnt-s rmwork w ss rmmtl ppro to rprsnt n vlop mols o stomz prots n orr to ntrt stomr srs nto t sn o mss-stomz prots. T Intrnt s lso n ppl to vlop W-s vrtl sn nvronmnt mto w llows stomrs to prtpt n prot sn n lp snrs onvnntly jst t strtr o tr prots. Ts mto ws pls y Sn t l. 2005). Drn t lst w yrs lr nmr o pplton opportnts v ppr to tk vnt o zzy lo n t prot sn pross. It sms tt prot sn s n r wt rt potntl or t pplton o zzy lo rjs n r 2008) Fzzy son-mkn n prot sn rot sn s n nnrn pross nvolvn trtv n omplx son-mkn. It slly strts wt t ntton o n pros tro sqn o tvts to n n optml solton to t prolm n ns wt tl srpton o t prot D t l. 2005). Vros ppros v n propos or t zzy mltrtr son-mkn pross s prnplly on t zzy prrn rlton Fn t l. 2002; üyüközkn n Fyzol 2005; Işıklr n üyüközkn 2006; Zn t l. 2007). Sn n W 2006) propos n ppro or t rnkn pross s on n sy n nttv zzy smlton nlyss mto. Smlrly som zzy rnkn mtos or t son-mkn pross v n vlop. Cn n Kln 994) ppl t α-t n zzy strton oprtons to llt t r nr t nw zzy nmr. Wn n rkn 2005) prsnt tr optmzton mols to ssss t rltv mportn wts o ttrts n mltpl-ttrt son-mkn prolm. In ll ts ppros t zzy rnkn o zzy nmrs plys n mportnt rol s prt o t son-mkn pross. pplton o zzy rnkn or mlt-rtr sonmkn s n Kwkrnk 977; Cn n Kln 994). T zzy prrn rlton s n wly s or t zzy rnkn pror Dlo t l. 988; L 2000; Morrs n S-Nz 200). Otr mtos nl t pplton o sp onpts lk trnlr mmrsp ntons Cn 98) n mxmzton n mnmzton o sts Cn 985). L n Yo 2003) prsnt zzy rnkn mto or zzy nmrs w onsrs vros ntrstn ntons n ns s s t zzy stston nton t zzy vlton vl r o zzton r o vlton n t rltv nx o zzton. vl mto rportn zzy prrns n rn rton tnqs ws propos y M n L 2008). Yn 99) prsnt or rtr or vltn zzy rnkn mtos n sst n mprov rnkn mto s on zzy prrn rprsntton t rtonlty o zzy orrn stnslty n rostnss. 3- Rnkn pror n zzy son-mkn s mnton n t prvos ston t propos lortm or t rnkn pror n zzy son-mkn s n xtnson o Tsn n Kln 989) n onssts o mor nrl mol w onsrs rnt sps o zzy nmrs or rnkn. Dntons o nrn n omnn r xpln n ston 3.; ston 3.2 xplns t zzy prrn rlton; n ston 3.3 prsnts t prrn rlton lortm. 3.- Inrn n omnn Lt n two zzy nmrs w r onvx n rml zzy ssts. I n r two zzy nmrs tn tr xst two tons nrn n omnn twn t zzy nmrs. - I tr xsts n r o ovrlp twn zzy nmrs n ntrston twn n ) tn t ovrlp r s n s nrn; tt s n r nrnt to on tr n tt r. 2- I tr xst on or mor n-ovrlp rs twn zzy nmrs n tn or n-ovrlp r tr omnts or omnts. Ts tons or t nrl trpzol zzy nmrs n n sn n Fr. In s ) omnts n n s ) omnts. Cs ) sows t ton o nrn rprsnt y t ntrston r twn zzy nmrs n Rnkn mtos T rnkn o zzy nmrs orms t ss o t sonmkn pross wt zzy lo L n Yo 2003). s o t mportn n ppllty o t rnkn pross svrl mtos v n vlop nln t ) ttp:/ ) ) Fr : Domnn n nrn twn n. pr Nmr -2- Copyrt IDMME - Vrtl Conpt

3 IDMME - Vrtl Conpt 2008 Sort rtl Ttl orn to t ov ntons o nrn n omnn t n-ovrlp rs rprsnt t omnton rs or or. T omnton twn zzy nmrs s vn y t rton o n Fzzy prrn rlton I n r two zzy nmrs tn t zzy prrn rltons R ) n R ) r n s ollows: R ) R ) rs wr omnts ) + r wr n r nrnt) r o )+r o ) rs wr omnts ) + r wr n r nrnt) r o )+r o ) It s tn ovos tt R) + R) wr R ) n R ) r ntrprt s t r to w s prrr to n s prrr to rsptvly. T rs wr omnts or omnts n otn sn t Hmmn stn. Fr 2 lso sows t posslty o omprn ny prws omnton o trpzol trnlr n rtnlr zzy nmrs.. trnlr-trnlr trnlr-trpzol trnlr-rtnlr n so on). Lt n two rml trpzol zzy nmrs wr t spport o s t ntrvl ) n t spport o s t ntrvl ). T trnlr zzy nmr s prtlr s wn or or or zzy nmrs rsptvly. In t sm wy Rtnlr zzy nmrs n possl wn n or zzy nmr n wn n or zzy nmr s Fr 2). Css r pnn on t zzy nmr s llstrt n Fr 3). Tr my rnt nmrs o ponts o ntrston pnn on t rltv poston o t zzy nmrs. ll ts ss r pt n Tl. For s t s tn nssry to onsr t rlvnt rs wn omptn. Lt S n ntrvl n t rl ln R. T Hmmn stn twn two zzy nmrs n on S s tn n y wr ) D S) ) S S R D R) D ) T Hmmn stn twn zzy nmrs n s tlly t n-ovrlp r o t two nmrs; tt s t sm o t rs wr tr omnts or omnts or ot. In ts ppr t Hmmn stn s s to otn t prrn rltons twn two zzy nmrs. W llstrt ts onpt onsrn rml trpzol zzy nmrs s wll s trnlr n rtnlr zzy nmrs s Fr 2). Fr 3: Som possl ntrton ponts twn zzy nmrs rrn rlton lortm s on t ntons o omnn n nrn t ollown lortm n s to trmn prrn rlton. Stp ) Fn t r wr n r nrnt ntrston r) Stp 2) Fn t rs wr omnts Stp 3) Fn t rs wr omnts Stp 4) Fn t rs o n Stp 5) Compt t zzy prrn rltons R) n R) Fr 2: Fzzy prrn rltons or trpzol trnlr n rtnlr zzy nmrs. Lt R) t zzy prrn rlton n R ) t mmrsp nton rprsntton o R). T orrn o zzy nmrs n s n s ollows. pr Nmr -3- Copyrt IDMME - Vrtl Conpt

4 IDMME - Vrtl Conpt 2008 Sort rtl Ttl pr Nmr -4- Copyrt IDMME - Vrtl Conpt Tl : Nmr o ponts o ntrston n rltv poston o t zzy nmrs. onts o ntrston Cs sttmnt s on rml trpzol zzy nmrs I t mmrsp r R ) s rtr tn 0.5 tn t orrn s n s s prrr to or. I t mmrsp r R ) s ql to 0.5 tn t orrn o n s n s s nrnt to or ~. I t mmrsp r R ) s lss tn 0.5 tn t orrn s n s s prrr to or. To xtn t rlr ntons Tsn n Kln 989) w pply r pso-orr prrn mol or t otrnkn o t zzy nmr pror Roy n Vnk 984; Wn 997; Gr n rkn 2000; n ykozkn n Fyzol 2004). Lt t zzy prrn rlton twn two s n or rtron otn y prws omprson o ) n ) w wll sow t lnst prormn o s n rsptvly. ) n ) r rprsnt y zzy nmrs. Tr typs o prrn rlton r n n trms o t zzy prrn rltons twn two ltrntvs. C : ) ) p ) ) p Q ) ) q I wr n Q pt strt n wk prrn rsptvly n I pts nrn. T prrn trsol p n nrn trsol q n y ommon sns Roy n Vnk 984) r s to srmnt twn t nrn strt prrn n wk prrn o two ltrntvs or rtron. 4- ppltons Ston 3 provs rnkn pror n zzy sonmkn w mks t possl to trmn prrn rltons twn two rml zzy nmrs trpzol trnlr rtnlr n mx o ts). Ts ol sl n t son-mkn pross. Consr t sn o prot to stsy sp mrkt sr. ompny s mrktn prtmnt rr ot n nlyss to vlt t stomr s rqrmnts or s potntl prot. Ts nlyss provs nswrs w sr t prot s ntonlts n rtr v srptv trms or xmpl: T prot sol ml-rn on. T pr sol twn x n x 2. Most stomrs prr rtrst C to smll n rtrst C 2 to. n so on Dln wt s rmton my lt. It s somtms possl to vlt som rtr rly prsly. n vlton o t pr or xmpl s rrnt ntor o prrn wn snn t prot. It ol mor omplt wn t rtrsts r lt to vlt owvr. C ol t prpton o prot sz n C 2 prot rllty. lso t trms n smll v to n. It s sl to onsr onrs n s ss. C my onsr ptl or xmpl t prot sz s lss tn 50 mm n t wt or mtr s Fr 4).

5 IDMME - Vrtl Conpt 2008 Sort rtl Ttl C s ptl) ys 50 prot sz mm) Fr 4: Dsrt vlton or stomr rqrmnt C. Wt s t st ltrntv or t sn tm to slt n wy? Ts qstons my lt to nswr wtot n pproprt mto. Ston 3 provs ll t lmnts o s mto w s stp-y-stp ppro. For ltrntv rnkn o rtrst wll prorm. On possl zzy molln o t rtrsts or ltrntv n ltrntv 2 s prov n Fr 7 rnt sps r possl). t wt ppns t prot s 5 mm or 52 mm or 55 mm n n sp sz. Som stomrs my wlln to pt t prot wt mor zzy onrs. My s t rows to 60 mm wr n wr stomrs wll onsr t prot to smll. zzy rprsntton o t rqrmnt s tn st pt s Fr 5). C s ptl) C ltrntv ltrntv 2 ys C prot sz mm) prot sz mm) Fr 5: Fzzy vlton or stomr rqrmnt C. T sm ppls or rtron C 2. Consr or xmpl tt rtron C 2 tks t ollown sp Fr 6) vlt on [0 0] sl 0 t prot wll nvr work 0 t prot wll lwys work!). C 2 s ptl) ys prot rllty Fr 7: Fzzy molln o t prot ltrntvs. For ltrntv n rtrst C t mto onrns t rnkn o t ollown two zzy nmrs Fr 8). C s ptl) prot rllty Fr 6: Fzzy vlton or stomr rqrmnt C 2. Consr w tt tr r two ltrntvs wn snn t prot n tt t sn tm s to w on to slt. ltrntv s prot wr C s 53 mm n t s rllty C 2 o 6.5 wl ltrntv 2 s prot wt C 47 mm n rllty C 2 4 s Tl 2). Tl 2: pproxmt rtrsts o t prot ltrntvs to ompr. C sz) C 2 rllty) ltrntv 53 mm 6.5 ltrntv 2 47 mm 4 ys ltrntv Cstomr prrn prot sz mm) Fr 8: Fzzy rnkn o ltrntv or rtrst C. Dt s t stomr prrn n s ltrntv. Tn Dom ) s t r wr zzy nmr omnts zzy nmr In-) s t r o nrn twn n r) s t r o zzy nmr n r) s t r o zzy nmr. To otn t zzy prrn rlton ston 3.2) w n: Dom ) 0 pr Nmr -5- Copyrt IDMME - Vrtl Conpt

6 IDMME - Vrtl Conpt 2008 Sort rtl Ttl In-) r) 55 r) 30 Tn: R ) For ltrntv 2 n rtrst C t sm ppls: Dom ).5 In-) 30 r) 55 r) 30 Tn: R ) For ltrntv n rtrst C 2 w otn: Dom ).7500 In-) 3.5 r) 5.5 r) 3.5 Tn: R ) For ltrntv 2 n rtrst C 2 w otn: Dom ) In-) r) 5.5 r) 3.5 Tn: R ) Tl 3 smmrzs tos rslts. Tl 3: Comprtv zzy prrns.. C sz) C2 rllty) ltrntv ltrntv I rtrst o n ltrntv mts t stomr rqrmnt xtly w wll v: r) r) In-) n Dom ) 0 Tn: R ) 0.5. For rtrst t st ltrntv s tn t on losst to 0.5. Tl 4: Evlton o t st ltrntv or rtrst. C sz) C 2 rllty) ltrntv ltrntv Tl 4 sows tt or t rst rtrst C ) ltrntv 2 s t st o. For t son rtrst C 2 ) ltrntv s t st o. t ts pont t s t possl to trmn t st ltrntv. T sn tm s to prortz rtrsts C n C 2. Consr t ollows wt o mportn w ) or rtrst: w 0.4 or rtrst C w or rtrst C 2 Tn t wt vr or ltrntv s s ollows: R n j j n R ) * w w For ltrntv : R [0.336) 0.4) ) 0.6)]/ ) For ltrntv 2: R 2 [0.3706) 0.4) ) 0.6)]/ ) Ts s to ompr to 0.5. W n w nlly onl tt ltrntv s ttr tn ltrntv 2 or mtn t stomr rqrmnt. 5- Conlsons In ts ppr xtn sop or t rnkn pror s n propos s on t zzy prrn rlton n t zzy son-mkn pross. n xmpl o ow prot sn son s r sows ts ppllty to t solton o rl prolms. Wt or pror t s possl to otn t prrn rlton strt wk or nrn) or ny prws omnton o rml zzy nmrs. For t prot sn pross ts ontrton s ly mportnt s mny prmtrs rom rl ppltons r t strt n molln wt zzy nmrs w r l to rprsnt v prmtrs s xprss y mn) wll nr t son-mkn pross. Ts powrl pty s rtl spt o prot sn w ol snntly mprov t sn pross. T xmpl prov sows possl pplton wr rnt prot ltrntvs r ompr wr t prmtrs r vlt wt v prmtrs or prmtrs xprss n t orm o prrns). Evn wt mltpl vrls n rnt prrn rltons or vros prmtrs t mtooloy s l to pont to t st omproms. tr xtnson o or rslt r wll rss prot onrton n t sn o prot mls. 6- kwlmnts Ts rsr s n spport y nn rom t Ntrl Sns n Ennrn Rsr Conl o Cn NSERC) n y t Fons Qééos l Rr sr l Ntr t ls Tlos FQRNT). 7- Rrns [K] s S. M. n Kwkrnk H. 977). Rtn n rnkn o mltpl-spt ltrntvs sn zzy sts tomt pr Nmr -6- Copyrt IDMME - Vrtl Conpt

7 IDMME - Vrtl Conpt 2008 Sort rtl Ttl [] rjs M. n r. 2008). T s o zzy lo n prot mly vlopmnt: ltrtr rvw n opportnts smtt. [F] üyüközkn G. n Fyzoğl O. 2004). zzylo-s son-mkn ppro or nw prot vlopmnt Intrntonl Jornl o roton Eoms [F2] üyüközkn G. n Fyzol O. 2005). Grop son mkn to ttr rspon stomr ns n sotwr vlopmnt. Comptrs & Instrl Ennrn [C] Cn W. 98). Rnkn o zzy tlts wt trnlr mmrsp ntons ro. Intrntonl Conrn on oly nlyss n Irmton Systms [CK] Cn C.-. n Kln C. M. 994). Fzzy Rnkn Mtos or Mlt-ttrt Dson Mkn. IEEE Con. on SMC Sn nto US [CW] Cn L. H. n Wn M. C. 2006). n vlton ppro to nnrn sn n QFD prosss sn zzy ol prormmn mols. Eropn Jornl o Oprtonl Rsr [C2] Cn S. 985). Rnkn zzy nmrs wt mxmzn st n mnmzn st Fzzy Sts n Systms [DO] D E.. Ostros E. Frny M. n Gor M. 2005). Conrl prot sn sn mltpl zzy mols. Jornl o Ennrn Dsn [DV] Dlo M. Vry J. L. n Vl M.. 988). pror or rnkn zzy nmrs sn zzy rltons Fzzy Sts n Systms [FM] Fn Z.-. M J. n Zn Q. 2002). n ppro to mltpl ttrt son mkn s on zzy prrn rmton on ltrntvs. Fzzy Sts n Systms [G] Günör Z. n rkn F. 2000). zzy otrnkn mto n nry poly plnnn. Fzzy Sts n Systms [I] Işıklr G. n üyüközkn G. 2006). Usn mltrtr son mkn ppro to vlt mol pon ltrntvs. Comptr Stnrs & Intrs [KC] Ko T. C. Cn S.-H. n Hn S. H. 2006). Envronmntlly onsos sn y sn zzy mltttrt son-mkn. Intrntonl Jornl o vn Mntrn Tloy [L] L H. S. 2000). nw zzy rnkn mto s on zzy prrn Rlton IEEE Intrntonl Conrn on Systms [LY] L J.-H. n Yo K.-H. 2003). zzy Rnkn Mto or Fzzy Nmrs IEICE Trns Fnmntls E [ML] M L.-C. n L H.-L. 2008). zzy rnkn mto wt rn rton tnqs Eropn Jornl o Oprtonl Rsr [MS] Morrs M. n S-Nz S. 200). Rnkn zzy nmrs y prrn rto Fzzy sts n Systms [RV] Roy. n Vnk. 984). Rltonl Systms o rrns wt On or Mor so-crtr: Som Nw Conpts n Rslts. Mnmnt Sn [S] Sow G. 2006). Dssson o t sn plosopy n mo n-xprt zzy st mol or ttr prot sn. Jornl o Ennrn Dsn [SZ] Sn L. Zo Z. L M. Zo W. L Y. W M. n Zn J. J. 2005). Costmr ornt vrtl ooprtv prot sn. 9t Intrntonl Conrn on Comptr Spport Cooprtv Work n Dsn IEEE [SN] Sq Z. n Nnn J ). rmmtl ppro to spport rl-tm sn o stomz prots. DETC2005: SME Intrntonl Dsn Ennrn Tnl Conrns n Comptrs n Irmton n Ennrn Conrn Lon C Unt Stts: mrn Soty o Mnl Ennrs Nw York NY. DETC [SW] Sn H. n W J. 2006). nw ppro or rnkn zzy nmrs s on zzy smlton nlyss mto ppl Mtmts n Comptton [TK] Tsn T..Y. n Kln C. M. 988). srvy n omprtv sty o rnkn prors n zzy son mkn: Dpt. In. En. Unv. Mssor-Colm Workn pr [TK2] Tsn T. Y. n Kln C. M. 989). Nw lortm or t rnkn pror n zzy son mkn IEEE Trnston Systms Mn n Cyrnts [W] Wn J. 997). zzy otrnkn mto or onptl sn vlton. Intrntonl Jornl o roton Rsr [W] Wn Y.-M. rkn D. 2005). Mltpl ttrt son mkn s on zzy prrn rmton on ltrntvs: Rnkn n wtn. Fzzy Sts n Systms [Y] Yn Y. 99). Crtr or vltn zzy rnkn mtos Fzzy Sts n Systms [ZW] Zn Q. Wn Y. n Yn Y. 2007). Fzzy mltpl ttrt son mkn wt t typs o prrn rmton on ltrntvs. IEEE Symposm on Compttonl Intlln n Mltrtr Dson Mkn. MCDM pr Nmr -7- Copyrt IDMME - Vrtl Conpt

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017 Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling. Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson

More information

The University of Sydney MATH 2009

The University of Sydney MATH 2009 T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted Graphs. Weighted graphs may be either directed or undirected. 1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.

More information

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1 Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst

More information

In which direction do compass needles always align? Why?

In which direction do compass needles always align? Why? AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),

More information

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol

More information

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F

More information

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp

More information

Graph Search (6A) Young Won Lim 5/18/18

Graph Search (6A) Young Won Lim 5/18/18 Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

Strongly connected components. Finding strongly-connected components

Strongly connected components. Finding strongly-connected components Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton

More information

Isomorphism In Kinematic Chains

Isomorphism In Kinematic Chains Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,

More information

d e c b a d c b a d e c b a a c a d c c e b

d e c b a d c b a d e c b a a c a d c c e b FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count

More information

A Simple Method for Identifying Compelled Edges in DAGs

A Simple Method for Identifying Compelled Edges in DAGs A Smpl Mto or Intyn Compll Es n DAGs S.K.M. Won n D. Wu Dprtmnt o Computr Sn Unvrsty o Rn Rn Ssktwn Cn S4S 0A2 Eml: {won, nwu}@s.urn. Astrt Intyn ompll s s mportnt n lrnn t strutur (.., t DAG) o Bysn ntwork.

More information

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn

More information

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our

More information

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00

More information

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l

More information

2 Trees and Their Applications

2 Trees and Their Applications Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not

More information

CSE 332. Data Structures and Parallelism

CSE 332. Data Structures and Parallelism Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,

More information

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

n r t d n :4 T P bl D n, l d t z d   th tr t. r pd l n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R

More information

Planar convex hulls (I)

Planar convex hulls (I) Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu

More information

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.

More information

PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n

PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n R P RT F TH PR D NT N N TR T F R N V R T F NN T V D 0 0 : R PR P R JT..P.. D 2 PR L 8 8 J PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D.. 20 00 D r r. Pr d nt: n J n r f th r d t r v th

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query Intrntonl Journl o Appl Ennrn Rsr ISSN 973-4562 Volum 13, Numr 2 (218) pp. 1496-15 An Applton to Sr or H-Prorty Wr Opponnt n Sptl Gms Usn Qury Jonwn Km Smt Lrl Arts Coll, Smyook Unvrsty, 815 Hwrn-ro, Nowon-u,

More information

D t r l f r th n t d t t pr p r d b th t ff f th l t tt n N tr t n nd H n N d, n t d t t n t. n t d t t. h n t n :.. vt. Pr nt. ff.,. http://hdl.handle.net/2027/uiug.30112023368936 P bl D n, l d t z d

More information

22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r n. H v v d n f

22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r n. H v v d n f n r t d n 20 2 : 6 T P bl D n, l d t z d http:.h th tr t. r pd l 22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r

More information

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r n r t d n 20 22 0: T P bl D n, l d t z d http:.h th tr t. r pd l 0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n.

More information

,. *â â > V>V. â ND * 828.

,. *â â > V>V. â ND * 828. BL D,. *â â > V>V Z V L. XX. J N R â J N, 828. LL BL D, D NB R H â ND T. D LL, TR ND, L ND N. * 828. n r t d n 20 2 2 0 : 0 T http: hdl.h ndl.n t 202 dp. 0 02802 68 Th N : l nd r.. N > R, L X. Fn r f,

More information

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd n r t d n 20 20 0 : 0 T P bl D n, l d t z d http:.h th tr t. r pd l 4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n,

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram Fractions Overview: Students will analyze standard and nonstandard ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms

More information

Humanistic, and Particularly Classical, Studies as a Preparation for the Law

Humanistic, and Particularly Classical, Studies as a Preparation for the Law University of Michigan Law School University of Michigan Law School Scholarship Repository Articles Faculty Scholarship 1907 Humanistic, and Particularly Classical, Studies as a Preparation for the Law

More information

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th n r t d n 20 2 :24 T P bl D n, l d t z d http:.h th tr t. r pd l 4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n

More information

Applications of trees

Applications of trees Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton

More information

Graphs Depth First Search

Graphs Depth First Search Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro

More information

l f t n nd bj t nd x f r t l n nd rr n n th b nd p phl t f l br r. D, lv l, 8. h r t,., 8 6. http://hdl.handle.net/2027/miun.aey7382.0001.001 P bl D n http://www.hathitrust.org/access_use#pd Th r n th

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017 COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts

More information

FL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee.

FL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee. B Pror NTERV FL/VAL ~RA1::1 1 21,, 1989 i n or Socil,, fir ll, Pror Fr rcru Sy Ar you lir SDC? Y, om um SM: corr n 'd m vry ummr yr. Now, y n y, f pr my ry for ummr my 1 yr Un So vr ummr cour d rr o l

More information

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v ll f x, h v nd d pr v n t fr tf l t th f nt r n r

More information

A Ranking Approach for Intuitionistic Fuzzy Numbers and its Application

A Ranking Approach for Intuitionistic Fuzzy Numbers and its Application Rnng pproh for Inttonst Fzzy mrs n ts pplton mt Kmr Mnot Kr * Shool of Mthmts n Comptr ppltons Thpr Unvrsty Ptl-7 In *mnot.thprn@gml.om BSTRCT To th st of or nolg vry f mthos hv n propos n prvos sts for

More information

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,

More information

H NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f

More information

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4 Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,

More information

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

MATERIAL SEE BOM ANGLES = 2 FINISH N/A 9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN

More information

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2 AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.

More information

Dental PBRN Study: Reasons for replacement or repair of dental restorations

Dental PBRN Study: Reasons for replacement or repair of dental restorations Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You

More information

PRECAST APPROACH SLAB NOTES

PRECAST APPROACH SLAB NOTES ULNS TS ULN RWNS RPRSNT TYPL TLS OR T SN N TLN O PRST PPRO SLS. TS STS R NLU TO PROV N XMPL O T RTN LYOUT O TYPL PRST PPRO SL. TWO RNT PPRO SL SYSTMS R SOWN: SUR PPRO SLS: SLS TT R PL WT T TOP SUR T OR

More information

Determination of slot leakage inductance for three-phase induction motor winding using an analytical method

Determination of slot leakage inductance for three-phase induction motor winding using an analytical method ACHIVES OF EECTICA EGIEEIG VO 6 pp 569-59 DOI 78/--6 Dtnton of ot ntn fo t-p nton oto wnn n n nt to JA STASZAK Dptnt of Et Mn n Mton St K Unvt of Tnoo Tą PP 7 K Pon -: j@tp v: v: 5 Att: T t nto o pon fo

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

n

n p l p bl t n t t f Fl r d, D p rt nt f N t r l R r, D v n f nt r r R r, B r f l. n.24 80 T ll h, Fl. : Fl r d D p rt nt f N t r l R r, B r f l, 86. http://hdl.handle.net/2027/mdp.39015007497111 r t v n

More information

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm

More information

Computer Graphics. Viewing & Projections

Computer Graphics. Viewing & Projections Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Priority Search Trees - Part I

Priority Search Trees - Part I .S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal

More information

An action with positive kinetic energy term for general relativity. T. Mei

An action with positive kinetic energy term for general relativity. T. Mei An ton wt post nt ny t fo n tty T (Dptnt of Jon Cnt Cn o Unsty Wn H PRO Pop s Rp of Cn E-: to@nn tow@pwn ) Astt: At fst w stt so sts n X: 7769 n tn sn post nt ny oont onton n y X: 7769 w psnt n ton wt

More information

Lecture II: Minimium Spanning Tree Algorithms

Lecture II: Minimium Spanning Tree Algorithms Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s

More information

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks. Saeedeh Javanmardi 1, Ahmad Makui 2.

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks. Saeedeh Javanmardi 1, Ahmad Makui 2. Journl of Inustrl n Systms Engnrng Vol., No., pp Summr 00 Mult Otv Grp Bs Mol for nlyzng Survvlty of Vulnrl Ntworks S Jvnmr, m Mku Dprtmnt of Inustrl Engnrng, Irn Unvrsty of Sn n Tnology, Trn, Irn mku@ust..r

More information

N V R T F L F RN P BL T N B ll t n f th D p rt nt f l V l., N., pp NDR. L N, d t r T N P F F L T RTL FR R N. B. P. H. Th t t d n t r n h r d r

N V R T F L F RN P BL T N B ll t n f th D p rt nt f l V l., N., pp NDR. L N, d t r T N P F F L T RTL FR R N. B. P. H. Th t t d n t r n h r d r n r t d n 20 2 04 2 :0 T http: hdl.h ndl.n t 202 dp. 0 02 000 N V R T F L F RN P BL T N B ll t n f th D p rt nt f l V l., N., pp. 2 24. NDR. L N, d t r T N P F F L T RTL FR R N. B. P. H. Th t t d n t r

More information

DOCUMENT STATUS: RELEASE

DOCUMENT STATUS: RELEASE RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,

More information

ELECTRONIC SUPPLEMENTARY INFORMATION

ELECTRONIC SUPPLEMENTARY INFORMATION Elctronc Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Socty o Cmstry 2015 ELECTRONIC SUPPLEMENTARY INFORMATION Poly(lyln tcont)s An ntrstn clss o polystrs wt proclly loct xo-cn oul ons suscptl

More information

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY RVSON STORY RV T SRPTON O Y //0 RLS OR PROUTON T LN MR ----- L /0/0 UPT SN N OMPONNTS US: S 3-03 (*N TWO PLS ONLY) WS 3-5, PRT 3-00 TO SSMLY. T OLLOWN UPT: 3-30, 3-403, 3-403, 3-40, 3-45, 3-4, 3-5. 30

More information

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010 Pylont Tr Inrns Usn Qurtt Splts By Kvn Ml Htok Blor o Sn Lnor-Ryn Unvrsty 2010 Sumtt n Prtl Fulllmnt o t Rqurmnts or t Dr o Mstr o Sn n Mtmts Coll o Arts n Sns Unvrsty o Sout Croln 2012 Apt y: Év Czrk,

More information

Th pr nt n f r n th f ft nth nt r b R b rt Pr t r. Pr t r, R b rt, b. 868. xf rd : Pr nt d f r th B bl r ph l t t th xf rd n v r t Pr, 00. http://hdl.handle.net/2027/nyp.33433006349173 P bl D n n th n

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,

More information

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC Olvr Lrtllot Unvrsty o Jyväskylä Dprtmnt o Mus ABSTRACT In ts ppr, w prsnt n nt mol or sovrn rpt pttrns

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V,  = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =? xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Beyond the Quadratic Equations and the N-D Newton-Raphson Method

Beyond the Quadratic Equations and the N-D Newton-Raphson Method IOSR Jornl o Mthmts (IOSR-JM) -ISSN: - p-issn: 9-X. Volm Iss Vr. IV (Jl. - A.) PP - www.osrjornls.or Bon th Qrt Eqtons n th N-D Nwton-Rphson Mtho Wn Opornprsrt (Dprtmnt o Cl Ennrn Coll o Ennrn/ Rnst Unrst

More information

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview:

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview: Introuton to ourr opts Ttbook: Goon (ptrs -) Ovrv: nr n nvrnt ssts T ourr trnsor Slr rton rsnl n runor pprotons. . nr ssts n ourr trnsor tutorl (rnr) sst onnts n nput to n output su tt: It s s to b lnr

More information

828.^ 2 F r, Br n, nd t h. n, v n lth h th n l nd h d n r d t n v l l n th f v r x t p th l ft. n ll n n n f lt ll th t p n nt r f d pp nt nt nd, th t

828.^ 2 F r, Br n, nd t h. n, v n lth h th n l nd h d n r d t n v l l n th f v r x t p th l ft. n ll n n n f lt ll th t p n nt r f d pp nt nt nd, th t 2Â F b. Th h ph rd l nd r. l X. TH H PH RD L ND R. L X. F r, Br n, nd t h. B th ttr h ph rd. n th l f p t r l l nd, t t d t, n n t n, nt r rl r th n th n r l t f th f th th r l, nd d r b t t f nn r r pr

More information

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)

More information

Colby College Catalogue

Colby College Catalogue Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1871 Colby College Catalogue 1871-1872 Colby College Follow this and additional works at: http://digitalcommonscolbyedu/catalogs

More information

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL...

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL... Eltron Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Soty o Cmstry 2015 Polymr Cmstry RSCPulsng Supportng Inormton Nw Bomtrls rom Rnwl Rsours - Amppl Blo Copolymrs rom δ-dlton Kulp K. Bnsl,

More information

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n

More information

Colby College Catalogue

Colby College Catalogue Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1866 Colby College Catalogue 1866-1867 Colby College Follow this and additional works at: http://digitalcommons.colby.edu/catalogs

More information

A ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV

A ' / 1 6  5 ' / 4  A4.2 48' - 0 3 12' - 7 13' - 11 10' - 0 9' - 0 2' - 6 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV 4. 4. 4. K ' - / " ' - / 4 " 0 ' - / " ' - 0 " ' - 0 " ' - / " 4 ' - 0 " 4. M U PPR 48' - 0" ' - ' - " 0' - 0" ' - 0" ' - ". : WOM ' - 0 " OT: PROV URROU TR OUT SVS OR UTUR SP UTTY T OR QUSTR MPUS OTO

More information

(4, 2)-choosability of planar graphs with forbidden structures

(4, 2)-choosability of planar graphs with forbidden structures (4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All

More information

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË CHELOURANYAN CALENDAR FOR YEAR YEAR OF SAI RHAVË I tou woust n unon wt our Motr, now tt tou st nvr t Hr. I tou woust sp t v o mttr, now tt tr s no mttr n no v. ~Cry Mry KEY TO CALENDAR T Dys o t W In t

More information

An Introduction to Clique Minimal Separator Decomposition

An Introduction to Clique Minimal Separator Decomposition Alortms 2010, 3, 197-215; o:10.3390/3020197 Rvw OPEN ACCESS lortms ISSN 1999-4893 www.mp.om/ournl/lortms An Introuton to Clqu Mnml Sprtor Domposton Ann Brry 1,, Romn Poorln 1 n Gnvèv Smont 2 1 LIMOS UMR

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

T h e C S E T I P r o j e c t

T h e C S E T I P r o j e c t T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T

More information